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
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.
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
Using the Tukey-Kramer omnibus test in the Hayter-Fisher procedure.
Richter, Scott J; McCann, Melinda H
2012-11-01
Using Tukey-Kramer versus the ANOVA F-test as the omnibus test of the Hayter-Fisher procedure for comparing all pairs of normally distributed means, when sample sizes are unequal, is investigated. Simulation results suggest that using Tukey-Kramer leads to as much or more any-pairs power compared to using the F-test for certain patterns of mean differences, and equivalent per-pair and all-pairs power for all cases. Furthermore, using Tukey-Kramer results in a consonant test procedure, where there cannot be disagreement between the results of the omnibus test and the subsequent pairwise tests. The results suggest that when sample sizes are unequal, Tukey-Kramer may be preferred over the F-test as the omnibus test for the Hayter-Fisher procedure.
Omnibus test for change detection in a time sequence of polarimetric SAR data
DEFF Research Database (Denmark)
Nielsen, Allan Aasbjerg; Conradsen, Knut; Skriver, Henning
2016-01-01
Based on an omnibus likelihood ratio test statistic for the equality of several variance-covariance matrices following the complex Wishart distribution with an associated p-value and a factorization of this test statistic, change analysis in a (short) time series of multilook, polarimetric SAR data...
Local and omnibus goodness-of-fit tests in classical measurement error models
Ma, Yanyuan
2010-09-14
We consider functional measurement error models, i.e. models where covariates are measured with error and yet no distributional assumptions are made about the mismeasured variable. We propose and study a score-type local test and an orthogonal series-based, omnibus goodness-of-fit test in this context, where no likelihood function is available or calculated-i.e. all the tests are proposed in the semiparametric model framework. We demonstrate that our tests have optimality properties and computational advantages that are similar to those of the classical score tests in the parametric model framework. The test procedures are applicable to several semiparametric extensions of measurement error models, including when the measurement error distribution is estimated non-parametrically as well as for generalized partially linear models. The performance of the local score-type and omnibus goodness-of-fit tests is demonstrated through simulation studies and analysis of a nutrition data set.
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...
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…
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.
Permutation Tests in Principal Component Analysis.
Pohlmann, John T.; Perkins, Kyle; Brutten, Shelia
Structural changes in an English as a Second Language (ESL) 30-item reading comprehension test were examined through principal components analysis on a small sample (n=31) of students. Tests were administered on three occasions during intensive ESL training. Principal components analysis of the items was performed for each test occasion.…
DEFF Research Database (Denmark)
Nielsen, Allan Aasbjerg; Conradsen, Knut; Skriver, Henning
2016-01-01
Based on an omnibus likelihood ratio test statistic for the equality of several variance-covariance matrices following the complex Wishart distribution with an associated p-value and a factorization of this test statistic, change analysis in a short sequence of multilook, polarimetric SAR data...... in the covariance matrix representation is carried out. The omnibus test statistic and its factorization detect if and when change(s) occur. The technique is demonstrated on airborne EMISAR L-band data but may be applied to Sentinel-1, Cosmo-SkyMed, TerraSAR-X, ALOS and RadarSat-2 or other dual- and quad...
DEFF Research Database (Denmark)
Nielsen, Allan Aasbjerg; Conradsen, Knut; Skriver, Henning
2016-01-01
Based on an omnibus likelihood ratio test statistic for the equality of several variance-covariance matrices following the complex Wishart distribution with an associated p-value and a factorization of this test statistic, change analysis in a short sequence of multilook, polarimetric SAR data...
DEFF Research Database (Denmark)
Nielsen, Allan Aasbjerg; Conradsen, Knut; Skriver, Henning
2016-01-01
Based on an omnibus likelihood ratio test statistic for the equality of several variance-covariance matrices following the complex Wishart distribution with an associated p-value and a factorization of this test statistic, change analysis in a short sequence of multilook, polarimetric SAR data...
DEFF Research Database (Denmark)
Nielsen, Allan Aasbjerg; Conradsen, Knut; Skriver, Henning
2016-01-01
in the covariance matrix representation is carried out. The omnibus test statistic and its factorization detect if and when change(s) occur. The technique is demonstrated on airborne EMISAR L-band data but may be applied to Sentinel-1, Cosmo-SkyMed, TerraSAR-X, ALOS and RadarSat-2 or other dual- and quad...
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.
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
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.
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/
U.S. Department of Health & Human Services — Gene Expression Omnibus is a public functional genomics data repository supporting MIAME-compliant submissions of array- and sequence-based data. Tools are provided...
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.
Permutation Tests for k-Sample Binomial Data.
1976-11-01
fact will allow the use of the Wald—Wolfowjtz— Noether Theorem to obtain the limiting distribution of the test statistics. For the sake of completeness...241) - 2 < i < r, it follows by the Wald-Wolfowitz- Noether Theorem that the limiting joint distribution of L2~•••~ Lr is asymptotically normal with...k~ ~=i j=im r 2 ~J-~- m1(l .J~ ~~~ ( Zi-r - l) . Hence by the Wald-Wolfowitz- - 1=1 1 Wolfowitz— Noether Theorem , L/aL converges in distribution
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.
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
Nielsen, Allan A.; Conradsen, Knut; Skriver, Henning
2016-10-01
Test statistics for comparison of real (as opposed to complex) variance-covariance matrices exist in the statistics literature [1]. In earlier publications we have described a test statistic for the equality of two variance-covariance matrices following the complex Wishart distribution with an associated p-value [2]. We showed their application to bitemporal change detection and to edge detection [3] in multilook, polarimetric synthetic aperture radar (SAR) data in the covariance matrix representation [4]. The test statistic and the associated p-value is described in [5] also. In [6] we focussed on the block-diagonal case, we elaborated on some computer implementation issues, and we gave examples on the application to change detection in both full and dual polarization bitemporal, bifrequency, multilook SAR data. In [7] we described an omnibus test statistic Q for the equality of k variance-covariance matrices following the complex Wishart distribution. We also described a factorization of Q = R2 R3 … Rk where Q and Rj determine if and when a difference occurs. Additionally, we gave p-values for Q and Rj. Finally, we demonstrated the use of Q and Rj and the p-values to change detection in truly multitemporal, full polarization SAR data. Here we illustrate the methods by means of airborne L-band SAR data (EMISAR) [8,9]. The methods may be applied to other polarimetric SAR data also such as data from Sentinel-1, COSMO-SkyMed, TerraSAR-X, ALOS, and RadarSat-2 and also to single-pol data. The account given here closely follows that given our recent IEEE TGRS paper [7]. Selected References [1] Anderson, T. W., An Introduction to Multivariate Statistical Analysis, John Wiley, New York, third ed. (2003). [2] Conradsen, K., Nielsen, A. A., Schou, J., and Skriver, H., "A test statistic in the complex Wishart distribution and its application to change detection in polarimetric SAR data," IEEE Transactions on Geoscience and Remote Sensing 41(1): 4-19, 2003. [3] Schou, J
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.
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.
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.
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.
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.)
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.
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.
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.
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.
A Studentized Permutation Test for the Comparison of Spatial Point Patterns
DEFF Research Database (Denmark)
Hahn, Ute
A new test is proposed for the hypothesis that two (or more) observed point patterns are realizations of the same spatial point process model. To this end, the point patterns are divided into disjoint quadrats, on each of which an estimate of Ripley's K-function is calculated. The two groups...
The Gene Expression Omnibus database
Clough, Emily; Barrett, Tanya
2016-01-01
The Gene Expression Omnibus (GEO) database is an international public repository that archives and freely distributes high-throughput gene expression and other functional genomics data sets. Created in 2000 as a worldwide resource for gene expression studies, GEO has evolved with rapidly changing technologies and now accepts high-throughput data for many other data applications, including those that examine genome methylation, chromatin structure, and genome–protein interactions. GEO supports community-derived reporting standards that specify provision of several critical study elements including raw data, processed data, and descriptive metadata. The database not only provides access to data for tens of thousands of studies, but also offers various Web-based tools and strategies that enable users to locate data relevant to their specific interests, as well as to visualize and analyze the data. This chapter includes detailed descriptions of methods to query and download GEO data and use the analysis and visualization tools. The GEO homepage is at http://www.ncbi.nlm.nih.gov/geo/. PMID:27008011
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
Adjudicating non-knowledge in the Omnibus Autism Proceedings.
Decoteau, Claire Laurier; Underman, Kelly
2015-08-01
After 5600 families of children diagnosed with autism filed claims with the National Vaccine Injury Compensation Program in the United States, the court selected 'test' cases consolidated into the Omnibus Autism Proceedings, held from 2007 to 2008, to examine claims that vaccines caused the development of autism. The court found all of the causation theories presented to be untenable and did not award damages to any parents. We analyze the Omnibus Autism Proceedings as a struggle within the scientific field between the scientific orthodoxy of the respondents and the heterodox position taken by the plaintiffs, suggesting that the ruling in these cases helped to shore up hegemony on autism causation. Drawing on the literature on non-knowledge, we suggest that only the respondents had enough scientific capital to strategically direct non-knowledge toward genetic research, thereby foreclosing the possibility of environmental causation of autism. The plaintiffs, who promote a non-standard ontology of autism, suggest that the science on autism remains undone and should not be circumscribed. In analyzing the Omnibus Autism Proceedings with field theory, we highlight the way in which scientific consensus-building and the setting of research agendas are the result of struggle, and we show that the strategic deployment of non-knowledge becomes a major stake in battles for scientific legitimacy and the settling of scientific controversies.
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
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.
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.
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.
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...
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--...
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 ...
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.
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...
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...
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...
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
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...
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...
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.
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...
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 ...
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
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...
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.
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.
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.
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.
Energy Technology Data Exchange (ETDEWEB)
Pettitt, W.S. [Applied Seismology Consultants LTD, 10 Belmont, Shropshire, UK-S41 ITE Shrewsbury (United Kingdom); Collins, D.S.; Hildyard, M.W.; Young, R.P. [Department of Earth Sciences, Liverpool University, 4 Brownlow street, UK-0 L69 3GP Liverpool (United Kingdom); Balland, C.; Bigarre, P. [Institut National de l' Environnement Industriel et des risques, INERIS, Parc Technologique ALATA, BP 2, 60550 Verneuil-en-Halatte (France)
2004-07-01
This paper describes current results from the OMNIBUS project, a study funded by the EC as part of the fifth framework EURATOM programme. The objective of the project is to develop ultrasonic monitoring tools and associated technologies for investigating the rock barrier in both potential and operational underground nuclear waste repositories. A complete data acquisition tool has been developed and has been successfully tested during an in situ experiment aimed at studying an argillaceous rock layer. The tool includes an integrated hardware and software package specifically designed for monitoring an argillaceous rock mass. Numerical models are being used to provide a sensitivity analysis of ultrasonic wave propagation to variations in stress, crack population and fluid content. Through this approach we aim to improve our understanding of how ultrasonic data can be interpreted in terms of useful engineering rock-mass properties. Data from laboratory and in situ experiments will be used to develop and test the strategy. (authors)
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.
Omnibus experiment: CPT and CP violation with sterile neutrinos
Loo, K. K.; Novikov, N. Yu; Smirnov, M. V.; Trzaska, W. H.; Wurm, M.
2016-05-01
We propose to probe both the CPT and CP violation together with the search for sterile neutrinos in one do-it-all experiment. This omnibus experiment would utilize neutrino oscillometry with large scintillator detectors like LENA, JUNO or RENO-50 and manmade radioactive sources similar to the ones used by the GALLEX experiment. Our calculations indicate that such an experiment is realistic and could be performed in parallel to the main research plan for JUNO, LENA, or RENO-50. Assuming as the starting point the values of the oscillation parameters indicated by the current global fit (in 3 active + 1 sterile scenario) and requiring at least 5 sigma confidence level, we estimate that with the proposed experiment we would be able to detect CPT mass anomalies of the order of 1% or larger.
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...
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.
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...
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.
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 ...
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.
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...
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.
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.
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}.
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.
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....
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.
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.
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.
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.
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
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.
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.
Neoplan bus with optional electric drive. Neoplan-Omnibus mit multipler Energieversorgung
Energy Technology Data Exchange (ETDEWEB)
Lee, R.; Ehrhart, P.
The Gottlob Auwaerter GmbH and Co has been involved with the manufacturing of electrically driven omnibuses for some time. In co-operation with Varta they developed an optinal technology for the nickel-metal hybrid batteries. In order to fully use the advantages of the electric drives the company developed a drive system in co-operation with the magnet Motor GmbH which uses almost no mechanical components. This omnibus with its fibre-compound plastic body is suited to the urban traffic of today and tomorrow. (orig.)
Keelan, Jennifer; Wilson, Kumanan
2011-11-01
The US Court of Federal Claims, which adjudicates cases for the National Vaccine Injury Compensation Program, has been confronted with more than 5000 cases submitted on behalf of children with autism spectrum disorders, seeking to link the condition to vaccination. Through a test case process, the Omnibus Autism Proceedings have in every instance found no association between autism spectrum disorders and vaccines. However, vaccine advocates have criticized the courts for having an overly permissive evidentiary test for causation and for granting credence to insupportable accusations of vaccine harm. In fact, the courts have functioned as intended and have allowed for a fair hearing of vaccine concerns while maintaining confidence in vaccines and providing protection to vaccine manufacturers.
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.
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.
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...
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
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.
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 ...
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.
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.
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.
A Report on the Omnibus General Subject "Invitation to the Computer World"
仙石, 正和; Sengoku, Masakazu
1998-01-01
A report on the omnibus general subject "Invitation to the Computer World" was opened to the all of the students in Niigata University. There were students from Faculties of Humanities, Education, Law, Economics, Science, Engineering and Agriculture. This subject consisted of 13 lectures on the Invitation to the Computer World. The computers will affect more and more the human life in the 21st century. As the introduction to computers, this subject includes the history of computers, hardware,...
2011-12-20
... and Competitiveness Act of 1988--Russian Federation Memorandum for the United States Trade Representative Pursuant to section 1106(a) of the Omnibus Trade and Competitiveness Act of 1988 (19 U.S.C....
An omnibus CUSUM chart for monitoring time to event data.
Phinikettos, Ioannis; Gandy, Axel
2014-07-01
A non-parametric method is proposed for monitoring time-to-event data. A cumulative sum chart is constructed that is able to detect an unknown out-of-control state. This method exploits the absolute differences between the Kaplan-Meier estimator and the in-control distribution over specific time intervals. The efficiency of the algorithm is studied via a simulation and a real data study. The new method is also tested via the simulation study against existing methods.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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...
Extraction and analysis of signatures from the Gene Expression Omnibus by the crowd
Wang, Zichen; Monteiro, Caroline D.; Jagodnik, Kathleen M.; Fernandez, Nicolas F.; Gundersen, Gregory W.; Rouillard, Andrew D.; Jenkins, Sherry L.; Feldmann, Axel S.; Hu, Kevin S.; McDermott, Michael G.; Duan, Qiaonan; Clark, Neil R.; Jones, Matthew R.; Kou, Yan; Goff, Troy; Woodland, Holly; Amaral, Fabio M. R.; Szeto, Gregory L.; Fuchs, Oliver; Schüssler-Fiorenza Rose, Sophia M.; Sharma, Shvetank; Schwartz, Uwe; Bausela, Xabier Bengoetxea; Szymkiewicz, Maciej; Maroulis, Vasileios; Salykin, Anton; Barra, Carolina M.; Kruth, Candice D.; Bongio, Nicholas J.; Mathur, Vaibhav; Todoric, Radmila D.; Rubin, Udi E.; Malatras, Apostolos; Fulp, Carl T.; Galindo, John A.; Motiejunaite, Ruta; Jüschke, Christoph; Dishuck, Philip C.; Lahl, Katharina; Jafari, Mohieddin; Aibar, Sara; Zaravinos, Apostolos; Steenhuizen, Linda H.; Allison, Lindsey R.; Gamallo, Pablo; de Andres Segura, Fernando; Dae Devlin, Tyler; Pérez-García, Vicente; Ma'Ayan, Avi
2016-09-01
Gene expression data are accumulating exponentially in public repositories. Reanalysis and integration of themed collections from these studies may provide new insights, but requires further human curation. Here we report a crowdsourcing project to annotate and reanalyse a large number of gene expression profiles from Gene Expression Omnibus (GEO). Through a massive open online course on Coursera, over 70 participants from over 25 countries identify and annotate 2,460 single-gene perturbation signatures, 839 disease versus normal signatures, and 906 drug perturbation signatures. All these signatures are unique and are manually validated for quality. Global analysis of these signatures confirms known associations and identifies novel associations between genes, diseases and drugs. The manually curated signatures are used as a training set to develop classifiers for extracting similar signatures from the entire GEO repository. We develop a web portal to serve these signatures for query, download and visualization.
Extraction and analysis of signatures from the Gene Expression Omnibus by the crowd
Wang, Zichen; Monteiro, Caroline D.; Jagodnik, Kathleen M.; Fernandez, Nicolas F.; Gundersen, Gregory W.; Rouillard, Andrew D.; Jenkins, Sherry L.; Feldmann, Axel S.; Hu, Kevin S.; McDermott, Michael G.; Duan, Qiaonan; Clark, Neil R.; Jones, Matthew R.; Kou, Yan; Goff, Troy; Woodland, Holly; Amaral, Fabio M R.; Szeto, Gregory L.; Fuchs, Oliver; Schüssler-Fiorenza Rose, Sophia M.; Sharma, Shvetank; Schwartz, Uwe; Bausela, Xabier Bengoetxea; Szymkiewicz, Maciej; Maroulis, Vasileios; Salykin, Anton; Barra, Carolina M.; Kruth, Candice D.; Bongio, Nicholas J.; Mathur, Vaibhav; Todoric, Radmila D; Rubin, Udi E.; Malatras, Apostolos; Fulp, Carl T.; Galindo, John A.; Motiejunaite, Ruta; Jüschke, Christoph; Dishuck, Philip C.; Lahl, Katharina; Jafari, Mohieddin; Aibar, Sara; Zaravinos, Apostolos; Steenhuizen, Linda H.; Allison, Lindsey R.; Gamallo, Pablo; de Andres Segura, Fernando; Dae Devlin, Tyler; Pérez-García, Vicente; Ma'ayan, Avi
2016-01-01
Gene expression data are accumulating exponentially in public repositories. Reanalysis and integration of themed collections from these studies may provide new insights, but requires further human curation. Here we report a crowdsourcing project to annotate and reanalyse a large number of gene expression profiles from Gene Expression Omnibus (GEO). Through a massive open online course on Coursera, over 70 participants from over 25 countries identify and annotate 2,460 single-gene perturbation signatures, 839 disease versus normal signatures, and 906 drug perturbation signatures. All these signatures are unique and are manually validated for quality. Global analysis of these signatures confirms known associations and identifies novel associations between genes, diseases and drugs. The manually curated signatures are used as a training set to develop classifiers for extracting similar signatures from the entire GEO repository. We develop a web portal to serve these signatures for query, download and visualization. PMID:27667448
2010-10-01
...: Introduction. Section 402 of the Omnibus Diplomatic Security and Antiterrorism Act (Public Law 99-399) provides... jure incorporation of a business organization pursuant to the laws of any United States jurisdiction or... contracts, and to hold property under the law of the jurisdiction where they are doing business will qualify...
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.
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.
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.
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.
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.
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.
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.
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.
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.
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 ...
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...
shinyGEO: a web-based application for analyzing gene expression omnibus datasets.
Dumas, Jasmine; Gargano, Michael A; Dancik, Garrett M
2016-12-01
The Gene Expression Omnibus (GEO) is a public repository of gene expression data. Although GEO has its own tool, GEO2R, for data analysis, evaluation of single genes is not straightforward and survival analysis in specific GEO datasets is not possible without bioinformatics expertise. We describe a web application, shinyGEO, that allows a user to download gene expression data sets directly from GEO in order to perform differential expression and survival analysis for a gene of interest. In addition, shinyGEO supports customized graphics, sample selection, data export and R code generation so that all analyses are reproducible. The availability of shinyGEO makes GEO datasets more accessible to non-bioinformaticians, promising to lead to better understanding of biological processes and genetic diseases such as cancer. Web application and source code are available from http://gdancik.github.io/shinyGEO/ CONTACT: dancikg@easternct.eduSupplementary information: Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.
Gene Expression Omnibus: NCBI gene expression and hybridization array data repository.
Edgar, Ron; Domrachev, Michael; Lash, Alex E
2002-01-01
The Gene Expression Omnibus (GEO) project was initiated in response to the growing demand for a public repository for high-throughput gene expression data. GEO provides a flexible and open design that facilitates submission, storage and retrieval of heterogeneous data sets from high-throughput gene expression and genomic hybridization experiments. GEO is not intended to replace in house gene expression databases that benefit from coherent data sets, and which are constructed to facilitate a particular analytic method, but rather complement these by acting as a tertiary, central data distribution hub. The three central data entities of GEO are platforms, samples and series, and were designed with gene expression and genomic hybridization experiments in mind. A platform is, essentially, a list of probes that define what set of molecules may be detected. A sample describes the set of molecules that are being probed and references a single platform used to generate its molecular abundance data. A series organizes samples into the meaningful data sets which make up an experiment. The GEO repository is publicly accessible through the World Wide Web at http://www.ncbi.nlm.nih.gov/geo.
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.
2010-01-01
... 8 Aliens and Nationality 1 2010-01-01 2010-01-01 false Aliens entering Guam pursuant to section 14 of Public Law 99-396, âOmnibus Territories Act.â 233.5 Section 233.5 Aliens and Nationality... entering Guam pursuant to section 14 of Public Law 99-396, “Omnibus Territories Act.” A transportation...
Institute of Scientific and Technical Information of China (English)
Zhang Shengyuan; Cheng Qiuming; Chen Zhijun
2008-01-01
Weights of evidence (WofE) is an artificial intelligent method for integration of information from diverse sources for predictive purpose in supporting decision making. This method has been commonly used to predict point events by integrating point training layer and binary or ternary evidential layers (multiclass evidence less commonly used). Omnibus weights of evidence integrates fuzzy training layer and diverse evidential layers. This method provides new features in comparison with the ordinary WofE method. This new method has been implemented in a geographic information system-geophysical data analysis system and the method includes the following contents: (1) dual fuzzy weights of evidence (DFWofE), in which training layer and evidential layers can be treated as fuzzy sets. DFWofE can be used to predict not only point events but also area or line events. In this model a fuzzy training layer can be defined based on point, line, and areas using fuzzy membership function; and (2) degree-of-exploration model for WofE is implemented through building a degree of exploration map. This method can be used to assess possible spatial correlations between the degree of exploration and potential evidential layers. Importantly, it would also make it possible to estimate undiscovered resources, if the degree of exploration map is combined with other models that predict where such resources are most likely to occur. These methods and relevant systems were validated using a case study of mineral potential prediction in Gejiu (个旧) mineral district, Yunnan (云南), China.
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.
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.
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.
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.
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.
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.
Einmahl, John; Gan, Zhuojiong
2016-01-01
Omnibus tests for central symmetry of a bivariate probability distribution are proposed. The test statistics compare empirical measures of opposite regions. Under rather weak conditions, we establish the asymptotic distribution of the test statistics under the null hypothesis; it follows that they a
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.
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.
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.
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.
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...
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
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 × .
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.
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...
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.
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
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.
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
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.
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...
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.
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.
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.
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.
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.
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.
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.
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.
Edgington, Eugene
2007-01-01
Statistical Tests That Do Not Require Random Sampling Randomization Tests Numerical Examples Randomization Tests and Nonrandom Samples The Prevalence of Nonrandom Samples in Experiments The Irrelevance of Random Samples for the Typical Experiment Generalizing from Nonrandom Samples Intelligibility Respect for the Validity of Randomization Tests Versatility Practicality Precursors of Randomization Tests Other Applications of Permutation Tests Questions and Exercises Notes References Randomized Experiments Unique Benefits of Experiments Experimentation without Mani
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.
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.
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....
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.
[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.
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.
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
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.
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.
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.
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
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
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
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.
Liu, Weibo; Jin, Yan; Price, Mark
2016-10-01
A new heuristic based on the Nawaz-Enscore-Ham algorithm is proposed in this article for solving a permutation flow-shop scheduling problem. A new priority rule is proposed by accounting for the average, mean absolute deviation, skewness and kurtosis, in order to fully describe the distribution style of processing times. A new tie-breaking rule is also introduced for achieving effective job insertion with the objective of minimizing both makespan and machine idle time. Statistical tests illustrate better solution quality of the proposed algorithm compared to existing benchmark heuristics.
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
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).
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.
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.
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.
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 ...
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.
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.
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.
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
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.
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.
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.
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.
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.)
Directory of Open Access Journals (Sweden)
Dirk Dolle
Full Text Available Enhancers have been described to evolve by permutation without changing function. This has posed the problem of how to predict enhancer elements that are hidden from alignment-based approaches due to the loss of co-linearity. Alignment-free algorithms have been proposed as one possible solution. However, this approach is hampered by several problems inherent to its underlying working principle. Here we present a new approach, which combines the power of alignment and alignment-free techniques into one algorithm. It allows the prediction of enhancers based on the query and target sequence only, no matter whether the regulatory logic is co-linear or reshuffled. To test our novel approach, we employ it for the prediction of enhancers across the evolutionary distance of ~450Myr between human and medaka. We demonstrate its efficacy by subsequent in vivo validation resulting in 82% (9/11 of the predicted medaka regions showing reporter activity. These include five candidates with partially co-linear and four with reshuffled motif patterns. Orthology in flanking genes and conservation of the detected co-linear motifs indicates that those candidates are likely functionally equivalent enhancers. In sum, our results demonstrate that the proposed principle successfully predicts mutated as well as permuted enhancer regions at an encouragingly high rate.
Allen, Chenoa D; McNeely, Clea A
2017-10-01
In the United States, there is concern that recent state laws restricting undocumented immigrants' rights could threaten access to Medicaid and the Children's Health Insurance Program (CHIP) for citizen children of immigrant parents. Of particular concern are omnibus immigration laws, state laws that include multiple provisions increasing immigration enforcement and restricting rights for undocumented immigrants. These laws could limit Medicaid/CHIP access for citizen children in immigrant families by creating misinformation about their eligibility and fostering fear and mistrust of government among immigrant parents. This study uses nationally-representative data from the National Health Interview Survey (2005-2014; n = 70,187) and comparative interrupted time series methods to assess whether passage of state omnibus immigration laws reduced access to Medicaid/CHIP for US citizen Latino children. We found that law passage did not reduce enrollment for children with noncitizen parents and actually resulted in temporary increases in coverage among Latino children with at least one citizen parent. These findings are surprising in light of prior research. We offer potential explanations for this finding and conclude with a call for future research to be expanded in three ways: 1) examine whether policy effects vary for children of undocumented parents, compared to children whose noncitizen parents are legally present; 2) examine the joint effects of immigration-related policies at different levels, from the city or county to the state to the federal; and 3) draw on the large social movements and political mobilization literature that describes when and how Latinos and immigrants push back against restrictive immigration laws. Copyright © 2017 Elsevier Ltd. All rights reserved.
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
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.
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
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.
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.
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.
Tipton, Elizabeth; Pustejovsky, James E.
2015-01-01
Randomized experiments are commonly used to evaluate the effectiveness of educational interventions. The goal of the present investigation is to develop small-sample corrections for multiple contrast hypothesis tests (i.e., F-tests) such as the omnibus test of meta-regression fit or a test for equality of three or more levels of a categorical…
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...
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.
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.
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.
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.
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.
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
Control substances and alcohol use and testing
Energy Technology Data Exchange (ETDEWEB)
Przybylski, J.L.
1994-07-01
The Omnibus Transportation Employee Testing Act was signed into law in October of 1991. The Omnibus Transportation Employee Testing Act of 1991 required the United States Department of Transportation (DOT) to enact regulations requiring the testing of employees that perform ``safety sensitive functions`` for illegal controlled substance use and alcohol misuse. The Transportation Management Division, Office of Environmental Restoration and Waste Management (TMD/EM-261), United States Department of Energy (DOE), Training Program Manager is committed to promoting the availability of the necessary information to those affected members of the Department of Energy (DOE) community in an effort to attain the highest possible level of regulatory compliance and to enhance the safety of each individual in the workplace.
基于排列熵的径流突变识别%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.
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.
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.
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.
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.
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.
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.
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.
Schatz, Robin; Belloto, Robert J; White, Donald B; Bachmann, Kenneth
2003-01-01
Drug-related illness in the United States factors substantially in health care costs, although often these illnesses and their attendant costs are preventable. One strategy for minimizing adverse drug reactions is to provide drug information to consumers in the form of prescription counseling at pharmacies. The Omnibus Budget Reconciliation Act of 1990 (OBRA 1990) contained provisions for mandating such counseling to Medicaid patients. OBRA 1990 was implemented in 1993, but most states acted quickly to extend counseling services to all patients receiving prescription drugs. We looked at the extent and quality of prescription counseling available in community pharmacies 1 decade after OBRA 1990 was written. We evaluated the counseling services afforded at large chain pharmacies, independent community pharmacies, and on-line pharmacies for a hydrochlorothiazide prescription. We found that most (69%) pharmacies offered to provide prescription counseling service, and that average counseling index scores, a measure of the quality or extent of information provided as determined by a Rasch analysis, were generally satisfactory. Our observations based on a single prescription for hydrochlorothiazide, along with other studies, suggest that there is a positive upward trend in the number of pharmacies providing prescription drug information, and that the extent of information provided suggests that the objectives of OBRA 1990 and related legislation to reduce ADRs are being fundamentally satisfied.
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...
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
基于噪声检测的置换混叠图像盲分离%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算法进行训练得到其稀疏表示的字典,利用学习得到的字典对置换混叠图像去噪,然后利用去噪后的置换混叠图像与原图像作差运算得到差图像,通过检测差图像来确定出置换区域的位置和大小.并利用图像形态学运算优化置换区域,采用阈值化操作分离出置换图像.实验结果表明,本文算法能够较好的从置换混叠图像中
Directory of Open Access Journals (Sweden)
Zongguo Yang
2015-01-01
Full Text Available Objective. This study aimed to evaluate the relationships between long noncoding RNAs (lncRNAs in tumor tissues and hepatocellular carcinoma (HCC aggressiveness and survival. Methods. We correlated the lncRNAs in tumor tissues with HCC survival and clinicopathological features based on Gene Expression Omnibus expression profile GSE36376. Results. Eight lncRNAs and 240 HCC patients were included. Cox regression analysis indicated that HULC was a positive factor for HCC overall survival (HR = 0.885, 95% CI = 0.797–0.983, and P=0.023 and disease-free survival time (HR = 0.913, 95% CI = 0.835–0.998, and P=0.045. H19 and UCA1 were both demonstrated to be risk factors of HCC disease-free survival in multivariate Cox model (HR = 1.071, 95% CI = 1.01–1.137, and P=0.022 and HR = 2.4, 95% CI = 1.092–5.273, and P=0.029, resp.. But Kaplan-Meier method showed no significant association between UCA1 and HCC disease-free survival (log rank P=0.616. Logistic regression demonstrated that H19 was overexpressed in HBV-infected patients (OR = 1.14, 95% CI = 1.008–1.29, and P=0.037. HULC had a significant association with vascular invasion (OR = 0.648, 95% CI = 0.523–0.803, and P<0.001. H19 and MEG3 were both considered to be risk factors for high AFP level (OR = 1.45, 95% CI = 1.277–1.646, and P<0.001 and OR = 1.613, 95% CI = 1.1–2.365, and P=0.014, resp.. Conclusions. Contributing to decreased susceptibility to vascular invasion, upregulation of HULC in tumor tissues was positively associated with HCC survival. In contrast, H19 overexpression might be risk factor for HCC aggressiveness and poor outcomes.
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.
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.
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.
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.
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...
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.
Function analysis of ZFP580 in rats based on gene expression omnibus%基于基因表达数据库的鼠ZFP580基因功能分析
Institute of Scientific and Technical Information of China (English)
王维; 林雷; 郭敏; 梁彦军; 孟祥艳; 张文成
2011-01-01
@@ 基因表达数据库(gene expression omnibus,GEO)是美国国立生物技术信息中心(NationalCenter for biotechnology information,NCBI)在2000年7月首次公布的基因表达相关数据的公共贮存平台.2005年,NCBI等四家科研机构联合统计表明:GEO拥有代表100多种生物体的近10亿个单独的基因表达数据信息,每周有1000多个不同的用户访问GEO,整体GEO网站的访问次数每周已超过15000次.
Qu, Jinxiu; Zhang, Zhousuo; Wen, Jinpeng; Guo, Ting; Luo, Xue; Sun, Chuang; Li, Bing
2014-08-01
The viscoelastic sandwich structure is widely used in mechanical equipment, yet the structure always suffers from damage during long-term service. Therefore, state recognition of the viscoelastic sandwich structure is very necessary for monitoring structural health states and keeping the equipment running with high reliability. Through the analysis of vibration response signals, this paper presents a novel method for this task based on the adaptive redundant second generation wavelet packet transform (ARSGWPT), permutation entropy (PE) and the wavelet support vector machine (WSVM). In order to tackle the non-linearity existing in the structure vibration response, the PE is introduced to reveal the state changes of the structure. In the case of complex non-stationary vibration response signals, in order to obtain more effective information regarding the structural health states, the ARSGWPT, which can adaptively match the characteristics of a given signal, is proposed to process the vibration response signals, and then multiple PE features are extracted from the resultant wavelet packet coefficients. The WSVM, which can benefit from the conventional SVM as well as wavelet theory, is applied to classify the various structural states automatically. In this study, to achieve accurate and automated state recognition, the ARSGWPT, PE and WSVM are combined for signal processing, feature extraction and state classification, respectively. To demonstrate the effectiveness of the proposed method, a typical viscoelastic sandwich structure is designed, and the different degrees of preload on the structure are used to characterize the various looseness states. The test results show that the proposed method can reliably recognize the different looseness states of the viscoelastic sandwich structure, and the WSVM can achieve a better classification performance than the conventional SVM. Moreover, the superiority of the proposed ARSGWPT in processing the complex vibration response
DEFF Research Database (Denmark)
Tan, Qihua; Sørensen, Mette; Kruse, Torben A;
2013-01-01
interaction in the regulation and expression of the FOXO gene family could contribute to the human longevity phenotype. Genotype data was collected from 1088 individuals from the Danish 1905 birth cohort aged over 92/93 years with 12 SNPs in the FOXO1a and 15 SNPs in the FOXO3a genes. Our analysis detected....... This article is protected by copyright. All rights reserved....
Directory of Open Access Journals (Sweden)
A. Baskar
2016-04-01
Full Text Available Permutation flow shop scheduling problems have been an interesting area of research for over six decades. Out of the several parameters, minimization of makespan has been studied much over the years. The problems are widely regarded as NP-Complete if the number of machines is more than three. As the computation time grows exponentially with respect to the problem size, heuristics and meta-heuristics have been proposed by many authors that give reasonably accurate and acceptable results. The NEH algorithm proposed in 1983 is still considered as one of the best simple, constructive heuristics for the minimization of makespan. This paper analyses the powerful job insertion technique used by NEH algorithm and proposes seven new variants, the complexity level remains same. 120 numbers of problem instances proposed by Taillard have been used for the purpose of validating the algorithms. Out of the seven, three produce better results than the original NEH algorithm.
DEFF Research Database (Denmark)
Bendixen, Carsten
2014-01-01
Bidrag med en kortfattet, introducerende, perspektiverende og begrebsafklarende fremstilling af begrebet test i det pædagogiske univers.......Bidrag med en kortfattet, introducerende, perspektiverende og begrebsafklarende fremstilling af begrebet test i det pædagogiske univers....
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.
Analysis and Forecast of Financial Volatility Based on Permutation Entropy%基于排列熵的金融波动分析与预测
Institute of Scientific and Technical Information of China (English)
王雨蒙; 徐梅
2013-01-01
The realized volatility which can effectively exploit the information in intraday return data was applied to measure high-frequency intraday financial volatility,then permutation entropy methods were firstly introduced to analyze the ordinal structure of realized volatility series and general synchronization between two series.The total probability theorem was used to forecast the next day volatility level after knowing the order patterns of history realized volatility.The ability and effectiveness of the methods proposed were tested by Shanghai Composite Index and Shenzhen Component Index high frequency data whose sample period is 5 minutes before market close.The dominating order patterns were determined and it was found that these two indexs' realized volatility series have quite low generalized synchronization.Moreover,the next day volatility level was forecasted based on principal order patterns.The forecasting results indicate that the conditional order patterns of the main order patterns are still dominant.%利用可以有效提取日内信息的“已实现”波动来度量高频金融时间序列的波动,使用排列熵方法分析“已实现”波动序列的顺序模式与序列之间的广义同步,利用全概率理论,在已知历史“已实现”波动顺序模式的情况下,预测下一个交易日的“已实现”波动处于不同水平的概率.使用上证综指与深圳成指的5分时收盘价进行实证研究,验证方法的可行性与有效性,发现这两个指数的“已实现”波动序列之间基本不存在广义同步,确定了它们的主要顺序模式,并基于主要顺序模式对“已实现”波动水平进行预测,结果显示主要顺序模式的条件顺序模式仍然占主要地位.
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
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.
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
Logarithmic space and permutations
DEFF Research Database (Denmark)
Aubert, Clément; Seiller, Thomas
2013-01-01
In a recent work, Girard proposed a new and innovative approach to computational complexity based on the proofs-as-programs correspondence. In a previous paper, the authors showed how Girard's proposal succeeds in obtaining a new characterization of co-NL languages as a set of operators acting on...... on a Hilbert Space. In this paper, we extend this work by showing that it is also possible to define a set of operators characterizing the class L of logarithmic space languages....
Boxed Permutation Pattern Matching
DEFF Research Database (Denmark)
Amit, Mika; Bille, Philip; Cording, Patrick Hagge
2016-01-01
the goal is to only find the boxed subsequences of T that are order-isomorphic to P. This problem was introduced by Bruner and Lackner who showed that it can be solved in O(n3) time. Cho et al. [CPM 2015] gave an O(n2m) time algorithm and improved it to O(n2 logm). In this paper we present a solution...
Itoh, Hiroaki; Inoue, Masayuki
2013-07-16
Polytheonamide B (1), isolated from the marine sponge Theonella swinhoei, is a posttranslationally modified ribosomal peptide (MW 5030 Da) that displays extraordinary cytotoxicity. Among its 48 amino acid residues, this peptide includes a variety D- and L-amino acids that do not occur in proteins, and the chiralities of these amino acids alternate in sequence. These structural features induce the formation of a stable β6.3-helix, giving rise to a tubular structure of over 4 nm in length. In the biological setting, this fold is believed to transport cations across the lipid bilayer through a pore, thereby acting as an ion channel. In this Account, we discuss the construction and structural permutations of this potent cytotoxin. First we describe the 161-step chemical construction of this unusual peptide 1. By developing a synthetic route to 1, we established the chemical basis for subsequent SAR studies to pinpoint the proteinogenic and nonproteinogenic building blocks within the molecule that confer its toxicity and channel function. Using fully synthetic 1, we generated seven analogues with point mutations, and studies of their activity revealed the importance of the N-terminal moiety. Next, we simplified the structure of 1 by substituting six amino acid residues of 1 to design a more synthetically accessible analogue 9. This dansylated polytheonamide mimic 9 was synthesized in 127 total steps, and we evaluated its function to show that it can emulate the toxic and ion channel activities of 1 despite its multiple structural modifications. Finally, we applied a highly automated synthetic route to 48-mer 9 to generate 13 substructures of 27-39-mers. The 37-mer 12 exhibited nanomolar level toxicity through a potentially distinct mode of action from 1 and 9. The SAR studies of polytheonamide B and the 21 artificial analogues have deepened our understanding of the precise structural requirements for the biological functions of 1. They have also led to the discovery of
Energy Technology Data Exchange (ETDEWEB)
Cottrell, W.B.; Passiakos, M.
1982-06-01
This index to Nuclear Safety covers articles published in Nuclear Safety, Volume 18, Number 1 (January-February 1977) through Volume 22, Number 6 (November-December 1981). The index is divided into three section: a chronological list of articles (including abstracts), a permuted-title (KWIC) index, and an author index. Nuclear Safety, a bimonthly technical progress review prepared by the Nuclear Safety Information Center, covers all safety aspects of nuclear power reactors and associated facilities. Over 300 technical articles published in Nuclear Safety in the last 5 years are listed in this index.
Energy Technology Data Exchange (ETDEWEB)
Cottrell, W.B.; Klein, A.
1978-04-11
This index to Nuclear Safety covers articles published in Nuclear Safety, Vol. 11, No. 1 (January-February 1970), through Vol. 18, No. 6 (November-December 1977). It is divided into three sections: a chronological list of articles (including abstracts) followed by a permuted-title (KWIC) index and an author index. Nuclear Safety, a bimonthly technical progress review prepared by the Nuclear Safety Information Center (NSIC), covers all safety aspects of nuclear power reactors and associated facilities. Over 450 technical articles published in Nuclear Safety in the last eight years are listed in this index.
Energy Technology Data Exchange (ETDEWEB)
Cottrell, W B; Passiakos, M
1980-06-01
This index to Nuclear Safety, a bimonthly technical progress review, covers articles published in Nuclear Safety, Volume II, No. 1 (January-February 1970), through Volume 20, No. 6 (November-December 1979). It is divided into three sections: a chronological list of articles (including abstracts) followed by a permuted-title (KWIC) index and an author index. Nuclear Safety, a bimonthly technical progress review prepared by the Nuclear Safety Information Center (NSIC), covers all safety aspects of nuclear power reactors and associated facilities. Over 600 technical articles published in Nuclear Safety in the last ten years are listed in this index.
Institute of Scientific and Technical Information of China (English)
柳寅; 马良; 黄钰
2013-01-01
针对传统人工蜂群算法早熟收敛问题,基于模糊化处理和蜂群寻优的特点,提出一种模糊人工蜂群算法.将模糊输入输出机制引入到算法中来保持蜜源访问概率的动态更新.根据算法计算过程中的不同阶段对蜜源访问概率有效调整,避免算法陷入局部极值.通过对置换流水车间调度问题的仿真实验和与其他算法的比较,表明本算法可行有效,有良好的鲁棒性.%Aiming at the premature convergence problem in traditional artificial bees colony algorithm,fuzzy artificial bees colony algorithm is proposed,which is based on the principles of fuzzy processing and bees colony behavior.Fuzzy inputs and fuzzy outputs are introduced into the algorithm to maintain dynamic updates of the nectar access probability.According to effective adjustment on nectar access probability during the different stages of algorithm calculation,the algorithm avoids local optima.Simulated tests of permutation flow shop scheduling problem and comparisons with other algorithms show the algorithm is feasible and effective and the algorithm has strong global optimization ability.
WPA Omnibus Award MT Wind Power Outreach
Energy Technology Data Exchange (ETDEWEB)
Brian Spangler, Manager Energy Planning and Renewables
2012-01-30
The objective of this grant was to further the development of Montana's vast wind resources for small, medium, and large scale benefits to Montana and the nation. This was accomplished through collaborative work with wind industry representatives, state and local governments, the agricultural community, and interested citizens. Through these efforts MT Dept Environmental Quality (DEQ) was able to identify development barriers, educate and inform citizens, as well as to participate in regional and national dialogue that will spur the development of wind resources. The scope of DEQ's wind outreach effort evolved over the course of this agreement from the development of the Montana Wind Working Group and traditional outreach efforts, to the current focus on working with the state's university system to deliver a workforce trained to enter the wind industry.
Energy Technology Data Exchange (ETDEWEB)
Keienburg, Bettina [Kuemmerlein Rechtsanwaelte und Notare, Essen (Germany)
2012-12-15
The omnibus law on site finding and selection for a repository for radioactive waste generating heat, and with amendments to other laws, of June 13, 2012 is to reshuffle fundamentally the competences of public authorities for final storage. The federal government is to assume more responsibilities from former federal state competences. Moreover, most of the existing competences of the Federal Office for Radiation Protection are to be transferred to a federal agency yet to be founded, which is called Federal Office for Nuclear Safety in the present draft legislation. The Federal Office for Radiation Protection will only retain its responsibility as project agent for repositories, and that only in the phases of site exploration and licensing. Afterwards, the duty of final storage in the draft legislation is transferred to a 3rd party. Again in the version of the draft legislation, and unlike present regulations, this 3rd party may only be a company whose sole owner is the federal government, which also is to strengthen the influence of the federal government under aspects of company law. Legislative efforts seeking to strengthen the federal government and its competences by assigning licensing duties for repositories to federal agencies are understandable under feasibility aspects and may even be in the emotional interest of the states and their competent representatives in public authorities who, merely because their work is connected with the disputed topic of final storage, often face attacks and accusations by the public. Nevertheless, the transfer to federal agencies of administrative duties is subject to constitutional limits which must be observed. These constitutional aspects are highlighted in the publication. It is left to the reader to assess the meaningfulness of establishing another independent high-level federal agency in the area of responsibility of the Federal Ministry of the Environment (BMU), i.e. a Federal Office for Nuclear Safety, alongside the
Gan, Xiao-Ning; Luo, Jie; Tang, Rui-Xue; Wang, Han-Lin; Zhou, Hong; Qin, Hui; Gan, Ting-Qing; Chen, Gang
2017-05-01
The role and mechanism of miR-452-5p in lung adenocarcinoma remain unclear. In this study, we performed a systematic study to investigate the clinical value of miR-452-5p expression in lung adenocarcinoma. The expression of miR-452-5p in 101 lung adenocarcinoma patients was detected by quantitative real-time polymerase chain reaction. The Cancer Genome Atlas and Gene Expression Omnibus databases were joined to verify the expression level of miR-452-5p in lung adenocarcinoma. Via several online prediction databases and bioinformatics software, pathway and network analyses of miR-452-5p target genes were performed to explore its prospective molecular mechanism. The expression of miR-452-5p in lung adenocarcinoma in house was significantly lower than that in adjacent tissues (p < 0.001). Additionally, the expression level of miR-452-5p was negatively correlated with several clinicopathological parameters including the tumor size (p = 0.014), lymph node metastasis (p = 0.032), and tumor-node-metastasis stage (p = 0.036). Data from The Cancer Genome Atlas also confirmed the low expression of miR-452 in lung adenocarcinoma (p < 0.001). Furthermore, reduced expression of miR-452-5p in lung adenocarcinoma (standard mean deviations = -0.393, 95% confidence interval: -0.774 to -0.011, p = 0.044) was validated by a meta-analysis. Five hub genes targeted by miR-452-5p, including SMAD family member 4, SMAD family member 2, cyclin-dependent kinase inhibitor 1B, tyrosine 3-monooxygenase/tryptophan 5-monooxygenase activation protein epsilon, and tyrosine 3-monooxygenase/tryptophan 5-monooxygenase activation protein beta, were significantly enriched in the cell-cycle pathway. In conclusion, low expression of miR-452-5p tends to play an essential role in lung adenocarcinoma. Bioinformatics analysis might be beneficial to reveal the potential mechanism of miR-452-5p in lung adenocarcinoma.
Coughlan, Michael R
2016-05-01
Forest managers are increasingly recognizing the value of disturbance-based land management techniques such as prescribed burning. Unauthorized, "arson" fires are common in the southeastern United States where a legacy of agrarian cultural heritage persists amidst an increasingly forest-dominated landscape. This paper reexamines unauthorized fire-setting in the state of Georgia, USA from a historical ecology perspective that aims to contribute to historically informed, disturbance-based land management. A space-time permutation analysis is employed to discriminate systematic, management-oriented unauthorized fires from more arbitrary or socially deviant fire-setting behaviors. This paper argues that statistically significant space-time clusters of unauthorized fire occurrence represent informal management regimes linked to the legacy of traditional land management practices. Recent scholarship has pointed out that traditional management has actively promoted sustainable resource use and, in some cases, enhanced biodiversity often through the use of fire. Despite broad-scale displacement of traditional management during the 20th century, informal management practices may locally circumvent more formal and regionally dominant management regimes. Space-time permutation analysis identified 29 statistically significant fire regimes for the state of Georgia. The identified regimes are classified by region and land cover type and their implications for historically informed disturbance-based resource management are discussed.
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.
Coughlan, Michael R.
2016-05-01
Forest managers are increasingly recognizing the value of disturbance-based land management techniques such as prescribed burning. Unauthorized, "arson" fires are common in the southeastern United States where a legacy of agrarian cultural heritage persists amidst an increasingly forest-dominated landscape. This paper reexamines unauthorized fire-setting in the state of Georgia, USA from a historical ecology perspective that aims to contribute to historically informed, disturbance-based land management. A space-time permutation analysis is employed to discriminate systematic, management-oriented unauthorized fires from more arbitrary or socially deviant fire-setting behaviors. This paper argues that statistically significant space-time clusters of unauthorized fire occurrence represent informal management regimes linked to the legacy of traditional land management practices. Recent scholarship has pointed out that traditional management has actively promoted sustainable resource use and, in some cases, enhanced biodiversity often through the use of fire. Despite broad-scale displacement of traditional management during the 20th century, informal management practices may locally circumvent more formal and regionally dominant management regimes. Space-time permutation analysis identified 29 statistically significant fire regimes for the state of Georgia. The identified regimes are classified by region and land cover type and their implications for historically informed disturbance-based resource management are discussed.
A practical guide to testing wireless smartphone applications
Harty, Julian
2009-01-01
Testing applications for mobile phones is difficult, time-consuming, and hard to do effectively. Many people have limited their testing efforts to hands-on testing of an application on a few physical handsets, and they have to repeat the process every time a new version of the software is ready to test. They may miss many of the permutations of real-world use, and as a consequence their users are left with the unpleasant mess of a failing application on their phone.Test automation can help to increase the range and scope of testing, while reducing the overhead of manual testing of each version
Directory of Open Access Journals (Sweden)
Guanlong Deng
2016-01-01
Full Text Available This paper presents an enhanced discrete artificial bee colony algorithm for minimizing the total flow time in the flow shop scheduling problem with buffer capacity. First, the solution in the algorithm is represented as discrete job permutation to directly convert to active schedule. Then, we present a simple and effective scheme called best insertion for the employed bee and onlooker bee and introduce a combined local search exploring both insertion and swap neighborhood. To validate the performance of the presented algorithm, a computational campaign is carried out on the Taillard benchmark instances, and computations and comparisons show that the proposed algorithm is not only capable of solving the benchmark set better than the existing discrete differential evolution algorithm and iterated greedy algorithm, but also capable of performing better than two recently proposed discrete artificial bee colony algorithms.
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.
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.
On Greatest Common Divisor of Subsequent Terms of Permutations%排列中相邻两项的最大公因子
Institute of Scientific and Technical Information of China (English)
姬成双
2011-01-01
1983年,Erd(o)s P,Freud R和Hegyvári N证明了对所有正整数的任一排列α1,a2,a3,…,有liminfi((ai,ai+1)/i≤61/90本文将结果改进为liminfi(asi,ai+1)/i≤13/20.%In 1983, Erd(o)s P, Freud R and Hegyvári N proved that liminfi (ai,a(i+1) )/i ≤61/90 for any infinite permutation a1 ,a2 ,a3 ,… of all positive integers.In this paper, a better upper bound liminfi( ai ,a(i+1) )/i≤13/20 was given.
Testing Multimodal Integration Hypotheses with Application to Schizophrenia Data
DEFF Research Database (Denmark)
Axelsen, Martin Christian; Bak, Nikolaj; Hansen, Lars Kai
2015-01-01
Multimodal data sets are getting more and more common. Integrating these data sets, the information from each modality can be combined to improve performance in classification problems. Fusion/integration of modalities can be done at several levels. The most appropriate fusion level is related...... of the present paper is to propose a method for assessing these inter-modality dependencies. The approach is based on two permutations of an analyzed data set, each exploring different dependencies between and within modalities. The method was tested on the Kaggle MLSP 2014 Schizophrenia Classification Challenge...... data set which is composed of features from functional magnetic resonance imaging (MRI) and structural MRI. The results support the use of a permutation strategy for testing conditional dependencies between modalities in a multimodal classification problem....
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
Pankau, Brian L.
2009-01-01
This empirical study evaluates the document category prediction effectiveness of Naive Bayes (NB) and K-Nearest Neighbor (KNN) classifier treatments built from different feature selection and machine learning settings and trained and tested against textual corpora of 2300 Gang-Of-Four (GOF) design pattern documents. Analysis of the experiment's…
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...
Goodness-of-fit tests for vector autoregressive models in time series
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
The paper proposes and studies some diagnostic tools for checking the goodness-of-fit of general parametric vector autoregressive models in time series. The resulted tests are asymptotically chi-squared under the null hypothesis and can detect the alternatives converging to the null at a parametric rate. The tests involve weight functions,which provides us with the flexibility to choose scores for enhancing power performance,especially under directional alternatives. When the alternatives are not directional,we construct asymptotically distribution-free maximin tests for a large class of alternatives. A possibility to construct score-based omnibus tests is discussed when the alternative is saturated. The power performance is also investigated. In addition,when the sample size is small,a nonparametric Monte Carlo test approach for dependent data is proposed to improve the performance of the tests. The algorithm is easy to implement. Simulation studies and real applications are carried out for illustration.
Wei, Xiu; Zhang, Wenqiang; Weng, Wei; Fujimura, Shigeru
This paper proposed a multi-objective local search procedure (MOLS). It is combined with NSGA-II for solving bi-criteria PFSP with the objectives of minimizing makespan and maximum tardiness. Utilizing the properties of active blocks for flow shop scheduling problem, neighborhood structures MOINS (multi-objective insertion) and MOEXC (multi-objective exchange) are designed in order to improve efficiency of perturbation. Any perturbation based on MOINS and MOEXC takes effect on different criteria simultaneously. The original idea of MOLS is systematic change neighborhoods in the local search procedure. The search direction of MOLS on an individual is naturally guided by interaction of MOINS and MOEXC. Moreover, there is no need to set parameters in MOLS. The MOLS combined with popular multi-objective evolutionary algorithm NSGA-II (Non-dominated Sorting Genetic Algorithm-II) is called as “NSGA-II-MOLS”. To illustrate the efficacy of proposed approach, four different scaled problems are used to test performance of NSGA-II-MOLS. The numerous comparisons show efficacy of NSGA-II-MOLS is better than most of algorithms even with the same number of individual evaluations and parameters setting.
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…
Is It Real, or Is It Randomized?: A Financial Turing Test
Jasmina Hasanhodzic; Lo, Andrew W.; Emanuele Viola
2010-01-01
We construct a financial "Turing test" to determine whether human subjects can differentiate between actual vs. randomized financial returns. The experiment consists of an online video-game (http://arora.ccs.neu.edu) where players are challenged to distinguish actual financial market returns from random temporal permutations of those returns. We find overwhelming statistical evidence (p-values no greater than 0.5%) that subjects can consistently distinguish between the two types of time serie...
Rudd, James; Moore, Jason H; Urbanowicz, Ryan J
2013-11-01
Permutation-based statistics for evaluating the significance of class prediction, predictive attributes, and patterns of association have only appeared within the learning classifier system (LCS) literature since 2012. While still not widely utilized by the LCS research community, formal evaluations of test statistic confidence are imperative to large and complex real world applications such as genetic epidemiology where it is standard practice to quantify the likelihood that a seemingly meaningful statistic could have been obtained purely by chance. LCS algorithms are relatively computationally expensive on their own. The compounding requirements for generating permutation-based statistics may be a limiting factor for some researchers interested in applying LCS algorithms to real world problems. Technology has made LCS parallelization strategies more accessible and thus more popular in recent years. In the present study we examine the benefits of externally parallelizing a series of independent LCS runs such that permutation testing with cross validation becomes more feasible to complete on a single multi-core workstation. We test our python implementation of this strategy in the context of a simulated complex genetic epidemiological data mining problem. Our evaluations indicate that as long as the number of concurrent processes does not exceed the number of CPU cores, the speedup achieved is approximately linear.
Bells, Motels and Permutation Groups
McGuire, Gary
2012-01-01
This article is about the mathematics of ringing the changes. We describe the mathematics which arises from a real-world activity, that of ringing the changes on bells. We present Rankin's solution of one of the famous old problems in the subject. This article was written in 2003.
Woods, David L.; Wyma, John M.; Herron, Timothy J.; Yund, E. William
2017-01-01
Verbal learning tests (VLTs) are widely used to evaluate memory deficits in neuropsychiatric and developmental disorders. However, their validity has been called into question by studies showing significant differences in VLT scores obtained by different examiners. Here we describe the computerized Bay Area Verbal Learning Test (BAVLT), which minimizes inter-examiner differences by incorporating digital list presentation and automated scoring. In the 10-min BAVLT, a 12-word list is presented on three acquisition trials, followed by a distractor list, immediate recall of the first list, and, after a 30-min delay, delayed recall and recognition. In Experiment 1, we analyzed the performance of 195 participants ranging in age from 18 to 82 years. Acquisition trials showed strong primacy and recency effects, with scores improving over repetitions, particularly for mid-list words. Inter-word intervals (IWIs) increased with successive words recalled. Omnibus scores (summed over all trials except recognition) were influenced by age, education, and sex (women outperformed men). In Experiment 2, we examined BAVLT test-retest reliability in 29 participants tested with different word lists at weekly intervals. High intraclass correlation coefficients were seen for omnibus and acquisition scores, IWIs, and a categorization index reflecting semantic reorganization. Experiment 3 examined the performance of Experiment 2 participants when feigning symptoms of traumatic brain injury. Although 37% of simulated malingerers showed abnormal (p < 0.05) omnibus z-scores, z-score cutoffs were ineffective in discriminating abnormal malingerers from control participants with abnormal scores. In contrast, four malingering indices (recognition scores, primacy/recency effects, learning rate across acquisition trials, and IWIs) discriminated the two groups with 80% sensitivity and 80% specificity. Experiment 4 examined the performance of a small group of patients with mild or severe TBI. Overall
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边缘检测算子的自适应彩色条纹分割算法.在此基础之上,对彩色条纹进行解码,主要包括:①基于白色条纹逐级解码算法;②遗漏彩色条纹解码算法.实验结果表明,该方法既具有较大的编码周期,又容易提取条纹,保证了条纹解码的准确度,达到了较好的结果.
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.
Directory of Open Access Journals (Sweden)
Malka Gorfine
Full Text Available Copy number variation (CNV plays a role in pathogenesis of many human diseases, especially cancer. Several whole genome CNV association studies have been performed for the purpose of identifying cancer associated CNVs. Here we undertook a novel approach to whole genome CNV analysis, with the goal being identification of associations between CNV of different genes (CNV-CNV across 60 human cancer cell lines. We hypothesize that these associations point to the roles of the associated genes in cancer, and can be indicators of their position in gene networks of cancer-driving processes. Recent studies show that gene associations are often non-linear and non-monotone. In order to obtain a more complete picture of all CNV associations, we performed omnibus univariate analysis by utilizing dCov, MIC, and HHG association tests, which are capable of detecting any type of association, including non-monotone relationships. For comparison we used Spearman and Pearson association tests, which detect only linear or monotone relationships. Application of dCov, MIC and HHG tests resulted in identification of twice as many associations compared to those found by Spearman and Pearson alone. Interestingly, most of the new associations were detected by the HHG test. Next, we utilized dCov's and HHG's ability to perform multivariate analysis. We tested for association between genes of unknown function and known cancer-related pathways. Our results indicate that multivariate analysis is much more effective than univariate analysis for the purpose of ascribing biological roles to genes of unknown function. We conclude that a combination of multivariate and univariate omnibus association tests can reveal significant information about gene networks of disease-driving processes. These methods can be applied to any large gene or pathway dataset, allowing more comprehensive analysis of biological processes.
Institute of Scientific and Technical Information of China (English)
尹波; 周学广
2015-01-01
直接序列扩频通信需要大线性复杂度的序列用作扩频调制码，混沌序列可以胜任。为实现一类扩频通信编码方案，提出基于“天书”模型的混沌序列发生器，对其进行了置换编码，随后分析了置换编码的保密强度，最后给出了该编码的应用途径和理由。%Chaotic sequence could be competent for the need of very large linear complexity sequence ,which modulated for spread spectrum for Direct Sequence Spread Spectrum (DSSS) .Firstly a skytale‐based chaotic sequence generator was proposed ,and spread spectrum communication was encoded with permutation ,then the security level of permutation coding was analyzed .At last ,the application and account was provided for the new chaotic coding design .
Evaluation of Multi-parameter Test Statistics for Multiple Imputation.
Liu, Yu; Enders, Craig K
2017-01-01
In Ordinary Least Square regression, researchers often are interested in knowing whether a set of parameters is different from zero. With complete data, this could be achieved using the gain in prediction test, hierarchical multiple regression, or an omnibus F test. However, in substantive research scenarios, missing data often exist. In the context of multiple imputation, one of the current state-of-art missing data strategies, there are several different analogous multi-parameter tests of the joint significance of a set of parameters, and these multi-parameter test statistics can be referenced to various distributions to make statistical inferences. However, little is known about the performance of these tests, and virtually no research study has compared the Type 1 error rates and statistical power of these tests in scenarios that are typical of behavioral science data (e.g., small to moderate samples, etc.). This paper uses Monte Carlo simulation techniques to examine the performance of these multi-parameter test statistics for multiple imputation under a variety of realistic conditions. We provide a number of practical recommendations for substantive researchers based on the simulation results, and illustrate the calculation of these test statistics with an empirical example.
Salom, Igor; Dmitrašinović, V.
2017-07-01
We construct the three-body permutation symmetric hyperspherical harmonics to be used in the non-relativistic three-body Schrödinger equation in three spatial dimensions (3D). We label the state vectors according to the S3 ⊗ SO(3)rot ⊂ O (2) ⊗ SO(3)rot ⊂ U (3) ⋊S2 ⊂ O (6) subgroup chain, where S3 is the three-body permutation group and S2 is its two element subgroup containing transposition of first two particles, O (2) is the ;democracy transformation;, or ;kinematic rotation; group for three particles; SO(3)rot is the 3D rotation group, and U (3) , O (6) are the usual Lie groups. We discuss the good quantum numbers implied by the above chain of algebras, as well as their relation to the S3 permutation properties of the harmonics, particularly in view of the SO(3)rot ⊂ SU (3) degeneracy. We provide a definite, practically implementable algorithm for the calculation of harmonics with arbitrary finite integer values of the hyper angular momentum K, and show an explicit example of this construction in a specific case with degeneracy, as well as tables of K ≤ 6 harmonics. All harmonics are expressed as homogeneous polynomials in the Jacobi vectors (λ , ρ) with coefficients given as algebraic numbers unless the ;operator method; is chosen for the lifting of the SO(3)rot ⊂ SU (3) multiplicity and the dimension of the degenerate subspace is greater than four - in which case one must resort to numerical diagonalization; the latter condition is not met by any K ≤ 15 harmonic, or by any L ≤ 7 harmonic with arbitrary K. We also calculate a certain type of matrix elements (the Gaunt integrals of products of three harmonics) in two ways: 1) by explicit evaluation of integrals and 2) by reduction to known SU (3) Clebsch-Gordan coefficients. In this way we complete the calculation of the ingredients sufficient for the solution to the quantum-mechanical three-body bound state problem.
Institute of Scientific and Technical Information of China (English)
江兆林; 徐宗本; 高淑萍
2006-01-01
In this paper, the permutation factor circulant matrix over any field is introduced. Algorithms for computing the minimal polynomial and common minimal polynomial of this kind of matrices over any field are presented by means of the Gr(o)bner basis of the ideal in the polynomial ring, and two algorithms for finding the inverses of such matrices are also presented. Finally, an algorithm for the inverse of partitioned matrix with permutation factor circulant blocks over any field is given by using the Schur complement, which can be implemented by CoCoA 4.0, an algebraic system, over the field of rational numbers or the field of residue classes of modulo prime number.%本文引入了任意域上置换因子循环矩阵,利用多项式环的理想的Gr(o)bner基的算法给出了任意域上置换因子循环矩阵的极小多项式和公共极小多项式的算法,同时给出了这类矩阵逆矩阵的两种算法.最后,利用Schur补给出了任意域上具有置换因子循环矩阵块的分块矩阵逆的一个算法,在有理数域或模素数剩余类域上,这一算法可由代数系统软件CoCoA 4.0实现.
基于集合竞价置换的双向动态频谱分配算法%Double Dynamic Spectrum Allocation Algorithm Based on Set Bid Permutation
Institute of Scientific and Technical Information of China (English)
刘觉夫; 胡静; 杨将; 朱丙虎
2015-01-01
Aiming at the problems of dynamic spectrum allocation in cognitive radio networks, by establishing bi-lateral market model, a double dynamic spectrum allocation algorithm based on set bid permutation is proposed. Taking the individual rationality of the participants into account, this algorithm abstracts the game between two parties of the auction as the game between cognitive users. In the process of the auction, each cognitive user bids independently, and the auctioneer then divides the cognitive users set and distributes the spectrum according to cognitive users set bids, the real payments and the winners of two parties. Simulation illustrates great improvement of transaction rate, revenue and preferable β-competitiveness.%针对认知无线网络中的动态频谱分配问题,引入双边市场模型,提出了基于集合竞价置换的双向动态频谱分配算法(SBPA,set bid permutation algorithm).该算法考虑认知用户的个体理性,将拍卖参与双方之间的博弈抽象为认知用户之间的博弈.在频谱拍卖过程中,每个认知用户独立竞价,代理商划分认知用户集合并根据认知用户的集合竞价、拍卖双方的真实出价以及拍卖双方的赢家对频谱进行分配.仿真结果表明,该算法能够显著地提高拍卖成交率和拍卖收益,并具有较优的β-竞争性.
A statistical test for drainage network recognition using MeanStreamDrop analysis
Directory of Open Access Journals (Sweden)
Corrado Cencetti
2015-07-01
Full Text Available This paper provides a new statistical test to evaluate the threshold of validity for the Mean Stream Drop analysis. In the case of a constant area threshold, the method aims to provide a unique threshold value to extract the drainage network through a statistical test more efficient than those widely used. The proposal starts from the assumption that a minimum threshold value exists suitable for drainage network extraction. Then, the method proceeds with Horton–Strahler ordering of the network and statistically analysing the network geometry. This procedure is repeated for all the threshold values in the set under investigation, using a statistical permutation test, called APTDTM (Adjusted Permutation Test based on the Difference between Trimmed Means. Statistical significance is evaluated by p-values adjusted to account for multiple comparisons. As a final result of the statistical analysis, the right threshold value for the specific basin is identified. Classical procedures are based on a set of two sample t-tests. However, this method relies on the assumptions of normality and homogeneity of variance, which are unlikely to hold in practice. The APTDTM test presented here provides accurate p-values even when the sampling distribution is not close to normal, or there is heteroskedasticity in the data.
Testing Universality in Critical Exponents: the Case of Rainfall
Deluca, Anna; Corral, Alvaro
2015-01-01
One of the key clues to consider rainfall as a self-organized critical phenomenon is the existence of power-law distributions for rain-event sizes. We have studied the problem of universality in the exponents of these distributions by means of a suitable statistic whose distribution is inferred by several variations of a permutational test. In contrast to more common approaches, our procedure does not suffer from the difficulties of multiple testing and does not require the precise knowledge of the uncertainties associated to the power-law exponents. When applied to seven sites monitored by the Atmospheric Radiation Measurement Program the test lead to the rejection of the universality hypothesis, despite the fact that the exponents are rather close to each other.
DiagTest3Grp: An R Package for Analyzing Diagnostic Tests with Three Ordinal Groups
Directory of Open Access Journals (Sweden)
Jingqin Luo
2012-10-01
Full Text Available Medical researchers endeavor to identify potentially useful biomarkers to develop marker-based screening assays for disease diagnosis and prevention. Useful summary measures which properly evaluate the discriminative ability of diagnostic markers are critical for this purpose. Literature and existing software, for example, R packages nicely cover summary measures for diagnostic markers used for the binary case (e.g., healthy vs. diseased. An intermediate population at an early disease stage usually exists between the healthy and the fully diseased population in many disease processes. Supporting utilities for three-group diagnostic tests are highly desired and important for identifying patients at the early disease stage for timely treatments. However, application packages which provide summary measures for three ordinal groups are currently lacking. This paper focuses on two summary measures of diagnostic accuracy—volume under the receiver operating characteristic surface and the extended Youden index, with three diagnostic groups. We provide the R package DiagTest3Grp to estimate, under both parametric and nonparametric assumptions, the two summary measures and the associated variances, as well as the optimal cut-points for disease diagnosis. An omnibus test for multiple markers and a Wald test for two markers, on independent or paired samples, are incorporated to compare diagnostic accuracy across biomarkers. Sample size calculation under the normality assumption can be performed in the R package to design future diagnostic studies. A real world application evaluating the diagnostic accuracy of neuropsychological markers for Alzheimer’s disease is used to guide readers through step-by-step implementation of DiagTest3Grp to demonstrate its utility.
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
Ohashi, Nobukimi; Kobayashi, Kaori; Fujitake, Masaharu
2016-06-01
Recently we reanalyzed the microwave absorption spectra of the trans-ethyl methyl ether molecule, state by state, in the ground vibrational, O-methyl torsional, C-methyl torsional and skeletal torsional states with the use of an IAM-like tunneling matrix formalism based on an extended permutation-inversion (PI) group idea, whose results appeared in Journal of Molecular Spectroscopy recently. Since a single rho-axis does not exist in trans-ethyl methyl ether that has two methyl-tops and the IAM formalism is not available as in the case of the one methyl-top molecule, we adopted instead an IAM-like (in other word, partial IAM) formalism. We will show the outline of the present formalism and the results of the spectral analyses briefly. We also would like to review the IAM formalism for the one top molecules based on the extended PI group, and show the result of the application to the spectral analysis. If possible, we would like to compare the IAM and IAM-like formalisms based on the extended PI group with the ERHAM formalism developed by Groner, especially, in the form of Hamiltonian matrix elements, and discuss about similarity and difference.
Directory of Open Access Journals (Sweden)
Xu Ke
2007-06-01
Full Text Available Abstract Background Tests for association between a haplotype and disease are commonly performed using a likelihood ratio test for heterogeneity between case and control haplotype frequencies. Using data from a study of association between heroin dependence and the DRD2 gene, we obtained estimated haplotype frequencies and the associated likelihood ratio statistic using two different computer programs, MLOCUS and GENECOUNTING. We also carried out permutation testing to assess the empirical significance of the results obtained. Results Both programs yielded similar, though not identical, estimates for the haplotype frequencies. MLOCUS produced a p value of 1.8*10-15 and GENECOUNTING produced a p value of 5.4*10-4. Permutation testing produced a p value 2.8*10-4. Conclusion The fact that very large differences occur between the likelihood ratio statistics from the two programs may reflect the fact that the haplotype frequencies for the combined group are not constrained to be equal to the weighted averages of the frequencies for the cases and controls, as they would be if they were directly observed rather than being estimated. Minor differences in haplotype frequency estimates can result in very large differences in the likelihood ratio statistic and associated p value.
Developing an Intelligent Generator for Semi-Actual Test Data
Directory of Open Access Journals (Sweden)
S. A. Hameed, A. M. A. Al-Abbasi
2012-08-01
Full Text Available The actual test data generation is one of the difficult and expensive parts of applying software-testing techniques. Many of the current test data generators suffer from the reduction of user’s confidence in generated test data and testing process. This is because of focusing on developer and database administrator viewpoints regardless of users concerns and focusing on data type and structure regardless of meaning. This paper proposes a model of an intelligent generator for semi-actual test data with the aim of increasing users confidence in software testing. The model uses samples of real data as a resource data and a set of efficient generation techniques based on statistical methods such as permutations, combination, sampling, and statistical distributions. The selection of the suitable structure and generation technique is based on one of the intelligent soft computing techniques such as fuzzy logic, neural network, heuristic, or genetic algorithm. The generated test data is validated according to the data specifications then tested by one of the normality testing techniques to be close to the real world or environment of the testing processes. This model offers the ability of simulating real environments.Key Words: Software Testing, Test Data Generation, Semi-Actual Data, Intelligent Generator, Simulation.
High resolution T association tests of complex diseases based on family data.
Fan, Ruzong; Knapp, Michael; Wjst, Matthias; Zhao, Caixia; Xiong, Momiao
2005-03-01
This paper proposes family based Hotelling's T(2) tests for high resolution linkage disequilibrium (LD) mapping or association studies of complex diseases. Assume that genotype data of multiple markers or haplotype blocks are available for a sample of nuclear families, in which some offspring are affected. Paired Hotelling's T(2) test statistics are proposed for a high resolution association study using parents as controls for affected offspring, based on two coding methods: haplotype/allele coding and genotype coding. The paired Hotelling's T(2) tests take not only the correlation between the haplotype blocks or markers into account, but also take the correlation within each parent-offspring pair into account. The method extends two sample Hotelling's T(2) test statistics for population case control association studies, which are not valid for family data due to correlation of genetic data among family members. The validity of the proposed method is justified by rigorous mathematical and statistical proof under the large sample theory. The non-centrality parameter approximations of the test statistics are calculated for power and sample size calculations. From power comparison and type I error calculations, it is shown that the test statistic based on haplotype/allele coding is advantageous over the test statistic of genotype coding. Analysis using multiple markers may provide higher power than single marker analysis. If only one marker is utilized the power of the test statistic based on haplotype/allele coding is nearly identical to that of 1-TDT. Moreover, a permutation procedure is provided for data analysis. The method is applied to data from a German asthma family study. The results based on the paired Hotelling's T(2) statistic tests confirm the previous findings. However, the paired Hotelling's T(2) tests produce much smaller P-values than those of the previous study. The permutation tests produce similar results to those of the previous study; moreover
The signed permutation group on Feynman graphs
Purkart, Julian
2016-08-01
The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalization group are small, we can expand the integral and only consider the lowest orders in the scaling. The aim of this article is to determine specific combinations of graphs in a scalar quantum field theory that lead to a remarkable simplification of the first non-trivial term in the perturbation series. It will be seen that the result is independent of the renormalization scheme and the scattering angles. To achieve that goal we will utilize the parametric representation of scalar Feynman integrals as well as the Hopf algebraic structure of the Feynman graphs under consideration. Moreover, we will present a formula which reduces the effort of determining the first-order term in the perturbation series for the specific combination of graphs to a minimum.
Enabling personal genomics with an explicit test of epistasis.
Greene, Casey S; Himmelstein, Daniel S; Nelson, Heather H; Kelsey, Karl T; Williams, Scott M; Andrew, Angeline S; Karagas, Margaret R; Moore, Jason H
2010-01-01
One goal of personal genomics is to use information about genomic variation to predict who is at risk for various common diseases. Technological advances in genotyping have spawned several personal genetic testing services that market genotyping services directly to the consumer. An important goal of consumer genetic testing is to provide health information along with the genotyping results. This has the potential to integrate detailed personal genetic and genomic information into healthcare decision making. Despite the potential importance of these advances, there are some important limitations. One concern is that much of the literature that is used to formulate personal genetics reports is based on genetic association studies that consider each genetic variant independently of the others. It is our working hypothesis that the true value of personal genomics will only be realized when the complexity of the genotype-to-phenotype mapping relationship is embraced, rather than ignored. We focus here on complexity in genetic architecture due to epistasis or nonlinear gene-gene interaction. We have previously developed a multifactor dimensionality reduction (MDR) algorithm and software package for detecting nonlinear interactions in genetic association studies. In most prior MDR analyses, the permutation testing strategy used to assess statistical significance was unable to differentiate MDR models that captured only interaction effects from those that also detected independent main effects. Statistical interpretation of MDR models required post-hoc analysis using entropy-based measures of interaction information. We introduce here a novel permutation test that allows the effects of nonlinear interactions between multiple genetic variants to be specifically tested in a manner that is not confounded by linear additive effects. We show using simulated nonlinear interactions that the power using the explicit test of epistasis is no different than a standard permutation
Institute of Scientific and Technical Information of China (English)
王积社
2011-01-01
This article studies the group graph of Sn and An in detail, and revises some incorrect conclusions in The Basic Theory of Group Graph and the Construction of Permutation Group Graph". Parts of group graph of S4 and A4 are made by computer.%详细研究了Sn与An的群图,修正了《群图的基本理论及置换群图的构造》一文中某些错误的结论,并用计算机作出了S4与A4的部分群图.
Integrative set enrichment testing for multiple omics platforms
Directory of Open Access Journals (Sweden)
Poisson Laila M
2011-11-01
Full Text Available Abstract Background Enrichment testing assesses the overall evidence of differential expression behavior of the elements within a defined set. When we have measured many molecular aspects, e.g. gene expression, metabolites, proteins, it is desirable to assess their differential tendencies jointly across platforms using an integrated set enrichment test. In this work we explore the properties of several methods for performing a combined enrichment test using gene expression and metabolomics as the motivating platforms. Results Using two simulation models we explored the properties of several enrichment methods including two novel methods: the logistic regression 2-degree of freedom Wald test and the 2-dimensional permutation p-value for the sum-of-squared statistics test. In relation to their univariate counterparts we find that the joint tests can improve our ability to detect results that are marginal univariately. We also find that joint tests improve the ranking of associated pathways compared to their univariate counterparts. However, there is a risk of Type I error inflation with some methods and self-contained methods lose specificity when the sets are not representative of underlying association. Conclusions In this work we show that consideration of data from multiple platforms, in conjunction with summarization via a priori pathway information, leads to increased power in detection of genomic associations with phenotypes.
Efficient p-value evaluation for resampling-based tests
Yu, K.
2011-01-05
The resampling-based test, which often relies on permutation or bootstrap procedures, has been widely used for statistical hypothesis testing when the asymptotic distribution of the test statistic is unavailable or unreliable. It requires repeated calculations of the test statistic on a large number of simulated data sets for its significance level assessment, and thus it could become very computationally intensive. Here, we propose an efficient p-value evaluation procedure by adapting the stochastic approximation Markov chain Monte Carlo algorithm. The new procedure can be used easily for estimating the p-value for any resampling-based test. We show through numeric simulations that the proposed procedure can be 100-500 000 times as efficient (in term of computing time) as the standard resampling-based procedure when evaluating a test statistic with a small p-value (e.g. less than 10( - 6)). With its computational burden reduced by this proposed procedure, the versatile resampling-based test would become computationally feasible for a much wider range of applications. We demonstrate the application of the new method by applying it to a large-scale genetic association study of prostate cancer.
Comparing entropy with tests for randomness as a measure of complexity in time series
Gan, Chee Chun
2015-01-01
Entropy measures have become increasingly popular as an evaluation metric for complexity in the analysis of time series data, especially in physiology and medicine. Entropy measures the rate of information gain, or degree of regularity in a time series e.g. heartbeat. Ideally, entropy should be able to quantify the complexity of any underlying structure in the series, as well as determine if the variation arises from a random process. Unfortunately current entropy measures mostly are unable to perform the latter differentiation. Thus, a high entropy score indicates a random or chaotic series, whereas a low score indicates a high degree of regularity. This leads to the observation that current entropy measures are equivalent to evaluating how random a series is, or conversely the degree of regularity in a time series. This raises the possibility that existing tests for randomness, such as the runs test or permutation test, may have similar utility in diagnosing certain conditions. This paper compares various t...
Hypothesis testing and power calculations for taxonomic-based human microbiome data.
Directory of Open Access Journals (Sweden)
Patricio S La Rosa
Full Text Available This paper presents new biostatistical methods for the analysis of microbiome data based on a fully parametric approach using all the data. The Dirichlet-multinomial distribution allows the analyst to calculate power and sample sizes for experimental design, perform tests of hypotheses (e.g., compare microbiomes across groups, and to estimate parameters describing microbiome properties. The use of a fully parametric model for these data has the benefit over alternative non-parametric approaches such as bootstrapping and permutation testing, in that this model is able to retain more information contained in the data. This paper details the statistical approaches for several tests of hypothesis and power/sample size calculations, and applies them for illustration to taxonomic abundance distribution and rank abundance distribution data using HMP Jumpstart data on 24 subjects for saliva, subgingival, and supragingival samples. Software for running these analyses is available.
Gene set analysis using variance component tests
2013-01-01
Background Gene set analyses have become increasingly important in genomic research, as many complex diseases are contributed jointly by alterations of numerous genes. Genes often coordinate together as a functional repertoire, e.g., a biological pathway/network and are highly correlated. However, most of the existing gene set analysis methods do not fully account for the correlation among the genes. Here we propose to tackle this important feature of a gene set to improve statistical power in gene set analyses. Results We propose to model the effects of an independent variable, e.g., exposure/biological status (yes/no), on multiple gene expression values in a gene set using a multivariate linear regression model, where the correlation among the genes is explicitly modeled using a working covariance matrix. We develop TEGS (Test for the Effect of a Gene Set), a variance component test for the gene set effects by assuming a common distribution for regression coefficients in multivariate linear regression models, and calculate the p-values using permutation and a scaled chi-square approximation. We show using simulations that type I error is protected under different choices of working covariance matrices and power is improved as the working covariance approaches the true covariance. The global test is a special case of TEGS when correlation among genes in a gene set is ignored. Using both simulation data and a published diabetes dataset, we show that our test outperforms the commonly used approaches, the global test and gene set enrichment analysis (GSEA). Conclusion We develop a gene set analyses method (TEGS) under the multivariate regression framework, which directly models the interdependence of the expression values in a gene set using a working covariance. TEGS outperforms two widely used methods, GSEA and global test in both simulation and a diabetes microarray data. PMID:23806107
Testing for Hardy–Weinberg equilibrium at biallelic genetic markers on the X chromosome
Graffelman, J; Weir, B S
2016-01-01
Testing genetic markers for Hardy–Weinberg equilibrium (HWE) is an important tool for detecting genotyping errors in large-scale genotyping studies. For markers at the X chromosome, typically the χ2 or exact test is applied to the females only, and the hemizygous males are considered to be uninformative. In this paper we show that the males are relevant, because a difference in allele frequency between males and females may indicate HWE not to hold. The testing of markers on the X chromosome has received little attention, and in this paper we lay down the foundation for testing biallelic X-chromosomal markers for HWE. We develop four frequentist statistical test procedures for X-linked markers that take both males and females into account: the χ2 test, likelihood ratio test, exact test and permutation test. Exact tests that include males are shown to have a better Type I error rate. Empirical data from the GENEVA project on venous thromboembolism is used to illustrate the proposed tests. Results obtained with the new tests differ substantially from tests that are based on female genotype counts only. The new tests detect differences in allele frequencies and seem able to uncover additional genotyping error that would have gone unnoticed in HWE tests based on females only. PMID:27071844
Automation of Flight Software Regression Testing
Tashakkor, Scott B.
2016-01-01
NASA is developing the Space Launch System (SLS) to be a heavy lift launch vehicle supporting human and scientific exploration beyond earth orbit. SLS will have a common core stage, an upper stage, and different permutations of boosters and fairings to perform various crewed or cargo missions. Marshall Space Flight Center (MSFC) is writing the Flight Software (FSW) that will operate the SLS launch vehicle. The FSW is developed in an incremental manner based on "Agile" software techniques. As the FSW is incrementally developed, testing the functionality of the code needs to be performed continually to ensure that the integrity of the software is maintained. Manually testing the functionality on an ever-growing set of requirements and features is not an efficient solution and therefore needs to be done automatically to ensure testing is comprehensive. To support test automation, a framework for a regression test harness has been developed and used on SLS FSW. The test harness provides a modular design approach that can compile or read in the required information specified by the developer of the test. The modularity provides independence between groups of tests and the ability to add and remove tests without disturbing others. This provides the SLS FSW team a time saving feature that is essential to meeting SLS Program technical and programmatic requirements. During development of SLS FSW, this technique has proved to be a useful tool to ensure all requirements have been tested, and that desired functionality is maintained, as changes occur. It also provides a mechanism for developers to check functionality of the code that they have developed. With this system, automation of regression testing is accomplished through a scheduling tool and/or commit hooks. Key advantages of this test harness capability includes execution support for multiple independent test cases, the ability for developers to specify precisely what they are testing and how, the ability to add
Institute of Scientific and Technical Information of China (English)
朱焱华; 邴峰; 琴明贤; 鄢雷
2015-01-01
本文介绍了利比里亚地区埃博拉疫情和第16和第17批赴利比里亚维和部队轮换期间埃博拉疫情防控的主要措施,提出了坚持联动及时的疫情应对、明确层次分明的防控责任、理顺军地协同的工作关系、严格轮换期间的生活管理、加强全程伴随的心理保障等方面的体会思考.%Ebola epidemic situation in Liberia region and main prevention and control measures for the ebolavirus in the 16 th and 17 th detachments of Chinese peacekeeping forces to Liberia during cyclic permutation period were intro-duced in this paper. Experiences have been summarized in this study, such as keeping combined action timely for epi-demic outbreak, clarifying the responsibilities of prevention and control, coordinating the working relationship between the military and the local government, strictly managing the life regulation during cyclic permutation period and enhancing the psychological security during the whole mission.
Power System Fault Signal Analysis Based on Permutation Entropy Algorithm%基于排列熵算法的电力系统故障信号分析
Institute of Scientific and Technical Information of China (English)
李从善; 刘天琪; 李兴源; 曹喜民; 刘利兵
2015-01-01
Rapid and accurate diagnosis of fault has a crucial role for speeding up the recovery process and ensuring the safe operation of the power system. This paper analyzes the data sources currently used in power system fault diagnosis, proposes the use of wide-area information for rapid diagnosis of power systems. First, wavelet transform is used to process the wide area measurement data, through correlation coefficient method to eliminate the noise and reconstruct the signal, then permutation entropy calculation use the of the reconstructed signal. Since the complexity of the arrangement of entropy reflects a one-dimensional time series, the signal changes with high sensitivity, therefore, it can be applied to power system fault diagnosis. Compared with the traditional wavelet analysis method, this method avoids the problem of selecting wavelet base and meets the conditions for online fault diagnosis. In addition, it is simple and easy to program. The approach is applied in IEEE10 machine 39-bus system fault diagnosis. The diagnostic results show the applicability and effectiveness of the method.%电网故障的快速准确诊断对加快事故处理和系统恢复进程、保证电力系统的安全运行具有至关重要的作用。分析了目前应用于电力系统故障诊断的数据来源，提出采用广域量测的电气量信息进行电力系统的快速诊断方法。首先将广域量测系统采集的数据进行小波变换，通过相关系数法滤噪处理，以此来重构信号，采用排列熵算法对重构的信号进行排列熵分析。由于排列熵反映了一维时间序列的复杂度，对信号变化具有较高的敏感性，可以应用于电力系统故障信号分析方面。相比传统的小波分析方法，该方法不存在选取小波基问题，且算法简单，编程易实现，能够满足在线故障诊断条件。通过对IEEE10机39节点标准测试系统的故障仿真分析，结果表明了该方法的有效性和实用性。
Testing? Testing? In Literature?
Purves, Alan C.
The assumptions behind secondary school literature course tests--whether asking students to recall aspects of literary works, to relate literary works to each other, or to analyze unfamiliar literary works--are open to question. They fail to acknowledge some of the most important aspects of literature which, if properly taught, should provide a…
Institute of Scientific and Technical Information of China (English)
2007-01-01
China’s national college entrance examination, regarded as a make-or-break test by many students, leaves much to be desired “We’ve bribed the exam supervisors, paying each one 20,000 yuan. They will make everything go smooth during the exams,” Li Feng, a teacher from No.2 High School in
Energy Technology Data Exchange (ETDEWEB)
Dwyer, Stephen F.
2013-05-01
This test plan is a document that provides a systematic approach to the planned testing of rooftop structures to determine their actual load carrying capacity. This document identifies typical tests to be performed, the responsible parties for testing, the general feature of the tests, the testing approach, test deliverables, testing schedule, monitoring requirements, and environmental and safety compliance.
... calories and how fast your heart beats. Thyroid tests check how well your thyroid is working. They ... thyroid diseases such as hyperthyroidism and hypothyroidism. Thyroid tests include blood tests and imaging tests. Blood tests ...
Oxyuriasis test; Enterobiasis test; Tape test ... diagnose this infection is to do a tape test. The best time to do this is in ... lay their eggs at night. Steps for the test are: Firmly press the sticky side of a ...
Directory of Open Access Journals (Sweden)
Igor Salom
2017-07-01
Full Text Available We construct the three-body permutation symmetric hyperspherical harmonics to be used in the non-relativistic three-body Schrödinger equation in three spatial dimensions (3D. We label the state vectors according to the S3⊗SO(3rot⊂O(2⊗SO(3rot⊂U(3⋊S2⊂O(6 subgroup chain, where S3 is the three-body permutation group and S2 is its two element subgroup containing transposition of first two particles, O(2 is the “democracy transformation”, or “kinematic rotation” group for three particles; SO(3rot is the 3D rotation group, and U(3,O(6 are the usual Lie groups. We discuss the good quantum numbers implied by the above chain of algebras, as well as their relation to the S3 permutation properties of the harmonics, particularly in view of the SO(3rot⊂SU(3 degeneracy. We provide a definite, practically implementable algorithm for the calculation of harmonics with arbitrary finite integer values of the hyper angular momentum K, and show an explicit example of this construction in a specific case with degeneracy, as well as tables of K≤6 harmonics. All harmonics are expressed as homogeneous polynomials in the Jacobi vectors (λ,ρ with coefficients given as algebraic numbers unless the “operator method” is chosen for the lifting of the SO(3rot⊂SU(3 multiplicity and the dimension of the degenerate subspace is greater than four – in which case one must resort to numerical diagonalization; the latter condition is not met by any K≤15 harmonic, or by any L≤7 harmonic with arbitrary K. We also calculate a certain type of matrix elements (the Gaunt integrals of products of three harmonics in two ways: 1 by explicit evaluation of integrals and 2 by reduction to known SU(3 Clebsch–Gordan coefficients. In this way we complete the calculation of the ingredients sufficient for the solution to the quantum-mechanical three-body bound state problem.
... I Help Someone Who's Being Bullied? Volunteering Test Anxiety KidsHealth > For Teens > Test Anxiety Print A A ... with their concentration or performance. What Is Test Anxiety? Test anxiety is actually a type of performance ...
... Us Home A-Z Health Topics Pregnancy tests Pregnancy tests > A-Z Health Topics Pregnancy test fact ... To receive Publications email updates Enter email Submit Pregnancy tests If you think you may be pregnant , ...
Direct antiglobulin test; Indirect antiglobulin test; Anemia - hemolytic ... No special preparation is necessary for this test. ... There are 2 types of the Coombs test: Direct Indirect The direct ... that are stuck to the surface of red blood cells. Many diseases ...
Acid hemolysin test; Paroxysmal nocturnal hemoglobinuria - Ham test; PNH - Ham test ... BJ. In: Chernecky CC, Berger BJ, eds. Laboratory Tests and Diagnostic Procedures . 6th ed. Philadelphia, PA: Elsevier ...
Bishara, Anthony J; Hittner, James B
2012-09-01
It is well known that when data are nonnormally distributed, a test of the significance of Pearson's r may inflate Type I error rates and reduce power. Statistics textbooks and the simulation literature provide several alternatives to Pearson's correlation. However, the relative performance of these alternatives has been unclear. Two simulation studies were conducted to compare 12 methods, including Pearson, Spearman's rank-order, transformation, and resampling approaches. With most sample sizes (n ≥ 20), Type I and Type II error rates were minimized by transforming the data to a normal shape prior to assessing the Pearson correlation. Among transformation approaches, a general purpose rank-based inverse normal transformation (i.e., transformation to rankit scores) was most beneficial. However, when samples were both small (n ≤ 10) and extremely nonnormal, the permutation test often outperformed other alternatives, including various bootstrap tests.
A goodness-of-fit test for occupancy models with correlated within-season revisits
Wright, Wilson; Irvine, Kathryn M.; Rodhouse, Thomas J.
2016-01-01
Occupancy modeling is important for exploring species distribution patterns and for conservation monitoring. Within this framework, explicit attention is given to species detection probabilities estimated from replicate surveys to sample units. A central assumption is that replicate surveys are independent Bernoulli trials, but this assumption becomes untenable when ecologists serially deploy remote cameras and acoustic recording devices over days and weeks to survey rare and elusive animals. Proposed solutions involve modifying the detection-level component of the model (e.g., first-order Markov covariate). Evaluating whether a model sufficiently accounts for correlation is imperative, but clear guidance for practitioners is lacking. Currently, an omnibus goodnessof- fit test using a chi-square discrepancy measure on unique detection histories is available for occupancy models (MacKenzie and Bailey, Journal of Agricultural, Biological, and Environmental Statistics, 9, 2004, 300; hereafter, MacKenzie– Bailey test). We propose a join count summary measure adapted from spatial statistics to directly assess correlation after fitting a model. We motivate our work with a dataset of multinight bat call recordings from a pilot study for the North American Bat Monitoring Program. We found in simulations that our join count test was more reliable than the MacKenzie–Bailey test for detecting inadequacy of a model that assumed independence, particularly when serial correlation was low to moderate. A model that included a Markov-structured detection-level covariate produced unbiased occupancy estimates except in the presence of strong serial correlation and a revisit design consisting only of temporal replicates. When applied to two common bat species, our approach illustrates that sophisticated models do not guarantee adequate fit to real data, underscoring the importance of model assessment. Our join count test provides a widely applicable goodness-of-fit test and
Multiple Group Testing Procedures for Analysis of High-Dimensional Genomic Data
Ko, Hyoseok; Kim, Kipoong
2016-01-01
In genetic association studies with high-dimensional genomic data, multiple group testing procedures are often required in order to identify disease/trait-related genes or genetic regions, where multiple genetic sites or variants are located within the same gene or genetic region. However, statistical testing procedures based on an individual test suffer from multiple testing issues such as the control of family-wise error rate and dependent tests. Moreover, detecting only a few of genes associated with a phenotype outcome among tens of thousands of genes is of main interest in genetic association studies. In this reason regularization procedures, where a phenotype outcome regresses on all genomic markers and then regression coefficients are estimated based on a penalized likelihood, have been considered as a good alternative approach to analysis of high-dimensional genomic data. But, selection performance of regularization procedures has been rarely compared with that of statistical group testing procedures. In this article, we performed extensive simulation studies where commonly used group testing procedures such as principal component analysis, Hotelling's T2 test, and permutation test are compared with group lasso (least absolute selection and shrinkage operator) in terms of true positive selection. Also, we applied all methods considered in simulation studies to identify genes associated with ovarian cancer from over 20,000 genetic sites generated from Illumina Infinium HumanMethylation27K Beadchip. We found a big discrepancy of selected genes between multiple group testing procedures and group lasso.
Hedrick, Wanda B., Ed.
2007-01-01
There's accountability and then there's the testing craze an iatrogenic practice that undermines real learning. Hedrick documents the negative effects of testing, giving teachers another weapon in their arsenal against mindless preparation for high-stakes tests.
... what you want to learn. Search form Search Pharmacogenomic testing You are here Home Testing & Services Testing ... people avoid harmful reactions to medication. What Is Pharmacogenomics? Did you ever wonder why a medicine doesn' ...
... your family Plan for the future Insurance and financial planning Transition for children Emergency preparedness Testing & Services Testing ... Support Genetic Disease Information Find a Support Group Financial Planning Who Should I Tell? Genetic Testing & Counseling Compensation ...
Laboratory tests check a sample of your blood, urine, or body tissues. A technician or your doctor ... compare your results to results from previous tests. Laboratory tests are often part of a routine checkup ...
A Modified Generalized Fisher Method for Combining Probabilities from Dependent Tests
Directory of Open Access Journals (Sweden)
Hongying (Daisy eDai
2014-02-01
Full Text Available Rapid developments in molecular technology have yielded a large amount of high throughput genetic data to understand the mechanism for complex traits. The increase of genetic variants requires hundreds and thousands of statistical tests to be performed simultaneously in analysis, which poses a challenge to control the overall Type I error rate. Combining p-values from multiple hypothesis testing has shown promise for aggregating effects in high-dimensional genetic data analysis. Several p-value combining methods have been developed and applied to genetic data; see [Dai, et al. 2012b] for a comprehensive review. However, there is a lack of investigations conducted for dependent genetic data, especially for weighted p-value combining methods. Single nucleotide polymorphisms (SNPs are often correlated due to linkage disequilibrium. Other genetic data, including variants from next generation sequencing, gene expression levels measured by microarray, protein and DNA methylation data, etc. also contain complex correlation structures. Ignoring correlation structures among genetic variants may lead to severe inflation of Type I error rates for omnibus testing of p-values. In this work, we propose modifications to the Lancaster procedure by taking the correlation structure among p-values into account. The weight function in the Lancaster procedure allows meaningful biological information to be incorporated into the statistical analysis, which can increase the power of the statistical testing and/or remove the bias in the process. Extensive empirical assessments demonstrate that the modified Lancaster procedure largely reduces the Type I error rates due to correlation among p-values, and retains considerable power to detect signals among p-values. We applied our method to reassess published renal transplant data, and identified a novel association between B cell pathways and allograft tolerance.
Sonneveld, C.; Voogt, W.
2009-01-01
Tissue tests are widely used in horticulture practice and have in comparison with soil or substrate testing advantages as well disadvantages in comparison with soil testing. One of the main advantages of tissue tests is the certainty that analysed nutrients in plant tissues are really present in the
Sonneveld, C.; Voogt, W.
2009-01-01
Tissue tests are widely used in horticulture practice and have in comparison with soil or substrate testing advantages as well disadvantages in comparison with soil testing. One of the main advantages of tissue tests is the certainty that analysed nutrients in plant tissues are really present in the
Testing for phylogenetic signal in biological traits: the ubiquity of cross-product statistics.
Pavoine, Sandrine; Ricotta, Carlo
2013-03-01
To evaluate rates of evolution, to establish tests of correlation between two traits, or to investigate to what degree the phylogeny of a species assemblage is predictive of a trait value so-called tests for phylogenetic signal are used. Being based on different approaches, these tests are generally thought to possess quite different statistical performances. In this article, we show that the Blomberg et al. K and K*, the Abouheif index, the Moran's I, and the Mantel correlation are all based on a cross-product statistic, and are thus all related to each other when they are associated to a permutation test of phylogenetic signal. What changes is only the way phylogenetic and trait similarities (or dissimilarities) among the tips of a phylogeny are computed. The definitions of the phylogenetic and trait-based (dis)similarities among tips thus determines the performance of the tests. We shortly discuss the biological and statistical consequences (in terms of power and type I error of the tests) of the observed relatedness among the statistics that allow tests for phylogenetic signal. Blomberg et al. K* statistic appears as one on the most efficient approaches to test for phylogenetic signal. When branch lengths are not available or not accurate, Abouheif's Cmean statistic is a powerful alternative to K*.
2004-01-01
A complete guide to the uniaxial tensile test, the cornerstone test for determining the mechanical properties of materials: Learn ways to predict material behavior through tensile testing. Learn how to test metals, alloys, composites, ceramics, and plastics to determine strength, ductility and elastic/plastic deformation. A must for laboratory managers, technicians, materials and design engineers, and students involved with uniaxial tensile testing. Tensile Testing , Second Edition begins with an introduction and overview of the test, with clear explanations of how materials properties are determined from test results. Subsequent sections illustrate how knowledge gained through tensile tests, such as tension properties to predict the behavior (including strength, ductility, elastic or plastic deformation, tensile and yield strengths) have resulted in improvements in materals applications. The Second Edition is completely revised and updated. It includes expanded coverage throughout the volume on a variety of ...
Objective Tests versus Subjective tests
Institute of Scientific and Technical Information of China (English)
魏福林
2007-01-01
objective test has only one correct answer, while subjective test has a range of possible answers. Because of this feature, reliability will not be difficult to achieve in the marking of the objective item, while the marking of the subjective items is reliable. On the whole, a good test must contain both subjective and objective test items.
... Epstein-Barr Virus Antibodies , Chickenpox and Shingles Tests , Parvovirus B19 All content on Lab Tests Online has ... enterovirus, Epstein-Barr virus , varicella-zoster virus , and parvovirus B19 . ^ Back to top When is it ordered? ...
... AACC products and services. Advertising & Sponsorship: Policy | Opportunities Malnutrition Share this page: Was this page helpful? Overview | Symptoms | Tests | Treatment | Related Pages Tests Malnutrition will often be noticeable to the doctor's trained ...
Duodenal parasites test; Giardia - string test ... may be a sign parasite infection such as giardia . ... Elsevier; 2017:chap 58. Hill DR, Nash TE. Giardia lamblia. In: Bennett JE, Dolin R, Blaser MJ, ...
DEFF Research Database (Denmark)
2009-01-01
Professor Sven Erik Nordenbo og centerleder Niels Egelund, begge DPU, i samtale om nationale test.......Professor Sven Erik Nordenbo og centerleder Niels Egelund, begge DPU, i samtale om nationale test....
... may recommend you have an invasive test, like amniocentesis , to confirm the results. Chorionic villus sampling (also ... done at 15 to 22 weeks of pregnancy. Amniocentesis (also called amnio). Tests the amniotic fluid from ...
... page helpful? Also known as: VMAU Formal name: Vanillylmandelic Acid, urine Related tests: Catecholamines , Plasma Free Metanephrines , Urine ... I should know? How is it used? The vanillylmandelic acid (VMA) test is primarily used to detect and ...
DEFF Research Database (Denmark)
2009-01-01
Professor Sven Erik Nordenbo og centerleder Niels Egelund, begge DPU, i samtale om nationale test.......Professor Sven Erik Nordenbo og centerleder Niels Egelund, begge DPU, i samtale om nationale test....
DEFF Research Database (Denmark)
2009-01-01
Hvad er egentlig formålet med de nationale test? Bliver eleverne klogere af at blive testet? Og er der en sammenhæng mellem bandekrig og nationale test? Fysisk medie: dpu.dk/tv......Hvad er egentlig formålet med de nationale test? Bliver eleverne klogere af at blive testet? Og er der en sammenhæng mellem bandekrig og nationale test? Fysisk medie: dpu.dk/tv...
... Abroad Treatment Basic Statistics Get Tested Find an HIV testing site near you. Enter ZIP code or city Follow HIV/AIDS CDC HIV CDC HIV/AIDS See RSS | ... All Collapse All Should I get tested for HIV? CDC recommends that everyone between the ages of ...
... A A What's in this article? What Is Test Anxiety? What Causes It? Who's Likely to Have Test Anxiety? What Can You Do? en español Ansiedad ante ... prevent them from doing their best on a test. continue What Causes It? All anxiety is a reaction to anticipating something stressful. Like ...
... helpful? Also known as: Serum Ferritin Formal name: Ferritin, serum Related tests: Complete Blood Count , Hemoglobin , Hematocrit , Serum Iron , TIBC, UIBC and Transferrin , Iron Tests , Zinc Protoporphyrin , Soluble Transferrin ... else I should know? How is it used? The ferritin test is ordered to assess a person's iron ...
Upshur, John A.
1974-01-01
It is suggested in this column that trends in language testing in the last 15 years have followed trends in modern language teaching. Language testing adopted the tenets of audiolingualism and contrastive analysis, then incorporated test-making procedures of psychometrics, and finally became more eclectic in its approach. (SW)
Identifying genetic marker sets associated with phenotypes via an efficient adaptive score test
Cai, T.
2012-06-25
their effects. Such an adaptive procedure gains power over the existing procedures when the signal is sparse and the correlation among the markers is weak. By combining evidence from both the EB-based score test and the adaptive test, we further construct an omnibus test that attains good power in most settings. The null distributions of the proposed test statistics can be approximated well either via simple perturbation procedures or via distributional approximations. Through extensive simulation studies, we demonstrate that the proposed procedures perform well in finite samples. We apply the tests to a breast cancer genetic study to assess the overall effect of the FGFR2 gene on breast cancer risk.
A fast multilocus test with adaptive SNP selection for large-scale genetic-association studies
Zhang, Han
2013-09-11
As increasing evidence suggests that multiple correlated genetic variants could jointly influence the outcome, a multilocus test that aggregates association evidence across multiple genetic markers in a considered gene or a genomic region may be more powerful than a single-marker test for detecting susceptibility loci. We propose a multilocus test, AdaJoint, which adopts a variable selection procedure to identify a subset of genetic markers that jointly show the strongest association signal, and defines the test statistic based on the selected genetic markers. The P-value from the AdaJoint test is evaluated by a computationally efficient algorithm that effectively adjusts for multiple-comparison, and is hundreds of times faster than the standard permutation method. Simulation studies demonstrate that AdaJoint has the most robust performance among several commonly used multilocus tests. We perform multilocus analysis of over 26,000 genes/regions on two genome-wide association studies of pancreatic cancer. Compared with its competitors, AdaJoint identifies a much stronger association between the gene CLPTM1L and pancreatic cancer risk (6.0 × 10(-8)), with the signal optimally captured by two correlated single-nucleotide polymorphisms (SNPs). Finally, we show AdaJoint as a powerful tool for mapping cis-regulating methylation quantitative trait loci on normal breast tissues, and find many CpG sites whose methylation levels are jointly regulated by multiple SNPs nearby.
A Robust Semi-Parametric Test for Detecting Trait-Dependent Diversification.
Rabosky, Daniel L; Huang, Huateng
2016-03-01
Rates of species diversification vary widely across the tree of life and there is considerable interest in identifying organismal traits that correlate with rates of speciation and extinction. However, it has been challenging to develop methodological frameworks for testing hypotheses about trait-dependent diversification that are robust to phylogenetic pseudoreplication and to directionally biased rates of character change. We describe a semi-parametric test for trait-dependent diversification that explicitly requires replicated associations between character states and diversification rates to detect effects. To use the method, diversification rates are reconstructed across a phylogenetic tree with no consideration of character states. A test statistic is then computed to measure the association between species-level traits and the corresponding diversification rate estimates at the tips of the tree. The empirical value of the test statistic is compared to a null distribution that is generated by structured permutations of evolutionary rates across the phylogeny. The test is applicable to binary discrete characters as well as continuous-valued traits and can accommodate extremely sparse sampling of character states at the tips of the tree. We apply the test to several empirical data sets and demonstrate that the method has acceptable Type I error rates. © The Author(s) 2015. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. All rights reserved. For Permissions, please email: journals.permissions@oup.com.
1995-01-01
We investigate the notion of fair testing, a formal testing theory in the style of De Nicola and Hennessy where divergences are disregarded as long as there are visible outgoing transitions. The usual testing theories, such as the standard model of failure pre-order, do not allow such fair interpretations because of the way in which they ensure their compositionality with respect to abstraction from observable actions. This feature is usually present in the form of a hiding-operator (CSP, ACP...
2015-12-01
Realistic replication of such attacks is necessary to thoroughly test detection and defense mechanisms. The common response to this risk is to...particular user, desired behavior may be to deny service or disrupt connectivity in the experimental network, to test a new worm or to maintain some...scripting environment whose syntax enables specification of control flows that depend on controlled program outputs, thus automating system testing
... Preschool and Primary Scale of Intelligence Stanford-Binet Intelligence Scales Differential Ability Scales Kaufman Assessment Battery for Children Functioning abilities that are measured by these tests ...
... called human chorionic gonadotropin (HCG). HCG is a hormone produced during pregnancy. It appears in the blood and urine of ... A pregnancy test is done using blood or urine. There are 2 types of ... how much HCG is present The blood test is done by drawing ...
... as: Serum Iron; Serum Fe Formal name: Iron, serum Related tests: Ferritin ; TIBC, UIBC and Transferrin ; Hemoglobin ; Hematocrit ; Complete Blood Count ; Reticulocyte Count ; Zinc Protoporphyrin ; Iron Tests ; Soluble Transferrin Receptor ... I should know? How is it used? Serum iron, total iron-binding capacity (TIBC) , and/or ...
DEFF Research Database (Denmark)
Bundsgaard, Jeppe; Puck, Morten Rasmus
Nationale test skubber undervisning i en forkert retning. Det er lærerne og skolelederne enige om. Men særligt skolelederne ser også muligheder for at bruge testen til at få viden om elevernes faglige kompetencer og om undervisningen. Det kommer til udtryk i rapporten Nationale test: Danske lærere...
Directory of Open Access Journals (Sweden)
Eduardo Salazar Hornig
2011-08-01
Full Text Available En este trabajo se estudió el problema de secuenciamiento de trabajos en el taller de flujo de permutación con tiempos de preparación dependientes de la secuencia y minimización de makespan. Para ello se propuso un algoritmo de optimización mediante colonia de hormigas (ACO, llevando el problema original a una estructura semejante al problema del vendedor viajero TSP (Traveling Salesman Problem asimétrico, utilizado para su evaluación problemas propuestos en la literatura y se compara con una adaptación de la heurística NEH (Nawaz-Enscore-Ham. Posteriormente se aplica una búsqueda en vecindad a la solución obtenida tanto por ACO como NEH.This paper studied the permutation flowshop with sequence dependent setup times and makespan minimization. An ant colony algorithm which turns the original problem into an asymmetric TSP (Traveling Salesman Problem structure is presented, and applied to problems proposed in the literature and is compared with an adaptation of the NEH heuristic. Subsequently a neighborhood search was applied to the solution obtained by the ACO algorithm and the NEH heuristic.
Institute of Scientific and Technical Information of China (English)
沈守强; 岑建苗
2012-01-01
给出了置换因子循环矩阵A=Percirc P（F_0^（k,h）,F_1^（k,h），＊＊＊,F_n-1^（k,h）和B=Percirc P（L_0^（k,h），L_1^（k,h）,＊＊＊,L_n-1^（k,h）的谱范数的上界与下界，得到了矩阵A与B的Kronecker积与Hadamard积的谱范数的一些界．%The upper and lower bounds for the spectral norms of the permutation factor circulant matrices A=Percirc P(F_0^(k,h),F_1^(k,h),***,F_n-1^(k,h) and B=Percirc P(L_0^(k,h),L_1^(k,h),***,L_n-1^(k,h) are given. In addition, some bounds for the spectral norms of Hadamard and Kronecker products of these matrices are obtained.
Extraction and analysis of signatures from the Gene Expression Omnibus by the crowd
DEFF Research Database (Denmark)
Wang, Zichen; Monteiro, Caroline D.; Jagodnik, Kathleen M.
2016-01-01
Gene expression data are accumulating exponentially in public repositories. Reanalysis and integration of themed collections from these studies may provide new insights, but requires further human curation. Here we report a crowdsourcing project to annotate and reanalyse a large number of gene ex...
2013-12-02
... with our commitment to improving service delivery. The information collected from our customers and... an existing data-driven satisfaction surveys to understand customer opinion. DATES: Written comments... Service (IRS) and its programs and services. Collecting, analyzing, and using customer opinion data is...
National estimates of Australian gambling prevalence: f indings from a dual‐frame omnibus survey
Youssef, G. J.; Jackson, A. C.; Pennay, D. W.; Francis, K. L.; Pennay, A.; Lubman, D. I.
2016-01-01
Abstract Background, aims and design The increase in mobile telephone‐only households may be a source of bias for traditional landline gambling prevalence surveys. Aims were to: (1) identify Australian gambling participation and problem gambling prevalence using a dual‐frame (50% landline and 50% mobile telephone) computer‐assisted telephone interviewing methodology; (2) explore the predictors of sample frame and telephone status; and (3) explore the degree to which sample frame and telephone status moderate the relationships between respondent characteristics and problem gambling. Setting and participants A total of 2000 adult respondents residing in Australia were interviewed from March to April 2013. Measurements Participation in multiple gambling activities and Problem Gambling Severity Index (PGSI). Findings Estimates were: gambling participation [63.9%, 95% confidence interval (CI) = 61.4–66.3], problem gambling (0.4%, 95% CI = 0.2–0.8), moderate‐risk gambling (1.9%, 95% CI = 1.3–2.6) and low‐risk gambling (3.0%, 95% CI = 2.2–4.0). Relative to the landline frame, the mobile frame was more likely to gamble on horse/greyhound races [odds ratio (OR) = 1.4], casino table games (OR = 5.0), sporting events (OR = 2.2), private games (OR = 1.9) and the internet (OR = 6.5); less likely to gamble on lotteries (OR = 0.6); and more likely to gamble on five or more activities (OR = 2.4), display problem gambling (OR = 6.4) and endorse PGSI items (OR = 2.4‐6.1). Only casino table gambling (OR = 2.9) and internet gambling (OR = 3.5) independently predicted mobile frame membership. Telephone status (landline frame versus mobile dual users and mobile‐only users) displayed similar findings. Finally, sample frame and/or telephone status moderated the relationship between gender, relationship status, health and problem gambling (OR = 2.9–7.6). Conclusion Given expected future increases in the mobile telephone‐only population, best practice in population gambling research should use dual frame sampling methodologies (at least 50% landline and 50% mobile telephone) for telephone interviewing. PMID:26381314
Traveler Module for Cargo System by Omnibus in Ciego de Avila
Directory of Open Access Journals (Sweden)
Yoelkis Hernández Victor
2014-01-01
Full Text Available The present research comes from the need of optimization and improvement of the processes that take place in the National Bus Company located in the province of Ciego de Avila. Nowadays a process of business improvement of transportation is taking effect and in this way improving its main processes and workflows. Reservation processes, refund, waiting list and traffic control, are indispensable for the proper functioning of the enterprise, that´s why a better management and greater control over this process is desired by the directors. To carry out the computerization of the processes mentioned before, it was necessary to make a detailed analysis of the state of the art computer systems that respond to these processes, besides to use business intelligence for the large amount of information that is managed, as well as the main tools and technologies for the development o f enterprise application. Moreover, the proposed architecture in the system was not an unseen topic by the time of evaluating the solution for this problem and to achieve a product with quality. The development of the web application, based on the Model-View-Controller pattern, using the Symfony framework, it allows the management of the main services offered by the company: reservation, waiting list, refund of tickets, among others.
Omnibus Report: Europe, Middle East, Africa, East Asia and Latin America.
Gallagher, C F; Nolte, R H; Liebenow, J G; Ravenholt, A; Handelman, H
1979-01-01
5 papers deal respectively with economic development in Europe, the Middle East, Africa, East Asia, and Latin America. In Europe, basic problems include increasing political and military weakness; the high costs of social democracy; problems of the welfare state; the trend toward low or no-growth population rates; declining fertility combined with increasing longevity; increasing demand for social services and health care; industrial decline; continuing decline in economic indices; integration of the Left in European politics; and a pervasive trend toward neoconservatism. The paper on the Middle East focuses on Iran, Saudi Arabia, and the recent Egypt-Israel Treaty, in terms of assessment of the present situation followed by a prognosis for the future. The paper on Africa discusses 4 crises of development: 1) the crisis of national identity; 2) the crisis of poverty; 3) the crisis of colonialism and neocolonialism; and 4) the crisis of popular control over government. The paper on east Asia discusses the "economic miracles" and whether or not they are replicable elsewhere in the Pacific and Asia. Finally, the paper on Latin America focuses on the fact that despite expansion of the urban middle class through economic development and modernization, little economic improvement has resulted. The challenge of the 1980s will be to see whether Latin America can put its economies back on track while managing to channel more of the economic benefits to the "have-nots" and to allow more open, participatory systems.
2010-10-21
..., environmental stewardship and security, preparedness and response), Provide a vehicle for the operating... for dealing with congestion; Telecommuting information; Commuting costs; Availability of transportation subsidies. Impact of congestion on commute. Impact of on-line shopping on passenger and freight...
2010-04-12
..., environmental stewardship and security, preparedness and response), Provide a vehicle for the operating... Number of days traveled Assessment of congestion Methods for dealing with congestion Telecommuting information Commuting costs Availability of transportation subsidies Impact of congestion on commute Impact of...
2010-02-02
..., environmental stewardship and security, preparedness and response), provide a vehicle for the operating... Methods for dealing with congestion Telecommuting information Commuting costs Availability of transportation subsidies Impact of congestion on commute Impact of on-line shopping on passenger and freight...
DEFF Research Database (Denmark)
Thorsen, Grete
1996-01-01
The paper describes the results of oedometer tests carried out with samples from Eemian fresh-water deposits and the methods used to determine the preconsolidation pressure from the test results. The influence of creep in the material on the apparent preconsolidation pressure is estimated from...... a model set up by Moust Jacobsen in 1992. The test results do not show any significant difference in the determined values of the overconsolidation ratio (OCR) for the samples from Hollerup and Solsø, east and west of the main stationary line for the last ice sheet in Weichselian, respectively...
... especially as a result of taking non-human (animal or synthetic) insulin, these can interfere with insulin testing. In this case, a C-peptide may be performed as an alternative way to evaluate insulin production. Note also that ...
... CRP) , cultures (e.g., blood culture , urine culture ), lactate , blood gases , complete blood count (CBC) , and cerebrospinal ... of procalcitonin can be seen with medullary thyroid cancer , but the test is not used to diagnose ...
... interfere with its production, increase protein breakdown, increase protein loss, and/or expand plasma volume (diluting the blood). Depending on the person's medical history, signs and symptoms, and physical exam, additional testing ...
Gilbert, George L.
1990-01-01
Included are three demonstrations that include the phase change of ice when under pressure, viscoelasticity and colloid systems, and flame tests for metal ions. The materials, procedures, probable results, and applications to real life situations are included. (KR)
... syphilis . The bacteria that cause syphilis is called Treponema pallidum. Your health care provider may order this test ... 59. Radolf JD, Tramont EC, Salazar JC. Syphilis ( Treponema pallidum ). In: Bennett JE, Dolin R, Blaser MJ, eds. ...
Advertisement Proceeds from website advertising help sustain Lab Tests Online. AACC is a not-for-profit organization and does not endorse non-AACC products and services. Advertising & Sponsorship: Policy | Opportunities ...
Advertisement Proceeds from website advertising help sustain Lab Tests Online. AACC is a not-for-profit organization and does not endorse non-AACC products and services. Advertising & Sponsorship: Policy | Opportunities ...
Advertisement Proceeds from website advertising help sustain Lab Tests Online. AACC is a not-for-profit organization and does not endorse non-AACC products and services. Advertising & Sponsorship: Policy | Opportunities ...
Advertisement Proceeds from website advertising help sustain Lab Tests Online. AACC is a not-for-profit organization and does not endorse non-AACC products and services. Advertising & Sponsorship: Policy | Opportunities ...
Advertisement Proceeds from website advertising help sustain Lab Tests Online. AACC is a not-for-profit organization and does not endorse non-AACC products and services. Advertising & Sponsorship: Policy | Opportunities ...
Advertisement Proceeds from website advertising help sustain Lab Tests Online. AACC is a not-for-profit organization and does not endorse non-AACC products and services. Advertising & Sponsorship: Policy | Opportunities ...
Advertisement Proceeds from website advertising help sustain Lab Tests Online. AACC is a not-for-profit organization and does not endorse non-AACC products and services. Advertising & Sponsorship: Policy | Opportunities ...
Advertisement Proceeds from website advertising help sustain Lab Tests Online. AACC is a not-for-profit organization and does not endorse non-AACC products and services. Advertising & Sponsorship: Policy | Opportunities ...
Directory of Open Access Journals (Sweden)
R. Fernando Prialé Z.
1983-12-01
Full Text Available En primer lugar, se considera el impacto de las microcomputadoras en la actualidad, viéndolo como un hecho social destinado a traer profundos cambios: nos orientamos hacia una cultura informática cuyo signo es la posibilidad de tratar grandes cantidades de información. En segundo lugar; se analiza brevemente la importancia de los tests en el desarrollo de la psicología. Finalmente, se discute la posibilidad de aplicar la informática a la psicometría con el ejemplo del test de BARSIT. The impact of microcomputers is discussed as a cultural fact that will bring profound changes in the near future: a society with an ubiquous capacity for treating big amounts of information. The importance of tests for the development of psychology is then analysed. Finaly, the possibility of applying microcomputers to psychometry is discussed trough a concrete example: The BARSIT test.
... may cause a false-positive test, including: IV drug use Lyme disease Certain types of pneumonia Malaria Pregnancy Systemic lupus erythematosus and some other autoimmune disorders Tuberculosis (TB)
... be limited. Home Visit Global Sites Search Help? Magnesium Share this page: Was this page helpful? Also known as: Mg; Mag Formal name: Magnesium Related tests: Calcium , Potassium , Phosphorus , PTH , Vitamin D ...
Federal Laboratory Consortium — The U. S. Navy dedicated the decommissioned Spruance Class destroyer ex-PAUL F. FOSTER (EDD 964), Test Ship, primarily for at sea demonstration of short range weapon...
... cells - Pap; AGUS - Pap; Atypical squamous cells - Pap; HPV - Pap; Human papilloma virus - Pap cervix - Pap; Colposcopy - Pap ... test to check for the presence of the HPV virus types most likely to cause cancer Cervix cryosurgery- ...
Energy Technology Data Exchange (ETDEWEB)
Rose, David Martin; Schenkman, Benjamin L.; Borneo, Daniel R.
2013-10-01
The Department of Energy Office of Electricity (DOE/OE), Sandia National Laboratories (SNL) and the Base Camp Integration Lab (BCIL) partnered together to incorporate an energy storage system into a microgrid configured Forward Operating Base to reduce the fossil fuel consumption and to ultimately save lives. Energy storage vendors will be sending their systems to SNL Energy Storage Test Pad (ESTP) for functional testing and then to the BCIL for performance evaluation. The technologies that will be tested are electro-chemical energy storage systems comprising of lead acid, lithium-ion or zinc-bromide. Raytheon/KTech has developed an energy storage system that utilizes zinc-bromide flow batteries to save fuel on a military microgrid. This report contains the testing results and some limited analysis of performance of the Raytheon/KTech Zinc-Bromide Energy Storage System.
... AACC products and services. Advertising & Sponsorship: Policy | Opportunities Cholesterol Share this page: Was this page helpful? Also known as: Blood Cholesterol Formal name: Total Cholesterol Related tests: HDL Cholesterol , ...
... Homocysteine ; Lupus Anticoagulant ; Proteins C & S ; PT ; PT 20210 ; Factor V Leiden All content on Lab Tests Online has been ... such as a protein C or S deficiency , a factor V leiden mutation , or oral contraceptive use, then the person ...
DEFF Research Database (Denmark)
Sørensen, Ole Henning
1998-01-01
The knowledge test is about competing temporal and spatial expressions of the politics of technological development and national prosperity in contemporary society. The discussion is based on literature of national systems of innovation and industrial networks of various sorts. Similarities...
Energy Technology Data Exchange (ETDEWEB)
Rose, David Martin; Schenkman, Benjamin L.; Borneo, Daniel R.
2013-08-01
The Department of Energy Office of Electricity (DOE/OE), Sandia National Laboratory (SNL) and the Base Camp Integration Lab (BCIL) partnered together to incorporate an energy storage system into a microgrid configured Forward Operating Base to reduce the fossil fuel consumption and to ultimately save lives. Energy storage vendors have supplied their systems to SNL Energy Storage Test Pad (ESTP) for functional testing and a subset of these systems were selected for performance evaluation at the BCIL. The technologies tested were electro-chemical energy storage systems comprised of lead acid, lithium-ion or zinc-bromide. MILSPRAY Military Technologies has developed an energy storage system that utilizes lead acid batteries to save fuel on a military microgrid. This report contains the testing results and some limited assessment of the Milspray Scorpion Energy Storage Device.
... be limited. Home Visit Global Sites Search Help? Triglycerides Share this page: Was this page helpful? Also known as: TG; TRIG Formal name: Triglycerides Related tests: Cholesterol ; HDL Cholesterol ; LDL Cholesterol ; Direct ...
... called Tensilon (also called edrophonium) or a dummy medicine (inactive placebo) is given during this test. The health care provider gives the medicine through one of your veins (intravenously, through an ...
... helpful? Also known as: Venereal Disease Research Laboratory; VDRL; Rapid Plasma Reagin; RPR; Fluorescent Treponemal Antibody Absorption ... test for treponemal antibodies is positive (see below). VDRL (Venereal Disease Research Laboratory)--in addition to blood, ...
... is broken) Considerations Other tests used to detect pancreas diseases may include: Serum amylase Serum lipase Alternative Names ... Related MedlinePlus Health Topics Cystic Fibrosis Pancreatic Cancer Pancreatic Diseases Browse the Encyclopedia A.D.A.M., Inc. ...
DEFF Research Database (Denmark)
Sørensen, Ole Henning
1998-01-01
The knowledge test is about competing temporal and spatial expressions of the politics of technological development and national prosperity in contemporary society. The discussion is based on literature of national systems of innovation and industrial networks of various sorts. Similarities...
2015-09-09
ORGANIZATION NAME(S) AND ADDRESS(ES) U.S. Army Yuma Proving Ground Yuma Test Center 301 C Street Yuma, Arizona 85365-9498 8. PERFORMING... ORGANIZATION REPORT NUMBER TOP 02-2-698 9. SPONSORING/MONITORING AGENCY NAME(S) AND ADDRESS(ES) U.S. Army Test and Evaluation Command CSTE-TM...tire assembly tread life combat flat central tire inflation system (CTIS) 16. SECURITY CLASSIFICATION OF: 17. LIMITATION
Patch tests - allergy; Scratch tests - allergy; Skin tests - allergy; RAST test; Allergic rhinitis - allergy testing; Asthma - allergy testing; Eczema - allergy testing; Hayfever - allergy testing; Dermatitis - allergy testing; Allergy testing; ...
2005-01-01
In this paper we present a solution to the long-standing problem of characterising the coarsest liveness-preserving pre-congruence with respect to a full (TCSP-inspired) process algebra. In fact, we present two distinct characterisations, which give rise to the same relation: an operational one based on a De Nicola-Hennessy-like testing modality which we call should-testing, and a denotational one based on a refined notion of failures. One of the distinguishing characteristics of the should-t...
DEFF Research Database (Denmark)
Kjeldsen, Lars Peter; Rose, Mette
2010-01-01
Artikelen er en evaluering af de adaptive tests, som blev indført i folkeskolen. Artiklen sætter særligt fokus på evaluering i folkeskolen, herunder bidrager den med vejledning til evaluering, evalueringsværktøjer og fagspecifkt evalueringsmateriale.......Artikelen er en evaluering af de adaptive tests, som blev indført i folkeskolen. Artiklen sætter særligt fokus på evaluering i folkeskolen, herunder bidrager den med vejledning til evaluering, evalueringsværktøjer og fagspecifkt evalueringsmateriale....
Zhao, Ni; Chen, Jun; Carroll, Ian M; Ringel-Kulka, Tamar; Epstein, Michael P; Zhou, Hua; Zhou, Jin J; Ringel, Yehuda; Li, Hongzhe; Wu, Michael C
2015-05-01
High-throughput sequencing technology has enabled population-based studies of the role of the human microbiome in disease etiology and exposure response. Distance-based analysis is a popular strategy for evaluating the overall association between microbiome diversity and outcome, wherein the phylogenetic distance between individuals' microbiome profiles is computed and tested for association via permutation. Despite their practical popularity, distance-based approaches suffer from important challenges, especially in selecting the best distance and extending the methods to alternative outcomes, such as survival outcomes. We propose the microbiome regression-based kernel association test (MiRKAT), which directly regresses the outcome on the microbiome profiles via the semi-parametric kernel machine regression framework. MiRKAT allows for easy covariate adjustment and extension to alternative outcomes while non-parametrically modeling the microbiome through a kernel that incorporates phylogenetic distance. It uses a variance-component score statistic to test for the association with analytical p value calculation. The model also allows simultaneous examination of multiple distances, alleviating the problem of choosing the best distance. Our simulations demonstrated that MiRKAT provides correctly controlled type I error and adequate power in detecting overall association. "Optimal" MiRKAT, which considers multiple candidate distances, is robust in that it suffers from little power loss in comparison to when the best distance is used and can achieve tremendous power gain in comparison to when a poor distance is chosen. Finally, we applied MiRKAT to real microbiome datasets to show that microbial communities are associated with smoking and with fecal protease levels after confounders are controlled for.
... months, and at 3, 4, 5, and 6 years of age. A blood lead level test should be done only if the risk ... recommended if the person is symptomatic at any level below 70 mcg/dL. Because lead will pass through the blood to an unborn child, pregnant ...
Onoja, A M
2011-01-01
Molecular diagnostic techniques have found application in virtually all areas of medicine, including criminal investigations and forensic analysis. The techniques have become so precise that it is now possible to conclusively determine paternity using DNA from grand parents, cousins, or even saliva left on a discarded cigarette butt. This is a broad overview of paternity testing.
... may recommend homocysteine testing in malnourished individuals, the elderly, who often absorb less vitamin B12 from their diet, and individuals with poor nutrition, such as drug or alcohol addicts. Homocysteine may be ordered as part of a screen for people at high risk for heart attack or stroke . ...
Energy Technology Data Exchange (ETDEWEB)
Brandt, Adam R. [Energy and Resources Group, University of California Berkeley, 310 Barrows Hall, Berkeley, CA 94720-3050 (United States)
2007-05-15
The Hubbert theory of oil depletion, which states that oil production in large regions follows a bell-shaped curve over time, has been cited as a method to predict the future of global oil production. However, the assumptions of the Hubbert method have never been rigorously tested with a large, publicly available data set. In this paper, three assumptions of the modern Hubbert theory are tested using data from 139 oil producing regions. These regions are sub-national (United States state-level, United States regional-level), national, and multi-national (subcontinental and continental) in scale. We test the assumption that oil production follows a bell-shaped curve by generating best-fitting curves for each region using six models and comparing the quality of fit across models. We also test the assumptions that production over time in a region tends to be symmetric, and that production is more bell-shaped in larger regions than in smaller regions. (author)
TroponinI; TnI; TroponinT; TnT; Cardiac-specific troponin I; Cardiac-specific troponin T; cTnl; cTnT ... your heart not getting enough blood flow.) The troponin test may also be done to help detect ...
Energy Technology Data Exchange (ETDEWEB)
Lee, H.J; Yang, S.H. [Korea Electric Power Research Institute, Taejon (Korea)
2002-07-01
This report contains theory, procedure technique and interpretation of radiographic examination and written for whom preparing radiographic test Level II. To determine this baseline of technical competence in the examination, the individual must demonstrate a knowledge of radiography physics, radiation safety, technique development, radiation detection and measurement, facility design, and the characteristics of radiation-producing devices and their principles of operation. (author) 98 figs., 23 tabs.
Institute of Scientific and Technical Information of China (English)
王丽荣
2005-01-01
Tests are usually a big part of a teacher's life. They are part of the ritual of the classroom. Students expect them. Administrators, school boards and legislators require them. They are important to us in our work; we think about them often and have a lot to say about them.
Testing Understanding and Understanding Testing.
Pedersen, Jean; Ross, Peter
1985-01-01
Provides examples in which graphs are used in the statements of problems or in their solutions as a means of testing understanding of mathematical concepts. Examples (appropriate for a beginning course in calculus and analytic geometry) include slopes of lines and curves, quadratic formula, properties of the definite integral, and others. (JN)
... Persantine stress test; Thallium stress test; Stress test - nuclear; Adenosine stress test; Regadenoson stress test; CAD - nuclear stress; Coronary artery disease - nuclear stress; Angina - nuclear ...
CHF - tests; Congestive heart failure - tests; Cardiomyopathy - tests; HF - tests ... the best test to: Identify which type of heart failure (systolic versus diastolic, valvular) Monitor your heart failure ...
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 ...
APE: Authenticated Permutation-Based Encryption for Lightweight Cryptography
Andreeva, Elena; Bilgin, Begül; Bogdanov, Andrey; Luykx, Atul; Mennink, Bart; Mouha, Nicky; Yasuda, Kan
The domain of lightweight cryptography focuses on cryptographic algorithms for extremely constrained devices. It is very costly to avoid nonce reuse in such environments, because this requires either a hardware source of randomness, or non-volatile memory to store a counter. At the same time, a lot
Online Query Scheduling on Source Permutation for Big Data Integration
Yuan, Zimu; Guo, Shusheng
2015-01-01
Big data integration could involve a large number of sources with unpredictable redundancy information between them. The approach of building a central warehousing to integrate big data from all sources then becomes infeasible because of so large number of sources and continuous updates happening. A practical approach is to apply online query scheduling that inquires data from sources at runtime upon receiving a query. In this paper, we address the Time-Cost Minimization Problem for online qu...
The Query Complexity of Finding a Hidden Permutation
DEFF Research Database (Denmark)
Afshani, Peyman; Afrawal, Manindra; Benjamin, Doerr;
2012-01-01
the score fz(x) defined as fz(x):=maxi[0n]ji:z(j)=x(j); i.e., the length of the longest common prefix of x and z with respect to . The goal is to minimize the number of queries asked. Our main result are matching upper and lower bounds for this problem, both for deterministic and randomized query schemes...