Sorting permutations by prefix and suffix rearrangements.

Science.gov (United States)

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.

EPC: A Provably Secure Permutation Based Compression Function

DEFF Research Database (Denmark)

Bagheri, Nasour; Gauravaram, Praveen; Naderi, Majid

2010-01-01

The security of permutation-based hash functions in the ideal permutation model has been studied when the input-length of compression function is larger than the input-length of the permutation function. In this paper, we consider permutation based compression functions that have input lengths sh...

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

Science.gov (United States)

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

1-Colored Archetypal Permutations and Strings of Degree n

Directory of Open Access Journals (Sweden)

Gheorghe Eduard Tara

2012-10-01

Full Text Available New notions related to permutations are introduced here. We present the string of a 1-colored permutation as a closed planar curve, the fundamental 1-colored permutation as an equivalence class related to the equivalence in strings of the 1-colored permutations. We give formulas for the number of the 1-colored archetypal permutations of degree n. We establish an algorithm to identify the 1- colored archetypal permutations of degree n and we present the atlas of the 1-colored archetypal strings of degree n, n ≤ 7, based on this algorithm.

Finite Cycle Gibbs Measures on Permutations of

Science.gov (United States)

Armendáriz, Inés; Ferrari, Pablo A.; Groisman, Pablo; Leonardi, Florencia

2015-03-01

We consider Gibbs distributions on the set of permutations of associated to the Hamiltonian , where is a permutation and is a strictly convex potential. Call finite-cycle those permutations composed by finite cycles only. We give conditions on ensuring that for large enough temperature there exists a unique infinite volume ergodic Gibbs measure concentrating mass on finite-cycle permutations; this measure is equal to the thermodynamic limit of the specifications with identity boundary conditions. We construct as the unique invariant measure of a Markov process on the set of finite-cycle permutations that can be seen as a loss-network, a continuous-time birth and death process of cycles interacting by exclusion, an approach proposed by Fernández, Ferrari and Garcia. Define as the shift permutation . In the Gaussian case , we show that for each , given by is an ergodic Gibbs measure equal to the thermodynamic limit of the specifications with boundary conditions. For a general potential , we prove the existence of Gibbs measures when is bigger than some -dependent value.

Tensor Permutation Matrices in Finite Dimensions

OpenAIRE

Christian, Rakotonirina

2005-01-01

We have generalised the properties with the tensor product, of one 4x4 matrix which is a permutation matrix, and we call a tensor commutation matrix. Tensor commutation matrices can be constructed with or without calculus. A formula allows us to construct a tensor permutation matrix, which is a generalisation of tensor commutation matrix, has been established. The expression of an element of a tensor commutation matrix has been generalised in the case of any element of a tensor permutation ma...

A Symmetric Chaos-Based Image Cipher with an Improved Bit-Level Permutation Strategy

Directory of Open Access Journals (Sweden)

Chong Fu

2014-02-01

Full Text Available Very recently, several chaos-based image ciphers using a bit-level permutation have been suggested and shown promising results. Due to the diffusion effect introduced in the permutation stage, the workload of the time-consuming diffusion stage is reduced, and hence the performance of the cryptosystem is improved. In this paper, a symmetric chaos-based image cipher with a 3D cat map-based spatial bit-level permutation strategy is proposed. Compared with those recently proposed bit-level permutation methods, the diffusion effect of the new method is superior as the bits are shuffled among different bit-planes rather than within the same bit-plane. Moreover, the diffusion key stream extracted from hyperchaotic system is related to both the secret key and the plain image, which enhances the security against known/chosen plaintext attack. Extensive security analysis has been performed on the proposed scheme, including the most important ones like key space analysis, key sensitivity analysis, plaintext sensitivity analysis and various statistical analyses, which has demonstrated the satisfactory security of the proposed scheme

A novel chaos-based image encryption scheme with an efficient permutation-diffusion mechanism

Science.gov (United States)

Ye, Ruisong

2011-10-01

This paper proposes a novel chaos-based image encryption scheme with an efficient permutation-diffusion mechanism, in which permuting the positions of image pixels incorporates with changing the gray values of image pixels to confuse the relationship between cipher-image and plain-image. In the permutation process, a generalized Arnold map is utilized to generate one chaotic orbit used to get two index order sequences for the permutation of image pixel positions; in the diffusion process, a generalized Arnold map and a generalized Bernoulli shift map are employed to yield two pseudo-random gray value sequences for a two-way diffusion of gray values. The yielded gray value sequences are not only sensitive to the control parameters and initial conditions of the considered chaotic maps, but also strongly depend on the plain-image processed, therefore the proposed scheme can resist statistical attack, differential attack, known-plaintext as well as chosen-plaintext attack. Experimental results are carried out with detailed analysis to demonstrate that the proposed image encryption scheme possesses large key space to resist brute-force attack as well.

Magic informationally complete POVMs with permutations

Science.gov (United States)

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.

Sorting signed permutations by short operations.

Science.gov (United States)

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

Permutation parity machines for neural synchronization

International Nuclear Information System (INIS)

Reyes, O M; Kopitzke, I; Zimmermann, K-H

2009-01-01

Synchronization of neural networks has been studied in recent years as an alternative to cryptographic applications such as the realization of symmetric key exchange protocols. This paper presents a first view of the so-called permutation parity machine, an artificial neural network proposed as a binary variant of the tree parity machine. The dynamics of the synchronization process by mutual learning between permutation parity machines is analytically studied and the results are compared with those of tree parity machines. It will turn out that for neural synchronization, permutation parity machines form a viable alternative to tree parity machines

Analyzing Permutations for AES-like Ciphers: Understanding ShiftRows

DEFF Research Database (Denmark)

Beierle, Christof; Jovanovic, Philipp; Lauridsen, Martin Mehl

2015-01-01

Designing block ciphers and hash functions in a manner that resemble the AES in many aspects has been very popular since Rijndael was adopted as the Advanced Encryption Standard. However, in sharp contrast to the MixColumns operation, the security implications of the way the state is permuted...... by the operation resembling ShiftRows has never been studied in depth. Here, we provide the first structured study of the influence of ShiftRows-like operations, or more generally, word-wise permutations, in AES-like ciphers with respect to diffusion properties and resistance towards differential- and linear...... normal form. Using a mixed-integer linear programming approach, we obtain optimal parameters for a wide range of AES-like ciphers, and show improvements on parameters for Rijndael-192, Rijndael-256, PRIMATEs-80 and Prøst-128. As a separate result, we show for specific cases of the state geometry...

A transposase strategy for creating libraries of circularly permuted proteins.

Science.gov (United States)

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 Comparison of Multiscale Permutation Entropy Measures in On-Line Depth of Anesthesia Monitoring.

Science.gov (United States)

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

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

Energy Technology Data Exchange (ETDEWEB)

Luo, Junjie; Wu, Xin; Huang, Guoqing [Department of Physics and Institute of Astronomy, Nanchang University, Nanchang 330031 (China); Liu, Fuyao, E-mail: xwu@ncu.edu.cn [School of Fundamental Studies, Shanghai University of Engineering Science, Shanghai 201620 (China)

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

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

Science.gov (United States)

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

2017-08-07

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.

Defects and permutation branes in the Liouville field theory

DEFF Research Database (Denmark)

Sarkissian, Gor

2009-01-01

The defects and permutation branes for the Liouville field theory are considered. By exploiting cluster condition, equations satisfied by permutation branes and defects reflection amplitudes are obtained. It is shown that two types of solutions exist, discrete and continuous families.......The defects and permutation branes for the Liouville field theory are considered. By exploiting cluster condition, equations satisfied by permutation branes and defects reflection amplitudes are obtained. It is shown that two types of solutions exist, discrete and continuous families....

Permutation entropy and statistical complexity in characterising low-aspect-ratio reversed-field pinch plasma

International Nuclear Information System (INIS)

Onchi, T; Fujisawa, A; Sanpei, A; Himura, H; Masamune, S

2017-01-01

Permutation entropy and statistical complexity are measures for complex time series. The Bandt–Pompe methodology evaluates probability distribution using permutation. The method is robust and effective to quantify information of time series data. Statistical complexity is the product of Jensen–Shannon divergence and permutation entropy. These physical parameters are introduced to analyse time series of emission and magnetic fluctuations in low-aspect-ratio reversed-field pinch (RFP) plasma. The observed time-series data aggregates in a region of the plane, the so-called C – H plane, determined by entropy versus complexity. The C – H plane is a representation space used for distinguishing periodic, chaos, stochastic and noisy processes of time series data. The characteristics of the emissions and magnetic fluctuation change under different RFP-plasma conditions. The statistical complexities of soft x-ray emissions and magnetic fluctuations depend on the relationships between reversal and pinch parameters. (paper)

Permutation parity machines for neural cryptography.

Science.gov (United States)

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.

Permutation parity machines for neural cryptography

International Nuclear Information System (INIS)

Reyes, Oscar Mauricio; Zimmermann, Karl-Heinz

2010-01-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.

Coexpression of Human α- and Circularly Permuted β-Globins Yields a Hemoglobin with Normal R State but Modified T State Properties†

Science.gov (United States)

Asmundson, Anna L.; Taber, Alexandria M.; van der Walde, Adella; Lin, Danielle H.; Olson, John S.; Anthony-Cahill, Spencer J.

2009-01-01

For the first time, a circularly permuted human β-globin (cpβ) has been coexpressed with human α-globin in bacterial cells and shown to associate to form α-cpβ hemoglobin in solution. Flash photolysis studies of α-cpβ show markedly biphasic CO and O2 kinetics with the amplitudes for the fast association phases being dominant due the presence of large amounts of high-affinity liganded hemoglobin dimers. Extensive dimerization of liganded but not deoxygenated α-cpβ was observed by gel chromatography. The rate constants for O2 and CO binding to the R state forms of α-cpβ are almost identical to those of native HbA (k′R(CO) ≈ 5.0 μM−1 s−1; k′R(O2) ≈ 50 μM−1 s−1), and the rate of O2 dissociation from fully oxygenated α-cpβ is also very similar to that observed for HbA (kR(O2) ≈ 21–28 s−1). When the equilibrium deoxyHb form of α-cpβ is reacted with CO in rapid mixing experiments, the observed time courses are monophasic and the observed bimolecular association rate constant is ∼1.0 μM−1 s−1, which is intermediate between the R state rate measured in partial photolysis experiments (∼5 μM−1 s−1) and that observed for T state deoxyHbA (k′T(CO) ≈ 0.1 to 0.2 μM−1 s−1). Thus the deoxygenated permutated β subunits generate an intermediate, higher affinity, deoxyHb quaternary state. This conclusion is supported by equilibrium oxygen binding measurements in which α-cpβ exhibits a P50 of ∼1.5 mmHg and a low n-value (∼1.3) at pH 7, 20 °C, compared to 8.5 mmHg and n ≈ 2.8 for native HbA under identical, dilute conditions. PMID:19397368

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

Science.gov (United States)

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.

A chronicle of permutation statistical methods 1920–2000, and beyond

CERN Document Server

Berry, Kenneth J; Mielke Jr , Paul W

2014-01-01

The focus of this book is on the birth and historical development of permutation statistical methods from the early 1920s to the near present. Beginning with the seminal contributions of R.A. Fisher, E.J.G. Pitman, and others in the 1920s and 1930s, permutation statistical methods were initially introduced to validate the assumptions of classical statistical methods. Permutation methods have advantages over classical methods in that they are optimal for small data sets and non-random samples, are data-dependent, and are free of distributional assumptions. Permutation probability values may be exact, or estimated via moment- or resampling-approximation procedures. Because permutation methods are inherently computationally-intensive, the evolution of computers and computing technology that made modern permutation methods possible accompanies the historical narrative. Permutation analogs of many well-known statistical tests are presented in a historical context, including multiple correlation and regression, ana...

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

Science.gov (United States)

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.

Optimal control of hybrid qubits: Implementing the quantum permutation algorithm

Science.gov (United States)

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.

A permutationally invariant full-dimensional ab initio potential energy surface for the abstraction and exchange channels of the H + CH4 system

International Nuclear Information System (INIS)

Li, Jun; Chen, Jun; Zhao, Zhiqiang; Zhang, Dong H.; Xie, Daiqian; Guo, Hua

2015-01-01

We report a permutationally invariant global potential energy surface (PES) for the H + CH 4 system based on ∼63 000 data points calculated at a high ab initio level (UCCSD(T)-F12a/AVTZ) using the recently proposed permutation invariant polynomial-neural network method. The small fitting error (5.1 meV) indicates a faithful representation of the ab initio points over a large configuration space. The rate coefficients calculated on the PES using tunneling corrected transition-state theory and quasi-classical trajectory are found to agree well with the available experimental and previous quantum dynamical results. The calculated total reaction probabilities (J tot = 0) including the abstraction and exchange channels using the new potential by a reduced dimensional quantum dynamic method are essentially the same as those on the Xu-Chen-Zhang PES [Chin. J. Chem. Phys. 27, 373 (2014)

Permutations avoiding an increasing number of length-increasing forbidden subsequences

Directory of Open Access Journals (Sweden)

Elena Barcucci

2000-12-01

Full Text Available A permutation π is said to be τ-avoiding if it does not contain any subsequence having all the same pairwise comparisons as τ. This paper concerns the characterization and enumeration of permutations which avoid a set F j of subsequences increasing both in number and in length at the same time. Let F j be the set of subsequences of the form σ(j+1(j+2, σ being any permutation on {1,...,j}. For j=1 the only subsequence in F 1 is 123 and the 123-avoiding permutations are enumerated by the Catalan numbers; for j=2 the subsequences in F 2 are 1234 2134 and the (1234,2134 avoiding permutations are enumerated by the Schröder numbers; for each other value of j greater than 2 the subsequences in F j are j! and their length is (j+2 the permutations avoiding these j! subsequences are enumerated by a number sequence {a n } such that C n ≤ a n ≤ n!, C n being the n th Catalan number. For each j we determine the generating function of permutations avoiding the subsequences in F j according to the length, to the number of left minima and of non-inversions.

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

Science.gov (United States)

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.

Permutation statistical methods an integrated approach

CERN Document Server

Berry, Kenneth J; Johnston, Janis E

2016-01-01

This research monograph provides a synthesis of a number of statistical tests and measures, which, at first consideration, appear disjoint and unrelated. Numerous comparisons of permutation and classical statistical methods are presented, and the two methods are compared via probability values and, where appropriate, measures of effect size. Permutation statistical methods, compared to classical statistical methods, do not rely on theoretical distributions, avoid the usual assumptions of normality and homogeneity of variance, and depend only on the data at hand. This text takes a unique approach to explaining statistics by integrating a large variety of statistical methods, and establishing the rigor of a topic that to many may seem to be a nascent field in statistics. This topic is new in that it took modern computing power to make permutation methods available to people working in the mainstream of research. This research monograph addresses a statistically-informed audience, and can also easily serve as a ...

Some topics on permutable subgroups in infinite groups

OpenAIRE

Ialenti, Roberto

2017-01-01

The aim of this thesis is to study permutability in different aspects of the theory of infinite groups. In particular, it will be studied the structure of groups in which all the members of a relevant system of subgroups satisfy a suitable generalized condition of permutability.

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

Science.gov (United States)

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.

Permuting sparse rectangular matrices into block-diagonal form

Energy Technology Data Exchange (ETDEWEB)

Aykanat, Cevdet; Pinar, Ali; Catalyurek, Umit V.

2002-12-09

This work investigates the problem of permuting a sparse rectangular matrix into block diagonal form. Block diagonal form of a matrix grants an inherent parallelism for the solution of the deriving problem, as recently investigated in the context of mathematical programming, LU factorization and QR factorization. We propose graph and hypergraph models to represent the nonzero structure of a matrix, which reduce the permutation problem to those of graph partitioning by vertex separator and hypergraph partitioning, respectively. Besides proposing the models to represent sparse matrices and investigating related combinatorial problems, we provide a detailed survey of relevant literature to bridge the gap between different societies, investigate existing techniques for partitioning and propose new ones, and finally present a thorough empirical study of these techniques. Our experiments on a wide range of matrices, using state-of-the-art graph and hypergraph partitioning tools MeTiS and PaT oH, revealed that the proposed methods yield very effective solutions both in terms of solution quality and run time.

Weak isometries of Hamming spaces

Directory of Open Access Journals (Sweden)

Ryan Bruner

2016-09-01

Full Text Available Consider any permutation of the elements of a (finite metric space that preserves a specific distancep. When is such a permutation automatically an isometry of the metric space? In this note we studythis problem for the Hamming spaces H(n,q both from a linear algebraic and combinatorial pointof view. We obtain some sufficient conditions for the question to have an affirmative answer, as wellas pose some interesting open problems.

Permutation orbifolds

International Nuclear Information System (INIS)

Bantay, P.

2002-01-01

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for fusion rule coefficients are presented, together with the relevant mathematical concepts, such as Λ-matrices and twisted dimensions. The arithmetic restrictions implied by the theory for the allowed modular representations in CFT are discussed. The simplest nonabelian example with twist group S 3 is described to illustrate the general theory

A permutations representation that knows what " Eulerian" means

Directory of Open Access Journals (Sweden)

Roberto Mantaci

2001-12-01

Full Text Available Eulerian numbers (and ``Alternate Eulerian numbers'' are often interpreted as distributions of statistics defined over the Symmetric group. The main purpose of this paper is to define a way to represent permutations that provides some other combinatorial interpretations of these numbers. This representation uses a one-to-one correspondence between permutations and the so-called subexceedant functions.

Young module multiplicities and classifying the indecomposable Young permutation modules

OpenAIRE

Gill, Christopher C.

2012-01-01

We study the multiplicities of Young modules as direct summands of permutation modules on cosets of Young subgroups. Such multiplicities have become known as the p-Kostka numbers. We classify the indecomposable Young permutation modules, and, applying the Brauer construction for p-permutation modules, we give some new reductions for p-Kostka numbers. In particular we prove that p-Kostka numbers are preserved under multiplying partitions by p, and strengthen a known reduction given by Henke, c...

Fermion systems in discrete space-time

International Nuclear Information System (INIS)

Finster, Felix

2007-01-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

Fermion systems in discrete space-time

Energy Technology Data Exchange (ETDEWEB)

Finster, Felix [NWF I - Mathematik, Universitaet Regensburg, 93040 Regensburg (Germany)

2007-05-15

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.

Fermion Systems in Discrete Space-Time

OpenAIRE

Finster, Felix

2006-01-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.

Fermion systems in discrete space-time

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Permutation groups

CERN Document Server

Passman, Donald S

2012-01-01

This volume by a prominent authority on permutation groups consists of lecture notes that provide a self-contained account of distinct classification theorems. A ready source of frequently quoted but usually inaccessible theorems, it is ideally suited for professional group theorists as well as students with a solid background in modern algebra.The three-part treatment begins with an introductory chapter and advances to an economical development of the tools of basic group theory, including group extensions, transfer theorems, and group representations and characters. The final chapter feature

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

Science.gov (United States)

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.

Permutation based decision making under fuzzy environment using Tabu search

Directory of Open Access Journals (Sweden)

Mahdi Bashiri

2012-04-01

Full Text Available One of the techniques, which are used for Multiple Criteria Decision Making (MCDM is the permutation. In the classical form of permutation, it is assumed that weights and decision matrix components are crisp. However, when group decision making is under consideration and decision makers could not agree on a crisp value for weights and decision matrix components, fuzzy numbers should be used. In this article, the fuzzy permutation technique for MCDM problems has been explained. The main deficiency of permutation is its big computational time, so a Tabu Search (TS based algorithm has been proposed to reduce the computational time. A numerical example has illustrated the proposed approach clearly. Then, some benchmark instances extracted from literature are solved by proposed TS. The analyses of the results show the proper performance of the proposed method.

A Fast Algorithm for Generating Permutation Distribution of Ranks in ...

African Journals Online (AJOL)

... function of the distribution of the ranks. This further gives insight into the permutation distribution of a rank statistics. The algorithm is implemented with the aid of the computer algebra system Mathematica. Key words: Combinatorics, generating function, permutation distribution, rank statistics, partitions, computer algebra.

Permutation groups and transformation semigroups : results and problems

OpenAIRE

Araujo, Joao; Cameron, Peter Jephson

2015-01-01

J.M. Howie, the influential St Andrews semigroupist, claimed that we value an area of pure mathematics to the extent that (a) it gives rise to arguments that are deep and elegant, and (b) it has interesting interconnections with other parts of pure mathematics. This paper surveys some recent results on the transformation semigroup generated by a permutation group $G$ and a single non-permutation $a$. Our particular concern is the influence that properties of $G$ (related to homogeneity, trans...

Geometric differential evolution for combinatorial and programs spaces.

Science.gov (United States)

Moraglio, A; Togelius, J; Silva, S

2013-01-01

Geometric differential evolution (GDE) is a recently introduced formal generalization of traditional differential evolution (DE) that can be used to derive specific differential evolution algorithms for both continuous and combinatorial spaces retaining the same geometric interpretation of the dynamics of the DE search across representations. In this article, we first review the theory behind the GDE algorithm, then, we use this framework to formally derive specific GDE for search spaces associated with binary strings, permutations, vectors of permutations and genetic programs. The resulting algorithms are representation-specific differential evolution algorithms searching the target spaces by acting directly on their underlying representations. We present experimental results for each of the new algorithms on a number of well-known problems comprising NK-landscapes, TSP, and Sudoku, for binary strings, permutations, and vectors of permutations. We also present results for the regression, artificial ant, parity, and multiplexer problems within the genetic programming domain. Experiments show that overall the new DE algorithms are competitive with well-tuned standard search algorithms.

Permutation entropy with vector embedding delays

Science.gov (United States)

Little, Douglas J.; Kane, Deb M.

2017-12-01

Permutation entropy (PE) is a statistic used widely for the detection of structure within a time series. Embedding delay times at which the PE is reduced are characteristic timescales for which such structure exists. Here, a generalized scheme is investigated where embedding delays are represented by vectors rather than scalars, permitting PE to be calculated over a (D -1 ) -dimensional space, where D is the embedding dimension. This scheme is applied to numerically generated noise, sine wave and logistic map series, and experimental data sets taken from a vertical-cavity surface emitting laser exhibiting temporally localized pulse structures within the round-trip time of the laser cavity. Results are visualized as PE maps as a function of embedding delay, with low PE values indicating combinations of embedding delays where correlation structure is present. It is demonstrated that vector embedding delays enable identification of structure that is ambiguous or masked, when the embedding delay is constrained to scalar form.

Determination of Pavement Rehabilitation Activities through a Permutation Algorithm

Directory of Open Access Journals (Sweden)

Sangyum Lee

2013-01-01

Full Text Available This paper presents a mathematical programming model for optimal pavement rehabilitation planning. The model maximized the rehabilitation area through a newly developed permutation algorithm, based on the procedures outlined in the harmony search (HS algorithm. Additionally, the proposed algorithm was based on an optimal solution method for the problem of multilocation rehabilitation activities on pavement structure, using empirical deterioration and rehabilitation effectiveness models, according to a limited maintenance budget. Thus, nonlinear pavement performance and rehabilitation activity decision models were used to maximize the objective functions of the rehabilitation area within a limited budget, through the permutation algorithm. Our results showed that the heuristic permutation algorithm provided a good optimum in terms of maximizing the rehabilitation area, compared with a method of the worst-first maintenance currently used in Seoul.

A Permutation Approach for Selecting the Penalty Parameter in Penalized Model Selection

Science.gov (United States)

Sabourin, Jeremy A; Valdar, William; Nobel, Andrew B

2015-01-01

Summary We describe a simple, computationally effcient, permutation-based procedure for selecting the penalty parameter in LASSO penalized regression. The procedure, permutation selection, is intended for applications where variable selection is the primary focus, and can be applied in a variety of structural settings, including that of generalized linear models. We briefly discuss connections between permutation selection and existing theory for the LASSO. In addition, we present a simulation study and an analysis of real biomedical data sets in which permutation selection is compared with selection based on the following: cross-validation (CV), the Bayesian information criterion (BIC), Scaled Sparse Linear Regression, and a selection method based on recently developed testing procedures for the LASSO. PMID:26243050

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

Science.gov (United States)

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.

Adjusted permutation method for multiple attribute decision making with meta-heuristic solution approaches

Directory of Open Access Journals (Sweden)

Hossein Karimi

2011-04-01

Full Text Available The permutation method of multiple attribute decision making has two significant deficiencies: high computational time and wrong priority output in some problem instances. In this paper, a novel permutation method called adjusted permutation method (APM is proposed to compensate deficiencies of conventional permutation method. We propose Tabu search (TS and particle swarm optimization (PSO to find suitable solutions at a reasonable computational time for large problem instances. The proposed method is examined using some numerical examples to evaluate the performance of the proposed method. The preliminary results show that both approaches provide competent solutions in relatively reasonable amounts of time while TS performs better to solve APM.

Secure physical layer using dynamic permutations in cognitive OFDMA systems

DEFF Research Database (Denmark)

Meucci, F.; Wardana, Satya Ardhy; Prasad, Neeli R.

2009-01-01

This paper proposes a novel lightweight mechanism for a secure Physical (PHY) layer in Cognitive Radio Network (CRN) using Orthogonal Frequency Division Multiplexing (OFDM). User's data symbols are mapped over the physical subcarriers with a permutation formula. The PHY layer is secured...... with a random and dynamic subcarrier permutation which is based on a single pre-shared information and depends on Dynamic Spectrum Access (DSA). The dynamic subcarrier permutation is varying over time, geographical location and environment status, resulting in a very robust protection that ensures...... confidentiality. The method is shown to be effective also for existing non-cognitive systems. The proposed mechanism is effective against eavesdropping even if the eavesdropper adopts a long-time patterns analysis, thus protecting cryptography techniques of higher layers. The correlation properties...

NDPA: A generalized efficient parallel in-place N-Dimensional Permutation Algorithm

Directory of Open Access Journals (Sweden)

Muhammad Elsayed Ali

2015-09-01

Full Text Available N-dimensional transpose/permutation is a very important operation in many large-scale data intensive and scientific applications. These applications include but not limited to oil industry i.e. seismic data processing, nuclear medicine, media production, digital signal processing and business intelligence. This paper proposes an efficient in-place N-dimensional permutation algorithm. The algorithm is based on a novel 3D transpose algorithm that was published recently. The proposed algorithm has been tested on 3D, 4D, 5D, 6D and 7D data sets as a proof of concept. This is the first contribution which is breaking the dimensions’ limitation of the base algorithm. The suggested algorithm exploits the idea of mixing both logical and physical permutations together. In the logical permutation, the address map is transposed for each data unit access. In the physical permutation, actual data elements are swapped. Both permutation levels exploit the fast on-chip memory bandwidth by transferring large amount of data and allowing for fine-grain SIMD (Single Instruction, Multiple Data operations. Thus, the performance is improved as evident from the experimental results section. The algorithm is implemented on NVidia GeForce GTS 250 GPU (Graphics Processing Unit containing 128 cores. The rapid increase in GPUs performance coupled with the recent and continuous improvements in its programmability proved that GPUs are the right choice for computationally demanding tasks. The use of GPUs is the second contribution which reflects how strongly they fit for high performance tasks. The third contribution is improving the proposed algorithm performance to its peak as discussed in the results section.

Multivariate Multi-Scale Permutation Entropy for Complexity Analysis of Alzheimer’s Disease EEG

Directory of Open Access Journals (Sweden)

Isabella Palamara

2012-07-01

Full Text Available An original multivariate multi-scale methodology for assessing the complexity of physiological signals is proposed. The technique is able to incorporate the simultaneous analysis of multi-channel data as a unique block within a multi-scale framework. The basic complexity measure is done by using Permutation Entropy, a methodology for time series processing based on ordinal analysis. Permutation Entropy is conceptually simple, structurally robust to noise and artifacts, computationally very fast, which is relevant for designing portable diagnostics. Since time series derived from biological systems show structures on multiple spatial-temporal scales, the proposed technique can be useful for other types of biomedical signal analysis. In this work, the possibility of distinguish among the brain states related to Alzheimer’s disease patients and Mild Cognitive Impaired subjects from normal healthy elderly is checked on a real, although quite limited, experimental database.

Three-body problem in d-dimensional space: Ground state, (quasi)-exact-solvability

Science.gov (United States)

Turbiner, Alexander V.; Miller, Willard; Escobar-Ruiz, M. A.

2018-02-01

As a straightforward generalization and extension of our previous paper [A. V. Turbiner et al., "Three-body problem in 3D space: Ground state, (quasi)-exact-solvability," J. Phys. A: Math. Theor. 50, 215201 (2017)], we study the aspects of the quantum and classical dynamics of a 3-body system with equal masses, each body with d degrees of freedom, with interaction depending only on mutual (relative) distances. The study is restricted to solutions in the space of relative motion which are functions of mutual (relative) distances only. It is shown that the ground state (and some other states) in the quantum case and the planar trajectories (which are in the interaction plane) in the classical case are of this type. The quantum (and classical) Hamiltonian for which these states are eigenfunctions is derived. It corresponds to a three-dimensional quantum particle moving in a curved space with special d-dimension-independent metric in a certain d-dependent singular potential, while at d = 1, it elegantly degenerates to a two-dimensional particle moving in flat space. It admits a description in terms of pure geometrical characteristics of the interaction triangle which is defined by the three relative distances. The kinetic energy of the system is d-independent; it has a hidden sl(4, R) Lie (Poisson) algebra structure, alternatively, the hidden algebra h(3) typical for the H3 Calogero model as in the d = 3 case. We find an exactly solvable three-body S3-permutationally invariant, generalized harmonic oscillator-type potential as well as a quasi-exactly solvable three-body sextic polynomial type potential with singular terms. For both models, an extra first order integral exists. For d = 1, the whole family of 3-body (two-dimensional) Calogero-Moser-Sutherland systems as well as the Tremblay-Turbiner-Winternitz model is reproduced. It is shown that a straightforward generalization of the 3-body (rational) Calogero model to d > 1 leads to two primitive quasi

Predecessor and permutation existence problems for sequential dynamical systems

Energy Technology Data Exchange (ETDEWEB)

Barrett, C. L. (Christopher L.); Hunt, H. B. (Harry B.); Marathe, M. V. (Madhav V.); Rosenkrantz, D. J. (Daniel J.); Stearns, R. E. (Richard E.)

2002-01-01

A class of finite discrete dynamical systems, called Sequential Dynamical Systems (SDSs), was introduced in BMR99, BR991 as a formal model for analyzing simulation systems. An SDS S is a triple (G, F,n ),w here (i) G(V,E ) is an undirected graph with n nodes with each node having a state, (ii) F = (fi, fi, . . ., fn), with fi denoting a function associated with node ui E V and (iii) A is a permutation of (or total order on) the nodes in V, A configuration of an SDS is an n-vector ( b l, bz, . . ., bn), where bi is the value of the state of node vi. A single SDS transition from one configuration to another is obtained by updating the states of the nodes by evaluating the function associated with each of them in the order given by n. Here, we address the complexity of two basic problems and their generalizations for SDSs. Given an SDS S and a configuration C, the PREDECESSOR EXISTENCE (or PRE) problem is to determine whether there is a configuration C' such that S has a transition from C' to C. (If C has no predecessor, C is known as a garden of Eden configuration.) Our results provide separations between efficiently solvable and computationally intractable instances of the PRE problem. For example, we show that the PRE problem can be solved efficiently for SDSs with Boolean state values when the node functions are symmetric and the underlying graph is of bounded treewidth. In contrast, we show that allowing just one non-symmetric node function renders the problem NP-complete even when the underlying graph is a tree (which has a treewidth of 1). We also show that the PRE problem is efficiently solvable for SDSs whose state values are from a field and whose node functions are linear. Some of the polynomial algorithms also extend to the case where we want to find an ancestor configuration that precedes a given configuration by a logarithmic number of steps. Our results extend some of the earlier results by Sutner [Su95] and Green [@87] on the complexity of

Computing the Jones index of quadratic permutation endomorphisms of O2

DEFF Research Database (Denmark)

Szymanski, Wojciech; Conti, Roberto

2009-01-01

We compute the index of the type III1/2  factors arising from endomorphisms of the Cuntz algebra O2  associated to the rank-two permutation matrices. Udgivelsesdato: January......We compute the index of the type III1/2  factors arising from endomorphisms of the Cuntz algebra O2  associated to the rank-two permutation matrices. Udgivelsesdato: January...

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

Science.gov (United States)

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.

The coupling analysis between stock market indices based on permutation measures

Science.gov (United States)

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.

On permutation polynomials over finite fields: differences and iterations

DEFF Research Database (Denmark)

Anbar Meidl, Nurdagül; Odzak, Almasa; Patel, Vandita

2017-01-01

The Carlitz rank of a permutation polynomial f over a finite field Fq is a simple concept that was introduced in the last decade. Classifying permutations over Fq with respect to their Carlitz ranks has some advantages, for instance f with a given Carlitz rank can be approximated by a rational li...

Sweeping the State Space

DEFF Research Database (Denmark)

Mailund, Thomas

The thesis describes the sweep-line method, a newly developed reduction method for alleviating the state explosion problem inherent in explicit-state state space exploration. The basic idea underlying the sweep-line method is, when calculating the state space, to recognise and delete states...... that are not reachable from the currently unprocessed states. Intuitively we drag a sweep-line through the state space with the invariant that all states behind the sweep-line have been processed and are unreachable from the states in front of the sweep-line. When calculating the state space of a system we iteratively...

Ordered groups and infinite permutation groups

CERN Document Server

1996-01-01

The subjects of ordered groups and of infinite permutation groups have long en­ joyed a symbiotic relationship. Although the two subjects come from very different sources, they have in certain ways come together, and each has derived considerable benefit from the other. My own personal contact with this interaction began in 1961. I had done Ph. D. work on sequence convergence in totally ordered groups under the direction of Paul Conrad. In the process, I had encountered "pseudo-convergent" sequences in an ordered group G, which are like Cauchy sequences, except that the differences be­ tween terms of large index approach not 0 but a convex subgroup G of G. If G is normal, then such sequences are conveniently described as Cauchy sequences in the quotient ordered group GIG. If G is not normal, of course GIG has no group structure, though it is still a totally ordered set. The best that can be said is that the elements of G permute GIG in an order-preserving fashion. In independent investigations around that t...

Permutation Tests for Stochastic Ordering and ANOVA

CERN Document Server

Basso, Dario; Salmaso, Luigi; Solari, Aldo

2009-01-01

Permutation testing for multivariate stochastic ordering and ANOVA designs is a fundamental issue in many scientific fields such as medicine, biology, pharmaceutical studies, engineering, economics, psychology, and social sciences. This book presents advanced methods and related R codes to perform complex multivariate analyses

N ecklaces~ Periodic Points and Permutation Representations

Indian Academy of Sciences (India)

Home; Journals; Resonance – Journal of Science Education; Volume 6; Issue 11. Necklaces, Periodic Points and Permutation Representations - Fermat's Little Theorem. Somnath Basu Anindita Bose Sumit Kumar Sinha Pankaj Vishe. General Article Volume 6 Issue 11 November 2001 pp 18-26 ...

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

Science.gov (United States)

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.

Permutation entropy of fractional Brownian motion and fractional Gaussian noise

International Nuclear Information System (INIS)

Zunino, L.; Perez, D.G.; Martin, M.T.; Garavaglia, M.; Plastino, A.; Rosso, O.A.

2008-01-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

On Permuting Cut with Contraction

OpenAIRE

Borisavljevic, Mirjana; Dosen, Kosta; Petric, Zoran

1999-01-01

The paper presents a cut-elimination procedure for intuitionistic propositional logic in which cut is eliminated directly, without introducing the multiple-cut rule mix, and in which pushing cut above contraction is one of the reduction steps. The presentation of this procedure is preceded by an analysis of Gentzen's mix-elimination procedure, made in the perspective of permuting cut with contraction. It is also shown that in the absence of implication, pushing cut above contraction doesn't p...

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

Science.gov (United States)

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.

Adaptive Tests of Significance Using Permutations of Residuals with R and SAS

CERN Document Server

O'Gorman, Thomas W

2012-01-01

Provides the tools needed to successfully perform adaptive tests across a broad range of datasets Adaptive Tests of Significance Using Permutations of Residuals with R and SAS illustrates the power of adaptive tests and showcases their ability to adjust the testing method to suit a particular set of data. The book utilizes state-of-the-art software to demonstrate the practicality and benefits for data analysis in various fields of study. Beginning with an introduction, the book moves on to explore the underlying concepts of adaptive tests, including:Smoothing methods and normalizing transforma

Weighted multiscale Rényi permutation entropy of nonlinear time series

Science.gov (United States)

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.

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

Science.gov (United States)

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.

PERMUTATION-BASED POLYMORPHIC STEGO-WATERMARKS FOR PROGRAM CODES

Directory of Open Access Journals (Sweden)

Denys Samoilenko

2016-06-01

Full Text Available Purpose: One of the most actual trends in program code protection is code marking. The problem consists in creation of some digital “watermarks” which allow distinguishing different copies of the same program codes. Such marks could be useful for authority protection, for code copies numbering, for program propagation monitoring, for information security proposes in client-server communication processes. Methods: We used the methods of digital steganography adopted for program codes as text objects. The same-shape symbols method was transformed to same-semantic element method due to codes features which makes them different from ordinary texts. We use dynamic principle of marks forming making codes similar to be polymorphic. Results: We examined the combinatorial capacity of permutations possible in program codes. As a result it was shown that the set of 5-7 polymorphic variables is suitable for the most modern network applications. Marks creation and restoration algorithms where proposed and discussed. The main algorithm is based on full and partial permutations in variables names and its declaration order. Algorithm for partial permutation enumeration was optimized for calculation complexity. PHP code fragments which realize the algorithms were listed. Discussion: Methodic proposed in the work allows distinguishing of each client-server connection. In a case if a clone of some network resource was found the methodic could give information about included marks and thereby data on IP, date and time, authentication information of client copied the resource. Usage of polymorphic stego-watermarks should improve information security indexes in network communications.

Patterns in Permutations and Words

CERN Document Server

Kitaev, Sergey

2011-01-01

There has been considerable interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers, and Knuth in the 1970s. Consideration of the patterns in question has been extremely interesting from the combinatorial point of view, and it has proved to be a useful language in a variety of seemingly unrelated problems, including the theory of Kazhdan--Lusztig polynomials, singularities of Schubert varieties, interval orders, Chebyshev polynomials, models in statistical mechanics, and various sorting algorithms, inclu

Quantum-Secret-Sharing Scheme Based on Local Distinguishability of Orthogonal Seven-Qudit Entangled States

Science.gov (United States)

Liu, Cheng-Ji; Li, Zhi-Hui; Bai, Chen-Ming; Si, Meng-Meng

2018-02-01

The concept of judgment space was proposed by Wang et al. (Phys. Rev. A 95, 022320, 2017), which was used to study some important properties of quantum entangled states based on local distinguishability. In this study, we construct 15 kinds of seven-qudit quantum entangled states in the sense of permutation, calculate their judgment space and propose a distinguishability rule to make the judgment space more clearly. Based on this rule, we study the local distinguishability of the 15 kinds of seven-qudit quantum entangled states and then propose a ( k, n) threshold quantum secret sharing scheme. Finally, we analyze the security of the scheme.

Permutation Entropy: New Ideas and Challenges

Directory of Open Access Journals (Sweden)

Karsten Keller

2017-03-01

Full Text Available Over recent years, some new variants of Permutation entropy have been introduced and applied to EEG analysis, including a conditional variant and variants using some additional metric information or being based on entropies that are different from the Shannon entropy. In some situations, it is not completely clear what kind of information the new measures and their algorithmic implementations provide. We discuss the new developments and illustrate them for EEG data.

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

Directory of Open Access Journals (Sweden)

Knijnenburg Theo A

2011-10-01

Full Text Available Abstract 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/

A Weak Quantum Blind Signature with Entanglement Permutation

Science.gov (United States)

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.

All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables

DEFF Research Database (Denmark)

Gutin, Gregory; Van Iersel, Leo; Mnich, Matthias

2010-01-01

A ternary Permutation-CSP is specified by a subset Π of the symmetric group S3. An instance of such a problem consists of a set of variables V and a multiset of constraints, which are ordered triples of distinct variables of V. The objective is to find a linear ordering α of V that maximizes...... the number of triples whose rearrangement (under α) follows a permutation in Π. We prove that all ternary Permutation-CSPs parameterized above average have kernels with quadratic numbers of variables....

State Space Modeling Using SAS

Directory of Open Access Journals (Sweden)

Rajesh Selukar

2011-05-01

Full Text Available This article provides a brief introduction to the state space modeling capabilities in SAS, a well-known statistical software system. SAS provides state space modeling in a few different settings. SAS/ETS, the econometric and time series analysis module of the SAS system, contains many procedures that use state space models to analyze univariate and multivariate time series data. In addition, SAS/IML, an interactive matrix language in the SAS system, provides Kalman filtering and smoothing routines for stationary and nonstationary state space models. SAS/IML also provides support for linear algebra and nonlinear function optimization, which makes it a convenient environment for general-purpose state space modeling.

A permutation test for the race model inequality

DEFF Research Database (Denmark)

Gondan, Matthias

2010-01-01

signals. Several statistical procedures have been used for testing the race model inequality. However, the commonly employed procedure does not control the Type I error. In this article a permutation test is described that keeps the Type I error at the desired level. Simulations show that the power...

SCOPES: steganography with compression using permutation search

Science.gov (United States)

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.

Statistical Significance of the Contribution of Variables to the PCA Solution: An Alternative Permutation Strategy

Science.gov (United States)

Linting, Marielle; van Os, Bart Jan; Meulman, Jacqueline J.

2011-01-01

In this paper, the statistical significance of the contribution of variables to the principal components in principal components analysis (PCA) is assessed nonparametrically by the use of permutation tests. We compare a new strategy to a strategy used in previous research consisting of permuting the columns (variables) of a data matrix…

Canonical form of three-fermion pure-states with six single particle states

International Nuclear Information System (INIS)

Chen, Lin; Ž Ðoković, Dragomir; Grassl, Markus; Zeng, Bei

2014-01-01

We construct a canonical form for pure states in ∧ 3 (C 6 ), the three-fermion system with six single particle states, under local unitary (LU) transformations, i.e., the unitary group U(6). We also construct a minimal set of generators of the algebra of polynomial U(6)-invariants on ∧ 3 (C 6 ). It turns out that this algebra is isomorphic to the algebra of polynomial LU-invariants of three-qubits which are additionally invariant under qubit permutations. As a consequence of this surprising fact, we deduce that there is a one-to-one correspondence between the U(6)-orbits of pure three-fermion states in ∧ 3 (C 6 ) and the LU orbits of pure three-qubit states when qubit permutations are allowed. As an important byproduct, we obtain a new canonical form for pure three-qubit states under LU transformations U(2) × U(2) × U(2) (no qubit permutations allowed)

Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

Science.gov (United States)

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.

Science.gov (United States)

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.

Testing for changes using permutations of U-statistics

Czech Academy of Sciences Publication Activity Database

Horvath, L.; Hušková, Marie

2005-01-01

Roč. 2005, č. 128 (2005), s. 351-371 ISSN 0378-3758 R&D Projects: GA ČR GA201/00/0769 Institutional research plan: CEZ:AV0Z10750506 Keywords : U-statistics * permutations * change-point * weighted approximation * Brownian bridge Subject RIV: BD - Theory of Information Impact factor: 0.481, year: 2005

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

Science.gov (United States)

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.

Multiscale Permutation Entropy Based Rolling Bearing Fault Diagnosis

Directory of Open Access Journals (Sweden)

Jinde Zheng

2014-01-01

Full Text Available A new rolling bearing fault diagnosis approach based on multiscale permutation entropy (MPE, Laplacian score (LS, and support vector machines (SVMs is proposed in this paper. Permutation entropy (PE was recently proposed and defined to measure the randomicity and detect dynamical changes of time series. However, for the complexity of mechanical systems, the randomicity and dynamic changes of the vibration signal will exist in different scales. Thus, the definition of MPE is introduced and employed to extract the nonlinear fault characteristics from the bearing vibration signal in different scales. Besides, the SVM is utilized to accomplish the fault feature classification to fulfill diagnostic procedure automatically. Meanwhile, in order to avoid a high dimension of features, the Laplacian score (LS is used to refine the feature vector by ranking the features according to their importance and correlations with the main fault information. Finally, the rolling bearing fault diagnosis method based on MPE, LS, and SVM is proposed and applied to the experimental data. The experimental data analysis results indicate that the proposed method could identify the fault categories effectively.

Structural consequences of cutting a binding loop: two circularly permuted variants of streptavidin

International Nuclear Information System (INIS)

Le Trong, Isolde; Chu, Vano; Xing, Yi; Lybrand, Terry P.; Stayton, Patrick S.; Stenkamp, Ronald E.

2013-01-01

The crystal structures of two circularly permuted streptavidins probe the role of a flexible loop in the tight binding of biotin. Molecular-dynamics calculations for one of the mutants suggests that increased fluctuations in a hydrogen bond between the protein and biotin are associated with cleavage of the binding loop. Circular permutation of streptavidin was carried out in order to investigate the role of a main-chain amide in stabilizing the high-affinity complex of the protein and biotin. Mutant proteins CP49/48 and CP50/49 were constructed to place new N-termini at residues 49 and 50 in a flexible loop involved in stabilizing the biotin complex. Crystal structures of the two mutants show that half of each loop closes over the binding site, as observed in wild-type streptavidin, while the other half adopts the open conformation found in the unliganded state. The structures are consistent with kinetic and thermodynamic data and indicate that the loop plays a role in enthalpic stabilization of the bound state via the Asn49 amide–biotin hydrogen bond. In wild-type streptavidin, the entropic penalties of immobilizing a flexible portion of the protein to enhance binding are kept to a manageable level by using a contiguous loop of medium length (six residues) which is already constrained by its anchorage to strands of the β-barrel protein. A molecular-dynamics simulation for CP50/49 shows that cleavage of the binding loop results in increased structural fluctuations for Ser45 and that these fluctuations destabilize the streptavidin–biotin complex

Efficiency and credit ratings: a permutation-information-theory analysis

International Nuclear Information System (INIS)

Bariviera, Aurelio Fernandez; Martinez, Lisana B; Zunino, Luciano; Belén Guercio, M; Rosso, Osvaldo A

2013-01-01

The role of credit rating agencies has been under severe scrutiny after the subprime crisis. In this paper we explore the relationship between credit ratings and informational efficiency of a sample of thirty nine corporate bonds of US oil and energy companies from April 2008 to November 2012. For this purpose we use a powerful statistical tool, relatively new in the financial literature: the complexity–entropy causality plane. This representation space allows us to graphically classify the different bonds according to their degree of informational efficiency. We find that this classification agrees with the credit ratings assigned by Moody’s. In particular, we detect the formation of two clusters, which correspond to the global categories of investment and speculative grades. Regarding the latter cluster, two subgroups reflect distinct levels of efficiency. Additionally, we also find an intriguing absence of correlation between informational efficiency and firm characteristics. This allows us to conclude that the proposed permutation-information-theory approach provides an alternative practical way to justify bond classification. (paper)

Permuted tRNA genes of Cyanidioschyzon merolae, the origin of the tRNA molecule and the root of the Eukarya domain.

Science.gov (United States)

Di Giulio, Massimo

2008-08-07

An evolutionary analysis is conducted on the permuted tRNA genes of Cyanidioschyzon merolae, in which the 5' half of the tRNA molecule is codified at the 3' end of the gene and its 3' half is codified at the 5' end. This analysis has shown that permuted genes cannot be considered as derived traits but seem to possess characteristics that suggest they are ancestral traits, i.e. they originated when tRNA molecule genes originated for the first time. In particular, if the hypothesis that permuted genes are a derived trait were true, then we should not have been able to observe that the most frequent class of permuted genes is that of the anticodon loop type, for the simple reason that this class would derive by random permutation from a class of non-permuted tRNA genes, which instead is the rarest. This would not explain the high frequency with which permuted tRNA genes with perfectly separate 5' and 3' halves were observed. Clearly the mechanism that produced this class of permuted genes would envisage the existence, in an advanced stage of evolution, of minigenes codifying for the 5' and 3' halves of tRNAs which were assembled in a permuted way at the origin of the tRNA molecule, thus producing a high frequency of permuted genes of the class here referred. Therefore, this evidence supports the hypothesis that the genes of the tRNA molecule were assembled by minigenes codifying for hairpin-like RNA molecules, as suggested by one model for the origin of tRNA [Di Giulio, M., 1992. On the origin of the transfer RNA molecule. J. Theor. Biol. 159, 199-214; Di Giulio, M., 1999. The non-monophyletic origin of tRNA molecule. J. Theor. Biol. 197, 403-414]. Moreover, the late assembly of the permuted genes of C. merolae, as well as their ancestrality, strengthens the hypothesis of the polyphyletic origins of these genes. Finally, on the basis of the uniqueness and the ancestrality of these permuted genes, I suggest that the root of the Eukarya domain is in the super

Infinity-Norm Permutation Covering Codes from Cyclic Groups

OpenAIRE

Karni, Ronen; Schwartz, Moshe

2017-01-01

We study covering codes of permutations with the $\\ell_\\infty$-metric. We provide a general code construction, which uses smaller building-block codes. We study cyclic transitive groups as building blocks, determining their exact covering radius, and showing linear-time algorithms for finding a covering codeword. We also bound the covering radius of relabeled cyclic transitive groups under conjugation.

Optimization and experimental realization of the quantum permutation algorithm

Science.gov (United States)

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.

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

Energy Technology Data Exchange (ETDEWEB)

Li, Jun; Jiang, Bin; Guo, Hua, E-mail: hguo@unm.edu [Department of Chemistry and Chemical Biology, University of New Mexico, Albuquerque, New Mexico 87131 (United States)

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, resulting in full-dimensional global PESs with average errors on the order of meV. These PESs are used in full-dimensional quantum dynamical calculations.

A discriminative syntactic model for source permutation via tree transduction

NARCIS (Netherlands)

Khalilov, M.; Sima'an, K.; Wu, D.

2010-01-01

A major challenge in statistical machine translation is mitigating the word order differences between source and target strings. While reordering and lexical translation choices are often conducted in tandem, source string permutation prior to translation is attractive for studying reordering using

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

Science.gov (United States)

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…

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

Science.gov (United States)

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.

Symbolic Detection of Permutation and Parity Symmetries of Evolution Equations

KAUST Repository

Alghamdi, Moataz

2017-06-18

We introduce a symbolic computational approach to detecting all permutation and parity symmetries in any general evolution equation, and to generating associated invariant polynomials, from given monomials, under the action of these symmetries. Traditionally, discrete point symmetries of differential equations are systemically found by solving complicated nonlinear systems of partial differential equations; in the presence of Lie symmetries, the process can be simplified further. Here, we show how to find parity- and permutation-type discrete symmetries purely based on algebraic calculations. Furthermore, we show that such symmetries always form groups, thereby allowing for the generation of new group-invariant conserved quantities from known conserved quantities. This work also contains an implementation of the said results in Mathematica. In addition, it includes, as a motivation for this work, an investigation of the connection between variational symmetries, described by local Lie groups, and conserved quantities in Hamiltonian systems.

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

Science.gov (United States)

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

Condensed State Spaces for Symmetrical Coloured Petri Nets

DEFF Research Database (Denmark)

Jensen, Kurt

1996-01-01

equivalence classes of states and equivalence classes of state changes. It is then possible to construct a condensed state space where each node represents an equivalence class of states while each arc represents an equivalence class of state changes. Such a condensed state space is often much smaller than...... the full state space and it is also much faster to construct. Nevertheless, it is possible to use the condensed state space to verify the same kind of behavioural properties as the full state space. Hence, we do not lose analytic power. We define state spaces and condensed state spaces for a language......-nets (or Petri nets in general) - although such knowledge will, of course, be a help. The first four sections of the paper introduce the basic concepts of CP-nets. The next three sections deal with state spaces, condensed state spaces and computer tools for state space analysis. Finally, there is a short...

Quantile-based permutation thresholds for quantitative trait loci hotspots.

Science.gov (United States)

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.

Rolling Bearing Fault Diagnosis Based on ELCD Permutation Entropy and RVM

Directory of Open Access Journals (Sweden)

Jiang Xingmeng

2016-01-01

Full Text Available Aiming at the nonstationary characteristic of a gear fault vibration signal, a recognition method based on permutation entropy of ensemble local characteristic-scale decomposition (ELCD and relevance vector machine (RVM is proposed. First, the vibration signal was decomposed by ELCD; then a series of intrinsic scale components (ISCs were obtained. Second, according to the kurtosis of ISCs, principal ISCs were selected and then the permutation entropy of principal ISCs was calculated and they were combined into a feature vector. Finally, the feature vectors were input in RVM classifier to train and test and identify the type of rolling bearing faults. Experimental results show that this method can effectively diagnose four kinds of working condition, and the effect is better than local characteristic-scale decomposition (LCD method.

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

Science.gov (United States)

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

My Life with State Space Models

DEFF Research Database (Denmark)

Lundbye-Christensen, Søren

2007-01-01

. The conceptual idea behind the state space model is that the evolution over time in the object we are observing and the measurement process itself are modelled separately. My very first serious analysis of a data set was done using a state space model, and since then I seem to have been "haunted" by state space...

Determining the parity of a permutation using an experimental NMR qutrit

International Nuclear Information System (INIS)

Dogra, Shruti; Arvind,; Dorai, Kavita

2014-01-01

We present the NMR implementation of a recently proposed quantum algorithm to find the parity of a permutation. In the usual qubit model of quantum computation, it is widely believed that computational speedup requires the presence of entanglement and thus cannot be achieved by a single qubit. On the other hand, a qutrit is qualitatively more quantum than a qubit because of the existence of quantum contextuality and a single qutrit can be used for computing. We use the deuterium nucleus oriented in a liquid crystal as the experimental qutrit. This is the first experimental exploitation of a single qutrit to carry out a computational task. - Highlights: • NMR implementation of a quantum algorithm to determine the parity of a permutation. • Algorithm implemented on a single qutrit. • Computational speedup achieved without quantum entanglement. • Single qutrit shows quantum contextuality

Permutation Entropy for Random Binary Sequences

Directory of Open Access Journals (Sweden)

Lingfeng Liu

2015-12-01

Full Text Available In this paper, we generalize the permutation entropy (PE measure to binary sequences, which is based on Shannon’s entropy, and theoretically analyze this measure for random binary sequences. We deduce the theoretical value of PE for random binary sequences, which can be used to measure the randomness of binary sequences. We also reveal the relationship between this PE measure with other randomness measures, such as Shannon’s entropy and Lempel–Ziv complexity. The results show that PE is consistent with these two measures. Furthermore, we use PE as one of the randomness measures to evaluate the randomness of chaotic binary sequences.

Permutation 2-groups I: structure and splitness

OpenAIRE

Elgueta, Josep

2013-01-01

By a 2-group we mean a groupoid equipped with a weakened group structure. It is called split when it is equivalent to the semidirect product of a discrete 2-group and a one-object 2-group. By a permutation 2-group we mean the 2-group $\\mathbb{S}ym(\\mathcal{G})$ of self-equivalences of a groupoid $\\mathcal{G}$ and natural isomorphisms between them, with the product given by composition of self-equivalences. These generalize the symmetric groups $\\mathsf{S}_n$, $n\\geq 1$, obtained when $\\mathca...

Hippocampal activation during face-name associative memory encoding: blocked versus permuted design

International Nuclear Information System (INIS)

De Vogelaere, Frederick; Vingerhoets, Guy; Santens, Patrick; Boon, Paul; Achten, Erik

2010-01-01

The contribution of the hippocampal subregions to episodic memory through the formation of new associations between previously unrelated items such as faces and names is established but remains under discussion. Block design studies in this area of research generally tend to show posterior hippocampal activation during encoding of novel associational material while event-related studies emphasize anterior hippocampal involvement. We used functional magnetic resonance imaging to assess the involvement of anterior and posterior hippocampus in the encoding of novel associational material compared to the viewing of previously seen associational material. We used two different experimental designs, a block design and a permuted block design, and applied it to the same associative memory task to perform valid statistical comparisons. Our results indicate that the permuted design was able to capture more anterior hippocampal activation compared to the block design, which emphasized more posterior hippocampal involvement. These differences were further investigated and attributed to a combination of the polymodal stimuli we used and the experimental design. Activation patterns during encoding in both designs occurred along the entire longitudinal axis of the hippocampus, but with different centers of gravity. The maximal activated voxel in the block design was situated in the posterior half of the hippocampus while in the permuted design this was located in the anterior half. (orig.)

Hippocampal activation during face-name associative memory encoding: blocked versus permuted design

Energy Technology Data Exchange (ETDEWEB)

De Vogelaere, Frederick; Vingerhoets, Guy [Ghent University, Laboratory for Neuropsychology, Department of Neurology, Ghent (Belgium); Santens, Patrick; Boon, Paul [Ghent University Hospital, Department of Neurology, Ghent (Belgium); Achten, Erik [Ghent University Hospital, Department of Radiology, Ghent (Belgium)

2010-01-15

The contribution of the hippocampal subregions to episodic memory through the formation of new associations between previously unrelated items such as faces and names is established but remains under discussion. Block design studies in this area of research generally tend to show posterior hippocampal activation during encoding of novel associational material while event-related studies emphasize anterior hippocampal involvement. We used functional magnetic resonance imaging to assess the involvement of anterior and posterior hippocampus in the encoding of novel associational material compared to the viewing of previously seen associational material. We used two different experimental designs, a block design and a permuted block design, and applied it to the same associative memory task to perform valid statistical comparisons. Our results indicate that the permuted design was able to capture more anterior hippocampal activation compared to the block design, which emphasized more posterior hippocampal involvement. These differences were further investigated and attributed to a combination of the polymodal stimuli we used and the experimental design. Activation patterns during encoding in both designs occurred along the entire longitudinal axis of the hippocampus, but with different centers of gravity. The maximal activated voxel in the block design was situated in the posterior half of the hippocampus while in the permuted design this was located in the anterior half. (orig.)

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

Science.gov (United States)

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.

Diversification of Protein Cage Structure Using Circularly Permuted Subunits.

Science.gov (United States)

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.

Transformative decision rules, permutability, and non-sequential framing of decision problems

NARCIS (Netherlands)

Peterson, M.B.

2004-01-01

The concept of transformative decision rules provides auseful tool for analyzing what is often referred to as the`framing', or `problem specification', or `editing' phase ofdecision making. In the present study we analyze a fundamentalaspect of transformative decision rules, viz. permutability. A

Multiple comparisons permutation test for image based data mining in radiotherapy

NARCIS (Netherlands)

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

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

SiGN-SSM: open source parallel software for estimating gene networks with state space models.

Science.gov (United States)

Tamada, Yoshinori; Yamaguchi, Rui; Imoto, Seiya; Hirose, Osamu; Yoshida, Ryo; Nagasaki, Masao; Miyano, Satoru

2011-04-15

SiGN-SSM is an open-source gene network estimation software able to run in parallel on PCs and massively parallel supercomputers. The software estimates a state space model (SSM), that is a statistical dynamic model suitable for analyzing short time and/or replicated time series gene expression profiles. SiGN-SSM implements a novel parameter constraint effective to stabilize the estimated models. Also, by using a supercomputer, it is able to determine the gene network structure by a statistical permutation test in a practical time. SiGN-SSM is applicable not only to analyzing temporal regulatory dependencies between genes, but also to extracting the differentially regulated genes from time series expression profiles. SiGN-SSM is distributed under GNU Affero General Public Licence (GNU AGPL) version 3 and can be downloaded at http://sign.hgc.jp/signssm/. The pre-compiled binaries for some architectures are available in addition to the source code. The pre-installed binaries are also available on the Human Genome Center supercomputer system. The online manual and the supplementary information of SiGN-SSM is available on our web site. tamada@ims.u-tokyo.ac.jp.

A permutation-based multiple testing method for time-course microarray experiments

Directory of Open Access Journals (Sweden)

George Stephen L

2009-10-01

Full Text Available Abstract Background Time-course microarray experiments are widely used to study the temporal profiles of gene expression. Storey et al. (2005 developed a method for analyzing time-course microarray studies that can be applied to discovering genes whose expression trajectories change over time within a single biological group, or those that follow different time trajectories among multiple groups. They estimated the expression trajectories of each gene using natural cubic splines under the null (no time-course and alternative (time-course hypotheses, and used a goodness of fit test statistic to quantify the discrepancy. The null distribution of the statistic was approximated through a bootstrap method. Gene expression levels in microarray data are often complicatedly correlated. An accurate type I error control adjusting for multiple testing requires the joint null distribution of test statistics for a large number of genes. For this purpose, permutation methods have been widely used because of computational ease and their intuitive interpretation. Results In this paper, we propose a permutation-based multiple testing procedure based on the test statistic used by Storey et al. (2005. We also propose an efficient computation algorithm. Extensive simulations are conducted to investigate the performance of the permutation-based multiple testing procedure. The application of the proposed method is illustrated using the Caenorhabditis elegans dauer developmental data. Conclusion Our method is computationally efficient and applicable for identifying genes whose expression levels are time-dependent in a single biological group and for identifying the genes for which the time-profile depends on the group in a multi-group setting.

Tensor models, Kronecker coefficients and permutation centralizer algebras

Science.gov (United States)

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.

A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems

Directory of Open Access Journals (Sweden)

Nader Ghaffari-Nasab

2010-07-01

Full Text Available During the past two decades, there have been increasing interests on permutation flow shop with different types of objective functions such as minimizing the makespan, the weighted mean flow-time etc. The permutation flow shop is formulated as a mixed integer programming and it is classified as NP-Hard problem. Therefore, a direct solution is not available and meta-heuristic approaches need to be used to find the near-optimal solutions. In this paper, we present a new discrete firefly meta-heuristic to minimize the makespan for the permutation flow shop scheduling problem. The results of implementation of the proposed method are compared with other existing ant colony optimization technique. The preliminary results indicate that the new proposed method performs better than the ant colony for some well known benchmark problems.

A method for generating permutation distribution of ranks in a k ...

African Journals Online (AJOL)

... in a combinatorial sense the distribution of the ranks is obtained via its generating function. The formulas are defined recursively to speed up computations using the computer algebra system Mathematica. Key words: Partitions, generating functions, combinatorics, permutation test, exact tests, computer algebra, k-sample, ...

State Space Analysis of Hierarchical Coloured Petri Nets

DEFF Research Database (Denmark)

Christensen, Søren; Kristensen, Lars Michael

2003-01-01

In this paper, we consider state space analysis of Coloured Petri Nets. It is well-known that almost all dynamic properties of the considered system can be verified when the state space is finite. However, state space analysis is more than just formulating a set of formal requirements and invokin...... supporting computation and storage of state spaces which exploi the hierarchical structure of the models....... in which formal verification, partial state spaces, and analysis by means of graphical feedback and simulation are integrated entities. The focus of the paper is twofold: the support for graphical feedback and the way it has been integrated with simulation, and the underlying algorithms and data-structures......In this paper, we consider state space analysis of Coloured Petri Nets. It is well-known that almost all dynamic properties of the considered system can be verified when the state space is finite. However, state space analysis is more than just formulating a set of formal requirements and invoking...

A permutation testing framework to compare groups of brain networks.

Science.gov (United States)

Simpson, Sean L; Lyday, Robert G; Hayasaka, Satoru; Marsh, Anthony P; Laurienti, Paul J

2013-01-01

Brain network analyses have moved to the forefront of neuroimaging research over the last decade. However, methods for statistically comparing groups of networks have lagged behind. These comparisons have great appeal for researchers interested in gaining further insight into complex brain function and how it changes across different mental states and disease conditions. Current comparison approaches generally either rely on a summary metric or on mass-univariate nodal or edge-based comparisons that ignore the inherent topological properties of the network, yielding little power and failing to make network level comparisons. Gleaning deeper insights into normal and abnormal changes in complex brain function demands methods that take advantage of the wealth of data present in an entire brain network. Here we propose a permutation testing framework that allows comparing groups of networks while incorporating topological features inherent in each individual network. We validate our approach using simulated data with known group differences. We then apply the method to functional brain networks derived from fMRI data.

Statistical Software for State Space Methods

Directory of Open Access Journals (Sweden)

Jacques J. F. Commandeur

2011-05-01

Full Text Available In this paper we review the state space approach to time series analysis and establish the notation that is adopted in this special volume of the Journal of Statistical Software. We first provide some background on the history of state space methods for the analysis of time series. This is followed by a concise overview of linear Gaussian state space analysis including the modelling framework and appropriate estimation methods. We discuss the important class of unobserved component models which incorporate a trend, a seasonal, a cycle, and fixed explanatory and intervention variables for the univariate and multivariate analysis of time series. We continue the discussion by presenting methods for the computation of different estimates for the unobserved state vector: filtering, prediction, and smoothing. Estimation approaches for the other parameters in the model are also considered. Next, we discuss how the estimation procedures can be used for constructing confidence intervals, detecting outlier observations and structural breaks, and testing model assumptions of residual independence, homoscedasticity, and normality. We then show how ARIMA and ARIMA components models fit in the state space framework to time series analysis. We also provide a basic introduction for non-Gaussian state space models. Finally, we present an overview of the software tools currently available for the analysis of time series with state space methods as they are discussed in the other contributions to this special volume.

State Space Methods for Timed Petri Nets

DEFF Research Database (Denmark)

Christensen, Søren; Jensen, Kurt; Mailund, Thomas

2001-01-01

it possible to condense the usually infinite state space of a timed Petri net into a finite condensed state space without loosing analysis power. The second method supports on-the-fly verification of certain safety properties of timed systems. We discuss the application of the two methods in a number......We present two recently developed state space methods for timed Petri nets. The two methods reconciles state space methods and time concepts based on the introduction of a global clock and associating time stamps to tokens. The first method is based on an equivalence relation on states which makes...

Permutation entropy based time series analysis: Equalities in the input signal can lead to false conclusions

Energy Technology Data Exchange (ETDEWEB)

Zunino, Luciano, E-mail: lucianoz@ciop.unlp.edu.ar [Centro de Investigaciones Ópticas (CONICET La Plata – CIC), C.C. 3, 1897 Gonnet (Argentina); Departamento de Ciencias Básicas, Facultad de Ingeniería, Universidad Nacional de La Plata (UNLP), 1900 La Plata (Argentina); Olivares, Felipe, E-mail: olivaresfe@gmail.com [Instituto de Física, Pontificia Universidad Católica de Valparaíso (PUCV), 23-40025 Valparaíso (Chile); Scholkmann, Felix, E-mail: Felix.Scholkmann@gmail.com [Research Office for Complex Physical and Biological Systems (ROCoS), Mutschellenstr. 179, 8038 Zurich (Switzerland); Biomedical Optics Research Laboratory, Department of Neonatology, University Hospital Zurich, University of Zurich, 8091 Zurich (Switzerland); Rosso, Osvaldo A., E-mail: oarosso@gmail.com [Instituto de Física, Universidade Federal de Alagoas (UFAL), BR 104 Norte km 97, 57072-970, Maceió, Alagoas (Brazil); Instituto Tecnológico de Buenos Aires (ITBA) and CONICET, C1106ACD, Av. Eduardo Madero 399, Ciudad Autónoma de Buenos Aires (Argentina); Complex Systems Group, Facultad de Ingeniería y Ciencias Aplicadas, Universidad de los Andes, Av. Mons. Álvaro del Portillo 12.455, Las Condes, Santiago (Chile)

2017-06-15

A symbolic encoding scheme, based on the ordinal relation between the amplitude of neighboring values of a given data sequence, should be implemented before estimating the permutation entropy. Consequently, equalities in the analyzed signal, i.e. repeated equal values, deserve special attention and treatment. In this work, we carefully study the effect that the presence of equalities has on permutation entropy estimated values when these ties are symbolized, as it is commonly done, according to their order of appearance. On the one hand, the analysis of computer-generated time series is initially developed to understand the incidence of repeated values on permutation entropy estimations in controlled scenarios. The presence of temporal correlations is erroneously concluded when true pseudorandom time series with low amplitude resolutions are considered. On the other hand, the analysis of real-world data is included to illustrate how the presence of a significant number of equal values can give rise to false conclusions regarding the underlying temporal structures in practical contexts. - Highlights: • Impact of repeated values in a signal when estimating permutation entropy is studied. • Numerical and experimental tests are included for characterizing this limitation. • Non-negligible temporal correlations can be spuriously concluded by repeated values. • Data digitized with low amplitude resolutions could be especially affected. • Analysis with shuffled realizations can help to overcome this limitation.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

Projective loop quantum gravity. I. State space

Science.gov (United States)

Lanéry, Suzanne; Thiemann, Thomas

2016-12-01

Instead of formulating the state space of a quantum field theory over one big Hilbert space, it has been proposed by Kijowski to describe quantum states as projective families of density matrices over a collection of smaller, simpler Hilbert spaces. Beside the physical motivations for this approach, it could help designing a quantum state space holding the states we need. In a latter work by Okolów, the description of a theory of Abelian connections within this framework was developed, an important insight being to use building blocks labeled by combinations of edges and surfaces. The present work generalizes this construction to an arbitrary gauge group G (in particular, G is neither assumed to be Abelian nor compact). This involves refining the definition of the label set, as well as deriving explicit formulas to relate the Hilbert spaces attached to different labels. If the gauge group happens to be compact, we also have at our disposal the well-established Ashtekar-Lewandowski Hilbert space, which is defined as an inductive limit using building blocks labeled by edges only. We then show that the quantum state space presented here can be thought as a natural extension of the space of density matrices over this Hilbert space. In addition, it is manifest from the classical counterparts of both formalisms that the projective approach allows for a more balanced treatment of the holonomy and flux variables, so it might pave the way for the development of more satisfactory coherent states.

The Efficiency of Quantum Identity Testing of Multiple States

OpenAIRE

Kada, Masaru; Nishimura, Harumichi; Yamakami, Tomoyuki

2008-01-01

We examine two quantum operations, the Permutation Test and the Circle Test, which test the identity of n quantum states. These operations naturally extend the well-studied Swap Test on two quantum states. We first show the optimality of the Permutation Test for any input size n as well as the optimality of the Circle Test for three input states. In particular, when n=3, we present a semi-classical protocol, incorporated with the Swap Test, which approximates the Circle Test efficiently. Furt...

Molecular symmetry: Why permutation-inversion (PI) groups don't render the point groups obsolete

Science.gov (United States)

Groner, Peter

2018-01-01

The analysis of spectra of molecules with internal large-amplitude motions (LAMs) requires molecular symmetry (MS) groups that are larger than and significantly different from the more familiar point groups. MS groups are described often by the permutation-inversion (PI) group method. It is shown that point groups still can and should play a significant role together with the PI groups for a class of molecules with internal rotors. In molecules of this class, several simple internal rotors are attached to a rigid molecular frame. The PI groups for this class are semidirect products like H ^ F, where the invariant subgroup H is a direct product of cyclic groups and F is a point group. This result is used to derive meaningful labels for MS groups, and to derive correlation tables between MS groups and point groups. MS groups of this class have many parallels to space groups of crystalline solids.

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

Directory of Open Access Journals (Sweden)

Moshen Kuai

2018-03-01

Full Text Available 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.

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

Science.gov (United States)

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.

Information sets as permutation cycles for quadratic residue codes

Directory of Open Access Journals (Sweden)

Richard A. Jenson

1982-01-01

Full Text Available The two cases p=7 and p=23 are the only known cases where the automorphism group of the [p+1,   (p+1/2] extended binary quadratic residue code, O(p, properly contains PSL(2,p. These codes have some of their information sets represented as permutation cycles from Aut(Q(p. Analysis proves that all information sets of Q(7 are so represented but those of Q(23 are not.

Structural analysis of papain-like NlpC/P60 superfamily enzymes with a circularly permuted topology reveals potential lipid binding sites.

Directory of Open Access Journals (Sweden)

Qingping Xu

Full Text Available NlpC/P60 superfamily papain-like enzymes play important roles in all kingdoms of life. Two members of this superfamily, LRAT-like and YaeF/YiiX-like families, were predicted to contain a catalytic domain that is circularly permuted such that the catalytic cysteine is located near the C-terminus, instead of at the N-terminus. These permuted enzymes are widespread in virus, pathogenic bacteria, and eukaryotes. We determined the crystal structure of a member of the YaeF/YiiX-like family from Bacillus cereus in complex with lysine. The structure, which adopts a ligand-induced, "closed" conformation, confirms the circular permutation of catalytic residues. A comparative analysis of other related protein structures within the NlpC/P60 superfamily is presented. Permutated NlpC/P60 enzymes contain a similar conserved core and arrangement of catalytic residues, including a Cys/His-containing triad and an additional conserved tyrosine. More surprisingly, permuted enzymes have a hydrophobic S1 binding pocket that is distinct from previously characterized enzymes in the family, indicative of novel substrate specificity. Further analysis of a structural homolog, YiiX (PDB 2if6 identified a fatty acid in the conserved hydrophobic pocket, thus providing additional insights into possible function of these novel enzymes.

State-Space Formulation for Circuit Analysis

Science.gov (United States)

Martinez-Marin, T.

2010-01-01

This paper presents a new state-space approach for temporal analysis of electrical circuits. The method systematically obtains the state-space formulation of nondegenerate linear networks without using concepts of topology. It employs nodal/mesh systematic analysis to reduce the number of undesired variables. This approach helps students to…

Random walk generated by random permutations of {1, 2, 3, ..., n + 1}

International Nuclear Information System (INIS)

Oshanin, G; Voituriez, R

2004-01-01

We study properties of a non-Markovian random walk X (n) l , l = 0, 1, 2, ..., n, evolving in discrete time l on a one-dimensional lattice of integers, whose moves to the right or to the left are prescribed by the rise-and-descent sequences characterizing random permutations π of [n + 1] = {1, 2, 3, ..., n + 1}. We determine exactly the probability of finding the end-point X n = X (n) n of the trajectory of such a permutation-generated random walk (PGRW) at site X, and show that in the limit n → ∞ it converges to a normal distribution with a smaller, compared to the conventional Polya random walk, diffusion coefficient. We formulate, as well, an auxiliary stochastic process whose distribution is identical to the distribution of the intermediate points X (n) l , l < n, which enables us to obtain the probability measure of different excursions and to define the asymptotic distribution of the number of 'turns' of the PGRW trajectories

Generating All Permutations by Context-Free Grammars in Chomsky Normal Form

NARCIS (Netherlands)

Asveld, P.R.J.; Spoto, F.; Scollo, Giuseppe; Nijholt, Antinus

2003-01-01

Let $L_n$ be the finite language of all $n!$ strings that are permutations of $n$ different symbols ($n\\geq 1$). We consider context-free grammars $G_n$ in Chomsky normal form that generate $L_n$. In particular we study a few families $\\{G_n\\}_{n\\geq 1}$, satisfying $L(G_n)=L_n$ for $n\\geq 1$, with

Generating all permutations by context-free grammars in Chomsky normal form

NARCIS (Netherlands)

Asveld, P.R.J.

2006-01-01

Let $L_n$ be the finite language of all $n!$ strings that are permutations of $n$ different symbols ($n\\geq1$). We consider context-free grammars $G_n$ in Chomsky normal form that generate $L_n$. In particular we study a few families $\\{G_n\\}_{n\\geq1}$, satisfying $L(G_n)=L_n$ for $n\\geq1$, with

Generating All Permutations by Context-Free Grammars in Chomsky Normal Form

NARCIS (Netherlands)

Asveld, P.R.J.

2004-01-01

Let $L_n$ be the finite language of all $n!$ strings that are permutations of $n$ different symbols ($n\\geq 1$). We consider context-free grammars $G_n$ in Chomsky normal form that generate $L_n$. In particular we study a few families $\\{G_n\\}_{n\\geq1}$, satisfying $L(G_n)=L_n$ for $n\\geq 1$, with

Permutation importance: a corrected feature importance measure.

Science.gov (United States)

Altmann, André; Toloşi, Laura; Sander, Oliver; Lengauer, Thomas

2010-05-15

In life sciences, interpretability of machine learning models is as important as their prediction accuracy. Linear models are probably the most frequently used methods for assessing feature relevance, despite their relative inflexibility. However, in the past years effective estimators of feature relevance have been derived for highly complex or non-parametric models such as support vector machines and RandomForest (RF) models. Recently, it has been observed that RF models are biased in such a way that categorical variables with a large number of categories are preferred. In this work, we introduce a heuristic for normalizing feature importance measures that can correct the feature importance bias. The method is based on repeated permutations of the outcome vector for estimating the distribution of measured importance for each variable in a non-informative setting. The P-value of the observed importance provides a corrected measure of feature importance. We apply our method to simulated data and demonstrate that (i) non-informative predictors do not receive significant P-values, (ii) informative variables can successfully be recovered among non-informative variables and (iii) P-values computed with permutation importance (PIMP) are very helpful for deciding the significance of variables, and therefore improve model interpretability. Furthermore, PIMP was used to correct RF-based importance measures for two real-world case studies. We propose an improved RF model that uses the significant variables with respect to the PIMP measure and show that its prediction accuracy is superior to that of other existing models. R code for the method presented in this article is available at http://www.mpi-inf.mpg.de/ approximately altmann/download/PIMP.R CONTACT: altmann@mpi-inf.mpg.de, laura.tolosi@mpi-inf.mpg.de Supplementary data are available at Bioinformatics online.

State recognition of the viscoelastic sandwich structure based on the adaptive redundant second generation wavelet packet transform, permutation entropy and the wavelet support vector machine

International Nuclear Information System (INIS)

Qu, Jinxiu; Zhang, Zhousuo; Guo, Ting; Luo, Xue; Sun, Chuang; Li, Bing; Wen, Jinpeng

2014-01-01

The viscoelastic sandwich structure is widely used in mechanical equipment, yet the structure always suffers from damage during long-term service. Therefore, state recognition of the viscoelastic sandwich structure is very necessary for monitoring structural health states and keeping the equipment running with high reliability. Through the analysis of vibration response signals, this paper presents a novel method for this task based on the adaptive redundant second generation wavelet packet transform (ARSGWPT), permutation entropy (PE) and the wavelet support vector machine (WSVM). In order to tackle the non-linearity existing in the structure vibration response, the PE is introduced to reveal the state changes of the structure. In the case of complex non-stationary vibration response signals, in order to obtain more effective information regarding the structural health states, the ARSGWPT, which can adaptively match the characteristics of a given signal, is proposed to process the vibration response signals, and then multiple PE features are extracted from the resultant wavelet packet coefficients. The WSVM, which can benefit from the conventional SVM as well as wavelet theory, is applied to classify the various structural states automatically. In this study, to achieve accurate and automated state recognition, the ARSGWPT, PE and WSVM are combined for signal processing, feature extraction and state classification, respectively. To demonstrate the effectiveness of the proposed method, a typical viscoelastic sandwich structure is designed, and the different degrees of preload on the structure are used to characterize the various looseness states. The test results show that the proposed method can reliably recognize the different looseness states of the viscoelastic sandwich structure, and the WSVM can achieve a better classification performance than the conventional SVM. Moreover, the superiority of the proposed ARSGWPT in processing the complex vibration response

Refined composite multiscale weighted-permutation entropy of financial time series

Science.gov (United States)

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.

On non-permutation solutions to some two machine flow shop scheduling problems

NARCIS (Netherlands)

V. Strusevich (Vitaly); P.J. Zwaneveld (Peter)

1994-01-01

textabstractIn this paper, we study two versions of the two machine flow shop scheduling problem, where schedule length is to be minimized. First, we consider the two machine flow shop with setup, processing, and removal times separated. It is shown that an optimal solution need not be a permutation

Analysis of crude oil markets with improved multiscale weighted permutation entropy

Science.gov (United States)

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.

Space strategy and governance of ESA small member states

Science.gov (United States)

Sagath, Daniel; Papadimitriou, Angeliki; Adriaensen, Maarten; Giannopapa, Christina

2018-01-01

The European Space Agency (ESA) has twenty-two Member States with a variety of governance structures and strategic priorities regarding their space activities. The objective of this paper is to provide an up-to date overview and a holistic assessment of the national space governance structures and strategic priorities of the eleven smaller Member States (based on annual ESA contributions). A link is made between the governance structure and the main strategic objectives. The specific needs and interests of small and new Member States in the frame of European Space Integration are addressed. The first part of the paper focuses on the national space governance structures in the eleven smaller ESA Member States. The governance models of these Member States are identified including the responsible ministries and the entities entrusted with the implementation of space strategy/policy and programmes of the country. The second part of this paper focuses on the content and analysis of the national space strategies and indicates the main priorities and trends in the eleven smaller ESA Member States. The priorities are categorised with regards to technology domains, the role of space in the areas of sustainability and the motivators for space investments. In a third and final part, attention is given to the specific needs and interests of the smaller Member States in the frame of European space integration. ESA instruments are tailored to facilitate the needs and interests of the eleven smaller and/or new Member States.

A Sweep-Line Method for State Space Exploration

DEFF Research Database (Denmark)

Christensen, Søren; Kristensen, Lars Michael; Mailund, Thomas

2001-01-01

generation, since these states can never be reached again. This in turn reduces the memory used for state space storage during the task of verification. Examples of progress measures are sequence numbers in communication protocols and time in certain models with time. We illustrate the application...... of the method on a number of Coloured Petri Net models, and give a first evaluation of its practicality by means of an implementation based on the Design/CPN state space tool. Our experiments show significant reductions in both space and time used during state space exploration. The method is not specific...... to Coloured Petri Nets but applicable to a wide range of modelling languages....

Brain computation is organized via power-of-two-based permutation logic

Directory of Open Access Journals (Sweden)

Kun Xie

2016-11-01

Full Text Available There is considerable scientific interest in understanding how cell assemblies - the long-presumed computational motif - are organized so that the brain can generate cognitive behavior. The Theory of Connectivity proposes that the origin of intelligence is rooted in a power-of-two-based permutation logic (N=2i–1, giving rise to the specific-to-general cell-assembly organization capable of generating specific perceptions and memories, as well as generalized knowledge and flexible actions. We show that this power-of-two-based computational 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 cognitions. However, modulatory neurons, such as dopaminergic neurons, use a simpler logic despite their distinct subtypes. Interestingly, this specific-to-general permutation logic remained largely intact despite the NMDA receptors – the synaptic switch for learning and memory – were deleted throughout adulthood, suggesting that it is likely developmentally pre-configured. Moreover, this logic is implemented in the cortex vertically 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 non-randomness 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 robust feedback-control of motivation, emotion, consciousness, and behaviors. These observations suggest that the brain’s basic

A bootstrap based space-time surveillance model with an application to crime occurrences

Science.gov (United States)

Kim, Youngho; O'Kelly, Morton

2008-06-01

This study proposes a bootstrap-based space-time surveillance model. Designed to find emerging hotspots in near-real time, the bootstrap based model is characterized by its use of past occurrence information and bootstrap permutations. Many existing space-time surveillance methods, using population at risk data to generate expected values, have resulting hotspots bounded by administrative area units and are of limited use for near-real time applications because of the population data needed. However, this study generates expected values for local hotspots from past occurrences rather than population at risk. Also, bootstrap permutations of previous occurrences are used for significant tests. Consequently, the bootstrap-based model, without the requirement of population at risk data, (1) is free from administrative area restriction, (2) enables more frequent surveillance for continuously updated registry database, and (3) is readily applicable to criminology and epidemiology surveillance. The bootstrap-based model performs better for space-time surveillance than the space-time scan statistic. This is shown by means of simulations and an application to residential crime occurrences in Columbus, OH, year 2000.

A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan

International Nuclear Information System (INIS)

Lian Zhigang; Gu Xingsheng; Jiao Bin

2008-01-01

It is well known that the flow-shop scheduling problem (FSSP) is a branch of production scheduling and is NP-hard. Now, many different approaches have been applied for permutation flow-shop scheduling to minimize makespan, but current algorithms even for moderate size problems cannot be solved to guarantee optimality. Some literatures searching PSO for continuous optimization problems are reported, but papers searching PSO for discrete scheduling problems are few. In this paper, according to the discrete characteristic of FSSP, a novel particle swarm optimization (NPSO) algorithm is presented and successfully applied to permutation flow-shop scheduling to minimize makespan. Computation experiments of seven representative instances (Taillard) based on practical data were made, and comparing the NPSO with standard GA, we obtain that the NPSO is clearly more efficacious than standard GA for FSSP to minimize makespan

Index of French nuclear literature: IBM 360 programmes for preparing the permuted index of French titles

International Nuclear Information System (INIS)

Chonez, Nicole

1968-12-01

This report contains the assembly list, the flow chart and some comments about each of the IBM 360 assembler language programmes used for preparing one of the subject indexes contained in the bibliographical bulletin entitled: 'Index de la Litterature nucleaire francaise'; this bulletin has been produced by the French C.E.A. since 1968. Only the processing phases from the magnetic tape file of the bibliographical references, assumed correct, to the printing out of the permuted index obtained with the French titles of the documents on the tape are considered here. This permuted index has the peculiarity of automatically regrouping synonyms and certain grammatical variations of the words. (author) [fr

Finite Word-Length Effects in Digital State-Space Filters

Directory of Open Access Journals (Sweden)

B. Psenicka

1999-12-01

Full Text Available The state-space description of digital filters involves except the relationship between input and output signals an additional set of state variables. The state-space structures of digital filters have many positive properties compared with direct canonical structures. The main advantage of digital filter structures developed using state-space technique is a smaller sensitivity to quantization effects by fixed-point implementation. In our presentation, the emphasis is on the analysis of coefficient quantization and on existence of zero-input limit cycles in state-space digital filters. The comparison with direct form II structure is presented.

A Database Approach to Distributed State Space Generation

NARCIS (Netherlands)

Blom, Stefan; Lisser, Bert; van de Pol, Jan Cornelis; Weber, M.

2007-01-01

We study distributed state space generation on a cluster of workstations. It is explained why state space partitioning by a global hash function is problematic when states contain variables from unbounded domains, such as lists or other recursive datatypes. Our solution is to introduce a database

A Database Approach to Distributed State Space Generation

NARCIS (Netherlands)

Blom, Stefan; Lisser, Bert; van de Pol, Jan Cornelis; Weber, M.; Cerna, I.; Haverkort, Boudewijn R.H.M.

2008-01-01

We study distributed state space generation on a cluster of workstations. It is explained why state space partitioning by a global hash function is problematic when states contain variables from unbounded domains, such as lists or other recursive datatypes. Our solution is to introduce a database

State-Space Inference and Learning with Gaussian Processes

OpenAIRE

Turner, R; Deisenroth, MP; Rasmussen, CE

2010-01-01

18.10.13 KB. Ok to add author version to spiral, authors hold copyright. State-space inference and learning with Gaussian processes (GPs) is an unsolved problem. We propose a new, general methodology for inference and learning in nonlinear state-space models that are described probabilistically by non-parametric GP models. We apply the expectation maximization algorithm to iterate between inference in the latent state-space and learning the parameters of the underlying GP dynamics model. C...

ASAP: An Extensible Platform for State Space Analysis

DEFF Research Database (Denmark)

Westergaard, Michael; Evangelista, Sami; Kristensen, Lars Michael

2009-01-01

The ASCoVeCo State space Analysis Platform (ASAP) is a tool for performing explicit state space analysis of coloured Petri nets (CPNs) and other formalisms. ASAP supports a wide range of state space reduction techniques and is intended to be easy to extend and to use, making it a suitable tool fo...... for students, researchers, and industrial users that would like to analyze protocols and/or experiment with different algorithms. This paper presents ASAP from these two perspectives....

A Compositional Sweep-Line State Space Exploration Method

DEFF Research Database (Denmark)

Kristensen, Lars Michael; Mailund, Thomas

2002-01-01

State space exploration is a main approach to verification of finite-state systems. The sweep-line method exploits a certain kind of progress present in many systems to reduce peak memory usage during state space exploration. We present a new sweep-line algorithm for a compositional setting where...

Parameter and State Estimator for State Space Models

Directory of Open Access Journals (Sweden)

Ruifeng Ding

2014-01-01

Full Text Available This paper proposes a parameter and state estimator for canonical state space systems from measured input-output data. The key is to solve the system state from the state equation and to substitute it into the output equation, eliminating the state variables, and the resulting equation contains only the system inputs and outputs, and to derive a least squares parameter identification algorithm. Furthermore, the system states are computed from the estimated parameters and the input-output data. Convergence analysis using the martingale convergence theorem indicates that the parameter estimates converge to their true values. Finally, an illustrative example is provided to show that the proposed algorithm is effective.

Multiscale permutation entropy analysis of electrocardiogram

Science.gov (United States)

Liu, Tiebing; Yao, Wenpo; Wu, Min; Shi, Zhaorong; Wang, Jun; Ning, Xinbao

2017-04-01

To make a comprehensive nonlinear analysis to ECG, multiscale permutation entropy (MPE) was applied to ECG characteristics extraction to make a comprehensive nonlinear analysis of ECG. Three kinds of ECG from PhysioNet database, congestive heart failure (CHF) patients, healthy young and elderly subjects, are applied in this paper. We set embedding dimension to 4 and adjust scale factor from 2 to 100 with a step size of 2, and compare MPE with multiscale entropy (MSE). As increase of scale factor, MPE complexity of the three ECG signals are showing first-decrease and last-increase trends. When scale factor is between 10 and 32, complexities of the three ECG had biggest difference, entropy of the elderly is 0.146 less than the CHF patients and 0.025 larger than the healthy young in average, in line with normal physiological characteristics. Test results showed that MPE can effectively apply in ECG nonlinear analysis, and can effectively distinguish different ECG signals.

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

Science.gov (United States)

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.

Priorities in national space strategies and governance of the member states of the European Space Agency

Science.gov (United States)

Adriaensen, Maarten; Giannopapa, Christina; Sagath, Daniel; Papastefanou, Anastasia

2015-12-01

The European Space Agency (ESA) has twenty Member States with a variety of strategic priorities and governance structures regarding their space activities. A number of countries engage in space activities exclusively though ESA, while others have also their own national space programme. Some consider ESA as their prime space agency and others have additionally their own national agency with respective programmes. The main objective of this paper is to provide an up-to date overview and a holistic assessment of strategic priorities and the national space governance structures in 20 ESA Member States. This analysis and assessment has been conducted by analysing the Member States public documents, information provided at ESA workshop on this topic and though unstructured interviews. The paper is structured to include two main elements: priorities and trends in national space strategies and space governance in ESA Member States. The first part of this paper focuses on the content and analysis of the national space strategies and indicates the main priorities and trends in Member States. The priorities are categorised with regards to technology domains, the role of space in the areas of sustainability and the motivators that boost engagement in space. These vary from one Member State to another and include with different levels of engagement in technology domains amongst others: science and exploration, navigation, Earth observation, human space flight, launchers, telecommunications, and integrated applications. Member States allocate a different role of space as enabling tool adding to the advancement of sustainability areas including: security, resources, environment and climate change, transport and communication, energy, and knowledge and education. The motivators motivating reasoning which enhances or hinders space engagement also differs. The motivators identified are industrial competitiveness, job creation, technology development and transfer, social benefits

MCPerm: a Monte Carlo permutation method for accurately correcting the multiple testing in a meta-analysis of genetic association studies.

Directory of Open Access Journals (Sweden)

Yongshuai Jiang

Full Text Available Traditional permutation (TradPerm tests are usually considered the gold standard for multiple testing corrections. However, they can be difficult to complete for the meta-analyses of genetic association studies based on multiple single nucleotide polymorphism loci as they depend on individual-level genotype and phenotype data to perform random shuffles, which are not easy to obtain. Most meta-analyses have therefore been performed using summary statistics from previously published studies. To carry out a permutation using only genotype counts without changing the size of the TradPerm P-value, we developed a Monte Carlo permutation (MCPerm method. First, for each study included in the meta-analysis, we used a two-step hypergeometric distribution to generate a random number of genotypes in cases and controls. We then carried out a meta-analysis using these random genotype data. Finally, we obtained the corrected permutation P-value of the meta-analysis by repeating the entire process N times. We used five real datasets and five simulation datasets to evaluate the MCPerm method and our results showed the following: (1 MCPerm requires only the summary statistics of the genotype, without the need for individual-level data; (2 Genotype counts generated by our two-step hypergeometric distributions had the same distributions as genotype counts generated by shuffling; (3 MCPerm had almost exactly the same permutation P-values as TradPerm (r = 0.999; P<2.2e-16; (4 The calculation speed of MCPerm is much faster than that of TradPerm. In summary, MCPerm appears to be a viable alternative to TradPerm, and we have developed it as a freely available R package at CRAN: http://cran.r-project.org/web/packages/MCPerm/index.html.

Amplitude-aware permutation entropy: Illustration in spike detection and signal segmentation.

Science.gov (United States)

Azami, Hamed; Escudero, Javier

2016-05-01

Signal segmentation and spike detection are two important biomedical signal processing applications. Often, non-stationary signals must be segmented into piece-wise stationary epochs or spikes need to be found among a background of noise before being further analyzed. Permutation entropy (PE) has been proposed to evaluate the irregularity of a time series. PE is conceptually simple, structurally robust to artifacts, and computationally fast. It has been extensively used in many applications, but it has two key shortcomings. First, when a signal is symbolized using the Bandt-Pompe procedure, only the order of the amplitude values is considered and information regarding the amplitudes is discarded. Second, in the PE, the effect of equal amplitude values in each embedded vector is not addressed. To address these issues, we propose a new entropy measure based on PE: the amplitude-aware permutation entropy (AAPE). AAPE is sensitive to the changes in the amplitude, in addition to the frequency, of the signals thanks to it being more flexible than the classical PE in the quantification of the signal motifs. To demonstrate how the AAPE method can enhance the quality of the signal segmentation and spike detection, a set of synthetic and realistic synthetic neuronal signals, electroencephalograms and neuronal data are processed. We compare the performance of AAPE in these problems against state-of-the-art approaches and evaluate the significance of the differences with a repeated ANOVA with post hoc Tukey's test. In signal segmentation, the accuracy of AAPE-based method is higher than conventional segmentation methods. AAPE also leads to more robust results in the presence of noise. The spike detection results show that AAPE can detect spikes well, even when presented with single-sample spikes, unlike PE. For multi-sample spikes, the changes in AAPE are larger than in PE. We introduce a new entropy metric, AAPE, that enables us to consider amplitude information in the

Off-diagonal generalization of the mixed-state geometric phase

International Nuclear Information System (INIS)

Filipp, Stefan; Sjoeqvist, Erik

2003-01-01

The concept of off-diagonal geometric phases for mixed quantal states in unitary evolution is developed. We show that these phases arise from three basic ideas: (1) fulfillment of quantum parallel transport of a complete basis, (2) a concept of mixed-state orthogonality adapted to unitary evolution, and (3) a normalization condition. We provide a method for computing the off-diagonal mixed-state phases to any order for unitarities that divide the parallel transported basis of Hilbert space into two parts: one part where each basis vector undergoes cyclic evolution and one part where all basis vectors are permuted among each other. We also demonstrate a purification based experimental procedure for the two lowest-order mixed-state phases and consider a physical scenario for a full characterization of the qubit mixed-state geometric phases in terms of polarization-entangled photon pairs. An alternative second order off-diagonal mixed-state geometric phase, which can be tested in single-particle experiments, is proposed

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Coherent states in the fermionic Fock space

International Nuclear Information System (INIS)

Oeckl, Robert

2015-01-01

We construct the coherent states in the sense of Gilmore and Perelomov for the fermionic Fock space. Our treatment is from the outset adapted to the infinite-dimensional case. The fermionic Fock space becomes in this way a reproducing kernel Hilbert space of continuous holomorphic functions. (paper)

Remark on Hopf images in quantum permutation groups $S_n^+$

OpenAIRE

Józiak, Paweł

2016-01-01

Motivated by a question of A.~Skalski and P.M.~So{\\l}tan about inner faithfulness of the S.~Curran's map, we revisit the results and techniques of T.~Banica and J.~Bichon's Crelle paper and study some group-theoretic properties of the quantum permutation group on $4$ points. This enables us not only to answer the aforementioned question in positive in case $n=4, k=2$, but also to classify the automorphisms of $S_4^+$, describe all the embeddings $O_{-1}(2)\\subset S_4^+$ and show that all the ...

A Learning State-Space Model for Image Retrieval

Directory of Open Access Journals (Sweden)

Lee Greg C

2007-01-01

Full Text Available This paper proposes an approach based on a state-space model for learning the user concepts in image retrieval. We first design a scheme of region-based image representation based on concept units, which are integrated with different types of feature spaces and with different region scales of image segmentation. The design of the concept units aims at describing similar characteristics at a certain perspective among relevant images. We present the details of our proposed approach based on a state-space model for interactive image retrieval, including likelihood and transition models, and we also describe some experiments that show the efficacy of our proposed model. This work demonstrates the feasibility of using a state-space model to estimate the user intuition in image retrieval.

Permutation entropy of finite-length white-noise time series.

Science.gov (United States)

Little, Douglas J; Kane, Deb M

2016-08-01

Permutation entropy (PE) is commonly used to discriminate complex structure from white noise in a time series. While the PE of white noise is well understood in the long time-series limit, analysis in the general case is currently lacking. Here the expectation value and variance of white-noise PE are derived as functions of the number of ordinal pattern trials, N, and the embedding dimension, D. It is demonstrated that the probability distribution of the white-noise PE converges to a χ^{2} distribution with D!-1 degrees of freedom as N becomes large. It is further demonstrated that the PE variance for an arbitrary time series can be estimated as the variance of a related metric, the Kullback-Leibler entropy (KLE), allowing the qualitative N≫D! condition to be recast as a quantitative estimate of the N required to achieve a desired PE calculation precision. Application of this theory to statistical inference is demonstrated in the case of an experimentally obtained noise series, where the probability of obtaining the observed PE value was calculated assuming a white-noise time series. Standard statistical inference can be used to draw conclusions whether the white-noise null hypothesis can be accepted or rejected. This methodology can be applied to other null hypotheses, such as discriminating whether two time series are generated from different complex system states.

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

Science.gov (United States)

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.

A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem

Directory of Open Access Journals (Sweden)

Jian Gao

2011-08-01

Full Text Available Distributed Permutation Flowshop Scheduling Problem (DPFSP is a newly proposed scheduling problem, which is a generalization of classical permutation flow shop scheduling problem. The DPFSP is NP-hard in general. It is in the early stages of studies on algorithms for solving this problem. In this paper, we propose a GA-based algorithm, denoted by GA_LS, for solving this problem with objective to minimize the maximum completion time. In the proposed GA_LS, crossover and mutation operators are designed to make it suitable for the representation of DPFSP solutions, where the set of partial job sequences is employed. Furthermore, GA_LS utilizes an efficient local search method to explore neighboring solutions. The local search method uses three proposed rules that move jobs within a factory or between two factories. Intensive experiments on the benchmark instances, extended from Taillard instances, are carried out. The results indicate that the proposed hybrid genetic algorithm can obtain better solutions than all the existing algorithms for the DPFSP, since it obtains better relative percentage deviation and differences of the results are also statistically significant. It is also seen that best-known solutions for most instances are updated by our algorithm. Moreover, we also show the efficiency of the GA_LS by comparing with similar genetic algorithms with the existing local search methods.

Use of spatial symmetry in atomic--integral calculations: an efficient permutational approach

International Nuclear Information System (INIS)

Rouzo, H.L.

1979-01-01

The minimal number of independent nonzero atomic integrals that occur over arbitrarily oriented basis orbitals of the form R(r).Y/sub lm/(Ω) is theoretically derived. The corresponding method can be easily applied to any point group, including the molecular continuous groups C/sub infinity v/ and D/sub infinity h/. On the basis of this (theoretical) lower bound, the efficiency of the permutational approach in generating sets of independent integrals is discussed. It is proved that lobe orbitals are always more efficient than the familiar Cartesian Gaussians, in the sense that GLOS provide the shortest integral lists. Moreover, it appears that the new axial GLOS often lead to a number of integrals, which is the theoretical lower bound previously defined. With AGLOS, the numbers of two-electron integrals to be computed, stored, and processed are divided by factors 2.9 (NH 3 ), 4.2 (C 5 H 5 ), and 3.6 (C 6 H 6 ) with reference to the corresponding CGTOS calculations. Remembering that in the permutational approach, atomic integrals are directly computed without any four-indice transformation, it appears that its utilization in connection with AGLOS provides one of the most powerful tools for treating symmetrical species. 34 references

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

Science.gov (United States)

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.

State-space prediction model for chaotic time series

Science.gov (United States)

Alparslan, A. K.; Sayar, M.; Atilgan, A. R.

1998-08-01

A simple method for predicting the continuation of scalar chaotic time series ahead in time is proposed. The false nearest neighbors technique in connection with the time-delayed embedding is employed so as to reconstruct the state space. A local forecasting model based upon the time evolution of the topological neighboring in the reconstructed phase space is suggested. A moving root-mean-square error is utilized in order to monitor the error along the prediction horizon. The model is tested for the convection amplitude of the Lorenz model. The results indicate that for approximately 100 cycles of the training data, the prediction follows the actual continuation very closely about six cycles. The proposed model, like other state-space forecasting models, captures the long-term behavior of the system due to the use of spatial neighbors in the state space.

State Machine Modeling of the Space Launch System Solid Rocket Boosters

Science.gov (United States)

Harris, Joshua A.; Patterson-Hine, Ann

2013-01-01

The Space Launch System is a Shuttle-derived heavy-lift vehicle currently in development to serve as NASA's premiere launch vehicle for space exploration. The Space Launch System is a multistage rocket with two Solid Rocket Boosters and multiple payloads, including the Multi-Purpose Crew Vehicle. Planned Space Launch System destinations include near-Earth asteroids, the Moon, Mars, and Lagrange points. The Space Launch System is a complex system with many subsystems, requiring considerable systems engineering and integration. To this end, state machine analysis offers a method to support engineering and operational e orts, identify and avert undesirable or potentially hazardous system states, and evaluate system requirements. Finite State Machines model a system as a finite number of states, with transitions between states controlled by state-based and event-based logic. State machines are a useful tool for understanding complex system behaviors and evaluating "what-if" scenarios. This work contributes to a state machine model of the Space Launch System developed at NASA Ames Research Center. The Space Launch System Solid Rocket Booster avionics and ignition subsystems are modeled using MATLAB/Stateflow software. This model is integrated into a larger model of Space Launch System avionics used for verification and validation of Space Launch System operating procedures and design requirements. This includes testing both nominal and o -nominal system states and command sequences.

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

Energy Technology Data Exchange (ETDEWEB)

Xu, Kaixuan, E-mail: kaixuanxubjtu@yeah.net; Wang, Jun

2017-02-26

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. - Highlights: • Two new entropy approaches for estimation of nonlinear complexity are proposed for the financial market. • Effectiveness analysis of proposed methods is presented and their respective features are studied. • Empirical research of proposed analysis on seven world financial market indices. • Numerical simulation of Potts financial dynamics is preformed for nonlinear complexity behaviors.

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

International Nuclear Information System (INIS)

Xu, Kaixuan; Wang, Jun

2017-01-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. - Highlights: • Two new entropy approaches for estimation of nonlinear complexity are proposed for the financial market. • Effectiveness analysis of proposed methods is presented and their respective features are studied. • Empirical research of proposed analysis on seven world financial market indices. • Numerical simulation of Potts financial dynamics is preformed for nonlinear complexity behaviors.

Permutation symmetry and the origin of fermion mass hierarchy

International Nuclear Information System (INIS)

Babu, K.S.; Mohapatra, R.N.

1990-01-01

A realization of the ''flavor-democracy'' approach to quark and lepton masses is provided in the context of the standard model with a horizontal S 3 permutation symmetry. In this model, t and b quarks pick up mass at the tree level, c, s-quark and τ-lepton masses arise at the one-loop level, u, d, and μ masses at the two-loop level, and the electron mass at the three-loop level, thus reproducing the observed hierarchial structure without fine tuning of the Yukawa couplings. The pattern of quark mixing angles also emerges naturally, with V us ,V cb ∼O(ε), V ub ∼O(ε 2 ), where ε is a loop expansion parameter

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Identified state-space prediction model for aero-optical wavefronts

Science.gov (United States)

Faghihi, Azin; Tesch, Jonathan; Gibson, Steve

2013-07-01

A state-space disturbance model and associated prediction filter for aero-optical wavefronts are described. The model is computed by system identification from a sequence of wavefronts measured in an airborne laboratory. Estimates of the statistics and flow velocity of the wavefront data are shown and can be computed from the matrices in the state-space model without returning to the original data. Numerical results compare velocity values and power spectra computed from the identified state-space model with those computed from the aero-optical data.

Distributed Graph-Based State Space Generation

NARCIS (Netherlands)

Blom, Stefan; Kant, Gijs; Rensink, Arend; De Lara, J.; Varro, D.

LTSMIN provides a framework in which state space generation can be distributed easily over many cores on a single compute node, as well as over multiple compute nodes. The tool works on the basis of a vector representation of the states; the individual cores are assigned the task of computing all

Space groups for solid state scientists

CERN Document Server

Glazer, Michael; Glazer, Alexander N

2014-01-01

This Second Edition provides solid state scientists, who are not necessarily experts in crystallography, with an understandable and comprehensive guide to the new International Tables for Crystallography. The basic ideas of symmetry, lattices, point groups, and space groups are explained in a clear and detailed manner. Notation is introduced in a step-by-step way so that the reader is supplied with the tools necessary to derive and apply space group information. Of particular interest in this second edition are the discussions of space groups application to such timely topics as high-te

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

Science.gov (United States)

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.

Quantization of Space-like States in Lorentz-Violating Theories

Science.gov (United States)

Colladay, Don

2018-01-01

Lorentz violation frequently induces modified dispersion relations that can yield space-like states that impede the standard quantization procedures. In certain cases, an extended Hamiltonian formalism can be used to define observer-covariant normalization factors for field expansions and phase space integrals. These factors extend the theory to include non-concordant frames in which there are negative-energy states. This formalism provides a rigorous way to quantize certain theories containing space-like states and allows for the consistent computation of Cherenkov radiation rates in arbitrary frames and avoids singular expressions.

System resiliency quantification using non-state-space and state-space analytic models

International Nuclear Information System (INIS)

Ghosh, Rahul; Kim, DongSeong; Trivedi, Kishor S.

2013-01-01

Resiliency is becoming an important service attribute for large scale distributed systems and networks. Key problems in resiliency quantification are lack of consensus on the definition of resiliency and systematic approach to quantify system resiliency. In general, resiliency is defined as the ability of (system/person/organization) to recover/defy/resist from any shock, insult, or disturbance [1]. Many researchers interpret resiliency as a synonym for fault-tolerance and reliability/availability. However, effect of failure/repair on systems is already covered by reliability/availability measures and that of on individual jobs is well covered under the umbrella of performability [2] and task completion time analysis [3]. We use Laprie [4] and Simoncini [5]'s definition in which resiliency is the persistence of service delivery that can justifiably be trusted, when facing changes. The changes we are referring to here are beyond the envelope of system configurations already considered during system design, that is, beyond fault tolerance. In this paper, we outline a general approach for system resiliency quantification. Using examples of non-state-space and state-space stochastic models, we analytically–numerically quantify the resiliency of system performance, reliability, availability and performability measures w.r.t. structural and parametric changes

A Colour Image Encryption Scheme Using Permutation-Substitution Based on Chaos

Directory of Open Access Journals (Sweden)

Xing-Yuan Wang

2015-06-01

Full Text Available An encryption scheme for colour images using a spatiotemporal chaotic system is proposed. Initially, we use the R, G and B components of a colour plain-image to form a matrix. Then the matrix is permutated by using zigzag path scrambling. The resultant matrix is then passed through a substitution process. Finally, the ciphered colour image is obtained from the confused matrix. Theoretical analysis and experimental results indicate that the proposed scheme is both secure and practical, which make it suitable for encrypting colour images of any size.

A Studentized Permutation Test for the Comparison of Spatial Point Patterns

DEFF Research Database (Denmark)

Hahn, Ute

of empirical K-functions are compared by a permutation test using a studentized test statistic. The proposed test performs convincingly in terms of empirical level and power in a simulation study, even for point patterns where the K-function estimates on neighboring subsamples are not strictly exchangeable....... It also shows improved behavior compared to a test suggested by Diggle et al. (1991, 2000) for the comparison of groups of independently replicated point patterns. In an application to two point patterns from pathology that represent capillary positions in sections of healthy and tumorous tissue, our...

States in the Hilbert space formulation and in the phase space formulation of quantum mechanics

International Nuclear Information System (INIS)

Tosiek, J.; Brzykcy, P.

2013-01-01

We consider the problem of testing whether a given matrix in the Hilbert space formulation of quantum mechanics or a function considered in the phase space formulation of quantum theory represents a quantum state. We propose several practical criteria for recognising states in these two versions of quantum physics. After minor modifications, they can be applied to check positivity of any operators acting in a Hilbert space or positivity of any functions from an algebra with a ∗-product of Weyl type. -- Highlights: ► Methods of testing whether a given matrix represents a quantum state. ► The Stratonovich–Weyl correspondence on an arbitrary symplectic manifold. ► Criteria for checking whether a function on a symplectic space is a Wigner function

How to upload a physical quantum state into correlation space

International Nuclear Information System (INIS)

Morimae, Tomoyuki

2011-01-01

In the framework of the computational tensor network [Phys. Rev. Lett. 98, 220503 (2007)], the quantum computation is performed in a virtual linear space called the correlation space. It was recently shown [Phys. Rev. Lett. 103, 050503 (2009)] that a state in a correlation space can be downloaded to the real physical space. In this paper, conversely, we study how to upload a state from a real physical space to the correlation space. After showing the impossibility of cloning a state between a real physical space and the correlation space, we propose a simple teleportation-like method of uploading. This method also enables the Gottesman-Chuang gate teleportation trick and entanglement swapping in the virtual-real hybrid setting. Furthermore, compared with the inverse of the downloading method by Cai et al. [Phys. Rev. Lett. 103, 050503 (2009)], which also works to upload, the proposed uploading method has several advantages.

State-space approach for evaluating the soil-plant-atmosphere system

International Nuclear Information System (INIS)

Timm, L.C.; Reichardt, K.; Cassaro, F.A.M.; Tominaga, T.T.; Bacchi, O.O.S.; Oliveira, J.C.M.; Dourado-Neto, D.

2004-01-01

Using as examples one sugarcane and one forage oat experiment, both carried out in the State of Sao Paulo, Brazil, this chapter presents recent state-space approaches used to evaluate the relation between soil and plant properties. A contrast is made between classical statistics methodologies that do not take into account the sampling position coordinates, and the more recently used methodologies which include the position coordinates, and allow a better interpretation of the field-sampled data. Classical concepts are first introduced, followed by spatially referenced methodologies like the autocorrelation function, the cross correlation function, and the state-space approach. Two variations of the state-space approach are given: one emphasizes the evolution of the state system while the other based on the bayesian formulation emphasizes the evolution of the estimated observations. It is concluded that these state-space analyses using dynamic regression models improve data analyses and are therefore recommended for analyzing time and space data series related to the performance of a given soil-plant-atmosphere system. (author)

The coherent state on SUq(2) homogeneous space

International Nuclear Information System (INIS)

Aizawa, N; Chakrabarti, R

2009-01-01

The generalized coherent states for quantum groups introduced by Jurco and StovIcek are studied for the simplest example SU q (2) in full detail. It is shown that the normalized SU q (2) coherent states enjoy the property of completeness, and allow a resolution of the unity. This feature is expected to play a key role in the application of these coherent states in physical models. The homogeneous space of SU q (2), i.e. the q-sphere of Podles, is reproduced in complex coordinates by using the coherent states. Differential calculus in the complex form on the homogeneous space is developed. The high spin limit of the SU q (2) coherent states is also discussed.

Tag-KEM from Set Partial Domain One-Way Permutations

Science.gov (United States)

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.

Complexity in Simplicity: Flexible Agent-based State Space Exploration

DEFF Research Database (Denmark)

Rasmussen, Jacob Illum; Larsen, Kim Guldstrand

2007-01-01

In this paper, we describe a new flexible framework for state space exploration based on cooperating agents. The idea is to let various agents with different search patterns explore the state space individually and communicate information about fruitful subpaths of the search tree to each other...

Making Faces - State-Space Models Applied to Multi-Modal Signal Processing

DEFF Research Database (Denmark)

Lehn-Schiøler, Tue

2005-01-01

The two main focus areas of this thesis are State-Space Models and multi modal signal processing. The general State-Space Model is investigated and an addition to the class of sequential sampling methods is proposed. This new algorithm is denoted as the Parzen Particle Filter. Furthermore...... optimizer can be applied to speed up convergence. The linear version of the State-Space Model, the Kalman Filter, is applied to multi modal signal processing. It is demonstrated how a State-Space Model can be used to map from speech to lip movements. Besides the State-Space Model and the multi modal...... application an information theoretic vector quantizer is also proposed. Based on interactions between particles, it is shown how a quantizing scheme based on an analytic cost function can be derived....

Volumes of conditioned bipartite state spaces

International Nuclear Information System (INIS)

Milz, Simon; Strunz, Walter T

2015-01-01

We analyze the metric properties of conditioned quantum state spaces M η (n×m) . These spaces are the convex sets of nm×nm density matrices that, when partially traced over m degrees of freedom, respectively yield the given n × n density matrix η. For the case n = 2, the volume of M η (2×m) equipped with the Hilbert–Schmidt measure can be conjectured to be a simple polynomial of the radius of η in the Bloch-ball. Remarkably, for m=2,3 we find numerically that the probability p sep (2×m) (η) to find a separable state in M η (2×m) is independent of η (except for η pure). For m>3, the same holds for p PosPart (2×m) (η), the probability to find a state with a positive partial transpose in M η (2×m) . These results are proven analytically for the case of the family of 4 × 4 X-states, and thoroughly numerically investigated for the general case. The important implications of these findings for the clarification of open problems in quantum theory are pointed out and discussed. (paper)

Projective limits of state spaces II. Quantum formalism

Science.gov (United States)

Lanéry, Suzanne; Thiemann, Thomas

2017-06-01

In this series of papers, we investigate the projective framework initiated by Kijowski (1977) and Okołów (2009, 2014, 2013), which describes the states of a quantum theory as projective families of density matrices. A short reading guide to the series can be found in Lanéry (2016). After discussing the formalism at the classical level in a first paper (Lanéry, 2017), the present second paper is devoted to the quantum theory. In particular, we inspect in detail how such quantum projective state spaces relate to inductive limit Hilbert spaces and to infinite tensor product constructions (Lanéry, 2016, subsection 3.1) [1]. Regarding the quantization of classical projective structures into quantum ones, we extend the results by Okołów (2013), that were set up in the context of linear configuration spaces, to configuration spaces given by simply-connected Lie groups, and to holomorphic quantization of complex phase spaces (Lanéry, 2016, subsection 2.2) [1].

Towards tricking a pathogen's protease into fighting infection: the 3D structure of a stable circularly permuted onconase variant cleavedby HIV-1 protease.

Directory of Open Access Journals (Sweden)

Mariona Callís

Full Text Available Onconase® is a highly cytotoxic amphibian homolog of Ribonuclease A. Here, we describe the construction of circularly permuted Onconase® variants by connecting the N- and C-termini of this enzyme with amino acid residues that are recognized and cleaved by the human immunodeficiency virus protease. Uncleaved circularly permuted Onconase® variants are unusually stable, non-cytotoxic and can internalize in human T-lymphocyte Jurkat cells. The structure, stability and dynamics of an intact and a cleaved circularly permuted Onconase® variant were determined by Nuclear Magnetic Resonance spectroscopy and provide valuable insight into the changes in catalytic efficiency caused by the cleavage. The understanding of the structural environment and the dynamics of the activation process represents a first step toward the development of more effective drugs for the treatment of diseases related to pathogens expressing a specific protease. By taking advantage of the protease's activity to initiate a cytotoxic cascade, this approach is thought to be less susceptible to known resistance mechanisms.

Projective limits of state spaces IV. Fractal label sets

Science.gov (United States)

Lanéry, Suzanne; Thiemann, Thomas

2018-01-01

Instead of formulating the state space of a quantum field theory over one big Hilbert space, it has been proposed by Kijowski (1977) to represent quantum states as projective families of density matrices over a collection of smaller, simpler Hilbert spaces (see Lanéry (2016) [1] for a concise introduction to this formalism). One can thus bypass the need to select a vacuum state for the theory, and still be provided with an explicit and constructive description of the quantum state space, at least as long as the label set indexing the projective structure is countable. Because uncountable label sets are much less practical in this context, we develop in the present article a general procedure to trim an originally uncountable label set down to countable cardinality. In particular, we investigate how to perform this tightening of the label set in a way that preserves both the physical content of the algebra of observables and its symmetries. This work is notably motivated by applications to the holonomy-flux algebra underlying Loop Quantum Gravity. Building on earlier work by Okołów (2013), a projective state space was introduced for this algebra in Lanéry and Thiemann (2016). However, the non-trivial structure of the holonomy-flux algebra prevents the construction of satisfactory semi-classical states (Lanéry and Thiemann, 2017). Implementing the general procedure just mentioned in the case of a one-dimensional version of this algebra, we show how a discrete subalgebra can be extracted without destroying universality nor diffeomorphism invariance. On this subalgebra, quantum states can then be constructed which are more regular than was possible on the original algebra. In particular, this allows the design of semi-classical states whose semi-classicality is enforced step by step, starting from collective, macroscopic degrees of freedom and going down progressively toward smaller and smaller scales.

Characterization of the permutations by block that have reversible one dimensional cellular automata; Caracterizacion de las permutaciones en bloque que representan automatas celulares unidimensionales reversibles

Energy Technology Data Exchange (ETDEWEB)

Seck Tuoh Mora, J. C. [Instituto Politecnico Nacional, Mexico, D. F. (Mexico)

2001-06-01

We present a review of reversible one dimensional cellular automata and their representation by block permutations. We analyze in detail the behavior of such block permutations to get their characterization. [Spanish] En el siguiente escrito se da una revision a la representacion y comportamiento de automatas celulares unidimensionales reversibles por medio de permutaciones en bloque. Hacemos un analisis detallado del comportamiento de dichas permutaciones para obtener su caracterizacion.

State-Space Modelling in Marine Science

DEFF Research Database (Denmark)

Albertsen, Christoffer Moesgaard

State-space models provide a natural framework for analysing time series that cannot be observed without error. This is the case for fisheries stock assessments and movement data from marine animals. In fisheries stock assessments, the aim is to estimate the stock size; however, the only data...... available is the number of fish removed from the population and samples on a small fraction of the population. In marine animal movement, accurate position systems such as GPS cannot be used. Instead, inaccurate alternative must be used yielding observations with large errors. Both assessment and individual...... animal movement models are important for management and conservation of marine animals. Consequently, models should be developed to be operational in a management context while adequately evaluating uncertainties in the models. This thesis develops state-space models using the Laplace approximation...

The unitary space of particle internal states

International Nuclear Information System (INIS)

Perjes, Z.

1978-09-01

A relativistic theory of particle internal properties has been developed. Suppressing space-time information, internal wave functions and -observables are constructed in a 3-complex-dimensional space. The quantum numbers of a spinning point particle in this unitary space correspond with those of a low-mass hadron. Unitary space physics is linked with space-time notions via the Penrose theory of twistors, where new flavors may be represented by many-twistor systems. It is shown here that a four-twistor particle fits into the unitary space picture as a system of two points with equal masses and oppositely pointing unitary spins. Quantum states fall into the ISU(3) irreducible representations discovered by Sparling and the author. Full details of the computation involving SU(3) recoupling techniques are given. (author)

Discriminating chaotic and stochastic dynamics through the permutation spectrum test

Energy Technology Data Exchange (ETDEWEB)

Kulp, C. W., E-mail: Kulp@lycoming.edu [Department of Astronomy and Physics, Lycoming College, Williamsport, Pennsylvania 17701 (United States); Zunino, L., E-mail: lucianoz@ciop.unlp.edu.ar [Centro de Investigaciones Ópticas (CONICET La Plata—CIC), C.C. 3, 1897 Gonnet (Argentina); Departamento de Ciencias Básicas, Facultad de Ingeniería, Universidad Nacional de La Plata (UNLP), 1900 La Plata (Argentina)

2014-09-01

In this paper, we propose a new heuristic symbolic tool for unveiling chaotic and stochastic dynamics: the permutation spectrum test. Several numerical examples allow us to confirm the usefulness of the introduced methodology. Indeed, we show that it is robust in situations in which other techniques fail (intermittent chaos, hyperchaotic dynamics, stochastic linear and nonlinear correlated dynamics, and deterministic non-chaotic noise-driven dynamics). We illustrate the applicability and reliability of this pragmatic method by examining real complex time series from diverse scientific fields. Taking into account that the proposed test has the advantages of being conceptually simple and computationally fast, we think that it can be of practical utility as an alternative test for determinism.

Multiple Memory Structure Bit Reversal Algorithm Based on Recursive Patterns of Bit Reversal Permutation

Directory of Open Access Journals (Sweden)

K. K. L. B. Adikaram

2014-01-01

Full Text Available With the increasing demand for online/inline data processing efficient Fourier analysis becomes more and more relevant. Due to the fact that the bit reversal process requires considerable processing time of the Fast Fourier Transform (FFT algorithm, it is vital to optimize the bit reversal algorithm (BRA. This paper is to introduce an efficient BRA with multiple memory structures. In 2009, Elster showed the relation between the first and the second halves of the bit reversal permutation (BRP and stated that it may cause serious impact on cache performance of the computer, if implemented. We found exceptions, especially when the said index mapping was implemented with multiple one-dimensional memory structures instead of multidimensional or one-dimensional memory structure. Also we found a new index mapping, even after the recursive splitting of BRP into equal sized slots. The four-array and the four-vector versions of BRA with new index mapping reported 34% and 16% improvement in performance in relation to similar versions of Linear BRA of Elster which uses single one-dimensional memory structure.

State space in BRST-quantization and Kugo-Ojima quartets

International Nuclear Information System (INIS)

Rybkin, G.N.

1989-01-01

The structure of the state space in the BRST-quantization is considered and the connection between different approaches to the proof of the positive definiteness of the metric on the physical state space is established. The correspondence between different expressions for the BRST-charge, quadratic in fields, is obtained. The relation between different representations of the BRST-algebra is found. 22 refs

Multivariate time series with linear state space structure

CERN Document Server

Gómez, Víctor

2016-01-01

This book presents a comprehensive study of multivariate time series with linear state space structure. The emphasis is put on both the clarity of the theoretical concepts and on efficient algorithms for implementing the theory. In particular, it investigates the relationship between VARMA and state space models, including canonical forms. It also highlights the relationship between Wiener-Kolmogorov and Kalman filtering both with an infinite and a finite sample. The strength of the book also lies in the numerous algorithms included for state space models that take advantage of the recursive nature of the models. Many of these algorithms can be made robust, fast, reliable and efficient. The book is accompanied by a MATLAB package called SSMMATLAB and a webpage presenting implemented algorithms with many examples and case studies. Though it lays a solid theoretical foundation, the book also focuses on practical application, and includes exercises in each chapter. It is intended for researchers and students wor...

Electromyographic permutation entropy quantifies diaphragmatic denervation and reinnervation.

Directory of Open Access Journals (Sweden)

Christopher Kramer

Full Text Available Spontaneous reinnervation after diaphragmatic paralysis due to trauma, surgery, tumors and spinal cord injuries is frequently observed. A possible explanation could be collateral reinnervation, since the diaphragm is commonly double-innervated by the (accessory phrenic nerve. Permutation entropy (PeEn, a complexity measure for time series, may reflect a functional state of neuromuscular transmission by quantifying the complexity of interactions across neural and muscular networks. In an established rat model, electromyographic signals of the diaphragm after phrenicotomy were analyzed using PeEn quantifying denervation and reinnervation. Thirty-three anesthetized rats were unilaterally phrenicotomized. After 1, 3, 9, 27 and 81 days, diaphragmatic electromyographic PeEn was analyzed in vivo from sternal, mid-costal and crural areas of both hemidiaphragms. After euthanasia of the animals, both hemidiaphragms were dissected for fiber type evaluation. The electromyographic incidence of an accessory phrenic nerve was 76%. At day 1 after phrenicotomy, PeEn (normalized values was significantly diminished in the sternal (median: 0.69; interquartile range: 0.66-0.75 and mid-costal area (0.68; 0.66-0.72 compared to the non-denervated side (0.84; 0.78-0.90 at threshold p<0.05. In the crural area, innervated by the accessory phrenic nerve, PeEn remained unchanged (0.79; 0.72-0.86. During reinnervation over 81 days, PeEn normalized in the mid-costal area (0.84; 0.77-0.86, whereas it remained reduced in the sternal area (0.77; 0.70-0.81. Fiber type grouping, a histological sign for reinnervation, was found in the mid-costal area in 20% after 27 days and in 80% after 81 days. Collateral reinnervation can restore diaphragm activity after phrenicotomy. Electromyographic PeEn represents a new, distinctive assessment characterizing intramuscular function following denervation and reinnervation.

State-Space Realization of the Wave-Radiation Force within FAST: Preprint

Energy Technology Data Exchange (ETDEWEB)

Duarte, T.; Sarmento, A.; Alves, M.; Jonkman, J.

2013-06-01

Several methods have been proposed in the literature to find a state-space model for the wave-radiation forces. In this paper, four methods were compared, two in the frequency domain and two in the time domain. The frequency-response function and the impulse response of the resulting state-space models were compared against the ones derived by the numerical code WAMIT. The implementation of the state-space module within the FAST offshore wind turbine computer-aided engineering (CAE) tool was verified, comparing the results against the previously implemented numerical convolution method. The results agreed between the two methods, with a significant reduction in required computational time when using the state-space module.

Advanced Solid State Lighting for AES Deep Space Hab

Data.gov (United States)

National Aeronautics and Space Administration — The advanced Solid State Lighting (SSL) assemblies augmented 2nd generation modules under development for the Advanced Exploration Systems Deep Space Habitat in...

A dynamical topology for the space of states

International Nuclear Information System (INIS)

Dittrich, J.

1979-01-01

A new topology is introduced for the space of states of a physical system. This topology is given by dynamics, every state has a neighbourhood consisting of states connected by the time evolution only. With respect to the new topology, all conservation laws can be treated as topological laws. (author)

Space Sciences Education and Outreach Project of Moscow State University

Science.gov (United States)

Krasotkin, S.

2006-11-01

sergekras@mail.ru The space sciences education and outreach project was initiated at Moscow State University in order to incorporate modern space research into the curriculum popularize the basics of space physics, and enhance public interest in space exploration. On 20 January 2005 the first Russian University Satellite “Universitetskiy-Tatyana” was launched into circular polar orbit (inclination 83 deg., altitude 940-980 km). The onboard scientific complex “Tatyana“, as well as the mission control and information receiving centre, was designed and developed at Moscow State University. The scientific programme of the mission includes measurements of space radiation in different energy channels and Earth UV luminosity and lightning. The current education programme consists of basic multimedia lectures “Life of the Earth in the Solar Atmosphere” and computerized practice exercises “Space Practice” (based on the quasi-real-time data obtained from “Universitetskiy-Tatyana” satellite and other Internet resources). A multimedia lectures LIFE OF EARTH IN THE SOLAR ATMOSPHERE containing the basic information and demonstrations of heliophysics (including Sun structure and solar activity, heliosphere and geophysics, solar-terrestrial connections and solar influence on the Earth’s life) was created for upper high-school and junior university students. For the upper-university students there a dozen special computerized hands-on exercises were created based on the experimental quasi-real-time data obtained from our satellites. Students specializing in space physics from a few Russian universities are involved in scientific work. Educational materials focus on upper high school, middle university and special level for space physics students. Moscow State University is now extending its space science education programme by creating multimedia lectures on remote sensing, space factors and materials study, satellite design and development, etc. The space

State space modeling of Memristor-based Wien oscillator

KAUST Repository

Talukdar, Abdul Hafiz Ibne; Radwan, Ahmed G.; Salama, Khaled N.

2011-01-01

State space modeling of Memristor based Wien 'A' oscillator has been demonstrated for the first time considering nonlinear ion drift in Memristor. Time dependant oscillating resistance of Memristor is reported in both state space solution and SPICE simulation which plausibly provide the basis of realizing parametric oscillation by Memristor based Wien oscillator. In addition to this part Memristor is shown to stabilize the final oscillation amplitude by means of its nonlinear dynamic resistance which hints for eliminating diode in the feedback network of conventional Wien oscillator. © 2011 IEEE.

State space modeling of Memristor-based Wien oscillator

KAUST Repository

Talukdar, Abdul Hafiz Ibne

2011-12-01

State space modeling of Memristor based Wien \\'A\\' oscillator has been demonstrated for the first time considering nonlinear ion drift in Memristor. Time dependant oscillating resistance of Memristor is reported in both state space solution and SPICE simulation which plausibly provide the basis of realizing parametric oscillation by Memristor based Wien oscillator. In addition to this part Memristor is shown to stabilize the final oscillation amplitude by means of its nonlinear dynamic resistance which hints for eliminating diode in the feedback network of conventional Wien oscillator. © 2011 IEEE.

Coherent and squeezed states in phase space

International Nuclear Information System (INIS)

Jannussis, A.; Bartzis, V.; Vlahos, E.

1990-01-01

In the present paper, the coherent and the squeezed states in phase space have been studied. From the wave functions of the coherent and the squeezed state, their corresponding Wigner distribution functions are calculated. Especially the calculation of the corresponding Wigner functions for the above states permits the determination of the mean values of position and momentum and thus the Heisenberg uncertainty relation. In fact, from the related results, it is concluded that the uncertainty relation of the coherent and associated squeezed states is the same

Permutation tests for goodness-of-fit testing of mathematical models to experimental data.

Science.gov (United States)

Fişek, M Hamit; Barlas, Zeynep

2013-03-01

This paper presents statistical procedures for improving the goodness-of-fit testing of theoretical models to data obtained from laboratory experiments. We use an experimental study in the expectation states research tradition which has been carried out in the "standardized experimental situation" associated with the program to illustrate the application of our procedures. We briefly review the expectation states research program and the fundamentals of resampling statistics as we develop our procedures in the resampling context. The first procedure we develop is a modification of the chi-square test which has been the primary statistical tool for assessing goodness of fit in the EST research program, but has problems associated with its use. We discuss these problems and suggest a procedure to overcome them. The second procedure we present, the "Average Absolute Deviation" test, is a new test and is proposed as an alternative to the chi square test, as being simpler and more informative. The third and fourth procedures are permutation versions of Jonckheere's test for ordered alternatives, and Kendall's tau(b), a rank order correlation coefficient. The fifth procedure is a new rank order goodness-of-fit test, which we call the "Deviation from Ideal Ranking" index, which we believe may be more useful than other rank order tests for assessing goodness-of-fit of models to experimental data. The application of these procedures to the sample data is illustrated in detail. We then present another laboratory study from an experimental paradigm different from the expectation states paradigm - the "network exchange" paradigm, and describe how our procedures may be applied to this data set. Copyright © 2012 Elsevier Inc. All rights reserved.

Linear algebra of the permutation invariant Crow-Kimura model of prebiotic evolution.

Science.gov (United States)

Bratus, Alexander S; Novozhilov, Artem S; Semenov, Yuri S

2014-10-01

A particular case of the famous quasispecies model - the Crow-Kimura model with a permutation invariant fitness landscape - is investigated. Using the fact that the mutation matrix in the case of a permutation invariant fitness landscape has a special tridiagonal form, a change of the basis is suggested such that in the new coordinates a number of analytical results can be obtained. In particular, using the eigenvectors of the mutation matrix as the new basis, we show that the quasispecies distribution approaches a binomial one and give simple estimates for the speed of convergence. Another consequence of the suggested approach is a parametric solution to the system of equations determining the quasispecies. Using this parametric solution we show that our approach leads to exact asymptotic results in some cases, which are not covered by the existing methods. In particular, we are able to present not only the limit behavior of the leading eigenvalue (mean population fitness), but also the exact formulas for the limit quasispecies eigenvector for special cases. For instance, this eigenvector has a geometric distribution in the case of the classical single peaked fitness landscape. On the biological side, we propose a mathematical definition, based on the closeness of the quasispecies to the binomial distribution, which can be used as an operational definition of the notorious error threshold. Using this definition, we suggest two approximate formulas to estimate the critical mutation rate after which the quasispecies delocalization occurs. Copyright © 2014 Elsevier Inc. All rights reserved.

Formulating state space models in R with focus on longitudinal regression models

DEFF Research Database (Denmark)

Dethlefsen, Claus; Lundbye-Christensen, Søren

  We provide a language for formulating a range of state space models. The described methodology is implemented in the R -package sspir available from cran.r-project.org . A state space model is specified similarly to a generalized linear model in R , by marking the time-varying terms in the form......  We provide a language for formulating a range of state space models. The described methodology is implemented in the R -package sspir available from cran.r-project.org . A state space model is specified similarly to a generalized linear model in R , by marking the time-varying terms...

Modeling volatility using state space models.

Science.gov (United States)

Timmer, J; Weigend, A S

1997-08-01

In time series problems, noise can be divided into two categories: dynamic noise which drives the process, and observational noise which is added in the measurement process, but does not influence future values of the system. In this framework, we show that empirical volatilities (the squared relative returns of prices) exhibit a significant amount of observational noise. To model and predict their time evolution adequately, we estimate state space models that explicitly include observational noise. We obtain relaxation times for shocks in the logarithm of volatility ranging from three weeks (for foreign exchange) to three to five months (for stock indices). In most cases, a two-dimensional hidden state is required to yield residuals that are consistent with white noise. We compare these results with ordinary autoregressive models (without a hidden state) and find that autoregressive models underestimate the relaxation times by about two orders of magnitude since they do not distinguish between observational and dynamic noise. This new interpretation of the dynamics of volatility in terms of relaxators in a state space model carries over to stochastic volatility models and to GARCH models, and is useful for several problems in finance, including risk management and the pricing of derivative securities. Data sets used: Olsen & Associates high frequency DEM/USD foreign exchange rates (8 years). Nikkei 225 index (40 years). Dow Jones Industrial Average (25 years).

State Space Reduction for Model Checking Agent Programs

NARCIS (Netherlands)

S.-S.T.Q. Jongmans (Sung-Shik); K.V. Hindriks; M.B. van Riemsdijk; L. Dennis; O. Boissier; R.H. Bordini (Rafael)

2012-01-01

htmlabstractState space reduction techniques have been developed to increase the efficiency of model checking in the context of imperative programming languages. Unfortunately, these techniques cannot straightforwardly be applied to agents: the nature of states in the two programming paradigms

On the trajectories of CRL...LR...R orbits, their period-doubling cascades and saddle-node bifurcation cascades

International Nuclear Information System (INIS)

Cerrada, Lucia; San Martin, Jesus

2011-01-01

In this Letter, it is shown that from a two region partition of the phase space of a one-dimensional dynamical system, a p-region partition can be obtained for the CRL...LR...R orbits. That is, permutations associated with symbolic sequences are obtained. As a consequence, the trajectory in phase space is directly deduced from permutation. From this permutation other permutations associated with period-doubling and saddle-node bifurcation cascades are derived, as well as other composite permutations. - Research highlights: → Symbolic sequences are the usual topological approach to dynamical systems. → Permutations bear more physical information than symbolic sequences. → Period-doubling cascade permutations associated with original sequences are obtained. → Saddle-node cascade permutations associated with original sequences are obtained. → Composite permutations are derived.

Automatic Design of a Maglev Controller in State Space

Science.gov (United States)

1991-12-01

Design of a Maglev Controller in State Space Feng Zhao Richard Thornton Abstract We describe the automatic synthesis of a global nonlinear controller for...the global switching points of the controller is presented. The synthesized control system can stabilize the maglev vehicle with large initial displace...NUMBERS Automation Desing of a Maglev Controller in State Space N00014-89-J-3202 MIP-9001651 6. AUTHOR(S) Feng Zhao and Richard Thornton 7. PERFORMING

The Multimorbidity Cluster Analysis Tool: Identifying Combinations and Permutations of Multiple Chronic Diseases Using a Record-Level Computational Analysis

Directory of Open Access Journals (Sweden)

Kathryn Nicholson

2017-12-01

Full Text Available Introduction: Multimorbidity, or the co-occurrence of multiple chronic health conditions within an individual, is an increasingly dominant presence and burden in modern health care systems.  To fully capture its complexity, further research is needed to uncover the patterns and consequences of these co-occurring health states.  As such, the Multimorbidity Cluster Analysis Tool and the accompanying Multimorbidity Cluster Analysis Toolkit have been created to allow researchers to identify distinct clusters that exist within a sample of participants or patients living with multimorbidity.  Development: The Tool and Toolkit were developed at Western University in London, Ontario, Canada.  This open-access computational program (JAVA code and executable file was developed and tested to support an analysis of thousands of individual records and up to 100 disease diagnoses or categories.  Application: The computational program can be adapted to the methodological elements of a research project, including type of data, type of chronic disease reporting, measurement of multimorbidity, sample size and research setting.  The computational program will identify all existing, and mutually exclusive, combinations and permutations within the dataset.  An application of this computational program is provided as an example, in which more than 75,000 individual records and 20 chronic disease categories resulted in the detection of 10,411 unique combinations and 24,647 unique permutations among female and male patients.  Discussion: The Tool and Toolkit are now available for use by researchers interested in exploring the complexities of multimorbidity.  Its careful use, and the comparison between results, will be valuable additions to the nuanced understanding of multimorbidity.

Transformation of Socioeconomic Space: The Role of the State

Directory of Open Access Journals (Sweden)

Alexander Nikolaevich Shvetsov

2015-03-01

Full Text Available Modern Russia is traditionally characterized by a special and strong public participation in solving problems of spatial development. Thus, the state has following diverse roles: 1 the creator of the modern space configuration; 2 the mastermind and main driving force of modern spatial transformations; 3 the regulator and investor of these processes; 4 the main sponsor and beneficiary of space transformation; and, finally, the hostage of its own dominance in the processes of spatial transformation. However, stereotypes are being gradually overcome and public policy in the area of spatial transformations focuses not only on «public projects» but also on self-development of regions, combined with the interests of big business which plays an increasing role in the transformation of socioeconomic space. The article reveals the meaning and content of the problem of systemic interaction between the state and space concerning the modernization of the country. The author explores the range of fundamental research and applied issues resulting from the contradictory combination of traditional (historical stereotypes and the latest Russian circumstances. These issues determine the background, nature and consequences of state impacts on socio-economic space, as well as the composition, content and validity of the used instruments

Information Theoretic Characterization of Physical Theories with Projective State Space

Science.gov (United States)

Zaopo, Marco

2015-08-01

Probabilistic theories are a natural framework to investigate the foundations of quantum theory and possible alternative or deeper theories. In a generic probabilistic theory, states of a physical system are represented as vectors of outcomes probabilities and state spaces are convex cones. In this picture the physics of a given theory is related to the geometric shape of the cone of states. In quantum theory, for instance, the shape of the cone of states corresponds to a projective space over complex numbers. In this paper we investigate geometric constraints on the state space of a generic theory imposed by the following information theoretic requirements: every non completely mixed state of a system is perfectly distinguishable from some other state in a single shot measurement; information capacity of physical systems is conserved under making mixtures of states. These assumptions guarantee that a generic physical system satisfies a natural principle asserting that the more a state of the system is mixed the less information can be stored in the system using that state as logical value. We show that all theories satisfying the above assumptions are such that the shape of their cones of states is that of a projective space over a generic field of numbers. Remarkably, these theories constitute generalizations of quantum theory where superposition principle holds with coefficients pertaining to a generic field of numbers in place of complex numbers. If the field of numbers is trivial and contains only one element we obtain classical theory. This result tells that superposition principle is quite common among probabilistic theories while its absence gives evidence of either classical theory or an implausible theory.

Reinforcement learning in continuous state and action spaces

NARCIS (Netherlands)

H. P. van Hasselt (Hado); M.A. Wiering; M. van Otterlo

2012-01-01

textabstractMany traditional reinforcement-learning algorithms have been designed for problems with small finite state and action spaces. Learning in such discrete problems can been difficult, due to noise and delayed reinforcements. However, many real-world problems have continuous state or action

Construction of spaces of kinematic quantum states for field theories via projective techniques

International Nuclear Information System (INIS)

Okołów, Andrzej

2013-01-01

We present a method of constructing a space of quantum states for a field theory: given phase space of a theory, we define a family of physical systems each possessing a finite number of degrees of freedom, next we define a space of quantum states for each finite system, finally using projective techniques we organize all these spaces into a space of quantum states which corresponds to the original phase space. This construction is kinematic in this sense that it bases merely on the structure of the phase space of a theory and does not take into account possible constraints on the space. The construction is a generalization of a construction by Kijowski—the latter one is limited to theories of linear phase spaces, while the former one is free of this limitation. The method presented in this paper enables to construct a space of quantum states for the teleparallel equivalent of general relativity. (paper)

Problem of short-term forecasting of near-earth space state

International Nuclear Information System (INIS)

Eselevich, V.G.; Ashmanets, V.I.; Startsev, S.A.

1996-01-01

The paper deals with actual and practically important problem of investigation and forecasting of state condition during magnetic storms. The available methods of forecasting of near-earth space state are analyzed. Forecasting of magnetic storms was conducted for control of space vehicles. Quasi-determinate method of magnetic storm forecasting is suggested. 13 refs., 3 figs

Deformed two-photon squeezed states in noncommutative space

International Nuclear Information System (INIS)

Zhang Jianzu

2004-01-01

Recent studies on nonperturbation aspects of noncommutative quantum mechanics explored a new type of boson commutation relations at the deformed level, described by deformed annihilation-creation operators in noncommutative space. This correlated boson commutator correlates different degrees of freedom, and shows an essential influence on dynamics. This Letter devotes to the development of formalism of deformed two-photon squeezed states in noncommutative space. General representations of deformed annihilation-creation operators and the consistency condition for the electromagnetic wave with a single mode of frequency in noncommunicative space are obtained. Two-photon squeezed states are studied. One finds that variances of the dimensionless Hermitian quadratures of the annihilation operator in one degree of freedom include variances in the other degree of freedom. Such correlations show the new feature of spatial noncommutativity and allow a deeper understanding of the correlated boson commutator

Discrete Chebyshev nets and a universal permutability theorem

International Nuclear Information System (INIS)

Schief, W K

2007-01-01

The Pohlmeyer-Lund-Regge system which was set down independently in the contexts of Lagrangian field theories and the relativistic motion of a string and which played a key role in the development of a geometric interpretation of soliton theory is known to appear in a variety of important guises such as the vectorial Lund-Regge equation, the O(4) nonlinear σ-model and the SU(2) chiral model. Here, it is demonstrated that these avatars may be discretized in such a manner that both integrability and equivalence are preserved. The corresponding discretization procedure is geometric and algebraic in nature and based on discrete Chebyshev nets and generalized discrete Lelieuvre formulae. In connection with the derivation of associated Baecklund transformations, it is shown that a generalized discrete Lund-Regge equation may be interpreted as a universal permutability theorem for integrable equations which admit commuting matrix Darboux transformations acting on su(2) linear representations. Three-dimensional coordinate systems and lattices of 'Lund-Regge' type related to particular continuous and discrete Zakharov-Manakov systems are obtained as a by-product of this analysis

A Sweep-Line Method for State Space Exploration

DEFF Research Database (Denmark)

Christensen, Søren; Kristensen, Lars Michael; Mailund, Thomas

2001-01-01

generation, since these states can never be reached again. This in turn reduces the memory used for state space storage during the task of verification. Examples of progress measures are sequence numbers in communication protocols and time in certain models with time. We illustrate the application...

Parallel symbolic state-space exploration is difficult, but what is the alternative?

Directory of Open Access Journals (Sweden)

Gianfranco Ciardo

2009-12-01

Full Text Available State-space exploration is an essential step in many modeling and analysis problems. Its goal is to find the states reachable from the initial state of a discrete-state model described. The state space can used to answer important questions, e.g., "Is there a dead state?" and "Can N become negative?", or as a starting point for sophisticated investigations expressed in temporal logic. Unfortunately, the state space is often so large that ordinary explicit data structures and sequential algorithms cannot cope, prompting the exploration of (1 parallel approaches using multiple processors, from simple workstation networks to shared-memory supercomputers, to satisfy large memory and runtime requirements and (2 symbolic approaches using decision diagrams to encode the large structured sets and relations manipulated during state-space generation. Both approaches have merits and limitations. Parallel explicit state-space generation is challenging, but almost linear speedup can be achieved; however, the analysis is ultimately limited by the memory and processors available. Symbolic methods are a heuristic that can efficiently encode many, but not all, functions over a structured and exponentially large domain; here the pitfalls are subtler: their performance varies widely depending on the class of decision diagram chosen, the state variable order, and obscure algorithmic parameters. As symbolic approaches are often much more efficient than explicit ones for many practical models, we argue for the need to parallelize symbolic state-space generation algorithms, so that we can realize the advantage of both approaches. This is a challenging endeavor, as the most efficient symbolic algorithm, Saturation, is inherently sequential. We conclude by discussing challenges, efforts, and promising directions toward this goal.

Adaptive importance sampling of random walks on continuous state spaces

International Nuclear Information System (INIS)

Baggerly, K.; Cox, D.; Picard, R.

1998-01-01

The authors consider adaptive importance sampling for a random walk with scoring in a general state space. Conditions under which exponential convergence occurs to the zero-variance solution are reviewed. These results generalize previous work for finite, discrete state spaces in Kollman (1993) and in Kollman, Baggerly, Cox, and Picard (1996). This paper is intended for nonstatisticians and includes considerable explanatory material

Relativistic resonances as non-orthogonal states in Hilbert space

CERN Document Server

Blum, W

2003-01-01

We analyze the energy-momentum properties of relativistic short-lived particles with the result that they are characterized by two 4-vectors: in addition to the familiar energy-momentum vector (timelike) there is an energy-momentum 'spread vector' (spacelike). The wave functions in space and time for unstable particles are constructed. For the relativistic properties of unstable states we refer to Wigner's method of Poincare group representations that are induced by representations of the space-time translation and rotation groups. If stable particles, unstable particles and resonances are treated as elementary objects that are not fundamentally different one has to take into account that they will not generally be orthogonal to each other in their state space. The scalar product between a stable and an unstable state with otherwise identical properties is calculated in a particular Lorentz frame. The spin of an unstable particle is not infinitely sharp but has a 'spin spread' giving rise to 'spin neighbors'....

On the state space of the dipole ghost

International Nuclear Information System (INIS)

Binegar, B.

1984-01-01

A particular representation of SO(4, 2) is identified with the state space of the free dipole ghost. This representation is then given an explicit realization as the solution space of a 4th-order wave equation on a spacetime locally isomorphic to Minkowski space. A discrete basis for this solution space is given, as well as an explicit expression for its SO(4, 2) invariant inner product. The connection between the modes of dipole field and those of the massless scalar field is clarified, and a recent conjecture concerning the restriction of the dipole representation to the Poincare subgroup is confirmed. A particular coordinate transformation then reveals the theory of the dipole ghost in Minkowski space. Finally, it is shown that the solution space of the dipole equation is not unitarizable in a Poincare invariant manner. (orig.)

Information transmission and signal permutation in active flow networks

Science.gov (United States)

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.

Partial transpose of random quantum states: Exact formulas and meanders

Energy Technology Data Exchange (ETDEWEB)

Fukuda, Motohisa [Zentrum Mathematik, M5, Technische Universitaet Muenchen, Boltzmannstrasse 3, 85748 Garching (Germany); Sniady, Piotr [Zentrum Mathematik, M5, Technische Universitaet Muenchen, Boltzmannstrasse 3, 85748 Garching (Germany); Institute of Mathematics, Polish Academy of Sciences, ul. Sniadeckich 8, 00-956 Warszawa (Poland); Institute of Mathematics, University of Wroclaw, pl. Grunwaldzki 2/4, 50-384 Wroclaw (Poland)

2013-04-15

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

Partial transpose of random quantum states: Exact formulas and meanders

Science.gov (United States)

Fukuda, Motohisa; Śniady, Piotr

2013-04-01

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

Symmetries of Chimera States

Science.gov (United States)

Kemeth, Felix P.; Haugland, Sindre W.; Krischer, Katharina

2018-05-01

Symmetry broken states arise naturally in oscillatory networks. In this Letter, we investigate chaotic attractors in an ensemble of four mean-coupled Stuart-Landau oscillators with two oscillators being synchronized. We report that these states with partially broken symmetry, so-called chimera states, have different setwise symmetries in the incoherent oscillators, and in particular, some are and some are not invariant under a permutation symmetry on average. This allows for a classification of different chimera states in small networks. We conclude our report with a discussion of related states in spatially extended systems, which seem to inherit the symmetry properties of their counterparts in small networks.

Estimation methods for nonlinear state-space models in ecology

DEFF Research Database (Denmark)

Pedersen, Martin Wæver; Berg, Casper Willestofte; Thygesen, Uffe Høgsbro

2011-01-01

The use of nonlinear state-space models for analyzing ecological systems is increasing. A wide range of estimation methods for such models are available to ecologists, however it is not always clear, which is the appropriate method to choose. To this end, three approaches to estimation in the theta...... logistic model for population dynamics were benchmarked by Wang (2007). Similarly, we examine and compare the estimation performance of three alternative methods using simulated data. The first approach is to partition the state-space into a finite number of states and formulate the problem as a hidden...... Markov model (HMM). The second method uses the mixed effects modeling and fast numerical integration framework of the AD Model Builder (ADMB) open-source software. The third alternative is to use the popular Bayesian framework of BUGS. The study showed that state and parameter estimation performance...

Multimedia Mapping using Continuous State Space Models

DEFF Research Database (Denmark)

Lehn-Schiøler, Tue

2004-01-01

In this paper a system that transforms speech waveforms to animated faces are proposed. The system relies on continuous state space models to perform the mapping, this makes it possible to ensure video with no sudden jumps and allows continuous control of the parameters in 'face space'. Simulations...... are performed on recordings of 3-5 sec. video sequences with sentences from the Timit database. The model is able to construct an image sequence from an unknown noisy speech sequence fairly well even though the number of training examples are limited....

Permutation-symmetric three-particle hyper-spherical harmonics based on the S3⊗SO(3rot⊂O(2⊗SO(3rot⊂U(3⋊S2⊂O(6 subgroup chain

Directory of Open Access Journals (Sweden)

Igor Salom

2017-07-01

Full Text Available 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(3rot⊂O(2⊗SO(3rot⊂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(3rot 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(3rot⊂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(3rot⊂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.

Active Affordance Learning in Continuous State and Action Spaces

NARCIS (Netherlands)

Wang, C.; Hindriks, K.V.; Babuska, R.

2014-01-01

Learning object affordances and manipulation skills is essential for developing cognitive service robots. We propose an active affordance learning approach in continuous state and action spaces without manual discretization of states or exploratory motor primitives. During exploration in the action

Pure state consciousness and its local reduction to neuronal space

Science.gov (United States)

Duggins, A. J.

2013-01-01

The single neuronal state can be represented as a vector in a complex space, spanned by an orthonormal basis of integer spike counts. In this model a scalar element of experience is associated with the instantaneous firing rate of a single sensory neuron over repeated stimulus presentations. Here the model is extended to composite neural systems that are tensor products of single neuronal vector spaces. Depiction of the mental state as a vector on this tensor product space is intended to capture the unity of consciousness. The density operator is introduced as its local reduction to the single neuron level, from which the firing rate can again be derived as the objective correlate of a subjective element. However, the relational structure of perceptual experience only emerges when the non-local mental state is considered. A metric of phenomenal proximity between neuronal elements of experience is proposed, based on the cross-correlation function of neurophysiology, but constrained by the association of theoretical extremes of correlation/anticorrelation in inseparable 2-neuron states with identical and opponent elements respectively.

State-space Manifold and Rotating Black Holes

CERN Document Server

Bellucci, Stefano

2010-01-01

We study a class of fluctuating higher dimensional black hole configurations obtained in string theory/ $M$-theory compactifications. We explore the intrinsic Riemannian geometric nature of Gaussian fluctuations arising from the Hessian of the coarse graining entropy, defined over an ensemble of brane microstates. It has been shown that the state-space geometry spanned by the set of invariant parameters is non-degenerate, regular and has a negative scalar curvature for the rotating Myers-Perry black holes, Kaluza-Klein black holes, supersymmetric $AdS_5$ black holes, $D_1$-$D_5$ configurations and the associated BMPV black holes. Interestingly, these solutions demonstrate that the principal components of the state-space metric tensor admit a positive definite form, while the off diagonal components do not. Furthermore, the ratio of diagonal components weakens relatively faster than the off diagonal components, and thus they swiftly come into an equilibrium statistical configuration. Novel aspects of the scali...

Identification of a class of nonlinear state-space models using RPE techniques

DEFF Research Database (Denmark)

Zhou, W. W.; Blanke, Mogens

1986-01-01

The recursive prediction error methods in state-space form have been efficiently used as parameter identifiers for linear systems, and especially Ljung's innovations filter using a Newton search direction has proved to be quite ideal. In this paper, the RPE method in state-space form is developed...... a quite convincing performance of the filter as combined parameter and state estimator....

Coherent states on horospheric three-dimensional Lobachevsky space

Energy Technology Data Exchange (ETDEWEB)

Kurochkin, Yu., E-mail: y.kurochkin@ifanbel.bas-net.by; Shoukavy, Dz., E-mail: shoukavy@ifanbel.bas-net.by [Institute of Physics, National Academy of Sciences of Belarus, 68 Nezalezhnasci Ave., Minsk 220072 (Belarus); Rybak, I., E-mail: Ivan.Rybak@astro.up.pt [Institute of Physics, National Academy of Sciences of Belarus, 68 Nezalezhnasci Ave., Minsk 220072 (Belarus); Instituto de Astrofísica e Ciências do Espaço, CAUP, Rua das Estrelas, 4150-762 Porto (Portugal); Faculdade de Ciências, Universidade do Porto, Rua do Campo Alegre 687, 4169-007 Porto (Portugal)

2016-08-15

In the paper it is shown that due to separation of variables in the Laplace-Beltrami operator (Hamiltonian of a free quantum particle) in horospheric and quasi-Cartesian coordinates of three dimensional Lobachevsky space, it is possible to introduce standard (“conventional” according to Perelomov [Generalized Coherent States and Their Applications (Springer-Verlag, 1986), p. 320]) coherent states. Some problems (oscillator on horosphere, charged particle in analogy of constant uniform magnetic field) where coherent states are suitable for treating were considered.

Dynamic State Space Partitioning for External Memory Model Checking

DEFF Research Database (Denmark)

Evangelista, Sami; Kristensen, Lars Michael

2009-01-01

We describe a dynamic partitioning scheme usable by model checking techniques that divide the state space into partitions, such as most external memory and distributed model checking algorithms. The goal of the scheme is to reduce the number of transitions that link states belonging to different...

Limits on nonlocal correlations from the structure of the local state space

International Nuclear Information System (INIS)

Janotta, Peter; Gogolin, Christian; Barrett, Jonathan; Brunner, Nicolas

2011-01-01

The outcomes of measurements on entangled quantum systems can be nonlocally correlated. However, while it is easy to write down toy theories allowing arbitrary nonlocal correlations, those allowed in quantum mechanics are limited. Quantum correlations cannot, for example, violate a principle known as macroscopic locality, which implies that they cannot violate Tsirelson's bound. This paper shows that there is a connection between the strength of nonlocal correlations in a physical theory and the structure of the state spaces of individual systems. This is illustrated by a family of models in which local state spaces are regular polygons, where a natural analogue of a maximally entangled state of two systems exists. We characterize the nonlocal correlations obtainable from such states. The family allows us to study the transition between classical, quantum and super-quantum correlations by varying only the local state space. We show that the strength of nonlocal correlations - in particular whether the maximally entangled state violates Tsirelson's bound or not-depends crucially on a simple geometric property of the local state space, known as strong self-duality. This result is seen to be a special case of a general theorem, which states that a broad class of entangled states in probabilistic theories-including, by extension, all bipartite classical and quantum states-cannot violate macroscopic locality. Finally, our results show that models exist that are locally almost indistinguishable from quantum mechanics, but can nevertheless generate maximally nonlocal correlations.

State-Space Modelling of Loudspeakers using Fractional Derivatives

DEFF Research Database (Denmark)

King, Alexander Weider; Agerkvist, Finn T.

2015-01-01

This work investigates the use of fractional order derivatives in modeling moving-coil loudspeakers. A fractional order state-space solution is developed, leading the way towards incorporating nonlinearities into a fractional order system. The method is used to calculate the response of a fractio......This work investigates the use of fractional order derivatives in modeling moving-coil loudspeakers. A fractional order state-space solution is developed, leading the way towards incorporating nonlinearities into a fractional order system. The method is used to calculate the response...... of a fractional harmonic oscillator, representing the mechanical part of a loudspeaker, showing the effect of the fractional derivative and its relationship to viscoelasticity. Finally, a loudspeaker model with a fractional order viscoelastic suspension and fractional order voice coil is fit to measurement data...

State Space Models and the Kalman-Filter in Stochastic Claims Reserving: Forecasting, Filtering and Smoothing

Directory of Open Access Journals (Sweden)

Nataliya Chukhrova

2017-05-01

Full Text Available This paper gives a detailed overview of the current state of research in relation to the use of state space models and the Kalman-filter in the field of stochastic claims reserving. Most of these state space representations are matrix-based, which complicates their applications. Therefore, to facilitate the implementation of state space models in practice, we present a scalar state space model for cumulative payments, which is an extension of the well-known chain ladder (CL method. The presented model is distribution-free, forms a basis for determining the entire unobservable lower and upper run-off triangles and can easily be applied in practice using the Kalman-filter for prediction, filtering and smoothing of cumulative payments. In addition, the model provides an easy way to find outliers in the data and to determine outlier effects. Finally, an empirical comparison of the scalar state space model, promising prior state space models and some popular stochastic claims reserving methods is performed.

Comparative analysis of automotive paints by laser induced breakdown spectroscopy and nonparametric permutation tests

International Nuclear Information System (INIS)

McIntee, Erin; Viglino, Emilie; Rinke, Caitlin; Kumor, Stephanie; Ni Liqiang; Sigman, Michael E.

2010-01-01

Laser-induced breakdown spectroscopy (LIBS) has been investigated for the discrimination of automobile paint samples. Paint samples from automobiles of different makes, models, and years were collected and separated into sets based on the color, presence or absence of effect pigments and the number of paint layers. Twelve LIBS spectra were obtained for each paint sample, each an average of a five single shot 'drill down' spectra from consecutive laser ablations in the same spot on the sample. Analyses by a nonparametric permutation test and a parametric Wald test were performed to determine the extent of discrimination within each set of paint samples. The discrimination power and Type I error were assessed for each data analysis method. Conversion of the spectral intensity to a log-scale (base 10) resulted in a higher overall discrimination power while observing the same significance level. Working on the log-scale, the nonparametric permutation tests gave an overall 89.83% discrimination power with a size of Type I error being 4.44% at the nominal significance level of 5%. White paint samples, as a group, were the most difficult to differentiate with the power being only 86.56% followed by 95.83% for black paint samples. Parametric analysis of the data set produced lower discrimination (85.17%) with 3.33% Type I errors, which is not recommended for both theoretical and practical considerations. The nonparametric testing method is applicable across many analytical comparisons, with the specific application described here being the pairwise comparison of automotive paint samples.

Rosette of rosettes of Hilbert spaces in the indefinite metric state space of the quantized Maxwell field

International Nuclear Information System (INIS)

Gessner, W.; Ernst, V.

1980-01-01

The indefinite metric space O/sub M/ of the covariant form of the quantized Maxwell field M is analyzed in some detail. S/sub M/ contains not only the pre-Hilbert space X 0 of states of transverse photons which occurs in the Gupta--Bleuler formalism of the free M, but a whole rosette of continuously many, isomorphic, complete, pre-Hilbert spaces L/sup q/ disjunct up to the zero element o of S/sub M/. The L/sup q/ are the maximal subspaces of S/sub M/ which allow the usual statistical interpretation. Each L/sup q/ corresponds uniquely to one square integrable, spatial distribution j/sup o/(x) of the total charge Q=0. If M is in any state from L/sup q/, the bare charge j 0 (x) appears to be inseparably dressed by the quantum equivalent of its proper, classical Coulomb field E(x). The vacuum occurs only in the state space L 0 of the free Maxwell field. Each L/sup q/ contains a secondary rosette of continuously many, up to o disjunct, isomorphic Hilbert spaces H/sub g//sup q/ related to different electromagnetic gauges. The space H/sub o//sup q/, which corresponds to the Coulomb gauge within the Lorentz gauge, plays a physically distinguished role in that only it leads to the usual concept of energy. If M is in any state from H/sub g//sup q/, the bare 4-current j 0 (x), j(x), where j(x) is any square integrable, transverse current density in space, is endowed with its proper 4-potential which depends on the chosen gauge, and with its proper, gauge independent, Coulomb--Oersted field E(x), B(x). However, these fields exist only in the sense of quantum mechanical expectation values equipped with the corresponding field fluctuations. So they are basically different from classical electromagnetic fields

Formulating state space models in R with focus on longitudinal regression models

DEFF Research Database (Denmark)

Dethlefsen, Claus; Lundbye-Christensen, Søren

2006-01-01

We provide a language for formulating a range of state space models with response densities within the exponential family. The described methodology is implemented in the R-package sspir. A state space model is specified similarly to a generalized linear model in R, and then the time-varying terms...

An application of gain-scheduled control using state-space interpolation to hydroactive gas bearings

DEFF Research Database (Denmark)

Theisen, Lukas Roy Svane; Camino, Juan F.; Niemann, Hans Henrik

2016-01-01

with a gain-scheduling strategy using state-space interpolation, which avoids both the performance loss and the increase of controller order associated to the Youla parametrisation. The proposed state-space interpolation for gain-scheduling is applied for mass imbalance rejection for a controllable gas...... bearing scheduled in two parameters. Comparisons against the Youla-based scheduling demonstrate the superiority of the state-space interpolation....

Space-time complexity in solid state models

International Nuclear Information System (INIS)

Bishop, A.R.

1985-01-01

In this Workshop on symmetry-breaking it is appropriate to include the evolving fields of nonlinear-nonequilibrium systems in which transitions to and between various degrees of ''complexity'' (including ''chaos'') occur in time or space or both. These notions naturally bring together phenomena of pattern formation and chaos and therefore have ramifications for a huge array of natural sciences - astrophysics, plasmas and lasers, hydrodynamics, field theory, materials and solid state theory, optics and electronics, biology, pattern recognition and evolution, etc. Our particular concerns here are with examples from solid state and condensed matter

Abelian faces of state spaces of C*-algebras

International Nuclear Information System (INIS)

Batty, C.J.K.

1980-01-01

Let F be a closed face of the weak* compact convex state space of a unital C*-algebra A. The class of F-abelian states, introduced earlier by the author, is studied further. It is shown (without any restriction on A or F) that F is a Choquet simplex if and only if every state in F is F-abelian, and that it is sufficient for this that every pure state in F is F-abelian. As a corollary, it is deduced that an arbitrary C*-dynamical system (A,G,α) is G-abelian if and only if every ergodic state is weakly clustering. Nevertheless the set of all F-abelian (or even G-abelian) states is not necessarily weak* compact. (orig.)

A non-permutation flowshop scheduling problem with lot streaming: A Mathematical model

Directory of Open Access Journals (Sweden)

Daniel Rossit

2016-06-01

Full Text Available In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution.

On optimal (non-Trojan) semi-Latin squares with side n and block size n: Construction procedure and admissible permutations

International Nuclear Information System (INIS)

Chigbu, P.E.; Ukekwe, E.C.; Ikekeonwu, G.A.M.

2006-12-01

There is a special family of the (n x n)/k semi-Latin squares called the Trojan squares which are optimal among semi-Latin squares of equivalent sizes. Unfortunately, Trojan squares do not exist for all k; for instance, there is no Trojan square for k ≥ n. However, the need usually arises for constructing optimal semi-Latin squares where no Trojan squares exist. Bailey made a conjecture on optimal semi-Latin squares for k ≥ n and based on this conjecture, optimal non-Trojan semi-Latin squares are here constructed for k = n, considering the inherent Trojan squares for k < n. A lemma substantiating this conjecture for k = n is given and proved. In addition, the properties for the admissible permutation sets used in constructing these optimal squares are made evident based on the systematic-group-theoretic algorithm of Bailey and Chigbu. Algorithms for identifying the admissible permutations as well as constructing the optimal non-Trojan (n x n)/k = n semi-Latin squares for odd n and n = 4 are given. (author)

Generalized permutation symmetry and the flavour problem in SU(2)sub(L)xU(1)

International Nuclear Information System (INIS)

Ecker, G.

1984-01-01

A generalized permutation group is introduced as a possible horizontal symmetry for SU(2)sub(L)xU(1) gauge theories. It leads to the unique two generation quark mass matrices with a correct prediction for the Cabibbo angle. For three generations the model exhibits spontaneous CP violation, correlates the Kobayashi-Maskawa mixing parameters s 1 and s 3 and predicts an upper bound for the running top quark mass of approximately 45 GeV. The hierarchy of generations is due to a hierarchy of vacuum expectation values rather than of Yukawa coupling constants. (orig.)

Coherent states for FLRW space-times in loop quantum gravity

International Nuclear Information System (INIS)

Magliaro, Elena; Perini, Claudio; Marciano, Antonino

2011-01-01

We construct a class of coherent spin-network states that capture properties of curved space-times of the Friedmann-Lamaitre-Robertson-Walker type on which they are peaked. The data coded by a coherent state are associated to a cellular decomposition of a spatial (t=const) section with a dual graph given by the complete five-vertex graph, though the construction can be easily generalized to other graphs. The labels of coherent states are complex SL(2,C) variables, one for each link of the graph, and are computed through a smearing process starting from a continuum extrinsic and intrinsic geometry of the canonical surface. The construction covers both Euclidean and Lorentzian signatures; in the Euclidean case and in the limit of flat space we reproduce the simplicial 4-simplex semiclassical states used in spin foams.

The quantum state vector in phase space and Gabor's windowed Fourier transform

International Nuclear Information System (INIS)

Bracken, A J; Watson, P

2010-01-01

Representations of quantum state vectors by complex phase space amplitudes, complementing the description of the density operator by the Wigner function, have been defined by applying the Weyl-Wigner transform to dyadic operators, linear in the state vector and anti-linear in a fixed 'window state vector'. Here aspects of this construction are explored, and a connection is established with Gabor's 'windowed Fourier transform'. The amplitudes that arise for simple quantum states from various choices of windows are presented as illustrations. Generalized Bargmann representations of the state vector appear as special cases, associated with Gaussian windows. For every choice of window, amplitudes lie in a corresponding linear subspace of square-integrable functions on phase space. A generalized Born interpretation of amplitudes is described, with both the Wigner function and a generalized Husimi function appearing as quantities linear in an amplitude and anti-linear in its complex conjugate. Schroedinger's time-dependent and time-independent equations are represented on phase space amplitudes, and their solutions described in simple cases.

Filtering and smoothing of stae vector for diffuse state space models

NARCIS (Netherlands)

Koopman, S.J.; Durbin, J.

2003-01-01

This paper presents exact recursions for calculating the mean and mean square error matrix of the state vector given the observations for the multi-variate linear Gaussian state-space model in the case where the initial state vector is (partially) diffuse.

Investigation of unstable periodic space-time states in distributed active system with supercritical current

International Nuclear Information System (INIS)

Koronovskij, A.A.; Rempen, I.S.; Khramov, A.E.

2003-01-01

The set of the unstable periodic space-time states, characterizing the chaotic space-time dynamics of the electron beam with the supercritical current in the Pierce diode is discussed. The Lyapunov indicators of the revealed instable space-time states of the chaotic dynamics of the distributed self-excited system are calculated. It is shown that change in the set of the unstable periodic states in dependence on the Pierce parameter is determined by change in the various orbits stability, which is demonstrated by the values of senior Lyapunov unstable state index [ru

Secondary structure classification of amino-acid sequences using state-space modeling

OpenAIRE

Brunnert, Marcus; Krahnke, Tillmann; Urfer, Wolfgang

2001-01-01

The secondary structure classification of amino acid sequences can be carried out by a statistical analysis of sequence and structure data using state-space models. Aiming at this classification, a modified filter algorithm programmed in S is applied to data of three proteins. The application leads to correct classifications of two proteins even when using relatively simple estimation methods for the parameters of the state-space models. Furthermore, it has been shown that the assumed initial...

State-Space Geometry, Statistical Fluctuations, and Black Holes in String Theory

Directory of Open Access Journals (Sweden)

Stefano Bellucci

2014-01-01

Full Text Available We study the state-space geometry of various extremal and nonextremal black holes in string theory. From the notion of the intrinsic geometry, we offer a state-space perspective to the black hole vacuum fluctuations. For a given black hole entropy, we explicate the intrinsic geometric meaning of the statistical fluctuations, local and global stability conditions, and long range statistical correlations. We provide a set of physical motivations pertaining to the extremal and nonextremal black holes, namely, the meaning of the chemical geometry and physics of correlation. We illustrate the state-space configurations for general charge extremal black holes. In sequel, we extend our analysis for various possible charge and anticharge nonextremal black holes. From the perspective of statistical fluctuation theory, we offer general remarks, future directions, and open issues towards the intrinsic geometric understanding of the vacuum fluctuations and black holes in string theory.

Permutation entropy analysis of financial time series based on Hill's diversity number

Science.gov (United States)

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.

A Markovian state-space framework for integrating flexibility into space system design decisions

Science.gov (United States)

Lafleur, Jarret M.

The past decades have seen the state of the art in aerospace system design progress from a scope of simple optimization to one including robustness, with the objective of permitting a single system to perform well even in off-nominal future environments. Integrating flexibility, or the capability to easily modify a system after it has been fielded in response to changing environments, into system design represents a further step forward. One challenge in accomplishing this rests in that the decision-maker must consider not only the present system design decision, but also sequential future design and operation decisions. Despite extensive interest in the topic, the state of the art in designing flexibility into aerospace systems, and particularly space systems, tends to be limited to analyses that are qualitative, deterministic, single-objective, and/or limited to consider a single future time period. To address these gaps, this thesis develops a stochastic, multi-objective, and multi-period framework for integrating flexibility into space system design decisions. Central to the framework are five steps. First, system configuration options are identified and costs of switching from one configuration to another are compiled into a cost transition matrix. Second, probabilities that demand on the system will transition from one mission to another are compiled into a mission demand Markov chain. Third, one performance matrix for each design objective is populated to describe how well the identified system configurations perform in each of the identified mission demand environments. The fourth step employs multi-period decision analysis techniques, including Markov decision processes from the field of operations research, to find efficient paths and policies a decision-maker may follow. The final step examines the implications of these paths and policies for the primary goal of informing initial system selection. Overall, this thesis unifies state-centric concepts of

A state space algorithm for the spectral factorization

NARCIS (Netherlands)

Kraffer, F.; Kraffer, F.; Kwakernaak, H.

1997-01-01

This paper presents an algorithm for the spectral factorization of a para-Hermitian polynomial matrix. The algorithm is based on polynomial matrix to state space and vice versa conversions, and avoids elementary polynomial operations in computations; It relies on well-proven methods of numerical

Embedding a State Space Model Into a Markov Decision Process

DEFF Research Database (Denmark)

Nielsen, Lars Relund; Jørgensen, Erik; Højsgaard, Søren

2011-01-01

In agriculture Markov decision processes (MDPs) with finite state and action space are often used to model sequential decision making over time. For instance, states in the process represent possible levels of traits of the animal and transition probabilities are based on biological models...

Bayesian state space models for dynamic genetic network construction across multiple tissues.

Science.gov (United States)

Liang, Yulan; Kelemen, Arpad

2016-08-01

Construction of gene-gene interaction networks and potential pathways is a challenging and important problem in genomic research for complex diseases while estimating the dynamic changes of the temporal correlations and non-stationarity are the keys in this process. In this paper, we develop dynamic state space models with hierarchical Bayesian settings to tackle this challenge for inferring the dynamic profiles and genetic networks associated with disease treatments. We treat both the stochastic transition matrix and the observation matrix time-variant and include temporal correlation structures in the covariance matrix estimations in the multivariate Bayesian state space models. The unevenly spaced short time courses with unseen time points are treated as hidden state variables. Hierarchical Bayesian approaches with various prior and hyper-prior models with Monte Carlo Markov Chain and Gibbs sampling algorithms are used to estimate the model parameters and the hidden state variables. We apply the proposed Hierarchical Bayesian state space models to multiple tissues (liver, skeletal muscle, and kidney) Affymetrix time course data sets following corticosteroid (CS) drug administration. Both simulation and real data analysis results show that the genomic changes over time and gene-gene interaction in response to CS treatment can be well captured by the proposed models. The proposed dynamic Hierarchical Bayesian state space modeling approaches could be expanded and applied to other large scale genomic data, such as next generation sequence (NGS) combined with real time and time varying electronic health record (EHR) for more comprehensive and robust systematic and network based analysis in order to transform big biomedical data into predictions and diagnostics for precision medicine and personalized healthcare with better decision making and patient outcomes.

State-space dimensionality in short-memory hidden-variable theories

International Nuclear Information System (INIS)

Montina, Alberto

2011-01-01

Recently we have presented a hidden-variable model of measurements for a qubit where the hidden-variable state-space dimension is one-half the quantum-state manifold dimension. The absence of a short memory (Markov) dynamics is the price paid for this dimensional reduction. The conflict between having the Markov property and achieving the dimensional reduction was proved by Montina [A. Montina, Phys. Rev. A 77, 022104 (2008)] using an additional hypothesis of trajectory relaxation. Here we analyze in more detail this hypothesis introducing the concept of invertible process and report a proof that makes clearer the role played by the topology of the hidden-variable space. This is accomplished by requiring suitable properties of regularity of the conditional probability governing the dynamics. In the case of minimal dimension the set of continuous hidden variables is identified with an object living an N-dimensional Hilbert space whose dynamics is described by the Schroedinger equation. A method for generating the economical non-Markovian model for the qubit is also presented.

Mixture estimation with state-space components and Markov model of switching

Czech Academy of Sciences Publication Activity Database

Nagy, Ivan; Suzdaleva, Evgenia

2013-01-01

Roč. 37, č. 24 (2013), s. 9970-9984 ISSN 0307-904X R&D Projects: GA TA ČR TA01030123 Institutional support: RVO:67985556 Keywords : probabilistic dynamic mixtures, * probability density function * state-space models * recursive mixture estimation * Bayesian dynamic decision making under uncertainty * Kerridge inaccuracy Subject RIV: BC - Control Systems Theory Impact factor: 2.158, year: 2013 http://library.utia.cas.cz/separaty/2013/AS/nagy-mixture estimation with state-space components and markov model of switching.pdf

An Embeddable Virtual Machine for State Space Generation

NARCIS (Netherlands)

Weber, M.; Bosnacki, D.; Edelkamp, S.

2007-01-01

The semantics of modelling languages are not always specified in a precise and formal way, and their rather complex underlying models make it a non-trivial exercise to reuse them in newly developed tools. We report on experiments with a virtual machine-based approach for state space generation. The

On classical state space realizability of bilinear inout-output differential equations

OpenAIRE

Kotta, U.; Mullari, T.; Kotta, P.; Zinober, A.S.I.

2006-01-01

This paper studies the realizability property of continuous-time bilinear i/o equations in the classical state space form. Constraints on the parameters of the bilinear i/o model are suggested that lead to realizable models. The paper proves that the 2nd order bilinear i/o differential equation, unlike the discrete-time case, is always realizable in the classical state space form. The complete list of 3rd and 4th order realizable i/o bilinear models is given and two subclasses of realizable i...

Quantum tests for the linearity and permutation invariance of Boolean functions

Energy Technology Data Exchange (ETDEWEB)

Hillery, Mark [Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, New York 10021 (United States); Andersson, Erika [SUPA, School of Engineering and Physical Sciences, Heriot-Watt University, Edinburgh EH14 4AS (United Kingdom)

2011-12-15

The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is {epsilon}-far from having that property. The performance of the algorithm is judged by how many calls need to be made to the black box in order to determine, with high probability, which of the two alternatives is the case. Here we present two quantum algorithms, the first to determine whether the function is linear and the second to determine whether it is symmetric (invariant under permutations of the arguments). Both require order {epsilon}{sup -2/3} calls to the oracle, which is better than known classical algorithms. In addition, in the case of linearity testing, if the function is linear, the quantum algorithm identifies which linear function it is. The linearity test combines the Bernstein-Vazirani algorithm and amplitude amplification, while the test to determine whether a function is symmetric uses projective measurements and amplitude amplification.

Solid State Pathways towards Molecular Complexity in Space

Science.gov (United States)

Linnartz, Harold; Bossa, Jean-Baptiste; Bouwman, Jordy; Cuppen, Herma M.; Cuylle, Steven H.; van Dishoeck, Ewine F.; Fayolle, Edith C.; Fedoseev, Gleb; Fuchs, Guido W.; Ioppolo, Sergio; Isokoski, Karoliina; Lamberts, Thanja; Öberg, Karin I.; Romanzin, Claire; Tenenbaum, Emily; Zhen, Junfeng

2011-12-01

It has been a long standing problem in astrochemistry to explain how molecules can form in a highly dilute environment such as the interstellar medium. In the last decennium more and more evidence has been found that the observed mix of small and complex, stable and highly transient species in space is the cumulative result of gas phase and solid state reactions as well as gas-grain interactions. Solid state reactions on icy dust grains are specifically found to play an important role in the formation of the more complex ``organic'' compounds. In order to investigate the underlying physical and chemical processes detailed laboratory based experiments are needed that simulate surface reactions triggered by processes as different as thermal heating, photon (UV) irradiation and particle (atom, cosmic ray, electron) bombardment of interstellar ice analogues. Here, some of the latest research performed in the Sackler Laboratory for Astrophysics in Leiden, the Netherlands is reviewed. The focus is on hydrogenation, i.e., H-atom addition reactions and vacuum ultraviolet irradiation of interstellar ice analogues at astronomically relevant temperatures. It is shown that solid state processes are crucial in the chemical evolution of the interstellar medium, providing pathways towards molecular complexity in space.

THE STATE OF GREEN SPACES IN KUMASI CITY (GHANA: LESSONS FOR OTHER AFRICAN CITIES

Directory of Open Access Journals (Sweden)

Collins ADJEI MENSAH

2016-12-01

Full Text Available Integrating green spaces such as parks and gardens into the physical landscape of cities has been identified to enhance the health and wellbeing of urban dwellers. This paper assesses the state of green spaces in Kumasi city (Ghana, once known as the garden city of West Africa. Using a case study approach, a mixture of qualitative research techniques were employed whilst a set of eight themes were put together to guide the assessment. In all, green spaces were found to be in poor state. With the exception of conservation and heritage theme, the remaining seven themes that were used for the assessment all found the green spaces to be in poor state. It is therefore recommended that there should be an attitudinal change towards the maintenance of green spaces, the application of a collaborative governance approach, and priority giving to green spaces in all development agendas by city authorities.

Metrics for measuring distances in configuration spaces

International Nuclear Information System (INIS)

Sadeghi, Ali; Ghasemi, S. Alireza; Schaefer, Bastian; Mohr, Stephan; Goedecker, Stefan; Lill, Markus A.

2013-01-01

In order to characterize molecular structures we introduce configurational fingerprint vectors which are counterparts of quantities used experimentally to identify structures. The Euclidean distance between the configurational fingerprint vectors satisfies the properties of a metric and can therefore safely be used to measure dissimilarities between configurations in the high dimensional configuration space. In particular we show that these metrics are a perfect and computationally cheap replacement for the root-mean-square distance (RMSD) when one has to decide whether two noise contaminated configurations are identical or not. We introduce a Monte Carlo approach to obtain the global minimum of the RMSD between configurations, which is obtained from a global minimization over all translations, rotations, and permutations of atomic indices

State space model extraction of thermohydraulic systems – Part I: A linear graph approach

International Nuclear Information System (INIS)

Uren, K.R.; Schoor, G. van

2013-01-01

Thermohydraulic simulation codes are increasingly making use of graphical design interfaces. The user can quickly and easily design a thermohydraulic system by placing symbols on the screen resembling system components. These components can then be connected to form a system representation. Such system models may then be used to obtain detailed simulations of the physical system. Usually this kind of simulation models are too complex and not ideal for control system design. Therefore, a need exists for automated techniques to extract lumped parameter models useful for control system design. The goal of this first paper, in a two part series, is to propose a method that utilises a graphical representation of a thermohydraulic system, and a lumped parameter modelling approach, to extract state space models. In this methodology each physical domain of the thermohydraulic system is represented by a linear graph. These linear graphs capture the interaction between all components within and across energy domains – hydraulic, thermal and mechanical. These linear graphs are analysed using a graph-theoretic approach to derive reduced order state space models. These models capture the dominant dynamics of the thermohydraulic system and are ideal for control system design purposes. The proposed state space model extraction method is demonstrated by considering a U-tube system. A non-linear state space model is extracted representing both the hydraulic and thermal domain dynamics of the system. The simulated state space model is compared with a Flownex ® model of the U-tube. Flownex ® is a validated systems thermal-fluid simulation software package. - Highlights: • A state space model extraction methodology based on graph-theoretic concepts. • An energy-based approach to consider multi-domain systems in a common framework. • Allow extraction of transparent (white-box) state space models automatically. • Reduced order models containing only independent state

Practical Application of Neural Networks in State Space Control

DEFF Research Database (Denmark)

Bendtsen, Jan Dimon

the networks, although some modifications are needed for the method to apply to the multilayer perceptron network. In connection with the multilayer perceptron networks it is also pointed out how instantaneous, sample-by-sample linearized state space models can be extracted from a trained network, thus opening......In the present thesis we address some problems in discrete-time state space control of nonlinear dynamical systems and attempt to solve them using generic nonlinear models based on artificial neural networks. The main aim of the work is to examine how well such control algorithms perform when...... theoretic notions followed by a detailed description of the topology, neuron functions and learning rules of the two types of neural networks treated in the thesis, the multilayer perceptron and the neurofuzzy networks. In both cases, a Least Squares second-order gradient method is used to train...

Evaluating abundance and trends in a Hawaiian avian community using state-space analysis

Science.gov (United States)

Camp, Richard J.; Brinck, Kevin W.; Gorresen, P.M.; Paxton, Eben H.

2016-01-01

Estimating population abundances and patterns of change over time are important in both ecology and conservation. Trend assessment typically entails fitting a regression to a time series of abundances to estimate population trajectory. However, changes in abundance estimates from year-to-year across time are due to both true variation in population size (process variation) and variation due to imperfect sampling and model fit. State-space models are a relatively new method that can be used to partition the error components and quantify trends based only on process variation. We compare a state-space modelling approach with a more traditional linear regression approach to assess trends in uncorrected raw counts and detection-corrected abundance estimates of forest birds at Hakalau Forest National Wildlife Refuge, Hawai‘i. Most species demonstrated similar trends using either method. In general, evidence for trends using state-space models was less strong than for linear regression, as measured by estimates of precision. However, while the state-space models may sacrifice precision, the expectation is that these estimates provide a better representation of the real world biological processes of interest because they are partitioning process variation (environmental and demographic variation) and observation variation (sampling and model variation). The state-space approach also provides annual estimates of abundance which can be used by managers to set conservation strategies, and can be linked to factors that vary by year, such as climate, to better understand processes that drive population trends.

Properties of permutation-based gene tests and controlling type 1 error using a summary statistic based gene test.

Science.gov (United States)

Swanson, David M; Blacker, Deborah; Alchawa, Taofik; Ludwig, Kerstin U; Mangold, Elisabeth; Lange, Christoph

2013-11-07

The advent of genome-wide association studies has led to many novel disease-SNP associations, opening the door to focused study on their biological underpinnings. Because of the importance of analyzing these associations, numerous statistical methods have been devoted to them. However, fewer methods have attempted to associate entire genes or genomic regions with outcomes, which is potentially more useful knowledge from a biological perspective and those methods currently implemented are often permutation-based. One property of some permutation-based tests is that their power varies as a function of whether significant markers are in regions of linkage disequilibrium (LD) or not, which we show from a theoretical perspective. We therefore develop two methods for quantifying the degree of association between a genomic region and outcome, both of whose power does not vary as a function of LD structure. One method uses dimension reduction to "filter" redundant information when significant LD exists in the region, while the other, called the summary-statistic test, controls for LD by scaling marker Z-statistics using knowledge of the correlation matrix of markers. An advantage of this latter test is that it does not require the original data, but only their Z-statistics from univariate regressions and an estimate of the correlation structure of markers, and we show how to modify the test to protect the type 1 error rate when the correlation structure of markers is misspecified. We apply these methods to sequence data of oral cleft and compare our results to previously proposed gene tests, in particular permutation-based ones. We evaluate the versatility of the modification of the summary-statistic test since the specification of correlation structure between markers can be inaccurate. We find a significant association in the sequence data between the 8q24 region and oral cleft using our dimension reduction approach and a borderline significant association using the

Open string T-duality in double space

International Nuclear Information System (INIS)

Sazdovic, B.

2017-01-01

The role of double space is essential in the new interpretation of T-duality and consequently in an attempt to construct M-theory. The case of the open string is missing in such an approach because until now there has been no appropriate formulation of open string T-duality. In the previous paper (Sazdovic, From geometry to non-geometry via T-duality, arXiv:1606.01938, 2017), we showed how to introduce vector gauge fields A"N_a and A"D_i at the end-points of an open string in order to enable open string invariance under local gauge transformations of the Kalb-Ramond field and its T-dual ''restricted general coordinate transformations''. We demonstrated that gauge fields A"N_a and A"D_i are T-dual to each other. In the present article we prove that all above results can be interpreted as coordinate permutations in double space. (orig.)

Open string T-duality in double space

Energy Technology Data Exchange (ETDEWEB)

Sazdovic, B. [University of Belgrade, Institute of Physics, Belgrade (Serbia)

2017-09-15

The role of double space is essential in the new interpretation of T-duality and consequently in an attempt to construct M-theory. The case of the open string is missing in such an approach because until now there has been no appropriate formulation of open string T-duality. In the previous paper (Sazdovic, From geometry to non-geometry via T-duality, arXiv:1606.01938, 2017), we showed how to introduce vector gauge fields A{sup N}{sub a} and A{sup D}{sub i} at the end-points of an open string in order to enable open string invariance under local gauge transformations of the Kalb-Ramond field and its T-dual ''restricted general coordinate transformations''. We demonstrated that gauge fields A{sup N}{sub a} and A{sup D}{sub i} are T-dual to each other. In the present article we prove that all above results can be interpreted as coordinate permutations in double space. (orig.)

An evaluation of behavior inferences from Bayesian state-space models: A case study with the Pacific walrus

Science.gov (United States)

Beatty, William; Jay, Chadwick V.; Fischbach, Anthony S.

2016-01-01

State-space models offer researchers an objective approach to modeling complex animal location data sets, and state-space model behavior classifications are often assumed to have a link to animal behavior. In this study, we evaluated the behavioral classification accuracy of a Bayesian state-space model in Pacific walruses using Argos satellite tags with sensors to detect animal behavior in real time. We fit a two-state discrete-time continuous-space Bayesian state-space model to data from 306 Pacific walruses tagged in the Chukchi Sea. We matched predicted locations and behaviors from the state-space model (resident, transient behavior) to true animal behavior (foraging, swimming, hauled out) and evaluated classification accuracy with kappa statistics (κ) and root mean square error (RMSE). In addition, we compared biased random bridge utilization distributions generated with resident behavior locations to true foraging behavior locations to evaluate differences in space use patterns. Results indicated that the two-state model fairly classified true animal behavior (0.06 ≤ κ ≤ 0.26, 0.49 ≤ RMSE ≤ 0.59). Kernel overlap metrics indicated utilization distributions generated with resident behavior locations were generally smaller than utilization distributions generated with true foraging behavior locations. Consequently, we encourage researchers to carefully examine parameters and priors associated with behaviors in state-space models, and reconcile these parameters with the study species and its expected behaviors.

On the representation matrices of the spin permutation group. [for atomic and molecular electronic structures

Science.gov (United States)

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.

Limitations Of The Current State Space Modelling Approach In Multistage Machining Processes Due To Operation Variations

Science.gov (United States)

Abellán-Nebot, J. V.; Liu, J.; Romero, F.

2009-11-01

The State Space modelling approach has been recently proposed as an engineering-driven technique for part quality prediction in Multistage Machining Processes (MMP). Current State Space models incorporate fixture and datum variations in the multi-stage variation propagation, without explicitly considering common operation variations such as machine-tool thermal distortions, cutting-tool wear, cutting-tool deflections, etc. This paper shows the limitations of the current State Space model through an experimental case study where the effect of the spindle thermal expansion, cutting-tool flank wear and locator errors are introduced. The paper also discusses the extension of the current State Space model to include operation variations and its potential benefits.

Index to Nuclear Safety. A technical progress review by chronology, permuted title, and author. Vol. 11, No. 1 through Vol. 15, No. 6

International Nuclear Information System (INIS)

Cottrell, W.B.; Klein, A.

1975-04-01

This issue of the Index to Nuclear Safety covers only articles included in Nuclear Safety, Vol. 11, No. 1, through Vol. 15, No. 6. This index is presented in three sections as follows: Chronological List of Articles by Volume; Permuted Title (KWIC) Index; and Author Index. (U.S.)

Possible generalization of Yang variables for the study of many particle final states

International Nuclear Information System (INIS)

Becker, L.; Schiller, H.

1976-01-01

Starting from a discussion of constraints on invariant variables a generalization of the so called Yang-variables is discussed for the case of 5 and 6 particles in the final states. The obtained Lorentz-invariant variables are ''quasi permutation invariant'' with respect to the final state particles. The influence of Gram determinants is discussed in the context of the application of a cluster algorithm. (author)

Quantum states and the Hadamard form. III. Constraints in cosmological space-times

International Nuclear Information System (INIS)

Najmi, A.; Ottewill, A.C.

1985-01-01

We examine the constraints on the construction of Fock spaces for scalar fields in spatially flat Robertson-Walker space-times imposed by requiring that the vacuum state of the theory have a two-point function possessing the Hadamard singularity structure required by standard renormalization theory. It is shown that any such vacuum state must be a second-order adiabatic vacuum. We discuss the global requirements on the two-point function for it to possess the Hadamard form at all times if it possesses it at one time

Sensorless State-Space Control of Elastic Two-Inertia Drive System Using a Minimum State Order Observer

Directory of Open Access Journals (Sweden)

V. Comnac

2009-12-01

Full Text Available The paper presents sensorless state-space control of two-inertia drive system with resilient coupling. The control structure contains an I+PI controller for load speed regulation and a state feedback controller for effective vibration suppression of the elastic coupling. Mechanical state variable of two-inertia drive are obtained by using a linear minimum-order (Gopinath state observer. The design of the combined (I+PI and state feedback controller is achieved with the extended version of the modulus criterion [5]. The dynamic behavior of presented control structure has been examined, for different conditions, using MATLAB/SIMULINK simulation.

Deep-Inelastic Final States in a Space-Time Description of Shower Development and Hadronization

OpenAIRE

Ellis, John; Geiger, Klaus; Kowalski, Henryk

1996-01-01

We extend a quantum kinetic approach to the description of hadronic showers in space, time and momentum space to deep-inelastic $ep$ collisions, with particular reference to experiments at HERA. We follow the history of hard scattering events back to the initial hadronic state and forward to the formation of colour-singlet pre-hadronic clusters and their decays into hadrons. The time evolution of the space-like initial-state shower and the time-like secondary partons are treated similarly, an...

Genuine multipartite entanglement of symmetric Gaussian states: Strong monogamy, unitary localization, scaling behavior, and molecular sharing structure

Science.gov (United States)

Adesso, Gerardo; Illuminati, Fabrizio

2008-10-01

We investigate the structural aspects of genuine multipartite entanglement in Gaussian states of continuous variable systems. Generalizing the results of Adesso and Illuminati [Phys. Rev. Lett. 99, 150501 (2007)], we analyze whether the entanglement shared by blocks of modes distributes according to a strong monogamy law. This property, once established, allows us to quantify the genuine N -partite entanglement not encoded into 2,…,K,…,(N-1) -partite quantum correlations. Strong monogamy is numerically verified, and the explicit expression of the measure of residual genuine multipartite entanglement is analytically derived, by a recursive formula, for a subclass of Gaussian states. These are fully symmetric (permutation-invariant) states that are multipartitioned into blocks, each consisting of an arbitrarily assigned number of modes. We compute the genuine multipartite entanglement shared by the blocks of modes and investigate its scaling properties with the number and size of the blocks, the total number of modes, the global mixedness of the state, and the squeezed resources needed for state engineering. To achieve the exact computation of the block entanglement, we introduce and prove a general result of symplectic analysis: Correlations among K blocks in N -mode multisymmetric and multipartite Gaussian states, which are locally invariant under permutation of modes within each block, can be transformed by a local (with respect to the partition) unitary operation into correlations shared by K single modes, one per block, in effective nonsymmetric states where N-K modes are completely uncorrelated. Due to this theorem, the above results, such as the derivation of the explicit expression for the residual multipartite entanglement, its nonnegativity, and its scaling properties, extend to the subclass of non-symmetric Gaussian states that are obtained by the unitary localization of the multipartite entanglement of symmetric states. These findings provide strong

Transportation Mode Detection Based on Permutation Entropy and Extreme Learning Machine

Directory of Open Access Journals (Sweden)

Lei Zhang

2015-01-01

Full Text Available With the increasing prevalence of GPS devices and mobile phones, transportation mode detection based on GPS data has been a hot topic in GPS trajectory data analysis. Transportation modes such as walking, driving, bus, and taxi denote an important characteristic of the mobile user. Longitude, latitude, speed, acceleration, and direction are usually used as features in transportation mode detection. In this paper, first, we explore the possibility of using Permutation Entropy (PE of speed, a measure of complexity and uncertainty of GPS trajectory segment, as a feature for transportation mode detection. Second, we employ Extreme Learning Machine (ELM to distinguish GPS trajectory segments of different transportation. Finally, to evaluate the performance of the proposed method, we make experiments on GeoLife dataset. Experiments results show that we can get more than 50% accuracy when only using PE as a feature to characterize trajectory sequence. PE can indeed be effectively used to detect transportation mode from GPS trajectory. The proposed method has much better accuracy and faster running time than the methods based on the other features and SVM classifier.

State-space models for bio-loggers: A methodological road map

DEFF Research Database (Denmark)

Jonsen, I.D.; Basson, M.; Bestley, S.

2012-01-01

Ecologists have an unprecedented array of bio-logging technologies available to conduct in situ studies of horizontal and vertical movement patterns of marine animals. These tracking data provide key information about foraging, migratory, and other behaviours that can be linked with bio-physical...... development of state-space modelling approaches for animal movement data provides statistical rigor for inferring hidden behavioural states, relating these states to bio-physical data, and ultimately for predicting the potential impacts of climate change. Despite the widespread utility, and current popularity...

State space approach to mixed boundary value problems.

Science.gov (United States)

Chen, C. F.; Chen, M. M.

1973-01-01

A state-space procedure for the formulation and solution of mixed boundary value problems is established. This procedure is a natural extension of the method used in initial value problems; however, certain special theorems and rules must be developed. The scope of the applications of the approach includes beam, arch, and axisymmetric shell problems in structural analysis, boundary layer problems in fluid mechanics, and eigenvalue problems for deformable bodies. Many classical methods in these fields developed by Holzer, Prohl, Myklestad, Thomson, Love-Meissner, and others can be either simplified or unified under new light shed by the state-variable approach. A beam problem is included as an illustration.

Evaluating Russian space nuclear reactor technology for United States applications

International Nuclear Information System (INIS)

Polansky, G.F.; Schmidt, G.L.; Voss, S.S.; Reynolds, E.L.

1994-01-01

Space nuclear power and nuclear electric propulsion are considered important technologies for planetary exploration, as well as selected earth orbit applications. The Nuclear Electric Propulsion Space Test Program (NEPSTP) was intended to provide an early flight demonstration of these technologies at relatively low cost through extensive use of existing Russian technology. The key element of Russian technology employed in the program was the Topaz II reactor. Refocusing of the activities of the Ballistic Missile Defense Organization (BMDO), combined with budgetary pressures, forced the cancellation of the NEPSTP at the end of the 1993 fiscal year. The NEPSTP was faced with many unique flight qualification issues. In general, the launch of a spacecraft employing a nuclear reactor power system complicates many spacecraft qualification activities. However, the NEPSTP activities were further complicated because the reactor power system was a Russian design. Therefore, this program considered not only the unique flight qualification issues associated with space nuclear power, but also with differences between Russian and United States flight qualification procedures. This paper presents an overview of the NEPSTP. The program goals, the proposed mission, the spacecraft, and the Topaz II space nuclear power system are described. The subject of flight qualification is examined and the inherent difficulties of qualifying a space reactor are described. The differences between United States and Russian flight qualification procedures are explored. A plan is then described that was developed to determine an appropriate flight qualification program for the Topaz II reactor to support a possible NEPSTP launch

State space orderings for Gauss-Seidel in Markov chains revisited

Energy Technology Data Exchange (ETDEWEB)

Dayar, T. [Bilkent Univ., Ankara (Turkey)

1996-12-31

Symmetric state space orderings of a Markov chain may be used to reduce the magnitude of the subdominant eigenvalue of the (Gauss-Seidel) iteration matrix. Orderings that maximize the elemental mass or the number of nonzero elements in the dominant term of the Gauss-Seidel splitting (that is, the term approximating the coefficient matrix) do not necessarily converge faster. An ordering of a Markov chain that satisfies Property-R is semi-convergent. On the other hand, there are semi-convergent symmetric state space orderings that do not satisfy Property-R. For a given ordering, a simple approach for checking Property-R is shown. An algorithm that orders the states of a Markov chain so as to increase the likelihood of satisfying Property-R is presented. The computational complexity of the ordering algorithm is less than that of a single Gauss-Seidel iteration (for sparse matrices). In doing all this, the aim is to gain an insight for faster converging orderings. Results from a variety of applications improve the confidence in the algorithm.

Grey-box state-space identification of nonlinear mechanical vibrations

Science.gov (United States)

Noël, J. P.; Schoukens, J.

2018-05-01

The present paper deals with the identification of nonlinear mechanical vibrations. A grey-box, or semi-physical, nonlinear state-space representation is introduced, expressing the nonlinear basis functions using a limited number of measured output variables. This representation assumes that the observed nonlinearities are localised in physical space, which is a generic case in mechanics. A two-step identification procedure is derived for the grey-box model parameters, integrating nonlinear subspace initialisation and weighted least-squares optimisation. The complete procedure is applied to an electrical circuit mimicking the behaviour of a single-input, single-output (SISO) nonlinear mechanical system and to a single-input, multiple-output (SIMO) geometrically nonlinear beam structure.

Multivariable Wind Modeling in State Space

DEFF Research Database (Denmark)

Sichani, Mahdi Teimouri; Pedersen, B. J.

2011-01-01

Turbulence of the incoming wind field is of paramount importance to the dynamic response of wind turbines. Hence reliable stochastic models of the turbulence should be available from which time series can be generated for dynamic response and structural safety analysis. In the paper an empirical...... for the vector turbulence process incorporating its phase spectrum in one stage, and its results are compared with a conventional ARMA modeling method....... the succeeding state space and ARMA modeling of the turbulence rely on the positive definiteness of the cross-spectral density matrix, the problem with the non-positive definiteness of such matrices is at first addressed and suitable treatments regarding it are proposed. From the adjusted positive definite cross...

State-Space Estimation of Soil Organic Carbon Stock

Science.gov (United States)

Ogunwole, Joshua O.; Timm, Luis C.; Obidike-Ugwu, Evelyn O.; Gabriels, Donald M.

2014-04-01

Understanding soil spatial variability and identifying soil parameters most determinant to soil organic carbon stock is pivotal to precision in ecological modelling, prediction, estimation and management of soil within a landscape. This study investigates and describes field soil variability and its structural pattern for agricultural management decisions. The main aim was to relate variation in soil organic carbon stock to soil properties and to estimate soil organic carbon stock from the soil properties. A transect sampling of 100 points at 3 m intervals was carried out. Soils were sampled and analyzed for soil organic carbon and other selected soil properties along with determination of dry aggregate and water-stable aggregate fractions. Principal component analysis, geostatistics, and state-space analysis were conducted on the analyzed soil properties. The first three principal components explained 53.2% of the total variation; Principal Component 1 was dominated by soil exchange complex and dry sieved macroaggregates clusters. Exponential semivariogram model described the structure of soil organic carbon stock with a strong dependence indicating that soil organic carbon values were correlated up to 10.8m.Neighbouring values of soil organic carbon stock, all waterstable aggregate fractions, and dithionite and pyrophosphate iron gave reliable estimate of soil organic carbon stock by state-space.

A state-space Bayesian framework for estimating biogeochemical transformations using time-lapse geophysical data

Energy Technology Data Exchange (ETDEWEB)

Chen, J.; Hubbard, S.; Williams, K.; Pride, S.; Li, L.; Steefel, C.; Slater, L.

2009-04-15

We develop a state-space Bayesian framework to combine time-lapse geophysical data with other types of information for quantitative estimation of biogeochemical parameters during bioremediation. We consider characteristics of end-products of biogeochemical transformations as state vectors, which evolve under constraints of local environments through evolution equations, and consider time-lapse geophysical data as available observations, which could be linked to the state vectors through petrophysical models. We estimate the state vectors and their associated unknown parameters over time using Markov chain Monte Carlo sampling methods. To demonstrate the use of the state-space approach, we apply it to complex resistivity data collected during laboratory column biostimulation experiments that were poised to precipitate iron and zinc sulfides during sulfate reduction. We develop a petrophysical model based on sphere-shaped cells to link the sulfide precipitate properties to the time-lapse geophysical attributes and estimate volume fraction of the sulfide precipitates, fraction of the dispersed, sulfide-encrusted cells, mean radius of the aggregated clusters, and permeability over the course of the experiments. Results of the case study suggest that the developed state-space approach permits the use of geophysical datasets for providing quantitative estimates of end-product characteristics and hydrological feedbacks associated with biogeochemical transformations. Although tested here on laboratory column experiment datasets, the developed framework provides the foundation needed for quantitative field-scale estimation of biogeochemical parameters over space and time using direct, but often sparse wellbore data with indirect, but more spatially extensive geophysical datasets.

Solar Pumped Solid State Lasers for Space Solar Power: Experimental Path

Science.gov (United States)

Fork, Richard L.; Carrington, Connie K.; Walker, Wesley W.; Cole, Spencer T.; Green, Jason J. A.; Laycock, Rustin L.

2003-01-01

We outline an experimentally based strategy designed to lead to solar pumped solid state laser oscillators useful for space solar power. Our method involves solar pumping a novel solid state gain element specifically designed to provide efficient conversion of sunlight in space to coherent laser light. Kilowatt and higher average power is sought from each gain element. Multiple such modular gain elements can be used to accumulate total average power of interest for power beaming in space, e.g., 100 kilowatts and more. Where desirable the high average power can also be produced as a train of pulses having high peak power (e.g., greater than 10(exp 10 watts). The modular nature of the basic gain element supports an experimental strategy in which the core technology can be validated by experiments on a single gain element. We propose to do this experimental validation both in terrestrial locations and also on a smaller scale in space. We describe a terrestrial experiment that includes diagnostics and the option of locating the laser beam path in vacuum environment. We describe a space based experiment designed to be compatible with the Japanese Experimental Module (JEM) on the International Space Station (ISS). We anticipate the gain elements will be based on low temperature (approx. 100 degrees Kelvin) operation of high thermal conductivity (k approx. 100 W/cm-K) diamond and sapphire (k approx. 4 W/cm-K). The basic gain element will be formed by sequences of thin alternating layers of diamond and Ti:sapphire with special attention given to the material interfaces. We anticipate this strategy will lead to a particularly simple, robust, and easily maintained low mass modelocked multi-element laser oscillator useful for space solar power.

On coherent-state representations of quantum mechanics: Wave mechanics in phase space

DEFF Research Database (Denmark)

Møller, Klaus Braagaard; Jørgensen, Thomas Godsk; Torres-Vega, Gabino

1997-01-01

In this article we argue that the state-vector phase-space representation recently proposed by Torres-Vega and co-workers [introduced in J. Chem. Phys. 98, 3103 (1993)] coincides with the totality of coherent-state representations for the Heisenberg-Weyl group. This fact leads to ambiguities when...

Parameter retrieval of chiral metamaterials based on the state-space approach.

Science.gov (United States)

Zarifi, Davoud; Soleimani, Mohammad; Abdolali, Ali

2013-08-01

This paper deals with the introduction of an approach for the electromagnetic characterization of homogeneous chiral layers. The proposed method is based on the state-space approach and properties of a 4×4 state transition matrix. Based on this, first, the forward problem analysis through the state-space method is reviewed and properties of the state transition matrix of a chiral layer are presented and proved as two theorems. The formulation of a proposed electromagnetic characterization method is then presented. In this method, scattering data for a linearly polarized plane wave incident normally on a homogeneous chiral slab are combined with properties of a state transition matrix and provide a powerful characterization method. The main difference with respect to other well-established retrieval procedures based on the use of the scattering parameters relies on the direct computation of the transfer matrix of the slab as opposed to the conventional calculation of the propagation constant and impedance of the modes supported by the medium. The proposed approach allows avoiding nonlinearity of the problem but requires getting enough equations to fulfill the task which was provided by considering some properties of the state transition matrix. To demonstrate the applicability and validity of the method, the constitutive parameters of two well-known dispersive chiral metamaterial structures at microwave frequencies are retrieved. The results show that the proposed method is robust and reliable.

Quantum computing based on space states without charge transfer

International Nuclear Information System (INIS)

Vyurkov, V.; Filippov, S.; Gorelik, L.

2010-01-01

An implementation of a quantum computer based on space states in double quantum dots is discussed. There is no charge transfer in qubits during a calculation, therefore, uncontrolled entanglement between qubits due to long-range Coulomb interaction is suppressed. Encoding and processing of quantum information is merely performed on symmetric and antisymmetric states of the electron in double quantum dots. Other plausible sources of decoherence caused by interaction with phonons and gates could be substantially suppressed in the structure as well. We also demonstrate how all necessary quantum logic operations, initialization, writing, and read-out could be carried out in the computer.

State Space Reduction of Linear Processes using Control Flow Reconstruction

NARCIS (Netherlands)

van de Pol, Jan Cornelis; Timmer, Mark

2009-01-01

We present a new method for fighting the state space explosion of process algebraic specifications, by performing static analysis on an intermediate format: linear process equations (LPEs). Our method consists of two steps: (1) we reconstruct the LPE's control flow, detecting control flow parameters

State Space Reduction of Linear Processes Using Control Flow Reconstruction

NARCIS (Netherlands)

van de Pol, Jan Cornelis; Timmer, Mark; Liu, Zhiming; Ravn, Anders P.

2009-01-01

We present a new method for fighting the state space explosion of process algebraic specifications, by performing static analysis on an intermediate format: linear process equations (LPEs). Our method consists of two steps: (1) we reconstruct the LPE's control flow, detecting control flow parameters

A non-linear state space approach to model groundwater fluctuations

NARCIS (Netherlands)

Berendrecht, W.L.; Heemink, A.W.; Geer, F.C. van; Gehrels, J.C.

2006-01-01

A non-linear state space model is developed for describing groundwater fluctuations. Non-linearity is introduced by modeling the (unobserved) degree of water saturation of the root zone. The non-linear relations are based on physical concepts describing the dependence of both the actual

Motion state analysis of space target based on optical cross section

Science.gov (United States)

Tian, Qichen; Li, Zhi; Xu, Can; Liu, Chenghao

2017-10-01

In order to solve the problem that the movement state analysis method of the space target based on OCS is not related to the real motion state. This paper proposes a method based on OCS for analyzing the state of space target motion. This paper first establish a three-dimensional model of real STSS satellite, then change the satellite's surface into element, and assign material to each panel according to the actual conditions of the satellite. This paper set up a motion scene according to the orbit parameters of STSS satellite in STK, and the motion states are set to three axis steady state and slowly rotating unstable state respectively. In these two states, the occlusion condition of the surface element is firstly determined, and the effective face element is selected. Then, the coordinates of the observation station and the solar coordinates in the satellite body coordinate system are input into the OCS calculation program, and the OCS variation curves of the three axis steady state and the slow rotating unstable state STSS satellite are obtained. Combining the satellite surface structure and the load situation, the OCS change curve of the three axis stabilized satellite is analyzed, and the conclude that the OCS curve fluctuates up and down when the sunlight is irradiated to the load area; By using Spectral analysis method, autocorrelation analysis and the cross residual method, the rotation speed of OCS satellite in slow rotating unstable state is analyzed, and the rotation speed of satellite is successfully reversed. By comparing the three methods, it is found that the cross residual method is more accurate.

Negative norm states in de Sitter space and QFT without renormalization procedure

International Nuclear Information System (INIS)

Takook, M.V.

2002-01-01

In recent papers, 1,2 it has been shown that the presence of negative norm states or negative frequency solutions are indispensable for a fully covariant quantization of the minimally coupled scalar field in de Sitter space. Their presence, while leaving unchanged the physical content of the theory, offers the advantage of eliminating any ultraviolet divergence in the vacuum energy 2 and infrared divergence in the two point function. 3 We attempt here to extend this method to the interacting quantum field in Minkowski space-time. As an illustration of the procedure, we consider the λϕ 4 theory in Minkowski space-time. The mathematical consequences of this method is the disappearance of the ultraviolet divergence to the one-loop approximation. This means, the effect of these auxiliary negative norm states is to allow an automatic renormalization of the theory in this approximation. (author)

Complex network analysis of state spaces for random Boolean networks

Energy Technology Data Exchange (ETDEWEB)

Shreim, Amer [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Berdahl, Andrew [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Sood, Vishal [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Grassberger, Peter [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Paczuski, Maya [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada)

2008-01-15

We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 {<=} K {<=} 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2{sup N}, for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two.

Complex network analysis of state spaces for random Boolean networks

International Nuclear Information System (INIS)

Shreim, Amer; Berdahl, Andrew; Sood, Vishal; Grassberger, Peter; Paczuski, Maya

2008-01-01

We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 ≤ K ≤ 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2 N , for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two

A multipopulation PSO based memetic algorithm for permutation flow shop scheduling.

Science.gov (United States)

Liu, Ruochen; Ma, Chenlin; Ma, Wenping; Li, Yangyang

2013-01-01

The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each particle evolves itself by the standard PSO and then updates each subpopulation by using different local search schemes such as variable neighborhood search (VNS) and individual improvement scheme (IIS). Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA) and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. The best particle in the entire particle swarm is used to update the global optimal solution. The proposed MPSOMA is compared with two recently proposed algorithms, namely, PSO based memetic algorithm (PSOMA) and hybrid particle swarm optimization with estimation of distribution algorithm (PSOEDA), on 29 well-known PFFSPs taken from OR-library, and the experimental results show that it is an effective approach for the PFFSP.

A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling

Directory of Open Access Journals (Sweden)

Ruochen Liu

2013-01-01

Full Text Available The permutation flow shop scheduling problem (PFSSP is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO based memetic algorithm (MPSOMA is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each particle evolves itself by the standard PSO and then updates each subpopulation by using different local search schemes such as variable neighborhood search (VNS and individual improvement scheme (IIS. Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. The best particle in the entire particle swarm is used to update the global optimal solution. The proposed MPSOMA is compared with two recently proposed algorithms, namely, PSO based memetic algorithm (PSOMA and hybrid particle swarm optimization with estimation of distribution algorithm (PSOEDA, on 29 well-known PFFSPs taken from OR-library, and the experimental results show that it is an effective approach for the PFFSP.

Harmonic Instability Assessment Using State-Space Modeling and Participation Analysis in Inverter-Fed Power Systems

DEFF Research Database (Denmark)

Wang, Yanbo; Wang, Xiongfei; Blaabjerg, Frede

2017-01-01

parameters on the harmonic instability of the power system. Moreover, the harmonic-frequency oscillation modes are identified, where participation analysis is presented to evaluate the contributions of different states to these modes and to further reveal how the system gives rise to harmonic instability......This paper presents a harmonic instability analysis method using state-space modeling and participation analysis in the inverter-fed ac power systems. A full-order state-space model for the droop-controlled Distributed Generation (DG) inverter is built first, including the time delay of the digital...... control system, inner current and voltage control loops, and outer droop-based power control loop. Based on the DG inverter model, an overall state-space model of a two-inverter-fed system is established. The eigenvalue-based stability analysis is then presented to assess the influence of controller...

Space science public outreach at Louisiana State University

Science.gov (United States)

Guzik, T.; Babin, E.; Cooney, W.; Giammanco, J.; Hartman, D.; McNeil, R.; Slovak, M.; Stacy, J.

Over the last seven years the Astronomy / Astrophysics group in the Department of Physics and Astronomy of Louisiana State University has developed an exten- sive Space Science education and public outreach program. This program includes the local park district (the Recreation and Park Commission for the Parish of East Baton Rouge, BREC), the local amateur astronomer group (the Baton Rouge As- tronomical Society, BRAS), the Louisiana Arts and Science Museum (LASM), and Southern University (SU, part of the largest HBCU system in the nation). Our effort has directly led to the development of the Highland Road Park Observatory (HRPO, http://www.bro.lsu.edu/hrpo) that supports student astronomy training at LSU and SU, amateur observations and a public program for adults and children, establishment of a series of teacher professional development workshops in astronomy and physics, and the "Robots for Internet Experiences (ROBIE)" project (http://www.bro.lsu.edu/) where we have several instruments (e.g. HAM radio, radio telescope, optical tele- scopes) that can be controlled over the internet by students and teachers in the class- room along with associated lessons developed by a teacher group. In addition, this year the LASM, will be opening a new planetarium / space theater in downtown Baton Rouge, Louisiana. We are currently working to bring live views of the heavens from the HRPO telescope to audiences attending planetarium shows and will be working closely with planetarium staff to develop shows that highlight LSU astronomy / space science research. During the presentation we will provide some details about our in- dividual projects, the overall structure of our program, establishing community links and some of the lessons we learned along the way. Finally, we would like to acknowl- edge NASA, Louisiana State University, the Louisiana Systemic Initiatives Program and the Louisiana Technology Innovation Fund for their support.

Dissipative differential systems and the state space H∞ control problem

NARCIS (Netherlands)

Trentelman, H.L.; Willems, J.C.

2000-01-01

The purpose of this paper is to apply our very recent results on the synthesis of dissipative linear differential systems to the 'classical' state space H∞ control problem. We first review our general problem set-up, where the problem of rendering a given plant dissipative by general

On the use of permutation in and the performance of a class of nonparametric methods to detect differential gene expression.

Science.gov (United States)

Pan, Wei

2003-07-22

Recently a class of nonparametric statistical methods, including the empirical Bayes (EB) method, the significance analysis of microarray (SAM) method and the mixture model method (MMM), have been proposed to detect differential gene expression for replicated microarray experiments conducted under two conditions. All the methods depend on constructing a test statistic Z and a so-called null statistic z. The null statistic z is used to provide some reference distribution for Z such that statistical inference can be accomplished. A common way of constructing z is to apply Z to randomly permuted data. Here we point our that the distribution of z may not approximate the null distribution of Z well, leading to possibly too conservative inference. This observation may apply to other permutation-based nonparametric methods. We propose a new method of constructing a null statistic that aims to estimate the null distribution of a test statistic directly. Using simulated data and real data, we assess and compare the performance of the existing method and our new method when applied in EB, SAM and MMM. Some interesting findings on operating characteristics of EB, SAM and MMM are also reported. Finally, by combining the idea of SAM and MMM, we outline a simple nonparametric method based on the direct use of a test statistic and a null statistic.

Solar Pumped High Power Solid State Laser for Space Applications

Science.gov (United States)

Fork, Richard L.; Laycock, Rustin L.; Green, Jason J. A.; Walker, Wesley W.; Cole, Spencer T.; Frederick, Kevin B.; Phillips, Dane J.

2004-01-01

Highly coherent laser light provides a nearly optimal means of transmitting power in space. The simplest most direct means of converting sunlight to coherent laser light is a solar pumped laser oscillator. A key need for broadly useful space solar power is a robust solid state laser oscillator capable of operating efficiently in near Earth space at output powers in the multi hundred kilowatt range. The principal challenges in realizing such solar pumped laser oscillators are: (1) the need to remove heat from the solid state laser material without introducing unacceptable thermal shock, thermal lensing, or thermal stress induced birefringence to a degree that improves on current removal rates by several orders of magnitude and (2) to introduce sunlight at an effective concentration (kW/sq cm of laser cross sectional area) that is several orders of magnitude higher than currently available while tolerating a pointing error of the spacecraft of several degrees. We discuss strategies for addressing these challenges. The need to remove the high densities of heat, e.g., 30 kW/cu cm, while keeping the thermal shock, thermal lensing and thermal stress induced birefringence loss sufficiently low is addressed in terms of a novel use of diamond integrated with the laser material, such as Ti:sapphire in a manner such that the waste heat is removed from the laser medium in an axial direction and in the diamond in a radial direction. We discuss means for concentrating sunlight to an effective areal density of the order of 30 kW/sq cm. The method integrates conventional imaging optics, non-imaging optics and nonlinear optics. In effect we use a method that combines some of the methods of optical pumping solid state materials and optical fiber, but also address laser media having areas sufficiently large, e.g., 1 cm diameter to handle the multi-hundred kilowatt level powers needed for space solar power.

State-space-based harmonic stability analysis for paralleled grid-connected inverters

DEFF Research Database (Denmark)

Wang, Yanbo; Wang, Xiongfei; Chen, Zhe

2016-01-01

This paper addresses a state-space-based harmonic stability analysis of paralleled grid-connected inverters system. A small signal model of individual inverter is developed, where LCL filter, the equivalent delay of control system, and current controller are modeled. Then, the overall small signal...... model of paralleled grid-connected inverters is built. Finally, the state space-based stability analysis approach is developed to explain the harmonic resonance phenomenon. The eigenvalue traces associated with time delay and coupled grid impedance are obtained, which accounts for how the unstable...... inverter produces the harmonic resonance and leads to the instability of whole paralleled system. The proposed approach reveals the contributions of the grid impedance as well as the coupled effect on other grid-connected inverters under different grid conditions. Simulation and experimental results...

An integral transform related to quantization

International Nuclear Information System (INIS)

Daubechies, I.; Grossmann, A.

1978-08-01

The authors study in a coordinate-free way the integral transform relating a function on phase space to the matrix elements of the corresponding quantum mechanical operator between coherent states. The items discussed include: inversion (given by the same kernel), bounds, matrix elements between eigenstates of harmonic oscillators, and classical functions corresponding to permutation operators. (author)

A Novel Method of Fault Diagnosis for Rolling Bearing Based on Dual Tree Complex Wavelet Packet Transform and Improved Multiscale Permutation Entropy

Directory of Open Access Journals (Sweden)

Guiji Tang

2016-01-01

Full Text Available A novel method of fault diagnosis for rolling bearing, which combines the dual tree complex wavelet packet transform (DTCWPT, the improved multiscale permutation entropy (IMPE, and the linear local tangent space alignment (LLTSA with the extreme learning machine (ELM, is put forward in this paper. In this method, in order to effectively discover the underlying feature information, DTCWPT, which has the attractive properties as nearly shift invariance and reduced aliasing, is firstly utilized to decompose the original signal into a set of subband signals. Then, IMPE, which is designed to reduce the variability of entropy measures, is applied to characterize the properties of each obtained subband signal at different scales. Furthermore, the feature vectors are constructed by combining IMPE of each subband signal. After the feature vectors construction, LLTSA is employed to compress the high dimensional vectors of the training and the testing samples into the low dimensional vectors with better distinguishability. Finally, the ELM classifier is used to automatically accomplish the condition identification with the low dimensional feature vectors. The experimental data analysis results validate the effectiveness of the presented diagnosis method and demonstrate that this method can be applied to distinguish the different fault types and fault degrees of rolling bearings.

Exploiting Stabilizers and Parallelism in State Space Generation with the Symmetry Method

DEFF Research Database (Denmark)

Lorentsen, Louise; Kristensen, Lars Michael

2001-01-01

The symmetry method is a main reduction paradigm for alleviating the state explosion problem. For large symmetry groups deciding whether two states are symmetric becomes time expensive due to the apparent high time complexity of the orbit problem. The contribution of this paper is to alleviate th...... the negative impact of the orbit problem by the specification of canonical representatives for equivalence classes of states in Coloured Petri Nets, and by giving algorithms exploiting stabilizers and parallelism for computing the condensed state space....

Monthly version of HadISST sea surface temperature state-space components

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — State-Space Decomposition of Monthly version of HadISST sea surface temperature component (1-degree). See Rayner, N. A., Parker, D. E., Horton, E. B., Folland, C....

A state space approach for the eigenvalue problem of marine risers

KAUST Repository

Alfosail, Feras; Nayfeh, Ali H.; Younis, Mohammad I.

2017-01-01

A numerical state-space approach is proposed to examine the natural frequencies and critical buckling limits of marine risers. A large axial tension in the riser model causes numerical limitations. These limitations are overcome by using

The Case For Space: A Legislative Framework For An Independent United States Space Force

Science.gov (United States)

2018-04-01

example of an organization created by competing bureaucratic interests, ARPA hampered and muddled early service efforts to think clearly about space.12...change the way we think and prepare for that eventuality.”54 As aptly stated recently by Melissa de Zwart, Dean of Law at the University of Adelaide in...NASA Bets on Private Companies to Exploit Moon’s Resources,” Phys.org, 9 February 2014, https://phys.org/news/2014-02-nasa-private-companies-exploit

State-space modeling of the radio frequency inductively-coupled plasma generator

International Nuclear Information System (INIS)

Dewangan, Rakesh Kumar; Punjabi, Sangeeta B; Mangalvedekar, H A; Lande, B K; Joshi, N K; Barve, D N

2010-01-01

Computational fluid dynamics models of RF-ICP are useful in understanding the basic transport phenomenon in an ICP torch under a wide variety of operating conditions. However, these models lack the ability to evaluate the effects of the plasma condition on the RF generator. In this paper, simulation of an induction plasma generator has been done using state space modelling by considering inductively coupled plasma as a part of RF network .The time dependent response of the RF-ICP generator circuit to given input excitation has been computed by extracting the circuit's state-space variables and their constraint matrices. MATLAB 7.1 software has been used to solve the state equations. The values of RF coil current, frequency and plasma power has been measured experimentally also at different plate bias voltage. The simulated model is able to predict RF coil current, frequency, plasma power, overall efficiency of the generator. The simulated and measured values are in agreement with each other. This model can prove useful as a design tool for the Induction plasma generator.

Generalized state spaces and nonlocality in fault-tolerant quantum-computing schemes

International Nuclear Information System (INIS)

Ratanje, N.; Virmani, S.

2011-01-01

We develop connections between generalized notions of entanglement and quantum computational devices where the measurements available are restricted, either because they are noisy and/or because by design they are only along Pauli directions. By considering restricted measurements one can (by considering the dual positive operators) construct single-particle-state spaces that are different to the usual quantum-state space. This leads to a modified notion of entanglement that can be very different to the quantum version (for example, Bell states can become separable). We use this approach to develop alternative methods of classical simulation that have strong connections to the study of nonlocal correlations: we construct noisy quantum computers that admit operations outside the Clifford set and can generate some forms of multiparty quantum entanglement, but are otherwise classical in that they can be efficiently simulated classically and cannot generate nonlocal statistics. Although the approach provides new regimes of noisy quantum evolution that can be efficiently simulated classically, it does not appear to lead to significant reductions of existing upper bounds to fault tolerance thresholds for common noise models.

Altered states, altered spaces : architecture, space and landscape in the film and television of Stanley Kubrick and Ken Russell

OpenAIRE

Melia, Matthew

2017-01-01

Altered States, Altered Spaces: Architecture, Landscape and Space in the work of Stanley Kubrick and Ken Russell.\\ud \\ud Stanley Kubrick and Ken Russell, at first, seem like unlikely bedfellows for a critical comparison: the combined Baroque, Mannerist, frequently excessive and romantic nature of Russell’s screen standing in apparent contrast to the structure, order, organisation, Brutalism and spatial complexity of Kubrick’s.\\ud \\ud In an online blogpost1 (2007) Russell biographer Paul Sutto...

State-space solutions to the h_inf/ltr design problem

DEFF Research Database (Denmark)

Niemann, Hans Henrik

1993-01-01

observer based approach is proposed, where the Z part of the controller is appended to a standard full-order observer. Second, allowing for general controllers, an JC state-space problem is formulated directly from the recovery errors. Both approaches lead to controller orders of at most 2n. In the minimum...

State space model extraction of thermohydraulic systems – Part II: A linear graph approach applied to a Brayton cycle-based power conversion unit

International Nuclear Information System (INIS)

Uren, Kenneth Richard; Schoor, George van

2013-01-01

This second paper in a two part series presents the application of a developed state space model extraction methodology applied to a Brayton cycle-based PCU (power conversion unit) of a PBMR (pebble bed modular reactor). The goal is to investigate if the state space extraction methodology can cope with larger and more complex thermohydraulic systems. In Part I the state space model extraction methodology for the purpose of control was described in detail and a state space representation was extracted for a U-tube system to illustrate the concept. In this paper a 25th order nonlinear state space representation in terms of the different energy domains is extracted. This state space representation is solved and the responses of a number of important states are compared with results obtained from a PBMR PCU Flownex ® model. Flownex ® is a validated thermo fluid simulation software package. The results show that the state space model closely resembles the dynamics of the PBMR PCU. This kind of model may be used for nonlinear MIMO (multi-input, multi-output) type of control strategies. However, there is still a need for linear state space models since many control system design and analysis techniques require a linear state space model. This issue is also addressed in this paper by showing how a linear state space model can be derived from the extracted nonlinear state space model. The linearised state space model is also validated by comparing the state space model to an existing linear Simulink ® model of the PBMR PCU system. - Highlights: • State space model extraction of a pebble bed modular reactor PCU (power conversion unit). • A 25th order nonlinear time varying state space model is obtained. • Linearisation of a nonlinear state space model for use in power output control. • Non-minimum phase characteristic that is challenging in terms of control. • Models derived are useful for MIMO control strategies

Unstable quantum states and rigged Hilbert spaces

International Nuclear Information System (INIS)

Gorini, V.; Parravicini, G.

1978-10-01

Rigged Hilbert space techniques are applied to the quantum mechanical treatment of unstable states in nonrelativistic scattering theory. A method is discussed which is based on representations of decay amplitudes in terms of expansions over complete sets of generalized eigenvectors of the interacting Hamiltonian, corresponding to complex eigenvalues. These expansions contain both a discrete and a continuum contribution. The former corresponds to eigenvalues located at the second sheet poles of the S matrix, and yields the exponential terms in the survival amplitude. The latter arises from generalized eigenvectors associated to complex eigenvalues on background contours in the complex plane, and gives the corrections to the exponential law. 27 references

Weaponizing the Final Frontier: The United States and the New Space Race

Science.gov (United States)

2017-06-09

prepare to defend these systems from attack.41 The next logical step is the development and execution of this philosophy to secure national interests...fourth argument impacting the weaponization of space references is the question of morality . In the article, Moral and Ethical Decisions Regarding Space...Warfare, Col (now General) John Hyten and Dr. Robert Uy describe the moral and ethical considerations to evaluate as the United States shapes

State-space model with deep learning for functional dynamics estimation in resting-state fMRI.

Science.gov (United States)

Suk, Heung-Il; Wee, Chong-Yaw; Lee, Seong-Whan; Shen, Dinggang

2016-04-01

Studies on resting-state functional Magnetic Resonance Imaging (rs-fMRI) have shown that different brain regions still actively interact with each other while a subject is at rest, and such functional interaction is not stationary but changes over time. In terms of a large-scale brain network, in this paper, we focus on time-varying patterns of functional networks, i.e., functional dynamics, inherent in rs-fMRI, which is one of the emerging issues along with the network modelling. Specifically, we propose a novel methodological architecture that combines deep learning and state-space modelling, and apply it to rs-fMRI based Mild Cognitive Impairment (MCI) diagnosis. We first devise a Deep Auto-Encoder (DAE) to discover hierarchical non-linear functional relations among regions, by which we transform the regional features into an embedding space, whose bases are complex functional networks. Given the embedded functional features, we then use a Hidden Markov Model (HMM) to estimate dynamic characteristics of functional networks inherent in rs-fMRI via internal states, which are unobservable but can be inferred from observations statistically. By building a generative model with an HMM, we estimate the likelihood of the input features of rs-fMRI as belonging to the corresponding status, i.e., MCI or normal healthy control, based on which we identify the clinical label of a testing subject. In order to validate the effectiveness of the proposed method, we performed experiments on two different datasets and compared with state-of-the-art methods in the literature. We also analyzed the functional networks learned by DAE, estimated the functional connectivities by decoding hidden states in HMM, and investigated the estimated functional connectivities by means of a graph-theoretic approach. Copyright © 2016 Elsevier Inc. All rights reserved.

Permutation on hybrid natural inflation

Science.gov (United States)

Carone, Christopher D.; Erlich, Joshua; Ramos, Raymundo; Sher, Marc

2014-09-01

We analyze a model of hybrid natural inflation based on the smallest non-Abelian discrete group S3. Leading invariant terms in the scalar potential have an accidental global symmetry that is spontaneously broken, providing a pseudo-Goldstone boson that is identified as the inflaton. The S3 symmetry restricts both the form of the inflaton potential and the couplings of the inflaton field to the waterfall fields responsible for the end of inflation. We identify viable points in the model parameter space. Although the power in tensor modes is small in most of the parameter space of the model, we identify parameter choices that yield potentially observable values of r without super-Planckian initial values of the inflaton field.

Numerically Accelerated Importance Sampling for Nonlinear Non-Gaussian State Space Models

NARCIS (Netherlands)

Koopman, S.J.; Lucas, A.; Scharth, M.

2015-01-01

We propose a general likelihood evaluation method for nonlinear non-Gaussian state-space models using the simulation-based method of efficient importance sampling. We minimize the simulation effort by replacing some key steps of the likelihood estimation procedure by numerical integration. We refer

Wind power scenario generation through state-space specifications for uncertainty analysis of wind power plants

International Nuclear Information System (INIS)

Díaz, Guzmán; Gómez-Aleixandre, Javier; Coto, José

2016-01-01

Highlights: • State space representations for simulating wind power plant output are proposed. • The representation of wind speed in state space allows structural analysis. • The joint model incorporates the temporal and spatial dependence structure. • The models are easily integrable into a backward/forward sweep algorithm. • Results evidence the remarkable differences between joint and marginal models. - Abstract: This paper proposes the use of state space models to generate scenarios for the analysis of wind power plant (WPP) generation capabilities. The proposal is rooted on the advantages that state space models present for dealing with stochastic processes; mainly their structural definition and the use of Kalman filter to naturally tackle some involved operations. The specification proposed in this paper comprises a structured representation of individual Box–Jenkins models, with indications about further improvements that can be easily performed. These marginal models are combined to form a joint model in which the dependence structure is easily handled. Indications about the procedure to calibrate and check the model, as well as a validation of its statistical appropriateness, are provided. Application of the proposed state space models provides insight on the need to properly specify the structural dependence between wind speeds. In this paper the joint and marginal models are smoothly integrated into a backward–forward sweep algorithm to determine the performance indicators (voltages and powers) of a WPP through simulation. As a result, visibly heavy tails emerge in the generated power probability distribution through the use of the joint model—incorporating a detailed description of the dependence structure—in contrast with the normally distributed power yielded by the margin-based model.

A state space approach for the eigenvalue problem of marine risers

KAUST Repository

Alfosail, Feras

2017-10-05

A numerical state-space approach is proposed to examine the natural frequencies and critical buckling limits of marine risers. A large axial tension in the riser model causes numerical limitations. These limitations are overcome by using the modified Gram–Schmidt orthonormalization process as an intermediate step during the numerical integration process with the fourth-order Runge–Kutta scheme. The obtained results are validated against those obtained with other numerical methods, such as the finite-element, Galerkin, and power-series methods, and are found to be in good agreement. The state-space approach is shown to be computationally more efficient than the other methods. Also, we investigate the effect of a high applied tension, a high apparent weight, and higher-order modes on the accuracy of the numerical scheme. We demonstrate that, by applying the orthonormalization process, the stability and convergence of the approach are significantly improved.

Gamow state vectors as functionals over subspaces of the nuclear space

International Nuclear Information System (INIS)

Bohm, A.

1979-12-01

Exponentially decaying Gamow state vectors are obtained from S-matrix poles in the lower half of the second sheet, and are defined as functionals over a subspace of the nuclear space, PHI. Exponentially growing Gamow state vectors are obtained from S-matrix poles in the upper half of the second sheet, and are defined as functionals over another subspace of PHI. On functionals over these two subspaces the dynamical group of time development splits into two semigroups

Forest Disturbance Mapping Using Dense Synthetic Landsat/MODIS Time-Series and Permutation-Based Disturbance Index Detection

Directory of Open Access Journals (Sweden)

David Frantz

2016-03-01

Full Text Available Spatio-temporal information on process-based forest loss is essential for a wide range of applications. Despite remote sensing being the only feasible means of monitoring forest change at regional or greater scales, there is no retrospectively available remote sensor that meets the demand of monitoring forests with the required spatial detail and guaranteed high temporal frequency. As an alternative, we employed the Spatial and Temporal Adaptive Reflectance Fusion Model (STARFM to produce a dense synthetic time series by fusing Landsat and Moderate Resolution Imaging Spectroradiometer (MODIS nadir Bidirectional Reflectance Distribution Function (BRDF adjusted reflectance. Forest loss was detected by applying a multi-temporal disturbance detection approach implementing a Disturbance Index-based detection strategy. The detection thresholds were permutated with random numbers for the normal distribution in order to generate a multi-dimensional threshold confidence area. As a result, a more robust parameterization and a spatially more coherent detection could be achieved. (i The original Landsat time series; (ii synthetic time series; and a (iii combined hybrid approach were used to identify the timing and extent of disturbances. The identified clearings in the Landsat detection were verified using an annual woodland clearing dataset from Queensland’s Statewide Landcover and Trees Study. Disturbances caused by stand-replacing events were successfully identified. The increased temporal resolution of the synthetic time series indicated promising additional information on disturbance timing. The results of the hybrid detection unified the benefits of both approaches, i.e., the spatial quality and general accuracy of the Landsat detection and the increased temporal information of synthetic time series. Results indicated that a temporal improvement in the detection of the disturbance date could be achieved relative to the irregularly spaced Landsat

Burst suppression probability algorithms: state-space methods for tracking EEG burst suppression

Science.gov (United States)

Chemali, Jessica; Ching, ShiNung; Purdon, Patrick L.; Solt, Ken; Brown, Emery N.

2013-10-01

Objective. Burst suppression is an electroencephalogram pattern in which bursts of electrical activity alternate with an isoelectric state. This pattern is commonly seen in states of severely reduced brain activity such as profound general anesthesia, anoxic brain injuries, hypothermia and certain developmental disorders. Devising accurate, reliable ways to quantify burst suppression is an important clinical and research problem. Although thresholding and segmentation algorithms readily identify burst suppression periods, analysis algorithms require long intervals of data to characterize burst suppression at a given time and provide no framework for statistical inference. Approach. We introduce the concept of the burst suppression probability (BSP) to define the brain's instantaneous propensity of being in the suppressed state. To conduct dynamic analyses of burst suppression we propose a state-space model in which the observation process is a binomial model and the state equation is a Gaussian random walk. We estimate the model using an approximate expectation maximization algorithm and illustrate its application in the analysis of rodent burst suppression recordings under general anesthesia and a patient during induction of controlled hypothermia. Main result. The BSP algorithms track burst suppression on a second-to-second time scale, and make possible formal statistical comparisons of burst suppression at different times. Significance. The state-space approach suggests a principled and informative way to analyze burst suppression that can be used to monitor, and eventually to control, the brain states of patients in the operating room and in the intensive care unit.

State and parameter estimation of state-space model with entry-wise correlated uniform noise

Czech Academy of Sciences Publication Activity Database

Pavelková, Lenka; Kárný, Miroslav

2014-01-01

Roč. 28, č. 11 (2014), s. 1189-1205 ISSN 0890-6327 R&D Projects: GA TA ČR TA01030123; GA ČR GA13-13502S Institutional research plan: CEZ:AV0Z1075907 Keywords : state-space models * bounded noise * filtering problems * estimation algorithms * uncertain dynamic systems Subject RIV: BC - Control Systems Theory Impact factor: 1.346, year: 2014 http://library.utia.cas.cz/separaty/2014/AS/pavelkova-0422958.pdf

Linear discrete-time state space realization of a modified quadruple tank system with state estimation using Kalman filter

DEFF Research Database (Denmark)

Mohd. Azam, Sazuan Nazrah

2017-01-01

In this paper, we used the modified quadruple tank system that represents a multi-input-multi-output (MIMO) system as an example to present the realization of a linear discrete-time state space model and to obtain the state estimation using Kalman filter in a methodical mannered. First, an existing...... part of the Kalman filter is used to estimates the current state, based on the model and the measurements. The static and dynamic Kalman filter is compared and all results is demonstrated through simulations....

Evolved finite state controller for hybrid system in reduced search space

DEFF Research Database (Denmark)

Dupuis, Jean-Francois; Fan, Zhun

2009-01-01

This paper presents an evolutionary methodology to automatically generate finite state automata (FSA) controllers to control hybrid systems. The proposed approach reduces the search space using an invariant analysis of the system. FSA controllers for a case study of two-tank system have been...

Index to Nuclear Safety: a technical progress review by chronology, permuted title, and author. Vol. 11(1)--Vol. 18(6)

Energy Technology Data Exchange (ETDEWEB)

Cottrell, W.B.; Klein, A.

1978-04-11

This index to Nuclear Safety covers articles published in Nuclear Safety, Vol. 11, No. 1 (January-February 1970), through Vol. 18, No. 6 (November-December 1977). It is divided into three sections: a chronological list of articles (including abstracts) followed by a permuted-title (KWIC) index and an author index. Nuclear Safety, a bimonthly technical progress review prepared by the Nuclear Safety Information Center (NSIC), covers all safety aspects of nuclear power reactors and associated facilities. Over 450 technical articles published in Nuclear Safety in the last eight years are listed in this index.

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

Science.gov (United States)

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.

Index to Nuclear Safety: a technical progress review by chronology, permuted title, and author. Vol. 11(1)--Vol. 18(6)

International Nuclear Information System (INIS)

Cottrell, W.B.; Klein, A.

1978-01-01

This index to Nuclear Safety covers articles published in Nuclear Safety, Vol. 11, No. 1 (January-February 1970), through Vol. 18, No. 6 (November-December 1977). It is divided into three sections: a chronological list of articles (including abstracts) followed by a permuted-title (KWIC) index and an author index. Nuclear Safety, a bimonthly technical progress review prepared by the Nuclear Safety Information Center (NSIC), covers all safety aspects of nuclear power reactors and associated facilities. Over 450 technical articles published in Nuclear Safety in the last eight years are listed in this index

A State-Space Estimation of the Lee-Carter Mortality Model and Implications for Annuity Pricing

OpenAIRE

Man Chung Fung; Gareth W. Peters; Pavel V. Shevchenko

2015-01-01

In this article we investigate a state-space representation of the Lee-Carter model which is a benchmark stochastic mortality model for forecasting age-specific death rates. Existing relevant literature focuses mainly on mortality forecasting or pricing of longevity derivatives, while the full implications and methods of using the state-space representation of the Lee-Carter model in pricing retirement income products is yet to be examined. The main contribution of this article is twofold. Fi...

Displaced squeezed number states: Position space representation, inner product, and some applications

DEFF Research Database (Denmark)

Møller, Klaus Braagaard; Jørgensen, Thomas Godsk; Dahl, Jens Peder

1996-01-01

For some applications the overall phase of a quantum state is crucial. For the so-called displaced squeezed number state (DSN), which is a generalization of the well-known squeezed coherent state, we obtain the position space representation with the correct overall phase, from the dynamics...... in a harmonic potential. The importance of the overall phase is demonstrated in the context of characteristic or moment generating functions. For two special cases the characteristic function is shown to be computable from the inner product of two different DSNs....

Robust control of uncertain dynamic systems a linear state space approach

CERN Document Server

Yedavalli, Rama K

2014-01-01

This textbook aims to provide a clear understanding of the various tools of analysis and design for robust stability and performance of uncertain dynamic systems. In model-based control design and analysis, mathematical models can never completely represent the “real world” system that is being modeled, and thus it is imperative to incorporate and accommodate a level of uncertainty into the models. This book directly addresses these issues from a deterministic uncertainty viewpoint and focuses on the interval parameter characterization of uncertain systems. Various tools of analysis and design are presented in a consolidated manner. This volume fills a current gap in published works by explicitly addressing the subject of control of dynamic systems from linear state space framework, namely using a time-domain, matrix-theory based approach. This book also: Presents and formulates the robustness problem in a linear state space model framework Illustrates various systems level methodologies with examples and...

State-space prediction of spring discharge in a karst catchment in southwest China

Science.gov (United States)

Li, Zhenwei; Xu, Xianli; Liu, Meixian; Li, Xuezhang; Zhang, Rongfei; Wang, Kelin; Xu, Chaohao

2017-06-01

Southwest China represents one of the largest continuous karst regions in the world. It is estimated that around 1.7 million people are heavily dependent on water derived from karst springs in southwest China. However, there is a limited amount of water supply in this region. Moreover, there is not enough information on temporal patterns of spring discharge in the area. In this context, it is essential to accurately predict spring discharge, as well as understand karst hydrological processes in a thorough manner, so that water shortages in this area could be predicted and managed efficiently. The objectives of this study were to determine the primary factors that govern spring discharge patterns and to develop a state-space model to predict spring discharge. Spring discharge, precipitation (PT), relative humidity (RD), water temperature (WD), and electrical conductivity (EC) were the variables analyzed in the present work, and they were monitored at two different locations (referred to as karst springs A and B, respectively, in this paper) in a karst catchment area in southwest China from May to November 2015. Results showed that a state-space model using any combinations of variables outperformed a classical linear regression, a back-propagation artificial neural network model, and a least square support vector machine in modeling spring discharge time series for karst spring A. The best state-space model was obtained by using PT and RD, which accounted for 99.9% of the total variation in spring discharge. This model was then applied to an independent data set obtained from karst spring B, and it provided accurate spring discharge estimates. Therefore, state-space modeling was a useful tool for predicting spring discharge in karst regions in southwest China, and this modeling procedure may help researchers to obtain accurate results in other karst regions.

Tunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems

Directory of Open Access Journals (Sweden)

Siddharth Muthukrishnan

2016-07-01

Full Text Available Tunneling is often claimed to be the key mechanism underlying possible speedups in quantum optimization via quantum annealing (QA, especially for problems featuring a cost function with tall and thin barriers. We present and analyze several counterexamples from the class of perturbed Hamming weight optimization problems with qubit permutation symmetry. We first show that, for these problems, the adiabatic dynamics that make tunneling possible should be understood not in terms of the cost function but rather the semiclassical potential arising from the spin-coherent path-integral formalism. We then provide an example where the shape of the barrier in the final cost function is short and wide, which might suggest no quantum advantage for QA, yet where tunneling renders QA superior to simulated annealing in the adiabatic regime. However, the adiabatic dynamics turn out not be optimal. Instead, an evolution involving a sequence of diabatic transitions through many avoided-level crossings, involving no tunneling, is optimal and outperforms adiabatic QA. We show that this phenomenon of speedup by diabatic transitions is not unique to this example, and we provide an example where it provides an exponential speedup over adiabatic QA. In yet another twist, we show that a classical algorithm, spin-vector dynamics, is at least as efficient as diabatic QA. Finally, in a different example with a convex cost function, the diabatic transitions result in a speedup relative to both adiabatic QA with tunneling and classical spin-vector dynamics.

Wigner's dynamical transition state theory in phase space : classical and quantum

NARCIS (Netherlands)

Waalkens, Holger; Schubert, Roman; Wiggins, Stephen

We develop Wigner's approach to a dynamical transition state theory in phase space in both the classical and quantum mechanical settings. The key to our development is the construction of a normal form for describing the dynamics in the neighbourhood of a specific type of saddle point that governs

Quantum scattering theory of a single-photon Fock state in three-dimensional spaces.

Science.gov (United States)

Liu, Jingfeng; Zhou, Ming; Yu, Zongfu

2016-09-15

A quantum scattering theory is developed for Fock states scattered by two-level systems in three-dimensional free space. It is built upon the one-dimensional scattering theory developed in waveguide quantum electrodynamics. The theory fully quantizes the incident light as Fock states and uses a non-perturbative method to calculate the scattering matrix.

Compact state-space models for complex superconducting radio-frequency structures based on model order reduction and concatenation methods

International Nuclear Information System (INIS)

Flisgen, Thomas

2015-01-01

The modeling of large chains of superconducting cavities with couplers is a challenging task in computational electrical engineering. The direct numerical treatment of these structures can easily lead to problems with more than ten million degrees of freedom. Problems of this complexity are typically solved with the help of parallel programs running on supercomputing infrastructures. However, these infrastructures are expensive to purchase, to operate, and to maintain. The aim of this thesis is to introduce and to validate an approach which allows for modeling large structures on a standard workstation. The novel technique is called State-Space Concatenations and is based on the decomposition of the complete structure into individual segments. The radio-frequency properties of the generated segments are described by a set of state-space equations which either emerge from analytical considerations or from numerical discretization schemes. The model order of these equations is reduced using dedicated model order reduction techniques. In a final step, the reduced-order state-space models of the segments are concatenated in accordance with the topology of the complete structure. The concatenation is based on algebraic continuity constraints of electric and magnetic fields on the decomposition planes and results in a compact state-space system of the complete radio-frequency structure. Compared to the original problem, the number of degrees of freedom is drastically reduced, i.e. a problem with more than ten million degrees of freedom can be reduced on a standard workstation to a problem with less than one thousand degrees of freedom. The final state-space system allows for determining frequency-domain transfer functions, field distributions, resonances, and quality factors of the complete structure in a convenient manner. This thesis presents the theory of the state-space concatenation approach and discusses several validation and application examples. The examples

Unitarily localizable entanglement of Gaussian states

International Nuclear Information System (INIS)

Serafini, Alessio; Adesso, Gerardo; Illuminati, Fabrizio

2005-01-01

We consider generic (mxn)-mode bipartitions of continuous-variable systems, and study the associated bisymmetric multimode Gaussian states. They are defined as (m+n)-mode Gaussian states invariant under local mode permutations on the m-mode and n-mode subsystems. We prove that such states are equivalent, under local unitary transformations, to the tensor product of a two-mode state and of m+n-2 uncorrelated single-mode states. The entanglement between the m-mode and the n-mode blocks can then be completely concentrated on a single pair of modes by means of local unitary operations alone. This result allows us to prove that the PPT (positivity of the partial transpose) condition is necessary and sufficient for the separability of (m+n)-mode bisymmetric Gaussian states. We determine exactly their negativity and identify a subset of bisymmetric states whose multimode entanglement of formation can be computed analytically. We consider explicit examples of pure and mixed bisymmetric states and study their entanglement scaling with the number of modes

A state-space model for estimating detailed movements and home range from acoustic receiver data

DEFF Research Database (Denmark)

Pedersen, Martin Wæver; Weng, Kevin

2013-01-01

We present a state-space model for acoustic receiver data to estimate detailed movement and home range of individual fish while accounting for spatial bias. An integral part of the approach is the detection function, which models the probability of logging tag transmissions as a function of dista......We present a state-space model for acoustic receiver data to estimate detailed movement and home range of individual fish while accounting for spatial bias. An integral part of the approach is the detection function, which models the probability of logging tag transmissions as a function...... that the location error scales log-linearly with detection range and movement speed. This result can be used as guideline for designing network layout when species movement capacity and acoustic environment are known or can be estimated prior to network deployment. Finally, as an example, the state-space model...... is used to estimate home range and movement of a reef fish in the Pacific Ocean....

Mapping from Speech to Images Using Continuous State Space Models

DEFF Research Database (Denmark)

Lehn-Schiøler, Tue; Hansen, Lars Kai; Larsen, Jan

2005-01-01

In this paper a system that transforms speech waveforms to animated faces are proposed. The system relies on continuous state space models to perform the mapping, this makes it possible to ensure video with no sudden jumps and allows continuous control of the parameters in 'face space...... a subjective point of view the model is able to construct an image sequence from an unknown noisy speech sequence even though the number of training examples are limited.......'. The performance of the system is critically dependent on the number of hidden variables, with too few variables the model cannot represent data, and with too many overfitting is noticed. Simulations are performed on recordings of 3-5 sec.\\$\\backslash\\$ video sequences with sentences from the Timit database. From...

Deep-inelastic final states in a space-time description of shower development and hadronization

International Nuclear Information System (INIS)

Ellis, J.

1996-06-01

We extend a quantum kinetic approach to the description of hadronic showers in space, time and momentum space to deep-inelastic ep collisions, with particular reference to experiments at HERA. We follow the history of hard scattering events back to the initial hadronic state and forward to the formation of colour-singlet pre-hadronic clusters and their decays into hadrons. The time evolution of the space-like initial-state shower and the time-like secondary partons are treated similarly, and cluster formation is treated using a spatial criterion motivated by confinement and a non-perturbative model for hadronization. We calculate the time evolution of particle distributions in rapidity, transverse and longitudinal space. We also compare the transverse hadronic energy flow and the distribution of observed hadronic masses with experimental data from HERA, finding encouraging results, and discuss the background to large-rapidity-gap events. The techniques developed in this paper may be applied in the future to more complicated processes such as eA, pp, pA and AA collisions. (orig.)

Continuous state-space representation of a bucket-type rainfall-runoff model: a case study with the GR4 model using state-space GR4 (version 1.0)

Science.gov (United States)

Santos, Léonard; Thirel, Guillaume; Perrin, Charles

2018-04-01

In many conceptual rainfall-runoff models, the water balance differential equations are not explicitly formulated. These differential equations are solved sequentially by splitting the equations into terms that can be solved analytically with a technique called operator splitting. As a result, only the solutions of the split equations are used to present the different models. This article provides a methodology to make the governing water balance equations of a bucket-type rainfall-runoff model explicit and to solve them continuously. This is done by setting up a comprehensive state-space representation of the model. By representing it in this way, the operator splitting, which makes the structural analysis of the model more complex, could be removed. In this state-space representation, the lag functions (unit hydrographs), which are frequent in rainfall-runoff models and make the resolution of the representation difficult, are first replaced by a so-called Nash cascade and then solved with a robust numerical integration technique. To illustrate this methodology, the GR4J model is taken as an example. The substitution of the unit hydrographs with a Nash cascade, even if it modifies the model behaviour when solved using operator splitting, does not modify it when the state-space representation is solved using an implicit integration technique. Indeed, the flow time series simulated by the new representation of the model are very similar to those simulated by the classic model. The use of a robust numerical technique that approximates a continuous-time model also improves the lag parameter consistency across time steps and provides a more time-consistent model with time-independent parameters.

Inequities in coverage of smokefree space policies within the United States

Directory of Open Access Journals (Sweden)

Christopher Lowrie

2017-05-01

Full Text Available Abstract Background Previous studies have found extensive geographic and demographic differences in tobacco use. These differences have been found to be reduced by effective public policies, including banning smoking in public spaces. Smokefree indoor and outdoor spaces reduce secondhand smoke exposure and denormalize smoking. Methods We evaluated regional and demographic differences in the proportion of the population covered by smokefree policies enacted in the United States prior to 2014, for both adults and children. Results Significant differences in coverage were found by ethnicity, region, income, and education (p < 0.001. Smokefree policy coverage was lower for jurisdictions with higher proportions of poor households, households with no high school diploma and the Southeast region. Increased ethnic heterogeneity was found to be a significant predictor of coverage in indoor “public spaces generally”, meaning that diversity is protective, with differential effect by region (p = 0.004 – which may relate to urbanicity. Children had a low level of protection in playgrounds and schools (~10% covered nationwide – these spaces were found to be covered at lower rates than indoor spaces. Conclusions Disparities in smokefree space policies have potential to exacerbate existing health inequities. A national increase in smokefree policies to protect children in playgrounds and schools is a crucial intervention to reduce such inequities.

Citizen or Subordinate: Permutations of Belonging in the United States and the Dominican Republic

Directory of Open Access Journals (Sweden)

Shaina Aber

2013-09-01

Full Text Available The Dominican Republic and the United States have both experienced tensions arising from migratory flows from poorer, less stable neighbors. Until recently, both countries had constitutions which conferred citizenship by birth with very limited exceptions. Despite these similarities, their respective discourses around jus soli citizenship, particularly for the children of unauthorized migrants from the poorer neighboring countries, have manifested in different ways. The identity of the United States as a nation of immigrants has limited the success of campaigns to revoke jus soli citizenship for the children of unauthorized immigrants, but the persistent articulation of this idea as a response to illegal migration has shifted the parameters of the immigration debate. In the Dominican Republic, the historical construction of national identity and anti-Haitian discourse has led to an evolution in Dominican law which codifies already established practices that deny citizenship to children of Haitian migrants. In both cases, movements that support more inclusive understandings of societal belonging, like the DREAMers in the United States and youth movements in the Dominican Republic, may offer the most effective way of protecting universal jus soli citizenship regimes. 

Construction of rigged Hilbert spaces to describe resonances and virtual states

International Nuclear Information System (INIS)

Gadella, M.

1983-01-01

In the present communication we present a mathematical formalism for the description of resonances and virtual states. We start by constructing rigged Hilbert spaces of Hardy class functions restricted to the positive half of the real line. Then resonances and virtual states can be written as generalized eigenvectors of the total Hamiltonian. We also define time evolution on functionals. We see that the time evolution group U(t) splits into two semigroups, one for t > 0 and the other for t < 0, hence showing the irreversibility of the decaying process

Construction of rigged Hilbert spaces to describe resonances and virtual states

International Nuclear Information System (INIS)

Gadella, M.

1984-01-01

In the present communication we present a mathematical formalism for the description of resonances and virtual states. We start by constructing rigged Hilbert spaces of Hardy class functions restricted to the positive half of the real line. Then resonances and virtual states can be written as generalized eigenvectors of the total Hamiltonian. We also define time evolution on functionals. We see that the time evolution group U(t) splits into two semigroups, one for t>0 and the other for t<0, hence showing the irreversibility of the decaying process. (orig.)

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

International Nuclear Information System (INIS)

Cottrell, W.B.; Passiakos, M.

1982-06-01

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

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

Energy Technology Data Exchange (ETDEWEB)

Cottrell, W.B.; Passiakos, M.

1982-06-01

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.

Mass textures and wolfenstein parameters from breaking the flavour permutational symmetry

Energy Technology Data Exchange (ETDEWEB)

Mondragon, A; Rivera, T. [Instituto de Fisica, Universidad Nacional Autonoma de Mexico,Mexico D.F. (Mexico); Rodriguez Jauregui, E. [Deutsches Elekronen-Synchrotron, Theory Group, Hamburg (Germany)

2001-12-01

We will give an overview of recent progress in the phenomenological study of quark mass matrices, quark flavour mixings and CP-violation with emphasis on the possibility of an underlying discrete, flavour permutational symmetry and its breaking, from which realistic models of mass generation could be built. The quark mixing angles and CP-violating phase, as well as the Wolfenstein parameters are given in terms of four quark mass ratios and only two parameters (Z{sup 1}/2, {phi}) characterizing the symmetry breaking pattern. Excellent agreement with all current experimental data is found. [Spanish] Daremos una visita panoramica del progreso reciente en el estudio fenomenologico de las matrices de masas y de mezclas del sabor de los quarks y la violacion de PC, con enfasis en la posibilidad de que, subyacentes al problema, se halle una simetria discreta, permutacional del sabor y su rompimiento a partir de las cuales se puedan construir modelos realistas de la generacion de las masas. Los angulos de mezcla de los quarks y la fase que viola CP, asi como los parametros de Wolfenstein se dan en terminos de cuatro razones de masas de los quarks y solamente dos parametros (Z{sup 1}/2, {phi}) que caracterizan el patron del rompimiento de la simetria. Los resultados se encuentran en excelente acuerdo con todos los datos experimentales mas recientes.

Exploiting Stabilizers and Parallelism in State Space Generation with the Symmetry Method

DEFF Research Database (Denmark)

Lorentsen, Louise; Kristensen, Lars Michael

2001-01-01

The symmetry method is a main reduction paradigm for alleviating the state explosion problem. For large symmetry groups deciding whether two states are symmetric becomes time expensive due to the apparent high time complexity of the orbit problem. The contribution of this paper is to alleviate th...... the negative impact of the orbit problem by the specification of canonical representatives for equivalence classes of states in Coloured Petri Nets, and by giving algorithms exploiting stabilizers and parallelism for computing the condensed state space.......The symmetry method is a main reduction paradigm for alleviating the state explosion problem. For large symmetry groups deciding whether two states are symmetric becomes time expensive due to the apparent high time complexity of the orbit problem. The contribution of this paper is to alleviate...

State-space modelling for the ejector-based refrigeration system driven by low grade energy

International Nuclear Information System (INIS)

Xue, Binqiang; Cai, Wenjian; Wang, Xinli

2015-01-01

This paper presents a novel global state-space model to describe the ejector-based refrigeration system, which includes the dynamics of the two heat exchangers and the static properties of ejector, compressor and expansion valve. Different from the existing methods, the proposed method introduces some intermediate variables into the dynamic modelling in developing reduced order models of the heat exchangers (evaporator and condenser) based on the Number of Transfer Units (NTU) method. This global model with fewer dimensions is much simpler and can be more convenient for the real-time control system design, compared with other dynamic models. Finally, the proposed state-space model has been validated by dynamic response experiments on the ejector-based refrigeration cycle with refrigerant R134a.The experimental results indicate that the proposed model can predict well the dynamics of the ejector-based refrigeration system. - Highlights: • A low-order state-space model of ejector-based refrigeration system is presented. • Reduced-order models of heat exchangers are developed based on NTU method. • The variations of mass flow rates are introduced in multiple fluid phase regions. • Experimental results show the proposed model has a good performance

Investigation of multidimensional control systems in the state space and wavelet medium

Science.gov (United States)

Fedosenkov, D. B.; Simikova, A. A.; Fedosenkov, B. A.

2018-05-01

The notions are introduced of “one-dimensional-point” and “multidimensional-point” automatic control systems. To demonstrate the joint use of approaches based on the concepts of state space and wavelet transforms, a method for optimal control in a state space medium represented in the form of time-frequency representations (maps), is considered. The computer-aided control system is formed on the basis of the similarity transformation method, which makes it possible to exclude the use of reduced state variable observers. 1D-material flow signals formed by primary transducers are converted by means of wavelet transformations into multidimensional concentrated-at-a point variables in the form of time-frequency distributions of Cohen’s class. The algorithm for synthesizing a stationary controller for feeding processes is given here. The conclusion is made that the formation of an optimal control law with time-frequency distributions available contributes to the improvement of transient processes quality in feeding subsystems and the mixing unit. Confirming the efficiency of the method presented is illustrated by an example of the current registration of material flows in the multi-feeding unit. The first section in your paper.

Entangled states that cannot reproduce original classical games in their quantum version

International Nuclear Information System (INIS)

Shimamura, Junichi; Oezdemir, S.K.; Morikoshi, Fumiaki; Imoto, Nobuyuki

2004-01-01

A model of a quantum version of classical games should reproduce the original classical games in order to be able to make a comparative analysis of quantum and classical effects. We analyze a class of symmetric multipartite entangled states and their effect on the reproducibility of the classical games. We present the necessary and sufficient condition for the reproducibility of the original classical games. Satisfying this condition means that complete orthogonal bases can be constructed from a given multipartite entangled state provided that each party is restricted to two local unitary operators. We prove that most of the states belonging to the class of symmetric states with respect to permutations, including the N-qubit W state, do not satisfy this condition

Steady-State Calculation of the ATLAS Test Facility Using the SPACE Code

International Nuclear Information System (INIS)

Kim, Hyoung Tae; Choi, Ki Yong; Kim, Kyung Doo

2011-01-01

The Korean nuclear industry is developing a thermalhydraulic analysis code for safety analysis of pressurized water reactors (PWRs). The new code is called the Safety and Performance Analysis Code for Nuclear Power Plants (SPACE). Several research and industrial organizations including KAERI (Korea Atomic Energy Research Institute) are participating in the collaboration for the development of the SPACE code. One of the main tasks of KAERI is to carry out separate effect tests (SET) and integral effect tests (IET) for code verification and validation (V and V). The IET has been performed with ATLAS (Advanced Thermalhydraulic Test Loop for Accident Simulation) based on the design features of the APR1400 (Advanced Power Reactor of 1400MWe). In the present work the SPACE code input-deck for ATLAS is developed and used for simulation of the steady-state conditions of ATLAS as a preliminary work for IET V and V of the SPACE code

Entanglement distillation protocols and number theory

International Nuclear Information System (INIS)

Bombin, H.; Martin-Delgado, M.A.

2005-01-01

We show that the analysis of entanglement distillation protocols for qudits of arbitrary dimension D benefits from applying basic concepts from number theory, since the set Z D n associated with Bell diagonal states is a module rather than a vector space. We find that a partition of Z D n into divisor classes characterizes the invariant properties of mixed Bell diagonal states under local permutations. We construct a very general class of recursion protocols by means of unitary operations implementing these local permutations. We study these distillation protocols depending on whether we use twirling operations in the intermediate steps or not, and we study them both analytically and numerically with Monte Carlo methods. In the absence of twirling operations, we construct extensions of the quantum privacy algorithms valid for secure communications with qudits of any dimension D. When D is a prime number, we show that distillation protocols are optimal both qualitatively and quantitatively

Space Commercialization

Science.gov (United States)

Martin, Gary L.

2011-01-01

A robust and competitive commercial space sector is vital to continued progress in space. The United States is committed to encouraging and facilitating the growth of a U.S. commercial space sector that supports U.S. needs, is globally competitive, and advances U.S. leadership in the generation of new markets and innovation-driven entrepreneurship. Energize competitive domestic industries to participate in global markets and advance the development of: satellite manufacturing; satellite-based services; space launch; terrestrial applications; and increased entrepreneurship. Purchase and use commercial space capabilities and services to the maximum practical extent Actively explore the use of inventive, nontraditional arrangements for acquiring commercial space goods and services to meet United States Government requirements, including measures such as public-private partnerships, . Refrain from conducting United States Government space activities that preclude, discourage, or compete with U.S. commercial space activities. Pursue potential opportunities for transferring routine, operational space functions to the commercial space sector where beneficial and cost-effective.

Fermi states of Bose systems in three space dimensions

International Nuclear Information System (INIS)

Garbaczewski, P.

1985-01-01

Recently an exact spectral solution was constructed by Sudarshan and Tata for the (NTHETA) Fermi version of the Lee model. We demonstrate that it provides a partial solution for the related pure Bose spectral problems. Moreover, the (NTHETA) Bose (Bolsterli--Nelson) version of the Lee model is shown to possess Fermi partners, both exhibiting the partial solubility interplay: finding solutions in the Fermi case would presumably be easier than in the original Bose model. Fermi states of the underlying Bose systems in three space dimensions are explicitly identified

Monitoring the informational efficiency of European corporate bond markets with dynamical permutation min-entropy

Science.gov (United States)

Zunino, Luciano; Bariviera, Aurelio F.; Guercio, M. Belén; Martinez, Lisana B.; Rosso, Osvaldo A.

2016-08-01

In this paper the permutation min-entropy has been implemented to unveil the presence of temporal structures in the daily values of European corporate bond indices from April 2001 to August 2015. More precisely, the informational efficiency evolution of the prices of fifteen sectorial indices has been carefully studied by estimating this information-theory-derived symbolic tool over a sliding time window. Such a dynamical analysis makes possible to obtain relevant conclusions about the effect that the 2008 credit crisis has had on the different European corporate bond sectors. It is found that the informational efficiency of some sectors, namely banks, financial services, insurance, and basic resources, has been strongly reduced due to the financial crisis whereas another set of sectors, integrated by chemicals, automobiles, media, energy, construction, industrial goods & services, technology, and telecommunications has only suffered a transitory loss of efficiency. Last but not least, the food & beverage, healthcare, and utilities sectors show a behavior close to a random walk practically along all the period of analysis, confirming a remarkable immunity against the 2008 financial crisis.

Safe Exploration of State and Action Spaces in Reinforcement Learning

OpenAIRE

Garcia, Javier; Fernandez, Fernando

2014-01-01

In this paper, we consider the important problem of safe exploration in reinforcement learning. While reinforcement learning is well-suited to domains with complex transition dynamics and high-dimensional state-action spaces, an additional challenge is posed by the need for safe and efficient exploration. Traditional exploration techniques are not particularly useful for solving dangerous tasks, where the trial and error process may lead to the selection of actions whose execution in some sta...

Real space renormalization group for spectra and density of states

International Nuclear Information System (INIS)

Wiecko, C.; Roman, E.

1984-09-01

We discuss the implementation of the Real Space Renormalization Group Decimation Technique for 1-d tight-binding models with long range interactions with or without disorder and for the 2-d regular square lattice. The procedure follows the ideas developed by Southern et al. Some new explicit formulae are included. The purpose of this study is to calculate spectra and densities of states following the procedure developed in our previous work. (author)

System Identification of Civil Engineering Structures using State Space and ARMAV Models

DEFF Research Database (Denmark)

Andersen, P.; Kirkegaard, Poul Henning; Brincker, Rune

In this paper the relations between an ambient excited structural system, represented by an innovation state space system, and the Auto-Regressive Moving Average Vector (ARMAV) model are considered. It is shown how to obtain a multivariate estimate of the ARMAV model from output measurements, usi...

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

International Nuclear Information System (INIS)

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

1991-05-01

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

Index to Nuclear Safety: a technical progress review by chrology, permuted title, and author, Volume 11(1) through Volume 20(6)

Energy Technology Data Exchange (ETDEWEB)

Cottrell, W B; Passiakos, M

1980-06-01

This index to Nuclear Safety, a bimonthly technical progress review, covers articles published in Nuclear Safety, Volume II, No. 1 (January-February 1970), through Volume 20, No. 6 (November-December 1979). It is divided into three sections: a chronological list of articles (including abstracts) followed by a permuted-title (KWIC) index and an author index. Nuclear Safety, a bimonthly technical progress review prepared by the Nuclear Safety Information Center (NSIC), covers all safety aspects of nuclear power reactors and associated facilities. Over 600 technical articles published in Nuclear Safety in the last ten years are listed in this index.

Para-bosons and Para-fermions in Quantum Mechanics

International Nuclear Information System (INIS)

Cattani, M.S.D.; Fernandes, N.C.

1982-01-01

Within the framework of the ordinary quantum mechanics, a detailed study of the energy eigenfunctions of N identical particles using the irreducible representations of the permutation group in the Hilbert space is performed. It is shown that the para-states, as occurs with the boson and fermion states, are compatible with the postulates of quantum mechanics and with the principle of indistinguishability. A mathematical support for the existence of para-bosons and para-fermions is given. Gentile's quantum statistics is, in a certain sense, justified. (Author) [pt

Advanced Solid State Lighting for AES Deep Space Hab Project

Science.gov (United States)

Holbert, Eirik

2015-01-01

The advanced Solid State Lighting (SSL) assemblies augmented 2nd generation modules under development for the Advanced Exploration Systems Deep Space Habitat in using color therapy to synchronize crew circadian rhythms. Current RGB LED technology does not produce sufficient brightness to adequately address general lighting in addition to color therapy. The intent is to address both through a mix of white and RGB LEDs designing for fully addressable alertness/relaxation levels as well as more dramatic circadian shifts.

A discrete phase-space calculus for quantum spins based on a reconstruction method using coherent states

International Nuclear Information System (INIS)

Weigert, S.

1999-01-01

To reconstruct a mixed or pure quantum state of a spin s is possible through coherent states: its density matrix is fixed by the probabilities to measure the value s along 4s(s+1) appropriately chosen directions in space. Thus, after inverting the experimental data, the statistical operator is parametrized entirely by expectation values. On this basis, a symbolic calculus for quantum spins is developed, the e xpectation-value representation . It resembles the Moyal representation for SU(2) but two important differences exist. On the one hand, the symbols take values on a discrete set of points in phase space only. On the other hand, no quasi-probabilities - that is, phase-space distributions with negative values - are encountered in this approach. (Author)

Implementation of rigorous renormalization group method for ground space and low-energy states of local Hamiltonians

Science.gov (United States)

Roberts, Brenden; Vidick, Thomas; Motrunich, Olexei I.

2017-12-01

The success of polynomial-time tensor network methods for computing ground states of certain quantum local Hamiltonians has recently been given a sound theoretical basis by Arad et al. [Math. Phys. 356, 65 (2017), 10.1007/s00220-017-2973-z]. The convergence proof, however, relies on "rigorous renormalization group" (RRG) techniques which differ fundamentally from existing algorithms. We introduce a practical adaptation of the RRG procedure which, while no longer theoretically guaranteed to converge, finds matrix product state ansatz approximations to the ground spaces and low-lying excited spectra of local Hamiltonians in realistic situations. In contrast to other schemes, RRG does not utilize variational methods on tensor networks. Rather, it operates on subsets of the system Hilbert space by constructing approximations to the global ground space in a treelike manner. We evaluate the algorithm numerically, finding similar performance to density matrix renormalization group (DMRG) in the case of a gapped nondegenerate Hamiltonian. Even in challenging situations of criticality, large ground-state degeneracy, or long-range entanglement, RRG remains able to identify candidate states having large overlap with ground and low-energy eigenstates, outperforming DMRG in some cases.

Exclusion principle and indistinguishability of identical particles in quantum mechanics

International Nuclear Information System (INIS)

Kaplan, I.G.

1975-01-01

The relation between the Pauli exclusion principle and the principle of indistiguishability of identical particles in quantum mechanics is discussed. Using the density matrix determined for states with random permutational symmetry, it has been shown that the particle indistinguishability takes place only for onedimensional representations of the permutation group whereas in all states which are degenerated over permutations the particles are distinguishable. Thus it has been shown that the exclusion principle follows from that of indistinguishability of identical particles

A robust state-space kinetics-guided framework for dynamic PET image reconstruction

International Nuclear Information System (INIS)

Tong, S; Alessio, A M; Kinahan, P E; Liu, H; Shi, P

2011-01-01

Dynamic PET image reconstruction is a challenging issue due to the low SNR and the large quantity of spatio-temporal data. We propose a robust state-space image reconstruction (SSIR) framework for activity reconstruction in dynamic PET. Unlike statistically-based frame-by-frame methods, tracer kinetic modeling is incorporated to provide physiological guidance for the reconstruction, harnessing the temporal information of the dynamic data. Dynamic reconstruction is formulated in a state-space representation, where a compartmental model describes the kinetic processes in a continuous-time system equation, and the imaging data are expressed in a discrete measurement equation. Tracer activity concentrations are treated as the state variables, and are estimated from the dynamic data. Sampled-data H ∞ filtering is adopted for robust estimation. H ∞ filtering makes no assumptions on the system and measurement statistics, and guarantees bounded estimation error for finite-energy disturbances, leading to robust performance for dynamic data with low SNR and/or errors. This alternative reconstruction approach could help us to deal with unpredictable situations in imaging (e.g. data corruption from failed detector blocks) or inaccurate noise models. Experiments on synthetic phantom and patient PET data are performed to demonstrate feasibility of the SSIR framework, and to explore its potential advantages over frame-by-frame statistical reconstruction approaches.

Identification of a Class of Non-linear State Space Models using RPE Techniques

DEFF Research Database (Denmark)

Zhou, Wei-Wu; Blanke, Mogens

1989-01-01

The RPE (recursive prediction error) method in state-space form is developed in the nonlinear systems and extended to include the exact form of a nonlinearity, thus enabling structure preservation for certain classes of nonlinear systems. Both the discrete and the continuous-discrete versions...... of the algorithm in an innovations model are investigated, and a nonlinear simulation example shows a quite convincing performance of the filter as combined parameter and state estimator...

Modal space three-state feedback control for electro-hydraulic servo plane redundant driving mechanism with eccentric load decoupling.

Science.gov (United States)

Zhao, Jinsong; Wang, Zhipeng; Zhang, Chuanbi; Yang, Chifu; Bai, Wenjie; Zhao, Zining

2018-06-01

The shaking table based on electro-hydraulic servo parallel mechanism has the advantage of strong carrying capacity. However, the strong coupling caused by the eccentric load not only affects the degree of freedom space control precision, but also brings trouble to the system control. A novel decoupling control strategy is proposed, which is based on modal space to solve the coupling problem for parallel mechanism with eccentric load. The phenomenon of strong dynamic coupling among degree of freedom space is described by experiments, and its influence on control design is discussed. Considering the particularity of plane motion, the dynamic model is built by Lagrangian method to avoid complex calculations. The dynamic equations of the coupling physical space are transformed into the dynamic equations of the decoupling modal space by using the weighted orthogonality of the modal main mode with respect to mass matrix and stiffness matrix. In the modal space, the adjustments of the modal channels are independent of each other. Moreover, the paper discusses identical closed-loop dynamic characteristics of modal channels, which will realize decoupling for degree of freedom space, thus a modal space three-state feedback control is proposed to expand the frequency bandwidth of each modal channel for ensuring their near-identical responses in a larger frequency range. Experimental results show that the concept of modal space three-state feedback control proposed in this paper can effectively reduce the strong coupling problem of degree of freedom space channels, which verify the effectiveness of the proposed model space state feedback control strategy for improving the control performance of the electro-hydraulic servo plane redundant driving mechanism. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

On stationary states of electron beams in drift space

International Nuclear Information System (INIS)

Kovalev, N.F.

2002-01-01

The article is devoted to studying the conditions of formation and existence of virtual cathodes. The problem on stationary states of the strongly magnetized electron beams in the homogeneous drift channels is discussed. The problem on the planar and coaxial moduli of the drift spaces is considered. The possibility of existing the virtual cathodes in the coaxial tubular beams by the injection currents, smaller than the threshold ones is highly proved. The inaccuracy of results of a number of works, studying the properties of the virtual cathodes in the strongly magnetized electron beams, is shown [ru

Directional information flow in patients with Alzheimer's disease. A source-space resting-state MEG study.

Science.gov (United States)

Engels, M M A; Yu, M; Stam, C J; Gouw, A A; van der Flier, W M; Scheltens, Ph; van Straaten, E C W; Hillebrand, A

2017-01-01

In a recent magnetoencephalography (MEG) study, we found posterior-to-anterior information flow over the cortex in higher frequency bands in healthy subjects, with a reversed pattern in the theta band. A disruption of information flow may underlie clinical symptoms in Alzheimer's disease (AD). In AD, highly connected regions (hubs) in posterior areas are mostly disrupted. We therefore hypothesized that in AD the information flow from these hub regions would be disturbed. We used resting-state MEG recordings from 27 early-onset AD patients and 26 healthy controls. Using beamformer-based virtual electrodes, we estimated neuronal oscillatory activity for 78 cortical regions of interest (ROIs) and 12 subcortical ROIs of the AAL atlas, and calculated the directed phase transfer entropy (dPTE) as a measure of information flow between these ROIs. Group differences were evaluated using permutation tests and, for the AD group, associations between dPTE and general cognition or CSF biomarkers were determined using Spearman correlation coefficients. We confirmed the previously reported posterior-to-anterior information flow in the higher frequency bands in the healthy controls, and found it to be disturbed in the beta band in AD. Most prominently, the information flow from the precuneus and the visual cortex, towards frontal and subcortical structures, was decreased in AD. These disruptions did not correlate with cognitive impairment or CSF biomarkers. We conclude that AD pathology may affect the flow of information between brain regions, particularly from posterior hub regions, and that changes in the information flow in the beta band indicate an aspect of the pathophysiological process in AD.

State-of-the art of dc components for secondary power distribution of Space Station Freedom

International Nuclear Information System (INIS)

Krauthamer, S.; Gangal, M.; Das, R.

1991-01-01

The National Aeronautics and Space Administration has selected 120-Vdc secondary power distribution for Space Station Freedom. Although this high voltage level is new for space applications, it is well within the bounds for components and subsystems being developed and in some cases being used in aerospace, defense, and terrestrial applications. In this paper state-of-the-art components and subsystems for Space Station Freedom in terms of performance, size, and topology are examined. One objective is to inform the users of Space Station Freedom about what is available in power supplies and power control devices. The other objective is to stimulate the interest in the component industry so that more focused product development can be started. Based on results of this study, it is estimated that, with some redesign, modifications, and space qualification, many of these components may be applied to Space Station Freedom needs

A state-space-based prognostics model for lithium-ion battery degradation

International Nuclear Information System (INIS)

Xu, Xin; Chen, Nan

2017-01-01

This paper proposes to analyze the degradation of lithium-ion batteries with the sequentially observed discharging profiles. A general state-space model is developed in which the observation model is used to approximate the discharging profile of each cycle, the corresponding parameter vector is treated as the hidden state, and the state-transition model is used to track the evolution of the parameter vector as the battery ages. The EM and EKF algorithms are adopted to estimate and update the model parameters and states jointly. Based on this model, we construct prediction on the end of discharge times for unobserved cycles and the remaining useful cycles before the battery failure. The effectiveness of the proposed model is demonstrated using a real lithium-ion battery degradation data set. - Highlights: • Unifying model for Li-Ion battery SOC and SOH estimation. • Extended Kalman filter based efficient inference algorithm. • Using voltage curves in discharging to have wide validity.

Effect of stress-state and spacing on voids in a shear-field

DEFF Research Database (Denmark)

Tvergaard, Viggo

2012-01-01

in the overall average stress state can be prescribed. This also allows for studies of the effect of different initial void spacing in the two in-plane coordinate directions. The stress states considered are essentially simple shear, with various levels of tensile stresses or compressive stresses superposed, i.......e. low positive stress triaxiality or even negative stress triaxiality. For high aspect ratio unit cells a clear localization band is found inside the cell, which actually represents several parallel bands, due to periodicity. In the materials represented by a low aspect ratio unit cell localization...

Nonclassicality of Photon-Added Displaced Thermal State via Quantum Phase-Space Distributions

Science.gov (United States)

Zhang, Ran; Meng, Xiang-Guo; Du, Chuan-Xun; Wang, Ji-Suo

2018-02-01

We introduce a new kind of nonclassical mixed state generated by adding arbitrary photons to a displaced thermal state, i.e., the photon-added displaced thermal state (PADTS), and obtain the normalization factor, which is simply related to two-variable Hermite polynomials. We also discuss the nonclassicality of the PADTS by considering quantum phase-space distributions. The results indicate that the value of the photon count statistics is maximum when the number of detected photons is equal to the number of added photons, and that the photon-added operation has a similar modulation effect with increasing displacement. Moreover, the negative volume of the Wigner function for the PADTS takes a maximal value for a specific photon-added number.

Quantum corrections in thermal states of fermions on anti-de Sitter space-time

Science.gov (United States)

Ambruş, Victor E.; Winstanley, Elizabeth

2017-12-01

We study the energy density and pressure of a relativistic thermal gas of massless fermions on four-dimensional Minkowski and anti-de Sitter space-times using relativistic kinetic theory. The corresponding quantum field theory quantities are given by components of the renormalized expectation value of the stress-energy tensor operator acting on a thermal state. On Minkowski space-time, the renormalized vacuum expectation value of the stress-energy tensor is by definition zero, while on anti-de Sitter space-time the vacuum contribution to this expectation value is in general nonzero. We compare the properties of the vacuum and thermal expectation values of the energy density and pressure for massless fermions and discuss the circumstances in which the thermal contribution dominates over the vacuum one.

Deep-inelastic final states in a space-time description of shower development and hadronization

International Nuclear Information System (INIS)

Ellis, J.; Geiger, K.; Kowalski, H.

1996-01-01

We extend a quantum kinetic approach to the description of hadronic showers in space, time, and momentum space to deep-inelastic ep collisions, with particular reference to experiments at DESY HERA. We follow the history of hard scattering events back to the initial hadronic state and forward to the formation of color-singlet prehadronic clusters and their decays into hadrons. The time evolution of the spacelike initial-state shower and the timelike secondary partons are treated similarly, and cluster formation is treated using a spatial criterion motivated by confinement and a nonperturbative model for hadronization. We calculate the time evolution of particle distributions in rapidity, transverse, and longitudinal space. We also compare the transverse hadronic energy flow and the distribution of observed hadronic masses with experimental data from HERA, finding encouraging results, and discuss the background to large-rapidity-gap events. The techniques developed in this paper may be applied in the future to more complicated processes such as eA, pp, pA, and AA collisions. copyright 1996 The American Physical Society

You Pretty Little Flocker: Exploring the Aesthetic State Space of Creative Ecosystems.

Science.gov (United States)

Eldridge, Alice

2015-01-01

Artificial life models constitute a rich compendium of tools for the generative arts; complex, self-organizing, emergent behaviors have great interactive and generative potential. But how can we go beyond simply visualizing scientific simulations and manipulate these models for use in design and creative art contexts? You Pretty Little Flocker is a proof-of-concept study in expanding and exploring the aesthetic state space of a model for generative design. A modified version of Reynolds' flocking algorithm (1987) is described in which the space of possible images is extended and navigable in a way that at once provides user control and maintains generative autonomy.

State Estimation of International Space Station Centrifuge Rotor With Incomplete Knowledge of Disturbance Inputs

National Research Council Canada - National Science Library

Sullivan, Michael J

2005-01-01

This thesis develops a state estimation algorithm for the Centrifuge Rotor (CR) system where only relative measurements are available with limited knowledge of both rotor imbalance disturbances and International Space Station (ISS...

A latent low-dimensional common input drives a pool of motor neurons: a probabilistic latent state-space model.

Science.gov (United States)

Feeney, Daniel F; Meyer, François G; Noone, Nicholas; Enoka, Roger M

2017-10-01

Motor neurons appear to be activated with a common input signal that modulates the discharge activity of all neurons in the motor nucleus. It has proven difficult for neurophysiologists to quantify the variability in a common input signal, but characterization of such a signal may improve our understanding of how the activation signal varies across motor tasks. Contemporary methods of quantifying the common input to motor neurons rely on compiling discrete action potentials into continuous time series, assuming the motor pool acts as a linear filter, and requiring signals to be of sufficient duration for frequency analysis. We introduce a space-state model in which the discharge activity of motor neurons is modeled as inhomogeneous Poisson processes and propose a method to quantify an abstract latent trajectory that represents the common input received by motor neurons. The approach also approximates the variation in synaptic noise in the common input signal. The model is validated with four data sets: a simulation of 120 motor units, a pair of integrate-and-fire neurons with a Renshaw cell providing inhibitory feedback, the discharge activity of 10 integrate-and-fire neurons, and the discharge times of concurrently active motor units during an isometric voluntary contraction. The simulations revealed that a latent state-space model is able to quantify the trajectory and variability of the common input signal across all four conditions. When compared with the cumulative spike train method of characterizing common input, the state-space approach was more sensitive to the details of the common input current and was less influenced by the duration of the signal. The state-space approach appears to be capable of detecting rather modest changes in common input signals across conditions. NEW & NOTEWORTHY We propose a state-space model that explicitly delineates a common input signal sent to motor neurons and the physiological noise inherent in synaptic signal

Principle of minimum distance in space of states as new principle in quantum physics

International Nuclear Information System (INIS)

Ion, D. B.; Ion, M. L. D.

2007-01-01

The mathematician Leonhard Euler (1707-1783) appears to have been a philosophical optimist having written: 'Since the fabric of universe is the most perfect and is the work of the most wise Creator, nothing whatsoever take place in this universe in which some relation of maximum or minimum does not appear. Wherefore, there is absolutely no doubt that every effect in universe can be explained as satisfactory from final causes themselves the aid of the method of Maxima and Minima, as can from the effective causes'. Having in mind this kind of optimism in the papers mentioned in this work we introduced and investigated the possibility to construct a predictive analytic theory of the elementary particle interaction based on the principle of minimum distance in the space of quantum states (PMD-SQS). So, choosing the partial transition amplitudes as the system variational variables and the distance in the space of the quantum states as a measure of the system effectiveness, we obtained the results presented in this paper. These results proved that the principle of minimum distance in space of quantum states (PMD-SQS) can be chosen as variational principle by which we can find the analytic expressions of the partial transition amplitudes. In this paper we present a description of hadron-hadron scattering via principle of minimum distance PMD-SQS when the distance in space of states is minimized with two directional constraints: dσ/dΩ(±1) = fixed. Then by using the available experimental (pion-nucleon and kaon-nucleon) phase shifts we obtained not only consistent experimental tests of the PMD-SQS optimality, but also strong experimental evidences for new principles in hadronic physics such as: Principle of nonextensivity conjugation via the Riesz-Thorin relation (1/2p + 1/2q = 1) and a new Principle of limited uncertainty in nonextensive quantum physics. The strong experimental evidence obtained here for the nonextensive statistical behavior of the [J, �

Discrete Wigner formalism for qubits and noncontextuality of Clifford gates on qubit stabilizer states

Science.gov (United States)

Kocia, Lucas; Love, Peter

2017-12-01

We show that qubit stabilizer states can be represented by non-negative quasiprobability distributions associated with a Wigner-Weyl-Moyal formalism where Clifford gates are positive state-independent maps. This is accomplished by generalizing the Wigner-Weyl-Moyal formalism to three generators instead of two—producing an exterior, or Grassmann, algebra—which results in Clifford group gates for qubits that act as a permutation on the finite Weyl phase space points naturally associated with stabilizer states. As a result, a non-negative probability distribution can be associated with each stabilizer state's three-generator Wigner function, and these distributions evolve deterministically to one another under Clifford gates. This corresponds to a hidden variable theory that is noncontextual and local for qubit Clifford gates while Clifford (Pauli) measurements have a context-dependent representation. Equivalently, we show that qubit Clifford gates can be expressed as propagators within the three-generator Wigner-Weyl-Moyal formalism whose semiclassical expansion is truncated at order ℏ0 with a finite number of terms. The T gate, which extends the Clifford gate set to one capable of universal quantum computation, requires a semiclassical expansion of the propagator to order ℏ1. We compare this approach to previous quasiprobability descriptions of qubits that relied on the two-generator Wigner-Weyl-Moyal formalism and find that the two-generator Weyl symbols of stabilizer states result in a description of evolution under Clifford gates that is state-dependent, in contrast to the three-generator formalism. We have thus extended Wigner non-negative quasiprobability distributions from the odd d -dimensional case to d =2 qubits, which describe the noncontextuality of Clifford gates and contextuality of Pauli measurements on qubit stabilizer states.

The consciousness state space (CSS)-a unifying model for consciousness and self.

Science.gov (United States)

Berkovich-Ohana, Aviva; Glicksohn, Joseph

2014-01-01

Every experience, those we are aware of and those we are not, is embedded in a subjective timeline, is tinged with emotion, and inevitably evokes a certain sense of self. Here, we present a phenomenological model for consciousness and selfhood which relates time, awareness, and emotion within one framework. The consciousness state space (CSS) model is a theoretical one. It relies on a broad range of literature, hence has high explanatory and integrative strength, and helps in visualizing the relationship between different aspects of experience. Briefly, it is suggested that all phenomenological states fall into two categories of consciousness, core and extended (CC and EC, respectively). CC supports minimal selfhood that is short of temporal extension, its scope being the here and now. EC supports narrative selfhood, which involves personal identity and continuity across time, as well as memory, imagination and conceptual thought. The CSS is a phenomenological space, created by three dimensions: time, awareness and emotion. Each of the three dimensions is shown to have a dual phenomenological composition, falling within CC and EC. The neural spaces supporting each of these dimensions, as well as CC and EC, are laid out based on the neuroscientific literature. The CSS dynamics include two simultaneous trajectories, one in CC and one in EC, typically antagonistic in normal experiences. However, this characteristic behavior is altered in states in which a person experiences an altered sense of self. Two examples are laid out, flow and meditation. The CSS model creates a broad theoretical framework with explanatory and unificatory power. It constructs a detailed map of the consciousness and selfhood phenomenology, which offers constraints for the science of consciousness. We conclude by outlining several testable predictions raised by the CSS model.

A fault diagnosis scheme for planetary gearboxes using adaptive multi-scale morphology filter and modified hierarchical permutation entropy

Science.gov (United States)

Li, Yongbo; Li, Guoyan; Yang, Yuantao; Liang, Xihui; Xu, Minqiang

2018-05-01

The fault diagnosis of planetary gearboxes is crucial to reduce the maintenance costs and economic losses. This paper proposes a novel fault diagnosis method based on adaptive multi-scale morphological filter (AMMF) and modified hierarchical permutation entropy (MHPE) to identify the different health conditions of planetary gearboxes. In this method, AMMF is firstly adopted to remove the fault-unrelated components and enhance the fault characteristics. Second, MHPE is utilized to extract the fault features from the denoised vibration signals. Third, Laplacian score (LS) approach is employed to refine the fault features. In the end, the obtained features are fed into the binary tree support vector machine (BT-SVM) to accomplish the fault pattern identification. The proposed method is numerically and experimentally demonstrated to be able to recognize the different fault categories of planetary gearboxes.

Completeness and orthonormality of the Volkov states and the Volkov propagator in configuration space

Science.gov (United States)

Di Piazza, A.

2018-03-01

Volkov states and Volkov propagator are the basic analytical tools to investigate QED processes occurring in the presence of an intense plane-wave electromagnetic field. In the present paper we provide alternative and relatively simple proofs of the completeness and of the orthonormality at a fixed time of the Volkov states. Concerning the completeness, we exploit some known properties of the Green's function of the Dirac operator in a plane wave, whereas the orthonormality of the Volkov states is proved, relying only on a geometric argument based on the Gauss theorem in four dimensions. In relation with the completeness of the Volkov states, we also study some analytical properties of the Green's function of the Dirac operator in a plane wave, which we explicitly prove to coincide with the Volkov propagator in configuration space. In particular, a closed-form expression in terms of modified Bessel functions and Hankel functions is derived by means of the operator technique in a plane wave and different asymptotic forms are determined. Finally, the transformation properties of the Volkov propagator under general gauge transformations and a general gauge-invariant expression of the so-called dressed mass in configuration space are presented.

Approximate Bayesian Computation by Subset Simulation using hierarchical state-space models

Science.gov (United States)

Vakilzadeh, Majid K.; Huang, Yong; Beck, James L.; Abrahamsson, Thomas

2017-02-01

A new multi-level Markov Chain Monte Carlo algorithm for Approximate Bayesian Computation, ABC-SubSim, has recently appeared that exploits the Subset Simulation method for efficient rare-event simulation. ABC-SubSim adaptively creates a nested decreasing sequence of data-approximating regions in the output space that correspond to increasingly closer approximations of the observed output vector in this output space. At each level, multiple samples of the model parameter vector are generated by a component-wise Metropolis algorithm so that the predicted output corresponding to each parameter value falls in the current data-approximating region. Theoretically, if continued to the limit, the sequence of data-approximating regions would converge on to the observed output vector and the approximate posterior distributions, which are conditional on the data-approximation region, would become exact, but this is not practically feasible. In this paper we study the performance of the ABC-SubSim algorithm for Bayesian updating of the parameters of dynamical systems using a general hierarchical state-space model. We note that the ABC methodology gives an approximate posterior distribution that actually corresponds to an exact posterior where a uniformly distributed combined measurement and modeling error is added. We also note that ABC algorithms have a problem with learning the uncertain error variances in a stochastic state-space model and so we treat them as nuisance parameters and analytically integrate them out of the posterior distribution. In addition, the statistical efficiency of the original ABC-SubSim algorithm is improved by developing a novel strategy to regulate the proposal variance for the component-wise Metropolis algorithm at each level. We demonstrate that Self-regulated ABC-SubSim is well suited for Bayesian system identification by first applying it successfully to model updating of a two degree-of-freedom linear structure for three cases: globally

Characterisation of the Effects of Sleep Deprivation on the Electroencephalogram Using Permutation Lempel–Ziv Complexity, a Non-Linear Analysis Tool

Directory of Open Access Journals (Sweden)

Pinar Deniz Tosun

2017-12-01

Full Text Available Specific patterns of brain activity during sleep and waking are recorded in the electroencephalogram (EEG. Time-frequency analysis methods have been widely used to analyse the EEG and identified characteristic oscillations for each vigilance state (VS, i.e., wakefulness, rapid-eye movement (REM and non-rapid-eye movement (NREM sleep. However, other aspects such as change of patterns associated with brain dynamics may not be captured unless a non-linear-based analysis method is used. In this pilot study, Permutation Lempel–Ziv complexity (PLZC, a novel symbolic dynamics analysis method, was used to characterise the changes in the EEG in sleep and wakefulness during baseline and recovery from sleep deprivation (SD. The results obtained with PLZC were contrasted with a related non-linear method, Lempel–Ziv complexity (LZC. Both measure the emergence of new patterns. However, LZC is dependent on the absolute amplitude of the EEG, while PLZC is only dependent on the relative amplitude due to symbolisation procedure and thus, more resistant to noise. We showed that PLZC discriminates activated brain states associated with wakefulness and REM sleep, which both displayed higher complexity, compared to NREM sleep. Additionally, significantly lower PLZC values were measured in NREM sleep during the recovery period following SD compared to baseline, suggesting a reduced emergence of new activity patterns in the EEG. These findings were validated using PLZC on surrogate data. By contrast, LZC was merely reflecting changes in the spectral composition of the EEG. Overall, this study implies that PLZC is a robust non-linear complexity measure, which is not dependent on amplitude variations in the signal, and which may be useful to further assess EEG alterations induced by environmental or pharmacological manipulations.

Geometric Generalisation of Surrogate Model-Based Optimisation to Combinatorial and Program Spaces

Directory of Open Access Journals (Sweden)

Yong-Hyuk Kim

2014-01-01

Full Text Available Surrogate models (SMs can profitably be employed, often in conjunction with evolutionary algorithms, in optimisation in which it is expensive to test candidate solutions. The spatial intuition behind SMs makes them naturally suited to continuous problems, and the only combinatorial problems that have been previously addressed are those with solutions that can be encoded as integer vectors. We show how radial basis functions can provide a generalised SM for combinatorial problems which have a geometric solution representation, through the conversion of that representation to a different metric space. This approach allows an SM to be cast in a natural way for the problem at hand, without ad hoc adaptation to a specific representation. We test this adaptation process on problems involving binary strings, permutations, and tree-based genetic programs.

A permutation test to analyse systematic bias and random measurement errors of medical devices via boosting location and scale models.

Science.gov (United States)

Mayr, Andreas; Schmid, Matthias; Pfahlberg, Annette; Uter, Wolfgang; Gefeller, Olaf

2017-06-01

Measurement errors of medico-technical devices can be separated into systematic bias and random error. We propose a new method to address both simultaneously via generalized additive models for location, scale and shape (GAMLSS) in combination with permutation tests. More precisely, we extend a recently proposed boosting algorithm for GAMLSS to provide a test procedure to analyse potential device effects on the measurements. We carried out a large-scale simulation study to provide empirical evidence that our method is able to identify possible sources of systematic bias as well as random error under different conditions. Finally, we apply our approach to compare measurements of skin pigmentation from two different devices in an epidemiological study.

A Scalable Permutation Approach Reveals Replication and Preservation Patterns of Network Modules in Large Datasets.

Science.gov (United States)

Ritchie, Scott C; Watts, Stephen; Fearnley, Liam G; Holt, Kathryn E; Abraham, Gad; Inouye, Michael

2016-07-01

Network modules-topologically distinct groups of edges and nodes-that are preserved across datasets can reveal common features of organisms, tissues, cell types, and molecules. Many statistics to identify such modules have been developed, but testing their significance requires heuristics. Here, we demonstrate that current methods for assessing module preservation are systematically biased and produce skewed p values. We introduce NetRep, a rapid and computationally efficient method that uses a permutation approach to score module preservation without assuming data are normally distributed. NetRep produces unbiased p values and can distinguish between true and false positives during multiple hypothesis testing. We use NetRep to quantify preservation of gene coexpression modules across murine brain, liver, adipose, and muscle tissues. Complex patterns of multi-tissue preservation were revealed, including a liver-derived housekeeping module that displayed adipose- and muscle-specific association with body weight. Finally, we demonstrate the broader applicability of NetRep by quantifying preservation of bacterial networks in gut microbiota between men and women. Copyright © 2016 The Author(s). Published by Elsevier Inc. All rights reserved.

State-space representation of instationary two-dimensional airfoil aerodynamics

Energy Technology Data Exchange (ETDEWEB)

Meyer, Marcus; Matthies, Hermann G. [Institute of Scientific Computing, Technical University Braunschweig, Hans-Sommer-Str. 65, Braunschweig 38106 (Germany)

2004-03-01

In the aero-elastic analysis of wind turbines the need to include a model of the local, two-dimensional instationary aerodynamic loads, commonly referred to as dynamic stall model, has become obvious in the last years. In this contribution an alternative choice for such a model is described, based on the DLR model. Its derivation is governed by the flow physics, thus enabling interpolation between different profile geometries. An advantage of the proposed model is its state-space form, i.e. a system of differential equations, which facilitates the important tasks of aeroelastic stability and sensitivity investigations. The model is validated with numerical calculations.

Recursive prediction error methods for online estimation in nonlinear state-space models

Directory of Open Access Journals (Sweden)

Dag Ljungquist

1994-04-01

Full Text Available Several recursive algorithms for online, combined state and parameter estimation in nonlinear state-space models are discussed in this paper. Well-known algorithms such as the extended Kalman filter and alternative formulations of the recursive prediction error method are included, as well as a new method based on a line-search strategy. A comparison of the algorithms illustrates that they are very similar although the differences can be important for the online tracking capabilities and robustness. Simulation experiments on a simple nonlinear process show that the performance under certain conditions can be improved by including a line-search strategy.

Space Threat Warning: Foundation for Space Superiority, Avoiding a Space Pearl Harbor

National Research Council Canada - National Science Library

Burke, Alan W

2006-01-01

... have stated the US must avoid a space Pearl Harbor. This concern is due to the idea that a decrease in the perceived threat to space assets after the demise of the Soviet Union coupled with a competition for space resources has resulted...

Connections on the state-space over conformal field theories

International Nuclear Information System (INIS)

Ranganathan, K.; Sonoda, H.; Zwiebach, B.

1994-01-01

Motivated by the problem of background independence of closed string field theory we study geometry on the infinite vector bundle of local fields over the space of conformal field theories (CFTs). With any connection we can associate an excluded domain D for the integral of marginal operators, and an operator one-form ω μ . The pair (D, ω μ ) determines the covariant derivative of any correlator of local fields. We obtain interesting classes of connections in which ω μ 's can be written in terms of CFT data. For these connections we compute their curvatures in terms of four-point correlators, D, and ω μ . Among these connections three are of particular interest. A flat, metric compatible connection Γ, and connections c and c with non-vanishing curvature, with the latter metric compatible. The flat connection cannot be used to do parallel transport over a finite distance. Parallel transport with either c or c, however, allows us to construct a CFT in the state-space of another CFT a finite distance away. The construction is given in the form of perturbation theory manifestly free of divergences. (orig.)

Wigner's dynamical transition state theory in phase space: classical and quantum

International Nuclear Information System (INIS)

Waalkens, Holger; Schubert, Roman; Wiggins, Stephen

2008-01-01

We develop Wigner's approach to a dynamical transition state theory in phase space in both the classical and quantum mechanical settings. The key to our development is the construction of a normal form for describing the dynamics in the neighbourhood of a specific type of saddle point that governs the evolution from reactants to products in high dimensional systems. In the classical case this is the standard Poincaré–Birkhoff normal form. In the quantum case we develop a normal form based on the Weyl calculus and an explicit algorithm for computing this quantum normal form. The classical normal form allows us to discover and compute the phase space structures that govern classical reaction dynamics. From this knowledge we are able to provide a direct construction of an energy dependent dividing surface in phase space having the properties that trajectories do not locally 're-cross' the surface and the directional flux across the surface is minimal. Using this, we are able to give a formula for the directional flux through the dividing surface that goes beyond the harmonic approximation. We relate this construction to the flux–flux autocorrelation function which is a standard ingredient in the expression for the reaction rate in the chemistry community. We also give a classical mechanical interpretation of the activated complex as a normally hyperbolic invariant manifold (NHIM), and further describe the structure of the NHIM. The quantum normal form provides us with an efficient algorithm to compute quantum reaction rates and we relate this algorithm to the quantum version of the flux–flux autocorrelation function formalism. The significance of the classical phase space structures for the quantum mechanics of reactions is elucidated by studying the phase space distribution of scattering states. The quantum normal form also provides an efficient way of computing Gamov–Siegert resonances. We relate these resonances to the lifetimes of the quantum activated

Determinants of road traffic safety : new evidence from Australia using state-space analysis.

NARCIS (Netherlands)

Nghiem, S. Commandeur, J.J.F. & Connelly, L.B.

2016-01-01

This paper examines the determinants of road traffic crash fatalities in Queensland for the period 1958–2007 using a state-space time-series model. In particular, we investigate the effects of policies that aimed to reduce drink-driving on traffic fatalities, as well as indicators of the economic

Decomposition of gene expression state space trajectories.

Directory of Open Access Journals (Sweden)

Jessica C Mar

2009-12-01

Full Text Available Representing and analyzing complex networks remains a roadblock to creating dynamic network models of biological processes and pathways. The study of cell fate transitions can reveal much about the transcriptional regulatory programs that underlie these phenotypic changes and give rise to the coordinated patterns in expression changes that we observe. The application of gene expression state space trajectories to capture cell fate transitions at the genome-wide level is one approach currently used in the literature. In this paper, we analyze the gene expression dataset of Huang et al. (2005 which follows the differentiation of promyelocytes into neutrophil-like cells in the presence of inducers dimethyl sulfoxide and all-trans retinoic acid. Huang et al. (2005 build on the work of Kauffman (2004 who raised the attractor hypothesis, stating that cells exist in an expression landscape and their expression trajectories converge towards attractive sites in this landscape. We propose an alternative interpretation that explains this convergent behavior by recognizing that there are two types of processes participating in these cell fate transitions-core processes that include the specific differentiation pathways of promyelocytes to neutrophils, and transient processes that capture those pathways and responses specific to the inducer. Using functional enrichment analyses, specific biological examples and an analysis of the trajectories and their core and transient components we provide a validation of our hypothesis using the Huang et al. (2005 dataset.

Modeling and Simulation of DC Power Electronics Systems Using Harmonic State Space (HSS) Method

DEFF Research Database (Denmark)

Kwon, Jun Bum; Wang, Xiongfei; Bak, Claus Leth

2015-01-01

based on the state-space averaging and generalized averaging, these also have limitations to show the same results as with the non-linear time domain simulations. This paper presents a modeling and simulation method for a large dc power electronic system by using Harmonic State Space (HSS) modeling......For the efficiency and simplicity of electric systems, the dc based power electronics systems are widely used in variety applications such as electric vehicles, ships, aircrafts and also in homes. In these systems, there could be a number of dynamic interactions between loads and other dc-dc....... Through this method, the required computation time and CPU memory for large dc power electronics systems can be reduced. Besides, the achieved results show the same results as with the non-linear time domain simulation, but with the faster simulation time which is beneficial in a large network....

Ensemble Kalman Filtering with a Divided State-Space Strategy for Coupled Data Assimilation Problems

KAUST Repository

Luo, Xiaodong

2014-12-01

This study considers the data assimilation problem in coupled systems, which consists of two components (subsystems) interacting with each other through certain coupling terms. A straightforward way to tackle the assimilation problem in such systems is to concatenate the states of the subsystems into one augmented state vector, so that a standard ensemble Kalman filter (EnKF) can be directly applied. This work presents a divided state-space estimation strategy, in which data assimilation is carried out with respect to each individual subsystem, involving quantities from the subsystem itself and correlated quantities from other coupled subsystems. On top of the divided state-space estimation strategy, the authors also consider the possibility of running the subsystems separately. Combining these two ideas, a few variants of the EnKF are derived. The introduction of these variants is mainly inspired by the current status and challenges in coupled data assimilation problems and thus might be of interest from a practical point of view. Numerical experiments with a multiscale Lorenz 96 model are conducted to evaluate the performance of these variants against that of the conventional EnKF. In addition, specific for coupled data assimilation problems, two prototypes of extensions of the presented methods are also developed in order to achieve a trade-offbetween efficiency and accuracy.

Ensemble Kalman Filtering with a Divided State-Space Strategy for Coupled Data Assimilation Problems

KAUST Repository

Luo, Xiaodong; Hoteit, Ibrahim

2014-01-01

This study considers the data assimilation problem in coupled systems, which consists of two components (subsystems) interacting with each other through certain coupling terms. A straightforward way to tackle the assimilation problem in such systems is to concatenate the states of the subsystems into one augmented state vector, so that a standard ensemble Kalman filter (EnKF) can be directly applied. This work presents a divided state-space estimation strategy, in which data assimilation is carried out with respect to each individual subsystem, involving quantities from the subsystem itself and correlated quantities from other coupled subsystems. On top of the divided state-space estimation strategy, the authors also consider the possibility of running the subsystems separately. Combining these two ideas, a few variants of the EnKF are derived. The introduction of these variants is mainly inspired by the current status and challenges in coupled data assimilation problems and thus might be of interest from a practical point of view. Numerical experiments with a multiscale Lorenz 96 model are conducted to evaluate the performance of these variants against that of the conventional EnKF. In addition, specific for coupled data assimilation problems, two prototypes of extensions of the presented methods are also developed in order to achieve a trade-offbetween efficiency and accuracy.

Continuous state-space representation of a bucket-type rainfall-runoff model: a case study with the GR4 model using state-space GR4 (version 1.0

Directory of Open Access Journals (Sweden)

L. Santos

2018-04-01

Full Text Available In many conceptual rainfall–runoff models, the water balance differential equations are not explicitly formulated. These differential equations are solved sequentially by splitting the equations into terms that can be solved analytically with a technique called operator splitting. As a result, only the solutions of the split equations are used to present the different models. This article provides a methodology to make the governing water balance equations of a bucket-type rainfall–runoff model explicit and to solve them continuously. This is done by setting up a comprehensive state-space representation of the model. By representing it in this way, the operator splitting, which makes the structural analysis of the model more complex, could be removed. In this state-space representation, the lag functions (unit hydrographs, which are frequent in rainfall–runoff models and make the resolution of the representation difficult, are first replaced by a so-called Nash cascade and then solved with a robust numerical integration technique. To illustrate this methodology, the GR4J model is taken as an example. The substitution of the unit hydrographs with a Nash cascade, even if it modifies the model behaviour when solved using operator splitting, does not modify it when the state-space representation is solved using an implicit integration technique. Indeed, the flow time series simulated by the new representation of the model are very similar to those simulated by the classic model. The use of a robust numerical technique that approximates a continuous-time model also improves the lag parameter consistency across time steps and provides a more time-consistent model with time-independent parameters.

A hybrid fault diagnosis approach based on mixed-domain state features for rotating machinery.

Science.gov (United States)

Xue, Xiaoming; Zhou, Jianzhong

2017-01-01

To make further improvement in the diagnosis accuracy and efficiency, a mixed-domain state features data based hybrid fault diagnosis approach, which systematically blends both the statistical analysis approach and the artificial intelligence technology, is proposed in this work for rolling element bearings. For simplifying the fault diagnosis problems, the execution of the proposed method is divided into three steps, i.e., fault preliminary detection, fault type recognition and fault degree identification. In the first step, a preliminary judgment about the health status of the equipment can be evaluated by the statistical analysis method based on the permutation entropy theory. If fault exists, the following two processes based on the artificial intelligence approach are performed to further recognize the fault type and then identify the fault degree. For the two subsequent steps, mixed-domain state features containing time-domain, frequency-domain and multi-scale features are extracted to represent the fault peculiarity under different working conditions. As a powerful time-frequency analysis method, the fast EEMD method was employed to obtain multi-scale features. Furthermore, due to the information redundancy and the submergence of original feature space, a novel manifold learning method (modified LGPCA) is introduced to realize the low-dimensional representations for high-dimensional feature space. Finally, two cases with 12 working conditions respectively have been employed to evaluate the performance of the proposed method, where vibration signals were measured from an experimental bench of rolling element bearing. The analysis results showed the effectiveness and the superiority of the proposed method of which the diagnosis thought is more suitable for practical application. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

A d-person Differential Game with State Space Constraints

International Nuclear Information System (INIS)

Ramasubramanian, S.

2007-01-01

We consider a network of d companies (insurance companies, for example) operating under a treaty to diversify risk. Internal and external borrowing are allowed to avert ruin of any member of the network. The amount borrowed to prevent ruin is viewed upon as control. Repayment of these loans entails a control cost in addition to the usual costs. Each company tries to minimize its repayment liability. This leads to a d -person differential game with state space constraints. If the companies are also in possible competition a Nash equilibrium is sought. Otherwise a utopian equilibrium is more appropriate. The corresponding systems of HJB equations and boundary conditions are derived. In the case of Nash equilibrium, the Hamiltonian can be discontinuous; there are d interlinked control problems with state constraints; each value function is a constrained viscosity solution to the appropriate discontinuous HJB equation. Uniqueness does not hold in general in this case. In the case of utopian equilibrium, each value function turns out to be the unique constrained viscosity solution to the appropriate HJB equation. Connection with Skorokhod problem is briefly discussed

Estimation of Unobserved Inflation Expectations in India using State-Space Model

OpenAIRE

Chattopadhyay, Siddhartha; Sahu, Sohini; Jha, Saakshi

2016-01-01

Inflation expectations is an important marker for monetary policy makers. India being a new entrant to the group of countries that pursue inflation targeting as its monetary policy objective, estimating the inflation expectation is of paramount importance. This paper estimates the unobserved inflation expectations in India between 1993:Q1 to 2016:Q1 from the Fisher equation relation using the state space approach (Kalman Filter). We find that our results match well with the inflation forecast...

Quantum limits to information about states for finite dimensional Hilbert space

International Nuclear Information System (INIS)

Jones, K.R.W.

1990-01-01

A refined bound for the correlation information of an N-trial apparatus is developed via an heuristic argument for Hilbert spaces of arbitrary finite dimensionality. Conditional upon the proof of an easily motivated inequality it was possible to find the optimal apparatus for large ensemble quantum Inference, thereby solving the asymptotic optimal state determination problem. In this way an alternative inferential uncertainty principle, is defined which is then contrasted with the usual Heisenberg uncertainty principle. 6 refs

State-space model predictive control method for core power control in pressurized water reactor nuclear power stations

Energy Technology Data Exchange (ETDEWEB)

Wang, Guo Xu; Wu, Jie; Zeng, Bifan; Wu, Wangqiang; Ma, Xiao Qian [School of Electric Power, South China University of Technology, Guangzhou (China); Xu, Zhibin [Electric Power Research Institute of Guangdong Power Grid Corporation, Guangzhou (China)

2017-02-15

A well-performed core power control to track load changes is crucial in pressurized water reactor (PWR) nuclear power stations. It is challenging to keep the core power stable at the desired value within acceptable error bands for the safety demands of the PWR due to the sensitivity of nuclear reactors. In this paper, a state-space model predictive control (MPC) method was applied to the control of the core power. The model for core power control was based on mathematical models of the reactor core, the MPC model, and quadratic programming (QP). The mathematical models of the reactor core were based on neutron dynamic models, thermal hydraulic models, and reactivity models. The MPC model was presented in state-space model form, and QP was introduced for optimization solution under system constraints. Simulations of the proposed state-space MPC control system in PWR were designed for control performance analysis, and the simulation results manifest the effectiveness and the good performance of the proposed control method for core power control.

Space transportation activities in the United States

Science.gov (United States)

Gabris, Edward A.

1994-01-01

The status of the existing space transportation systems in the U.S. and options for increased capability is being examined in the context of mission requirements, options for new vehicles, cost to operate the existing vehicles, cost to develop new vehicles, and the capabilities and plans of other suppliers. This assessment is addressing the need to build and resupply the space station, to maintain necessary military assets in a rapidly changing world, and to continue a competitive commercial space transportation industry. The Department of Defense (DOD) and NASA each conducted an 'access to space' study using a common mission model but with the emphasis on their unique requirements. Both studies considered three options: maintain and improve the existing capability, build a new launch vehicle using contemporary technology, and build a new launch vehicle using advanced technology. While no decisions have been made on a course of action, it will be influenced by the availability of funds in the U.S. budget, the changing need for military space assets, the increasing competition among space launch suppliers, and the emerging opportunity for an advanced technology, low cost system and international partnerships to develop it.

Lightning Fast and Space Efficient Inequality Joins

KAUST Repository

Khayyat, Zuhair

2015-09-01

Inequality joins, which join relational tables on inequality conditions, are used in various applications. While there have been a wide range of optimization methods for joins in database systems, from algorithms such as sort-merge join and band join, to various indices such as B+-tree,R*-tree and Bitmap, inequality joins have received little attention and queries containing such joins are usually very slow. In this paper, we introduce fast inequality join algorithms. We put columns to be joined in sorted arrays and we use permutation arrays to encode positions of tuples in one sorted array w.r.t. the other sorted array. In contrast to sort-merge join, we use space effcient bit-arrays that enable optimizations, such as Bloom filter indices, for fast computation of the join results. We have implemented a centralized version of these algorithms on top of PostgreSQL, and a distributed version on top of Spark SQL. We have compared against well known optimization techniques for inequality joins and show that our solution is more scalable and several orders of magnitude faster.

Lightning fast and space efficient inequality joins

KAUST Repository

Khayyat, Zuhair

2015-09-01

Inequality joins, which join relational tables on inequality conditions, are used in various applications. While there have been a wide range of optimization methods for joins in database systems, from algorithms such as sort-merge join and band join, to various indices such as B+-tree, R*-tree and Bitmap, inequality joins have received little attention and queries containing such joins are usually very slow. In this paper, we introduce fast inequality join algorithms. We put columns to be joined in sorted arrays and we use permutation arrays to encode positions of tuples in one sorted array w.r.t. the other sorted array. In contrast to sort-merge join, we use space efficient bit-arrays that enable optimizations, such as Bloom filter indices, for fast computation of the join results. We have implemented a centralized version of these algorithms on top of PostgreSQL, and a distributed version on top of Spark SQL. We have compared against well known optimization techniques for inequality joins and show that our solution is more scalable and several orders of magnitude faster.

Lightning fast and space efficient inequality joins

KAUST Repository

Khayyat, Zuhair; Lucia, William; Singh, Meghna; Ouzzani, Mourad; Papotti, Paolo; Quiané -Ruiz, Jorge-Arnulfo; Tang, Nan; Kalnis, Panos

2015-01-01

Inequality joins, which join relational tables on inequality conditions, are used in various applications. While there have been a wide range of optimization methods for joins in database systems, from algorithms such as sort-merge join and band join, to various indices such as B+-tree, R*-tree and Bitmap, inequality joins have received little attention and queries containing such joins are usually very slow. In this paper, we introduce fast inequality join algorithms. We put columns to be joined in sorted arrays and we use permutation arrays to encode positions of tuples in one sorted array w.r.t. the other sorted array. In contrast to sort-merge join, we use space efficient bit-arrays that enable optimizations, such as Bloom filter indices, for fast computation of the join results. We have implemented a centralized version of these algorithms on top of PostgreSQL, and a distributed version on top of Spark SQL. We have compared against well known optimization techniques for inequality joins and show that our solution is more scalable and several orders of magnitude faster.

Hybrid state-space time integration of rotating beams

DEFF Research Database (Denmark)

Krenk, Steen; Nielsen, Martin Bjerre

2012-01-01

An efficient time integration algorithm for the dynamic equations of flexible beams in a rotating frame of reference is presented. The equations of motion are formulated in a hybrid state-space format in terms of local displacements and local components of the absolute velocity. With inspiration...... of the system rotation enter via global operations with the angular velocity vector. The algorithm is based on an integrated form of the equations of motion with energy and momentum conserving properties, if a kinematically consistent non-linear formulation is used. A consistent monotonic scheme for algorithmic...... energy dissipation in terms of local displacements and velocities, typical of structural vibrations, is developed and implemented in the form of forward weighting of appropriate mean value terms in the algorithm. The algorithm is implemented for a beam theory with consistent quadratic non...

Validation of ecological state space models using the Laplace approximation

DEFF Research Database (Denmark)

Thygesen, Uffe Høgsbro; Albertsen, Christoffer Moesgaard; Berg, Casper Willestofte

2017-01-01

Many statistical models in ecology follow the state space paradigm. For such models, the important step of model validation rarely receives as much attention as estimation or hypothesis testing, perhaps due to lack of available algorithms and software. Model validation is often based on a naive...... for estimation in general mixed effects models. Implementing one-step predictions in the R package Template Model Builder, we demonstrate that it is possible to perform model validation with little effort, even if the ecological model is multivariate, has non-linear dynamics, and whether observations...... useful directions in which the model could be improved....

The consciousness state space (CSS – a unifying model for consciousness and self

Directory of Open Access Journals (Sweden)

Aviva eBerkovich-Ohana

2014-04-01

Full Text Available Every experience, those we are aware of and those we are not, is embedded in a subjective timeline, is tinged with emotion, and inevitably evokes a certain sense of self. Here, we present a phenomenological model for consciousness and selfhood which relates time, awareness, and emotion within one framework. The consciousness state space (CSS model is a theoretical one. It relies on a broad range of literature, hence has high explanatory and integrative strength, and helps in visualizing the relationship between different aspects of experience.Briefly, it is suggested that all phenomenological states fall into two categories of consciousness, core and extended (CC and EC, respectively. CC supports minimal selfhood that is short of temporal extension, its scope being the here and now. EC supports narrative selfhood, which involves personal identity and continuity across time, as well as memory, imagination and conceptual thought. The CSS is a phenomenological space, created by three dimensions: time, awareness and emotion. Each of the three dimensions is shown to have a dual phenomenological composition, falling within CC and EC. The neural spaces supporting each of these dimensions, as well as CC and EC, are laid out based on the neuroscientific literature.The CSS dynamics includes two simultaneous trajectories, one in CC and one in EC, typically antagonistic in normal experiences. However, this characteristic behavior is altered in states in which a person experiences an altered sense of self. Two examples are laid out, flow and meditation. The CSS model creates a broad theoretical framework with explanatory and unificatory power. It constructs a detailed map of the consciousness and selfhood phenomenology, which offers constraints for the science of consciousness. We conclude by outlaying several testable predictions raised by the CSS model.

Controllability of symmetric spin networks

Science.gov (United States)

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.

PERFORMANCE OPTIMIZATION OF THE DIODE-PUMPED SOLID-STATE LASER FOR SPACE APPLICATIONS

Directory of Open Access Journals (Sweden)

D. A. Arkhipov

2015-11-01

Full Text Available Subject of Research. Thermophysical and optical techniques of parameter regulation for diode pumped solid-state laser are studied as applied to space laser communication and laser ranging lines. Methods. The investigations are carried out on the base of the original design of diode pumped solid-state laser module that includes the following: Nd:YAG slab element, diode pumped by 400W QCW produced by NORTHROP GRUMMAN; two-pass unstable resonator with rotation of the laser beam aperture about its axis through 1800; the output mirror of the resonator with a variable reflection coefficient; hyperthermal conductive plates for thermal stabilization of the laser diode generation modes. The presence of thermal conductive plates excludes conventional running water systems applied as cooling systems for solid-state laser components. The diodes temperature stabilization is achieved by applying the algorithm of pulse-width modulation of power of auxiliary electric heaters. To compensate for non-stationary thermal distortions of the slab refractive index, the laser resonator scheme comprises a prism reflector with an apex angle of 1200. Narrow sides of the prism are covered with reflective coating, and its wide side is sprayed with antireflection coating. The beam aperture is turned around its axis through 1800 because of triple reflection of the beam inside the prism. The turning procedure leads to compensating for the output beam phase distortions in view of symmetric character of the aberrations of slab refractive index. To suppress parasitic oscillations inside the slab, dielectric coatings of wide sides of the slab are used. Main Results. We have demonstrated theoretically and experimentally that the usage of hyperthermal conductive plates together with the algorithm of pulse-width modulation provides stabilizing of the diode substrate temperature accurate within ± 0.1 °С and smoothing the temperature distribution along the plate surface accurate

Algorithms for a parallel implementation of Hidden Markov Models with a small state space

DEFF Research Database (Denmark)

Nielsen, Jesper; Sand, Andreas

2011-01-01

Two of the most important algorithms for Hidden Markov Models are the forward and the Viterbi algorithms. We show how formulating these using linear algebra naturally lends itself to parallelization. Although the obtained algorithms are slow for Hidden Markov Models with large state spaces...

Registration of Space Objects

Science.gov (United States)

Schmidt-Tedd, Bernhard

2017-07-01

Space objects are subject to registration in order to allocate "jurisdiction and control" over those objects in the sovereign-free environment of outer space. This approach is similar to the registration of ships in view of the high sea and for aircrafts with respect to the international airspace. Registration is one of the basic principles of space law, starting with UN General Assembly Resolution 1721 B (XVI) of December 20, 1961, followed by Resolution 1962 (XVIII) of December 13, 1963, then formulated in Article VIII of the Outer Space Treaty of 1967 and as specified in the Registration Convention of 1975. Registration of space objects can be seen today as a principle of customary international law, relevant for each spacefaring state. Registration is divided into a national and an international level. The State Party establishes a national registry for its space objects, and those registrations have to be communicated via diplomatic channel to the UN Register of space objects. This UN Register is handled by the UN Office for Outer Space Affairs (UNOOSA) and is an open source of information for space objects worldwide. Registration is linked to the so-called launching state of the relevant space object. There might be more than one launching state for the specific launch event, but only one state actor can register a specific space object. The state of registry gains "jurisdiction and control" over the space object and therefore no double registration is permissible. Based on the established UN Space Law, registration practice was subject to some adaptions due to technical developments and legal challenges. After the privatization of the major international satellite organizations, a number of non-registrations had to be faced. The state actors reacted with the UN Registration Practice Resolution of 2007 as elaborated in the Legal Subcommittee of UNCOPUOS, the Committee for the Peaceful Use of Outer Space. In this context an UNOOSA Registration Information

Free Vibration Analysis of Fiber Metal Laminate Annular Plate by State-Space Based Differential Quadrature Method

Directory of Open Access Journals (Sweden)

G. H. Rahimi

2014-01-01

Full Text Available A three-dimensional elasticity theory by means of a state-space based differential quadrature method is presented for free vibration analysis of fiber metal laminate annular plate. The kinds of composite material and metal layers are considered to be S2-glass and aluminum, respectively. A semianalytical approach which uses state-space in the thickness and differential quadrature in the radial direction is implemented for evaluating the nondimensional natural frequencies of the annular plates. The influences of changes in boundary condition, plate thickness, and lay-up direction on the natural frequencies are studied. A comparison is also made with the numerical results reported by ABAQUS software which shows an excellent agreement.

A Permutation Importance-Based Feature Selection Method for Short-Term Electricity Load Forecasting Using Random Forest

Directory of Open Access Journals (Sweden)

Nantian Huang

2016-09-01

Full Text Available The prediction accuracy of short-term load forecast (STLF depends on prediction model choice and feature selection result. In this paper, a novel random forest (RF-based feature selection method for STLF is proposed. First, 243 related features were extracted from historical load data and the time information of prediction points to form the original feature set. Subsequently, the original feature set was used to train an RF as the original model. After the training process, the prediction error of the original model on the test set was recorded and the permutation importance (PI value of each feature was obtained. Then, an improved sequential backward search method was used to select the optimal forecasting feature subset based on the PI value of each feature. Finally, the optimal forecasting feature subset was used to train a new RF model as the final prediction model. Experiments showed that the prediction accuracy of RF trained by the optimal forecasting feature subset was higher than that of the original model and comparative models based on support vector regression and artificial neural network.

Permutation Tests of Hierarchical Cluster Analyses of Carrion Communities and Their Potential Use in Forensic Entomology.

Science.gov (United States)

van der Ham, Joris L

2016-05-19

Forensic entomologists can use carrion communities' ecological succession data to estimate the postmortem interval (PMI). Permutation tests of hierarchical cluster analyses of these data provide a conceptual method to estimate part of the PMI, the post-colonization interval (post-CI). This multivariate approach produces a baseline of statistically distinct clusters that reflect changes in the carrion community composition during the decomposition process. Carrion community samples of unknown post-CIs are compared with these baseline clusters to estimate the post-CI. In this short communication, I use data from previously published studies to demonstrate the conceptual feasibility of this multivariate approach. Analyses of these data produce series of significantly distinct clusters, which represent carrion communities during 1- to 20-day periods of the decomposition process. For 33 carrion community samples, collected over an 11-day period, this approach correctly estimated the post-CI within an average range of 3.1 days. © The Authors 2016. Published by Oxford University Press on behalf of Entomological Society of America. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Novel Approach for Lithium-Ion Battery On-Line Remaining Useful Life Prediction Based on Permutation Entropy

Directory of Open Access Journals (Sweden)

Luping Chen

2018-04-01

Full Text Available The degradation of lithium-ion battery often leads to electrical system failure. Battery remaining useful life (RUL prediction can effectively prevent this failure. Battery capacity is usually utilized as health indicator (HI for RUL prediction. However, battery capacity is often estimated on-line and it is difficult to be obtained by monitoring on-line parameters. Therefore, there is a great need to find a simple and on-line prediction method to solve this issue. In this paper, as a novel HI, permutation entropy (PE is extracted from the discharge voltage curve for analyzing battery degradation. Then the similarity between PE and battery capacity are judged by Pearson and Spearman correlation analyses. Experiment results illustrate the effectiveness and excellent similar performance of the novel HI for battery fading indication. Furthermore, we propose a hybrid approach combining Variational mode decomposition (VMD denoising technique, autoregressive integrated moving average (ARIMA, and GM(1,1 models for RUL prediction. Experiment results illustrate the accuracy of the proposed approach for lithium-ion battery on-line RUL prediction.

Infinite-mode squeezed coherent states and non-equilibrium statistical mechanics (phase-space-picture approach)

International Nuclear Information System (INIS)

Yeh, L.

1992-01-01

The phase-space-picture approach to quantum non-equilibrium statistical mechanics via the characteristic function of infinite- mode squeezed coherent states is introduced. We use quantum Brownian motion as an example to show how this approach provides an interesting geometrical interpretation of quantum non-equilibrium phenomena

Equilibrium points of the tilted perfect fluid Bianchi VIh state space

Science.gov (United States)

Apostolopoulos, Pantelis S.

2005-05-01

We present the full set of evolution equations for the spatially homogeneous cosmologies of type VIh filled with a tilted perfect fluid and we provide the corresponding equilibrium points of the resulting dynamical state space. It is found that only when the group parameter satisfies h > -1 a self-similar solution exists. In particular we show that for h > -{1/9} there exists a self-similar equilibrium point provided that γ ∈ ({2(3+sqrt{-h})/5+3sqrt{-h}},{3/2}) whereas for h VIh.

A General State-Space Formulation for Online Scheduling

Directory of Open Access Journals (Sweden)

Dhruv Gupta

2017-11-01

Full Text Available We present a generalized state-space model formulation particularly motivated by an online scheduling perspective, which allows modeling (1 task-delays and unit breakdowns; (2 fractional delays and unit downtimes, when using discrete-time grid; (3 variable batch-sizes; (4 robust scheduling through the use of conservative yield estimates and processing times; (5 feedback on task-yield estimates before the task finishes; (6 task termination during its execution; (7 post-production storage of material in unit; and (8 unit capacity degradation and maintenance. Through these proposed generalizations, we enable a natural way to handle routinely encountered disturbances and a rich set of corresponding counter-decisions. Thereby, greatly simplifying and extending the possible application of mathematical programming based online scheduling solutions to diverse application settings. Finally, we demonstrate the effectiveness of this model on a case study from the field of bio-manufacturing.

Energy-momentum tensor and definition of particle states for Robertson-Walker space-time

International Nuclear Information System (INIS)

Brown, M.R.; Dutton, C.R.

1978-01-01

A new regularization scheme is developed for calculating expectation values of the energy-momentum tensor of a quantized scalar field in Robertson-Walker space-times. Using this regularized stress tensor we consider a definition for the vacuum state of the scalar field on any initial hypersurface. Asymptotic methods are developed to investigate the structure of both the divergent and finite terms of the stress tensor when evaluated in this state. The conformal anomaly is discussed in the context of this model. It does not naturally enter into the analysis and we argue that its inclusion is unnecessary

Summary results of the first United States manned orbital space flight

Science.gov (United States)

Glenn, J. H. Jr

1963-01-01

This paper describes the principal findings of the first United States manned orbital space flight in light of the flight mission. Consideration is given to the coordinated tracking network, recovery forces and to the spacecraft and its several functional systems. These include mechanisms for heat protection, escape maneuvers, spacecraft control, power supply, communications, life support and landing. A few difficulties encountered in the flight and deviations from the planned sequence are described. Craft preparation, aeromedical studies, flight plan and particularly flight observations--including the color, light, horizon visibility by day and by night, cloud formations and sunrise and sunset effects are given in some detail. The general conclusion from the MA-6 flight is that man can adapt well to new conditions encountered in space flight and that man can contribute importantly to mission reliability and toward mission achievement through his capacities to control the spacecraft and its multiple systems contribute to decision making and adaptation of programming as well as to direct exploratory and experimental observations.

Rapid State Space Modeling Tool for Rectangular Wing Aeroservoelastic Studies

Science.gov (United States)

Suh, Peter M.; Conyers, Howard Jason; Mavris, Dimitri N.

2015-01-01

This report introduces a modeling and simulation tool for aeroservoelastic analysis of rectangular wings with trailing-edge control surfaces. The inputs to the code are planform design parameters such as wing span, aspect ratio, and number of control surfaces. Using this information, the generalized forces are computed using the doublet-lattice method. Using Roger's approximation, a rational function approximation is computed. The output, computed in a few seconds, is a state space aeroservoelastic model which can be used for analysis and control design. The tool is fully parameterized with default information so there is little required interaction with the model developer. All parameters can be easily modified if desired. The focus of this report is on tool presentation, verification, and validation. These processes are carried out in stages throughout the report. The rational function approximation is verified against computed generalized forces for a plate model. A model composed of finite element plates is compared to a modal analysis from commercial software and an independently conducted experimental ground vibration test analysis. Aeroservoelastic analysis is the ultimate goal of this tool, therefore, the flutter speed and frequency for a clamped plate are computed using damping-versus-velocity and frequency-versus-velocity analysis. The computational results are compared to a previously published computational analysis and wind-tunnel results for the same structure. A case study of a generic wing model with a single control surface is presented. Verification of the state space model is presented in comparison to damping-versus-velocity and frequency-versus-velocity analysis, including the analysis of the model in response to a 1-cos gust.

Computational fitness landscape for all gene-order permutations of an RNA virus.

Directory of Open Access Journals (Sweden)

Kwang-il Lim

2009-02-01

Full Text Available How does the growth of a virus depend on the linear arrangement of genes in its genome? Answering this question may enhance our basic understanding of virus evolution and advance applications of viruses as live attenuated vaccines, gene-therapy vectors, or anti-tumor therapeutics. We used a mathematical model for vesicular stomatitis virus (VSV, a prototype RNA virus that encodes five genes (N-P-M-G-L, to simulate the intracellular growth of all 120 possible gene-order variants. Simulated yields of virus infection varied by 6,000-fold and were found to be most sensitive to gene-order permutations that increased levels of the L gene transcript or reduced levels of the N gene transcript, the lowest and highest expressed genes of the wild-type virus, respectively. Effects of gene order on virus growth also depended upon the host-cell environment, reflecting different resources for protein synthesis and different cell susceptibilities to infection. Moreover, by computationally deleting intergenic attenuations, which define a key mechanism of transcriptional regulation in VSV, the variation in growth associated with the 120 gene-order variants was drastically narrowed from 6,000- to 20-fold, and many variants produced higher progeny yields than wild-type. These results suggest that regulation by intergenic attenuation preceded or co-evolved with the fixation of the wild type gene order in the evolution of VSV. In summary, our models have begun to reveal how gene functions, gene regulation, and genomic organization of viruses interact with their host environments to define processes of viral growth and evolution.

The Physics of Imaging with Remote Sensors : Photon State Space & Radiative Transfer

Science.gov (United States)

Davis, Anthony B.

2012-01-01

Standard (mono-pixel/steady-source) retrieval methodology is reaching its fundamental limit with access to multi-angle/multi-spectral photo- polarimetry. Next... Two emerging new classes of retrieval algorithm worth nurturing: multi-pixel time-domain Wave-radiometry transition regimes, and more... Cross-fertilization with bio-medical imaging. Physics-based remote sensing: - What is "photon state space?" - What is "radiative transfer?" - Is "the end" in sight? Two wide-open frontiers! center dot Examples (with variations.

United States Changing Demographics - English/Spanish Space Education

Science.gov (United States)

Leon, R.

2002-01-01

Accordingly the United States Census Bureau, the ethnic group adding the largest number of people to the national population is the Hispanic exceeding 12 percent of the population and growing by almost 60 percent between 1990 and 2000. The status of the nation's educational system with respect to Hispanic students is perhaps one of the most influential issues facing the largest economy of the world. The low income, lack of language skills, highest drop-out rate in the nation, are some of the reasons why Hispanics are less likely to receive a university degree than any other ethical group. In short, the government requires to implement compensatory programs and bilingual education to ensure global leadership. Because of ongoing immigration, Spanish persists longer among Hispanics than it did among other immigrant groups. Spanish is the fourth most spoken language in the world after Mandarin, Hindustani and English. Although not all U.S. Hispanics speak Spanish, almost all U.S. Spanish speakers are Hispanics. This paper is intended to outline the challenging implementation of a bilingual education project affiliated to NASA Johnson Space Center encouraging greater academic success of Hispanics in engineering, math and science. The prospective project covers the overall role of space activities in the development of science and technology, socioeconomic issues and international cooperation. An existent JSC project is the starting stage to keep on developing an interactive video teleconference and web-media technology and produce stimulating learning products in English and Spanish for students and teachers across the nation and around the world.

Necessary and sufficient conditions for non-perturbative equivalences of large Nc orbifold gauge theories

International Nuclear Information System (INIS)

Kovtun, Pave; Uensal, Mithat; Yaffe, Laurence G.

2005-01-01

Large N coherent state methods are used to study the relation between U(N c ) gauge theories containing adjoint representation matter fields and their orbifold projections. The classical dynamical systems which reproduce the large N c limits of the quantum dynamics in parent and daughter orbifold theories are compared. We demonstrate that the large N c dynamics of the parent theory, restricted to the subspace invariant under the orbifold projection symmetry, and the large N c dynamics of the daughter theory, restricted to the untwisted sector invariant under 'theory space' permutations, coincide. This implies equality, in the large N c limit, between appropriately identified connected correlation functions in parent and daughter theories, provided the orbifold projection symmetry is not spontaneously broken in the parent theory and the theory space permutation symmetry is not spontaneously broken in the daughter. The necessity of these symmetry realization conditions for the validity of the large N c equivalence is unsurprising, but demonstrating the sufficiency of these conditions is new. This work extends an earlier proof of non-perturbative large N c equivalence which was only valid in the phase of the (lattice regularized) theories continuously connected to large mass and strong coupling

T-dualization of type II superstring theory in double space

Energy Technology Data Exchange (ETDEWEB)

Nikolic, B.; Sazdovic, B. [University of Belgrade, Institute of Physics Belgrade, Belgrade (Serbia)

2017-03-15

In this article we offer a new interpretation of the T-dualization procedure of type II superstring theory in the double space framework. We use the ghost free action of type II superstring in pure spinor formulation in approximation of constant background fields up to the quadratic terms. T-dualization along any subset of the initial coordinates, x{sup a}, is equivalent to the permutation of this subset with subset of the corresponding T-dual coordinates, y{sub a}, in double space coordinate Z{sup M} = (x{sup μ}, y{sub μ}). Requiring that the T-dual transformation law after the exchange x{sup a} <-> y{sub a} has the same form as the initial one, we obtain the T-dual NS-NS and NS-R background fields. The T-dual R-R field strength is determined up to one arbitrary constant under some assumptions. The compatibility between supersymmetry and T-duality produces a change of bar spinors and R-R field strength. If we dualize an odd number of dimensions x{sup a}, such a change flips type IIA/B to type II B/A. If we T-dualize the time-like direction, one imaginary unit i maps type II superstring theories to type II{sup *} ones. (orig.)

Radiation Environment at LEO in the frame of Space Monitoring Data Center at Moscow State University - recent, current and future missions

Science.gov (United States)

Myagkova, Irina; Kalegaev, Vladimir; Panasyuk, Mikhail; Svertilov, Sergey; Bogomolov, Vitaly; Bogomolov, Andrey; Barinova, Vera; Barinov, Oleg; Bobrovnikov, Sergey; Dolenko, Sergey; Mukhametdinova, Ludmila; Shiroky, Vladimir; Shugay, Julia

2016-04-01

Radiation Environment of Near-Earth space is one of the most important factors of space weather. Space Monitoring Data Center of Moscow State University provides operational control of radiation conditions at Low Earth's Orbits (LEO) of the near-Earth space using data of recent (Vernov, CORONAS series), current (Meteor-M, Electro-L series) and future (Lomonosov) space missions. Internet portal of Space Monitoring Data Center of Skobeltsyn Institute of Nuclear Physics of Lomonosov Moscow State University (SINP MSU) http://swx.sinp.msu.ru/ provides possibilities to control and analyze the space radiation conditions in the real time mode together with the geomagnetic and solar activity including hard X-ray and gamma- emission of solar flares. Operational data obtained from space missions at L1, GEO and LEO and from the Earth's magnetic stations are used to represent radiation and geomagnetic state of near-Earth environment. The models of space environment that use space measurements from different orbits were created. Interactive analysis and operational neural network forecast services are based on these models. These systems can automatically generate alerts on particle fluxes enhancements above the threshold values, both for SEP and relativistic electrons of outer Earth's radiation belt using data from GEO and LEO as input. As an example of LEO data we consider data from Vernov mission, which was launched into solar-synchronous orbit (altitude 640 - 83 0 km, inclination 98.4°, orbital period about 100 min) on July 8, 2014 and began to receive scientific information since July 20, 2014. Vernov mission have provided studies of the Earth's radiation belt relativistic electron precipitation and its possible connection with atmosphere transient luminous events, as well as the solar hard X-ray and gamma-emission measurements. Radiation and electromagnetic environment monitoring in the near-Earth Space, which is very important for space weather study, was also realised

Independence of automorphism group, center, and state space of quantum logics

International Nuclear Information System (INIS)

Navara, M.

1992-01-01

We prove that quantum logics (-orthomodular posets) admit full independence of the attributes important within the foundations of quantum mechanics. Namely, we present the construction of quantum logics with given sublogics (=physical subsystems), automorphism groups, centers (=open-quotes classical partsclose quotes of the systems), and state spaces. Thus, all these open-quotes parametersclose quotes are independent. Our result is rooted in the line of investigation carried out by Greechie; Kallus and Trnkova; Kalmbach; and Navara and Ptak; and considerably enriches the known algebraic methods in orthomodular posets. 19 refs., 1 fig

The politics of space - Who owns what? Earth law for space

Science.gov (United States)

Hosenball, S. N.

1983-01-01

Topics of concern in developing space law, i.e., international disagreements, the present status of space law, and requirements for future space activities, are discussed. Factors inhibiting agreements include governments that wish to control specific regions of GEO, the refusal of several countries to permit international DBS television broadcasts over their boundaries, the possibility that weapons may be placed in space, and the lack of international laws governing humans and industries in space. It is noted that any state entering an international agreement has relinquished some of its sovereignty. The Outer Space Treaty has removed celestial bodies from claims of national appropriation. States retain sovereignty over their citizens who travel in space, a problematical concept once internationally-manned settlements in space or on the moon are established. It is recommended that space law develop mainly in reaction to the implementation of new space capabilities in order to avoid hindering space activities.

A trajectory planning scheme for spacecraft in the space station environment. M.S. Thesis - University of California

Science.gov (United States)

Soller, Jeffrey Alan; Grunwald, Arthur J.; Ellis, Stephen R.

1991-01-01

Simulated annealing is used to solve a minimum fuel trajectory problem in the space station environment. The environment is special because the space station will define a multivehicle environment in space. The optimization surface is a complex nonlinear function of the initial conditions of the chase and target crafts. Small permutations in the input conditions can result in abrupt changes to the optimization surface. Since no prior knowledge about the number or location of local minima on the surface is available, the optimization must be capable of functioning on a multimodal surface. It was reported in the literature that the simulated annealing algorithm is more effective on such surfaces than descent techniques using random starting points. The simulated annealing optimization was found to be capable of identifying a minimum fuel, two-burn trajectory subject to four constraints which are integrated into the optimization using a barrier method. The computations required to solve the optimization are fast enough that missions could be planned on board the space station. Potential applications for on board planning of missions are numerous. Future research topics may include optimal planning of multi-waypoint maneuvers using a knowledge base to guide the optimization, and a study aimed at developing robust annealing schedules for potential on board missions.

SPONGENT: The Design Space of Lightweight Cryptographic Hashing

DEFF Research Database (Denmark)

Bogdanov, Andrey; Knezevic, Miroslav; Leander, Gregor

2013-01-01

construction instantiated with present-type permutations. The resulting family of hash functions is called spongent. We propose 13 spongent variants--or different levels of collision and (second) preimage resistance as well as for various implementation constraints. For each of them, we provide several ASIC...