Permutation orbifolds of heterotic Gepner models
Maio, M
2011-01-01
We study orbifolds by permutations of two identical N=2 minimal models within the Gepner construction of four dimensional heterotic strings. This is done using the new N=2 supersymmetric permutation orbifold building blocks we have recently developed. We compare our results with the old method of modding out the full string partition function. The overlap between these two approaches is surprisingly small, but whenever a comparison can be made we find complete agreement. The use of permutation building blocks allows us to use the complete arsenal of simple current techniques that is available for standard Gepner models, vastly extending what could previously be done for permutation orbifolds. In particular, we consider (0,2) models, breaking of SO(10) to subgroups, weight-lifting for the minimal models and B-L lifting. Some previously observed phenomena, for example concerning family number quantization, extend to this new class as well, and in the lifted models three family models occur with abundance compar...
Permutation orbifolds of heterotic Gepner models
Energy Technology Data Exchange (ETDEWEB)
Maio, M., E-mail: michelem@nikhef.n [Nikhef Theory Group, Amsterdam (Netherlands); Schellekens, A.N. [Nikhef Theory Group, Amsterdam (Netherlands); IMAPP, Radboud Universiteit Nijmegen (Netherlands); Instituto de Fisica Fundamental, CSIC, Madrid (Spain)
2011-07-21
We study orbifolds by permutations of two identical N=2 minimal models within the Gepner construction of four-dimensional heterotic strings. This is done using the new N=2 supersymmetric permutation orbifold building blocks we have recently developed. We compare our results with the old method of modding out the full string partition function. The overlap between these two approaches is surprisingly small, but whenever a comparison can be made we find complete agreement. The use of permutation building blocks allows us to use the complete arsenal of simple current techniques that is available for standard Gepner models, vastly extending what could previously be done for permutation orbifolds. In particular, we consider (0,2) models, breaking of SO(10) to subgroups, weight-lifting for the minimal models and B-L lifting. Some previously observed phenomena, for example concerning family number quantization, extend to this new class as well, and in the lifted models three-family models occur with abundance comparable to two or four.
Permutation statistical methods an integrated approach
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 ...
Permutation Matrix Method for Dense Coding Using GHZ States
Institute of Scientific and Technical Information of China (English)
JIN Rui-Bo; CHEN Li-Bing; WANG Fa-Qiang; SU Zhi-Kun
2008-01-01
We present a new method called the permutation matrix method to perform dense coding using Greenberger-Horne-Zeilinger (GHZ) states. We show that this method makes the study of dense coding systematically and regularly. It also has high potential to be realized physically.
Permutation Complexity and Coupling Measures in Hidden Markov Models
Directory of Open Access Journals (Sweden)
Taichi Haruna
2013-09-01
Full Text Available Recently, the duality between values (words and orderings (permutations has been proposed by the authors as a basis to discuss the relationship between information theoretic measures for finite-alphabet stationary stochastic processes and their permutatio nanalogues. It has been used to give a simple proof of the equality between the entropy rate and the permutation entropy rate for any finite-alphabet stationary stochastic process and to show some results on the excess entropy and the transfer entropy for finite-alphabet stationary ergodic Markov processes. In this paper, we extend our previous results to hidden Markov models and show the equalities between various information theoretic complexity and coupling measures and their permutation analogues. In particular, we show the following two results within the realm of hidden Markov models with ergodic internal processes: the two permutation analogues of the transfer entropy, the symbolic transfer entropy and the transfer entropy on rank vectors, are both equivalent to the transfer entropy if they are considered as the rates, and the directed information theory can be captured by the permutation entropy approach.
A chronicle of permutation statistical methods 1920–2000, and beyond
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...
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...
Recchia, Gabriel; Sahlgren, Magnus; Kanerva, Pentti; Jones, Michael N
2015-01-01
Circular convolution and random permutation have each been proposed as neurally plausible binding operators capable of encoding sequential information in semantic memory. We perform several controlled comparisons of circular convolution and random permutation as means of encoding paired associates as well as encoding sequential information. Random permutations outperformed convolution with respect to the number of paired associates that can be reliably stored in a single memory trace. Performance was equal on semantic tasks when using a small corpus, but random permutations were ultimately capable of achieving superior performance due to their higher scalability to large corpora. Finally, "noisy" permutations in which units are mapped to other units arbitrarily (no one-to-one mapping) perform nearly as well as true permutations. These findings increase the neurological plausibility of random permutations and highlight their utility in vector space models of semantics.
Directory of Open Access Journals (Sweden)
Gabriel Recchia
2015-01-01
Full Text Available Circular convolution and random permutation have each been proposed as neurally plausible binding operators capable of encoding sequential information in semantic memory. We perform several controlled comparisons of circular convolution and random permutation as means of encoding paired associates as well as encoding sequential information. Random permutations outperformed convolution with respect to the number of paired associates that can be reliably stored in a single memory trace. Performance was equal on semantic tasks when using a small corpus, but random permutations were ultimately capable of achieving superior performance due to their higher scalability to large corpora. Finally, “noisy” permutations in which units are mapped to other units arbitrarily (no one-to-one mapping perform nearly as well as true permutations. These findings increase the neurological plausibility of random permutations and highlight their utility in vector space models of semantics.
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...... of such experiments is whether the observed redundancy gains can be explained by parallel processing of the two stimuli in a race-like fashion. To test the parallel processing model, Miller derived the well-known race model inequality which has become a routine test for behavioral data in experiments with redundant...... of the test is reasonable even for small samples. The scripts discussed in this article may be downloaded as supplemental materials from http://brm.psychonomic-journals.org/content/supplemental....
A permutation test for the race model inequality
DEFF Research Database (Denmark)
Gondan, Matthias
2010-01-01
When participants are asked to respond in the same way to several stimulus identities, responses are often observed to be faster if two stimuli are presented simultaneously as opposed to when a single stimulus is presented (redundant signals effect; Miller, 1982). An important issue...... of such experiments is whether the observed redundancy gains can be explained by parallel processing of the two stimuli in a race-like fashion. To test the parallel processing model, Miller derived the well-known race model inequality which has become a routine test for behavioral data in experiments with redundant...... 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...
Inferential permutation tests for maximum entropy models in ecology.
Shipley, Bill
2010-09-01
Maximum entropy (maxent) models assign probabilities to states that (1) agree with measured macroscopic constraints on attributes of the states and (2) are otherwise maximally uninformative and are thus as close as possible to a specified prior distribution. Such models have recently become popular in ecology, but classical inferential statistical tests require assumptions of independence during the allocation of entities to states that are rarely fulfilled in ecology. This paper describes a new permutation test for such maxent models that is appropriate for very general prior distributions and for cases in which many states have zero abundance and that can be used to test for conditional relevance of subsets of constraints. Simulations show that the test gives correct probability estimates under the null hypothesis. Power under the alternative hypothesis depends primarily on the number and strength of the constraints and on the number of states in the model; the number of empty states has only a small effect on power. The test is illustrated using two empirical data sets to test the community assembly model of B. Shipley, D. Vile, and E. Garnier and the species abundance distribution models of S. Pueyo, F. He, and T. Zillio.
On permutation symmetries of hopfield model neural network
Directory of Open Access Journals (Sweden)
Jiyang Dong
2001-01-01
Full Text Available Discrete Hopfield neural network (DHNN is studied by performing permutation operations on the synaptic weight matrix. The storable patterns set stored with Hebbian learning algorithm in a network without losing memories is studied, and a condition which makes sure all the patterns of the storable patterns set have a same basin size of attraction is proposed. Then, the permutation symmetries of the network are studied associating with the stored patterns set. A construction of the storable patterns set satisfying that condition is achieved by consideration of their invariance under a point group.
Linear algebra of the permutation invariant Crow-Kimura model of prebiotic evolution.
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.
Novel algorithm for complex bit reversal: employing vector permutation and branch reduction methods
Institute of Scientific and Technical Information of China (English)
Feng YU; Ze-ke WANG; Rui-feng GE
2009-01-01
We present novel vector permutation and branch reduction methods to minimize the number of execution cycles for bit reversal algorithms. The new methods are applied to single instruction multiple data (SIMD) parallel implementation of complex data floating-point fast Fourier transform (FFT). The number of operational clock cycles can be reduced by an average factor of 3.5 by using our vector permutation methods and by 1.1 by using our branch reduction methods, compared with conventional implementations. Experiments on MPC7448 (a well-known SIMD reduced instruction set computing processor) demonstrate that our optimal bit-reversal algorithm consistently takes fewer than two cycles per element in complex array operations.
Bona, Miklos
2004-01-01
WINNER of a CHOICE Outstanding Academic Title Award for 2006!As linear orders, as elements of the symmetric group, modeled by matrices, modeled by graphs…permutations are omnipresent in modern combinatorics. They are omnipresent but also multifaceted, and while several excellent books explore particular aspects of the subject, no one book has covered them all. Even the classic results are scattered in various resources.Combinatorics of Permutations offers the first comprehensive, up to date treatment of both enumerative and extremal combinatorics and looks at permutation as linear orders and a
Itoh, Satoru G; Okumura, Hisashi
2013-11-05
We propose the Hamiltonian replica-permutation method (RPM) (or multidimensional RPM) for molecular dynamics and Monte Carlo simulations, in which parameters in the Hamiltonian are permuted among more than two replicas with the Suwa-Todo algorithm. We apply the Coulomb RPM, which is one of realization of the Hamiltonian RPM, to an alanine dipeptide and to two amyloid-β(29-42) molecules. The Hamiltonian RPM realizes more efficient sampling than the Hamiltonian replica-exchange method. We illustrate the protein misfolding funnel of amyloid-β(29-42) and reveal its dimerization pathways.
Pan, Yi; Haber, Michael; Gao, Jingjing; Barnhart, Huiman X
2012-09-10
The coefficient of individual equivalence is a permutation-based measure of agreement between two observers making replicated readings on each subject. It compares the observed disagreement between the observers to the expected disagreement under individual equivalence. Individual equivalence of observers requires that for every study subject, the conditional distributions of the readings of the observers given the subject's characteristics are identical. Therefore, under individual equivalence it does not matter which observer is making a particular reading on a given subject. We introduce both nonparametric and parametric methods to estimate the coefficient as well as its standard error. We compare the new coefficient with the coefficient of individual agreement and with the concordance correlation coefficient. We also evaluate the performance of the estimates of the new coefficient via simulations and illustrate this new approach using data from a study comparing two noninvasive techniques for measuring carotid stenosis to an invasive gold standard.
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.
Bántay, 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 Lambda-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.
Directory of Open Access Journals (Sweden)
Mahdi Bashiri
2014-04-01
Full Text Available In decision making when multiple criteria are determined, the best choice depends on having complete information and proper decision-making technique. The permutation method is one of the popular techniques used in the context of multiple criteria decision making (MCDM. In this paper, a method is presented where there is more than one vector of weights for the criteria and there are uncertainties associated with criteria weights or there are multiple decision makers. We first take different weight vectors to create a multi-objective problem and then we solve them simultaneously to achieve appropriate Pareto solutions of the permutation method. Therefore, MOPSO and NSGA-II algorithms are utilized to find non-dominated solutions. Some examples in different sizes are considered to compare the efficiency of the proposed methods. Results show that by increasing the number of options and considering the computational time, the proposed methods perform better compared with the exact method. Moreover, NSGA-II is more efficient than MOPSO for the considered problem.
Directory of Open Access Journals (Sweden)
Francisco O. Redelico
2017-02-01
Full Text Available In this contribution, a comparison between different permutation entropies as classifiers of electroencephalogram (EEG records corresponding to normal and pre-ictal states is made. A discrete probability distribution function derived from symbolization techniques applied to the EEG signal is used to calculate the Tsallis entropy, Shannon Entropy, Renyi Entropy, and Min Entropy, and they are used separately as the only independent variable in a logistic regression model in order to evaluate its capacity as a classification variable in a inferential manner. The area under the Receiver Operating Characteristic (ROC curve, along with the accuracy, sensitivity, and specificity are used to compare the models. All the permutation entropies are excellent classifiers, with an accuracy greater than 94.5% in every case, and a sensitivity greater than 97%. Accounting for the amplitude in the symbolization technique retains more information of the signal than its counterparts, and it could be a good candidate for automatic classification of EEG signals.
Directory of Open Access Journals (Sweden)
Bryan R Conroy
Full Text Available Multivariate decoding models are increasingly being applied to functional magnetic imaging (fMRI data to interpret the distributed neural activity in the human brain. These models are typically formulated to optimize an objective function that maximizes decoding accuracy. For decoding models trained on full-brain data, this can result in multiple models that yield the same classification accuracy, though some may be more reproducible than others--i.e. small changes to the training set may result in very different voxels being selected. This issue of reproducibility can be partially controlled by regularizing the decoding model. Regularization, along with the cross-validation used to estimate decoding accuracy, typically requires retraining many (often on the order of thousands of related decoding models. In this paper we describe an approach that uses a combination of bootstrapping and permutation testing to construct both a measure of cross-validated prediction accuracy and model reproducibility of the learned brain maps. This requires re-training our classification method on many re-sampled versions of the fMRI data. Given the size of fMRI datasets, this is normally a time-consuming process. Our approach leverages an algorithm called fast simultaneous training of generalized linear models (FaSTGLZ to create a family of classifiers in the space of accuracy vs. reproducibility. The convex hull of this family of classifiers can be used to identify a subset of Pareto optimal classifiers, with a single-optimal classifier selectable based on the relative cost of accuracy vs. reproducibility. We demonstrate our approach using full-brain analysis of elastic-net classifiers trained to discriminate stimulus type in an auditory and visual oddball event-related fMRI design. Our approach and results argue for a computational approach to fMRI decoding models in which the value of the interpretation of the decoding model ultimately depends upon optimizing a
Permutation methods for the structured exploratory data analysis (SEDA) of familial trait values.
Karlin, S; Williams, P T
1984-07-01
A collection of functions that contrast familial trait values between and across generations is proposed for studying transmission effects and other collateral influences in nuclear families. Two classes of structured exploratory data analysis (SEDA) statistics are derived from ratios of these functions. SEDA-functionals are the empirical cumulative distributions of the ratio of the two contrasts computed within each family. SEDA-indices are formed by first averaging the numerator and denominator contrasts separately over the population and then forming their ratio. The significance of SEDA results are determined by a spectrum of permutation techniques that selectively shuffle the trait values across families. The process systematically alters certain family structure relationships while keeping other familial relationships intact. The methodology is applied to five data examples of plasma total cholesterol concentrations, reported height values, dermatoglyphic pattern intensity index scores, measurements of dopamine-beta-hydroxylase activity, and psychometric cognitive test results.
Permutationally invariant state reconstruction
Moroder, Tobias; Toth, Geza; Schwemmer, Christian; Niggebaum, Alexander; Gaile, Stefanie; Gühne, Otfried; Weinfurter, Harald
2012-01-01
Feasible tomography schemes for large particle numbers must possess, besides an appropriate data acquisition protocol, also an efficient way to reconstruct the density operator from the observed finite data set. Since state reconstruction typically requires the solution of a non-linear large-scale optimization problem, this is a major challenge in the design of scalable tomography schemes. Here we present an efficient state reconstruction scheme for permutationally invariant quantum state tomography. It works for all common state-of-the-art reconstruction principles, including, in particular, maximum likelihood and least squares methods, which are the preferred choices in today's experiments. This high efficiency is achieved by greatly reducing the dimensionality of the problem employing a particular representation of permutationally invariant states known from spin coupling combined with convex optimization, which has clear advantages regarding speed, control and accuracy in comparison to commonly employed n...
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...
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.
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.
Parimutuel Betting on Permutations
Agrawal, Shipra; Ye, Yinyu
2008-01-01
We focus on a permutation betting market under parimutuel call auction model where traders bet on the final ranking of n candidates. We present a Proportional Betting mechanism for this market. Our mechanism allows the traders to bet on any subset of the n x n 'candidate-rank' pairs, and rewards them proportionally to the number of pairs that appear in the final outcome. We show that market organizer's decision problem for this mechanism can be formulated as a convex program of polynomial size. More importantly, the formulation yields a set of n x n unique marginal prices that are sufficient to price the bets in this mechanism, and are computable in polynomial-time. The marginal prices reflect the traders' beliefs about the marginal distributions over outcomes. We also propose techniques to compute the joint distribution over n! permutations from these marginal distributions. We show that using a maximum entropy criterion, we can obtain a concise parametric form (with only n x n parameters) for the joint dist...
Permutation Complexity in Dynamical Systems
Amigo, Jose
2010-01-01
The study of permutation complexity can be envisioned as a new kind of symbolic dynamics whose basic blocks are ordinal patterns, that is, permutations defined by the order relations among points in the orbits of dynamical systems. Since its inception in 2002 the concept of permutation entropy has sparked a new branch of research in particular regarding the time series analysis of dynamical systems that capitalizes on the order structure of the state space. Indeed, on one hand ordinal patterns and periodic points are closely related, yet ordinal patterns are amenable to numerical methods, while periodicity is not. Another interesting feature is that since it can be shown that random (unconstrained) dynamics has no forbidden patterns with probability one, their existence can be used as a fingerprint to identify any deterministic origin of orbit generation. This book is primarily addressed to researchers working in the field of nonlinear dynamics and complex systems, yet will also be suitable for graduate stude...
Permutations and the combinatorics of gauge invariants for general N
Ramgoolam, Sanjaye
2016-01-01
Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their correlators. These methods are also applicable to tensor models and have revealed a link between tensor models and the counting of branched covers. The key idea is to parametrize $U(N)$ gauge invariants using permutations, subject to equivalences. Correlators are related to group theoretic properties of these equivalence classes. Fourier transformation on symmetric groups by means of representation theory offers nice bases of functions on these equivalence classes. This has applications in AdS/CFT in identifying CFT duals of giant gravitons and their perturbations. It has also lead to general results on quiver gauge theory correlators, uncovering links to two dimensional topological field theory and the combinatorics of trace monoids.
Permutationally invariant state reconstruction
DEFF Research Database (Denmark)
Moroder, Tobias; Hyllus, Philipp; Tóth, Géza;
2012-01-01
Feasible tomography schemes for large particle numbers must possess, besides an appropriate data acquisition protocol, an efficient way to reconstruct the density operator from the observed finite data set. Since state reconstruction typically requires the solution of a nonlinear large-scale opti......Feasible tomography schemes for large particle numbers must possess, besides an appropriate data acquisition protocol, an efficient way to reconstruct the density operator from the observed finite data set. Since state reconstruction typically requires the solution of a nonlinear large...... likelihood and least squares methods, which are the preferred choices in today's experiments. This high efficiency is achieved by greatly reducing the dimensionality of the problem employing a particular representation of permutationally invariant states known from spin coupling combined with convex...
Demonstration of quantum permutation algorithm with a single photon ququart.
Wang, Feiran; Wang, Yunlong; Liu, Ruifeng; Chen, Dongxu; Zhang, Pei; Gao, Hong; Li, Fuli
2015-06-05
We report an experiment to demonstrate a quantum permutation determining algorithm with linear optical system. By employing photon's polarization and spatial mode, we realize the quantum ququart states and all the essential permutation transformations. The quantum permutation determining algorithm displays the speedup of quantum algorithm by determining the parity of the permutation in only one step of evaluation compared with two for classical algorithm. This experiment is accomplished in single photon level and the method exhibits universality in high-dimensional quantum computation.
Energy Technology Data Exchange (ETDEWEB)
Li, Rui, E-mail: lirui1401@bjtu.edu.cn; Wang, Jun
2016-01-08
A financial price model is developed based on the voter interacting system in this work. The Lempel–Ziv complexity is introduced to analyze the complex behaviors of the stock market. Some stock market stylized facts including fat tails, absence of autocorrelation and volatility clustering are investigated for the proposed price model firstly. Then the complexity of fluctuation behaviors of the real stock markets and the proposed price model are mainly explored by Lempel–Ziv complexity (LZC) analysis and multi-scale weighted-permutation entropy (MWPE) analysis. A series of LZC analyses of the returns and the absolute returns of daily closing prices and moving average prices are performed. Moreover, the complexity of the returns, the absolute returns and their corresponding intrinsic mode functions (IMFs) derived from the empirical mode decomposition (EMD) with MWPE is also investigated. The numerical empirical study shows similar statistical and complex behaviors between the proposed price model and the real stock markets, which exhibits that the proposed model is feasible to some extent. - Highlights: • A financial price dynamical model is developed based on the voter interacting system. • Lempel–Ziv complexity is the firstly applied to investigate the stock market dynamics system. • MWPE is employed to explore the complexity fluctuation behaviors of the stock market. • Empirical results show the feasibility of the proposed financial model.
Li, Rui; Wang, Jun
2016-01-01
A financial price model is developed based on the voter interacting system in this work. The Lempel-Ziv complexity is introduced to analyze the complex behaviors of the stock market. Some stock market stylized facts including fat tails, absence of autocorrelation and volatility clustering are investigated for the proposed price model firstly. Then the complexity of fluctuation behaviors of the real stock markets and the proposed price model are mainly explored by Lempel-Ziv complexity (LZC) analysis and multi-scale weighted-permutation entropy (MWPE) analysis. A series of LZC analyses of the returns and the absolute returns of daily closing prices and moving average prices are performed. Moreover, the complexity of the returns, the absolute returns and their corresponding intrinsic mode functions (IMFs) derived from the empirical mode decomposition (EMD) with MWPE is also investigated. The numerical empirical study shows similar statistical and complex behaviors between the proposed price model and the real stock markets, which exhibits that the proposed model is feasible to some extent.
Permutation orbifolds and holography
Haehl, Felix M
2014-01-01
Two dimensional conformal field theories with large central charge and a sparse low-lying spectrum are expected to admit a classical string holographic dual. We construct a large class of such theories employing permutation orbifold technology. In particular, we describe the group theoretic constraints on permutation groups to ensure a (stringy) holographic CFT. The primary result we uncover is that in order for the degeneracy of states to be finite in the large central charge limit, the groups of interest are the so-called oligomorphic permutation groups. Further requiring that the low-lying spectrum be sparse enough puts a bound on the number of orbits of these groups (on finite element subsets). Along the way we also study familiar cyclic and symmetric orbifolds to build intuition. We also demonstrate how holographic spectral properties are tied to the geometry of covering spaces for permutation orbifolds.
Maps, immersions and permutations
Coquereaux, Robert
2015-01-01
We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere (spherical curves), extending results by Arnold and followers. Different options where the circle and/or the sphere are/is oriented are considered in turn, following Arnold's classification of the different types of symmetries. We also consider the case of bicolourable and bicoloured maps or immersions, where faces are bicoloured. Our method extends to immersions of a circle in a higher genus Riemann surface. There the bicolourability is no longer automatic and has to be assumed. We thus have two separate countings in non zero genus, that of bicolourable maps and that of general maps. We use a classical method of encoding maps in terms of permutations, on which the constraints of "one-componentness" and of a given genus may be applied. Depending on the orientation issue and on...
An empirical study using permutation-based resampling in meta-regression
Directory of Open Access Journals (Sweden)
Gagnier Joel J
2012-02-01
Full Text Available Abstract Background In meta-regression, as the number of trials in the analyses decreases, the risk of false positives or false negatives increases. This is partly due to the assumption of normality that may not hold in small samples. Creation of a distribution from the observed trials using permutation methods to calculate P values may allow for less spurious findings. Permutation has not been empirically tested in meta-regression. The objective of this study was to perform an empirical investigation to explore the differences in results for meta-analyses on a small number of trials using standard large sample approaches verses permutation-based methods for meta-regression. Methods We isolated a sample of randomized controlled clinical trials (RCTs for interventions that have a small number of trials (herbal medicine trials. Trials were then grouped by herbal species and condition and assessed for methodological quality using the Jadad scale, and data were extracted for each outcome. Finally, we performed meta-analyses on the primary outcome of each group of trials and meta-regression for methodological quality subgroups within each meta-analysis. We used large sample methods and permutation methods in our meta-regression modeling. We then compared final models and final P values between methods. Results We collected 110 trials across 5 intervention/outcome pairings and 5 to 10 trials per covariate. When applying large sample methods and permutation-based methods in our backwards stepwise regression the covariates in the final models were identical in all cases. The P values for the covariates in the final model were larger in 78% (7/9 of the cases for permutation and identical for 22% (2/9 of the cases. Conclusions We present empirical evidence that permutation-based resampling may not change final models when using backwards stepwise regression, but may increase P values in meta-regression of multiple covariates for relatively small amount of
Permutations and quantum entanglement
Energy Technology Data Exchange (ETDEWEB)
Chruscinski, D; Kossakowski, A [Institute of Physics, Nicolaus Copernicus University, Grudziadzka 5/7, 87-100 Torun (Poland)], E-mail: darch@fizyka.umk.pl, E-mail: kossak@fizyka.umk.pl
2008-03-01
We construct a large class of quantum dxd states which are positive under partial transposition (so called PPT states). The construction is based on certain direct sum decomposition of the total Hilbert space which is governed by by cyclic permutation from the symmetric group S{sub d-i}. It turns out that partial transposition maps any such decomposition into another one corresponding to 'complementary' permutation. This class contains many well known examples of PPT states from the literature and gives rise to a huge family of completely new states.
Permutations and quantum entanglement
Chruściński, D.; Kossakowski, A.
2008-03-01
We construct a large class of quantum dotimesd states which are positive under partial transposition (so called PPT states). The construction is based on certain direct sum decomposition of the total Hilbert space which is governed by by cyclic permutation from the symmetric group Sd-i. It turns out that partial transposition maps any such decomposition into another one corresponding to 'complementary' permutation. This class contains many well known examples of PPT states from the literature and gives rise to a huge family of completely new states.
Multi-Objective Simulating Annealing for Permutation Flow Shop Problems
Mokotoff, E.; Pérez, J.
2007-09-01
Real life scheduling problems require more than one criterion. Nevertheless, the complex nature of the Permutation Flow Shop problem has prevented the development of models with multiple criteria. Considering only one regular criterion, this scheduling problem was shown to be NP-complete. The Multi-Objective Simulated Annealing (MOSA) methods are metaheuristics based on Simulated Annealing to solve Multi-Objective Combinatorial Optimization (MOCO) problems, like the problem at hand. Starting from the general MOSA method introduced by Loukil et al. [1], we developed MOSA models to provide the decision maker with efficient solutions for the Permutation Flow Shop problem (common in the production of ceramic tiles). In this paper we present three models: two bicriteria models and one based on satisfaction levels for the main criterion.
On the tensor Permutation Matrices
Rakotonirina, Christian
2011-01-01
A property that tensor permutation matrices permutate tensor product of rectangle matrices is shown. Some examples, in the particular case of tensor commutation matrices, for studying some linear matricial equations are given.
Patterns in Permutations and Words
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
Permutation and Its Partial Transpose
Zhang, Y; Werner, R F; Zhang, Yong; Kauffman, Louis H.; Werner, Reinhard F.
2006-01-01
Permutation and its partial transpose play important roles in quantum information theory. The Werner state is recognized as a rational solution of the Yang--Baxter equation, and the isotropic state with an adjustable parameter is found to form a braid representation. The set of permutation's partial transposes is an algebra called the "PPT" algebra which guides the construction of multipartite symmetric states. The virtual knot theory having permutation as a virtual crossing provides a topological language describing quantum computation having permutation as a swap gate. In this paper, permutation's partial transpose is identified with an idempotent of the Temperley--Lieb algebra. The algebra generated by permutation and its partial transpose is found to be the Brauer algebra. The linear combinations of identity, permutation and its partial transpose can form various projectors describing tangles; braid representations; virtual braid representations underlying common solutions of the braid relation and Yang--...
Gray Code for Cayley Permutations
Directory of Open Access Journals (Sweden)
J.-L. Baril
2003-10-01
Full Text Available A length-n Cayley permutation p of a total ordered set S is a length-n sequence of elements from S, subject to the condition that if an element x appears in p then all elements y < x also appear in p . In this paper, we give a Gray code list for the set of length-n Cayley permutations. Two successive permutations in this list differ at most in two positions.
A Representation of Permutations with Full Cycle
Cesmelioglu, Ayca
2010-01-01
For q > 2, Carlitz proved that the group of permutation polynomials (PPs) over F_q is generated by linear polynomials and x^{q-2}. Based on this result, this note points out a simple method for representing all PPs with full cycle over the prime field F_p, where p is an odd prime. We use the isomorphism between the symmetric group S_p of p elements and the group of PPs over F_p, and the well-known fact that permutations in S_p have the same cycle structure if and only if they are conjugate.
Efficient Encoding of Watermark Numbers as Reducible Permutation Graphs
Chroni, Maria
2011-01-01
In a software watermarking environment, several graph theoretic watermark methods use numbers as watermark values, where some of these methods encode the watermark numbers as graph structures. In this paper we extended the class of error correcting graphs by proposing an efficient and easily implemented codec system for encoding watermark numbers as reducible permutation flow-graphs. More precisely, we first present an efficient algorithm which encodes a watermark number $w$ as self-inverting permutation $\\pi^*$ and, then, an algorithm which encodes the self-inverting permutation $\\pi^*$ as a reducible permutation flow-graph $F[\\pi^*]$ by exploiting domination relations on the elements of $\\pi^*$ and using an efficient DAG representation of $\\pi^*$. The whole encoding process takes O(n) time and space, where $n$ is the binary size of the number $w$ or, equivalently, the number of elements of the permutation $\\pi^*$. We also propose efficient decoding algorithms which extract the number $w$ from the reducible ...
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.
Tetrachoric Correlation: A Permutation Alternative
Long, Michael A.; Berry, Kenneth J.; Mielke, Paul W., Jr.
2009-01-01
An exact permutation test is provided for the tetrachoric correlation coefficient. Comparisons with the conventional test employing Student's t distribution demonstrate the necessity of using the permutation approach for small sample sizes and/or disproportionate marginal frequency totals. (Contains 4 tables.)
Visual recognition of permuted words
Rashid, Sheikh Faisal; Shafait, Faisal; Breuel, Thomas M.
2010-02-01
In current study we examine how letter permutation affects in visual recognition of words for two orthographically dissimilar languages, Urdu and German. We present the hypothesis that recognition or reading of permuted and non-permuted words are two distinct mental level processes, and that people use different strategies in handling permuted words as compared to normal words. A comparison between reading behavior of people in these languages is also presented. We present our study in context of dual route theories of reading and it is observed that the dual-route theory is consistent with explanation of our hypothesis of distinction in underlying cognitive behavior for reading permuted and non-permuted words. We conducted three experiments in lexical decision tasks to analyze how reading is degraded or affected by letter permutation. We performed analysis of variance (ANOVA), distribution free rank test, and t-test to determine the significance differences in response time latencies for two classes of data. Results showed that the recognition accuracy for permuted words is decreased 31% in case of Urdu and 11% in case of German language. We also found a considerable difference in reading behavior for cursive and alphabetic languages and it is observed that reading of Urdu is comparatively slower than reading of German due to characteristics of cursive script.
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.
Jiang, Bin; Guo, Hua
2014-07-01
The permutation invariant polynomial-neural network (PIP-NN) method for constructing highly accurate potential energy surfaces (PESs) for gas phase molecules is extended to molecule-surface interaction PESs. The symmetry adaptation in the NN fitting of a PES is achieved by employing as the input symmetry functions that fulfill both the translational symmetry of the surface and permutation symmetry of the molecule. These symmetry functions are low-order PIPs of the primitive symmetry functions containing the surface periodic symmetry. It is stressed that permutationally invariant cross terms are needed to avoid oversymmetrization. The accuracy and efficiency are demonstrated in fitting both a model PES for the H2 + Cu(111) system and density functional theory points for the H2 + Ag(111) system.
Directory of Open Access Journals (Sweden)
Satyaki Roy
2012-07-01
Full Text Available In the present paper a new combined cryptographic method called Modified UES Version-I has been introduced. Nath et al. have already developed several symmetric key methods. It combines three different methods namely, Generalized Modified Vernam Cipher method, Permutation method and Columnar Transposition method. Nath et al recently developed few efficient combined encryption methods such as TTJSA, DJMNA where they have used generalized MSA method, NJJSAA method and DJSA methods. Each of the methods can be applied independently to encrypt any message. Nath et. al showed that TTJSA and DJMNA is most suitable methods to encrypt password or any small message. The name of this method is Ultra Encryption Standard modified (UES version-I since it is based on UES version-I developed by Roy et. al. In this method an encryption key pad in Vernam Cipher Method also the feedback has been used which is considered to make the encryption process stronger. Modified UES Version-I may be applied to encrypt data in any office, corporate sectors etc. The method is most suitable to encrypt any type of file such as text, audio, video, image and databases etc
Hardware Index to Permutation Converter
2012-05-01
latency to be n−1. Note that, after the first codeword emerges, a codeword emerges at each clock period. C. Results A Verilog program was written to...by the Verilog code executes significantly faster on the SRC-6 than the C code on the microprocessor. For example, for 10-element permutations, the... Verilog code, each permutation was represented by a single word. Here, each word has nlog2(n) bits, which is 36 for n = 9, for example. Although a
Permutation Analysis of Track and Column Braiding
Institute of Scientific and Technical Information of China (English)
李毓陵; 丁辛; 胡良剑
2004-01-01
The positions of braiding carrier in track and column braiding are represented by a diagrammatic braiding plan and a corresponding lattice-array is defined. A set is then formed so that the permutation analysis can be performed to represent the movement of carriers in a braiding process. The process of 4-step braiding is analyzed as an example to describe the application of the proposed method by expressing a braiding cycle as a product of disjoint cycles. As a result, a mapping relation between the disjoint cycles and the movement of carriers is deduced. Following the same analysis principles, a process of 8-step braiding and the corresponding initial state of the lattice-array is developed. A successful permutation analysis to the process manifests the general suitability of the proposed method.
Dowek, Gilles
2011-01-01
Permissive-Nominal Logic (PNL) extends first-order predicate logic with term-formers that can bind names in their arguments. It takes a semantics in (permissive-)nominal sets. In PNL, the forall-quantifier or lambda-binder are just term-formers satisfying axioms, and their denotation is functions on nominal atoms-abstraction. Then we have higher-order logic (HOL) and its models in ordinary (i.e. Zermelo-Fraenkel) sets; the denotation of forall or lambda is functions on full or partial function spaces. This raises the following question: how are these two models of binding connected? What translation is possible between PNL and HOL, and between nominal sets and functions? We exhibit a translation of PNL into HOL, and from models of PNL to certain models of HOL. It is natural, but also partial: we translate a restricted subsystem of full PNL to HOL. The extra part which does not translate is the symmetry properties of nominal sets with respect to permutations. To use a little nominal jargon: we can translate na...
Coding and Decoding Method for Periodic Permutation Color Structured Light%周期组合颜色结构光编解码方法
Institute of Scientific and Technical Information of China (English)
秦绪佳; 马吉跃; 张勤锋; 郑红波; 徐晓刚
2014-01-01
A periodic permutation color structured light coding and decoding method is presented.The method use red,green and blue three primary colors as the encoding stripe pattern,and make any adjacent three color stripes as a group.So the stripe's order is unique.Then use white stripes to mark the periodic color stripe patterns to distinguish different coding groups.This method can achieve a larger coding space with less colors,increase the noise immunity and make the decoding easier.In order to accurately decode,an adaptive color stripes segmentation method based on improved Canny edge-detection operator is presented.It includes two aspects:(1) sequentially decoding the color stripes based on the white stripes; (2) omitted color stripes decoding.Experimental results show that the method has a large coding periodic space,and can extract stripes easily.It can also ensure the accuracy of the stripes decoding,and achieve a good coding and decoding result.%提出一种周期组合颜色编解码方法.采用红、绿、蓝三种基本色形成彩色条纹,将任意相邻三条彩色条纹作为一组,其排列顺序是唯一的,再利用白色条纹来标记周期编号,该编码方法用较少的颜色数实现了较大的编码空间,增加了抗干扰性,且解码较容易.为精确解码,本文对彩色条纹分割进行了研究,提出基于改进Canny边缘检测算子的自适应彩色条纹分割算法.在此基础之上,对彩色条纹进行解码,主要包括:①基于白色条纹逐级解码算法;②遗漏彩色条纹解码算法.实验结果表明,该方法既具有较大的编码周期,又容易提取条纹,保证了条纹解码的准确度,达到了较好的结果.
Image encryption using a synchronous permutation-diffusion technique
Enayatifar, Rasul; Abdullah, Abdul Hanan; Isnin, Ismail Fauzi; Altameem, Ayman; Lee, Malrey
2017-03-01
In the past decade, the interest on digital images security has been increased among scientists. A synchronous permutation and diffusion technique is designed in order to protect gray-level image content while sending it through internet. To implement the proposed method, two-dimensional plain-image is converted to one dimension. Afterward, in order to reduce the sending process time, permutation and diffusion steps for any pixel are performed in the same time. The permutation step uses chaotic map and deoxyribonucleic acid (DNA) to permute a pixel, while diffusion employs DNA sequence and DNA operator to encrypt the pixel. Experimental results and extensive security analyses have been conducted to demonstrate the feasibility and validity of this proposed image encryption method.
Jia, Rui-Sheng; Sun, Hong-Mei; Peng, Yan-Jun; Liang, Yong-Quan; Lu, Xin-Ming
2016-12-01
Microseismic monitoring is an effective means for providing early warning of rock or coal dynamical disasters, and its first step is microseismic event detection, although low SNR microseismic signals often cannot effectively be detected by routine methods. To solve this problem, this paper presents permutation entropy and a support vector machine to detect low SNR microseismic events. First, an extraction method of signal features based on multi-scale permutation entropy is proposed by studying the influence of the scale factor on the signal permutation entropy. Second, the detection model of low SNR microseismic events based on the least squares support vector machine is built by performing a multi-scale permutation entropy calculation for the collected vibration signals, constructing a feature vector set of signals. Finally, a comparative analysis of the microseismic events and noise signals in the experiment proves that the different characteristics of the two can be fully expressed by using multi-scale permutation entropy. The detection model of microseismic events combined with the support vector machine, which has the features of high classification accuracy and fast real-time algorithms, can meet the requirements of online, real-time extractions of microseismic events.
Jia, Rui-Sheng; Sun, Hong-Mei; Peng, Yan-Jun; Liang, Yong-Quan; Lu, Xin-Ming
2017-07-01
Microseismic monitoring is an effective means for providing early warning of rock or coal dynamical disasters, and its first step is microseismic event detection, although low SNR microseismic signals often cannot effectively be detected by routine methods. To solve this problem, this paper presents permutation entropy and a support vector machine to detect low SNR microseismic events. First, an extraction method of signal features based on multi-scale permutation entropy is proposed by studying the influence of the scale factor on the signal permutation entropy. Second, the detection model of low SNR microseismic events based on the least squares support vector machine is built by performing a multi-scale permutation entropy calculation for the collected vibration signals, constructing a feature vector set of signals. Finally, a comparative analysis of the microseismic events and noise signals in the experiment proves that the different characteristics of the two can be fully expressed by using multi-scale permutation entropy. The detection model of microseismic events combined with the support vector machine, which has the features of high classification accuracy and fast real-time algorithms, can meet the requirements of online, real-time extractions of microseismic events.
Permuting operations on strings: Their permutations and their primes
Asveld, Peter R.J.
2009-01-01
We study some length-preserving operations on strings that permute the symbol positions in strings. These operations include some well-known examples (reversal, circular or cyclic shift, shuffle, twist, operations induced by the Josephus problem) and some new ones based on Archimedes spiral. Such
Permuting Operations on Strings: Their Permutations and Their Primes
Asveld, P.R.J.
2009-01-01
We study some length-preserving operations on strings that permute the symbol positions in strings. These operations include some well-known examples (reversal, circular or cyclic shift, shuffle, twist, operations induced by the Josephus problem) and some new ones based on the Archimedes spiral.
Permutation orbifolds and their applications
Bántay, P
2001-01-01
The theory of permutation orbifolds is reviewed and applied to the study of symmetric product orbifolds and the congruence subgroup problem. The issue of discrete torsion, the combinatorics of symmetric products, the Galois action and questions related to the classification of RCFTs are also discussed.
Novel permutation measures for image encryption algorithms
Abd-El-Hafiz, Salwa K.; AbdElHaleem, Sherif H.; Radwan, Ahmed G.
2016-10-01
This paper proposes two measures for the evaluation of permutation techniques used in image encryption. First, a general mathematical framework for describing the permutation phase used in image encryption is presented. Using this framework, six different permutation techniques, based on chaotic and non-chaotic generators, are described. The two new measures are, then, introduced to evaluate the effectiveness of permutation techniques. These measures are (1) Percentage of Adjacent Pixels Count (PAPC) and (2) Distance Between Adjacent Pixels (DBAP). The proposed measures are used to evaluate and compare the six permutation techniques in different scenarios. The permutation techniques are applied on several standard images and the resulting scrambled images are analyzed. Moreover, the new measures are used to compare the permutation algorithms on different matrix sizes irrespective of the actual parameters used in each algorithm. The analysis results show that the proposed measures are good indicators of the effectiveness of the permutation technique.
A Note on Permutationally Convex Games
van Velzen, S.; Hamers, H.J.M.; Norde, H.W.
2005-01-01
In this paper we generalise marginal vectors and permutational convexity.We show that if a game is generalised permutationally convex, then the corresponding generalised marginal vector is a core element.Furthermore we refine the concept of permutational convexity and show that this refinement yield
Embedding Properties Related to System Permutability
Institute of Scientific and Technical Information of China (English)
Tom Kimber
2002-01-01
A subgroup U of a finite solvable group G is system permutable in G if there is a Hall system ∑ of G such that US ≤ G for all S ∈∑. We introduce and investigate three properties, each apparently weaker than system permutability.We show that all three properties are equivalent to system permutability in a group of p-length at most 1 for each prime p, and they determine the same subgroup closed class as system permutability. We give an example to show that two of these properties are weaker than system permutability. For the third property,this is unresolved.
Decryption of pure-position permutation algorithms
Institute of Scientific and Technical Information of China (English)
赵晓宇; 陈刚; 张亶; 王肖虹; 董光昌
2004-01-01
Pure position permutation image encryption algorithms, commonly used as image encryption investigated in this work are unfortunately frail under known-text attack. In view of the weakness of pure position permutation algorithm,we put forward an effective decryption algorithm for all pure-position permutation algorithms. First, a summary of the pure position permutation image encryption algorithms is given by introducing the concept of ergodic matrices. Then, by using probability theory and algebraic principles, the decryption probability of pure-position permutation algorithms is verified theoretically; and then, by defining the operation system of fuzzy ergodic matrices, we improve a specific decryption al-gorithm. Finally, some simulation results are shown.
Witt Rings and Permutation Polynomials
Institute of Scientific and Technical Information of China (English)
Qifan Zhang
2005-01-01
Let p be a prime number. In this paper, the author sets up a canonical correspondence between polynomial functions over Z/p2Z and 3-tuples of polynomial functions over Z/pZ. Based on this correspondence, he proves and reproves some fundamental results on permutation polynomials mod pl. The main new result is the characterization of strong orthogonal systems over Z/p1Z.
Directory of Open Access Journals (Sweden)
Dorothy Bollman
1996-01-01
Full Text Available We introduce a tensor sum which is useful for the design and analysis of digit-index permutations (DIPs algorithms. Using this operation we obtain a new high-performance algorithm for the family of DIPs. We discuss an implementation in the applicative language Sisal and show how different choices of parameters yield different DIPs. The efficiency of the special case of digit reversal is illustrated with performance results on a Cray C-90.
Cascade Product of Permutation Groups
Egri-Nagy, Attila; Nehaniv, Chrystopher L.
2013-01-01
We define the cascade product of permutation groups as an external product, an explicit construction of substructures of the iterated wreath product that are much smaller than the full wreath product. This construction is essential for computational implementations of algebraic hierarchical decompositions of finite automata. We show how direct, semidirect, and wreath products and group extensions can all be expressed as cascade products, and analyse examples of groups that can be constructed ...
基于噪声检测的置换混叠图像盲分离%Blind Separation for Permuted Alias Image Based on Noise Detection
Institute of Scientific and Technical Information of China (English)
段新涛; 方勇
2011-01-01
Permuted alias image is a new type of single channel blind separation, which is fundamentally different from traditional single channel blind separation in theory and method. In this paper, an algorithm about permuted alias image blind separation based noise detection is proposed according to a class of permuted alias image infecting noise in permuting region. Firstly a mathematical model of permuted alias image is presented. Then a dictionary about sparse representation is obtained by training samples from permuted alias image with K-SVD dictionary learning algorithm restrained by nonzeros number. The permuted alias image is denoised by utilizing learned dictionary. Size and location of permuting region is found out by detecting the subtraction image, which is defined as difference between the denoised permuted alias image and original permuted alias image. The permuting region is optimized by implementing image morphological operation and is separated from the permuted alias image by setting threshold. The results show that permuting image can be separated efficiently from the permuted alias image, not affected by size, location, number of permuting image and noise level on permuting image.%置换混叠图像盲分离作为一类新型的单信道盲分离,在理论和方法上与传统的单信道盲分离有着本质的不同.针对一类置换区域含噪声的置换混叠图像,本文提出一种基于噪声检测的置换混叠图像盲分离算法.本文首先给出置换混叠图像的数学模型,对置换混叠图像用非零元个数约束的K-SVD算法进行训练得到其稀疏表示的字典,利用学习得到的字典对置换混叠图像去噪,然后利用去噪后的置换混叠图像与原图像作差运算得到差图像,通过检测差图像来确定出置换区域的位置和大小.并利用图像形态学运算优化置换区域,采用阈值化操作分离出置换图像.实验结果表明,本文算法能够较好的从置换混叠图像中
Xu, Kaixuan; Wang, Jun
2017-02-01
In this paper, recently introduced permutation entropy and sample entropy are further developed to the fractional cases, weighted fractional permutation entropy (WFPE) and fractional sample entropy (FSE). The fractional order generalization of information entropy is utilized in the above two complexity approaches, to detect the statistical characteristics of fractional order information in complex systems. The effectiveness analysis of proposed methods on the synthetic data and the real-world data reveals that tuning the fractional order allows a high sensitivity and more accurate characterization to the signal evolution, which is useful in describing the dynamics of complex systems. Moreover, the numerical research on nonlinear complexity behaviors is compared between the returns series of Potts financial model and the actual stock markets. And the empirical results confirm the feasibility of the proposed model.
Permutation-based Homogeneous Block Content Authentication for Watermarking
Directory of Open Access Journals (Sweden)
S.Maruthuperumal
2013-02-01
Full Text Available In modern days, digital watermarking has become an admired technique for hitting data in digital images to help guard against copyright infringement. The proposed Permutation-based Homogeneous Block Content authentication (PHBC methods develop a secure and excellence strong watermarking algorithm that combines the reward of permutation-based Homogeneous block (PHB with that of significant and insignificant bit values with X0R encryption function using Max coefficient of least coordinate value for embedding the watermark. In the projected system uses the relationship between the permutation blocks to embed many data into Homogeneous blocks without causing solemn distortion to the watermarked image. The experimental results show that the projected system is very efficient in achieving perceptual invisibility with an increase in the Peak Signal to Noise Ratio (PSNR. Moreover, the projected system is robust to a variety of signal processing operations, such as image Cropping, Rotation, Resizing, Adding noise, Filtering , Blurring and Motion blurring.
Introduction to Permutation and Resampling-Based Hypothesis Tests
LaFleur, Bonnie J.; Greevy, Robert A.
2009-01-01
A resampling-based method of inference--permutation tests--is often used when distributional assumptions are questionable or unmet. Not only are these methods useful for obvious departures from parametric assumptions (e.g., normality) and small sample sizes, but they are also more robust than their parametric counterparts in the presences of…
Minimal factorizations of permutations into star transpositions
Irving, J.; Rattan, Amarpreet
2009-01-01
International audience; We give a compact expression for the number of factorizations of any permutation into a minimal number of transpositions of the form $(1 i)$. Our result generalizes earlier work of Pak ($\\textit{Reduced decompositions of permutations in terms of star transpositions, generalized catalan numbers and k-ary trees}$, Discrete Math. $\\textbf{204}$:329―335, 1999) in which substantial restrictions were placed on the permutation being factored.; Nous présentons une expression c...
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...... of the permutations are analyzed for several DSA patterns. Simulations are performed according to the parameters of the IEEE 802.16e system model. The securing mechanism proposed provides intrinsic PHY layer security and it can be easily implemented in the current IEEE 802.16 standard applying almost negligible...
Congruence Permutable Symmetric Extended de Morgan Algebras
Institute of Scientific and Technical Information of China (English)
Jie FANG
2006-01-01
An algebra A is said to be congruence permutable if any two congruences on it are per-mutable. This property has been investigated in several varieties of algebras, for example, de Morgan algebras, p-algebras, Kn,o-algebras. In this paper, we study the class of symmetric extended de Morgan algebras that are congruence permutable. In particular we consider the case where A is finite, and show that A is congruence permutable if and only if it is isomorphic to a direct product of finitely many simple algebras.
Permuting operations on strings and the distribution of their prime numbers
Asveld, Peter R.J.
2011-01-01
Several ways of interleaving, as studied in theoretical computer science, and some subjects from mathematics can be modeled by length-preserving operations on strings, that only permute the symbol positions in strings. Each such operation X gives rise to a family {Xn}n≥2} of similar permutations. We
A Comparison of Multiscale Permutation Entropy Measures in On-Line Depth of Anesthesia Monitoring
Li, Xiaoli; Li, Duan; Li, Yongwang; Ursino, Mauro
2016-01-01
Objective Multiscale permutation entropy (MSPE) is becoming an interesting tool to explore neurophysiological mechanisms in recent years. In this study, six MSPE measures were proposed for on-line depth of anesthesia (DoA) monitoring to quantify the anesthetic effect on the real-time EEG recordings. The performance of these measures in describing the transient characters of simulated neural populations and clinical anesthesia EEG were evaluated and compared. Methods Six MSPE algorithms—derived from Shannon permutation entropy (SPE), Renyi permutation entropy (RPE) and Tsallis permutation entropy (TPE) combined with the decomposition procedures of coarse-graining (CG) method and moving average (MA) analysis—were studied. A thalamo-cortical neural mass model (TCNMM) was used to generate noise-free EEG under anesthesia to quantitatively assess the robustness of each MSPE measure against noise. Then, the clinical anesthesia EEG recordings from 20 patients were analyzed with these measures. To validate their effectiveness, the ability of six measures were compared in terms of tracking the dynamical changes in EEG data and the performance in state discrimination. The Pearson correlation coefficient (R) was used to assess the relationship among MSPE measures. Results CG-based MSPEs failed in on-line DoA monitoring at multiscale analysis. In on-line EEG analysis, the MA-based MSPE measures at 5 decomposed scales could track the transient changes of EEG recordings and statistically distinguish the awake state, unconsciousness and recovery of consciousness (RoC) state significantly. Compared to single-scale SPE and RPE, MSPEs had better anti-noise ability and MA-RPE at scale 5 performed best in this aspect. MA-TPE outperformed other measures with faster tracking speed of the loss of unconsciousness. Conclusions MA-based multiscale permutation entropies have the potential for on-line anesthesia EEG analysis with its simple computation and sensitivity to drug effect
Symmetric products, permutation orbifolds and discrete torsion
Bántay, P
2000-01-01
Symmetric product orbifolds, i.e. permutation orbifolds of the full symmetric group S_{n} are considered by applying the general techniques of permutation orbifolds. Generating functions for various quantities, e.g. the torus partition functions and the Klein-bottle amplitudes are presented, as well as a simple expression for the discrete torsion coefficients.
Non-parametric combination and related permutation tests for neuroimaging.
Winkler, Anderson M; Webster, Matthew A; Brooks, Jonathan C; Tracey, Irene; Smith, Stephen M; Nichols, Thomas E
2016-04-01
In this work, we show how permutation methods can be applied to combination analyses such as those that include multiple imaging modalities, multiple data acquisitions of the same modality, or simply multiple hypotheses on the same data. Using the well-known definition of union-intersection tests and closed testing procedures, we use synchronized permutations to correct for such multiplicity of tests, allowing flexibility to integrate imaging data with different spatial resolutions, surface and/or volume-based representations of the brain, including non-imaging data. For the problem of joint inference, we propose and evaluate a modification of the recently introduced non-parametric combination (NPC) methodology, such that instead of a two-phase algorithm and large data storage requirements, the inference can be performed in a single phase, with reasonable computational demands. The method compares favorably to classical multivariate tests (such as MANCOVA), even when the latter is assessed using permutations. We also evaluate, in the context of permutation tests, various combining methods that have been proposed in the past decades, and identify those that provide the best control over error rate and power across a range of situations. We show that one of these, the method of Tippett, provides a link between correction for the multiplicity of tests and their combination. Finally, we discuss how the correction can solve certain problems of multiple comparisons in one-way ANOVA designs, and how the combination is distinguished from conjunctions, even though both can be assessed using permutation tests. We also provide a common algorithm that accommodates combination and correction.
Simple permutations with order $4n + 2$
Acosta-Humánez, Primitivo B
2010-01-01
The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\\'anez & Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of periodic points of a continuous map, but simple permutations will show the behavior of those periodic points. This paper studies the structure of permutations of mixed order $4n+2$, its properties and a way to describe its genealogy by using Pasting and Reversing.
Wilf classification of doubly generalized permutation patterns
Parviainen, Robert
2009-01-01
We classify all doubly generalized patterns of length two and three according to the number of permutations avoiding them. These patterns were recently defined by Bousquet-Melou et. al., and are natural generalizations of Babson and Steingrimsson's generalized patterns. The patterns are divided into seven and 24 Wilf classes, for lengths two and three, respectively. For most of the patterns an explicit form for the number of permutations avoiding the pattern is given.
Permutation parity machines for neural cryptography.
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.
Permutations with Ascending and Descending Blocks
Steinhardt, Jacob
2009-01-01
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then provide the first bijective proofs of some known results. We also solve some problems posed in [3] by Eriksen, Freij, and Wastlund, who study derangements that descend in blocks of prescribed lengths.
Permutation tests for multi-factorial analysis of variance
Anderson, M.J.; Braak, ter C.J.F.
2003-01-01
Several permutation strategies are often possible for tests of individual terms in analysis-of-variance (ANOVA) designs. These include restricted permutations, permutation of whole groups of units, permutation of some form of residuals or some combination of these. It is unclear, especially for
Estimating temporal causal interaction between spike trains with permutation and transfer entropy.
Directory of Open Access Journals (Sweden)
Zhaohui Li
Full Text Available Estimating the causal interaction between neurons is very important for better understanding the functional connectivity in neuronal networks. We propose a method called normalized permutation transfer entropy (NPTE to evaluate the temporal causal interaction between spike trains, which quantifies the fraction of ordinal information in a neuron that has presented in another one. The performance of this method is evaluated with the spike trains generated by an Izhikevich's neuronal model. Results show that the NPTE method can effectively estimate the causal interaction between two neurons without influence of data length. Considering both the precision of time delay estimated and the robustness of information flow estimated against neuronal firing rate, the NPTE method is superior to other information theoretic method including normalized transfer entropy, symbolic transfer entropy and permutation conditional mutual information. To test the performance of NPTE on analyzing simulated biophysically realistic synapses, an Izhikevich's cortical network that based on the neuronal model is employed. It is found that the NPTE method is able to characterize mutual interactions and identify spurious causality in a network of three neurons exactly. We conclude that the proposed method can obtain more reliable comparison of interactions between different pairs of neurons and is a promising tool to uncover more details on the neural coding.
Permutation based speech scrambling for next generation mobile communication
Directory of Open Access Journals (Sweden)
Dhanya G
2016-04-01
Full Text Available Scrambling is a really significant method that provides protection in communication systems by using random permutation and pseudorandom binary scrambling method. To enhance the security in communication, OFDM scrambling can provide better protection than an FFT scrambler under same permutation operation. To evaluate the quality of the proposed system, perceptual evaluation of speech quality is used. The objective test SNR and BER are used to estimate the noise performance of the system. STI and CIS were applied to know the performance of the system. From the simulations, it is clear that, the proposed system shows better performance than conventional scrambling technique and it is more robust in the 4th generation of mobile communication.
Successful attack on permutation-parity-machine-based neural cryptography.
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.
Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
Brändén, Petter
2011-01-01
Any permutation statistic $f:\\sym\\to\\CC$ may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: $f= \\Sigma_\\tau\\lambda_f(\\tau)\\tau$. To provide explicit expansions for certain statistics, we introduce a new type of permutation patterns that we call mesh patterns. Intuitively, a mesh pattern $p=(\\pi,R)$ counts occurrences of the permutation pattern $\\pi$ with additional restrictions specified by $R$ on the relative position of the entries of the occurrence. We show that, for any mesh pattern $p=(\\pi,R)$, we have $\\lambda_p(\\tau) = (-1)^{|\\tau|-|\\pi|}p^{\\star}(\\tau)$ where $p^{\\star}=(\\pi,R^c)$ is the mesh pattern with the same underlying permutation as $p$ but with complementary restrictions. We use this result to expand some well known permutation statistics, such as the number of left-to-right maxima, descents, excedances, fixed points, strong fixed points, and the major index. We also show that alternating permutations, Andr\\'e permutations of the first ...
A WATERMARKING ALGORITHM BASED ON PERMUTATION AND 2-D BARCODE
Institute of Scientific and Technical Information of China (English)
Ji Zhen; Zhang Jihong; Xie Weixin
2001-01-01
This letter presents a method for digital image watermarking for copyright protection. This technique produces a watermarked image that closely retains the quality of the original host image while concurrently surviving various image processing operations such as lowpass/highpass filtering, lossy JPEG compression, and cropping. This image watermarking algorithm takes full advantage of permutation and 2-D barcode (PDF417). The actual watermark embedding in spatial domain is followed using permutated image for improving the resistance to image cropping. Much higher watermark robustness is obtainable via a simple forward error correction technique, which is the main feature of PDF417 codes. Additional features of this technique include the easy determination of the existence of the watermark and that the watermark verification procedure does not need the original host image. The experimental results demonstrate its effectiveness.
On Exact Algorithms for Permutation CSP
Kim, Eun Jung
2012-01-01
In the Permutation Constraint Satisfaction Problem (Permutation CSP) we are given a set of variables $V$ and a set of constraints C, in which constraints are tuples of elements of V. The goal is to find a total ordering of the variables, $\\pi\\ : V \\rightarrow [1,...,|V|]$, which satisfies as many constraints as possible. A constraint $(v_1,v_2,...,v_k)$ is satisfied by an ordering $\\pi$ when $\\pi(v_1)<\\pi(v_2)<...<\\pi(v_k)$. An instance has arity $k$ if all the constraints involve at most $k$ elements. This problem expresses a variety of permutation problems including {\\sc Feedback Arc Set} and {\\sc Betweenness} problems. A naive algorithm, listing all the $n!$ permutations, requires $2^{O(n\\log{n})}$ time. Interestingly, {\\sc Permutation CSP} for arity 2 or 3 can be solved by Held-Karp type algorithms in time $O^*(2^n)$, but no algorithm is known for arity at least 4 with running time significantly better than $2^{O(n\\log{n})}$. In this paper we resolve the gap by showing that {\\sc Arity 4 Permutati...
THE PERMUTATION FORMULA OF SINGULAR INTEGRALS WITH BOCHNER-MARTINELLI KERNEL ON STEIN MANIFOLDS
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Using the method of localization, the authors obtain the permutation formula of singular integrals with Bochner-Martinelli kernel for a relative compact domain with C(1) smooth boundary on a Stein manifold. As an application the authors discuss the regularization problem for linear singular integral equations with Bochner-Martinelli kernel and variable coefficients; using permutation formula, the singular integral equation can be reduced to a fredholm equation.
The genus distributions for a certain type of permutation graphs in orientable surfaces
Institute of Scientific and Technical Information of China (English)
Rong-xia; HAO; Wei-li; HE; Yan-pei; LIU; Er-ling; WEI
2007-01-01
A circuit is a connected nontrivial 2-regular graph. A graph G is a permutation graph over a circuit C, if G can be obtained from two copies of C by joining these two copies with a perfect matching. In this paper, based on the joint tree method introduced by Liu, the genus polynomials for a certain type of permutation graphs in orientable surfaces are given.
Permutation centralizer algebras and multimatrix invariants
Mattioli, Paolo; Ramgoolam, Sanjaye
2016-03-01
We introduce a class of permutation centralizer algebras which underly the combinatorics of multimatrix gauge-invariant observables. One family of such noncommutative algebras is parametrized by two integers. Its Wedderburn-Artin decomposition explains the counting of restricted Schur operators, which were introduced in the physics literature to describe open strings attached to giant gravitons and were subsequently used to diagonalize the Gaussian inner product for gauge invariants of two-matrix models. The structure of the algebra, notably its dimension, its center and its maximally commuting subalgebra, is related to Littlewood-Richardson numbers for composing Young diagrams. It gives a precise characterization of the minimal set of charges needed to distinguish arbitrary matrix gauge invariants, which are related to enhanced symmetries in gauge theory. The algebra also gives a star product for matrix invariants. The center of the algebra allows efficient computation of a sector of multimatrix correlators. These generate the counting of a certain class of bicoloured ribbon graphs with arbitrary genus.
Computing the Ball Size of Frequency Permutations under Chebyshev Distance
Shieh, Min-Zheng
2011-01-01
Let $S_n^\\lambda$ be the set of all permutations over the multiset $\\{\\overbrace{1,...,1}^{\\lambda},...,\\overbrace{m,...,m}^\\lambda\\}$ where $n=m\\lambda$. A frequency permutation array (FPA) of minimum distance $d$ is a subset of $S_n^\\lambda$ in which every two elements have distance $d$. FPAs have many applications related to error correcting codes. In coding theory, the Gilbert-Varshamov bound and the sphere-packing bound are derived from the size of balls of certain radii. We propose two efficient algorithms that compute the ball size of frequency permutations under Chebyshev distance. Both methods extend previous known results. The first one runs in $O\\left({2d\\lambda \\choose d\\lambda}^{2.376}\\log n\\right)$ time and $O\\left({2d\\lambda \\choose d\\lambda}^{2}\\right)$ space. The second one runs in $O\\left({2d\\lambda \\choose d\\lambda}{d\\lambda+\\lambda\\choose \\lambda}\\frac{n}{\\lambda}\\right)$ time and $O\\left({2d\\lambda \\choose d\\lambda}\\right)$ space. For small constants $\\lambda$ and $d$, both are efficient ...
Space Time Codes from Permutation Codes
Henkel, Oliver
2006-01-01
A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and space time codes has been used to translate them into the final space time codes. Simulations demonstrate that the performance increases with the block lengths, a result that has been conjectured already in previous work. Further, the connection to permutation codes allows for moderate complex en-/decoding algorithms.
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.
The L-sharp permutation groups
Institute of Scientific and Technical Information of China (English)
李炯生
2000-01-01
An answer is given to a problem proposed by Bannai and Ito for { l, l + s, l + s + t} -sharp permutation group, and the result is used to determine L-sharp groups for L = { l, l + 1, l + 3} and{l,l+2,l+3}.
Flavour singlets in gauge theory as Permutations
Kimura, Yusuke; Suzuki, Ryo
2016-01-01
Gauge-invariant operators can be specified by equivalence classes of permutations. We develop this idea concretely for the singlets of the flavour group $SO(N_f)$ in $U(N_c)$ gauge theory by using Gelfand pairs and Schur-Weyl duality. The singlet operators, when specialised at $N_f =6$, belong to the scalar sector of ${\\cal N}=4$ SYM. A simple formula is given for the two-point functions in the free field limit of $g_{YM}^2 =0$. The free two-point functions are shown to be equal to the partition function on a 2-complex with boundaries and a defect, in a topological field theory of permutations. The permutation equivalence classes are Fourier transformed to a representation basis which is orthogonal for the two-point functions at finite $N_c , N_f$. Counting formulae for the gauge-invariant operators are described. The one-loop mixing matrix is derived as a linear operator on the permutation equivalence classes.
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....
Directory of Open Access Journals (Sweden)
Yun-Tzai Lee
Full Text Available Split-protein systems have emerged as a powerful tool for detecting biomolecular interactions and reporting biological reactions. However, reliable methods for identifying viable split sites are still unavailable. In this study, we demonstrated the feasibility that valid circular permutation (CP sites in proteins have the potential to act as split sites and that CP prediction can be used to search for internal permissive sites for creating new split proteins. Using a protein ligase, intein, as a model, CP predictor facilitated the creation of circular permutants in which backbone opening imposes the least detrimental effects on intein folding. We screened a series of predicted intein CPs and identified stable and native-fold CPs. When the valid CP sites were introduced as split sites, there was a reduction in folding enthalpy caused by the new backbone opening; however, the coincident loss in entropy was sufficient to be compensated, yielding a favorable free energy for self-association. Since split intein is exploited in protein semi-synthesis, we tested the related protein trans-splicing (PTS activities of the corresponding split inteins. Notably, a novel functional split intein composed of the N-terminal 36 residues combined with the remaining C-terminal fragment was identified. Its PTS activity was shown to be better than current reported two-piece intein with a short N-terminal segment. Thus, the incorporation of in silico CP prediction facilitated the design of split intein as well as circular permutants.
Explicit classes of permutation polynomials of F33m
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
Permutation polynomials have been an interesting subject of study for a long time and have applications in many areas of mathematics and engineering. However, only a small number of specific classes of permutation polynomials are known so far. In this paper, six classes of linearized permutation polynomials and six classes of nonlinearized permutation polynomials over F33m are presented. These polynomials have simple shapes, and they are related to planar functions.
Explicit classes of permutation polynomials of F33m
Institute of Scientific and Technical Information of China (English)
DING CunSheng; XIANG Qing; YUAN Jin; YUAN PingZhi
2009-01-01
Permutation polynomials have been an interesting subject of study for a long time and have applications in many areas of mathematics and engineering. However, only a small number of specific classes of permutation polynomials are known so far. In this paper, six classes of linearized permutation polynomials and six classes of nonlinearized permutation polynomials over F33 are pre-sented. These polynomials have simple shapes, and they are related to planar functions.
Quick Trickle Permutation Based on Quick Trickle Characteristic Sequence
Institute of Scientific and Technical Information of China (English)
Wang Li-na; Fei Ru-chun; Liu Zhu
2003-01-01
The concept of quick trickle characteristic sequence is presented, the properties and count of quick trickle characteristic sequence are researched, the mapping relationship between quick trickle characteristic sequence and quick trickle permutation is discussed. Finally, an efficient construction of quick trickle permutation based on quick trickle characteristic sequence is given, by which quick trickle permutation can be figured out after constructing quick trickle characteristic sequence. Quick trickle permutation has good cryptographic properties.
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.
Grid classes and the Fibonacci dichotomy for restricted permutations
Huczynska, Sophie; Vatter, Vincent
2006-01-01
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of length n in a permutation class is either at least as large as the nth Fibonacci number or is eventually polynomial.
A SAS/IML algorithm for an exact permutation test
Directory of Open Access Journals (Sweden)
Neuhäuser, Markus
2009-03-01
Full Text Available An algorithm written in SAS/IML is presented that can perform an exact permutation test for a two-sample comparison. All possible permutations are considered. The Baumgartner-Weiß-Schindler statistic is exemplarily used as the test statistic for the permutation test.
Tri-Permuting Mixing Matrix and predictions for theta_13
Bazzocchi, F
2011-01-01
We introduce a new texture for neutrino mixing named Tri-Permuting (TP) mixing matrix. This pattern is characterized by maximal solar and atmospheric angles and by a large reactor angle satisfying sin(theta_13)=1/3. The correct lepton mixing matrix is obtained when combining the charged lepton mixing matrix with the neutrino one. In this way we get new predictions for theta_13 with respect to those obtained by the well studied TBM or BM mixing patterns. We present a specific model that gives rise to TP mixing in the neutrino sector as well as the required corrections from the charged lepton one.
Constructing circuit codes by permuting initial sequences
Wynn, Ed
2012-01-01
Two new constructions are presented for coils and snakes in the hypercube. Improvements are made on the best known results for snake-in-the-box coils of dimensions 9, 10 and 11, and for some other circuit codes of dimensions between 8 and 13. In the first construction, circuit codes are generated from permuted copies of an initial transition sequence; the multiple copies constrain the search, so that long codes can be found relatively efficiently. In the second construction, two lower-dimensional paths are joined together with only one or two changes in the highest dimension; this requires a search for a permutation of the second sequence to fit around the first. It is possible to investigate sequences of vertices of the hypercube, including circuit codes, by connecting the corresponding vertices in an extended graph related to the hypercube. As an example of this, invertible circuit codes are briefly discussed.
High order generalized permutational fractional Fourier transforms
Institute of Scientific and Technical Information of China (English)
Ran Qi-Wen; Yuan Lin; Tan Li-Ying; Ma Jing; Wang Qi
2004-01-01
We generalize the definition of the fractional Fourier transform (FRFT) by extending the new definition proposed by Shih. The generalized FRFT, called the high order generalized permutational fractional Fourier transform (HGPFRFT),is a generalized permutational transform. It is shown to have arbitrary natural number M periodic eigenvalues not only with respect to the order of Hermite-Gaussian functions but also to the order of the transform. This HGPFRFT will be reduced to the original FRFT proposed by Namias and Liu's generalized FRFT and Shih's FRFT at the three limits with M = +∞,M = 4k (k is a natural number), and M = 4, respectively. Therefore the HGPFRFT introduces a comprehensive approach to Shih's FRFT and the original definition. Some important properties of HGPFRFT are discussed. Lastly the results of computer simulations and symbolic representations of the transform are provided.
IA-Automorphisms of Permutational Wreath Products
Institute of Scientific and Technical Information of China (English)
John Panagopoulos
2001-01-01
Let W be the permutational wreath product of two groups A and B.In this paper, we study the relationship between the semicompleteness of W and the semicompleteness of A and B. In the general case, we give some necessary conditions for the semicompleteness of the group W. In the case of finite groups A and B with A abelian, we give necessary and sufficient conditions under which the group W is semicomplete.
Bin Packing via Discrepancy of Permutations
Eisenbrand, Friedrich; Rothvoß, Thomas
2010-01-01
A well studied special case of bin packing is the 3-partition problem, where n items of size >1/4 have to be packed in a minimum number of bins of capacity one. The famous Karmarkar-Karp algorithm transforms a fractional solution of a suitable LP relaxation for this problem into an integral solution that requires at most O(log n) additional bins. The three-permutations-conjecture of Beck is the following. Given any 3 permutations on n symbols, one can color the symbols red and blue, such that in any interval of any of those permutations, the number of red and blue symbols differs only by a constant. Beck's conjecture is well known in the field of discrepancy theory. We establish a surprising connection between bin packing and Beck's conjecture: If the latter holds true, then the additive integrality gap of the 3-partition linear programming relaxation is bounded by a constant. This result indicates that improving approximability results for bin packing requires a better understanding of discrepancy theory.
A Design of New Fast Image Permutation Approach for Food Intellectual-property Protection
Directory of Open Access Journals (Sweden)
Feng Huang
2015-08-01
Full Text Available The security of food image was important in food intellectual-property protection. Permutation could protect security of image which charged the correlation among adjacent pixels. Some chaotic maps were used in image permutation; act as baker map or some other maps. But the plain image must be square. At the same time the plain image always is stretched to a line firstly. Obviously, it wasted precious time. The study found the pixels location could arrange freely using some new maps without stretching and those also could encrypt rectangle images not only square image. The ideas of maps were: firstly the plain image was divided into two halves. Using two different scanning methods it could stretch the halves to two different lines. Then it inserted the pixels of a line into the adjacent pixels of another line in order. Lastly the new line could be fold to a new image. For different of scanning methods, it got some different map patterns. A permutation approach was developed which used those patterns. It used decimal numbers as the keys and could permute rectangle images easily. The permutation process was quite fast and enough safe. Deciphering process was an invertible process using the same keys. Some studies proved that high correlation among adjacent pixels was rapidly charged. The approach could satisfy the most security requirements in Internet.
Wang, Rui; De Gruttola, Victor
2017-08-15
We investigate the use of permutation tests for the analysis of parallel and stepped-wedge cluster-randomized trials. Permutation tests for parallel designs with exponential family endpoints have been extensively studied. The optimal permutation tests developed for exponential family alternatives require information on intraclass correlation, a quantity not yet defined for time-to-event endpoints. Therefore, it is unclear how efficient permutation tests can be constructed for cluster-randomized trials with such endpoints. We consider a class of test statistics formed by a weighted average of pair-specific treatment effect estimates and offer practical guidance on the choice of weights to improve efficiency. We apply the permutation tests to a cluster-randomized trial evaluating the effect of an intervention to reduce the incidence of hospital-acquired infection. In some settings, outcomes from different clusters may be correlated, and we evaluate the validity and efficiency of permutation test in such settings. Lastly, we propose a permutation test for stepped-wedge designs and compare its performance with mixed-effect modeling and illustrate its superiority when sample sizes are small, the underlying distribution is skewed, or there is correlation across clusters. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.
[A study of sleep stage classification based on permutation entropy for electroencephalogram].
Li, Gu; Fan, Yingle; Pang, Quan
2009-08-01
This paper presents a new method for automatic sleep stage classification which is based on the EEG permutation entropy. The EEG permutation entropy has notable distinction in each stage of sleep and manifests the trend of regular transforming. So it can be used as features of sleep EEG in each stage. Nearest neighbor is employed as the pattern recognition method to classify the stages of sleep. Experiments are conducted on 750 sleep EEG samples and the mean identification rate can be up to 79.6%.
Bearing Fault Diagnosis Based on Multiscale Permutation Entropy and Support Vector Machine
Directory of Open Access Journals (Sweden)
Jian-Jiun Ding
2012-07-01
Full Text Available Bearing fault diagnosis has attracted significant attention over the past few decades. It consists of two major parts: vibration signal feature extraction and condition classification for the extracted features. In this paper, multiscale permutation entropy (MPE was introduced for feature extraction from faulty bearing vibration signals. After extracting feature vectors by MPE, the support vector machine (SVM was applied to automate the fault diagnosis procedure. Simulation results demonstrated that the proposed method is a very powerful algorithm for bearing fault diagnosis and has much better performance than the methods based on single scale permutation entropy (PE and multiscale entropy (MSE.
Exploiting Lipid Permutation Symmetry to Compute Membrane Remodeling Free Energies
Bubnis, Greg; Risselada, Herre Jelger; Grubmüller, Helmut
2016-10-01
A complete physical description of membrane remodeling processes, such as fusion or fission, requires knowledge of the underlying free energy landscapes, particularly in barrier regions involving collective shape changes, topological transitions, and high curvature, where Canham-Helfrich (CH) continuum descriptions may fail. To calculate these free energies using atomistic simulations, one must address not only the sampling problem due to high free energy barriers, but also an orthogonal sampling problem of combinatorial complexity stemming from the permutation symmetry of identical lipids. Here, we solve the combinatorial problem with a permutation reduction scheme to map a structural ensemble into a compact, nondegenerate subregion of configuration space, thereby permitting straightforward free energy calculations via umbrella sampling. We applied this approach, using a coarse-grained lipid model, to test the CH description of bending and found sharp increases in the bending modulus for curvature radii below 10 nm. These deviations suggest that an anharmonic bending term may be required for CH models to give quantitative energetics of highly curved states.
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.
Exponential Brute-Force Complexity of A Permutation Based Stream Cipher
Directory of Open Access Journals (Sweden)
Mohammed Omari
2013-01-01
Full Text Available This paper introduces a permutation generation mechanism based on a shared secret key. The generated permutation vectors are used as encryption keys in a stream ciphering cryptosystem. We investigated various types of attacks on the known stream cipher RC4 and patched most of its loopholes, especially biased-byte and state-related attacks. Unique to our approach, we prove mathematically that the complexity of brute-forcing such a system is (2n, where n is the key size in bytes. This paper also presents a complete security model using permutation-based encryption, in order to handle privacy. In addition, our approach achieved higher performance than that of existing peer techniques, while maintaining solid security. Experimental results show that our system is much faster than the existing security mechanisms, such as AES and DES.
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.
Six-qubit permutation-based decoherence-free orthogonal basis
Cabello, A
2007-01-01
There is a natural orthogonal basis of the 6-qubit decoherence-free (DF) space robust against collective noise. Interestingly, most of the basis states can be obtained from one another just permuting qubits. This property: (a) is useful for encoding qubits in DF subspaces, (b) allows the implementation of the Bennett-Brassard 1984 (BB84) protocol in DF subspaces just permuting qubits, which completes a the method for quantum key distribution using DF states proposed by Boileau et al. [Phys. Rev. Lett. 92, 017901 (2004)], and (c) points out that there is only one 6-qubit DF state which is essentially new (not obtained by permutations) and therefore constitutes an interesting experimental challenge.
Alternating permutations with restrictions and standard Young tableaux
Yan, Sherry H F
2012-01-01
In this paper, we give bijections between the set of 4123-avoiding down-up alternating permutations of length $2n$ and the set of standard Young tableaux of shape $(n,n,n)$, and between the set of 4123-avoiding down-up alternating permutations of length $2n-1$ and the set of shifted standard Young tableaux of shape $(n+1, n, n-1)$ via an intermediate structure of Yamanouchi words. Moreover, we get the enumeration of 4123-avoiding up-down alternating permutations of even and odd length by presenting bijections between 4123-avoiding up-down alternating permutations and standard Young tableaux.
Ordered groups and infinite permutation groups
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...
Statistical validation of normal tissue complication probability models
Xu, Cheng-Jian; van der Schaaf, Arjen; van t Veld, Aart; Langendijk, Johannes A.; Schilstra, Cornelis
2012-01-01
PURPOSE: To investigate the applicability and value of double cross-validation and permutation tests as established statistical approaches in the validation of normal tissue complication probability (NTCP) models. METHODS AND MATERIALS: A penalized regression method, LASSO (least absolute shrinkage
Permutations with Kazhdan-Lusztig polynomial P_{id,w}(q) = 1 + q^h
Woo, Alexander; Billey, Sara; Weed, Jonathan
2008-01-01
Using resolutions of singularities introduced by Cortez and a method for calculating Kazhdan-Lusztig polynomials due to Polo, we prove the conjecture of Billey and Braden characterizing permutations w with Kazhdan-Lusztig polynomial P_{id,w}(q)=1+q^h for some h.
The coupling analysis between stock market indices based on permutation measures
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.
The Magic of Universal Quantum Computing with Permutations
Directory of Open Access Journals (Sweden)
Michel Planat
2017-01-01
Full Text Available The role of permutation gates for universal quantum computing is investigated. The “magic” of computation is clarified in the permutation gates, their eigenstates, the Wootters discrete Wigner function, and state-dependent contextuality (following many contributions on this subject. A first classification of a few types of resulting magic states in low dimensions d≤9 is performed.
Modified Hill Cipher with Key Dependent Permutation and Circular Rotation
Directory of Open Access Journals (Sweden)
V. U.K. Sastry
2007-01-01
Full Text Available In this study, we have modified the Hill cipher, by including a permutation and circular rotation into the cipher. Here both the permutation and the rotation depend upon the key. From the cryptanalysis and the avalanche effect, discussed in this study, we notice that the strength of the cipher is significant.
Permuting operations on strings and their relation to prime numbers
Asveld, Peter R.J.
2011-01-01
Some length-preserving operations on strings only permute the symbol positions in strings; such an operation $X$ gives rise to a family $\\{X_n\\}_{n\\geq 2}$ of similar permutations. We investigate the structure and the order of the cyclic group generated by $X_n$. We call an integer $n$ $X$-prime if
Permuting operations on strings and their relation to prime numbers
Asveld, Peter R.J.
2010-01-01
Some length-preserving operations on strings only permute the symbol positions in strings; such an operation $X$ gives rise to a family $\\{X_n\\}_{n\\geq2}$ of similar permutations. We investigate the structure and the order of the cyclic group generated by $X_n$. We call an integer $n$ $X$-{\\em prim
Expression of linear permutated variants from circular enterocin AS-48
Montalbán-López, Manuel; Martínez-Bueno, Manuel; Valdivia, Eva; Maqueda, Mercedes
2011-01-01
To confirm whether the head-to-tail circularization could be involved in the stability and activity of the circular bacteriocin AS-48, two permutated linear structural as-48A genes have been constructed by circular permutation. The absence of the leaderless linear AS(23/24) and AS(48/49) proteins in
Permuting Operations on Strings and Their Relation to Prime Numbers
Asveld, P.R.J.
2011-01-01
Some length-preserving operations on strings only permute the symbol positions in strings; such an operation $X$ gives rise to a family $\\{X_n\\}_{n\\geq 2}$ of similar permutations. We investigate the structure and the order of the cyclic group generated by $X_n$. We call an integer $n$ $X$-prime if
Permuting Operations on Strings and Their Relation to Prime Numbers
Asveld, P.R.J.
2010-01-01
Some length-preserving operations on strings only permute the symbol positions in strings; such an operation $X$ gives rise to a family $\\{X_n\\}_{n\\geq2}$ of similar permutations. We investigate the structure and the order of the cyclic group generated by $X_n$. We call an integer $n$ $X$-{\\em
Explicit Symplectic-like Integrators with Midpoint Permutations for Spinning Compact Binaries
Luo, Junjie; Wu, Xin; Huang, Guoqing; Liu, Fuyao
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.
TWO APPLICATIONS OF PERMUTATION TESTS IN BIOSTASTICS
LEÓN-NOVELO, LUIS; KEMPPAINEN, KAISA M.; ARDISSONE, ALEXANDRIA; DAVIS-RICHARDSON, AUSTIN; FAGEN, JENNIE; GANO, KELSEY; TRIPLETT, ERIC W.
2014-01-01
We show two examples of how we answer biological questions by converting them into statistical hypothesis testing problems. We consider gene abundance data, and apply permutation tests. Though these tests are simple, they allow us to test biologically relevant hypotheses. Here we present the analysis of data rising from two studies on Type 1 Diabetes. In the first study [3] are interested in comparing the gut bacterial biodiversity in children at risk and not at risk of developing diabetes. In the second study, [4] compare the gut bacterial biodiversity of children in six different sites in USA and Europe. The statistical analyses presented here are parts of the “statistical methods” in two papers mentioned above. Here we offer a detailed explanation of the “Statistical Methods” addressed to readers with a statistics background. PMID:25221355
Permutation Symmetry Determines the Discrete Wigner Function
Zhu, Huangjun
2016-01-01
The Wigner function provides a useful quasiprobability representation of quantum mechanics, with applications in various branches of physics. Many nice properties of the Wigner function are intimately connected with the high symmetry of the underlying operator basis composed of phase point operators: any pair of phase point operators can be transformed to any other pair by a unitary symmetry transformation. We prove that, in the discrete scenario, this permutation symmetry is equivalent to the symmetry group being a unitary 2 design. Such a highly symmetric representation can only appear in odd prime power dimensions besides dimensions 2 and 8. It suffices to single out a unique discrete Wigner function among all possible quasiprobability representations. In the course of our study, we show that this discrete Wigner function is uniquely determined by Clifford covariance, while no Wigner function is Clifford covariant in any even prime power dimension.
The Fractional Metric Dimension of Permutation Graphs
Institute of Scientific and Technical Information of China (English)
Eunjeong YI
2015-01-01
Let G = (V (G), E(G)) be a graph with vertex set V (G) and edge set E(G). For two distinct vertices x and y of a graph G, let RG{x, y}denote the set of vertices z such that the distance from x to z is not equal to the distance from y to z in G. For a function g defined on V (G) and for U ⊆V (G), let g(U )=? s∈U g(s). A real-valued function g:V (G)→[0, 1] is a resolving function of G if g(RG{x, y})≥1 for any two distinct vertices x, y∈V (G). The fractional metric dimension dimf (G) of a graph G is min{g(V (G)):g is a resolving function of G}. Let G1 and G2 be disjoint copies of a graph G, and let σ : V (G1) → V (G2) be a bijection. Then, a permutation graph Gσ = (V,E) has the vertex set V = V (G1)∪V (G2) and the edge set E = E(G1)∪E(G2)∪{uv|v = σ(u)}. First, we determine dimf (T ) for any tree T . We show that 1 0, there exists a permutation graph Gσ such that dimf (Gσ)−1dimf (Gσ) for all pairs (G,σ). Furthermore, we investigate dimf (Gσ) when G is a complete k-partite graph or a cycle.
Permutation Centralizer Algebras and Multi-Matrix Invariants
Mattioli, Paolo
2016-01-01
We introduce a class of permutation centralizer algebras which underly the combinatorics of multi-matrix gauge invariant observables. One family of such non-commutative algebras is parametrised by two integers. Its Wedderburn-Artin decomposition explains the counting of restricted Schur operators, which were introduced in the physics literature to describe open strings attached to giant gravitons and were subsequently used to diagonalize the Gaussian inner product for gauge invariants of 2-matrix models. The structure of the algebra, notably its dimension, its centre and its maximally commuting sub-algebra, is related to Littlewood-Richardson numbers for composing Young diagrams. It gives a precise characterization of the minimal set of charges needed to distinguish arbitrary matrix gauge invariants, which are related to enhanced symmetries in gauge theory. The algebra also gives a star product for matrix invariants. The centre of the algebra allows efficient computation of a sector of multi-matrix correlator...
An improved permutation-diffusion type image cipher with a chaotic orbit perturbing mechanism.
Chen, Jun-xin; Zhu, Zhi-liang; Fu, Chong; Yu, Hai
2013-11-18
During the past decades, chaos-based permutation-diffusion type image cipher has been widely investigated to meet the increasing demand for real-time secure image transmission over public networks. However, the existing researches almost exclusively focus on the improvements of the permutation and diffusion methods independently, without consideration of cooperation between the two processes. In this paper, an improved permutation-diffusion type image cipher with a chaotic orbit perturbing mechanism is proposed. In the permutation stage, pixels in the plain image are shuffled with a pixel-swapping mechanism, and the pseudorandom locations are generated by chaotic logistic map iteration. Furthermore, a plain pixel related chaotic orbit perturbing mechanism is introduced. As a result, a tiny change in plain image will be spread out during the confusion process, and hence an effective diffusion effect is introduced. By using a reverse direction diffusion method, the introduced diffusion effect will be further diffused to the whole cipher image within one overall encryption round. Simulation results and extensive cryptanalysis justify that the proposed scheme has a satisfactory security with a low computational complexity, which renders it a good candidate for real-time secure image storage and distribution applications.
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
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/
Understanding 3-manifolds in the context of permutations
Null, Karoline P
2011-01-01
We demonstrate how a 3-manifold, a Heegaard diagram, and a group presentation can each be interpreted as a pair of signed permutations in the symmetric group $S_d.$ We demonstrate the power of permutation data in programming and discuss an algorithm we have developed that takes the permutation data as input and determines whether the data represents a closed 3-manifold. We therefore have an invariant of groups, that is given any group presentation, we can determine if that presentation presents a closed 3-manifold.
APE: Authenticated Permutation-Based Encryption for Lightweight Cryptography
DEFF Research Database (Denmark)
Andreeva, Elena; Bilgin, Begül; Bogdanov, Andrey
2015-01-01
of cryptographic schemes actually require the nonce assumption for their security. In this paper, we propose APE as the first permutation-based authenticated encryption scheme that is resistant against nonce misuse. We formally prove that APE is secure, based on the security of the underlying permutation......, and Spongent. For any of these permutations, an implementation that supports both encryption and decryption requires less than 1.9 kGE and 2.8 kGE for 80-bit and 128-bit security levels, respectively....
Succinct Representations of Permutations and Functions
Munro, J Ian; Raman, Venkatesh; Rao, S Srinivasa
2011-01-01
We investigate the problem of succinctly representing an arbitrary permutation, \\pi, on {0,...,n-1} so that \\pi^k(i) can be computed quickly for any i and any (positive or negative) integer power k. A representation taking (1+\\epsilon) n lg n + O(1) bits suffices to compute arbitrary powers in constant time, for any positive constant \\epsilon <= 1. A representation taking the optimal \\ceil{\\lg n!} + o(n) bits can be used to compute arbitrary powers in O(lg n / lg lg n) time. We then consider the more general problem of succinctly representing an arbitrary function, f: [n] \\rightarrow [n] so that f^k(i) can be computed quickly for any i and any integer power k. We give a representation that takes (1+\\epsilon) n lg n + O(1) bits, for any positive constant \\epsilon <= 1, and computes arbitrary positive powers in constant time. It can also be used to compute f^k(i), for any negative integer k, in optimal O(1+|f^k(i)|) time. We place emphasis on the redundancy, or the space beyond the information-theoretic l...
Constrained Metric Learning by Permutation Inducing Isometries.
Bosveld, Joel; Mahmood, Arif; Huynh, Du Q; Noakes, Lyle
2016-01-01
The choice of metric critically affects the performance of classification and clustering algorithms. Metric learning algorithms attempt to improve performance, by learning a more appropriate metric. Unfortunately, most of the current algorithms learn a distance function which is not invariant to rigid transformations of images. Therefore, the distances between two images and their rigidly transformed pair may differ, leading to inconsistent classification or clustering results. We propose to constrain the learned metric to be invariant to the geometry preserving transformations of images that induce permutations in the feature space. The constraint that these transformations are isometries of the metric ensures consistent results and improves accuracy. Our second contribution is a dimension reduction technique that is consistent with the isometry constraints. Our third contribution is the formulation of the isometry constrained logistic discriminant metric learning (IC-LDML) algorithm, by incorporating the isometry constraints within the objective function of the LDML algorithm. The proposed algorithm is compared with the existing techniques on the publicly available labeled faces in the wild, viewpoint-invariant pedestrian recognition, and Toy Cars data sets. The IC-LDML algorithm has outperformed existing techniques for the tasks of face recognition, person identification, and object classification by a significant margin.
Multiscale permutation entropy analysis of electrocardiogram
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.
Data Hiding by LSB Substitution Using Genetic Optimal Key-Permutation
Directory of Open Access Journals (Sweden)
Marghny Mohamed
2011-01-01
Full Text Available The least significant bit (LSB embedding method is one of the most commonly used techniques; it targets the LSB'sof the host image to hide the data. This paper deals with three main steganography challenges (i.e. capacity, imperceptibility,and security. This is achieved by hybrid data hiding scheme incorporates LSB technique with a key-permutation method. Thepaper also proposes an optimal key permutation method using genetic algorithms for best key selection. Both normal andoptimized methods are tested with standard images, varying both data size as well as key space. Final experimental resultsshow decrement in computation time when increasing number of keys, at the same time system security improves.
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 Comparative Study on the Performance of Permutation Algorithms
Bassil, Youssef
2012-01-01
Permutation is the different arrangements that can be made with a given number of things taking some or all of them at a time. The notation P(n,r) is used to denote the number of permutations of n things taken r at a time. Permutation is used in various fields such as mathematics, group theory, statistics, and computing, to solve several combinatorial problems such as the job assignment problem and the traveling salesman problem. In effect, permutation algorithms have been studied and experimented for many years now. Bottom-Up, Lexicography, and Johnson-Trotter are three of the most popular permutation algorithms that emerged during the past decades. In this paper, we are implementing three of the most eminent permutation algorithms, they are respectively: Bottom-Up, Lexicography, and Johnson-Trotter algorithms. The implementation of each algorithm will be carried out using two different approaches: brute-force and divide and conquer. The algorithms codes will be tested using a computer simulation tool to mea...
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.
Break the Ties for NEH Heuristic in Solving the Permutation Flow Shop Problems
Institute of Scientific and Technical Information of China (English)
GAO Shou-wei; LEISTEN Rainer; DAI Yang; ZHANG Wei-dong
2008-01-01
This study deals with the Permutation Flow Shop Scheduling Problem (PFSP) based on the maximum completion time (makespan). NEH (the algorithm of Nawaz, Enscore and Ham) is the concluded most efficient constructive method in solving this NP-hard problem. The principal features of its strengths are the initial arrangement of jobs and the job insertion phase. In some instances, ties will occur in both the initial permutation and the partial sequences. The problem of ties breaking may have a significant impact on the NEH performance, but evaluate all the ties will be non-polynomial in the worst case. Several kinds of methods are presented in the paper to break the ties in a quick time. Together with the basic one, all 22 methods are tested on the famous Taillard's benchmarks and the most suitable ties breaking policy is recommended.
Li, Yueping; Wang, Chunhua; Chen, Hua
2017-03-01
Recently, a number of chaos-based image encryption algorithms that use low-dimensional chaotic map and permutation-diffusion architecture have been proposed. However, low-dimensional chaotic map is less safe than high-dimensional chaotic system. And permutation process is independent of plaintext and diffusion process. Therefore, they cannot resist efficiently the chosen-plaintext attack and chosen-ciphertext attack. In this paper, we propose a hyper-chaos-based image encryption algorithm. The algorithm adopts a 5-D multi-wing hyper-chaotic system, and the key stream generated by hyper-chaotic system is related to the original image. Then, pixel-level permutation and bit-level permutation are employed to strengthen security of the cryptosystem. Finally, a diffusion operation is employed to change pixels. Theoretical analysis and numerical simulations demonstrate that the proposed algorithm is secure and reliable for image encryption.
Model Correction Factor Method
DEFF Research Database (Denmark)
Christensen, Claus; Randrup-Thomsen, Søren; Morsing Johannesen, Johannes
1997-01-01
The model correction factor method is proposed as an alternative to traditional polynomial based response surface techniques in structural reliability considering a computationally time consuming limit state procedure as a 'black box'. The class of polynomial functions is replaced by a limit...... statebased on an idealized mechanical model to be adapted to the original limit state by the model correction factor. Reliable approximations are obtained by iterative use of gradient information on the original limit state function analogously to previous response surface approaches. However, the strength...... of the model correction factor method, is that in simpler form not using gradient information on the original limit state function or only using this information once, a drastic reduction of the number of limit state evaluation is obtained together with good approximations on the reliability. Methods...
A permutation testing framework to compare groups of brain networks
Directory of Open Access Journals (Sweden)
Sean L Simpson
2013-11-01
Full Text Available 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.
A permutation testing framework to compare groups of brain networks
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. PMID:24324431
Directory of Open Access Journals (Sweden)
S Natarajan
2013-08-01
Full Text Available Paramount importance for an automated face recognition system is the ability to enhance discriminatory power with a low-dimensional feature representation. Keeping this as a focal point, we present a novel approach for face recognition by formulating the problem of face tagging in terms of permutation. Using a fundamental concept that, dominant pixels of a person will remain dominant under varying illuminations, we develop a Permutation Matrix (PM based approach for representing face images. The proposed method is extensively evaluated on several benchmark databases under different exemplary evaluation protocols reported in the literature. Experimental results and comparative study with state-of-the-art methods suggest that the proposed approach provides a better representation of face, thereby achieving higher efficacy and lower error rates.
Permutation Correction in the Frequency Domain in Blind Separation of Speech Mixtures
Directory of Open Access Journals (Sweden)
Pham DT
2006-01-01
Full Text Available This paper presents a method for blind separation of convolutive mixtures of speech signals, based on the joint diagonalization of the time varying spectral matrices of the observation records. The main and still largely open problem in a frequency domain approach is permutation ambiguity. In an earlier paper of the authors, the continuity of the frequency response of the unmixing filters is exploited, but it leaves some frequency permutation jumps. This paper therefore proposes a new method based on two assumptions. The frequency continuity of the unmixing filters is still used in the initialization of the diagonalization algorithm. Then, the paper introduces a new method based on the time-frequency representations of the sources. They are assumed to vary smoothly with frequency. This hypothesis of the continuity of the time variation of the source energy is exploited on a sliding frequency bandwidth. It allows us to detect the remaining frequency permutation jumps. The method is compared with other approaches and results on real world recordings demonstrate superior performances of the proposed algorithm.
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
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
Weck, Peter J; Brown, Michael R; Wicks, Robert T
2014-01-01
The Bandt-Pompe permutation entropy and the Jensen-Shannon statistical complexity are used to analyze fluctuating time series of three different plasmas: the magnetohydrodynamic (MHD) turbulence in the plasma wind tunnel of the Swarthmore Spheromak Experiment (SSX), drift-wave turbulence of ion saturation current fluctuations in the edge of the Large Plasma Device (LAPD) and fully-developed turbulent magnetic fluctuations of the solar wind taken from the WIND spacecraft. The entropy and complexity values are presented as coordinates on the CH plane for comparison among the different plasma environments and other fluctuation models. The solar wind is found to have the highest permutation entropy and lowest statistical complexity of the three data sets analyzed. Both laboratory data sets have larger values of statistical complexity, suggesting these systems have fewer degrees of freedom in their fluctuations, with SSX magnetic fluctuations having slightly less complexity than the LAPD edge fluctuations. The CH ...
Fine-grained permutation entropy as a measure of natural complexity for time series
Institute of Scientific and Technical Information of China (English)
Liu Xiao-Feng; Wang Yue
2009-01-01
In a recent paper [2002 Phys. Rev. Lett. 88 174102], Bandt and Pompe propose permutation entropy (PE)as a natural complexity measure for arbitrary time series which may be stationary or nonstationary, deterministic or stochastic. Their method is based on a comparison of neighbouring values. This paper further develops PE, and proposes the concept of fine-grained PE (FGPE) defined by the order pattern and magnitude of the difference between neighbouring values. This measure excludes the case where vectors with a distinct appearance are mistakenly mapped onto the same permutation type, and consequently FGPE becomes more sensitive to the dynamical change of time series than does PE, according to our simulation and experimental results.
Ground states of fermionic lattice Hamiltonians with permutation symmetry
Kraus, Christina V.; Lewenstein, Maciej; Cirac, J. Ignacio
2013-08-01
We study the ground states of lattice Hamiltonians that are invariant under permutations, in the limit where the number of lattice sites N→∞. For spin systems, these are product states, a fact that follows directly from the quantum de Finetti theorem. For fermionic systems, however, the problem is very different, since mode operators acting on different sites do not commute, but anticommute. We construct a family of fermionic states, F, from which such ground states can be easily computed. They are characterized by few parameters whose number only depends on M, the number of modes per lattice site. We also give an explicit construction for M=1,2. In the first case, F is contained in the set of Gaussian states, whereas in the second it is not. Inspired by that construction, we build a set of fermionic variational wave functions, and apply it to the Fermi-Hubbard model in two spatial dimensions, obtaining results that go beyond the generalized Hartree-Fock theory.
On the permutation combinatorics of worldsheet moduli space
Freidel, Laurent; Ramgoolam, Sanjaye
2014-01-01
Light-cone string diagrams have been used to reproduce the orbifold Euler characteristic of moduli spaces of punctured Riemann surfaces at low genus and with few punctures. Nakamura studied the meromorphic differential introduced by Giddings and Wolpert to characterise light-cone diagrams and introduced a class of graphs related to this differential. These Nakamura graphs were used to parametrise the cells in a light-cone cell decomposition of moduli space. We develop links between Nakamura graphs and realisations of the worldsheet as branched covers. This leads to a development of the combinatorics of Nakamura graphs in terms of permutation tuples. For certain classes of cells, including those of top dimension, there is a simple relation to Belyi maps, which allows us to use results from Hermitian and complex matrix models to give analytic formulae for the counting of cells at arbitrarily high genus. For the most general cells, we develop a new equivalence relation on Hurwitz classes which organises the cell...
Circular permutation of a synthetic eukaryotic chromosome with the telomerator
Mitchell, Leslie A.; Boeke, Jef D.
2014-01-01
Chromosome engineering is a major focus in the fields of systems biology, genetics, synthetic biology, and the functional analysis of genomes. Here, we describe the “telomerator,” a new synthetic biology device for use in Saccharomyces cerevisiae. The telomerator is designed to inducibly convert circular DNA molecules into mitotically stable, linear chromosomes replete with functional telomeres in vivo. The telomerator cassette encodes convergent yeast telomere seed sequences flanking the I-SceI homing endonuclease recognition site in the center of an intron artificially transplanted into the URA3 selectable/counterselectable auxotrophic marker. We show that inducible expression of the homing endonuclease efficiently generates linear molecules, identified by using a simple plate-based screening method. To showcase its functionality and utility, we use the telomerator to circularly permute a synthetic yeast chromosome originally constructed as a circular molecule, synIXR, to generate 51 linear variants. Many of the derived linear chromosomes confer unexpected phenotypic properties. This finding indicates that the telomerator offers a new way to study the effects of gene placement on chromosomes (i.e., telomere proximity). However, that the majority of synIXR linear derivatives support viability highlights inherent tolerance of S. cerevisiae to changes in gene order and overall chromosome structure. The telomerator serves as an important tool to construct artificial linear chromosomes in yeast; the concept can be extended to other eukaryotes. PMID:25378705
Enumeration of snakes and cycle-alternating permutations
Josuat-Vergès, Matthieu
2010-01-01
Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman established a link between Springer numbers, snakes, and some polynomials related with the successive derivatives of trigonometric functions. The goal of this article is to give further combinatorial properties of derivative polynomials, in terms of snakes and other objects: cycle-alternating permutations, weighted Dyck or Motzkin paths, increasing trees and forests. We obtain the generating functions, in terms of trigonometric functions for exponential ones and in terms of J-fractions for ordinary ones. We also define natural q-analogs, make a link with normal ordering problems and combinatorial theory of differential equations.
Weck, P J; Schaffner, D A; Brown, M R; Wicks, R T
2015-02-01
The Bandt-Pompe permutation entropy and the Jensen-Shannon statistical complexity are used to analyze fluctuating time series of three different turbulent plasmas: the magnetohydrodynamic (MHD) turbulence in the plasma wind tunnel of the Swarthmore Spheromak Experiment (SSX), drift-wave turbulence of ion saturation current fluctuations in the edge of the Large Plasma Device (LAPD), and fully developed turbulent magnetic fluctuations of the solar wind taken from the Wind spacecraft. The entropy and complexity values are presented as coordinates on the CH plane for comparison among the different plasma environments and other fluctuation models. The solar wind is found to have the highest permutation entropy and lowest statistical complexity of the three data sets analyzed. Both laboratory data sets have larger values of statistical complexity, suggesting that these systems have fewer degrees of freedom in their fluctuations, with SSX magnetic fluctuations having slightly less complexity than the LAPD edge I(sat). The CH plane coordinates are compared to the shape and distribution of a spectral decomposition of the wave forms. These results suggest that fully developed turbulence (solar wind) occupies the lower-right region of the CH plane, and that other plasma systems considered to be turbulent have less permutation entropy and more statistical complexity. This paper presents use of this statistical analysis tool on solar wind plasma, as well as on an MHD turbulent experimental plasma.
Normal approximations for descents and inversions of permutations of multisets
Conger, Mark; Viswanath, D.
2005-01-01
Normal approximations for descents and inversions of permutations of the set $\\{1,2,...,n\\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated by such examples, we consider the number of inversions of a permutation $\\pi(1), \\pi(2),...,\\pi(n)$ of a multiset with $n$ elements, which is the number of pairs $(i,j)$ with $1\\leq i \\pi(j)$. The number of descents is the number of...
Permutation entropy of fractional Brownian motion and fractional Gaussian noise
Energy Technology Data Exchange (ETDEWEB)
Zunino, L. [Centro de Investigaciones Opticas, C.C. 124 Correo Central, 1900 La Plata (Argentina); Departamento de Ciencias Basicas, Facultad de Ingenieria, Universidad Nacional de La Plata (UNLP), 1900 La Plata (Argentina); Departamento de Fisica, Facultad de Ciencias Exactas, Universidad Nacional de La Plata, 1900 La Plata (Argentina)], E-mail: lucianoz@ciop.unlp.edu.ar; Perez, D.G. [Instituto de Fisica, Pontificia Universidad Catolica de Valparaiso (PUCV), 23-40025 Valparaiso (Chile)], E-mail: dario.perez@ucv.cl; Martin, M.T. [Instituto de Fisica (IFLP), Facultad de Ciencias Exactas, Universidad Nacional de La Plata and Argentina' s National Council (CCT-CONICET), C.C. 727, 1900 La Plata (Argentina)], E-mail: mtmartin@fisica.unlp.edu.ar; Garavaglia, M. [Centro de Investigaciones Opticas, C.C. 124 Correo Central, 1900 La Plata (Argentina); Departamento de Fisica, Facultad de Ciencias Exactas, Universidad Nacional de La Plata, 1900 La Plata (Argentina)], E-mail: garavagliam@ciop.unlp.edu.ar; Plastino, A. [Instituto de Fisica (IFLP), Facultad de Ciencias Exactas, Universidad Nacional de La Plata and Argentina' s National Council (CCT-CONICET), C.C. 727, 1900 La Plata (Argentina)], E-mail: plastino@fisica.unlp.edu.ar; Rosso, O.A. [Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine, School of Electrical Engineering and Computer Science, The University of Newcastle, University Drive, Callaghan NSW 2308 (Australia); Chaos and Biology Group, Instituto de Calculo, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Pabellon II, Ciudad Universitaria, 1428 Ciudad de Buenos Aires (Argentina)], E-mail: oarosso@fibertel.com.ar
2008-06-30
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.
Mixing Times of Self-Organizing Lists and Biased Permutations
Bhakta, Prateek; Randall, Dana; Streib, Amanda Pascoe
2012-01-01
Sampling permutations from S_n is a fundamental problem from probability theory. The nearest neighbor transposition chain \\cal{M}}_{nn} is known to converge in time \\Theta(n^3 \\log n) in the uniform case and time \\Theta(n^2) in the constant bias case, in which we put adjacent elements in order with probability p \
Boson permutation and parity operators: Lie algebra and applications
Energy Technology Data Exchange (ETDEWEB)
Campos, Richard A. [Department of Physics and Astronomy, Lehman College, City University of New York, 250 Bedford Boulevard West, Bronx, NY 10468-1589 (United States)]. E-mail: richard.campos@mailaps.org; Gerry, Christopher C. [Department of Physics and Astronomy, Lehman College, City University of New York, 250 Bedford Boulevard West, Bronx, NY 10468-1589 (United States)
2006-08-14
We show that dichotomic permutation and parity operators for a two-dimensional boson system form an su(2) algebra with a unitary operator that relates, in quantum optics, to a balanced beamsplitter. The algebra greatly simplifies the input-output transformations of states through quantum nonlinear systems such as the Kerr interferometer or the kicked top.
SELF-DUAL PERMUTATION CODES OVER FORMAL POWER SERIES RINGS AND FINITE PRINCIPAL IDEAL RINGS
Institute of Scientific and Technical Information of China (English)
张光辉; 刘宏伟
2013-01-01
In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power series rings. These results allow for obtaining some conditions for non-existence of self-dual permutation codes over formal power series rings. Finally, we describe self-dual permutation codes over finite principal ideal rings by examining permutation codes over their component chain rings.
Constructing parallel long-message signcryption scheme from trapdoor permutation
Institute of Scientific and Technical Information of China (English)
HU ZhenYu; LIN DongDai; WU WenLing; FENG DengGuo
2007-01-01
A highly practical parallel signcryption scheme named PLSC from trapdoor permutations (TDPs for short) was built to perform long messages directly. The new scheme follows the idea "scramble all, and encrypt small", using some scrambling operation on message m along with the user's identities, and then passing, in parallel, small parts of the scrambling result through corresponding TDPs. This design enables the scheme to flexibly perform long messages of arbitrary length while avoid repeatedly invoking TDP operations such as the CBC mode, or verbosely black-box composing symmetric encryption and signcryption, resulting in noticeable practical savings in both message bandwidth and efficiency. Concretely, the signcryption scheme requires exactly one computation of the "receiver's TDP" (for "encryption") and one inverse computation of the "sender's TDP" (for "authentication"), which is of great practical significance in directly performing long messages, since the major bottleneck for many public encryption schemes is the excessive computational overhead of performing TDP operations. Cutting out the verbosely repeated padding, the newly proposed scheme is more efficient than a black-box hybrid scheme. Most importantly, the proposed scheme has been proven to be tightly semantically secure under adaptive chosen ciphertext attacks (IND-CCA2) and to provide integrity of ciphertext (INT-CTXT) as well as non-repudiation in the random oracle model. All of these security guarantees are provided in the full multi-user, insider-security setting. Moreover, though the scheme is designed to perform long messages, it may also be appropriate for settings where it is impractical to perform large block of messages (i.e. extremely low memory environments such as smart cards).
Particle Filter with State Permutations for Solving Image Jigsaw Puzzles
Yang, Xingwei; Adluru, Nagesh; Latecki, Longin Jan
2016-01-01
We deal with an image jigsaw puzzle problem, which is defined as reconstructing an image from a set of square and non-overlapping image patches. It is known that a general instance of this problem is NP-complete, and it is also challenging for humans, since in the considered setting the original image is not given. Recently a graphical model has been proposed to solve this and related problems. The target label probability function is then maximized using loopy belief propagation. We also formulate the problem as maximizing a label probability function and use exactly the same pairwise potentials. Our main contribution is a novel inference approach in the sampling framework of Particle Filter (PF). Usually in the PF framework it is assumed that the observations arrive sequentially, e.g., the observations are naturally ordered by their time stamps in the tracking scenario. Based on this assumption, the posterior density over the corresponding hidden states is estimated. In the jigsaw puzzle problem all observations (puzzle pieces) are given at once without any particular order. Therefore, we relax the assumption of having ordered observations and extend the PF framework to estimate the posterior density by exploring different orders of observations and selecting the most informative permutations of observations. This significantly broadens the scope of applications of the PF inference. Our experimental results demonstrate that the proposed inference framework significantly outperforms the loopy belief propagation in solving the image jigsaw puzzle problem. In particular, the extended PF inference triples the accuracy of the label assignment compared to that using loopy belief propagation.
Multistage Off-Line Permutation Packet Routing on a Mesh: An Approach with Elementary Mathematics
Institute of Scientific and Technical Information of China (English)
Kevin Chiew; Yingjiu Li
2009-01-01
Various methods have been proposed for off-line permutation packet routing on a mesh. One of the methods is known as multistage routing, in which the first stage is crucial. For the first stage of routing, the previous study normally converts it to a problem of graph theory and proves the existence of solutions. However, there is a lack of simple algorithms to the first stage of routing. This article presents an explicit and simple approach for the first stage of routing based on elementary mathematics.
Adaptive Tests of Significance Using Permutations of Residuals with R and SAS
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
Permutation approach, high frequency trading and variety of micro patterns in financial time series
Aghamohammadi, Cina; Ebrahimian, Mehran; Tahmooresi, Hamed
2014-11-01
Permutation approach is suggested as a method to investigate financial time series in micro scales. The method is used to see how high frequency trading in recent years has affected the micro patterns which may be seen in financial time series. Tick to tick exchange rates are considered as examples. It is seen that variety of patterns evolve through time; and that the scale over which the target markets have no dominant patterns, have decreased steadily over time with the emergence of higher frequency trading.
A Weak Quantum Blind Signature with Entanglement Permutation
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.
Computational Approaches to Consecutive Pattern Avoidance in Permutations
Nakamura, Brian
2011-01-01
In recent years, there has been increasing interest in consecutive pattern avoidance in permutations. In this paper, we introduce two approaches to counting permutations that avoid a set of prescribed patterns consecutively. These algoritms have been implemented in the accompanying Maple package CAV, which can be downloaded from the author's website. As a byproduct of the first algorithm, we have a theorem giving a sufficient condition for when two pattern sets are strongly (consecutively) Wilf-Equivalent. For the implementation of the second algorithm, we define the cluster tail generating function and show that it always satisfies a certain functional equation. We also explain how the CAV package can be used to approximate asymptotic constants for single pattern avoidance.
Optimizing streamflow monitoring networks using joint permutation entropy
Stosic, Tatijana; Stosic, Borko; Singh, Vijay P.
2017-09-01
Using joint permutation entropy we address the issue of minimizing the cost of monitoring, while minimizing redundancy of the information content, of daily streamflow data recorded during the period 1989-2016 at twelve gauging stations on Brazos River, Texas, USA. While the conventional entropy measures take into account only the probability of occurrence of a given set of events, permutation entropy also takes into account local ordering of the sequential values, thus enriching the analysis. We find that the best cost efficiency is achieved by performing weekly measurements, in comparison with which daily measurements exhibit information redundancy, and monthly measurements imply information loss. We also find that the cumulative information redundancy of the twelve considered stations is over 10% for the observed period, and that the number of monitoring stations can be reduced by half bringing the cumulative redundancy level to less than 1%.
Symbolic Detection of Permutation and Parity Symmetries of Evolution Equations
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.
Multivariate Permutation Polynomial Systems and Nonlinear Pseudorandom Number Generators
Ostafe, Alina
2009-01-01
In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques studied previously for inversive generators, we bound exponential sums along the orbits of these dynamical systems and show that they admit much stronger estimates on average over all initial values than in the general case and thus can be of use for pseudorandom number generation.
The torus and the Klein Bottle amplitude of permutation orbifolds
Kadar, Z
2000-01-01
The torus and the Klein bottle amplitude coefficients are computed in permutation orbifolds of RCFT-s in terms of the same quantities in the original theory and the twist group. An explicit expression is presented for the number of self conjugate primaries in the orbifold as a polynomial of the total number of primaries and the number of self conjugate ones in the parent theory. The formulae in the $Z_2$ orbifold illustrate the general results.
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.
A Note on Primitive Permutation Groups of Prime Power Degree
Qian Cai; Hua Zhang
2015-01-01
Primitive permutation groups of prime power degree are known to be affine type, almost simple type, and product action type. At the present stage finding an explicit classification of primitive groups of affine type seems untractable, while the product action type can usually be reduced to almost simple type. In this paper, we present a short survey of the development of primitive groups of prime power degree, together with a brief description on such groups.
Explorative methods in linear models
DEFF Research Database (Denmark)
Høskuldsson, Agnar
2004-01-01
The author has developed the H-method of mathematical modeling that builds up the model by parts, where each part is optimized with respect to prediction. Besides providing with better predictions than traditional methods, these methods provide with graphic procedures for analyzing different feat...... features in data. These graphic methods extend the well-known methods and results of Principal Component Analysis to any linear model. Here the graphic procedures are applied to linear regression and Ridge Regression....
Explorative methods in linear models
DEFF Research Database (Denmark)
Høskuldsson, Agnar
2004-01-01
The author has developed the H-method of mathematical modeling that builds up the model by parts, where each part is optimized with respect to prediction. Besides providing with better predictions than traditional methods, these methods provide with graphic procedures for analyzing different...... features in data. These graphic methods extend the well-known methods and results of Principal Component Analysis to any linear model. Here the graphic procedures are applied to linear regression and Ridge Regression....
Counting permutations with no long monotone subsequence via generating trees
Bousquet-Mélou, Mireille
2010-01-01
We recover Gessel's determinantal formula for the generating function of permutations with no ascending subsequence of length m+1. The starting point of our proof is the recursive construction of these permutations by insertion of the largest entry. This construction is of course extremely simple. The cost of this simplicity is that we need to take into account in the enumeration m-1 additional parameters --- namely, the positions of the leftmost increasing subsequences of length i, for i=2,...,m. This yields for the generating function a functional equation with m-1 "catalytic" variables, and the heart of the paper is the solution of this equation. We perform a similar task for involutions with no descending subsequence of length m+1, constructed recursively by adding a cycle containing the largest entry. We refine this result by keeping track of the number of fixed points. In passing, we prove that the ordinary generating functions of these families of permutations can be expressed as constant terms of rati...
Xu, Ye; Wang, Ling; Wang, Shengyao; Liu, Min
2014-09-01
In this article, an effective hybrid immune algorithm (HIA) is presented to solve the distributed permutation flow-shop scheduling problem (DPFSP). First, a decoding method is proposed to transfer a job permutation sequence to a feasible schedule considering both factory dispatching and job sequencing. Secondly, a local search with four search operators is presented based on the characteristics of the problem. Thirdly, a special crossover operator is designed for the DPFSP, and mutation and vaccination operators are also applied within the framework of the HIA to perform an immune search. The influence of parameter setting on the HIA is investigated based on the Taguchi method of design of experiment. Extensive numerical testing results based on 420 small-sized instances and 720 large-sized instances are provided. The effectiveness of the HIA is demonstrated by comparison with some existing heuristic algorithms and the variable neighbourhood descent methods. New best known solutions are obtained by the HIA for 17 out of 420 small-sized instances and 585 out of 720 large-sized instances.
A space-time permutation scan statistic for disease outbreak detection.
Directory of Open Access Journals (Sweden)
Martin Kulldorff
2005-03-01
Full Text Available BACKGROUND: The ability to detect disease outbreaks early is important in order to minimize morbidity and mortality through timely implementation of disease prevention and control measures. Many national, state, and local health departments are launching disease surveillance systems with daily analyses of hospital emergency department visits, ambulance dispatch calls, or pharmacy sales for which population-at-risk information is unavailable or irrelevant. METHODS AND FINDINGS: We propose a prospective space-time permutation scan statistic for the early detection of disease outbreaks that uses only case numbers, with no need for population-at-risk data. It makes minimal assumptions about the time, geographical location, or size of the outbreak, and it adjusts for natural purely spatial and purely temporal variation. The new method was evaluated using daily analyses of hospital emergency department visits in New York City. Four of the five strongest signals were likely local precursors to citywide outbreaks due to rotavirus, norovirus, and influenza. The number of false signals was at most modest. CONCLUSION: If such results hold up over longer study times and in other locations, the space-time permutation scan statistic will be an important tool for local and national health departments that are setting up early disease detection surveillance systems.
Son, Dae-Soon; Lee, DongHyuk; Lee, Kyusang; Jung, Sin-Ho; Ahn, Taejin; Lee, Eunjin; Sohn, Insuk; Chung, Jongsuk; Park, Woongyang; Huh, Nam; Lee, Jae Won
2015-02-01
An empirical method of sample size determination for building prediction models was proposed recently. Permutation method which is used in this procedure is a commonly used method to address the problem of overfitting during cross-validation while evaluating the performance of prediction models constructed from microarray data. But major drawback of such methods which include bootstrapping and full permutations is prohibitively high cost of computation required for calculating the sample size. In this paper, we propose that a single representative null distribution can be used instead of a full permutation by using both simulated and real data sets. During simulation, we have used a dataset with zero effect size and confirmed that the empirical type I error approaches to 0.05. Hence this method can be confidently applied to reduce overfitting problem during cross-validation. We have observed that pilot data set generated by random sampling from real data could be successfully used for sample size determination. We present our results using an experiment that was repeated for 300 times while producing results comparable to that of full permutation method. Since we eliminate full permutation, sample size estimation time is not a function of pilot data size. In our experiment we have observed that this process takes around 30min. With the increasing number of clinical studies, developing efficient sample size determination methods for building prediction models is critical. But empirical methods using bootstrap and permutation usually involve high computing costs. In this study, we propose a method that can reduce required computing time drastically by using representative null distribution of permutations. We use data from pilot experiments to apply this method for designing clinical studies efficiently for high throughput data.
Statistical Validation of Normal Tissue Complication Probability Models
Energy Technology Data Exchange (ETDEWEB)
Xu Chengjian, E-mail: c.j.xu@umcg.nl [Department of Radiation Oncology, University of Groningen, University Medical Center Groningen, Groningen (Netherlands); Schaaf, Arjen van der; Veld, Aart A. van' t; Langendijk, Johannes A. [Department of Radiation Oncology, University of Groningen, University Medical Center Groningen, Groningen (Netherlands); Schilstra, Cornelis [Department of Radiation Oncology, University of Groningen, University Medical Center Groningen, Groningen (Netherlands); Radiotherapy Institute Friesland, Leeuwarden (Netherlands)
2012-09-01
Purpose: To investigate the applicability and value of double cross-validation and permutation tests as established statistical approaches in the validation of normal tissue complication probability (NTCP) models. Methods and Materials: A penalized regression method, LASSO (least absolute shrinkage and selection operator), was used to build NTCP models for xerostomia after radiation therapy treatment of head-and-neck cancer. Model assessment was based on the likelihood function and the area under the receiver operating characteristic curve. Results: Repeated double cross-validation showed the uncertainty and instability of the NTCP models and indicated that the statistical significance of model performance can be obtained by permutation testing. Conclusion: Repeated double cross-validation and permutation tests are recommended to validate NTCP models before clinical use.
Learning Combinatorial Map Information from Permutations of Landmarks
2010-10-04
Learning Combinatorial Map Information from Permutations of Landmarks Benjamı́n Tovar ∗, Luigi Freda†, and Steven M. LaValle‡ Abstract This paper...is B. Tovar . This work was founded by NSF grant 0904501 (IIS robotics), DARPA SToMP grant HR0011-05-1-0008, and MURI/ONR grant N00014-09-1-1052. ∗B... Tovar is with the Dept. of Mechanical Engineering, Northwestern University, 2145 Sheridan Road, Evanston, IL 602081, USA. email: b- tovar
Genuine multipartite nonlocality of permutationally invariant Gaussian states
Xu, Buqing; Adesso, Gerardo
2016-01-01
We investigate genuine multipartite nonlocality of pure permutationally invariant multimode Gaussian states of continuous variable systems, as detected by the violation of Svetlichny inequality. We identify the phase space settings leading to the largest violation of the inequality when using displaced parity measurements, distinguishing between even and odd number of modes. We further consider pseudospin measurements and show that, for three-mode states with asymptotically large squeezing degree, particular settings of these measurements allow one to approach the maximum violation allowed by quantum mechanics. This indicates that the highest possible genuine multipartite quantum nonlocality is in principle verifiable on Gaussian states.
Dyck Paths, Standard Young Tableaux, and Pattern Avoiding Permutations
Gudmundsson, Hilmar
2009-01-01
We present a generating function and a closed counting formula in two variables that enumerate a family of classes of permutations that avoid or contain an increasing pattern of length three and have a prescribed number of occurrences of another pattern of length three. This gives a refinement of some previously studied statistics, most notably one by Noonan. The formula is also shown to enumerate a family of classes of Dyck paths and Standard Young Tableaux, and a bijection is given between the corresponding classes of these two families of objects. Finally, the results obtained are used to solve an optimization problem for a certain card game.
Some open questions in the theory of generalized permutable subgroups
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
A subgroup H of a group G is said to be weakly s-supplemented in G if H has a supplement T in G such that H ∩ T HsG, where HsG is the largest s-permutable subgroup of G contained in H. This paper constructs an example to show that the open questions 6.3 and 6.4 in J Algebra, 315: 192–209 (2007) have negative solutions, and shows that in many cases Question 6.4 is positive. A series of known results are unified and generalized.
Security of the Five-Round KASUMI Type Permutation
Iwata, Tetsu; Yagi, Tohru; Kurosawa, Kaoru
KASUMI is a blockcipher that forms the heart of the 3GPP confidentiality and integrity algorithms. In this paper, we study the security of the five-round KASUMI type permutations, and derive a highly non-trivial security bound against adversaries with adaptive chosen plaintext and chosen ciphertext attacks. To derive our security bound, we heavily use the tools from graph theory. However the result does not show its super-pseudorandomness, this gives us a strong evidence that the design of KASUMI is sound.
Permutation Groups with Bounded Movement having Maximum Orbits
Indian Academy of Sciences (India)
Mehdi Alaeiyan; Behnam Razzaghmaneshi
2012-05-01
Let be a permutation group on a set with no fixed points in and let be a positive integer. If no element of moves any subset of by more than points (that is, $|^g\\backslash|≤ m$ for every $\\subseteq$ and $g\\in G$), and also if each -orbit has size greater than 2, then the number of -orbits in is at most $\\frac{1}{2}(3m-1)$. Moreover, the equality holds if and only if is an elementary abelian 3-group.
Directory of Open Access Journals (Sweden)
Zhijie Bian
2016-08-01
Full Text Available Diabetes is a significant public health issue as it increases the risk for dementia and Alzheimer’s disease (AD. In this study, we aim to investigate whether weighted-permutation entropy (WPE and permutation entropy (PE of resting-state EEG (rsEEG could be applied as potential objective biomarkers to distinguish type 2 diabetes patients with amnestic mild cognitive impairment (aMCI from those with normal cognitive function. rsEEG series were acquired from 28 patients with type 2 diabetes (16 aMCI patients and 12 controls, and neuropsychological assessments were performed. The rsEEG signals were analysed using WPE and PE methods. The correlations between the PE or WPE of the rsEEG and the neuropsychological assessments were analysed as well. The WPE in the right temporal (RT region of the aMCI diabetics was lower than the controls, and the WPE was significantly positively correlated to the scores of the Auditory Verbal Learning Test (AVLT (AVLT-Immediate recall, AVLT-Delayed recall, AVLT-Delayed recognition and the Wechsler Adult Intelligence Scale Digit Span Test (WAIS-DST. These findings were not obtained with PE. We concluded that the WPE of rsEEG recordings could distinguish aMCI diabetics from normal cognitive function diabetic controls among the current sample of diabetic patients. Thus, the WPE could be a potential index for assisting diagnosis of aMCI in type 2 diabetes.
The Permutation Groups and the Equivalence of Cyclic and Quasi-Cyclic Codes
Guenda, Kenza
2010-01-01
We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two cyclic codes of length p^r can be equivalent. We also find the set of permutations by which two quasi-cyclic codes can be equivalent.
Method for gesture based modeling
DEFF Research Database (Denmark)
2006-01-01
A computer program based method is described for creating models using gestures. On an input device, such as an electronic whiteboard, a user draws a gesture which is recognized by a computer program and interpreted relative to a predetermined meta-model. Based on the interpretation, an algorithm...... is assigned to the gesture drawn by the user. The executed algorithm may, for example, consist in creating a new model element, modifying an existing model element, or deleting an existing model element....
Methods of statistical model estimation
Hilbe, Joseph
2013-01-01
Methods of Statistical Model Estimation examines the most important and popular methods used to estimate parameters for statistical models and provide informative model summary statistics. Designed for R users, the book is also ideal for anyone wanting to better understand the algorithms used for statistical model fitting. The text presents algorithms for the estimation of a variety of regression procedures using maximum likelihood estimation, iteratively reweighted least squares regression, the EM algorithm, and MCMC sampling. Fully developed, working R code is constructed for each method. Th
On the difference between permutation poynomials over finite fields
DEFF Research Database (Denmark)
Anbar Meidl, Nurdagül; Odzak, Almasa; Patel, Vandita
2017-01-01
The well-known Chowla and Zassenhaus conjecture, proven by Cohen in 1990, states that if p > (d 2 − 3d + 4)2 , then there is no complete mapping polynomial f in Fp[x] of degree d ≥ 2. For arbitrary finite fields Fq, a similar non-existence result is obtained recently by I¸sık, Topuzo˘glu and Wint......The well-known Chowla and Zassenhaus conjecture, proven by Cohen in 1990, states that if p > (d 2 − 3d + 4)2 , then there is no complete mapping polynomial f in Fp[x] of degree d ≥ 2. For arbitrary finite fields Fq, a similar non-existence result is obtained recently by I¸sık, Topuzo......˘glu and Winterhof in terms of the Carlitz rank of f. Cohen, Mullen and Shiue generalized the Chowla-Zassenhaus-Cohen Theorem significantly in 1995, by considering differences of permutation polynomials. More precisely, they showed that if f and f + g are both permutation polynomials of degree d ≥ 2 over Fp, with p...
Genetic algorithms with permutation coding for multiple sequence alignment.
Ben Othman, Mohamed Tahar; Abdel-Azim, Gamil
2013-08-01
Multiple sequence alignment (MSA) is one of the topics of bio informatics that has seriously been researched. It is known as NP-complete problem. It is also considered as one of the most important and daunting tasks in computational biology. Concerning this a wide number of heuristic algorithms have been proposed to find optimal alignment. Among these heuristic algorithms are genetic algorithms (GA). The GA has mainly two major weaknesses: it is time consuming and can cause local minima. One of the significant aspects in the GA process in MSA is to maximize the similarities between sequences by adding and shuffling the gaps of Solution Coding (SC). Several ways for SC have been introduced. One of them is the Permutation Coding (PC). We propose a hybrid algorithm based on genetic algorithms (GAs) with a PC and 2-opt algorithm. The PC helps to code the MSA solution which maximizes the gain of resources, reliability and diversity of GA. The use of the PC opens the area by applying all functions over permutations for MSA. Thus, we suggest an algorithm to calculate the scoring function for multiple alignments based on PC, which is used as fitness function. The time complexity of the GA is reduced by using this algorithm. Our GA is implemented with different selections strategies and different crossovers. The probability of crossover and mutation is set as one strategy. Relevant patents have been probed in the topic.
Statistical validation of normal tissue complication probability models.
Xu, Cheng-Jian; van der Schaaf, Arjen; Van't Veld, Aart A; Langendijk, Johannes A; Schilstra, Cornelis
2012-09-01
To investigate the applicability and value of double cross-validation and permutation tests as established statistical approaches in the validation of normal tissue complication probability (NTCP) models. A penalized regression method, LASSO (least absolute shrinkage and selection operator), was used to build NTCP models for xerostomia after radiation therapy treatment of head-and-neck cancer. Model assessment was based on the likelihood function and the area under the receiver operating characteristic curve. Repeated double cross-validation showed the uncertainty and instability of the NTCP models and indicated that the statistical significance of model performance can be obtained by permutation testing. Repeated double cross-validation and permutation tests are recommended to validate NTCP models before clinical use. Copyright © 2012 Elsevier Inc. All rights reserved.
Directory of Open Access Journals (Sweden)
Wang Yong
2006-09-01
Full Text Available Abstract Background Protein structure comparison is one of the most important problems in computational biology and plays a key role in protein structure prediction, fold family classification, motif finding, phylogenetic tree reconstruction and protein docking. Results We propose a novel method to compare the protein structures in an accurate and efficient manner. Such a method can be used to not only reveal divergent evolution, but also identify circular permutations and further detect active-sites. Specifically, we define the structure alignment as a multi-objective optimization problem, i.e., maximizing the number of aligned atoms and minimizing their root mean square distance. By controlling a single distance-related parameter, theoretically we can obtain a variety of optimal alignments corresponding to different optimal matching patterns, i.e., from a large matching portion to a small matching portion. The number of variables in our algorithm increases with the number of atoms of protein pairs in almost a linear manner. In addition to solid theoretical background, numerical experiments demonstrated significant improvement of our approach over the existing methods in terms of quality and efficiency. In particular, we show that divergent evolution, circular permutations and active-sites (or structural motifs can be identified by our method. The software SAMO is available upon request from the authors, or from http://zhangroup.aporc.org/bioinfo/samo/ and http://intelligent.eic.osaka-sandai.ac.jp/chenen/samo.htm. Conclusion A novel formulation is proposed to accurately align protein structures in the framework of multi-objective optimization, based on a sequence order-independent strategy. A fast and accurate algorithm based on the bipartite matching algorithm is developed by exploiting the special features. Convergence of computation is shown in experiments and is also theoretically proven.
On permutation polynomials over ﬁnite ﬁelds: diﬀerences 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...
An upper bound on the number of high-dimensional permutations
Linial, Nathan
2011-01-01
What is the higher-dimensional analog of a permutation? If we think of a permutation as given by a permutation matrix, then the following definition suggests itself: A d-dimensional permutation of order n is an [n]^(d+1) array of zeros and ones in which every "line" contains a unique 1 entry. A line here is a set of entries of the form {(x_1,...,x_{i-1},y,x_{i+1},...,x_{d+1})}, for y between 1 and n, some index i between 1 and d+1 and some choice of x_j in [n] for all j except i. It is easy to observe that a one-dimensional permutation is simply a permutation matrix and that a two-dimensional permutation is synonymous with an order-n Latin square. We seek an estimate for the number of d-dimensional permutations. Our main result is the following upper bound on their number: ((1+o(1))(n/e^d))^(n^d). We tend to believe that this is actually the correct number, but the problem of proving the complementary lower bound remains open. Our main tool is an adaptation of Bregman's proof of the Minc conjecture on permane...
A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
DEFF Research Database (Denmark)
Leander, Gregor; Bracken, Carl
2010-01-01
cryptosystem should be a permutation. Also, it is required that the function is highly nonlinear so that it is resistant to Matsui’s linear attack. In this article we demonstrate that the highly nonlinear permutation f (x) = x22k+2k+1 on the field F24k , discovered by Hans Dobbertin (1998) [1], has...
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…
Minimal Degrees of Faithful Quasi-Permutation Representations for Direct Products of -Groups
Indian Academy of Sciences (India)
Ghodrat Ghaffarzadeh; Mohammad Hassan Abbaspour
2012-08-01
In [2], the algorithms of $c(G), q(G)$ and $p(G)$, the minimal degrees of faithful quasi-permutation and permutation representations of a finite group are given. The main purpose of this paper is to consider the relationship between these minimal degrees of non-trivial -groups and with the group × .
Exact Permutation Algorithm for Paired Observations: The Challenge of R. A. Fisher
Directory of Open Access Journals (Sweden)
J. I. Odiase
2007-01-01
Full Text Available The major handicap of permutation test is the logical and computational requirement necessary to develop and implement the exact permutation scheme. This study provides an algorithm that systematically enumerates all the distinct permutations of the paired observations in an experiment without the possibility of repeating any of the permutations. The permutation algorithm presented completely breaks down the permutation problem for ease of implementation and analysis. The algorithm was illustratively implemented in Intel Visual Fortran to recreate Fishers manual compilation of 32,768 permutations of Charles Darwins data on heights of cross-fertilized and self-fertilized plants. The algorithm provides exact p-values for any experiment involving paired observations and exposes the danger in using asymptotic or parametric distributions such as the t-test to analyze small data sets when the exact functional form of the distribution is not explicitly known. This becomes more obvious especially when the experiment leads to a p-value close to the threshold level of significance. The exact distribution and the graphical presentation provided in this study give credence to the use of the permutation test.
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Tarau, Paul
2008-01-01
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\\em ranking} and {\\em unranking} functions. Starting from a generalization of Ackerman's encoding of Hereditarily Finite Sets with Urelements and a novel tupling/untupling operation, we derive encodings for Finite Functions and use them as building blocks for an executable theory of {\\em Hereditarily Finite Functions}. The more difficult problem of {\\em ranking} and {\\em unranking} {\\em Hereditarily Finite Permutations} is then tackled using Lehmer codes and factoradics. The paper is organized as a self-contained literate Prolog program available at \\url{http://logic.csci.unt.edu/tarau/research/2008/pHFF.zip}
All possible permutational symmetries of a quantum system
Arnaud, Ludovic
2016-01-01
We investigate the intermediate permutational symmetries of a system of qubits that lie in between the perfect symmetric and antisymmetric cases. We prove that, on average, pure states of qubits picked at random with respect to the uniform measure on the unit sphere of the Hilbert space are almost as antisymmetric as they are allowed to be. We then observe that multipartite entanglement, measured by the generalized Meyer-Wallach measure, tends to be larger in subspaces that are more antisymmetric than the complete symmetric one. Eventually, we prove that all states contained in the most antisymmetric subspace are relevant multipartite entangled states in the sense that their 1-qubit reduced states are all maximally mixed.
Permutation Entropy Applied to Movement Behaviors of Drosophila Melanogaster
Liu, Yuedan; Chon, Tae-Soo; Baek, Hunki; Do, Younghae; Choi, Jin Hee; Chung, Yun Doo
Movement of different strains in Drosophila melanogaster was continuously observed by using computer interfacing techniques and was analyzed by permutation entropy (PE) after exposure to toxic chemicals, toluene (0.1 mg/m3) and formaldehyde (0.01 mg/m3). The PE values based on one-dimensional time series position (vertical) data were variable according to internal constraint (i.e. strains) and accordingly increased in response to external constraint (i.e. chemicals) by reflecting diversity in movement patterns from both normal and intoxicated states. Cross-correlation function revealed temporal associations between the PE values and between the component movement patterns in different chemicals and strains through the period of intoxication. The entropy based on the order of position data could be a useful means for complexity measure in behavioral changes and for monitoring the impact of stressors in environment.
Matrices with restricted entries and q-analogues of permutations
Lewis, Joel Brewster; Morales, Alejandro H; Panova, Greta; Sam, Steven V; Zhang, Yan
2010-01-01
We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are $q$-analogues of permutations with certain restricted values. We obtain a simple closed formula for the number of invertible matrices with zero diagonal, a $q$-analogue of derangements, and a curious relationship between invertible skew-symmetric matrices and invertible symmetric matrices with zero diagonal. In addition, we provide recursions to enumerate matrices and symmetric matrices with zero diagonal by rank, and we frame some of our results in the context of Lie theory. Finally, we provide a brief exposition of polynomiality results for enumeration questions related to those mentioned, and give several open questions.
A self-adaptive image encryption scheme with half-pixel interchange permutation operation
Ye, Ruisong; Liu, Li; Liao, Minyu; Li, Yafang; Liao, Zikang
2017-01-01
A plain-image dependent image encryption scheme with half-pixel-level swapping permutation strategy is proposed. In the new permutation operation, a pixel-swapping operation between four higher bit-planes and four lower bit-planes is employed to replace the traditional confusion operation, which not only improves the conventional permutation efficiency within the plain-image, but also changes all the pixel gray values. The control parameters of generalized Arnold map applied for the permutation operation are related to the plain-image content and consequently can resist chosen-plaintext and known-plaintext attacks effectively. To enhance the security of the proposed image encryption, one multimodal skew tent map is applied to generate pseudo-random gray value sequence for diffusion operation. Simulations have been carried out thoroughly to demonstrate that the proposed image encryption scheme is highly secure thanks to its large key space and efficient permutation-diffusion operations.
Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions
Linton, Steven; Roby, Tom; West, Julian
2011-01-01
We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our most general setting, two permutations are equivalent if one can be obtained from the other by a sequence of pattern-replacing moves of prescribed form; however, we limit our focus to patterns where two elements are transposed, subject to the constraint that a third element of a suitable type be in a suitable position. For various instances of the problem, we compute the number of equivalence classes, determine how many n-permutations are equivalent to the identity permutation, or characterise this equivalence class. Although our results feature familiar integer sequences (e.g., Catalan, Fibonacci, and Tribonacci numbers) and special classes of permutations (layered, connected, and 123-avoiding), some of the sequences that arise appear to be new.
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.
Iterative decoding of Generalized Parallel Concatenated Block codes using cyclic permutations
Directory of Open Access Journals (Sweden)
Hamid Allouch
2012-09-01
Full Text Available Iterative decoding techniques have gain popularity due to their performance and their application in most communications systems. In this paper, we present a new application of our iterative decoder on the GPCB (Generalized Parallel Concatenated Block codes which uses cyclic permutations. We introduce a new variant of the component decoder. After extensive simulation; the obtained result is very promising compared with several existing methods. We evaluate the effects of various parameters component codes, interleaver size, block size, and the number of iterations. Three interesting results are obtained; the first one is that the performances in terms of BER (Bit Error Rate of the new constituent decoder are relatively similar to that of original one. Secondly our turbo decoding outperforms another turbo decoder for some linear block codes. Thirdly the proposed iterative decoding of GPCB-BCH (75, 51 is about 2.1dB from its Shannon limit.
Multivariate permutation entropy and its application for complexity analysis of chaotic systems
He, Shaobo; Sun, Kehui; Wang, Huihai
2016-11-01
To measure the complexity of multivariate systems, the multivariate permutation entropy (MvPE) algorithm is proposed. It is employed to measure complexity of multivariate system in the phase space. As an application, MvPE is applied to analyze the complexity of chaotic systems, including hyperchaotic Hénon map, fractional-order simplified Lorenz system and financial chaotic system. Results show that MvPE algorithm is effective for analyzing the complexity of the multivariate systems. It also shows that fractional-order system does not become more complex with derivative order varying. Compared with PE, MvPE has better robustness for noise and sampling interval, and the results are not affected by different normalization methods.
Variational methods in molecular modeling
2017-01-01
This book presents tutorial overviews for many applications of variational methods to molecular modeling. Topics discussed include the Gibbs-Bogoliubov-Feynman variational principle, square-gradient models, classical density functional theories, self-consistent-field theories, phase-field methods, Ginzburg-Landau and Helfrich-type phenomenological models, dynamical density functional theory, and variational Monte Carlo methods. Illustrative examples are given to facilitate understanding of the basic concepts and quantitative prediction of the properties and rich behavior of diverse many-body systems ranging from inhomogeneous fluids, electrolytes and ionic liquids in micropores, colloidal dispersions, liquid crystals, polymer blends, lipid membranes, microemulsions, magnetic materials and high-temperature superconductors. All chapters are written by leading experts in the field and illustrated with tutorial examples for their practical applications to specific subjects. With emphasis placed on physical unders...
Aalto, Juha; Pirinen, Pentti; Jylhä, Kirsti
2016-04-01
Long-term time series of key climate variables with a relevant spatiotemporal resolution are essential for environmental science. Moreover, such spatially continuous data, based on weather observations, are commonly used in, e.g., downscaling and bias correcting of climate model simulations. Here we conducted a comprehensive spatial interpolation scheme where seven climate variables (daily mean, maximum, and minimum surface air temperatures, daily precipitation sum, relative humidity, sea level air pressure, and snow depth) were interpolated over Finland at the spatial resolution of 10 × 10 km2. More precisely, (1) we produced daily gridded time series (FMI_ClimGrid) of the variables covering the period of 1961-2010, with a special focus on evaluation and permutation-based uncertainty estimates, and (2) we investigated temporal trends in the climate variables based on the gridded data. National climate station observations were supplemented by records from the surrounding countries, and kriging interpolation was applied to account for topography and water bodies. For daily precipitation sum and snow depth, a two-stage interpolation with a binary classifier was deployed for an accurate delineation of areas with no precipitation or snow. A robust cross-validation indicated a good agreement between the observed and interpolated values especially for the temperature variables and air pressure, although the effect of seasons was evident. Permutation-based analysis suggested increased uncertainty toward northern areas, thus identifying regions with suboptimal station density. Finally, several variables had a statistically significant trend indicating a clear but locally varying signal of climate change during the last five decades.
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.
Köstler, Claus
2008-01-01
We show that the classical de Finetti theorem has a canonical noncommutative counterpart if we strengthen `exchangeability' (i.e., invariance of the joint distribution of the random variables under the action of the permutation group) to invariance under the action of the quantum permutation group. More precisely, for an infinite sequence of noncommutative random variables, we prove that invariance of their joint distribution under quantum permutations is equivalent to the fact that the random variables are identically distributed and free with respect to the conditional expectation onto their tail algebra.
Blackford, Jennifer Urbano; Salomon, Ronald M; Waller, Niels G
2009-02-01
Treatment-related changes in neurobiological rhythms are of increasing interest to psychologists, psychiatrists, and biological rhythms researchers. New methods for analyzing change in rhythms are needed, as most common methods disregard the rich complexity of biological processes. Large time series data sets reflect the intricacies of underlying neurobiological processes, but can be difficult to analyze. We propose the use of Fourier methods with multivariate permutation test (MPT) methods for analyzing change in rhythms from time series data. To validate the use of MPT for Fourier-transformed data, we performed Monte Carlo simulations and compared statistical power and family-wise error for MPT to Bonferroni-corrected and uncorrected methods. Results show that MPT provides greater statistical power than Bonferroni-corrected tests, while appropriately controlling family-wise error. We applied this method to human, pre- and post-treatment, serially-sampled neurotransmitter data to confirm the utility of this method using real data. Together, Fourier with MPT methods provides a statistically powerful approach for detecting change in biological rhythms from time series data.
Weighted permutation entropy based on different symbolic approaches for financial time series
Yin, Yi; Shang, Pengjian
2016-02-01
In this paper, we introduce weighted permutation entropy (WPE) and three different symbolic approaches to investigate the complexities of stock time series containing amplitude-coded information and explore the influence of using different symbolic approaches on obtained WPE results. We employ WPE based on symbolic approaches to the US and Chinese stock markets and make a comparison between the results of US and Chinese stock markets. Three symbolic approaches are able to help the complexity containing in the stock time series by WPE method drop whatever the embedding dimension is. The similarity between these stock markets can be detected by the WPE based on Binary Δ-coding-method, while the difference between them can be revealed by the WPE based on σ-method, Max-min-method. The combinations of the symbolic approaches: σ-method and Max-min-method, and WPE method are capable of reflecting the multiscale structure of complexity by different time delay and analyze the differences between complexities of stock time series in more detail and more accurately. Furthermore, the correlations between stock markets in the same region and the similarities hidden in the S&P500 and DJI, ShangZheng and ShenCheng are uncovered by the comparison of the WPE based on Binary Δ-coding-method of six stock markets.
A MULTICRITERIA PERMUTATION FLOWSHOP SCHEDULING PROBLEM WITH SETUP TIMES
Directory of Open Access Journals (Sweden)
M.Saravanan
2014-07-01
Full Text Available The permutation flow shop scheduling problem has been completely concentrated on in late decades, both from single objective and additionally from multi-objective points of view. To the best of our information, little has been carried out with respect to the multi-objective flow shop with sequence dependent setup times are acknowledged. As setup times and multi-criteria problems are significant in industry, we must concentrate on this area. We propose a simple and powerful meta-heuristic algorithm as artificial immune system for the sequence dependent setup time’s flow shop problem with several criteria. The objective functions are framed to simultaneously minimize the makespan time, tardiness time, earliness time and total completion time. The proposed approach is in conjunction with the constructive heuristic of Nawaz et al. evaluated using benchmark problems taken from Taillard and compared with the prevailing Simulated annealing approach and B-Grasp approach. Computational experiments indicate that the proposed algorithm is better than the SA approach and B-Grasp approach in all cases and can be very well applied to find better schedule.
Single-Cycle Bit Permutations with MOMR Execution
Institute of Scientific and Technical Information of China (English)
Ruby B. Lee; Xiao Yang; Zhi-Jie Jerry Shi
2005-01-01
Secure computing paradigms impose new architectural challenges for general-purpose processors. Cryptographic processing is needed for secure communications, storage, and computations. We identify two categories of operations in symmetric-key and public-key cryptographic algorithms that are not common in previous general-purpose workloads:advanced bit operations within a word and multi-word operations. We define MOMR (Multiple Operands Multiple Results)execution or datarich execution as a unified solution to both challenges. It allows arbitrary n-bit permutations to be achieved in one or two cycles, rather than O(n) cycles as in existing RISC processors. It also enables significant acceleration of multiword multiplications needed by public-key ciphers. We propose two implementations of MOMR: one employs only hardware changes while the other uses Instruction Set Architecture (ISA) support. We show that MOMR execution leverages available resources in typical multi-issue processors with minimal additional cost. Multi-issue processors enhanced with MOMR units provide additional speedup over standard multi-issue processors with the same datapath. MOMR is a general architectural solution for word-oriented processor architectures to incorporate datarich operations.
Orders induced by segments in floorplan partitions and (2-14-3,3-41-2)-avoiding permutations
Asinowski, Andrei; Bousquet-Mélou, Mireille; Mansour, Toufik; Pinter, Ron
2010-01-01
Floorplan partitions are certain tilings of a rectangle by other rectangles. There are natural ways to order their elements (rectangles and segments). In particular, Ackerman, Barequet, and Pinter studied a pair of orders induced by neighborhood relations between rectangles of a floorplan partition, and obtained a natural bijection between these pairs and (2-41-3, 3-14-2)-avoiding permutations (also known as Baxter permutations). In the present paper, we study a pair of orders induced by neighborhood relations between segments of a floorplan partition. We obtain a natural bijection between these pairs and another family of permutations, namely (2-14-3,3-41-2)-avoiding permutations. We also enumerate these permutations, investigate relations between the two kinds of pairs of orders --- and correspondingly, between (2-14-3,3-41-2)-avoiding permutations and Baxter permutations --- and study the special case of "guillotine" partitions.
Levin, Mark Sh
2011-01-01
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fundamental to understand nature and complexity of optimization problems over permutations (e.g., ordering, scheduling, traveling salesman problem). The description is based on permutation neighborhoods of several kinds (e.g., by improvement of an objective function). Our proposed operational digraph and its kinds can be considered as a way to understand convexity and polynomial solvability for combinatorial optimization problems over permutations. Issues of an analysis of problems and a design of hierarchical heuristics are discussed. The discussion leads to a multi-level adaptive algorithm system which analyzes an individual problem and selects/designs a solving strategy (trajectory).
A counterexample to Beck's conjecture on the discrepancy of three permutations
Newman, Alantha
2011-01-01
Given three permutations on the integers 1 through n, consider the set system consisting of each interval in each of the three permutations. Jozsef Beck conjectured (c. 1987) that the discrepancy of this set system is O(1). We give a counterexample to this conjecture: for any positive integer n = 3^k, we exhibit three permutations whose corresponding set system has discrepancy Omega(log(n)). Our counterexample is based on a simple recursive construction, and our proof of the discrepancy lower bound is by induction. This example also disproves a generalization of Beck's conjecture due to Spencer, Srinivasan and Tetali, who conjectured that a set system corresponding to l permutations has discrepancy O(sqrt(l)).
Balancedness of Permutation Games and Envy-Free Allocations in Indivisible Good Economies
Klijn, F.; Tijs, S.H.; Hamers, H.J.M.
1999-01-01
We present a simple proof of the balancedness of permutation games. In the proof we use the existence of envy-free allocations in economies with indivisible objects, quasi-linear utility functions, and an amount of money.
Li, Zhendong; Liu, Wenjian
2016-01-01
Complicated mathematical equations involving tensors with permutation symmetries are frequently encountered in fields such as quantum chemistry, e.g., those in coupled cluster theories and derivatives of wavefunction parameters. In automatic derivations of these equations, a key step is the collection of product terms that can be found identical by using permutation symmetries or relabelling dummy indices. In the present work, we define a canonical form for a general tensor product in the presence of permutation symmetries as a result of the classification of all tensor products from a group theoretical point of view. To make such definition of practical use, we provide an efficient algorithm to compute the canonical form by combining the classical backtrack search for permutation groups and the idea of partitions used in graph isomorphism algorithms. The resulted algorithm can compute canonical forms and generators of the automorphism groups of tensor expressions. Moreover, for tensor products with external ...
Balancedness of Permutation Games and Envy-Free Allocations in Indivisible Good Economies
Klijn, F.; Tijs, S.H.; Hamers, H.J.M.
1999-01-01
We present a simple proof of the balancedness of permutation games. In the proof we use the existence of envy-free allocations in economies with indivisible objects, quasi-linear utility functions, and an amount of money.
Permutation Entropy and Its Main Biomedical and Econophysics Applications: A Review
Directory of Open Access Journals (Sweden)
Osvaldo A. Rosso
2012-08-01
Full Text Available Entropy is a powerful tool for the analysis of time series, as it allows describing the probability distributions of the possible state of a system, and therefore the information encoded in it. Nevertheless, important information may be codified also in the temporal dynamics, an aspect which is not usually taken into account. The idea of calculating entropy based on permutation patterns (that is, permutations defined by the order relations among values of a time series has received a lot of attention in the last years, especially for the understanding of complex and chaotic systems. Permutation entropy directly accounts for the temporal information contained in the time series; furthermore, it has the quality of simplicity, robustness and very low computational cost. To celebrate the tenth anniversary of the original work, here we analyze the theoretical foundations of the permutation entropy, as well as the main recent applications to the analysis of economical markets and to the understanding of biomedical systems.
Descent polynomials for k bubble-sortable permutations of type B
Hyatt, Matthew
2012-01-01
Motivated by the work of Chung, Claesson, Dukes, and Graham, we define a natural type B analog of the classic bubble sort, and use it to define a type B analog of the maximum drop statistic. We enumerate (by explicit, recursive, and generating function formulas) signed permutations with r type B descents and type B maximum drop at most k. We also find a connection between these signed permutations and certain 2-colored juggling sequences.
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.
Usefulness of permutation entropy as an anesthetic depth indicator in children.
Kim, Pil-Jong; Kim, Hong-Gee; Noh, Gyu-Jeong; Koo, Yong-Seo; Shin, Teo Jeon
2015-04-01
Permutation entropy (PE) as a complexity measure has been introduced to monitor anesthetic depth for adult. However, PE has not yet been evaluated for its clinical applicability as an indicator of anesthetic depth in children. Therefore, in order to investigate the validity of PE, we compared PE with BIS using pharmacodynamic (PD) modeling in children. Electroencephalogram (EEG) was obtained from BIS monitor during sevoflurane deepening and lightening protocol. End-tidal sevoflurane concentration (Etsevo) and BIS were measured simultaneously. PE was calculated from the processed EEG with the scale ranging from 0 to 100. NONMEM software was used to investigate the PD relationship between Etsevo with BIS and PE. Adjusted PE (APE) values were decreased as anesthesia deepened. APE and BIS showed significant linear correlation (P Emax model which describes the relationship between Etsevo and APE/BIS (E o : 78, E max : 17.6, C e50 : 2.5 vol%; γ: 13.1, k eo : 0.47 min(-1) for APE; E o : 89.4; E max : 15.7; C e50 : 2.2 vol%; γ: 6.6, keo: 0.52 min(-1) for BIS). PE seems to be a useful indicator of anesthetic depth, which is comparable to BIS in children.
Widespread occurrence of organelle genome-encoded 5S rRNAs including permuted molecules.
Valach, Matus; Burger, Gertraud; Gray, Michael W; Lang, B Franz
2014-12-16
5S Ribosomal RNA (5S rRNA) is a universal component of ribosomes, and the corresponding gene is easily identified in archaeal, bacterial and nuclear genome sequences. However, organelle gene homologs (rrn5) appear to be absent from most mitochondrial and several chloroplast genomes. Here, we re-examine the distribution of organelle rrn5 by building mitochondrion- and plastid-specific covariance models (CMs) with which we screened organelle genome sequences. We not only recover all organelle rrn5 genes annotated in GenBank records, but also identify more than 50 previously unrecognized homologs in mitochondrial genomes of various stramenopiles, red algae, cryptomonads, malawimonads and apusozoans, and surprisingly, in the apicoplast (highly derived plastid) genomes of the coccidian pathogens Toxoplasma gondii and Eimeria tenella. Comparative modeling of RNA secondary structure reveals that mitochondrial 5S rRNAs from brown algae adopt a permuted triskelion shape that has not been seen elsewhere. Expression of the newly predicted rrn5 genes is confirmed experimentally in 10 instances, based on our own and published RNA-Seq data. This study establishes that particularly mitochondrial 5S rRNA has a much broader taxonomic distribution and a much larger structural variability than previously thought. The newly developed CMs will be made available via the Rfam database and the MFannot organelle genome annotator. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.
Institute of Scientific and Technical Information of China (English)
ZHAO Yaqun; WANG Jue
2006-01-01
Orthomorphic permutations have good characteristics in cryptosystems. In this paper, by using of knowledge about relation between orthomorphic permutations and multi-output functions, and conceptions of the generalized Walsh spectrum of multi-output functions and the auto-correlation function of multi-output functions to investigate the Walsh spectral characteristics and the auto-correlation function characteristics of orthormophic permutations, several results are obtained.
Counting Tensor Model Observables and Branched Covers of the 2-Sphere
Geloun, Joseph Ben
2013-01-01
Lattice gauge theories of permutation groups with a simple topological action (henceforth permutation-TFTs) have recently found several applications in the combinatorics of quantum field theories (QFTs). They have been used to solve counting problems of Feynman graphs in QFTs and ribbon graphs of large $N$, often revealing inter-relations between different counting problems. In another recent development, tensor theories generalizing matrix theories have been actively developed as models of random geometry in three or more dimensions. Here, we apply permutation-TFT methods to count gauge invariants for tensor models (colored as well as non-colored), exhibiting a relationship with counting problems of branched covers of the 2-sphere, where the rank $d$ of the tensor gets related to a number of branch points. We give explicit generating functions for the relevant counting and describe algorithms for the enumeration of the invariants. As well as the classic count of Hurwitz equivalence classes of branched covers...
A novel chaos-based bit-level permutation scheme for digital image encryption
Fu, Chong; Lin, Bin-bin; Miao, Yu-sheng; Liu, Xiao; Chen, Jun-jie
2011-11-01
Confidentiality is an important issue when digital images are transmitted over public networks, and encryption is the most useful technique employed for this purpose. Image encryption is somehow different from text encryption due to some inherent features of image such as bulk data capacity and high correlation among pixels, which are generally difficult to handle by conventional algorithms. Recently, chaos-based encryption has suggested a new and efficient way to deal with the intractable problems of fast and highly secure image encryption. This paper proposes a novel chaos-based bit-level permutation scheme for secure and efficient image cipher. To overcome the drawbacks of conventional permutation-only type image cipher, the proposed scheme introduced a significant diffusion effect in permutation procedure through a two-stage bit-level shuffling algorithm. The two-stage permutation operations are realized by chaotic sequence sorting algorithm and Arnold Cat map, respectively. Results of various types of analysis are interesting and indicate that the security level of the new scheme is competitive with that of permutation-diffusion type image cipher, while the computational complexity is much lower. Therefore the new scheme is a good candidate for real-time secure image communication applications.
Research on BOM based composable modeling method
Zhang, M.; He, Q.; Gong, J.
2013-01-01
Composable modeling method has been a research hotpot in the area of Modeling and Simulation for a long time. In order to increase the reuse and interoperability of BOM based model, this paper put forward a composable modeling method based on BOM, studied on the basic theory of composable modeling m
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.
A Highly Flexible LDPC Decoder using Hierarchical Quasi-Cyclic Matrix with Layered Permutation
Directory of Open Access Journals (Sweden)
Vikram Arkalgud Chandrasetty
2012-03-01
Full Text Available Hardware implementation of partially-parallel Low-Density Parity-Check (LDPC decoders using unstructured random matrices is very complex and requires huge hardware resources. To alleviate the complexity and minimize resource requirements, structured LDPC matrices are used. This paper presents a novel technique for constructing a multi-level Hierarchical Quasi-Cyclic (HQC structured matrix for LDPC decoder. A unique multi-level structure of the proposed matrix provides flexibility in generating different code lengths and code rates for various applications such as WiMAX, WLAN and DVB-S2. In addition, different combinations of permuted sub-matrices are inserted in layers at different levels of matrix hierarchy to provide virtual randomness in the LDPC matrix. Simulation results show that the HQC matrices generated using the proposed technique have a marginal loss of less than 0.1 dB at a bit error rate (BER performance 10-5 compared to unstructured random matrices. A hardware model of the proposed matrix structure has been developed and synthesized on Xilinx FPGA to verify the flexibility features, hardware requirements and to analyze the performance of the LDPC decoder.
Parker, Hilary S; Leek, Jeffrey T; Favorov, Alexander V; Considine, Michael; Xia, Xiaoxin; Chavan, Sameer; Chung, Christine H; Fertig, Elana J
2014-10-01
Sample source, procurement process and other technical variations introduce batch effects into genomics data. Algorithms to remove these artifacts enhance differences between known biological covariates, but also carry potential concern of removing intragroup biological heterogeneity and thus any personalized genomic signatures. As a result, accurate identification of novel subtypes from batch-corrected genomics data is challenging using standard algorithms designed to remove batch effects for class comparison analyses. Nor can batch effects be corrected reliably in future applications of genomics-based clinical tests, in which the biological groups are by definition unknown a priori. Therefore, we assess the extent to which various batch correction algorithms remove true biological heterogeneity. We also introduce an algorithm, permuted-SVA (pSVA), using a new statistical model that is blind to biological covariates to correct for technical artifacts while retaining biological heterogeneity in genomic data. This algorithm facilitated accurate subtype identification in head and neck cancer from gene expression data in both formalin-fixed and frozen samples. When applied to predict Human Papillomavirus (HPV) status, pSVA improved cross-study validation even if the sample batches were highly confounded with HPV status in the training set. All analyses were performed using R version 2.15.0. The code and data used to generate the results of this manuscript is available from https://sourceforge.net/projects/psva. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.
Ge, Tian; Feng, Jianfeng; Hibar, Derrek P; Thompson, Paul M; Nichols, Thomas E
2012-11-01
Imaging traits are thought to have more direct links to genetic variation than diagnostic measures based on cognitive or clinical assessments and provide a powerful substrate to examine the influence of genetics on human brains. Although imaging genetics has attracted growing attention and interest, most brain-wide genome-wide association studies focus on voxel-wise single-locus approaches, without taking advantage of the spatial information in images or combining the effect of multiple genetic variants. In this paper we present a fast implementation of voxel- and cluster-wise inferences based on the random field theory to fully use the spatial information in images. The approach is combined with a multi-locus model based on least square kernel machines to associate the joint effect of several single nucleotide polymorphisms (SNP) with imaging traits. A fast permutation procedure is also proposed which significantly reduces the number of permutations needed relative to the standard empirical method and provides accurate small p-value estimates based on parametric tail approximation. We explored the relation between 448,294 single nucleotide polymorphisms and 18,043 genes in 31,662 voxels of the entire brain across 740 elderly subjects from the Alzheimer's disease neuroimaging initiative (ADNI). Structural MRI scans were analyzed using tensor-based morphometry (TBM) to compute 3D maps of regional brain volume differences compared to an average template image based on healthy elderly subjects. We find method to be more sensitive compared with voxel-wise single-locus approaches. A number of genes were identified as having significant associations with volumetric changes. The most associated gene was GRIN2B, which encodes the N-methyl-d-aspartate (NMDA) glutamate receptor NR2B subunit and affects both the parietal and temporal lobes in human brains. Its role in Alzheimer's disease has been widely acknowledged and studied, suggesting the validity of the approach. The
GRASP to minimize total weighted tardiness in a permutation flow shop environment
Directory of Open Access Journals (Sweden)
Lina Paola Molina-Sánchez
2016-01-01
Full Text Available This paper addresses the scheduling problem in a Permutation Flow Shop (PFS environment, which is associated with many types of industries such as chemical, petrochemical, automobile manufacturing, metallurgical, textile, etc. Thus, this work intends to solve a PFS scheduling problem in order to minimize the total weighted tardiness, since it is an important sequencing criterion not only for on time delivery jobs but also for customer satisfaction. To solve the problem, GRASP (Greedy Randomized Adaptive Search Procedure metaheuristic is proposed as a solution, which has shown competitive results compared with other combinatorial problems. In addition, two utility functions called Weighted Modified Due Date (WMDD and Apparent Tardiness Cost (ATC are proposed to develop GRASP. These are based on dynamic dispatching rules and also known for solving the problem of total weighted tardiness for single machine scheduling problem. Next, an experimental design was carried out for comparing the GRASP performance with both utility functions and against the WEDD dispatching rule results. The results indicate that GRASP-WMDD could improve the total weighted tardiness in 47.8% compared with WEDD results. Finally, the GRASP-WMDD performance for the PFS total tardiness problem was evaluated, obtaining a relative deviation index of 13.89% and ranking the method over 26 heuristics and metaheuristics.
Numerical and experimental study of the effects of noise on the permutation entropy
Quintero-Quiroz, C; Torrent, M C; Masoller, Cristina
2015-01-01
We analyze the effects of noise on the permutation entropy of dynamical systems. We take as numerical examples the logistic map and the R\\"ossler system. Upon varying the noise strengthfaster, we find a transition from an almost-deterministic regime, where the permutation entropy grows slower than linearly with the pattern dimension, to a noise-dominated regime, where the permutation entropy grows faster than linearly with the pattern dimension. We perform the same analysis on experimental time-series by considering the stochastic spiking output of a semiconductor laser with optical feedback. Because of the experimental conditions, the dynamics is found to be always in the noise-dominated regime. Nevertheless, the analysis allows to detect regularities of the underlying dynamics. By comparing the results of these three different examples, we discuss the possibility of determining from a time series whether the underlying dynamics is dominated by noise or not.
Köstler, Claus; Speicher, Roland
2009-10-01
We show that the classical de Finetti theorem has a canonical noncommutative counterpart if we strengthen “exchangeability” (i.e., invariance of the joint distribution of the random variables under the action of the permutation group) to invariance under the action of the quantum permutation group. More precisely, for an infinite sequence of noncommutative random variables {(x_i)_{iinmathbb{N}}} , we prove that invariance of the joint distribution of the x i ’s under quantum permutations is equivalent to the fact that the x i ’s are identically distributed and free with respect to the conditional expectation onto the tail algebra of the x i ’s.
Analyzing Permutations for AES-like Ciphers: Understanding ShiftRows
DEFF Research Database (Denmark)
Beierle, Christof; Jovanovic, Philipp; Lauridsen, Martin Mehl
2015-01-01
attacks. After formalizing the concept of guaranteed trail weights, we show a range of equivalence results for permutation layers in this context. We prove that the trail weight analysis when using arbitrary word-wise permutations, with rotations as a special case, reduces to a consideration of a specific...... 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...... that a seemingly optimal bound on the trail weight can be obtained using cyclic rotations only for the permutation layer, i.e. in a very implementation friendly way....
Structured LDPC Codes from Permutation Matrices Free of Small Trapping Sets
Nguyen, Dung Viet; Marcellin, Michael; Chilappagari, Shashi Kiran
2010-01-01
This paper introduces a class of structured lowdensity parity-check (LDPC) codes whose parity check matrices are arrays of permutation matrices. The permutation matrices are obtained from Latin squares and form a finite field under some matrix operations. They are chosen so that the Tanner graphs do not contain subgraphs harmful to iterative decoding algorithms. The construction of column-weight-three codes is presented. Although the codes are optimized for the Gallager A/B algorithm over the binary symmetric channel (BSC), their error performance is very good on the additive white Gaussian noise channel (AWGNC) as well.
Candidate Prediction Models and Methods
DEFF Research Database (Denmark)
Nielsen, Henrik Aalborg; Nielsen, Torben Skov; Madsen, Henrik
2005-01-01
This document lists candidate prediction models for Work Package 3 (WP3) of the PSO-project called ``Intelligent wind power prediction systems'' (FU4101). The main focus is on the models transforming numerical weather predictions into predictions of power production. The document also outlines...
Candidate Prediction Models and Methods
DEFF Research Database (Denmark)
Nielsen, Henrik Aalborg; Nielsen, Torben Skov; Madsen, Henrik
2005-01-01
This document lists candidate prediction models for Work Package 3 (WP3) of the PSO-project called ``Intelligent wind power prediction systems'' (FU4101). The main focus is on the models transforming numerical weather predictions into predictions of power production. The document also outlines...... the possibilities w.r.t. different numerical weather predictions actually available to the project....
PLS-LS-SVM based modeling of ATR-IR as a robust method in detection and qualification of alprazolam
Parhizkar, Elahehnaz; Ghazali, Mohammad; Ahmadi, Fatemeh; Sakhteman, Amirhossein
2017-02-01
According to the United States pharmacopeia (USP), Gold standard technique for Alprazolam determination in dosage forms is HPLC, an expensive and time-consuming method that is not easy to approach. In this study chemometrics assisted ATR-IR was introduced as an alternative method that produce similar results in fewer time and energy consumed manner. Fifty-eight samples containing different concentrations of commercial alprazolam were evaluated by HPLC and ATR-IR method. A preprocessing approach was applied to convert raw data obtained from ATR-IR spectra to normal matrix. Finally, a relationship between alprazolam concentrations achieved by HPLC and ATR-IR data was established using PLS-LS-SVM (partial least squares least squares support vector machines). Consequently, validity of the method was verified to yield a model with low error values (root mean square error of cross validation equal to 0.98). The model was able to predict about 99% of the samples according to R2 of prediction set. Response permutation test was also applied to affirm that the model was not assessed by chance correlations. At conclusion, ATR-IR can be a reliable method in manufacturing process in detection and qualification of alprazolam content.
PLS-LS-SVM based modeling of ATR-IR as a robust method in detection and qualification of alprazolam.
Parhizkar, Elahehnaz; Ghazali, Mohammad; Ahmadi, Fatemeh; Sakhteman, Amirhossein
2017-02-15
According to the United States pharmacopeia (USP), Gold standard technique for Alprazolam determination in dosage forms is HPLC, an expensive and time-consuming method that is not easy to approach. In this study chemometrics assisted ATR-IR was introduced as an alternative method that produce similar results in fewer time and energy consumed manner. Fifty-eight samples containing different concentrations of commercial alprazolam were evaluated by HPLC and ATR-IR method. A preprocessing approach was applied to convert raw data obtained from ATR-IR spectra to normal matrix. Finally, a relationship between alprazolam concentrations achieved by HPLC and ATR-IR data was established using PLS-LS-SVM (partial least squares least squares support vector machines). Consequently, validity of the method was verified to yield a model with low error values (root mean square error of cross validation equal to 0.98). The model was able to predict about 99% of the samples according to R(2) of prediction set. Response permutation test was also applied to affirm that the model was not assessed by chance correlations. At conclusion, ATR-IR can be a reliable method in manufacturing process in detection and qualification of alprazolam content. Copyright © 2016 Elsevier B.V. All rights reserved.
An Effective ARMA Modeling Method.
1981-04-01
directed towards spectral analysis, power spectral density function the preponderance of effort has been directed to- wards two special cases of the...domain spectral density function than from pole model, and, the general ARMA model is seen to its equivalent time domain autocorrelation sequence. be...n-k) (11) prediction. Assuming this prediction behavior, it k-I then follows from relationship (11) that the spectral density function of the time
Multiscale modeling methods in biomechanics.
Bhattacharya, Pinaki; Viceconti, Marco
2017-01-19
More and more frequently, computational biomechanics deals with problems where the portion of physical reality to be modeled spans over such a large range of spatial and temporal dimensions, that it is impossible to represent it as a single space-time continuum. We are forced to consider multiple space-time continua, each representing the phenomenon of interest at a characteristic space-time scale. Multiscale models describe a complex process across multiple scales, and account for how quantities transform as we move from one scale to another. This review offers a set of definitions for this emerging field, and provides a brief summary of the most recent developments on multiscale modeling in biomechanics. Of all possible perspectives, we chose that of the modeling intent, which vastly affect the nature and the structure of each research activity. To the purpose we organized all papers reviewed in three categories: 'causal confirmation,' where multiscale models are used as materializations of the causation theories; 'predictive accuracy,' where multiscale modeling is aimed to improve the predictive accuracy; and 'determination of effect,' where multiscale modeling is used to model how a change at one scale manifests in an effect at another radically different space-time scale. Consistent with how the volume of computational biomechanics research is distributed across application targets, we extensively reviewed papers targeting the musculoskeletal and the cardiovascular systems, and covered only a few exemplary papers targeting other organ systems. The review shows a research subdomain still in its infancy, where causal confirmation papers remain the most common. For further resources related to this article, please visit the WIREs website.
Model correction factor method for system analysis
DEFF Research Database (Denmark)
Ditlevsen, Ove Dalager; Johannesen, Johannes M.
2000-01-01
The Model Correction Factor Method is an intelligent response surface method based on simplifiedmodeling. MCFM is aimed for reliability analysis in case of a limit state defined by an elaborate model. Herein it isdemonstrated that the method is applicable for elaborate limit state surfaces on which...... severallocally most central points exist without there being a simple geometric definition of the corresponding failuremodes such as is the case for collapse mechanisms in rigid plastic hinge models for frame structures. Taking as simplifiedidealized model a model of similarity with the elaborate model...... surface than existing in the idealized model....
Laguerre polynomials method in the valon model
Boroun, G R
2014-01-01
We used the Laguerre polynomials method for determination of the proton structure function in the valon model. We have examined the applicability of the valon model with respect to a very elegant method, where the structure of the proton is determined by expanding valon distributions and valon structure functions on Laguerre polynomials. We compared our results with the experimental data, GJR parameterization and DL model. Having checked, this method gives a good description for the proton structure function in valon model.
If a binary code is invariant under a doubly-transitive permutation group, then the set of all code words of weight j forms a balanced incomplete...doubly- transitive permutation group. Thus, BIB designs can be derived from these classes of codes. It is shown that if the symbols of the Reed-Muller
Construction Method of Supernetwork Evolution Model
Institute of Scientific and Technical Information of China (English)
LIU; Qiang; FANG; Jin-qing; LI; Yong
2013-01-01
Real networks often have small-world and scale-free characteristics.Based on BA and WS model,we proposed the following construction method for TLSEM(Fig.1).Three layers are BA model(TBA),three layers are SW model(TSW),the first and third layers are BA model,the middle layer is SW model(BA-SW),the first and third layers are SW model,and the middle layer is BA model(SW-BA).The
Methodically Modeling the Tor Network
2012-08-01
iPlane [7] and CAIDA [3]. Third, determining a better client model would further increase confidence in experimental results. Producing a more robust...Bandwidth Speed Test. http://speedtest.net/. [3] CAIDA Data. http://www.caida.org/data. [4] DETER Testbed. http://www.isi.edu/deter. [5] Emulab
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.
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.
Directory of Open Access Journals (Sweden)
Ruisong Ye
2014-03-01
Full Text Available A secure image encryption scheme based on 2D skew tent map is proposed for the encryption of color images. The proposed encryption scheme is composed of one permutation process and one substitution process. The 3D color plain-image matrix is converted to 2D image matrix first, then 2D skew tent map is utilized to generate chaotic sequences, which are used for both permutation process and substitution process. The chaotic sequence for permutation process is dependent on plain-image and cipher keys, resulting in good key sensitivity and plaintext sensitivity. The substitution process is first initiated with the initial vectors generated by the cipher keys and 2D skew tent map, then the gray values of row and column pixels of 2D image matrix are mixed with the pseudorandom number sequences via bitxoring operation. Both permutation process and substitution process are executed row-by-row and column-by-column instead of pixel-by-pixel to improve the speed of encryption. The security and performance of the proposed image encryption have been analyzed, including histograms, correlation coefficients, information entropy, key sensitivity analysis, key space analysis, differential analysis, encryption/decryption rate analysis etc. All the experimental results suggest that the proposed image encryption scheme is robust and secure and can be used for secure image and video communication applications.
Generating All Permutations by Context-Free Grammars in Greibach Normal Form
Asveld, P.R.J.
2007-01-01
We consider context-free grammars $G_n$ in Greibach normal form and, particularly, in Greibach $m$-form ($m=1,2$) which generates the finite language $L_n$ of all $n!$ strings that are permutations of $n$ different symbols ($n\\geq 1$). These grammars are investigated with respect to their
Differential cryptanalysis of round-reduced PRINTcipher: Computing roots of permutations
DEFF Research Database (Denmark)
Abdelraheem, Mohamed Ahmed; Leander, Gregor; Zenner, Erik
2011-01-01
At CHES 2010, the new block cipher PRINTcipher was presented. In addition to using an xor round key as is common practice for round-based block ciphers, PRINTcipher also uses key-dependent permutations. While this seems to make differential cryptanalysis difficult due to the unknown bit permutati...
On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
Brunetti, S.; Del Lungo, A.; Gritzmann, P.; de Vries, S.
2008-01-01
The paper studies the problem of reconstructing binary matrices constrained by binary tomographic information. We prove new NP-hardness results that sharpen previous complexity results in the realm of discrete tomography but also allow applications to related problems for permutation matrices. Hence
Permutation test for non-inferiority of the linear to the optimal combination of multiple tests.
Jin, Hua; Lu, Ying
2009-03-01
We proposed a permutation test for non-inferiority of the linear discriminant function to the optimal combination of multiple tests based on Mann-Whitney statistic estimate of the area under the receiver operating characteristic curve. Monte Carlo simulations showed its good performance.
Software Testing Method Based on Model Comparison
Institute of Scientific and Technical Information of China (English)
XIE Xiao-dong; LU Yan-sheng; MAO Cheng-yin
2008-01-01
A model comparison based software testing method (MCST) is proposed. In this method, the requirements and programs of software under test are transformed into the ones in the same form, and described by the same model describe language (MDL).Then, the requirements are transformed into a specification model and the programs into an implementation model. Thus, the elements and structures of the two models are compared, and the differences between them are obtained. Based on the diffrences, a test suite is generated. Different MDLs can be chosen for the software under test. The usages of two classical MDLs in MCST, the equivalence classes model and the extended finite state machine (EFSM) model, are described with example applications. The results show that the test suites generated by MCST are more efficient and smaller than some other testing methods, such as the path-coverage testing method, the object state diagram testing method, etc.
Directory of Open Access Journals (Sweden)
Akiko eSoma
2014-04-01
Full Text Available A number of genome analyses and searches using programs that focus on the RNA-specific bulge-helix-bulge (BHB motif have uncovered a wide variety of disrupted tRNA genes. The results of these analyses have shown that genetic information encoding functional RNAs is described in the genome cryptically and is retrieved using various strategies. One such strategy is represented by circularly permuted tRNA genes, in which the sequences encoding the 5′-half and 3′-half of the specific tRNA are separated and inverted on the genome. Biochemical analyses have defined a processing pathway in which the termini of tRNA precursors (pre-tRNAs are ligated to form a characteristic circular RNA intermediate, which is then cleaved at the acceptor-stem to generate the typical cloverleaf structure with functional termini. The sequences adjacent to the processing site located between the 3′-half and the 5′-half of pre-tRNAs potentially form a BHB motif, which is the dominant recognition site for the tRNA-intron splicing endonuclease, suggesting that circularization of pre-tRNAs depends on the splicing machinery. Some permuted tRNAs contain a BHB-mediated intron in their 5′- or 3′-half, meaning that removal of an intron, as well as swapping of the 5′- and 3′-halves, are required during maturation of their pre-tRNAs. To date, 34 permuted tRNA genes have been identified from six species of unicellular algae and one archaeon. Although their physiological significance and mechanism of development remain unclear, the splicing system of BHB motifs seems to have played a key role in the formation of permuted tRNA genes. In this review, current knowledge of circularly permuted tRNA genes is presented and some unanswered questions regarding these species are discussed.
Developing a TQM quality management method model
Zhang, Zhihai
1997-01-01
From an extensive review of total quality management literature, the external and internal environment affecting an organization's quality performance and the eleven primary elements of TQM are identified. Based on the primary TQM elements, a TQM quality management method model is developed. This model describes the primary quality management methods which may be used to assess an organization's present strengths and weaknesses with regard to its use of quality management methods. This model ...
Economic modeling using artificial intelligence methods
Marwala, Tshilidzi
2013-01-01
This book examines the application of artificial intelligence methods to model economic data. It addresses causality and proposes new frameworks for dealing with this issue. It also applies evolutionary computing to model evolving economic environments.
Variational Methods for Biomolecular Modeling
Wei, Guo-Wei
2016-01-01
Structure, function and dynamics of many biomolecular systems can be characterized by the energetic variational principle and the corresponding systems of partial differential equations (PDEs). This principle allows us to focus on the identification of essential energetic components, the optimal parametrization of energies, and the efficient computational implementation of energy variation or minimization. Given the fact that complex biomolecular systems are structurally non-uniform and their interactions occur through contact interfaces, their free energies are associated with various interfaces as well, such as solute-solvent interface, molecular binding interface, lipid domain interface, and membrane surfaces. This fact motivates the inclusion of interface geometry, particular its curvatures, to the parametrization of free energies. Applications of such interface geometry based energetic variational principles are illustrated through three concrete topics: the multiscale modeling of biomolecular electrosta...
Mechatronic Systems Design Methods, Models, Concepts
Janschek, Klaus
2012-01-01
In this textbook, fundamental methods for model-based design of mechatronic systems are presented in a systematic, comprehensive form. The method framework presented here comprises domain-neutral methods for modeling and performance analysis: multi-domain modeling (energy/port/signal-based), simulation (ODE/DAE/hybrid systems), robust control methods, stochastic dynamic analysis, and quantitative evaluation of designs using system budgets. The model framework is composed of analytical dynamic models for important physical and technical domains of realization of mechatronic functions, such as multibody dynamics, digital information processing and electromechanical transducers. Building on the modeling concept of a technology-independent generic mechatronic transducer, concrete formulations for electrostatic, piezoelectric, electromagnetic, and electrodynamic transducers are presented. More than 50 fully worked out design examples clearly illustrate these methods and concepts and enable independent study of th...
Systems Evaluation Methods, Models, and Applications
Liu, Siefeng; Xie, Naiming; Yuan, Chaoqing
2011-01-01
A book in the Systems Evaluation, Prediction, and Decision-Making Series, Systems Evaluation: Methods, Models, and Applications covers the evolutionary course of systems evaluation methods, clearly and concisely. Outlining a wide range of methods and models, it begins by examining the method of qualitative assessment. Next, it describes the process and methods for building an index system of evaluation and considers the compared evaluation and the logical framework approach, analytic hierarchy process (AHP), and the data envelopment analysis (DEA) relative efficiency evaluation method. Unique
Twitter's tweet method modelling and simulation
Sarlis, Apostolos S.; Sakas, Damianos P.; Vlachos, D. S.
2015-02-01
This paper seeks to purpose the concept of Twitter marketing methods. The tools that Twitter provides are modelled and simulated using iThink in the context of a Twitter media-marketing agency. The paper has leveraged the system's dynamic paradigm to conduct Facebook marketing tools and methods modelling, using iThink™ system to implement them. It uses the design science research methodology for the proof of concept of the models and modelling processes. The following models have been developed for a twitter marketing agent/company and tested in real circumstances and with real numbers. These models were finalized through a number of revisions and iterators of the design, develop, simulate, test and evaluate. It also addresses these methods that suit most organized promotion through targeting, to the Twitter social media service. The validity and usefulness of these Twitter marketing methods models for the day-to-day decision making are authenticated by the management of the company organization. It implements system dynamics concepts of Twitter marketing methods modelling and produce models of various Twitter marketing situations. The Tweet method that Twitter provides can be adjusted, depending on the situation, in order to maximize the profit of the company/agent.
Structural equation modeling methods and applications
Wang, Jichuan
2012-01-01
A reference guide for applications of SEM using Mplus Structural Equation Modeling: Applications Using Mplus is intended as both a teaching resource and a reference guide. Written in non-mathematical terms, this book focuses on the conceptual and practical aspects of Structural Equation Modeling (SEM). Basic concepts and examples of various SEM models are demonstrated along with recently developed advanced methods, such as mixture modeling and model-based power analysis and sample size estimate for SEM. The statistical modeling program, Mplus, is also featured and provides researchers with a
eshless Method for Acoustic and Elastic Modeling
Institute of Scientific and Technical Information of China (English)
JiaXiaofeng; HuTianyue; WangRunqiu
2005-01-01
Wave equation method is one of the fundamental techniques for seismic modeling and imaging. In this paper the element-free-method (EFM) was used to solve acoustic and elastic equations.The key point of this method is no need of elements, which makes nodes free from the elemental restraint. Besides, the moving-least-squares (MLS) criterion in EFM leads to a high accuracy and smooth derivatives. The theories of EFM for both acoustic and elastic wave equations as well as absorbing boundary conditions were discussed respectively. Furthermore, some pre-stack models were used to show the good performance of EFM in seismic modeling.
A Method for Model Checking Feature Interactions
DEFF Research Database (Denmark)
Pedersen, Thomas; Le Guilly, Thibaut; Ravn, Anders Peter;
2015-01-01
This paper presents a method to check for feature interactions in a system assembled from independently developed concurrent processes as found in many reactive systems. The method combines and refines existing definitions and adds a set of activities. The activities describe how to populate the ...... the definitions with models to ensure that all interactions are captured. The method is illustrated on a home automation example with model checking as analysis tool. In particular, the modelling formalism is timed automata and the analysis uses UPPAAL to find interactions....
Fundamental Group and Euler Characteristic of Permutation Products and Fat Diagonals
Kallel, Sadok
2010-01-01
Permutation products and their various "fat diagonal" subspaces are studied from the topological and geometric point of view. We first write down an expression for the fundamental group of any permutation product of a connected space $X$, having the homotopy type of a simplicial complex, in terms of $\\pi_1(X)$ and $H_1(X;{\\mathbb Z})$. We then prove that the fundamental group of the configuration space of $n$-points on $X$ of which multiplicities do not exceed $n/2$ coincides with $H_1(X;{\\mathbb Z})$. Useful additivity properties for the Euler characteristic are then spelled out and used to give explicit formulae for the Euler characteristics of various fat diagonals. Several examples and calculations are included.
A permutation information theory tour through different interest rate maturities: the Libor case.
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).
A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems.
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.
Multiple-image encryption algorithm based on mixed image element and permutation
Zhang, Xiaoqiang; Wang, Xuesong
2017-05-01
To improve encryption efficiency and facilitate the secure transmission of multiple digital images, by defining the pure image element and mixed image element, this paper presents a new multiple-image encryption (MIE) algorithm based on the mixed image element and permutation, which can simultaneously encrypt any number of images. Firstly, segment the original images into pure image elements; secondly, scramble all the pure image elements with the permutation generated by the piecewise linear chaotic map (PWLCM) system; thirdly, combine mixed image elements into scrambled images; finally, diffuse the content of mixed image elements by performing the exclusive OR (XOR) operation among scrambled images and the chaotic image generated by another PWLCM system. The comparison with two similar algorithms is made. Experimental results and algorithm analyses show that the proposed MIE algorithm is very simple and efficient, which is suitable for practical image encryption.
Extension of the Dynasearch to the Two-Machine Permutation Flowshop Scheduling Problem
Tanaka, Shunji
The purpose of this study is to construct a solution algorithm for the two-machine permutation flowshop problem based on the dynasearch. The dynasearch is an efficient local search algorithm that employs a special neighborhood structure called dynasearch swap neighborhood. Its primary advantage is that the neighborhood of a solution can be explored in polynomial time although it is composed of an exponential number of solutions. The dynasearch for machine scheduling was originally developed for the single-machine total weighted tardiness problem. Then, it was extended to the problem with idle time and setup times. This study further extends the dynasearch to the two-machine permutation flowshop problem and its effectiveness is examined by numerical experiments for both total weighted tardiness and total weighted earliness-tardiness objectives.
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.
Accidental permutation symmetries as a test for Grand Unification: the supersymmetric $SU(5)$ case
Fichet, Sylvain
2016-01-01
Unification of matter fields implies the existence of accidental permutation symmetries, which potentially remain immune to large quantum corrections up to the TeV scale. We investigate the case of a supersymmetric $SU(5)$ grand unified theory, where such a permutation symmetry is present in the up-type squark sector. We present a variety of tests allowing to challenge the $SU(5)$ hypothesis based on the observation of squarks at the LHC. These tests appear as relations among observables involving flavour-violating or chirality-flipping decays of squarks. Moreover, they rely on top-polarimetry and charm-tagging. As an example, we discuss the application to the scenario of Natural Supersymmetry, while more examples can be found in the related journal publications.
Level Crossing Methods in Stochastic Models
Brill, Percy H
2008-01-01
Since its inception in 1974, the level crossing approach for analyzing a large class of stochastic models has become increasingly popular among researchers. This volume traces the evolution of level crossing theory for obtaining probability distributions of state variables and demonstrates solution methods in a variety of stochastic models including: queues, inventories, dams, renewal models, counter models, pharmacokinetics, and the natural sciences. Results for both steady-state and transient distributions are given, and numerous examples help the reader apply the method to solve problems fa
a permutation encoding te algorithm solution of reso tation encoding ...
African Journals Online (AJOL)
eobe
The proposed chromosome coding method is applied to Gen ed through object or ... ordering problems, such as traveling salesman problem or task ordering problem. ... Figure 2: Network diagram of a project network. A B C D E F. Figure 3: A ...
X-s-Permutable Subgroups%X-s-置换子群
Institute of Scientific and Technical Information of China (English)
石磊; 郭文彬; 易小兰
2008-01-01
Let X be a nonempty subset of a group G.A subgroup H of G is said to be X-spermutable in G if,for every Sylow subgroup T of G,there exists an element x ∈X such that HTx=Tx H.In this paper,we obtain some results about the X-s-permutable subgroups and use them to determine the structure of some finite groups.
Permutation Excess Entropy and Mutual Information between the Past and Future
Haruna, Taichi
2011-01-01
We address the excess entropy, which is a measure of complexity for stationary time series, from the ordinal point of view. We show that the permutation excess entropy is equal to the mutual information between two adjacent semi-infinite blocks in the space of orderings for finite-state stationary ergodic Markov processes. This result may shed a new light on the relationship between complexity and anticipation.
Generating All Permutations by Context-Free Grammars in Chomsky Normal Form
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
Computationally efficient permutation-based confidence interval estimation for tail-area FDR
Directory of Open Access Journals (Sweden)
Joshua eMillstein
2013-09-01
Full Text Available Challenges of satisfying parametric assumptions in genomic settings with thousands or millions of tests have led investigators to combine powerful False Discovery Rate (FDR approaches with computationally expensive but exact permutation testing. We describe a computationally efficient permutation-based approach that includes a tractable estimator of the proportion of true null hypotheses, the variance of the log of tail-area FDR, and a confidence interval (CI estimator, which accounts for the number of permutations conducted and dependencies between tests. The CI estimator applies a binomial distribution and an overdispersion parameter to counts of positive tests. The approach is general with regards to the distribution of the test statistic, it performs favorably in comparison to other approaches, and reliable FDR estimates are demonstrated with as few as 10 permutations. An application of this approach to relate sleep patterns to gene expression patterns in mouse hypothalamus yielded a set of 11 transcripts associated with 24 hour REM sleep (FDR = .15 (.08, .26. Two of the corresponding genes, Sfrp1 and Sfrp4, are involved in wnt signaling and several others, Irf7, Ifit1, Iigp2, and Ifih1, have links to interferon signaling. These genes would have been overlooked had a typical a priori FDR threshold such as 0.05 or 0.1 been applied. The CI provides the flexibility for choosing a significance threshold based on tolerance for false discoveries and precision of the FDR estimate. That is, it frees the investigator to use a more data-driven approach to define significance, such as the minimum estimated FDR, an option that is especially useful for weak effects, often observed in studies of complex diseases.
Revisiting the European sovereign bonds with a permutation-information-theory approach
Fernández Bariviera, Aurelio; Zunino, Luciano; Guercio, María Belén; Martinez, Lisana B.; Rosso, Osvaldo A.
2013-12-01
In this paper we study the evolution of the informational efficiency in its weak form for seventeen European sovereign bonds time series. We aim to assess the impact of two specific economic situations in the hypothetical random behavior of these time series: the establishment of a common currency and a wide and deep financial crisis. In order to evaluate the informational efficiency we use permutation quantifiers derived from information theory. Specifically, time series are ranked according to two metrics that measure the intrinsic structure of their correlations: permutation entropy and permutation statistical complexity. These measures provide the rectangular coordinates of the complexity-entropy causality plane; the planar location of the time series in this representation space reveals the degree of informational efficiency. According to our results, the currency union contributed to homogenize the stochastic characteristics of the time series and produced synchronization in the random behavior of them. Additionally, the 2008 financial crisis uncovered differences within the apparently homogeneous European sovereign markets and revealed country-specific characteristics that were partially hidden during the monetary union heyday.
Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
Barguñó, Luis; Huntingford, Eduard; Tiwari, Ashish
2010-01-01
We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS) whose right-hand side terms are restricted to be shallow (variables occur at depth at most one) and linear (each variable occurs at most once). Innermost termination modulo permutative theories is also shown to be decidable for shallow TRS. We first show that a shallow TRS can be transformed into a flat (only variables and constants occur at depth one) TRS while preserving termination and innermost termination. The decidability results are then proved by showing that (a) for right-flat right-linear (flat) TRS, non-termination (respectively, innermost non-termination) implies non-termination starting from flat terms, and (b) for right-flat TRS, the existence of non-terminating derivations starting from a given term is decidable. On the negative side, we show PSPACE-hardness of ...
Probing the functional mechanism of Escherichia coli GroEL using circular permutation.
Directory of Open Access Journals (Sweden)
Tomohiro Mizobata
Full Text Available BACKGROUND: The Escherichia coli chaperonin GroEL subunit consists of three domains linked via two hinge regions, and each domain is responsible for a specific role in the functional mechanism. Here, we have used circular permutation to study the structural and functional characteristics of the GroEL subunit. METHODOLOGY/PRINCIPAL FINDINGS: Three soluble, partially active mutants with polypeptide ends relocated into various positions of the apical domain of GroEL were isolated and studied. The basic functional hallmarks of GroEL (ATPase and chaperoning activities were retained in all three mutants. Certain functional characteristics, such as basal ATPase activity and ATPase inhibition by the cochaperonin GroES, differed in the mutants while at the same time, the ability to facilitate the refolding of rhodanese was roughly equal. Stopped-flow fluorescence experiments using a fluorescent variant of the circularly permuted GroEL CP376 revealed that a specific kinetic transition that reflects movements of the apical domain was missing in this mutant. This mutant also displayed several characteristics that suggested that the apical domains were behaving in an uncoordinated fashion. CONCLUSIONS/SIGNIFICANCE: The loss of apical domain coordination and a concomitant decrease in functional ability highlights the importance of certain conformational signals that are relayed through domain interlinks in GroEL. We propose that circular permutation is a very versatile tool to probe chaperonin structure and function.
Directory of Open Access Journals (Sweden)
Nadia Mammone
2015-07-01
Full Text Available Permutation entropy (PE has been widely exploited to measure the complexity of the electroencephalogram (EEG, especially when complexity is linked to diagnostic information embedded in the EEG. Recently, the authors proposed a spatial-temporal analysis of the EEG recordings of absence epilepsy patients based on PE. The goal here is to improve the ability of PE in discriminating interictal states from ictal states in absence seizure EEG. For this purpose, a parametrical definition of permutation entropy is introduced here in the field of epileptic EEG analysis: the permutation Rényi entropy (PEr. PEr has been extensively tested against PE by tuning the involved parameters (order, delay time and alpha. The achieved results demonstrate that PEr outperforms PE, as there is a statistically-significant, wider gap between the PEr levels during the interictal states and PEr levels observed in the ictal states compared to PE. PEr also outperformed PE as the input to a classifier aimed at discriminating interictal from ictal states.
Ram, Sumit Kumar; Molinas, Marta
2016-01-01
This article presents the applicability of Permutation Entropy based complexity measure of a time series for detection of fault in wind turbines. A set of electrical data from one faulty and one healthy wind turbine were analysed using traditional FastFourier analysis in addition to Permutation Entropy analysis to compare the complexity index of phase currents of the two turbines over time. The 4 seconds length data set did not reveal any low frequency in the spectra of currents, neither did they show any meaningful differences of spectrum between the two turbine currents. Permutation Entropy analysis of the current waveforms of same phases for the two turbines are found to have different complexity values over time, one of them being clearly higher than the other. The work of Yan et. al. in has found that higher entropy values related to thepresence of failure in rotary machines in his study. Following this track, further efforts will be put into relating the entropy difference found in our study to possible...
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.)
Numerical methods and modelling for engineering
Khoury, Richard
2016-01-01
This textbook provides a step-by-step approach to numerical methods in engineering modelling. The authors provide a consistent treatment of the topic, from the ground up, to reinforce for students that numerical methods are a set of mathematical modelling tools which allow engineers to represent real-world systems and compute features of these systems with a predictable error rate. Each method presented addresses a specific type of problem, namely root-finding, optimization, integral, derivative, initial value problem, or boundary value problem, and each one encompasses a set of algorithms to solve the problem given some information and to a known error bound. The authors demonstrate that after developing a proper model and understanding of the engineering situation they are working on, engineers can break down a model into a set of specific mathematical problems, and then implement the appropriate numerical methods to solve these problems. Uses a “building-block” approach, starting with simpler mathemati...
Modeling complex work systems - method meets reality
Veer, van der, C.G.; Hoeve, Machteld; Lenting, Bert F.
1996-01-01
Modeling an existing task situation is often a first phase in the (re)design of information systems. For complex systems design, this model should consider both the people and the organization involved, the work, and situational aspects. Groupware Task Analysis (GTA) as part of a method for the design of complex systems, has been applied in a situation of redesign of a Dutch public administration system. The most feasible method to collect information in this case was ethnography, the resulti...
Computer-Aided Modelling Methods and Tools
DEFF Research Database (Denmark)
Cameron, Ian; Gani, Rafiqul
2011-01-01
The development of models for a range of applications requires methods and tools. In many cases a reference model is required that allows the generation of application specific models that are fit for purpose. There are a range of computer aided modelling tools available that help to define...... a taxonomy of aspects around conservation, constraints and constitutive relations. Aspects of the ICAS-MoT toolbox are given to illustrate the functionality of a computer aided modelling tool, which incorporates an interface to MS Excel....
Geostatistical methods applied to field model residuals
DEFF Research Database (Denmark)
Maule, Fox; Mosegaard, K.; Olsen, Nils
consists of measurement errors and unmodelled signal), and is typically assumed to be uncorrelated and Gaussian distributed. We have applied geostatistical methods to analyse the residuals of the Oersted(09d/04) field model [http://www.dsri.dk/Oersted/Field_models/IGRF_2005_candidates/], which is based...
Modeling complex work systems - method meets reality
van der Veer, Gerrit C.; Hoeve, Machteld; Lenting, Bert
1996-01-01
Modeling an existing task situation is often a first phase in the (re)design of information systems. For complex systems design, this model should consider both the people and the organization involved, the work, and situational aspects. Groupware Task Analysis (GTA) as part of a method for the
Modeling complex work systems - method meets reality
Veer, van der Gerrit C.; Hoeve, Machteld; Lenting, Bert F.
1996-01-01
Modeling an existing task situation is often a first phase in the (re)design of information systems. For complex systems design, this model should consider both the people and the organization involved, the work, and situational aspects. Groupware Task Analysis (GTA) as part of a method for the desi
A survey of real face modeling methods
Liu, Xiaoyue; Dai, Yugang; He, Xiangzhen; Wan, Fucheng
2017-09-01
The face model has always been a research challenge in computer graphics, which involves the coordination of multiple organs in faces. This article explained two kinds of face modeling method which is based on the data driven and based on parameter control, analyzed its content and background, summarized their advantages and disadvantages, and concluded muscle model which is based on the anatomy of the principle has higher veracity and easy to drive.
Constructive Epistemic Modeling: A Hierarchical Bayesian Model Averaging Method
Tsai, F. T. C.; Elshall, A. S.
2014-12-01
Constructive epistemic modeling is the idea that our understanding of a natural system through a scientific model is a mental construct that continually develops through learning about and from the model. Using the hierarchical Bayesian model averaging (HBMA) method [1], this study shows that segregating different uncertain model components through a BMA tree of posterior model probabilities, model prediction, within-model variance, between-model variance and total model variance serves as a learning tool [2]. First, the BMA tree of posterior model probabilities permits the comparative evaluation of the candidate propositions of each uncertain model component. Second, systemic model dissection is imperative for understanding the individual contribution of each uncertain model component to the model prediction and variance. Third, the hierarchical representation of the between-model variance facilitates the prioritization of the contribution of each uncertain model component to the overall model uncertainty. We illustrate these concepts using the groundwater modeling of a siliciclastic aquifer-fault system. The sources of uncertainty considered are from geological architecture, formation dip, boundary conditions and model parameters. The study shows that the HBMA analysis helps in advancing knowledge about the model rather than forcing the model to fit a particularly understanding or merely averaging several candidate models. [1] Tsai, F. T.-C., and A. S. Elshall (2013), Hierarchical Bayesian model averaging for hydrostratigraphic modeling: Uncertainty segregation and comparative evaluation. Water Resources Research, 49, 5520-5536, doi:10.1002/wrcr.20428. [2] Elshall, A.S., and F. T.-C. Tsai (2014). Constructive epistemic modeling of groundwater flow with geological architecture and boundary condition uncertainty under Bayesian paradigm, Journal of Hydrology, 517, 105-119, doi: 10.1016/j.jhydrol.2014.05.027.
Method of generating a computer readable model
DEFF Research Database (Denmark)
2008-01-01
A method of generating a computer readable model of a geometrical object constructed from a plurality of interconnectable construction elements, wherein each construction element has a number of connection elements for connecting the construction element with another construction element. The met......A method of generating a computer readable model of a geometrical object constructed from a plurality of interconnectable construction elements, wherein each construction element has a number of connection elements for connecting the construction element with another construction element....... The method comprises encoding a first and a second one of the construction elements as corresponding data structures, each representing the connection elements of the corresponding construction element, and each of the connection elements having associated with it a predetermined connection type. The method...
Methods of modelling relative growth rate
Institute of Scientific and Technical Information of China (English)
Arne Pommerening; Anders Muszta
2015-01-01
Background:Analysing and modelling plant growth is an important interdisciplinary field of plant science. The use of relative growth rates, involving the analysis of plant growth relative to plant size, has more or less independently emerged in different research groups and at different times and has provided powerful tools for assessing the growth performance and growth efficiency of plants and plant populations. In this paper, we explore how these isolated methods can be combined to form a consistent methodology for modelling relative growth rates. Methods:We review and combine existing methods of analysing and modelling relative growth rates and apply a combination of methods to Sitka spruce (Picea sitchensis (Bong.) Carr.) stem-analysis data from North Wales (UK) and British Douglas fir (Pseudotsuga menziesi (Mirb.) Franco) yield table data. Results:The results indicate that, by combining the approaches of different plant-growth analysis laboratories and using them simultaneously, we can advance and standardise the concept of relative plant growth. Particularly the growth multiplier plays an important role in modelling relative growth rates. Another useful technique has been the recent introduction of size-standardised relative growth rates. Conclusions:Modelling relative growth rates mainly serves two purposes, 1) an improved analysis of growth performance and efficiency and 2) the prediction of future or past growth rates. This makes the concept of relative growth ideally suited to growth reconstruction as required in dendrochronology, climate change and forest decline research and for interdisciplinary research projects beyond the realm of plant science.
Methods of modelling relative growth rate
Directory of Open Access Journals (Sweden)
Arne Pommerening
2015-03-01
Full Text Available Background Analysing and modelling plant growth is an important interdisciplinary field of plant science. The use of relative growth rates, involving the analysis of plant growth relative to plant size, has more or less independently emerged in different research groups and at different times and has provided powerful tools for assessing the growth performance and growth efficiency of plants and plant populations. In this paper, we explore how these isolated methods can be combined to form a consistent methodology for modelling relative growth rates. Methods We review and combine existing methods of analysing and modelling relative growth rates and apply a combination of methods to Sitka spruce (Picea sitchensis (Bong. Carr. stem-analysis data from North Wales (UK and British Douglas fir (Pseudotsuga menziesii (Mirb. Franco yield table data. Results The results indicate that, by combining the approaches of different plant-growth analysis laboratories and using them simultaneously, we can advance and standardise the concept of relative plant growth. Particularly the growth multiplier plays an important role in modelling relative growth rates. Another useful technique has been the recent introduction of size-standardised relative growth rates. Conclusions Modelling relative growth rates mainly serves two purposes, 1 an improved analysis of growth performance and efficiency and 2 the prediction of future or past growth rates. This makes the concept of relative growth ideally suited to growth reconstruction as required in dendrochronology, climate change and forest decline research and for interdisciplinary research projects beyond the realm of plant science.
Modelling asteroid brightness variations. I - Numerical methods
Karttunen, H.
1989-01-01
A method for generating lightcurves of asteroid models is presented. The effects of the shape of the asteroid and the scattering law of a surface element are distinctly separable, being described by chosen functions that can easily be changed. The shape is specified by means of two functions that yield the length of the radius vector and the normal vector of the surface at a given point. The general shape must be convex, but spherical concavities producing macroscopic shadowing can also be modeled.
Niederhauser's model for epilepsy and wavelet methods
Trevino, J P; Moran, J L; Murguia, J S; Rosu, H C
2006-01-01
Wavelets and wavelet transforms (WT) could be a very useful tool to analyze electroencephalogram (EEG) signals. To illustrate the WT method we make use of a simple electric circuit model introduced by Niederhauser, which is used to produce EEG-like signals, particularly during an epileptic seizure. The original model is modified to resemble the 10-20 derivation of the EEG measurements. WT is used to study the main features of these signals
Modeling Storm Surges Using Discontinuous Galerkin Methods
2016-06-01
discontinuous Galerkin solutions of the compressible Euler equations with applications to atmospheric simulations,” Journal of Computational Physics, vol...order continuous Galerkin methods were used for the SWE on a sphere [9]. In 2002, Giraldo et al. [10] introduced an efficient DG method for the SWE... hard time transitioning from changing bathymetry slopes causing distortions in the model to include extra line segments. The discrepancies caused us to
Methods in Model Order Reduction (MOR) field
Institute of Scientific and Technical Information of China (English)
刘志超
2014-01-01
Nowadays, the modeling of systems may be quite large, even up to tens of thousands orders. In spite of the increasing computational powers, direct simulation of these large-scale systems may be impractical. Thus, to industry requirements, analytically tractable and computationally cheap models must be designed. This is the essence task of Model Order Reduction (MOR). This article describes the basics of MOR optimization, various way of designing MOR, and gives the conclusion about existing methods. In addition, it proposed some heuristic footpath.
Railway Track Allocation: Models and Methods
DEFF Research Database (Denmark)
Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias
2011-01-01
Efficiently coordinating the movement of trains on a railway network is a central part of the planning process for a railway company. This paper reviews models and methods that have been proposed in the literature to assist planners in finding train routes. Since the problem of routing trains...
Developing a TQM quality management method model
Zhang, Zhihai
1997-01-01
From an extensive review of total quality management literature, the external and internal environment affecting an organization's quality performance and the eleven primary elements of TQM are identified. Based on the primary TQM elements, a TQM quality management method model is developed. This mo
Developing a TQM quality management method model
Zhang, Zhihai
1997-01-01
From an extensive review of total quality management literature, the external and internal environment affecting an organization's quality performance and the eleven primary elements of TQM are identified. Based on the primary TQM elements, a TQM quality management method model is developed. This mo
Developing a TQM quality management method model
Zhang, Zhihai
1997-01-01
From an extensive review of total quality management literature, the external and internal environment affecting an organization's quality performance and the eleven primary elements of TQM are identified. Based on the primary TQM elements, a TQM quality management method model is developed. This
Approximate Methods for State-Space Models
Koyama, Shinsuke; Shalizi, Cosma Rohilla; Kass, Robert E; 10.1198/jasa.2009.tm08326
2010-01-01
State-space models provide an important body of techniques for analyzing time-series, but their use requires estimating unobserved states. The optimal estimate of the state is its conditional expectation given the observation histories, and computing this expectation is hard when there are nonlinearities. Existing filtering methods, including sequential Monte Carlo, tend to be either inaccurate or slow. In this paper, we study a nonlinear filter for nonlinear/non-Gaussian state-space models, which uses Laplace's method, an asymptotic series expansion, to approximate the state's conditional mean and variance, together with a Gaussian conditional distribution. This {\\em Laplace-Gaussian filter} (LGF) gives fast, recursive, deterministic state estimates, with an error which is set by the stochastic characteristics of the model and is, we show, stable over time. We illustrate the estimation ability of the LGF by applying it to the problem of neural decoding and compare it to sequential Monte Carlo both in simulat...
DiPaola, Matthew J; DiPaola, Christian P; Conrad, Bryan P; Horodyski, MaryBeth; Del Rossi, Gianluca; Sawers, Andrew; Bloch, David; Rechtine, Glenn R
2008-06-01
A study of spine biomechanics in a cadaver model. To quantify motion in multiple axes created by transfer methods from stretcher to operating table in the prone position in a cervical global instability model. Patients with an unstable cervical spine remain at high risk for further secondary injury until their spine is adequately surgically stabilized. Previous studies have revealed that collars have significant, but limited benefit in preventing cervical motion when manually transferring patients. The literature proposes multiple methods of patient transfer, although no one method has been universally adopted. To date, no study has effectively evaluated the relationship between spine motion and various patient transfer methods to an operating room table for prone positioning. A global instability was surgically created at C5-6 in 4 fresh cadavers with no history of spine pathology. All cadavers were tested both with and without a rigid cervical collar in the intact and unstable state. Three headrest permutations were evaluated Mayfield (SM USA Inc), Prone View (Dupaco, Oceanside, CA), and Foam Pillow (OSI, Union City, CA). A trained group of medical staff performed each of 2 transfer methods: the "manual" and the "Jackson table" transfer. The manual technique entailed performing a standard rotation of the supine patient on a stretcher to the prone position on the operating room table with in-line manual cervical stabilization. The "Jackson" technique involved sliding the supine patient to the Jackson table (OSI, Union City, CA) with manual in-line cervical stabilization, securing them to the table, then initiating the table's lock and turn mechanism and rotating them into a prone position. An electromagnetic tracking device captured angular motion between the C5 and C6 vertebral segments. Repeated measures statistical analysis was performed to evaluate the following conditions: collar use (2 levels), headrest (3 levels), and turning technique (2 levels). For all
Internet Resource Pricing Models, Mechanisms, and Methods
He, Huan; Liu, Ying
2011-01-01
With the fast development of video and voice network applications, CDN (Content Distribution Networks) and P2P (Peer-to-Peer) content distribution technologies have gradually matured. How to effectively use Internet resources thus has attracted more and more attentions. For the study of resource pricing, a whole pricing strategy containing pricing models, mechanisms and methods covers all the related topics. We first introduce three basic Internet resource pricing models through an Internet cost analysis. Then, with the evolution of service types, we introduce several corresponding mechanisms which can ensure pricing implementation and resource allocation. On network resource pricing methods, we discuss the utility optimization in economics, and emphasize two classes of pricing methods (including system optimization and entities' strategic optimizations). Finally, we conclude the paper and forecast the research direction on pricing strategy which is applicable to novel service situation in the near future.
AN EFFECTIVE HUMAN LEG MODELING METHOD
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
Digital medicine is a new concept in medical field, and the need for digital human body is increasing these years. This paper used Free Form Deformation (FFD) to model the motion of human leg. It presented the motion equations of knee joint on the basis of anatomic structure and motion characters, then transmitted the deformation to the mesh of leg through a simplified FFD that only used two-order B-spline basis function. The experiments prove that this method can simulate the bend of leg and the deformation of muscles fairly well. Compared with the method of curved patches, this method is more convenient and effective. Further more, those equations can be easily applied to other joint models of human body.
A NEW ROUTING ALGORITHM FOR THE SHUFFLE-EXCHANGE PERMUTATION NETWORK
Institute of Scientific and Technical Information of China (English)
Baoxing CHEN; Wenjun XIAO; Ni DU
2006-01-01
In this paper, a new routing algorithm is given for the shuffle-exchange permutation network (SEPn). The length of the path between any two nodes given by our algorithm is not more than 11/16n2 +O(n), i.e., the diameter of SEPn is at most 11/16n2+O(n). This improves on a 1/8(9n2 -22n+24)routing algorithm described earlier by S. Latifi and P. K. Srimani. We also show that the diameter of SEPn is more than 1/2n2-n.
Brain Computation Is Organized via Power-of-Two-Based Permutation Logic.
Xie, Kun; Fox, Grace E; Liu, Jun; Lyu, Cheng; Lee, Jason C; Kuang, Hui; Jacobs, Stephanie; Li, Meng; Liu, Tianming; Song, Sen; Tsien, Joe Z
2016-01-01
There is considerable scientific interest in understanding how cell assemblies-the long-presumed computational motif-are organized so that the brain can generate intelligent cognition and flexible behavior. The Theory of Connectivity proposes that the origin of intelligence is rooted in a power-of-two-based permutation logic (N = 2 (i) -1), producing specific-to-general cell-assembly architecture capable of generating specific perceptions and memories, as well as generalized knowledge and flexible actions. We show that this power-of-two-based permutation logic is widely used in cortical and subcortical circuits across animal species and is conserved for the processing of a variety of cognitive modalities including appetitive, emotional and social information. However, modulatory neurons, such as dopaminergic (DA) neurons, use a simpler logic despite their distinct subtypes. Interestingly, this specific-to-general permutation logic remained largely intact although NMDA receptors-the synaptic switch for learning and memory-were deleted throughout adulthood, suggesting that the logic is developmentally pre-configured. Moreover, this computational logic is implemented in the cortex via combining a random-connectivity strategy in superficial layers 2/3 with nonrandom organizations in deep layers 5/6. This randomness of layers 2/3 cliques-which preferentially encode specific and low-combinatorial features and project inter-cortically-is ideal for maximizing cross-modality novel pattern-extraction, pattern-discrimination and pattern-categorization using sparse code, consequently explaining why it requires hippocampal offline-consolidation. In contrast, the nonrandomness in layers 5/6-which consists of few specific cliques but a higher portion of more general cliques projecting mostly to subcortical systems-is ideal for feedback-control of motivation, emotion, consciousness and behaviors. These observations suggest that the brain's basic computational algorithm is indeed
Impact of Energetically Accessible Proton Permutations in the Spectroscopy and Dynamics of H{_5^+}
Lin, Zhou; McCoy, Anne B.
2016-06-01
H{_5^+} has been proposed to be the intermediate of the astrochemically interesting proton transfer reaction H_3^+ + H_2 → H_2 + H_3^+. The scrambling of five protons in this floppy, ``structureless'' ion introduces complications to its high-resolution rovibrational spectroscopy and the proton transfer dynamics between H{_3^+} and H_2. Quantum chemical studies are performed to predict and interpret the spectroscopic and dynamical properties of H{_5^+}, with special consideration paid to the group theoretical aspects. If the full permutation of protons were allowed in H{_5^+}, just like in CH{_5^+}, the system should have been characterized by the G240 complete permutation-inversion group. However, our diffusion Monte Carlo calculations indicate that such a full permutation is not allowed for most of the molecular configurations sampled by the reaction path of the proton transfer process in question, and the energetically accessible permutations are functions of the distance between the H{_3^+} and H_2 fragments. In the present study, we investigate two extreme geometries of H{_5^+}, the [H_2-H-H_2]^+ shared-proton intermediate and the H_3^+\\cdots H_2 long-range complex, using two subgroups of G240, G16 and G24, respectively. In these two limiting circumstances, we derive the symmetry-adapted basis functions for the energy levels that describe the nuclear spins and the rovibrational motions of H{_5^+}. Based on the results of these derivations, we discuss the spectroscopic properties of H{_5^+}, including the coupling between different rovibrational degrees of freedom in the effective nuclear motion Hamiltonian, the electric-dipole selection rules for rovibrational spectroscopy, and correlations of energy levels between [H_2-H-H_2]^+ and H_3^+\\cdots H_2. Our study can be considered as the first step towards the implementation of future quantitative theoretical investigations for comparison with spectroscopic and dynamical experiments. X.-G. Wang and T
Lang, Jun
2015-03-01
In this paper, we propose a novel color image encryption method by using Color Blend (CB) and Chaos Permutation (CP) operations in the reality-preserving multiple-parameter fractional Fourier transform (RPMPFRFT) domain. The original color image is first exchanged and mixed randomly from the standard red-green-blue (RGB) color space to R‧G‧B‧ color space by rotating the color cube with a random angle matrix. Then RPMPFRFT is employed for changing the pixel values of color image, three components of the scrambled RGB color space are converted by RPMPFRFT with three different transform pairs, respectively. Comparing to the complex output transform, the RPMPFRFT transform ensures that the output is real which can save storage space of image and convenient for transmission in practical applications. To further enhance the security of the encryption system, the output of the former steps is scrambled by juxtaposition of sections of the image in the reality-preserving multiple-parameter fractional Fourier domains and the alignment of sections is determined by two coupled chaotic logistic maps. The parameters in the Color Blend, Chaos Permutation and the RPMPFRFT transform are regarded as the key in the encryption algorithm. The proposed color image encryption can also be applied to encrypt three gray images by transforming the gray images into three RGB color components of a specially constructed color image. Numerical simulations are performed to demonstrate that the proposed algorithm is feasible, secure, sensitive to keys and robust to noise attack and data loss.
Encryption Based on the Permutation of Cellular Automata%细胞自动机置换群加密技术研究
Institute of Scientific and Technical Information of China (English)
张传武; 彭启琮; 朱甫臣
2003-01-01
With the development of the information technology ,information security ,as well as the implementation ofthe encryption system becomes more and more complexity,and therefore new methods are explored to simplify com-plexity of the implementation. Cellular automata has the characters of simplicity of basic components ,locality of cellu-lar automata interactions ,massive parallelism of information processing ,and exhibits complex global properties, whichmakes it suitable for the application in cryptography. This paper presents a new method of encryption,the key of thenew method consists of the permutation cellular automata, the vectors inputted, and the number of the itera-tion. Evidently,it has larger kev space than other methods with only the cellular automata itself as the key.
Models and Methods for Free Material Optimization
DEFF Research Database (Denmark)
Weldeyesus, Alemseged Gebrehiwot
FMO problem formulations with stress constraints. These problems are highly nonlinear and lead to the so-called singularity phenomenon. The method described in the thesis has successfully solved these problems. In the numerical experiments the stress constraints have been satisfied with high...... conditions for physical attainability, in the context that, it has to be symmetric and positive semidefinite. FMO problems have been studied for the last two decades in many articles that led to the development of a wide range of models, methods, and theories. As the design variables in FMO are the local....... These problems are more difficult to solve and demand higher computational efforts than the standard optimization problems. The focus of today’s development of solution methods for FMO problems is based on first-order methods that require a large number of iterations to obtain optimal solutions. The scope...
Mathematical methods and models in composites
Mantic, Vladislav
2014-01-01
This book provides a representative selection of the most relevant, innovative, and useful mathematical methods and models applied to the analysis and characterization of composites and their behaviour on micro-, meso-, and macroscale. It establishes the fundamentals for meaningful and accurate theoretical and computer modelling of these materials in the future. Although the book is primarily concerned with fibre-reinforced composites, which have ever-increasing applications in fields such as aerospace, many of the results presented can be applied to other kinds of composites. The topics cover
Ganju, Jitendra; Yu, Xinxin; Ma, Guoguang Julie
2013-01-01
Formal inference in randomized clinical trials is based on controlling the type I error rate associated with a single pre-specified statistic. The deficiency of using just one method of analysis is that it depends on assumptions that may not be met. For robust inference, we propose pre-specifying multiple test statistics and relying on the minimum p-value for testing the null hypothesis of no treatment effect. The null hypothesis associated with the various test statistics is that the treatment groups are indistinguishable. The critical value for hypothesis testing comes from permutation distributions. Rejection of the null hypothesis when the smallest p-value is less than the critical value controls the type I error rate at its designated value. Even if one of the candidate test statistics has low power, the adverse effect on the power of the minimum p-value statistic is not much. Its use is illustrated with examples. We conclude that it is better to rely on the minimum p-value rather than a single statistic particularly when that single statistic is the logrank test, because of the cost and complexity of many survival trials.
Mathematical Models and Methods for Living Systems
Chaplain, Mark; Pugliese, Andrea
2016-01-01
The aim of these lecture notes is to give an introduction to several mathematical models and methods that can be used to describe the behaviour of living systems. This emerging field of application intrinsically requires the handling of phenomena occurring at different spatial scales and hence the use of multiscale methods. Modelling and simulating the mechanisms that cells use to move, self-organise and develop in tissues is not only fundamental to an understanding of embryonic development, but is also relevant in tissue engineering and in other environmental and industrial processes involving the growth and homeostasis of biological systems. Growth and organization processes are also important in many tissue degeneration and regeneration processes, such as tumour growth, tissue vascularization, heart and muscle functionality, and cardio-vascular diseases.
Multiphase Transformer Modelling using Finite Element Method
Directory of Open Access Journals (Sweden)
Nor Azizah Mohd Yusoff
2015-03-01
Full Text Available In the year of 1970 saw the starting invention of the five-phase motor as the milestone in advanced electric motor. Through the years, there are many researchers, which passionately worked towards developing for multiphase drive system. They developed a static transformation system to obtain a multiphase supply from the available three-phase supply. This idea gives an influence for further development in electric machines as an example; an efficient solution for bulk power transfer. This paper highlighted the detail descriptions that lead to five-phase supply with fixed voltage and frequency by using Finite-Element Method (FEM. Identifying of specification on a real transformer had been done before applied into software modeling. Therefore, Finite-Element Method provides clearly understandable in terms of visualize the geometry modeling, connection scheme and output waveform.
Matrix genetics, part 1: permutations of positions in triplets and symmetries of genetic matrices
Petoukhov, Sergey V
2008-01-01
The hidden connection between the degeneracy of the vertebrate mitochondria genetic code and the positional permutations inside genetic triplets is described. The Kronecker family of the genetic matrices is investigated, which is based on the genetic matrix [C A; U G], where C, A, U, G are the letters of the genetic alphabet. The natural system of binary numeration of genetic multiplets in the genetic matrices is proposed. The matrix [C A; U G] in the third Kronecker power is the (8*8)-matrix, which contains 64 triplets. When 64 triplets in this matrix are numbered in accordance with the natural system, the coincidence with the famous table of 64 hexagrams of the ancient Chinese book "I Ching" arises. It is significant that peculiarities of the degeneracy of the vertebrate mitochondria genetic code are reflected in the symmetrical black-and-white mosaic of this genetic (8*8)-matrix of 64 triplets. This matrix is reformed into a new mosaic matrix when internal positions in all triplets are permuted simultaneou...
Chaotic Image Encryption Algorithm Based on Bit Permutation and Dynamic DNA Encoding.
Zhang, Xuncai; Han, Feng; Niu, Ying
2017-01-01
With the help of the fact that chaos is sensitive to initial conditions and pseudorandomness, combined with the spatial configurations in the DNA molecule's inherent and unique information processing ability, a novel image encryption algorithm based on bit permutation and dynamic DNA encoding is proposed here. The algorithm first uses Keccak to calculate the hash value for a given DNA sequence as the initial value of a chaotic map; second, it uses a chaotic sequence to scramble the image pixel locations, and the butterfly network is used to implement the bit permutation. Then, the image is coded into a DNA matrix dynamic, and an algebraic operation is performed with the DNA sequence to realize the substitution of the pixels, which further improves the security of the encryption. Finally, the confusion and diffusion properties of the algorithm are further enhanced by the operation of the DNA sequence and the ciphertext feedback. The results of the experiment and security analysis show that the algorithm not only has a large key space and strong sensitivity to the key but can also effectively resist attack operations such as statistical analysis and exhaustive analysis.
Clifton, Ben E; Whitfield, Jason H; Sanchez-Romero, Inmaculada; Herde, Michel K; Henneberger, Christian; Janovjak, Harald; Jackson, Colin J
2017-01-01
Small molecule biosensors based on Förster resonance energy transfer (FRET) enable small molecule signaling to be monitored with high spatial and temporal resolution in complex cellular environments. FRET sensors can be constructed by fusing a pair of fluorescent proteins to a suitable recognition domain, such as a member of the solute-binding protein (SBP) superfamily. However, naturally occurring SBPs may be unsuitable for incorporation into FRET sensors due to their low thermostability, which may preclude imaging under physiological conditions, or because the positions of their N- and C-termini may be suboptimal for fusion of fluorescent proteins, which may limit the dynamic range of the resulting sensors. Here, we show how these problems can be overcome using ancestral protein reconstruction and circular permutation. Ancestral protein reconstruction, used as a protein engineering strategy, leverages phylogenetic information to improve the thermostability of proteins, while circular permutation enables the termini of an SBP to be repositioned to maximize the dynamic range of the resulting FRET sensor. We also provide a protocol for cloning the engineered SBPs into FRET sensor constructs using Golden Gate assembly and discuss considerations for in situ characterization of the FRET sensors.
Resonant Transmission Line Method for Econophysics models
Raptis, T E
2016-01-01
In a recent paper [1304.6846], Racorean introduced a formal similarity of the Black-Sholes stock pricing model with a Schr\\"odinger equation. We use a previously introduced method of a resonant transmission line for arbitrary 2nd order Sturm-Liouville problems to attack the same problem from a different perspective revealing some deep structures in the naturally associated eigenvalue problem.
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
Openness is one of the features of modern robot controllers. Although many modeling technologies have been discussed to model and develop open robot controllers, the focus is always on modeling methodologies. Meanwhile, the relations between the former and the latter are usually ignored. According to the general software architecture of open robot controllers, this paper discusses modeling and developing methods. And the relationships between the typical ones are also analyzed.
Method of generating a computer readable model
DEFF Research Database (Denmark)
2008-01-01
A method of generating a computer readable model of a geometrical object constructed from a plurality of interconnectable construction elements, wherein each construction element has a number of connection elements for connecting the construction element with another construction element....... The method comprises encoding a first and a second one of the construction elements as corresponding data structures, each representing the connection elements of the corresponding construction element, and each of the connection elements having associated with it a predetermined connection type. The method...... further comprises determining a first connection element of the first construction element and a second connection element of the second construction element located in a predetermined proximity of each other; and retrieving connectivity information of the corresponding connection types of the first...
Bayesian structural equation modeling method for hierarchical model validation
Energy Technology Data Exchange (ETDEWEB)
Jiang Xiaomo [Department of Civil and Environmental Engineering, Vanderbilt University, Box 1831-B, Nashville, TN 37235 (United States)], E-mail: xiaomo.jiang@vanderbilt.edu; Mahadevan, Sankaran [Department of Civil and Environmental Engineering, Vanderbilt University, Box 1831-B, Nashville, TN 37235 (United States)], E-mail: sankaran.mahadevan@vanderbilt.edu
2009-04-15
A building block approach to model validation may proceed through various levels, such as material to component to subsystem to system, comparing model predictions with experimental observations at each level. Usually, experimental data becomes scarce as one proceeds from lower to higher levels. This paper presents a structural equation modeling approach to make use of the lower-level data for higher-level model validation under uncertainty, integrating several components: lower-level data, higher-level data, computational model, and latent variables. The method proposed in this paper uses latent variables to model two sets of relationships, namely, the computational model to system-level data, and lower-level data to system-level data. A Bayesian network with Markov chain Monte Carlo simulation is applied to represent the two relationships and to estimate the influencing factors between them. Bayesian hypothesis testing is employed to quantify the confidence in the predictive model at the system level, and the role of lower-level data in the model validation assessment at the system level. The proposed methodology is implemented for hierarchical assessment of three validation problems, using discrete observations and time-series data.
A Method to Test Model Calibration Techniques
Energy Technology Data Exchange (ETDEWEB)
Judkoff, Ron; Polly, Ben; Neymark, Joel
2016-08-26
This paper describes a method for testing model calibration techniques. Calibration is commonly used in conjunction with energy retrofit audit models. An audit is conducted to gather information about the building needed to assemble an input file for a building energy modeling tool. A calibration technique is used to reconcile model predictions with utility data, and then the 'calibrated model' is used to predict energy savings from a variety of retrofit measures and combinations thereof. Current standards and guidelines such as BPI-2400 and ASHRAE-14 set criteria for 'goodness of fit' and assume that if the criteria are met, then the calibration technique is acceptable. While it is logical to use the actual performance data of the building to tune the model, it is not certain that a good fit will result in a model that better predicts post-retrofit energy savings. Therefore, the basic idea here is that the simulation program (intended for use with the calibration technique) is used to generate surrogate utility bill data and retrofit energy savings data against which the calibration technique can be tested. This provides three figures of merit for testing a calibration technique, 1) accuracy of the post-retrofit energy savings prediction, 2) closure on the 'true' input parameter values, and 3) goodness of fit to the utility bill data. The paper will also discuss the pros and cons of using this synthetic surrogate data approach versus trying to use real data sets of actual buildings.
Generic Sensor Modeling Using Pulse Method
Helder, Dennis L.; Choi, Taeyoung
2005-01-01
Recent development of high spatial resolution satellites such as IKONOS, Quickbird and Orbview enable observation of the Earth's surface with sub-meter resolution. Compared to the 30 meter resolution of Landsat 5 TM, the amount of information in the output image was dramatically increased. In this era of high spatial resolution, the estimation of spatial quality of images is gaining attention. Historically, the Modulation Transfer Function (MTF) concept has been used to estimate an imaging system's spatial quality. Sometimes classified by target shapes, various methods were developed in laboratory environment utilizing sinusoidal inputs, periodic bar patterns and narrow slits. On-orbit sensor MTF estimation was performed on 30-meter GSD Landsat4 Thematic Mapper (TM) data from the bridge pulse target as a pulse input . Because of a high resolution sensor s small Ground Sampling Distance (GSD), reasonably sized man-made edge, pulse, and impulse targets can be deployed on a uniform grassy area with accurate control of ground targets using tarps and convex mirrors. All the previous work cited calculated MTF without testing the MTF estimator's performance. In previous report, a numerical generic sensor model had been developed to simulate and improve the performance of on-orbit MTF estimating techniques. Results from the previous sensor modeling report that have been incorporated into standard MTF estimation work include Fermi edge detection and the newly developed 4th order modified Savitzky-Golay (MSG) interpolation technique. Noise sensitivity had been studied by performing simulations on known noise sources and a sensor model. Extensive investigation was done to characterize multi-resolution ground noise. Finally, angle simulation was tested by using synthetic pulse targets with angles from 2 to 15 degrees, several brightness levels, and different noise levels from both ground targets and imaging system. As a continuing research activity using the developed sensor
Approximate Methods for State-Space Models.
Koyama, Shinsuke; Pérez-Bolde, Lucia Castellanos; Shalizi, Cosma Rohilla; Kass, Robert E
2010-03-01
State-space models provide an important body of techniques for analyzing time-series, but their use requires estimating unobserved states. The optimal estimate of the state is its conditional expectation given the observation histories, and computing this expectation is hard when there are nonlinearities. Existing filtering methods, including sequential Monte Carlo, tend to be either inaccurate or slow. In this paper, we study a nonlinear filter for nonlinear/non-Gaussian state-space models, which uses Laplace's method, an asymptotic series expansion, to approximate the state's conditional mean and variance, together with a Gaussian conditional distribution. This Laplace-Gaussian filter (LGF) gives fast, recursive, deterministic state estimates, with an error which is set by the stochastic characteristics of the model and is, we show, stable over time. We illustrate the estimation ability of the LGF by applying it to the problem of neural decoding and compare it to sequential Monte Carlo both in simulations and with real data. We find that the LGF can deliver superior results in a small fraction of the computing time.
Engineering design of systems models and methods
Buede, Dennis M
2009-01-01
The ideal introduction to the engineering design of systems-now in a new edition. The Engineering Design of Systems, Second Edition compiles a wealth of information from diverse sources to provide a unique, one-stop reference to current methods for systems engineering. It takes a model-based approach to key systems engineering design activities and introduces methods and models used in the real world. Features new to this edition include: * The addition of Systems Modeling Language (SysML) to several of the chapters, as well as the introduction of new terminology * Additional material on partitioning functions and components * More descriptive material on usage scenarios based on literature from use case development * Updated homework assignments * The software product CORE (from Vitech Corporation) is used to generate the traditional SE figures and the software product MagicDraw UML with SysML plugins (from No Magic, Inc.) is used for the SysML figures This book is designed to be an introductory reference ...
A two-dimensional iterative panel method and boundary layer model for bio-inspired multi-body wings
Blower, Christopher J.; Dhruv, Akash; Wickenheiser, Adam M.
2014-03-01
The increased use of Unmanned Aerial Vehicles (UAVs) has created a continuous demand for improved flight capabilities and range of use. During the last decade, engineers have turned to bio-inspiration for new and innovative flow control methods for gust alleviation, maneuverability, and stability improvement using morphing aircraft wings. The bio-inspired wing design considered in this study mimics the flow manipulation techniques performed by birds to extend the operating envelope of UAVs through the installation of an array of feather-like panels across the airfoil's upper and lower surfaces while replacing the trailing edge flap. Each flap has the ability to deflect into both the airfoil and the inbound airflow using hinge points with a single degree-of-freedom, situated at 20%, 40%, 60% and 80% of the chord. The installation of the surface flaps offers configurations that enable advantageous maneuvers while alleviating gust disturbances. Due to the number of possible permutations available for the flap configurations, an iterative constant-strength doublet/source panel method has been developed with an integrated boundary layer model to calculate the pressure distribution and viscous drag over the wing's surface. As a result, the lift, drag and moment coefficients for each airfoil configuration can be calculated. The flight coefficients of this numerical method are validated using experimental data from a low speed suction wind tunnel operating at a Reynolds Number 300,000. This method enables the aerodynamic assessment of a morphing wing profile to be performed accurately and efficiently in comparison to Computational Fluid Dynamics methods and experiments as discussed herein.
ACTIVE AND PARTICIPATORY METHODS IN BIOLOGY: MODELING
Directory of Open Access Journals (Sweden)
Brînduşa-Antonela SBÎRCEA
2011-01-01
Full Text Available By using active and participatory methods it is hoped that pupils will not only come to a deeper understanding of the issues involved, but also that their motivation will be heightened. Pupil involvement in their learning is essential. Moreover, by using a variety of teaching techniques, we can help students make sense of the world in different ways, increasing the likelihood that they will develop a conceptual understanding. The teacher must be a good facilitator, monitoring and supporting group dynamics. Modeling is an instructional strategy in which the teacher demonstrates a new concept or approach to learning and pupils learn by observing. In the teaching of biology the didactic materials are fundamental tools in the teaching-learning process. Reading about scientific concepts or having a teacher explain them is not enough. Research has shown that modeling can be used across disciplines and in all grade and ability level classrooms. Using this type of instruction, teachers encourage learning.
Railway Track Allocation: Models and Methods
DEFF Research Database (Denmark)
Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias
2011-01-01
Efficiently coordinating the movement of trains on a railway network is a central part of the planning process for a railway company. This paper reviews models and methods that have been proposed in the literature to assist planners in finding train routes. Since the problem of routing trains...... on a railway network entails allocating the track capacity of the network (or part thereof) over time in a conflict-free manner, all studies that model railway track allocation in some capacity are considered relevant. We hence survey work on the train timetabling, train dispatching, train platforming......, and train routing problems, group them by railway network type, and discuss track allocation from a strategic, tactical, and operational level....
Railway Track Allocation: Models and Methods
DEFF Research Database (Denmark)
Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias
Eciently coordinating the movement of trains on a railway network is a central part of the planning process for a railway company. This paper reviews models and methods that have been proposed in the literature to assist planners in nding train routes. Since the problem of routing trains...... on a railway network entails allocating the track capacity of the network (or part thereof) over time in a con ict-free manner, all studies that model railway track allocation in some capacity are considered relevant. We hence survey work on the train timetabling, train dispatching, train platforming......, and train routing problems, group them by railway network type, and discuss track allocation from a strategic, tactical, and operational level....
Railway Track Allocation: Models and Methods
DEFF Research Database (Denmark)
Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias
Eciently coordinating the movement of trains on a railway network is a central part of the planning process for a railway company. This paper reviews models and methods that have been proposed in the literature to assist planners in nding train routes. Since the problem of routing trains...... on a railway network entails allocating the track capacity of the network (or part thereof) over time in a con ict-free manner, all studies that model railway track allocation in some capacity are considered relevant. We hence survey work on the train timetabling, train dispatching, train platforming......, and train routing problems, group them by railway network type, and discuss track allocation from a strategic, tactical, and operational level....
A PSL Bounded Model Checking Method
Institute of Scientific and Technical Information of China (English)
YU Lei; ZHAO Zongtao
2012-01-01
SAT-based bounded model checking （BMC） is introduced as an important complementary technique to OBDD-based symbolic model checking, and is an efficient verification method for parallel and reactive systems. However, until now the properties verified by bounded model checking are very finite. Temporal logic PSL is a property specification language （IEEE-1850） describing parallel systems and is divided into two parts, i.e. the linear time logic FL and the branch time logic OBE. In this paper, the specification checked by BMC is extended to PSL and its algorithm is also proposed. Firstly, define the bounded semantics of PSL, and then reduce the bounded semantics into SAT by translating PSL specification formula and the state transition relation of the system to the propositional formula A and B, respectively. Finally, verify the satisfiability of the conjunction propositional formula of A and B. The algorithm results in the translation of the existential model checking of the temporal logic PSL into the satisfiability problem of propositional formula. An example of a queue controlling circuit is used to interpret detailedly the executing procedure of the algorithm.
Finite element modeling methods for photonics
Rahman, B M Azizur
2013-01-01
The term photonics can be used loosely to refer to a vast array of components, devices, and technologies that in some way involve manipulation of light. One of the most powerful numerical approaches available to engineers developing photonic components and devices is the Finite Element Method (FEM), which can be used to model and simulate such components/devices and analyze how they will behave in response to various outside influences. This resource provides a comprehensive description of the formulation and applications of FEM in photonics applications ranging from telecommunications, astron
Mechanics, Models and Methods in Civil Engineering
Maceri, Franco
2012-01-01
„Mechanics, Models and Methods in Civil Engineering” collects leading papers dealing with actual Civil Engineering problems. The approach is in the line of the Italian-French school and therefore deeply couples mechanics and mathematics creating new predictive theories, enhancing clarity in understanding, and improving effectiveness in applications. The authors of the contributions collected here belong to the Lagrange Laboratory, an European Research Network active since many years. This book will be of a major interest for the reader aware of modern Civil Engineering.
Statistical Models and Methods for Lifetime Data
Lawless, Jerald F
2011-01-01
Praise for the First Edition"An indispensable addition to any serious collection on lifetime data analysis and . . . a valuable contribution to the statistical literature. Highly recommended . . ."-Choice"This is an important book, which will appeal to statisticians working on survival analysis problems."-Biometrics"A thorough, unified treatment of statistical models and methods used in the analysis of lifetime data . . . this is a highly competent and agreeable statistical textbook."-Statistics in MedicineThe statistical analysis of lifetime or response time data is a key tool in engineering,
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
Inference of change-point in single index models
Institute of Scientific and Technical Information of China (English)
CAO GuanQun; WANG ZhanFeng; WU YaoHua; ZHAO LinCheng
2008-01-01
Single index models are widely used in medicine,econometrics and some other fields.In this paper,we consider the inference of a change point problem in single index models.Based on density-weighted average derivative estimation (ADE) method,we propose a statistic to test whether a change point exists or not.The null distribution of the test statistic is obtained using a permutation technique.The permuted statistic is rigorously shown to have the same distribution in the limiting sense under both null and alternative hypotheses.After the null hypothesis of no change point is rejected,an ADE-based estimate of the change point is proposed under assumption that the change point is unique.A simulation study confirms the theoretical results.
Inference of change-point in single index models
Institute of Scientific and Technical Information of China (English)
2008-01-01
Single index models are widely used in medicine, econometrics and some other fields. In this paper, we consider the inference of a change point problem in single index models. Based on density-weighted average derivative estimation (ADE) method, we propose a statistic to test whether a change point exists or not. The null distribution of the test statistic is obtained using a permutation technique. The permuted statistic is rigorously shown to have the same distribution in the limiting sense under both null and alternative hypotheses. After the null hypothesis of no change point is rejected, an ADE-based estimate of the change point is proposed under assumption that the change point is unique. A simulation study confirms the theoretical results.
Directory of Open Access Journals (Sweden)
Naseer Aisha
2011-05-01
Full Text Available Abstract Background There is an increasing recognition that modelling and simulation can assist in the process of designing health care policies, strategies and operations. However, the current use is limited and answers to questions such as what methods to use and when remain somewhat underdeveloped. Aim The aim of this study is to provide a mechanism for decision makers in health services planning and management to compare a broad range of modelling and simulation methods so that they can better select and use them or better commission relevant modelling and simulation work. Methods This paper proposes a modelling and simulation method comparison and selection tool developed from a comprehensive literature review, the research team's extensive expertise and inputs from potential users. Twenty-eight different methods were identified, characterised by their relevance to different application areas, project life cycle stages, types of output and levels of insight, and four input resources required (time, money, knowledge and data. Results The characterisation is presented in matrix forms to allow quick comparison and selection. This paper also highlights significant knowledge gaps in the existing literature when assessing the applicability of particular approaches to health services management, where modelling and simulation skills are scarce let alone money and time. Conclusions A modelling and simulation method comparison and selection tool is developed to assist with the selection of methods appropriate to supporting specific decision making processes. In particular it addresses the issue of which method is most appropriate to which specific health services management problem, what the user might expect to be obtained from the method, and what is required to use the method. In summary, we believe the tool adds value to the scarce existing literature on methods comparison and selection.
ALTMANN, BERTHOLD; BROWN, WILLIAM G.
THE FIRST-GENERATION APPROACH BY CONCEPT (ABC) STORAGE AND RETRIEVAL METHOD, A METHOD WHICH UTILIZES AS A SUBJECT APPROACH APPROPRIATE STANDARDIZED ENGLISH-LANGUAGE STATEMENTS PROCESSED AND PRINTED IN A PERMUTED INDEX FORMAT, UNDERWENT A PERFORMANCE TEST, THE PRIMARY OBJECTIVE OF WHICH WAS TO SPOT DEFICIENCIES AND TO DEVELOP A SECOND-GENERATION…
ALTMANN, BERTHOLD; BROWN, WILLIAM G.
THE FIRST-GENERATION APPROACH BY CONCEPT (ABC) STORAGE AND RETRIEVAL METHOD, A METHOD WHICH UTILIZES AS A SUBJECT APPROACH APPROPRIATE STANDARDIZED ENGLISH-LANGUAGE STATEMENTS PROCESSED AND PRINTED IN A PERMUTED INDEX FORMAT, UNDERWENT A PERFORMANCE TEST, THE PRIMARY OBJECTIVE OF WHICH WAS TO SPOT DEFICIENCIES AND TO DEVELOP A SECOND-GENERATION…
System and method of designing models in a feedback loop
Energy Technology Data Exchange (ETDEWEB)
Gosink, Luke C.; Pulsipher, Trenton C.; Sego, Landon H.
2017-02-14
A method and system for designing models is disclosed. The method includes selecting a plurality of models for modeling a common event of interest. The method further includes aggregating the results of the models and analyzing each model compared to the aggregate result to obtain comparative information. The method also includes providing the information back to the plurality of models to design more accurate models through a feedback loop.
Appropriate model selection methods for nonstationary generalized extreme value models
Kim, Hanbeen; Kim, Sooyoung; Shin, Hongjoon; Heo, Jun-Haeng
2017-04-01
Several evidences of hydrologic data series being nonstationary in nature have been found to date. This has resulted in the conduct of many studies in the area of nonstationary frequency analysis. Nonstationary probability distribution models involve parameters that vary over time. Therefore, it is not a straightforward process to apply conventional goodness-of-fit tests to the selection of an appropriate nonstationary probability distribution model. Tests that are generally recommended for such a selection include the Akaike's information criterion (AIC), corrected Akaike's information criterion (AICc), Bayesian information criterion (BIC), and likelihood ratio test (LRT). In this study, the Monte Carlo simulation was performed to compare the performances of these four tests, with regard to nonstationary as well as stationary generalized extreme value (GEV) distributions. Proper model selection ratios and sample sizes were taken into account to evaluate the performances of all the four tests. The BIC demonstrated the best performance with regard to stationary GEV models. In case of nonstationary GEV models, the AIC proved to be better than the other three methods, when relatively small sample sizes were considered. With larger sample sizes, the AIC, BIC, and LRT presented the best performances for GEV models which have nonstationary location and/or scale parameters, respectively. Simulation results were then evaluated by applying all four tests to annual maximum rainfall data of selected sites, as observed by the Korea Meteorological Administration.
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.
Construção de códigos ciclicamente permutáveis
LEMOS NETO, José Sampaio de
2015-01-01
Um código ciclicamente permutável (código CP) é um código de bloco binário cujas palavrasc ódigo são ciclicamente distintas e possuem ordem cíclica plena, isto é, ordem cíclica igual ao comprimento do bloco. Um código CP pode ser construído por meio de um código cíclico. Para isto, selecionam-se as palavras do código cíclico que são ciclicamente distintas e possuem ordem cíclica plena. Um procedimento que seleciona diretamente, por meio de uma condição matemática, as palavras d...
xu, Dengming
2017-03-01
We construct mutually unbiased maximally entangled bases (MUMEBs) in bipartite system C^d⊗ C^d (d≥ 3) with d a power of a prime number. Precisely, by means of permutation matrices and Hadamard matrices, we construct 2(d-1) MUMEBs in C^d⊗ C}^d. It follows that M(d,d)≥ 2(d-1), which is twice the number given in Liu et al. (2016), where M( d, d) denotes the maximal size of all sets of MUMEBs in C^d⊗ C}^d. In addition, let q be another power of a prime number, we construct MUMEBs in C^d⊗ C^{qd} from those in C^d⊗ C^d by the use of the tensor product of unitary matrices.
Accurate DOSY measure of out-of-equilibrium systems by permutated DOSY (p-DOSY)
Oikonomou, Maria; Velders, Aldrik H; Delsuc, Marc-André
2015-01-01
NMR spectroscopy is a perfect tool for monitoring in-situ chemical reactions. In particular, DOSY measurement is well suited to characterize transient species by the determination of their sizes. However, here we bring to light a difficulty in the DOSY experiments performed on out-of-equilibrium systems. On such a system, the evolution of the concentration of species interferes with the measurement process, and creates a bias on the diffusion coefficient determination that may lead to erroneous interpretations. We show that a random permutation of the series of gradient strengths used during the DOSY experiment allows to average out this bias. This approach, that we name p-DOSY does not require changes in the the pulse sequences nor in the processing software, and restores completely the full accuracy of the measure. This technique is demonstrated on the monitoring of the anomerization reaction of $\\alpha$ to $\\beta$ glucose.
Method of and apparatus for modeling interactions
Budge, Kent G.
2004-01-13
A method and apparatus for modeling interactions can accurately model tribological and other properties and accommodate topological disruptions. Two portions of a problem space are represented, a first with a Lagrangian mesh and a second with an ALE mesh. The ALE and Lagrangian meshes are constructed so that each node on the surface of the Lagrangian mesh is in a known correspondence with adjacent nodes in the ALE mesh. The interaction can be predicted for a time interval. Material flow within the ALE mesh can accurately model complex interactions such as bifurcation. After prediction, nodes in the ALE mesh in correspondence with nodes on the surface of the Lagrangian mesh can be mapped so that they are once again adjacent to their corresponding Lagrangian mesh nodes. The ALE mesh can then be smoothed to reduce mesh distortion that might reduce the accuracy or efficiency of subsequent prediction steps. The process, from prediction through mapping and smoothing, can be repeated until a terminal condition is reached.
Jun, Gyuchan T; Morris, Zoe; Eldabi, Tillal; Harper, Paul; Naseer, Aisha; Patel, Brijesh; Clarkson, John P
2011-05-19
There is an increasing recognition that modelling and simulation can assist in the process of designing health care policies, strategies and operations. However, the current use is limited and answers to questions such as what methods to use and when remain somewhat underdeveloped. The aim of this study is to provide a mechanism for decision makers in health services planning and management to compare a broad range of modelling and simulation methods so that they can better select and use them or better commission relevant modelling and simulation work. This paper proposes a modelling and simulation method comparison and selection tool developed from a comprehensive literature review, the research team's extensive expertise and inputs from potential users. Twenty-eight different methods were identified, characterised by their relevance to different application areas, project life cycle stages, types of output and levels of insight, and four input resources required (time, money, knowledge and data). The characterisation is presented in matrix forms to allow quick comparison and selection. This paper also highlights significant knowledge gaps in the existing literature when assessing the applicability of particular approaches to health services management, where modelling and simulation skills are scarce let alone money and time. A modelling and simulation method comparison and selection tool is developed to assist with the selection of methods appropriate to supporting specific decision making processes. In particular it addresses the issue of which method is most appropriate to which specific health services management problem, what the user might expect to be obtained from the method, and what is required to use the method. In summary, we believe the tool adds value to the scarce existing literature on methods comparison and selection.
Structural consequences of cutting a binding loop: two circularly permuted variants of streptavidin
Energy Technology Data Exchange (ETDEWEB)
Le Trong, Isolde [University of Washington, Box 357420, Seattle, WA 98195-7420 (United States); University of Washington, Box 357742, Seattle, WA 98195-7742 (United States); Chu, Vano [University of Washington, Box 355061, Seattle, WA 98195-5061 (United States); Xing, Yi [University of Washington, Box 357420, Seattle, WA 98195-7420 (United States); Lybrand, Terry P. [Vanderbilt University, 5142 Medical Research Building III, 465 21st Avenue South, Nashville, TN 37232-8725 (United States); Stayton, Patrick S. [University of Washington, Box 355061, Seattle, WA 98195-5061 (United States); Stenkamp, Ronald E., E-mail: stenkamp@u.washington.edu [University of Washington, Box 357420, Seattle, WA 98195-7420 (United States); University of Washington, Box 357742, Seattle, WA 98195-7742 (United States); University of Washington, Box 357430, Seattle, WA 98195-7430 (United States)
2013-06-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.
Itoh, Satoru G; Okumura, Hisashi
2014-10-02
The amyloid-β peptides form amyloid fibrils which are associated with Alzheimer's disease. Amyloid-β(29-42) is its C-terminal fragment and a critical determinant of the amyloid formation rate. This fragment forms the amyloid fibril by itself. However, the fragment conformation in the fibril has yet to be determined. The oligomerization process including the dimerization process is also still unknown. The dimerization process corresponds to an early process of the amyloidogenesis. In order to investigate the dimerization process and conformations, we applied the Hamiltonian replica-permutation method, which is a better alternative to the Hamiltonian replica-exchange method, to two amyloid-β(29-42) molecules in explicit water solvent. At the first step of the dimerization process, two amyloid-β(29-42) molecules came close to each other and had intermolecular side chain contacts. When two molecules had the intermolecular side chain contacts, the amyloid-β(29-42) tended to have intramolecular secondary structures, especially β-hairpin structures. The two molecules had intermolecular β-bridge structures by coming much closer at the second step of the dimerization process. Formation of these intermolecular β-bridge structures was induced by the β-hairpin structures. The intermolecular β-sheet structures elongated at the final step. Structures of the amyloid-β(29-42) in the monomer and dimer states are also shown with the free-energy landscapes, which were obtained by performing efficient sampling in the conformational space in our simulations.
DEFF Research Database (Denmark)
Bogdanov, Andrey; Knudsen, L.R.; Leander, Gregor
2012-01-01
This paper considers—for the first time—the concept of key-alternating ciphers in a provable security setting. Key-alternating ciphers can be seen as a generalization of a construction proposed by Even and Mansour in 1991. This construction builds a block cipher PX from an n-bit permutation P and...
Itoh, Satoru G; Okumura, Hisashi
2016-07-14
Oligomers of amyloid-β peptides (Aβ) are formed during the early stage of the amyloidogenesis process and exhibit neurotoxicity. The oligomer formation process of Aβ and even that of Aβ fragments are still poorly understood, though understanding of these processes is essential for remedying Alzheimer's disease. In order to better understand the oligomerization process of the C-terminal Aβ fragment Aβ(29-42) at the atomic level, we performed the Hamiltonian replica-permutation molecular dynamics simulation with Aβ(29-42) molecules using the explicit water solvent model. We observed that oligomers increased in size through the sequential addition of monomers to the oligomer, rather than through the assembly of small oligomers. Moreover, solvent effects played an important role in this oligomerization process.
基于排列熵的径流突变识别%Application of permutation entropy to runoff mutation analysis
Institute of Scientific and Technical Information of China (English)
李五勤; 王义民; 孙东永; 黄强
2014-01-01
针对变化环境下的径流序列表现出来的复杂性,采用排列熵对径流序列的突变性进行分析.采用相空间重构建立新的向量,计算序列的动力学熵值变化特征,通过熵值的变化规律进行序列突变点位置和数目的识别.利用该方法对黄河流域花园口站1919-1998年共79年的天然月径流序列的突变进行了实际验证.结果表明,排列熵能够有效地对序列的突变进行检测,检测到的突变年和气候的突变有着很好的响应关系.排列熵值的变化可以很好地刻画序列的突变特征,从序列的复杂性入手可以有效地对序列的突变进行分析.%Permutation entropy is adopted to analyze the mutation of runoff series that could be complicated under changeable environments.New vectors are constructed by phase space reconstruction,and their dynamic characteristics of entropy variation are calculated.Then by the variation trends of entropy,the location and number of the mutation points can be identified.This method was verified using a natural monthly runoff series from 1919 to 1998 of the Huayuankou hydrometric station on the Yellow River.The results indicate that the mutation can be efficiently tested and identified with permutation entropy,and the detected mutation shows a very good response to climate mutation.Mutation characteristics of a runoff series can be well depicted by the changes of permutation entropy,so the mutation can be effectively analyzed according to the complexity of the series.
Modeling of nanoplastic by asymptotic homogenization method
Institute of Scientific and Technical Information of China (English)
张为民; 何伟; 李亚; 张平; 张淳源
2008-01-01
The so-called nanoplastic is a new simple name for the polymer/layered silicate nanocomposite,which possesses excellent properties.The asymptotic homogenization method(AHM) was applied to determine numerically the effective elastic modulus of a two-phase nanoplastic with different particle aspect ratios,different ratios of elastic modulus of the effective particle to that of the matrix and different volume fractions.A simple representative volume element was proposed,which is assumed that the effective particles are uniform well-aligned and perfectly bonded in an isotropic matrix and have periodic structure.Some different theoretical models and the experimental results were compared.The numerical results are good in agreement with the experimental results.
Mathematical models and methods for planet Earth
Locatelli, Ugo; Ruggeri, Tommaso; Strickland, Elisabetta
2014-01-01
In 2013 several scientific activities have been devoted to mathematical researches for the study of planet Earth. The current volume presents a selection of the highly topical issues presented at the workshop “Mathematical Models and Methods for Planet Earth”, held in Roma (Italy), in May 2013. The fields of interest span from impacts of dangerous asteroids to the safeguard from space debris, from climatic changes to monitoring geological events, from the study of tumor growth to sociological problems. In all these fields the mathematical studies play a relevant role as a tool for the analysis of specific topics and as an ingredient of multidisciplinary problems. To investigate these problems we will see many different mathematical tools at work: just to mention some, stochastic processes, PDE, normal forms, chaos theory.
Gait variability: methods, modeling and meaning
Directory of Open Access Journals (Sweden)
Hausdorff Jeffrey M
2005-07-01
Full Text Available Abstract The study of gait variability, the stride-to-stride fluctuations in walking, offers a complementary way of quantifying locomotion and its changes with aging and disease as well as a means of monitoring the effects of therapeutic interventions and rehabilitation. Previous work has suggested that measures of gait variability may be more closely related to falls, a serious consequence of many gait disorders, than are measures based on the mean values of other walking parameters. The Current JNER series presents nine reports on the results of recent investigations into gait variability. One novel method for collecting unconstrained, ambulatory data is reviewed, and a primer on analysis methods is presented along with a heuristic approach to summarizing variability measures. In addition, the first studies of gait variability in animal models of neurodegenerative disease are described, as is a mathematical model of human walking that characterizes certain complex (multifractal features of the motor control's pattern generator. Another investigation demonstrates that, whereas both healthy older controls and patients with a higher-level gait disorder walk more slowly in reduced lighting, only the latter's stride variability increases. Studies of the effects of dual tasks suggest that the regulation of the stride-to-stride fluctuations in stride width and stride time may be influenced by attention loading and may require cognitive input. Finally, a report of gait variability in over 500 subjects, probably the largest study of this kind, suggests how step width variability may relate to fall risk. Together, these studies provide new insights into the factors that regulate the stride-to-stride fluctuations in walking and pave the way for expanded research into the control of gait and the practical application of measures of gait variability in the clinical setting.
Directory of Open Access Journals (Sweden)
Chowdhary Gopal
2012-08-01
Full Text Available Abstract Background High-accuracy prediction tools are essential in the post-genomic era to define organellar proteomes in their full complexity. We recently applied a discriminative machine learning approach to predict plant proteins carrying peroxisome targeting signals (PTS type 1 from genome sequences. For Arabidopsis thaliana 392 gene models were predicted to be peroxisome-targeted. The predictions were extensively tested in vivo, resulting in a high experimental verification rate of Arabidopsis proteins previously not known to be peroxisomal. Results In this study, we experimentally validated the predictions in greater depth by focusing on the most challenging Arabidopsis proteins with unknown non-canonical PTS1 tripeptides and prediction scores close to the threshold. By in vivo subcellular targeting analysis, three novel PTS1 tripeptides (QRL>, SQM>, and SDL> and two novel tripeptide residues (Q at position −3 and D at pos. -2 were identified. To understand why, among many Arabidopsis proteins carrying the same C-terminal tripeptides, these proteins were specifically predicted as peroxisomal, the residues upstream of the PTS1 tripeptide were computationally permuted and the changes in prediction scores were analyzed. The newly identified Arabidopsis proteins were found to contain four to five amino acid residues of high predicted targeting enhancing properties at position −4 to −12 in front of the non-canonical PTS1 tripeptide. The identity of the predicted targeting enhancing residues was unexpectedly diverse, comprising besides basic residues also proline, hydroxylated (Ser, Thr, hydrophobic (Ala, Val, and even acidic residues. Conclusions Our computational and experimental analyses demonstrate that the plant PTS1 tripeptide motif is more diverse than previously thought, including an increasing number of non-canonical sequences and allowed residues. Specific targeting enhancing elements can be predicted for particular sequences
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
Functional methods in the generalized Dicke model
Energy Technology Data Exchange (ETDEWEB)
Alcalde, M. Aparicio; Lemos, A.L.L. de; Svaiter, N.F. [Centro Brasileiro de Pesquisas Fisicas (CBPF), Rio de Janeiro, RJ (Brazil)]. E-mails: aparicio@cbpf.br; aluis@cbpf.br; nfuxsvai@cbpf.br
2007-07-01
The Dicke model describes an ensemble of N identical two-level atoms (qubits) coupled to a single quantized mode of a bosonic field. The fermion Dicke model should be obtained by changing the atomic pseudo-spin operators by a linear combination of Fermi operators. The generalized fermion Dicke model is defined introducing different coupling constants between the single mode of the bosonic field and the reservoir, g{sub 1} and g{sub 2} for rotating and counter-rotating terms respectively. In the limit N -> {infinity}, the thermodynamic of the fermion Dicke model can be analyzed using the path integral approach with functional method. The system exhibits a second order phase transition from normal to superradiance at some critical temperature with the presence of a condensate. We evaluate the critical transition temperature and present the spectrum of the collective bosonic excitations for the general case (g{sub 1} {ne} 0 and g{sub 2} {ne} 0). There is quantum critical behavior when the coupling constants g{sub 1} and g{sub 2} satisfy g{sub 1} + g{sub 2}=({omega}{sub 0} {omega}){sup 1/2}, where {omega}{sub 0} is the frequency of the mode of the field and {omega} is the energy gap between energy eigenstates of the qubits. Two particular situations are analyzed. First, we present the spectrum of the collective bosonic excitations, in the case g{sub 1} {ne} 0 and g{sub 2} {ne} 0, recovering the well known results. Second, the case g{sub 1} {ne} 0 and g{sub 2} {ne} 0 is studied. In this last case, it is possible to have a super radiant phase when only virtual processes are introduced in the interaction Hamiltonian. Here also appears a quantum phase transition at the critical coupling g{sub 2} ({omega}{sub 0} {omega}){sup 1/2}, and for larger values for the critical coupling, the system enter in this super radiant phase with a Goldstone mode. (author)
Exact Diagonalization of Heisenberg SU(N) models.
Nataf, Pierre; Mila, Frédéric
2014-09-19
Building on advanced results on permutations, we show that it is possible to construct, for each irreducible representation of SU(N), an orthonormal basis labeled by the set of standard Young tableaux in which the matrix of the Heisenberg SU(N) model (the quantum permutation of N-color objects) takes an explicit and extremely simple form. Since the relative dimension of the full Hilbert space to that of the singlet space on n sites increases very fast with N, this formulation allows us to extend exact diagonalizations of finite clusters to much larger values of N than accessible so far. Using this method, we show that, on the square lattice, there is long-range color order for SU(5), spontaneous dimerization for SU(8), and evidence in favor of a quantum liquid for SU(10).
Free wake models for vortex methods
Energy Technology Data Exchange (ETDEWEB)
Kaiser, K. [Technical Univ. Berlin, Aerospace Inst. (Germany)
1997-08-01
The blade element method works fast and good. For some problems (rotor shapes or flow conditions) it could be better to use vortex methods. Different methods for calculating a wake geometry will be presented. (au)
CONTROL SYSTEM IDENTIFICATION THROUGH MODEL MODULATION METHODS
identification has been achieved by using model modulation techniques to drive dynamic models into correspondence with operating control systems. The system ... identification then proceeded from examination of the model and the adaptive loop. The model modulation techniques applied to adaptive control
GREENSCOPE: A Method for Modeling Chemical Process ...
Current work within the U.S. Environmental Protection Agency’s National Risk Management Research Laboratory is focused on the development of a method for modeling chemical process sustainability. The GREENSCOPE methodology, defined for the four bases of Environment, Economics, Efficiency, and Energy, can evaluate processes with over a hundred different indicators. These indicators provide a means for realizing the principles of green chemistry and green engineering in the context of sustainability. Development of the methodology has centered around three focal points. One is a taxonomy of impacts that describe the indicators and provide absolute scales for their evaluation. The setting of best and worst limits for the indicators allows the user to know the status of the process under study in relation to understood values. Thus, existing or imagined processes can be evaluated according to their relative indicator scores, and process modifications can strive towards realizable targets. A second area of focus is in advancing definitions of data needs for the many indicators of the taxonomy. Each of the indicators has specific data that is necessary for their calculation. Values needed and data sources have been identified. These needs can be mapped according to the information source (e.g., input stream, output stream, external data, etc.) for each of the bases. The user can visualize data-indicator relationships on the way to choosing selected ones for evalua
A model-based circular binary segmentation algorithm for the analysis of array CGH data
Directory of Open Access Journals (Sweden)
Tu Shih-Hsin
2011-10-01
Full Text Available Abstract Background Circular Binary Segmentation (CBS is a permutation-based algorithm for array Comparative Genomic Hybridization (aCGH data analysis. CBS accurately segments data by detecting change-points using a maximal-t test; but extensive computational burden is involved for evaluating the significance of change-points using permutations. A recent implementation utilizing a hybrid method and early stopping rules (hybrid CBS to improve the performance in speed was subsequently proposed. However, a time analysis revealed that a major portion of computation time of the hybrid CBS was still spent on permutation. In addition, what the hybrid method provides is an approximation of the significance upper bound or lower bound, not an approximation of the significance of change-points itself. Results We developed a novel model-based algorithm, extreme-value based CBS (eCBS, which limits permutations and provides robust results without loss of accuracy. Thousands of aCGH data under null hypothesis were simulated in advance based on a variety of non-normal assumptions, and the corresponding maximal-t distribution was modeled by the Generalized Extreme Value (GEV distribution. The modeling results, which associate characteristics of aCGH data to the GEV parameters, constitute lookup tables (eXtreme model. Using the eXtreme model, the significance of change-points could be evaluated in a constant time complexity through a table lookup process. Conclusions A novel algorithm, eCBS, was developed in this study. The current implementation of eCBS consistently outperforms the hybrid CBS 4× to 20× in computation time without loss of accuracy. Source codes, supplementary materials, supplementary figures, and supplementary tables can be found at http://ntumaps.cgm.ntu.edu.tw/eCBSsupplementary.
Hepatocyte autophagy model established by physical method
Directory of Open Access Journals (Sweden)
ZHU Xuemin
2016-08-01
Full Text Available ObjectiveTo establish the autophagy model of normal human liver cell line 7702 induced by hypoxia and starvation, and to lay a foundation for further studies on the influence of autophagy on liver function. MethodsThe 7702 cells were selected and incubated with 95% air and 5% CO2 at a temperature of 37 ℃(normal control group. The Binder three-gas incubator was used, with a temperature of 37 ℃, a CO2 concentration of 5%, and an O2 concentration of 0.3% to provide a hypoxic environment, and the serum-free DMEM was used to induce starvation. These cells were divided into 6-, 12-, 18-, and 24-hour hypoxia-starvation groups. Western blot was used to measure the protein expression of Beclin 1, Atg5, and LC3 in the normal control group and experimental groups, RT-qPCR was used to measure the mRNA expression of Beclin 1 and Atg5 in each group, and after transfection of LC3 plasmid, immunofluorescence assay was used to observe autophagy in each group. An analysis of variance was used for comparison of continuous data between groups, and the least significant difference t-test was used for further comparison between any two groups; the chi-square test was used for comparison of categorical data between groups. ResultsThe 6-hour hypoxia-starvation groups had higher protein expression of Beclin 1, Atg5, and LC3 than the normal control group or other treated groups. Compared with all the other groups, the 6-hour hypoxia-starvation group showed significantly increased mRNA expression of Beclin 1 and Atg5, as well as significantly greater increases in the mRNA expression of Beclin 1 and Atg5 (all P＜0.05. The hypoxia-starvation groups had significantly lower numbers of autophagosomes than the normal control group, and the 6-hour hypoxia-starvation group had the highest number of autophagosomes (all P＜0.05. ConclusionHypoxia and starvation established by physical methods can successfully induce hepatocyte autophagy, which is the most remarkable at 6
Model reduction methods for vector autoregressive processes
Brüggemann, Ralf
2004-01-01
1. 1 Objective of the Study Vector autoregressive (VAR) models have become one of the dominant research tools in the analysis of macroeconomic time series during the last two decades. The great success of this modeling class started with Sims' (1980) critique of the traditional simultaneous equation models (SEM). Sims criticized the use of 'too many incredible restrictions' based on 'supposed a priori knowledge' in large scale macroeconometric models which were popular at that time. Therefore, he advo cated largely unrestricted reduced form multivariate time series models, unrestricted VAR models in particular. Ever since his influential paper these models have been employed extensively to characterize the underlying dynamics in systems of time series. In particular, tools to summarize the dynamic interaction between the system variables, such as impulse response analysis or forecast error variance decompo sitions, have been developed over the years. The econometrics of VAR models and related quantities i...
A business case method for business models
Meertens, Lucas Onno; Starreveld, E.; Iacob, Maria Eugenia; Nieuwenhuis, Lambertus Johannes Maria; Shishkov, Boris
2013-01-01
Intuitively, business cases and business models are closely connected. However, a thorough literature review revealed no research on the combination of them. Besides that, little is written on the evaluation of business models at all. This makes it difficult to compare different business model
Computational Modelling in Cancer: Methods and Applications
Directory of Open Access Journals (Sweden)
Konstantina Kourou
2015-01-01
Full Text Available Computational modelling of diseases is an emerging field, proven valuable for the diagnosis, prognosis and treatment of the disease. Cancer is one of the diseases where computational modelling provides enormous advancements, allowing the medical professionals to perform in silico experiments and gain insights prior to any in vivo procedure. In this paper, we review the most recent computational models that have been proposed for cancer. Well known databases used for computational modelling experiments, as well as, the various markup language representations are discussed. In addition, recent state of the art research studies related to tumour growth and angiogenesis modelling are presented.
Model correction factor method for system analysis
DEFF Research Database (Denmark)
Ditlevsen, Ove Dalager; Johannesen, Johannes M.
2000-01-01
severallocally most central points exist without there being a simple geometric definition of the corresponding failuremodes such as is the case for collapse mechanisms in rigid plastic hinge models for frame structures. Taking as simplifiedidealized model a model of similarity with the elaborate model...... but with clearly defined failure modes, the MCFM can bestarted from each idealized single mode limit state in turn to identify a locally most central point on the elaborate limitstate surface. Typically this procedure leads to a fewer number of locally most central failure points on the elaboratelimit state...... surface than existing in the idealized model....
Institute of Scientific and Technical Information of China (English)
林慧苹; 范玉顺; 吴澄
2001-01-01
Many enterprise modeling methods are proposed to model thebusiness process of enterprises and to implement CIM systems. But difficulties are still encountered when these methods are applied to the CIM system design and implementation. This paper proposes a new integrated enterprise modeling methodology based on the workflow model. The system architecture and the integrated modeling environment are described with a new simulation strategy. The modeling process and the relationship between the workflow model and the views are discussed.
How Qualitative Methods Can be Used to Inform Model Development.
Husbands, Samantha; Jowett, Susan; Barton, Pelham; Coast, Joanna
2017-06-01
Decision-analytic models play a key role in informing healthcare resource allocation decisions. However, there are ongoing concerns with the credibility of models. Modelling methods guidance can encourage good practice within model development, but its value is dependent on its ability to address the areas that modellers find most challenging. Further, it is important that modelling methods and related guidance are continually updated in light of any new approaches that could potentially enhance model credibility. The objective of this article was to highlight the ways in which qualitative methods have been used and recommended to inform decision-analytic model development and enhance modelling practices. With reference to the literature, the article discusses two key ways in which qualitative methods can be, and have been, applied. The first approach involves using qualitative methods to understand and inform general and future processes of model development, and the second, using qualitative techniques to directly inform the development of individual models. The literature suggests that qualitative methods can improve the validity and credibility of modelling processes by providing a means to understand existing modelling approaches that identifies where problems are occurring and further guidance is needed. It can also be applied within model development to facilitate the input of experts to structural development. We recommend that current and future model development would benefit from the greater integration of qualitative methods, specifically by studying 'real' modelling processes, and by developing recommendations around how qualitative methods can be adopted within everyday modelling practice.
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.
Chan, Angel; Yang, Wenchun; Chang, Franklin; Kidd, Evan
2017-06-13
We report on an eye-tracking study that investigated four-year-old Cantonese-speaking children's online processing of subject and object relative clauses (RCs). Children's eye-movements were recorded as they listened to RC structures identifying a unique referent (e.g. "Can you pick up the horse that pushed the pig?"). Two RC types, classifier (CL) and ge3 RCs, were tested in a between-participants design. The two RC types differ in their syntactic analyses and frequency of occurrence, providing an important point of comparison for theories of RC acquisition and processing. A permutation analysis showed that the two structures were processed differently: CL RCs showed a significant object-over-subject advantage, whereas ge3 RCs showed the opposite effect. This study shows that children can have different preferences even for two very similar RC structures within the same language, suggesting that syntactic processing preferences are shaped by the unique features of particular constructions both within and across different linguistic typologies.
Mathieu, Valéry; Fastrez, Jacques; Soumillion, Patrice
2010-09-01
In nature, the activity of many enzymes involved in important biochemical pathways is controlled by binding a ligand in a site remote from the active site. The allosteric sites are frequently located in hinge regulatory subunits, in which a conformational change can occur and propagate to the active site. The enzymatic activity is then enhanced or decreased depending on the type of effectors. Many artificial binding sites have been created to engineer an allosteric regulation. Generally, these sites were engineered near the active site in loops or at the surface of contiguous helices or strands but rarely in hinge regions. This work aims at exploring the possibility of regulating a monomeric enzyme whose active site is located at the interface between two domains. We anticipated that binding of a ligand in the hinge region linking the domains would modify their positioning and, consequently, modulate the activity. Here, we describe the design of two mutants in a circularly permuted TEM-1 (cpTEM-1) beta-lactamase. The first one, cpTEM-1-His(3) was created by a rational design. It shows little regulation upon metal ion binding except for a weak activation with Zn(2+). The second one, cpTEM-1-3M-His(2), was selected by a directed evolution strategy. It is allosterically down-regulated by Zn(2+), Ni(2+) and Co(2+) with binding affinities around 300 microM.
Reduced-density-matrix spectrum and block entropy of permutationally invariant many-body systems.
Salerno, Mario; Popkov, Vladislav
2010-07-01
Spectral properties of the reduced density matrix (RDM) of permutational invariant quantum many-body systems are investigated. The RDM block diagonalization which accounts for all symmetries of the Hamiltonian is achieved. The analytical expression of the RDM spectrum is provided for arbitrary parameters and rigorously proved in the thermodynamical limit. The existence of several sum rules and recurrence relations among RDM eigenvalues is also demonstrated and the distribution function of RDM eigenvalues (including degeneracies) characterized. In particular, we prove that the distribution function approaches a two-dimensional Gaussian in the limit of large subsystem sizes n>1. As a physical application we discuss the von Neumann entropy (VNE) of a block of size n for a system of hard-core bosons on a complete graph, as a function of n and of the temperature T. The occurrence of a crossover of VNE from purely logarithmic behavior at T=0 to a purely linear behavior in n for T≥Tc, is demonstrated.
CRYPTANALYSIS OF AN IMAGE ENCRYPTION SCHEME WITH A PSEUDORANDOM PERMUTATION AND ITS IMPROVED VERSION
Institute of Scientific and Technical Information of China (English)
Wang Jing; Jiang Guoping; Lin Bing
2012-01-01
Under Kerckhoff principle,this paper discusses the security property of an image encryption scheme with a pseudorandom permutation.Some findings on the security problems of the algorithm are reported in the following:(1) If each row or column of the plain-image matrix is the same,the receiver cannot decrypt correctly.(2) Each plain-text word is correlated with single cipher-text word,but independent of other cipher-text word,which cannot meet the principles of algorithm designdiffusion and confusion.(3) If the cycle numbers β are relatively small,statistics attack can be used to reveal some visual information of any other plain-images encrypted with the same secret key.Considering the above problems,we propose an improved algorithm and then analyze its performance.Theoretical analysis and simulation results show that the improved algorithm can obtain better cryptographic properties,such as statistical characteristics,difference characteristics,and so on.
Bahr, A; Thompson, J D; Thierry, J C; Poch, O
2001-01-01
BAliBASE is specifically designed to serve as an evaluation resource to address all the problems encountered when aligning complete sequences. The database contains high quality, manually constructed multiple sequence alignments together with detailed annotations. The alignments are all based on three-dimensional structural superpositions, with the exception of the transmembrane sequences. The first release provided sets of reference alignments dealing with the problems of high variability, unequal repartition and large N/C-terminal extensions and internal insertions. Here we describe version 2.0 of the database, which incorporates three new reference sets of alignments containing structural repeats, trans-membrane sequences and circular permutations to evaluate the accuracy of detection/prediction and alignment of these complex sequences. BAliBASE can be viewed at the web site http://www-igbmc.u-strasbg. fr/BioInfo/BAliBASE2/index.html or can be downloaded from ftp://ftp-igbmc.u-strasbg.fr/pub/BAliBASE2 /.
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.
An Efficient Constructive Heuristic for Permutation Flow Shops to Minimize Total Flowtime
Institute of Scientific and Technical Information of China (English)
LIXiaoping; WUCheng
2005-01-01
In this paper, FFC (Fast fiowtime-computing) is presented for fiowtime computing in flow shops. The CPU-time of an algorithm for flow shops can be reduced considerably by replacing classical flowtime computing with FFC based on the facts that FFC is faster than the classical one and that flowtime computing of schedules/partial schedules is the main computational burden of most algorithms for flow shops. This is illustrated by modifying RZ, one of the three best existing heuristics(FL, WY and RZ) for flowtime minimization, with FFC in which about half of the CPU-time is saved. An efficient constructive heuristic is proposed for permutation flow shops with flowtime minimization, of which the CPU-time is more than that of RZ but much less than those of FL and WY. Our proposal is compared with FL, WYand RZ in terms of ARPD (Average relative percentage deviation), STD (Standard deviation) and BEST (number of best solutions obtained for a given size of problems). Computational results show that the proposed heuristic outperforms WY and RZ, and also outperforms FL when job-machine ratio is small. However, as the ratio increases, the proposal will finally be outperformed by FL but needs far less CPU-time than FL does.
Permutation entropy of finite-length white-noise time series
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.
Markov chain Monte Carlo methods in directed graphical models
DEFF Research Database (Denmark)
Højbjerre, Malene
Directed graphical models present data possessing a complex dependence structure, and MCMC methods are computer-intensive simulation techniques to approximate high-dimensional intractable integrals, which emerge in such models with incomplete data. MCMC computations in directed graphical models...
Numerical methods in Markov chain modeling
Philippe, Bernard; Saad, Youcef; Stewart, William J.
1989-01-01
Several methods for computing stationary probability distributions of Markov chains are described and compared. The main linear algebra problem consists of computing an eigenvector of a sparse, usually nonsymmetric, matrix associated with a known eigenvalue. It can also be cast as a problem of solving a homogeneous singular linear system. Several methods based on combinations of Krylov subspace techniques are presented. The performance of these methods on some realistic problems are compared.
Indian Academy of Sciences (India)
C P ANIL KUMAR
2017-04-01
Consider a discrete valuation ring $R$ whose residue field is finite of cardinality at least 3. For a finite torsion module, we consider transitive subsets $O$ under the action of the automorphism group of the module. We prove that the associated permutation representation on the complex vector space $C[O]$ is multiplicity free. This is achieved by obtaining a complete description of the transitive subsets of $O$ × $O$ under the diagonal action of the automorphism group.
Dynamic spatial panels : models, methods, and inferences
Elhorst, J. Paul
This paper provides a survey of the existing literature on the specification and estimation of dynamic spatial panel data models, a collection of models for spatial panels extended to include one or more of the following variables and/or error terms: a dependent variable lagged in time, a dependent
A method to evaluate response models
Bruijnes, Merijn; Wapperom, Sjoerd; op den Akker, Hendrikus J.A.; Heylen, Dirk K.J.; Bickmore, Timothy; Marcella, Stacy; Sidner, Candace
We are working towards computational models of mind of virtual characters that act as suspects in interview (interrogation) training of police officers. We implemented a model that calculates the responses of the virtual suspect based on theory and observation. We evaluated it by means of our test,
Cohen, Trevor; Schvaneveldt, Roger W; Rindflesch, Thomas C
2009-11-14
Corpus-derived distributional models of semantic distance between terms have proved useful in a number of applications. For both theoretical and practical reasons, it is desirable to extend these models to encode discrete concepts and the ways in which they are related to one another. In this paper, we present a novel vector space model that encodes semantic predications derived from MEDLINE by the SemRep system into a compact spatial representation. The associations captured by this method are of a different and complementary nature to those derived by traditional vector space models, and the encoding of predication types presents new possibilities for knowledge discovery and information retrieval.
Sequencing in Mixed Model Non-Permutation Flowshop Production Lines using Constrained Buffers
Färber, Gerrit
2007-01-01
En una línea de producción clásica, solamente se producían productos con las mismas opciones. Para la fabricación de variaciones del mismo producto básico se utilizaba una línea diferente o eran necesarias modificaciones importantes de la maquinaria. En los últimos años se ha visto acrecentada la necesidad de considerar métodos que permitan más flexibilidad ofreciendo una mayor variedad de productos al cliente. En general estos métodos consisten en producir diferentes tipos de productos en un...
A Method for Model Checking Feature Interactions
DEFF Research Database (Denmark)
Pedersen, Thomas; Le Guilly, Thibaut; Ravn, Anders Peter
2015-01-01
This paper presents a method to check for feature interactions in a system assembled from independently developed concurrent processes as found in many reactive systems. The method combines and refines existing definitions and adds a set of activities. The activities describe how to populate the ...
Schmiedt, Hanno; Jensen, Per; Schlemmer, Stephan
2016-08-01
In modern physics and chemistry concerned with many-body systems, one of the mainstays is identical-particle-permutation symmetry. In particular, both the intra-molecular dynamics of a single molecule and the inter-molecular dynamics associated, for example, with reactive molecular collisions are strongly affected by selection rules originating in nuclear-permutation symmetry operations being applied to the total internal wavefunctions, including nuclear spin, of the molecules involved. We propose here a general tool to determine coherently the permutation symmetry and the rotational symmetry (associated with the group of arbitrary rotations of the entire molecule in space) of molecular wavefunctions, in particular the nuclear-spin functions. Thus far, these two symmetries were believed to be mutually independent and it has even been argued that under certain circumstances, it is impossible to establish a one-to-one correspondence between them. However, using the Schur-Weyl duality theorem we show that the two types of symmetry are inherently coupled. In addition, we use the ingenious representation-theory technique of Young tableaus to represent the molecular nuclear-spin degrees of freedom in terms of well-defined mathematical objects. This simplifies the symmetry classification of the nuclear wavefunction even for large molecules. Also, the application to reactive collisions is very straightforward and provides a much simplified approach to obtaining selection rules.
Schmiedt, Hanno; Jensen, Per; Schlemmer, Stephan
2016-08-21
In modern physics and chemistry concerned with many-body systems, one of the mainstays is identical-particle-permutation symmetry. In particular, both the intra-molecular dynamics of a single molecule and the inter-molecular dynamics associated, for example, with reactive molecular collisions are strongly affected by selection rules originating in nuclear-permutation symmetry operations being applied to the total internal wavefunctions, including nuclear spin, of the molecules involved. We propose here a general tool to determine coherently the permutation symmetry and the rotational symmetry (associated with the group of arbitrary rotations of the entire molecule in space) of molecular wavefunctions, in particular the nuclear-spin functions. Thus far, these two symmetries were believed to be mutually independent and it has even been argued that under certain circumstances, it is impossible to establish a one-to-one correspondence between them. However, using the Schur-Weyl duality theorem we show that the two types of symmetry are inherently coupled. In addition, we use the ingenious representation-theory technique of Young tableaus to represent the molecular nuclear-spin degrees of freedom in terms of well-defined mathematical objects. This simplifies the symmetry classification of the nuclear wavefunction even for large molecules. Also, the application to reactive collisions is very straightforward and provides a much simplified approach to obtaining selection rules.
A new switching parameter varying optoelectronic delayed feedback model with computer simulation
Liu, Lingfeng; Miao, Suoxia; Cheng, Mengfan; Gao, Xiaojing
2016-02-01
In this paper, a new switching parameter varying optoelectronic delayed feedback model is proposed and analyzed by computer simulation. This model is switching between two parameter varying optoelectronic delayed feedback models based on chaotic pseudorandom sequences. Complexity performance results show that this model has a high complexity compared to the original model. Furthermore, this model can conceal the time delay effectively against the auto-correlation function, delayed mutual information and permutation information analysis methods, and can extent the key space, which greatly improve its security.
Model and method for optimizing heterogeneous systems
Antamoshkin, O. A.; Antamoshkina, O. A.; Zelenkov, P. V.; Kovalev, I. V.
2016-11-01
Methodology of distributed computing performance boost by reduction of delays number is proposed. Concept of n-dimentional requirements triangle is introduced. Dynamic mathematical model of resource use in distributed computing systems is described.
Combining static and dynamic modelling methods: a comparison of four methods
Wieringa, R.J.
1995-01-01
A conceptual model of a system is an explicit description of the behaviour required of the system. Methods for conceptual modelling include entity-relationship (ER) modelling, data flow modelling, Jackson System Development (JSD) and several object-oriented analysis method. Given the current diversi
A Generalized Rough Set Modeling Method for Welding Process
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
Modeling is essential, significant and difficult for the quality and shaping control of arc welding process. A generalized rough set based modeling method was brought forward and a dynamic predictive model for pulsed gas tungsten arc welding (GTAW) was obtained by this modeling method. The results show that this modeling method can well acquire knowledge in welding and satisfy the real life application. In addition, the results of comparison between classic rough set model and back-propagation neural network model respectively are also satisfying.
Particle Methods for Atmosphere and Ocean Modeling
2015-02-26
particle method (LPM) for geophysical fluid flow simulations on a rotating sphere. The method is potentially relevant to Naval operations that rely on...simulations are based mainly on Eulerian and semi-Lagrangian mesh -based schemes, and the numerical results often exhibit diffusive and dispersive...errors commonly seen with mesh -based schemes and this is demonstrated in the articles cited below. We apphed LPM to solve the barotropic vorticity
Institute of Scientific and Technical Information of China (English)
谢平; 江国乾; 李兴林; 李小俚
2013-01-01
针对滚动轴承故障振动信号的非平稳、非线性特性，将经验模态分解方法和排序熵有机结合，提出一种新的基于自适应尺度的复杂度参数--本征时间尺度排序熵，用于描述不同本征模态分量的复杂程度，从而实现故障特征的量化描述。首先，将原始振动信号经过 EMD 分解得到若干本征模态分量，然后分别对各本征模态分量计算排序熵，即可得到不同本征时间尺度排序熵，最后利用该参数实现不同故障状态的有效区分与识别。实例分析结果表明了该方法的有效性和实用性，从而为机械设备状态监测与故障诊断提供了一种有效途径。%Aiming at the nonstationary and nonlinear characteristics of bearing fault vibration signals, a new complexity measure based on the adaptive scales, intrinsic time scale permutation entropy, is proposed. It combined the merits of both empirical mode decompostion algorithm and permutation. The new measure can describe the complex degree of different intrinsic mode functions and quantify the fault features. First, the original vibration signals are decomposed into several intrinsic mode functions by EMD algorithm; second, permutation entropies of different IMFs are computed respectively to obtain the different intrinsic time scale permutation entropy; finally, different working states are identified and classified effectively. The case analysis results validate the availability and feasibility of the proposed method. The new method can provide an effective way for condition monitoring and fault diagnosis of mechanical equipments.
Tensor Models: extending the matrix models structures and methods
Dartois, Stephane
2016-01-01
In this text we review a few structural properties of matrix models that should at least partly generalize to random tensor models. We review some aspects of the loop equations for matrix models and their algebraic counterpart for tensor models. Despite the generic title of this review, we, in particular, invoke the Topological Recursion. We explain its appearance in matrix models. Then we state that a family of tensor models provides a natural example which satisfies a version of the most general form of the topological recursion, named the blobbed topological recursion. We discuss the difficulties of extending the technical solutions existing for matrix models to tensor models. Some proofs are not published yet but will be given in a coming paper, the rest of the results are well known in the literature.
Model-based methods for linkage analysis.
Rice, John P; Saccone, Nancy L; Corbett, Jonathan
2008-01-01
The logarithm of an odds ratio (LOD) score method originated in a seminal article by Newton Morton in 1955. The method is broadly concerned with issues of power and the posterior probability of linkage, ensuring that a reported linkage has a high probability of being a true linkage. In addition, the method is sequential so that pedigrees or LOD curves may be combined from published reports to pool data for analysis. This approach has been remarkably successful for 50 years in identifying disease genes for Mendelian disorders. After discussing these issues, we consider the situation for complex disorders where the maximum LOD score statistic shares some of the advantages of the traditional LOD score approach, but is limited by unknown power and the lack of sharing of the primary data needed to optimally combine analytic results. We may still learn from the LOD score method as we explore new methods in molecular biology and genetic analysis to utilize the complete human DNA sequence and the cataloging of all human genes.
Reverberation Modelling Using a Parabolic Equation Method
2012-10-01
et possiblement des échos de cibles. L’objet du présent contrat est une étude du recours à un modèle à équation parabolique, en particulier le...obtained by the ‘PE method’ were primarily compared to results obtained from a proprietary ray-based model provided by Brooke Numerical Services (BNS... Services . Target echo estimates are also compared to the BNS ray model result. In all cases but one the reference data is plotted as a solid red line
Extrudate Expansion Modelling through Dimensional Analysis Method
DEFF Research Database (Denmark)
A new model framework is proposed to correlate extrudate expansion and extrusion operation parameters for a food extrusion cooking process through dimensional analysis principle, i.e. Buckingham pi theorem. Three dimensionless groups, i.e. energy, water content and temperature, are suggested...... to describe the extrudates expansion. From the three dimensionless groups, an equation with three experimentally determined parameters is derived to express the extrudate expansion. The model is evaluated with whole wheat flour and aquatic feed extrusion experimental data. The average deviations...
Marginal linearization method in modeling on fuzzy control systems
Institute of Scientific and Technical Information of China (English)
无
2003-01-01
Marginal linearization method in modeling on fuzzy control systems is proposed, which is to deal with the nonlinear model with variable coefficients. The method can turn a nonlinear model with variable coefficients into a linear model with variable coefficients in the way that the membership functions of the fuzzy sets in fuzzy partitions of the universes are changed from triangle waves into rectangle waves. However, the linearization models are incomplete in their forms because of their lacking some items. For solving this problem, joint approximation by using linear models is introduced. The simulation results show that marginal linearization models are of higher approximation precision than their original nonlinear models.
Diagnostic and prognostic models: applications and methods
Zuithoff, N.P.A.|info:eu-repo/dai/nl/313995494
2012-01-01
Prediction modelling, both diagnostic and prognostic, has become a major topic in clinical research and practice. Traditionally, clinicians intuitively combine and judge the documented patient information, on e.g. risk factors and test results, to implicitly assess the probability or risk of having
Accurate Electromagnetic Modeling Methods for Integrated Circuits
Sheng, Z.
2010-01-01
The present development of modern integrated circuits (IC’s) is characterized by a number of critical factors that make their design and verification considerably more difficult than before. This dissertation addresses the important questions of modeling all electromagnetic behavior of features on t
A Parametric Modelling Method for Dexterous Finger Reachable Workspaces
2016-01-01
The well-known algorithms, such as the graphic method, analytical method or numerical method, have some defects when modelling the dexterous finger workspace, which is a significant kinematical feature of dexterous hands and valuable for grasp planning, motion control and mechanical design. A novel modelling method with convenient and parametric performances is introduced to generate the dexterous-finger reachable workspace. This method constructs the geometric topology of the dexterous-finge...
A catalog of automated analysis methods for enterprise models.
Florez, Hector; Sánchez, Mario; Villalobos, Jorge
2016-01-01
Enterprise models are created for documenting and communicating the structure and state of Business and Information Technologies elements of an enterprise. After models are completed, they are mainly used to support analysis. Model analysis is an activity typically based on human skills and due to the size and complexity of the models, this process can be complicated and omissions or miscalculations are very likely. This situation has fostered the research of automated analysis methods, for supporting analysts in enterprise analysis processes. By reviewing the literature, we found several analysis methods; nevertheless, they are based on specific situations and different metamodels; then, some analysis methods might not be applicable to all enterprise models. This paper presents the work of compilation (literature review), classification, structuring, and characterization of automated analysis methods for enterprise models, expressing them in a standardized modeling language. In addition, we have implemented the analysis methods in our modeling tool.
Designerly Visualisation: Conceptions, Methods, Models, Perceptions
Breen, J.L.H.
2013-01-01
If we wish to reach a deeper, more objective understanding of the phenomena of Architectural and Environmental Design, we need to develop and apply working methods that allow us to imaginatively analyse and consequently envision the formal issues which are at (inter)play: demonstrating their working
Review of Nonlinear Methods and Modelling
Borg, F G
2005-01-01
The first part of this Review describes a few of the main methods that have been employed in non-linear time series analysis with special reference to biological applications (biomechanics). The second part treats the physical basis of posturogram data (human balance) and EMG (electromyography, a measure of muscle activity).
Team mental models: techniques, methods, and analytic approaches.
Langan-Fox, J; Code, S; Langfield-Smith, K
2000-01-01
Effective team functioning requires the existence of a shared or team mental model among members of a team. However, the best method for measuring team mental models is unclear. Methods reported vary in terms of how mental model content is elicited and analyzed or represented. We review the strengths and weaknesses of vatrious methods that have been used to elicit, represent, and analyze individual and team mental models and provide recommendations for method selection and development. We describe the nature of mental models and review techniques that have been used to elicit and represent them. We focus on a case study on selecting a method to examine team mental models in industry. The processes involved in the selection and development of an appropriate method for eliciting, representing, and analyzing team mental models are described. The criteria for method selection were (a) applicability to the problem under investigation; (b) practical considerations - suitability for collecting data from the targeted research sample; and (c) theoretical rationale - the assumption that associative networks in memory are a basis for the development of mental models. We provide an evaluation of the method matched to the research problem and make recommendations for future research. The practical applications of this research include the provision of a technique for analyzing team mental models in organizations, the development of methods and processes for eliciting a mental model from research participants in their normal work environment, and a survey of available methodologies for mental model research.
Mendes, B. S.; Draper, D.
2008-12-01
The issue of model uncertainty and model choice is central in any groundwater modeling effort [Neuman and Wierenga, 2003]; among the several approaches to the problem we favour using Bayesian statistics because it is a method that integrates in a natural way uncertainties (arising from any source) and experimental data. In this work, we experiment with several Bayesian approaches to model choice, focusing primarily on demonstrating the usefulness of the Reversible Jump Markov Chain Monte Carlo (RJMCMC) simulation method [Green, 1995]; this is an extension of the now- common MCMC methods. Standard MCMC techniques approximate posterior distributions for quantities of interest, often by creating a random walk in parameter space; RJMCMC allows the random walk to take place between parameter spaces with different dimensionalities. This fact allows us to explore state spaces that are associated with different deterministic models for experimental data. Our work is exploratory in nature; we restrict our study to comparing two simple transport models applied to a data set gathered to estimate the breakthrough curve for a tracer compound in groundwater. One model has a mean surface based on a simple advection dispersion differential equation; the second model's mean surface is also governed by a differential equation but in two dimensions. We focus on artificial data sets (in which truth is known) to see if model identification is done correctly, but we also address the issues of over and under-paramerization, and we compare RJMCMC's performance with other traditional methods for model selection and propagation of model uncertainty, including Bayesian model averaging, BIC and DIC.References Neuman and Wierenga (2003). A Comprehensive Strategy of Hydrogeologic Modeling and Uncertainty Analysis for Nuclear Facilities and Sites. NUREG/CR-6805, Division of Systems Analysis and Regulatory Effectiveness Office of Nuclear Regulatory Research, U. S. Nuclear Regulatory Commission
Hazard Response Modeling Uncertainty (A Quantitative Method)
1988-10-01
ersio 114-11aiaiI I I I II L I ATINI Iri Ig IN Ig - ISI I I s InWLS I I I II I I I IWILLa RguOSmI IT$ INDS In s list INDIN I Im Ad inla o o ILLS I...OesotASII II I I I" GASau ATI im IVS ES Igo Igo INC 9 -U TIg IN ImS. I IgoIDI II i t I I ol f i isI I I I I I * WOOL ETY tGMIM (SU I YESMI jWM# GUSA imp I...is the concentration predicted by some component or model.P The variance of C /C is calculated and defined as var(Model I), where Modelo p I could be
Data mining concepts models methods and algorithms
Kantardzic, Mehmed
2011-01-01
This book reviews state-of-the-art methodologies and techniques for analyzing enormous quantities of raw data in high-dimensional data spaces, to extract new information for decision making. The goal of this book is to provide a single introductory source, organized in a systematic way, in which we could direct the readers in analysis of large data sets, through the explanation of basic concepts, models and methodologies developed in recent decades.
ICA Model Order Estimation Using Clustering Method
Directory of Open Access Journals (Sweden)
P. Sovka
2007-12-01
Full Text Available In this paper a novel approach for independent component analysis (ICA model order estimation of movement electroencephalogram (EEG signals is described. The application is targeted to the brain-computer interface (BCI EEG preprocessing. The previous work has shown that it is possible to decompose EEG into movement-related and non-movement-related independent components (ICs. The selection of only movement related ICs might lead to BCI EEG classification score increasing. The real number of the independent sources in the brain is an important parameter of the preprocessing step. Previously, we used principal component analysis (PCA for estimation of the number of the independent sources. However, PCA estimates only the number of uncorrelated and not independent components ignoring the higher-order signal statistics. In this work, we use another approach - selection of highly correlated ICs from several ICA runs. The ICA model order estimation is done at significance level ÃŽÂ± = 0.05 and the model order is less or more dependent on ICA algorithm and its parameters.
Reduced Order Modeling Methods for Turbomachinery Design
2009-03-01
be discussed in Subsection 1.2.3, which assume normally distributed response. Results also showed sig- nif cant mistuning located at the frequency of...conventionally def ned with Probability Density Functions ( PDF ) and the output are response statistics and PDF . It is an alter- native to deterministic analysis...certainty typically refers to def ning PDF for input parameters, but there are also non- probability based methods for quantif cation such as Bayesian [45
Directory of Open Access Journals (Sweden)
Curtis David
2007-07-01
Full Text Available Abstract Background Debate remains as to the optimal method for utilising genotype data obtained from multiple markers in case-control association studies. I and colleagues have previously described a method of association analysis using artificial neural networks (ANNs, whose performance compared favourably to single-marker methods. Here, the perfomance of ANN analysis is compared with other multi-marker methods, comprising different haplotype-based analyses and locus-based analyses. Results Of several methods studied and applied to simulated SNP datasets, heterogeneity testing of estimated haplotype frequencies using asymptotic p values rather than permutation testing had the lowest power of the methods studied and ANN analysis had the highest power. The difference in power to detect association between these two methods was statistically significant (p = 0.001 but other comparisons between methods were not significant. The raw t statistic obtained from ANN analysis correlated highly with the empirical statistical significance obtained from permutation testing of the ANN results and with the p value obtained from the heterogeneity test. Conclusion Although ANN analysis was more powerful than the standard haplotype-based test it is unlikely to be taken up widely. The permutation testing necessary to obtain a valid p value makes it slow to perform and it is not underpinned by a theoretical model relating marker genotypes to disease phenotype. Nevertheless, the superior performance of this method does imply that the widely-used haplotype-based methods for detecting association with multiple markers are not optimal and efforts could be made to improve upon them. The fact that the t statistic obtained from ANN analysis is highly correlated with the statistical significance does suggest a possibility to use ANN analysis in situations where large numbers of markers have been genotyped, since the t value could be used as a proxy for the p value in
Systematic Methods and Tools for Computer Aided Modelling
DEFF Research Database (Denmark)
Fedorova, Marina
-friendly system, which will make the model development process easier and faster and provide the way for unified and consistent model documentation. The modeller can use the template for their specific problem or to extend and/or adopt a model. This is based on the idea of model reuse, which emphasizes the use...... and processes can be faster, cheaper and very efficient. The developed modelling framework involves five main elements: 1) a modelling tool, that includes algorithms for model generation; 2) a template library, which provides building blocks for the templates (generic models previously developed); 3) computer...... aided methods and tools, that include procedures to perform model translation, model analysis, model verification/validation, model solution and model documentation; 4) model transfer – export/import to/from other application for further extension and application – several types of formats, such as XML...
Diffusion in condensed matter methods, materials, models
Kärger, Jörg
2005-01-01
Diffusion as the process of particle transport due to stochastic movement is a phenomenon of crucial relevance for a large variety of processes and materials. This comprehensive, handbook- style survey of diffusion in condensed matter gives detailed insight into diffusion as the process of particle transport due to stochastic movement. Leading experts in the field describe in 23 chapters the different aspects of diffusion, covering microscopic and macroscopic experimental techniques and exemplary results for various classes of solids, liquids and interfaces as well as several theoretical concepts and models. Students and scientists in physics, chemistry, materials science, and biology will benefit from this detailed compilation.
Precise methods for conducted EMI modeling,analysis,and prediction
Institute of Scientific and Technical Information of China (English)
2008-01-01
Focusing on the state-of-the-art conducted EMI prediction, this paper presents a noise source lumped circuit modeling and identification method, an EMI modeling method based on multiple slope approximation of switching transitions, and dou-ble Fourier integral method modeling PWM conversion units to achieve an accurate modeling of EMI noise source. Meanwhile, a new sensitivity analysis method, a general coupling model for steel ground loops, and a partial element equivalent circuit method are proposed to identify and characterize conducted EMI coupling paths. The EMI noise and propagation modeling provide an accurate prediction of conducted EMI in the entire frequency range (0―10 MHz) with good practicability and generality. Finally a new measurement approach is presented to identify the surface current of large dimensional metal shell. The proposed analytical modeling methodology is verified by experimental results.
Precise methods for conducted EMI modeling,analysis, and prediction
Institute of Scientific and Technical Information of China (English)
MA WeiMing; ZHAO ZhiHua; MENG Jin; PAN QiJun; ZHANG Lei
2008-01-01
Focusing on the state-of-the-art conducted EMI prediction, this paper presents a noise source lumped circuit modeling and identification method, an EMI modeling method based on multiple slope approximation of switching transitions, and dou-ble Fourier integral method modeling PWM conversion units to achieve an accurate modeling of EMI noise source. Meanwhile, a new sensitivity analysis method, a general coupling model for steel ground loops, and a partial element equivalent circuit method are proposed to identify and characterize conducted EMI coupling paths. The EMI noise and propagation modeling provide an accurate prediction of conducted EMI in the entire frequency range (0-10 MHz) with good practicability and generality. Finally a new measurement approach is presented to identify the surface current of large dimensional metal shell. The proposed analytical modeling methodology is verified by experimental results.
Modeling conflict : research methods, quantitative modeling, and lessons learned.
Energy Technology Data Exchange (ETDEWEB)
Rexroth, Paul E.; Malczynski, Leonard A.; Hendrickson, Gerald A.; Kobos, Peter Holmes; McNamara, Laura A.
2004-09-01
This study investigates the factors that lead countries into conflict. Specifically, political, social and economic factors may offer insight as to how prone a country (or set of countries) may be for inter-country or intra-country conflict. Largely methodological in scope, this study examines the literature for quantitative models that address or attempt to model conflict both in the past, and for future insight. The analysis concentrates specifically on the system dynamics paradigm, not the political science mainstream approaches of econometrics and game theory. The application of this paradigm builds upon the most sophisticated attempt at modeling conflict as a result of system level interactions. This study presents the modeling efforts built on limited data and working literature paradigms, and recommendations for future attempts at modeling conflict.
Estimating Tree Height-Diameter Models with the Bayesian Method
Directory of Open Access Journals (Sweden)
Xiongqing Zhang
2014-01-01
Full Text Available Six candidate height-diameter models were used to analyze the height-diameter relationships. The common methods for estimating the height-diameter models have taken the classical (frequentist approach based on the frequency interpretation of probability, for example, the nonlinear least squares method (NLS and the maximum likelihood method (ML. The Bayesian method has an exclusive advantage compared with classical method that the parameters to be estimated are regarded as random variables. In this study, the classical and Bayesian methods were used to estimate six height-diameter models, respectively. Both the classical method and Bayesian method showed that the Weibull model was the “best” model using data1. In addition, based on the Weibull model, data2 was used for comparing Bayesian method with informative priors with uninformative priors and classical method. The results showed that the improvement in prediction accuracy with Bayesian method led to narrower confidence bands of predicted value in comparison to that for the classical method, and the credible bands of parameters with informative priors were also narrower than uninformative priors and classical method. The estimated posterior distributions for parameters can be set as new priors in estimating the parameters using data2.
Stability analysis of cosmological models through Liapunov's method
Charters, T C; Mimoso, J P; Charters, Tiago C.; Mimoso, Jose P.
2001-01-01
We investigate the general asymptotic behaviour of Friedman-Robertson-Walker (FRW) models with an inflaton field, scalar-tensor FRW cosmological models and diagonal Bianchi-IX models by means of Liapunov's method. This method provides information not only about the asymptotic stability of a given equilibrium point but also about its basin of attraction. This cannot be obtained by the usual methods found in the literature, such as linear stability analysis or first order perturbation techniques. Moreover, Liapunov's method is also applicable to non-autonomous systems. We use this advantadge to investigate the mechanism of reheating for the inflaton field in FRW models.
Laser filamentation mathematical methods and models
Lorin, Emmanuel; Moloney, Jerome
2016-01-01
This book is focused on the nonlinear theoretical and mathematical problems associated with ultrafast intense laser pulse propagation in gases and in particular, in air. With the aim of understanding the physics of filamentation in gases, solids, the atmosphere, and even biological tissue, specialists in nonlinear optics and filamentation from both physics and mathematics attempt to rigorously derive and analyze relevant non-perturbative models. Modern laser technology allows the generation of ultrafast (few cycle) laser pulses, with intensities exceeding the internal electric field in atoms and molecules (E=5x109 V/cm or intensity I = 3.5 x 1016 Watts/cm2 ). The interaction of such pulses with atoms and molecules leads to new, highly nonlinear nonperturbative regimes, where new physical phenomena, such as High Harmonic Generation (HHG), occur, and from which the shortest (attosecond - the natural time scale of the electron) pulses have been created. One of the major experimental discoveries in this nonlinear...
Exposure-response modeling methods and practical implementation
Wang, Jixian
2015-01-01
Discover the Latest Statistical Approaches for Modeling Exposure-Response RelationshipsWritten by an applied statistician with extensive practical experience in drug development, Exposure-Response Modeling: Methods and Practical Implementation explores a wide range of topics in exposure-response modeling, from traditional pharmacokinetic-pharmacodynamic (PKPD) modeling to other areas in drug development and beyond. It incorporates numerous examples and software programs for implementing novel methods.The book describes using measurement
Research on the modeling method of soybean leafs structure simulation
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
Leaf is one of the most important organs of soybean. The modeling of soybean leaf structure is useful to research of leaf function. The paper discussed it from two aspects that were distilling method of leaf profile and establishing method of leaf simulation model. It put forward basic method of soybean leaf digital process, and successfully established simulation model of soybean leaf structure based on L-system. It also solved a critical problem in the process of establishing soybean growth simulation model. And the research had guiding significance to establishment of soybean plant model.
Institute of Scientific and Technical Information of China (English)
Huo Hua; Liu Junqiang; Feng Boqin
2006-01-01
A language model for information retrieval is built by using a query language model to generate queries and a document language model to generate documents. The documents are ranked according to the relative entropies of estimated document language models with respect to the estimated query language model. Two popular and relatively efficient smoothing methods, the JelinekMercer method and the absolute discounting method, are used to smooth the document language model in estimation of the document language. A combined model composed of the feedback document language model and the collection language model is used to estimate the query model. A performacne comparison between the new retrieval method and the existing method with feedback is made,and the retrieval performances of the proposed method with the two different smoothing techniques are evaluated on three Text Retrieval Conference (TREC) data sets. Experimental results show that the method is effective and performs better than the basic language modeling approach; moreover, the method using the Jelinek-Mercer technique performs better than that using the absolute discounting technique, and the perfomance is sensitive to the smoothing paramters.
"Method, system and storage medium for generating virtual brick models"
DEFF Research Database (Denmark)
2009-01-01
An exemplary embodiment is a method for generating a virtual brick model. The virtual brick models are generated by users and uploaded to a centralized host system. Users can build virtual models themselves or download and edit another user's virtual brick models while retaining the identity...... of the original virtual brick model. Routines are provided for both storing user created building steps in and generating automated building instructions for virtual brick models, generating a bill of materials for a virtual brick model and ordering physical bricks corresponding to a virtual brick model....
A Parametric Modelling Method for Dexterous Finger Reachable Workspaces
Directory of Open Access Journals (Sweden)
Wenzhen Yang
2016-03-01
Full Text Available The well-known algorithms, such as the graphic method, analytical method or numerical method, have some defects when modelling the dexterous finger workspace, which is a significant kinematical feature of dexterous hands and valuable for grasp planning, motion control and mechanical design. A novel modelling method with convenient and parametric performances is introduced to generate the dexterous-finger reachable workspace. This method constructs the geometric topology of the dexterous-finger reachable workspace, and uses a joint feature recognition algorithm to extract the kinematical parameters of the dexterous finger. Compared with graphic, analytical and numerical methods, this parametric modelling method can automatically and conveniently construct a more vivid workspace’ forms and contours of the dexterous finger. The main contribution of this paper is that a workspace-modelling tool with high interactive efficiency is developed for designers to precisely visualize the dexterous-finger reachable workspace, which is valuable for analysing the flexibility of the dexterous finger.
A Complete Enumeration and Classification of Two-Locus Disease Models
Li, W; Li, Wentian; Reich, Jens
1999-01-01
There are 512 two-locus, two-allele, two-phenotype, fully-penetrant disease models. Using the permutation between two alleles, between two loci, and between being affected and unaffected, one model can be considered to be equivalent to another model under the corresponding permutation. These permutations greatly reduce the number of two-locus models in the analysis of complex diseases. This paper determines the number of non-redundant two-locus models (which can be 102, 100, 96, 51, 50, or 48, depending on which permutations are used, and depending on whether zero-locus and single-locus models are excluded). Whenever possible, these non-redundant two-locus models are classified by their property. Besides the familiar features of multiplicative models (logical AND), heterogeneity models (logical OR), and threshold models, new classifications are added or expanded: modifying-effect models, logical XOR models, interference and negative interference models (neither dominant nor recessive), conditionally dominant/...
Methods for model selection in applied science and engineering.
Energy Technology Data Exchange (ETDEWEB)
Field, Richard V., Jr.
2004-10-01
Mathematical models are developed and used to study the properties of complex systems and/or modify these systems to satisfy some performance requirements in just about every area of applied science and engineering. A particular reason for developing a model, e.g., performance assessment or design, is referred to as the model use. Our objective is the development of a methodology for selecting a model that is sufficiently accurate for an intended use. Information on the system being modeled is, in general, incomplete, so that there may be two or more models consistent with the available information. The collection of these models is called the class of candidate models. Methods are developed for selecting the optimal member from a class of candidate models for the system. The optimal model depends on the available information, the selected class of candidate models, and the model use. Classical methods for model selection, including the method of maximum likelihood and Bayesian methods, as well as a method employing a decision-theoretic approach, are formulated to select the optimal model for numerous applications. There is no requirement that the candidate models be random. Classical methods for model selection ignore model use and require data to be available. Examples are used to show that these methods can be unreliable when data is limited. The decision-theoretic approach to model selection does not have these limitations, and model use is included through an appropriate utility function. This is especially important when modeling high risk systems, where the consequences of using an inappropriate model for the system can be disastrous. The decision-theoretic method for model selection is developed and applied for a series of complex and diverse applications. These include the selection of the: (1) optimal order of the polynomial chaos approximation for non-Gaussian random variables and stationary stochastic processes, (2) optimal pressure load model to be
IDEF method-based simulation model design and development framework
Directory of Open Access Journals (Sweden)
Ki-Young Jeong
2009-09-01
Full Text Available The purpose of this study is to provide an IDEF method-based integrated framework for a business process simulation model to reduce the model development time by increasing the communication and knowledge reusability during a simulation project. In this framework, simulation requirements are collected by a function modeling method (IDEF0 and a process modeling method (IDEF3. Based on these requirements, a common data model is constructed using the IDEF1X method. From this reusable data model, multiple simulation models are automatically generated using a database-driven simulation model development approach. The framework is claimed to help both requirement collection and experimentation phases during a simulation project by improving system knowledge, model reusability, and maintainability through the systematic use of three descriptive IDEF methods and the features of the relational database technologies. A complex semiconductor fabrication case study was used as a testbed to evaluate and illustrate the concepts and the framework. Two different simulation software products were used to develop and control the semiconductor model from the same knowledge base. The case study empirically showed that this framework could help improve the simulation project processes by using IDEF-based descriptive models and the relational database technology. Authors also concluded that this framework could be easily applied to other analytical model generation by separating the logic from the data.
Assessment of substitution model adequacy using frequentist and Bayesian methods.
Ripplinger, Jennifer; Sullivan, Jack
2010-12-01
In order to have confidence in model-based phylogenetic methods, such as maximum likelihood (ML) and Bayesian analyses, one must use an appropriate model of molecular evolution identified using statistically rigorous criteria. Although model selection methods such as the likelihood ratio test and Akaike information criterion are widely used in the phylogenetic literature, model selection methods lack the ability to reject all models if they provide an inadequate fit to the data. There are two methods, however, that assess absolute model adequacy, the frequentist Goldman-Cox (GC) test and Bayesian posterior predictive simulations (PPSs), which are commonly used in conjunction with the multinomial log likelihood test statistic. In this study, we use empirical and simulated data to evaluate the adequacy of common substitution models using both frequentist and Bayesian methods and compare the results with those obtained with model selection methods. In addition, we investigate the relationship between model adequacy and performance in ML and Bayesian analyses in terms of topology, branch lengths, and bipartition support. We show that tests of model adequacy based on the multinomial likelihood often fail to reject simple substitution models, especially when the models incorporate among-site rate variation (ASRV), and normally fail to reject less complex models than those chosen by model selection methods. In addition, we find that PPSs often fail to reject simpler models than the GC test. Use of the simplest substitution models not rejected based on fit normally results in similar but divergent estimates of tree topology and branch lengths. In addition, use of the simplest adequate substitution models can affect estimates of bipartition support, although these differences are often small with the largest differences confined to poorly supported nodes. We also find that alternative assumptions about ASRV can affect tree topology, tree length, and bipartition support. Our
Adjoint method for hybrid guidance loop state-space models
Weiss, M.; Bucco, D.
2015-01-01
A framework is introduced to develop the theory of the adjoint method for models including both continuous and discrete dynamics. The basis of this framework consists of the class of impulsive linear dynamic systems. It allows extension of the adjoint method to more general models that include multi
Institute of Scientific and Technical Information of China (English)
MA Xin-rui; XU You-yun; ZHANG Le
2007-01-01
It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the parallelization of Turbo decoding, which is indispensable to meet the demands for high throughput and low latency in next generation mobile communication systems. This paper unveils the fact that interleavers based on permutation polynomials modulo N are contention-free for every window size W, a factor of the interleaver length N, which, also called maximum contention-free interleavers.
Advanced methods of solid oxide fuel cell modeling
Milewski, Jaroslaw; Santarelli, Massimo; Leone, Pierluigi
2011-01-01
Fuel cells are widely regarded as the future of the power and transportation industries. Intensive research in this area now requires new methods of fuel cell operation modeling and cell design. Typical mathematical models are based on the physical process description of fuel cells and require a detailed knowledge of the microscopic properties that govern both chemical and electrochemical reactions. ""Advanced Methods of Solid Oxide Fuel Cell Modeling"" proposes the alternative methodology of generalized artificial neural networks (ANN) solid oxide fuel cell (SOFC) modeling. ""Advanced Methods
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...
Extending product modeling methods for integrated product development
DEFF Research Database (Denmark)
Bonev, Martin; Wörösch, Michael; Hauksdóttir, Dagný
2013-01-01
Despite great efforts within the modeling domain, the majority of methods often address the uncommon design situation of an original product development. However, studies illustrate that development tasks are predominantly related to redesigning, improving, and extending already existing products....... Updated design requirements have then to be made explicit and mapped against the existing product architecture. In this paper, existing methods are adapted and extended through linking updated requirements to suitable product models. By combining several established modeling techniques, such as the DSM...... and PVM methods, in a presented Product Requirement Development model some of the individual drawbacks of each method could be overcome. Based on the UML standard, the model enables the representation of complex hierarchical relationships in a generic product model. At the same time it uses matrix...
An efficient method for solving fractional Hodgkin–Huxley model
Energy Technology Data Exchange (ETDEWEB)
Nagy, A.M., E-mail: abdelhameed_nagy@yahoo.com [Department of Mathematics, Faculty of Science, Benha University, 13518 Benha (Egypt); Sweilam, N.H., E-mail: n_sweilam@yahoo.com [Department of Mathematics, Faculty of Science, Cairo University, 12613 Giza (Egypt)
2014-06-13
In this paper, we present an accurate numerical method for solving fractional Hodgkin–Huxley model. A non-standard finite difference method (NSFDM) is implemented to study the dynamic behaviors of the proposed model. The Grünwald–Letinkov definition is used to approximate the fractional derivatives. Numerical results are presented graphically reveal that NSFDM is easy to implement, effective and convenient for solving the proposed model. - Highlights: • An accurate numerical method for solving fractional Hodgkin–Huxley model is given. • Non-standard finite difference method (NSFDM) is implemented to the proposed model. • NSFDM can solve differential equations involving derivatives of non-integer order. • NDFDM is very powerful and efficient technique for solving the proposed model.
An efficient method for solving fractional Hodgkin-Huxley model
Nagy, A. M.; Sweilam, N. H.
2014-06-01
In this paper, we present an accurate numerical method for solving fractional Hodgkin-Huxley model. A non-standard finite difference method (NSFDM) is implemented to study the dynamic behaviors of the proposed model. The Grünwald-Letinkov definition is used to approximate the fractional derivatives. Numerical results are presented graphically reveal that NSFDM is easy to implement, effective and convenient for solving the proposed model.
Exact Modeling of Cardiovascular System Using Lumped Method
Ghasemalizadeh, Omid; Firoozabadi, Bahar; Hassani, Kamran
2014-01-01
Electrical analogy (Lumped method) is an easy way to model human cardiovascular system. In this paper Lumped method is used for simulating a complete model. It describes a 36-vessel model and cardiac system of human body with details that could show hydrodynamic parameters of cardiovascular system. Also this paper includes modeling of pulmonary, atrium, left and right ventricles with their equivalent circuits. Exact modeling of right and left ventricles pressure increases the accuracy of our simulation. In this paper we show that a calculated pressure for aorta from our complex circuit is near to measured pressure by using advanced medical instruments.
Systems and methods for modeling and analyzing networks
Hill, Colin C; Church, Bruce W; McDonagh, Paul D; Khalil, Iya G; Neyarapally, Thomas A; Pitluk, Zachary W
2013-10-29
The systems and methods described herein utilize a probabilistic modeling framework for reverse engineering an ensemble of causal models, from data and then forward simulating the ensemble of models to analyze and predict the behavior of the network. In certain embodiments, the systems and methods described herein include data-driven techniques for developing causal models for biological networks. Causal network models include computational representations of the causal relationships between independent variables such as a compound of interest and dependent variables such as measured DNA alterations, changes in mRNA, protein, and metabolites to phenotypic readouts of efficacy and toxicity.
A mixed model reduction method for preserving selected physical information
Zhang, Jing; Zheng, Gangtie
2017-03-01
A new model reduction method in the frequency domain is presented. By mixedly using the model reduction techniques from both the time domain and the frequency domain, the dynamic model is condensed to selected physical coordinates, and the contribution of slave degrees of freedom is taken as a modification to the model in the form of effective modal mass of virtually constrained modes. The reduced model can preserve the physical information related to the selected physical coordinates such as physical parameters and physical space positions of corresponding structure components. For the cases of non-classical damping, the method is extended to the model reduction in the state space but still only contains the selected physical coordinates. Numerical results are presented to validate the method and show the effectiveness of the model reduction.
Composite modeling method in dynamics of planar mechanical system
Institute of Scientific and Technical Information of China (English)
2008-01-01
This paper presents a composite modeling method of the forward dynamics in general planar mechanical system. In the modeling process, the system dynamic model is generated by assembling the model units which are kinematical determinate in planar mechanisms rather than the body/joint units in multi-body system. A state space formulation is employed to model both the unit and system models. The validation and feasibility of the method are illustrated by a case study of a four-bar mechanism. The advantage of this method is that the models are easier to reuse and the system is easier to reconfigure. The formulation reveals the relationship between the topology and dynamics of the planar mechanism to some extent.
Composite modeling method in dynamics of planar mechanical system
Institute of Scientific and Technical Information of China (English)
WANG Hao; LIN ZhongQin; LAI XinMin
2008-01-01
This paper presents a composite modeling method of the forward dynamics in general planar mechanical system.In the modeling process,the system dynamic model is generated by assembling the model units which are kinematical determi-nate in planar mechanisms rather than the body/joint units in multi-body system.A state space formulation is employed to model both the unit and system models.The validation and feasibility of the method are illustrated by a case study of a four-bar mechanism.The advantage of this method is that the models are easier to reuse and the system is easier to reconfigure.The formulation reveals the rela-tionship between the topology and dynamics of the planar mechanism to some extent.
Teaching students to apply multiple physical modeling methods
Wiegers, T.; Verlinden, J.C.; Vergeest, J.S.M.
2014-01-01
Design students should be able to explore a variety of shapes before elaborating one particular shape. Current modelling courses don’t address this issue. We developed the course Rapid Modelling, which teaches students to explore multiple shape models in a short time, applying different methods and
Modelling of Landslides with the Material-point Method
DEFF Research Database (Denmark)
Andersen, Søren; Andersen, Lars
2009-01-01
A numerical model for studying the dynamic evolution of landslides is presented. The numerical model is based on the Generalized Interpolation Material Point Method. A simplified slope with a house placed on top is analysed. An elasto-plastic material model based on the Mohr-Coulomb yield criterion...
Modeling of Landslides with the Material Point Method
DEFF Research Database (Denmark)
Andersen, Søren Mikkel; Andersen, Lars
2008-01-01
A numerical model for studying the dynamic evolution of landslides is presented. The numerical model is based on the Generalized Interpolation Material Point Method. A simplified slope with a house placed on top is analysed. An elasto-plastic material model based on the Mohr-Coulomb yield criterion...
An automatic and effective parameter optimization method for model tuning
Directory of Open Access Journals (Sweden)
T. Zhang
2015-11-01
simulation results show that the optimum combination of these parameters determined using this method is able to improve the model's overall performance by 9 %. The proposed methodology and software framework can be easily applied to other GCMs to speed up the model development process, especially regarding unavoidable comprehensive parameter tuning during the model development stage.
Unsteady panel method for complex configurations including wake modeling
CSIR Research Space (South Africa)
Van Zyl, Lourens H
2008-01-01
Full Text Available implementations of the DLM are however not very versatile in terms of geometries that can be modeled. The ZONA6 code offers a versatile surface panel body model including a separated wake model, but uses a pressure panel method for lifting surfaces. This paper...
Teaching students to apply multiple physical modeling methods
Wiegers, T.; Verlinden, J.C.; Vergeest, J.S.M.
2014-01-01
Design students should be able to explore a variety of shapes before elaborating one particular shape. Current modelling courses don’t address this issue. We developed the course Rapid Modelling, which teaches students to explore multiple shape models in a short time, applying different methods and
Design methods for some dose-response models
Albers, Willem/Wim; Strijbosch, Leo W.G.; Does, Ronald J.M.M.
1990-01-01
A recently described design method for one-parameter biomedical models such as limiting or serial dilution assays is generalized to two-parameter models for which the dose-response relationship can be expressed as a linear regression model with parameters α (intercept) and β (slope). Design formulae
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.
Energy Technology Data Exchange (ETDEWEB)
Xu, Qingping; Rawlings, Neil D.; Chiu, Hsiu-Ju; Jaroszewski, Lukasz; Klock, Heath E.; Knuth, Mark W.; Miller, Mitchell D.; Elsliger, Marc-Andre; Deacon, Ashley M.; Godzik, Adam; Lesley, Scott A.; Wilson, Ian A. (SG); (Wellcome)
2012-07-11
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.
Monte Carlo methods and models in finance and insurance
Korn, Ralf
2010-01-01
Offering a unique balance between applications and calculations, this book incorporates the application background of finance and insurance with the theory and applications of Monte Carlo methods. It presents recent methods and algorithms, including the multilevel Monte Carlo method, the statistical Romberg method, and the Heath-Platen estimator, as well as recent financial and actuarial models, such as the Cheyette and dynamic mortality models. The book enables readers to find the right algorithm for a desired application and illustrates complicated methods and algorithms with simple applicat
Method of moments estimation of GO-GARCH models
Boswijk, H.P.; van der Weide, R.
2009-01-01
We propose a new estimation method for the factor loading matrix in generalized orthogonal GARCH (GO-GARCH) models. The method is based on the eigenvectors of a suitably defined sample autocorrelation matrix of squares and cross-products of the process. The method can therefore be easily applied to
On Angular Sampling Methods for 3-D Spatial Channel Models
DEFF Research Database (Denmark)
Fan, Wei; Jämsä, Tommi; Nielsen, Jesper Ødum
2015-01-01
This paper discusses generating three dimensional (3D) spatial channel models with emphasis on the angular sampling methods. Three angular sampling methods, i.e. modified uniform power sampling, modified uniform angular sampling, and random pairing methods are proposed and investigated in detail....
Tensor renormalization group methods for spin and gauge models
Zou, Haiyuan
The analysis of the error of perturbative series by comparing it to the exact solution is an important tool to understand the non-perturbative physics of statistical models. For some toy models, a new method can be used to calculate higher order weak coupling expansion and modified perturbation theory can be constructed. However, it is nontrivial to generalize the new method to understand the critical behavior of high dimensional spin and gauge models. Actually, it is a big challenge in both high energy physics and condensed matter physics to develop accurate and efficient numerical algorithms to solve these problems. In this thesis, one systematic way named tensor renormalization group method is discussed. The applications of the method to several spin and gauge models on a lattice are investigated. theoretically, the new method allows one to write an exact representation of the partition function of models with local interactions. E.g. O(N) models, Z2 gauge models and U(1) gauge models. Practically, by using controllable approximations, results in both finite volume and the thermodynamic limit can be obtained. Another advantage of the new method is that it is insensitive to sign problems for models with complex coupling and chemical potential. Through the new approach, the Fisher's zeros of the 2D O(2) model in the complex coupling plane can be calculated and the finite size scaling of the results agrees well with the Kosterlitz-Thouless assumption. Applying the method to the O(2) model with a chemical potential, new phase diagram of the models can be obtained. The structure of the tensor language may provide a new tool to understand phase transition properties in general.
MODERN MODELS AND METHODS OF DIAGNOSIS OF METHODOLOGY COMPETENT TEACHERS
Directory of Open Access Journals (Sweden)
Loyko V. I.
2016-06-01
Full Text Available The purpose of the research is development of models and methods of diagnostics of methodical competence of a teacher. According to modern views, methodical thinking is the key competence of teachers. Modern experts consider the methodical competence of a teacher as a personal and professional quality, which is a fundamentally important factor in the success of the professional activity of teachers, as well as a subsystem of its professional competence. This is due to the fact that in today's world, a high level of knowledge of teachers of academic subjects and their possessing of learnt basics of teaching methods can not fully describe the level of professional competence of the teacher. The authors have characterized the functional components of methodical competence of the teacher, its relationship with other personalprofessional qualities (first - to the psychological and educational, research and informational competence, as well as its levels of formation. Forming a model of methodical competence of the teacher, the authors proceeded from the fact that a contemporary teacher high demands: it must be ready to conduct independent research, design-learning technologies, forecasting results of training and education of students. As a leading component of the methodical competence of the teacher is his personal experience in methodological activities and requirements of methodical competence determined goals and objectives of methodical activity, the process of the present study, the formation of patterns of methodical competence of the teacher preceded the refinement of existing models methodical activity of scientific and pedagogical staff of higher education institutions and secondary vocational education institutions. The proposed model of methodical competence of the teacher - the scientific basis of a system of monitoring of his personal and professional development, and evaluation criteria and levels of her diagnosis - targets system of
Hybrid ODE/SSA methods and the cell cycle model
Wang, S.; Chen, M.; Cao, Y.
2017-07-01
Stochastic effect in cellular systems has been an important topic in systems biology. Stochastic modeling and simulation methods are important tools to study stochastic effect. Given the low efficiency of stochastic simulation algorithms, the hybrid method, which combines an ordinary differential equation (ODE) system with a stochastic chemically reacting system, shows its unique advantages in the modeling and simulation of biochemical systems. The efficiency of hybrid method is usually limited by reactions in the stochastic subsystem, which are modeled and simulated using Gillespie's framework and frequently interrupt the integration of the ODE subsystem. In this paper we develop an efficient implementation approach for the hybrid method coupled with traditional ODE solvers. We also compare the efficiency of hybrid methods with three widely used ODE solvers RADAU5, DASSL, and DLSODAR. Numerical experiments with three biochemical models are presented. A detailed discussion is presented for the performances of three ODE solvers.
Model refinements of transformers via a subproblem finite element method
Dular, Patrick; Kuo-Peng, Patrick; Ferreira Da Luz, Mauricio,; Krähenbühl, Laurent
2015-01-01
International audience; A progressive modeling of transformers is performed via a subproblem finite element method. A complete problem is split into subproblems with different adapted overlapping meshes. Model refinements are performed from ideal to real flux tubes, 1-D to 2-D to 3-D models, linear to nonlinear materials, perfect to real materials, single wire to volume conductor windings, and homogenized to fine models of cores and coils, with any coupling of these changes. The proposed unif...
Interval Methods for Model Qualification: Methodology and Advanced Application
Alexandre dit Sandretto, Julien; Trombettoni, Gilles; Daney, David
2012-01-01
It is often too complex to use, and sometimes impossible to obtain, an actual model in simulation or command field . To handle a system in practice, a simplification of the real model is then necessary. This simplification goes through some hypotheses made on the system or the modeling approach. In this paper, we deal with all models that can be expressed by real-valued variables involved in analytical relations and depending on parameters. We propose a method that qualifies the simplificatio...
Neal, Radford M
2012-01-01
Consider a Markov chain defined on a finite state space, X, that leaves invariant the uniform distribution on X, and whose transition probabilities are integer multiples of 1/Q, for some integer Q. I show how a simulation of n transitions of this chain starting at x_0 can be viewed as applying a random permutation on the space XxU, where U={0,1,...,Q-1}, to the start state (x_0,u_0), with u_0 drawn uniformly from U. This result can be applied to a non-uniform distribution with probabilities that are integer multiples of 1/P, for some integer P, by representing it as the marginal distribution for X from the uniform distribution on a suitably-defined subset of XxY, where Y={0,1,...,P-1}. By letting Q, P, and the cardinality of X go to infinity, this result can be generalized to non-rational probabilities and to continuous state spaces, with permutations on a finite space replaced by volume-preserving one-to-one maps from a continuous space to itself. These constructions can be efficiently implemented for chains...
A simple method for modeling dye-sensitized solar cells
Energy Technology Data Exchange (ETDEWEB)
Son, Min-Kyu [Department of Electrical Engineering, Pusan National University, San 30, Jangjeon-Dong, Geumjeong-Gu, Busan, 609-735 (Korea, Republic of); Seo, Hyunwoong [Graduate School of Information Science and Electrical Engineering, Kyushu University, 744 Motooka, Nishi-ku, Fukuoka, 819-0395 (Japan); Center of Plasma Nano-interface Engineering, Kyushu University, 744 Motooka, Nishi-ku, Fukuoka, 819-0395 (Japan); Lee, Kyoung-Jun; Kim, Soo-Kyoung; Kim, Byung-Man; Park, Songyi; Prabakar, Kandasamy [Department of Electrical Engineering, Pusan National University, San 30, Jangjeon-Dong, Geumjeong-Gu, Busan, 609-735 (Korea, Republic of); Kim, Hee-Je, E-mail: heeje@pusan.ac.kr [Department of Electrical Engineering, Pusan National University, San 30, Jangjeon-Dong, Geumjeong-Gu, Busan, 609-735 (Korea, Republic of)
2014-03-03
Dye-sensitized solar cells (DSCs) are photoelectrochemical photovoltaics based on complicated electrochemical reactions. The modeling and simulation of DSCs are powerful tools for evaluating the performance of DSCs according to a range of factors. Many theoretical methods are used to simulate DSCs. On the other hand, these methods are quite complicated because they are based on a difficult mathematical formula. Therefore, this paper suggests a simple and accurate method for the modeling and simulation of DSCs without complications. The suggested simulation method is based on extracting the coefficient from representative cells and a simple interpolation method. This simulation method was implemented using the power electronic simulation program and C-programming language. The performance of DSCs according to the TiO{sub 2} thickness was simulated, and the simulated results were compared with the experimental data to confirm the accuracy of this simulation method. The suggested modeling strategy derived the accurate current–voltage characteristics of the DSCs according to the TiO{sub 2} thickness with good agreement between the simulation and the experimental results. - Highlights: • Simple modeling and simulation method for dye-sensitized solar cells (DSCs). • Modeling done using a power electronic simulation program and C-programming language. • The performance of DSC according to the TiO{sub 2} thickness was simulated. • Simulation and experimental performance of DSCs were compared. • This method is suitable for accurate simulation of DSCs.
Numerical methods for modeling photonic-crystal VCSELs
DEFF Research Database (Denmark)
Dems, Maciej; Chung, Il-Sug; Nyakas, Peter
2010-01-01
We show comparison of four different numerical methods for simulating Photonic-Crystal (PC) VCSELs. We present the theoretical basis behind each method and analyze the differences by studying a benchmark VCSEL structure, where the PC structure penetrates all VCSEL layers, the entire top-mirror DBR...... to the effective index method. The simulation results elucidate the strength and weaknesses of the analyzed methods; and outline the limits of applicability of the different models....
SmartShadow models and methods for pervasive computing
Wu, Zhaohui
2013-01-01
SmartShadow: Models and Methods for Pervasive Computing offers a new perspective on pervasive computing with SmartShadow, which is designed to model a user as a personality ""shadow"" and to model pervasive computing environments as user-centric dynamic virtual personal spaces. Just like human beings' shadows in the physical world, it follows people wherever they go, providing them with pervasive services. The model, methods, and software infrastructure for SmartShadow are presented and an application for smart cars is also introduced. The book can serve as a valuable reference work for resea
Quasi-Monte Carlo methods for the Heston model
Jan Baldeaux; Dale Roberts
2012-01-01
In this paper, we discuss the application of quasi-Monte Carlo methods to the Heston model. We base our algorithms on the Broadie-Kaya algorithm, an exact simulation scheme for the Heston model. As the joint transition densities are not available in closed-form, the Linear Transformation method due to Imai and Tan, a popular and widely applicable method to improve the effectiveness of quasi-Monte Carlo methods, cannot be employed in the context of path-dependent options when the underlying pr...
Compositions and methods for modeling Saccharomyces cerevisiae metabolism
DEFF Research Database (Denmark)
2012-01-01
The invention provides an in silica model for determining a S. cerevisiae physiological function. The model includes a data structure relating a plurality of S. cerevisiae reactants to a plurality of S. cerevisiae reactions, a constraint set for the plurality of S. cerevisiae reactions......, and commands for determining a distribution of flux through the reactions that is predictive of a S. cerevisiae physiological function. A model of the invention can further include a gene database containing information characterizing the associated gene or genes. The invention further provides methods...... for making an in silica S. cerevisiae model and methods for determining a S. cerevisiae physiological function using a model of the invention. The invention provides an in silica model for determining a S. cerevisiae physiological function. The model includes a data structure relating a plurality of S...
Finite Element Model Updating Using Response Surface Method
Marwala, Tshilidzi
2007-01-01
This paper proposes the response surface method for finite element model updating. The response surface method is implemented by approximating the finite element model surface response equation by a multi-layer perceptron. The updated parameters of the finite element model were calculated using genetic algorithm by optimizing the surface response equation. The proposed method was compared to the existing methods that use simulated annealing or genetic algorithm together with a full finite element model for finite element model updating. The proposed method was tested on an unsymmetri-cal H-shaped structure. It was observed that the proposed method gave the updated natural frequen-cies and mode shapes that were of the same order of accuracy as those given by simulated annealing and genetic algorithm. Furthermore, it was observed that the response surface method achieved these results at a computational speed that was more than 2.5 times as fast as the genetic algorithm and a full finite element model and 24 ti...
Evaluation of bias correction methods for wave modeling output
Parker, K.; Hill, D. F.
2017-02-01
Models that seek to predict environmental variables invariably demonstrate bias when compared to observations. Bias correction (BC) techniques are common in the climate and hydrological modeling communities, but have seen fewer applications to the field of wave modeling. In particular there has been no investigation as to which BC methodology performs best for wave modeling. This paper introduces and compares a subset of BC methods with the goal of clarifying a "best practice" methodology for application of BC in studies of wave-related processes. Specific focus is paid to comparing parametric vs. empirical methods as well as univariate vs. bivariate methods. The techniques are tested on global WAVEWATCH III historic and future period datasets with comparison to buoy observations at multiple locations. Both wave height and period are considered in order to investigate BC effects on inter-variable correlation. Results show that all methods perform uniformly in terms of correcting statistical moments for individual variables with the exception of a copula based method underperforming for wave period. When comparing parametric and empirical methods, no difference is found. Between bivariate and univariate methods, results show that bivariate methods greatly improve inter-variable correlations. Of the bivariate methods tested the copula based method is found to be not as effective at correcting correlation while a "shuffling" method is unable to handle changes in correlation from historic to future periods. In summary, this study demonstrates that BC methods are effective when applied to wave model data and that it is essential to employ methods that consider dependence between variables.
Random weighting method for Cox’s proportional hazards model
Institute of Scientific and Technical Information of China (English)
2008-01-01
Variance of parameter estimate in Cox’s proportional hazards model is based on asymptotic variance. When sample size is small, variance can be estimated by bootstrap method. However, if censoring rate in a survival data set is high, bootstrap method may fail to work properly. This is because bootstrap samples may be even more heavily censored due to repeated sampling of the censored observations. This paper proposes a random weighting method for variance estimation and confidence interval estimation for proportional hazards model. This method, unlike the bootstrap method, does not lead to more severe censoring than the original sample does. Its large sample properties are studied and the consistency and asymptotic normality are proved under mild conditions. Simulation studies show that the random weighting method is not as sensitive to heavy censoring as bootstrap method is and can produce good variance estimates or confidence intervals.
Random weighting method for Cox's proportional hazards model
Institute of Scientific and Technical Information of China (English)
CUI WenQuan; LI Kai; YANG YaNing; WU YueHua
2008-01-01
Variance of parameter estimate in Cox's proportional hazards model is based on asymptotic variance.When sample size is small,variance can be estimated by bootstrap method.However,if censoring rate in a survival data set is high,bootstrap method may fail to work properly.This is because bootstrap samples may be even more heavily censored due to repeated sampling of the censored observations.This paper proposes a random weighting method for variance estimation and confidence interval estimation for proportional hazards model.This method,unlike the bootstrap method,does not lead to more severe censoring than the original sample does.Its large sample properties are studied and the consistency and asymptotic normality are proved under mild conditions.Simulation studies show that the random weighting method is not as sensitive to heavy censoring as bootstrap method is and can produce good variance estimates or confidence intervals.
Fuzzy Clustering Methods and their Application to Fuzzy Modeling
DEFF Research Database (Denmark)
Kroszynski, Uri; Zhou, Jianjun
1999-01-01
Fuzzy modeling techniques based upon the analysis of measured input/output data sets result in a set of rules that allow to predict system outputs from given inputs. Fuzzy clustering methods for system modeling and identification result in relatively small rule-bases, allowing fast, yet accurate...... prediction of outputs. This article presents an overview of some of the most popular clustering methods, namely Fuzzy Cluster-Means (FCM) and its generalizations to Fuzzy C-Lines and Elliptotypes. The algorithms for computing cluster centers and principal directions from a training data-set are described....... A method to obtain an optimized number of clusters is outlined. Based upon the cluster's characteristics, a behavioural model is formulated in terms of a rule-base and an inference engine. The article reviews several variants for the model formulation. Some limitations of the methods are listed...
Analysis of Dynamic Modeling Method Based on Boundary Element
Directory of Open Access Journals (Sweden)
Xu-Sheng Gan
2013-07-01
Full Text Available The aim of this study was to study an improved dynamic modeling method based on a Boundary Element Method (BEM. The dynamic model was composed of the elements such as the beam element, plate element, joint element, lumped mass and spring element by the BEM. An improved dynamic model of a machine structure was established based on plate-beam element system mainly. As a result, the dynamic characteristics of a machine structure were analyzed and the comparison of computational results and experimental’s showed the modeling method was effective. The analyses indicate that the introduced method inaugurates a good way for analyzing dynamic characteristics of a machine structure efficiently.
Cavity method in the spherical Sherrington-Kirkpatrick model
Panchenko, Dmitry
2006-01-01
We develop a cavity method in the spherical Sherrington-Kirkpatrick model at high temperature and small external field. As one application we compute the limit of the covariance matrix for fluctuations of the overlap and magnetization.
Discrete Event Simulation Modeling of Radiation Medicine Delivery Methods
Energy Technology Data Exchange (ETDEWEB)
Paul M. Lewis; Dennis I. Serig; Rick Archer
1998-12-31
The primary objective of this work was to evaluate the feasibility of using discrete event simulation (DES) modeling to estimate the effects on system performance of changes in the human, hardware, and software elements of radiation medicine delivery methods.
Nonstandard Finite Difference Method Applied to a Linear Pharmacokinetics Model
Directory of Open Access Journals (Sweden)
Oluwaseun Egbelowo
2017-05-01
Full Text Available We extend the nonstandard finite difference method of solution to the study of pharmacokinetic–pharmacodynamic models. Pharmacokinetic (PK models are commonly used to predict drug concentrations that drive controlled intravenous (I.V. transfers (or infusion and oral transfers while pharmacokinetic and pharmacodynamic (PD interaction models are used to provide predictions of drug concentrations affecting the response of these clinical drugs. We structure a nonstandard finite difference (NSFD scheme for the relevant system of equations which models this pharamcokinetic process. We compare the results obtained to standard methods. The scheme is dynamically consistent and reliable in replicating complex dynamic properties of the relevant continuous models for varying step sizes. This study provides assistance in understanding the long-term behavior of the drug in the system, and validation of the efficiency of the nonstandard finite difference scheme as the method of choice.
SELECTION MOMENTS AND GENERALIZED METHOD OF MOMENTS FOR HETEROSKEDASTIC MODELS
Directory of Open Access Journals (Sweden)
Constantin ANGHELACHE
2016-06-01
Full Text Available In this paper, the authors describe the selection methods for moments and the application of the generalized moments method for the heteroskedastic models. The utility of GMM estimators is found in the study of the financial market models. The selection criteria for moments are applied for the efficient estimation of GMM for univariate time series with martingale difference errors, similar to those studied so far by Kuersteiner.
Gaussian mixture models as flux prediction method for central receivers
Grobler, Annemarie; Gauché, Paul; Smit, Willie
2016-05-01
Flux prediction methods are crucial to the design and operation of central receiver systems. Current methods such as the circular and elliptical (bivariate) Gaussian prediction methods are often used in field layout design and aiming strategies. For experimental or small central receiver systems, the flux profile of a single heliostat often deviates significantly from the circular and elliptical Gaussian models. Therefore a novel method of flux prediction was developed by incorporating the fitting of Gaussian mixture models onto flux profiles produced by flux measurement or ray tracing. A method was also developed to predict the Gaussian mixture model parameters of a single heliostat for a given time using image processing. Recording the predicted parameters in a database ensures that more accurate predictions are made in a shorter time frame.
Automated Model Fit Method for Diesel Engine Control Development
Seykens, X.; Willems, F.P.T.; Kuijpers, B.; Rietjens, C.
2014-01-01
This paper presents an automated fit for a control-oriented physics-based diesel engine combustion model. This method is based on the combination of a dedicated measurement procedure and structured approach to fit the required combustion model parameters. Only a data set is required that is consider
Approximating methods for intractable probabilistic models: Applications in neuroscience
DEFF Research Database (Denmark)
Højen-Sørensen, Pedro
2002-01-01
This thesis investigates various methods for carrying out approximate inference in intractable probabilistic models. By capturing the relationships between random variables, the framework of graphical models hints at which sets of random variables pose a problem to the inferential step. The appro...
Automated Model Fit Method for Diesel Engine Control Development
Seykens, X.; Willems, F.P.T.; Kuijpers, B.; Rietjens, C.
2014-01-01
This paper presents an automated fit for a control-oriented physics-based diesel engine combustion model. This method is based on the combination of a dedicated measurement procedure and structured approach to fit the required combustion model parameters. Only a data set is required that is