Design of Long Period Pseudo-Random Sequences from the Addition of -Sequences over
Directory of Open Access Journals (Sweden)
Ren Jian
2004-01-01
Full Text Available Pseudo-random sequence with good correlation property and large linear span is widely used in code division multiple access (CDMA communication systems and cryptology for reliable and secure information transmission. In this paper, sequences with long period, large complexity, balance statistics, and low cross-correlation property are constructed from the addition of -sequences with pairwise-prime linear spans (AMPLS. Using -sequences as building blocks, the proposed method proved to be an efficient and flexible approach to construct long period pseudo-random sequences with desirable properties from short period sequences. Applying the proposed method to , a signal set is constructed.
Design of Long Period Pseudo-Random Sequences from the Addition of m -Sequences over 𝔽 p
Directory of Open Access Journals (Sweden)
Ren Jian
2004-01-01
Full Text Available Pseudo-random sequence with good correlation property and large linear span is widely used in code division multiple access (CDMA communication systems and cryptology for reliable and secure information transmission. In this paper, sequences with long period, large complexity, balance statistics, and low cross-correlation property are constructed from the addition of m -sequences with pairwise-prime linear spans (AMPLS. Using m -sequences as building blocks, the proposed method proved to be an efficient and flexible approach to construct long period pseudo-random sequences with desirable properties from short period sequences. Applying the proposed method to 𝔽 2 , a signal set ( ( 2 n − 1 ( 2 m − 1 , ( 2 n + 1 ( 2 m + 1 , ( 2 ( n + 1 / 2 + 1 ( 2 ( m + 1 / 2 + 1 is constructed.
Long period pseudo random number sequence generator
Wang, Charles C. (Inventor)
1989-01-01
A circuit for generating a sequence of pseudo random numbers, (A sub K). There is an exponentiator in GF(2 sup m) for the normal basis representation of elements in a finite field GF(2 sup m) each represented by m binary digits and having two inputs and an output from which the sequence (A sub K). Of pseudo random numbers is taken. One of the two inputs is connected to receive the outputs (E sub K) of maximal length shift register of n stages. There is a switch having a pair of inputs and an output. The switch outputs is connected to the other of the two inputs of the exponentiator. One of the switch inputs is connected for initially receiving a primitive element (A sub O) in GF(2 sup m). Finally, there is a delay circuit having an input and an output. The delay circuit output is connected to the other of the switch inputs and the delay circuit input is connected to the output of the exponentiator. Whereby after the exponentiator initially receives the primitive element (A sub O) in GF(2 sup m) through the switch, the switch can be switched to cause the exponentiator to receive as its input a delayed output A(K-1) from the exponentiator thereby generating (A sub K) continuously at the output of the exponentiator. The exponentiator in GF(2 sup m) is novel and comprises a cyclic-shift circuit; a Massey-Omura multiplier; and, a control logic circuit all operably connected together to perform the function U(sub i) = 92(sup i) (for n(sub i) = 1 or 1 (for n(subi) = 0).
Spectral sum rules and search for periodicities in DNA sequences
International Nuclear Information System (INIS)
Chechetkin, V.R.
2011-01-01
Periodic patterns play the important regulatory and structural roles in genomic DNA sequences. Commonly, the underlying periodicities should be understood in a broad statistical sense, since the corresponding periodic patterns have been strongly distorted by the random point mutations and insertions/deletions during molecular evolution. The latent periodicities in DNA sequences can be efficiently displayed by Fourier transform. The criteria of significance for observed periodicities are obtained via the comparison versus the counterpart characteristics of the reference random sequences. We show that the restrictions imposed on the significance criteria by the rigorous spectral sum rules can be rationally described with De Finetti distribution. This distribution provides the convenient intermediate asymptotic form between Rayleigh distribution and exact combinatoric theory. - Highlights: → We study the significance criteria for latent periodicities in DNA sequences. → The constraints imposed by sum rules can be described with De Finetti distribution. → It is intermediate between Rayleigh distribution and exact combinatoric theory. → Theory is applicable to the study of correlations between different periodicities. → The approach can be generalized to the arbitrary discrete Fourier transform.
Diaz, Francisco J; Berg, Michel J; Krebill, Ron; Welty, Timothy; Gidal, Barry E; Alloway, Rita; Privitera, Michael
2013-12-01
Due to concern and debate in the epilepsy medical community and to the current interest of the US Food and Drug Administration (FDA) in revising approaches to the approval of generic drugs, the FDA is currently supporting ongoing bioequivalence studies of antiepileptic drugs, the EQUIGEN studies. During the design of these crossover studies, the researchers could not find commercial or non-commercial statistical software that quickly allowed computation of sample sizes for their designs, particularly software implementing the FDA requirement of using random-effects linear models for the analyses of bioequivalence studies. This article presents tables for sample-size evaluations of average bioequivalence studies based on the two crossover designs used in the EQUIGEN studies: the four-period, two-sequence, two-formulation design, and the six-period, three-sequence, three-formulation design. Sample-size computations assume that random-effects linear models are used in bioequivalence analyses with crossover designs. Random-effects linear models have been traditionally viewed by many pharmacologists and clinical researchers as just mathematical devices to analyze repeated-measures data. In contrast, a modern view of these models attributes an important mathematical role in theoretical formulations in personalized medicine to them, because these models not only have parameters that represent average patients, but also have parameters that represent individual patients. Moreover, the notation and language of random-effects linear models have evolved over the years. Thus, another goal of this article is to provide a presentation of the statistical modeling of data from bioequivalence studies that highlights the modern view of these models, with special emphasis on power analyses and sample-size computations.
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.
RANDNA: a random DNA sequence generator.
Piva, Francesco; Principato, Giovanni
2006-01-01
Monte Carlo simulations are useful to verify the significance of data. Genomic regularities, such as the nucleotide correlations or the not uniform distribution of the motifs throughout genomic or mature mRNA sequences, exist and their significance can be checked by means of the Monte Carlo test. The test needs good quality random sequences in order to work, moreover they should have the same nucleotide distribution as the sequences in which the regularities have been found. Random DNA sequences are also useful to estimate the background score of an alignment, that is a threshold below which the resulting score is merely due to chance. We have developed RANDNA, a free software which allows to produce random DNA or RNA sequences setting both their length and the percentage of nucleotide composition. Sequences having the same nucleotide distribution of exonic, intronic or intergenic sequences can be generated. Its graphic interface makes it possible to easily set the parameters that characterize the sequences being produced and saved in a text format file. The pseudo-random number generator function of Borland Delphi 6 is used, since it guarantees a good randomness, a long cycle length and a high speed. We have checked the quality of sequences generated by the software, by means of well-known tests, both by themselves and versus genuine random sequences. We show the good quality of the generated sequences. The software, complete with examples and documentation, is freely available to users from: http://www.introni.it/en/software.
Parallel Mitogenome Sequencing Alleviates Random Rooting Effect in Phylogeography.
Hirase, Shotaro; Takeshima, Hirohiko; Nishida, Mutsumi; Iwasaki, Wataru
2016-04-28
Reliably rooted phylogenetic trees play irreplaceable roles in clarifying diversification in the patterns of species and populations. However, such trees are often unavailable in phylogeographic studies, particularly when the focus is on rapidly expanded populations that exhibit star-like trees. A fundamental bottleneck is known as the random rooting effect, where a distant outgroup tends to root an unrooted tree "randomly." We investigated whether parallel mitochondrial genome (mitogenome) sequencing alleviates this effect in phylogeography using a case study on the Sea of Japan lineage of the intertidal goby Chaenogobius annularis Eighty-three C. annularis individuals were collected and their mitogenomes were determined by high-throughput and low-cost parallel sequencing. Phylogenetic analysis of these mitogenome sequences was conducted to root the Sea of Japan lineage, which has a star-like phylogeny and had not been reliably rooted. The topologies of the bootstrap trees were investigated to determine whether the use of mitogenomes alleviated the random rooting effect. The mitogenome data successfully rooted the Sea of Japan lineage by alleviating the effect, which hindered phylogenetic analysis that used specific gene sequences. The reliable rooting of the lineage led to the discovery of a novel, northern lineage that expanded during an interglacial period with high bootstrap support. Furthermore, the finding of this lineage suggested the existence of additional glacial refugia and provided a new recent calibration point that revised the divergence time estimation between the Sea of Japan and Pacific Ocean lineages. This study illustrates the effectiveness of parallel mitogenome sequencing for solving the random rooting problem in phylogeographic studies. © The Author 2016. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.
Nonparametric Inference for Periodic Sequences
Sun, Ying
2012-02-01
This article proposes a nonparametric method for estimating the period and values of a periodic sequence when the data are evenly spaced in time. The period is estimated by a "leave-out-one-cycle" version of cross-validation (CV) and complements the periodogram, a widely used tool for period estimation. The CV method is computationally simple and implicitly penalizes multiples of the smallest period, leading to a "virtually" consistent estimator of integer periods. This estimator is investigated both theoretically and by simulation.We also propose a nonparametric test of the null hypothesis that the data have constantmean against the alternative that the sequence of means is periodic. Finally, our methodology is demonstrated on three well-known time series: the sunspots and lynx trapping data, and the El Niño series of sea surface temperatures. © 2012 American Statistical Association and the American Society for Quality.
LPTAU, Quasi Random Sequence Generator
International Nuclear Information System (INIS)
Sobol, Ilya M.
1993-01-01
1 - Description of program or function: LPTAU generates quasi random sequences. These are uniformly distributed sets of L=M N points in the N-dimensional unit cube: I N =[0,1]x...x[0,1]. These sequences are used as nodes for multidimensional integration; as searching points in global optimization; as trial points in multi-criteria decision making; as quasi-random points for quasi Monte Carlo algorithms. 2 - Method of solution: Uses LP-TAU sequence generation (see references). 3 - Restrictions on the complexity of the problem: The number of points that can be generated is L 30 . The dimension of the space cannot exceed 51
Image encryption using random sequence generated from generalized information domain
International Nuclear Information System (INIS)
Zhang Xia-Yan; Wu Jie-Hua; Zhang Guo-Ji; Li Xuan; Ren Ya-Zhou
2016-01-01
A novel image encryption method based on the random sequence generated from the generalized information domain and permutation–diffusion architecture is proposed. The random sequence is generated by reconstruction from the generalized information file and discrete trajectory extraction from the data stream. The trajectory address sequence is used to generate a P-box to shuffle the plain image while random sequences are treated as keystreams. A new factor called drift factor is employed to accelerate and enhance the performance of the random sequence generator. An initial value is introduced to make the encryption method an approximately one-time pad. Experimental results show that the random sequences pass the NIST statistical test with a high ratio and extensive analysis demonstrates that the new encryption scheme has superior security. (paper)
Nonlinear deterministic structures and the randomness of protein sequences
Huang Yan Zhao
2003-01-01
To clarify the randomness of protein sequences, we make a detailed analysis of a set of typical protein sequences representing each structural classes by using nonlinear prediction method. No deterministic structures are found in these protein sequences and this implies that they behave as random sequences. We also give an explanation to the controversial results obtained in previous investigations.
PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS
Directory of Open Access Journals (Sweden)
A. Beletsky
2014-04-01
Full Text Available In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS with a maximum length with acceptable statistical characteristics. PRS generators are usually implemented by linear shift register (LSR of maximum period with linear feedback [1]. In this paper we extend the concept of LSR, assuming that each of its rank (memory cell can be in one of the following condition. Let’s call such registers “generalized linear shift register.” The research goal is to develop algorithms for constructing Galois and Fibonacci generalized matrix of n-order over the field , which uniquely determined both the structure of corresponding generalized of n-order LSR maximal period, and formed on their basis Galois PRS generators of maximum length. Thus the article presents the questions of formation the primitive generalized Fibonacci and Galois arbitrary order matrix over the prime field . The synthesis of matrices is based on the use of irreducible polynomials of degree and primitive elements of the extended field generated by polynomial. The constructing methods of Galois and Fibonacci conjugated primitive matrices are suggested. The using possibilities of such matrices in solving the problem of constructing generalized generators of Galois pseudo-random sequences are discussed.
Generation of pseudo-random sequences for spread spectrum systems
Moser, R.; Stover, J.
1985-05-01
The characteristics of pseudo random radio signal sequences (PRS) are explored. The randomness of the PSR is a matter of artificially altering the sequence of binary digits broadcast. Autocorrelations of the two sequences shifted in time, if high, determine if the signals are the same and thus allow for position identification. Cross-correlation can also be calculated between sequences. Correlations closest to zero are obtained with large volume of prime numbers in the sequences. Techniques for selecting optimal and maximal lengths for the sequences are reviewed. If the correlations are near zero in the sequences, then signal channels can accommodate multiple users. Finally, Gold codes are discussed as a technique for maximizing the code lengths.
Improved nonparametric inference for multiple correlated periodic sequences
Sun, Ying
2013-08-26
This paper proposes a cross-validation method for estimating the period as well as the values of multiple correlated periodic sequences when data are observed at evenly spaced time points. The period of interest is estimated conditional on the other correlated sequences. An alternative method for period estimation based on Akaike\\'s information criterion is also discussed. The improvement of the period estimation performance is investigated both theoretically and by simulation. We apply the multivariate cross-validation method to the temperature data obtained from multiple ice cores, investigating the periodicity of the El Niño effect. Our methodology is also illustrated by estimating patients\\' cardiac cycle from different physiological signals, including arterial blood pressure, electrocardiography, and fingertip plethysmograph.
Bunches of random cross-correlated sequences
International Nuclear Information System (INIS)
Maystrenko, A A; Melnik, S S; Pritula, G M; Usatenko, O V
2013-01-01
The statistical properties of random cross-correlated sequences constructed by the convolution method (likewise referred to as the Rice or the inverse Fourier transformation) are examined. We clarify the meaning of the filtering function—the kernel of the convolution operator—and show that it is the value of the cross-correlation function which describes correlations between the initial white noise and constructed correlated sequences. The matrix generalization of this method for constructing a bunch of N cross-correlated sequences is presented. Algorithms for their generation are reduced to solving the problem of decomposition of the Fourier transform of the correlation matrix into a product of two mutually conjugate matrices. Different decompositions are considered. The limits of weak and strong correlations for the one-point probability and pair correlation functions of sequences generated by the method under consideration are studied. Special cases of heavy-tailed distributions of the generated sequences are analyzed. We show that, if the filtering function is rather smooth, the distribution function of generated variables has the Gaussian or Lévy form depending on the analytical properties of the distribution (or characteristic) functions of the initial white noise. Anisotropic properties of statistically homogeneous random sequences related to the asymmetry of a filtering function are revealed and studied. These asymmetry properties are expressed in terms of the third- or fourth-order correlation functions. Several examples of the construction of correlated chains with a predefined correlation matrix are given. (paper)
Golden Ratio Versus Pi as Random Sequence Sources for Monte Carlo Integration
Sen, S. K.; Agarwal, Ravi P.; Shaykhian, Gholam Ali
2007-01-01
We discuss here the relative merits of these numbers as possible random sequence sources. The quality of these sequences is not judged directly based on the outcome of all known tests for the randomness of a sequence. Instead, it is determined implicitly by the accuracy of the Monte Carlo integration in a statistical sense. Since our main motive of using a random sequence is to solve real world problems, it is more desirable if we compare the quality of the sequences based on their performances for these problems in terms of quality/accuracy of the output. We also compare these sources against those generated by a popular pseudo-random generator, viz., the Matlab rand and the quasi-random generator ha/ton both in terms of error and time complexity. Our study demonstrates that consecutive blocks of digits of each of these numbers produce a good random sequence source. It is observed that randomly chosen blocks of digits do not have any remarkable advantage over consecutive blocks for the accuracy of the Monte Carlo integration. Also, it reveals that pi is a better source of a random sequence than theta when the accuracy of the integration is concerned.
Halton, John H.
1989-09-01
A class of families of linear congruential pseudo-random sequences is defined, for which it is possible to branch at any event without changing the sequence of random numbers used in the original random walk and for which the sequences in different branches show properties analogous to mutual statistical independence. This is a hitherto unavailable, and computationally desirable, tool.
Roerdink, J.B.T.M.; Shuler, K.E.
1985-01-01
The previously developed formalism for the calculation of asymptotic properties of multistate random walks is used to study random walks on several inhomogeneous periodic lattices, where the periodically repeated unit cell contains a number of inequivalent sites, as well as on lattices with a random
GuiTope: an application for mapping random-sequence peptides to protein sequences.
Halperin, Rebecca F; Stafford, Phillip; Emery, Jack S; Navalkar, Krupa Arun; Johnston, Stephen Albert
2012-01-03
Random-sequence peptide libraries are a commonly used tool to identify novel ligands for binding antibodies, other proteins, and small molecules. It is often of interest to compare the selected peptide sequences to the natural protein binding partners to infer the exact binding site or the importance of particular residues. The ability to search a set of sequences for similarity to a set of peptides may sometimes enable the prediction of an antibody epitope or a novel binding partner. We have developed a software application designed specifically for this task. GuiTope provides a graphical user interface for aligning peptide sequences to protein sequences. All alignment parameters are accessible to the user including the ability to specify the amino acid frequency in the peptide library; these frequencies often differ significantly from those assumed by popular alignment programs. It also includes a novel feature to align di-peptide inversions, which we have found improves the accuracy of antibody epitope prediction from peptide microarray data and shows utility in analyzing phage display datasets. Finally, GuiTope can randomly select peptides from a given library to estimate a null distribution of scores and calculate statistical significance. GuiTope provides a convenient method for comparing selected peptide sequences to protein sequences, including flexible alignment parameters, novel alignment features, ability to search a database, and statistical significance of results. The software is available as an executable (for PC) at http://www.immunosignature.com/software and ongoing updates and source code will be available at sourceforge.net.
GuiTope: an application for mapping random-sequence peptides to protein sequences
Directory of Open Access Journals (Sweden)
Halperin Rebecca F
2012-01-01
Full Text Available Abstract Background Random-sequence peptide libraries are a commonly used tool to identify novel ligands for binding antibodies, other proteins, and small molecules. It is often of interest to compare the selected peptide sequences to the natural protein binding partners to infer the exact binding site or the importance of particular residues. The ability to search a set of sequences for similarity to a set of peptides may sometimes enable the prediction of an antibody epitope or a novel binding partner. We have developed a software application designed specifically for this task. Results GuiTope provides a graphical user interface for aligning peptide sequences to protein sequences. All alignment parameters are accessible to the user including the ability to specify the amino acid frequency in the peptide library; these frequencies often differ significantly from those assumed by popular alignment programs. It also includes a novel feature to align di-peptide inversions, which we have found improves the accuracy of antibody epitope prediction from peptide microarray data and shows utility in analyzing phage display datasets. Finally, GuiTope can randomly select peptides from a given library to estimate a null distribution of scores and calculate statistical significance. Conclusions GuiTope provides a convenient method for comparing selected peptide sequences to protein sequences, including flexible alignment parameters, novel alignment features, ability to search a database, and statistical significance of results. The software is available as an executable (for PC at http://www.immunosignature.com/software and ongoing updates and source code will be available at sourceforge.net.
Illingworth, Christopher J R; Parkes, Kevin E; Snell, Christopher R; Mullineaux, Philip M; Reynolds, Christopher A
2008-03-01
Methods to determine periodicity in protein sequences are useful for inferring function. Fourier transformation is one approach but care is required to ensure the periodicity is genuine. Here we have shown that empirically-derived statistical tables can be used as a measure of significance. Genuine protein sequences data rather than randomly generated sequences were used as the statistical backdrop. The method has been applied to G-protein coupled receptor (GPCR) sequences, by Fourier transformation of hydrophobicity values, codon frequencies and the extent of over-representation of codon pairs; the latter being related to translational step times. Genuine periodicity was observed in the hydrophobicity whereas the apparent periodicity (as inferred from previously reported measures) in the translation step times was not validated statistically. GCR2 has recently been proposed as the plant GPCR receptor for the hormone abscisic acid. It has homology to the Lanthionine synthetase C-like family of proteins, an observation confirmed by fold recognition. Application of the Fourier transform algorithm to the GCR2 family revealed strongly predicted seven fold periodicity in hydrophobicity, suggesting why GCR2 has been reported to be a GPCR, despite negative indications in most transmembrane prediction algorithms. The underlying multiple sequence alignment, also required for the Fourier transform analysis of periodicity, indicated that the hydrophobic regions around the 7 GXXG motifs commence near the C-terminal end of each of the 7 inner helices of the alpha-toroid and continue to the N-terminal region of the helix. The results clearly explain why GCR2 has been understandably but erroneously predicted to be a GPCR.
A high-speed on-chip pseudo-random binary sequence generator for multi-tone phase calibration
Gommé, Liesbeth; Vandersteen, Gerd; Rolain, Yves
2011-07-01
An on-chip reference generator is conceived by adopting the technique of decimating a pseudo-random binary sequence (PRBS) signal in parallel sequences. This is of great benefit when high-speed generation of PRBS and PRBS-derived signals is the objective. The design implemented standard CMOS logic is available in commercial libraries to provide the logic functions for the generator. The design allows the user to select the periodicity of the PRBS and the PRBS-derived signals. The characterization of the on-chip generator marks its performance and reveals promising specifications.
A high-speed on-chip pseudo-random binary sequence generator for multi-tone phase calibration
International Nuclear Information System (INIS)
Gommé, Liesbeth; Vandersteen, Gerd; Rolain, Yves
2011-01-01
An on-chip reference generator is conceived by adopting the technique of decimating a pseudo-random binary sequence (PRBS) signal in parallel sequences. This is of great benefit when high-speed generation of PRBS and PRBS-derived signals is the objective. The design implemented standard CMOS logic is available in commercial libraries to provide the logic functions for the generator. The design allows the user to select the periodicity of the PRBS and the PRBS-derived signals. The characterization of the on-chip generator marks its performance and reveals promising specifications
Poo, Jorge Luis; Galán, Juan Francisco; Rosete, Alejandra; de Lago, Alberto; Oliva, Iván; González-de la Parra, Mario; Jiménez, Patricia; Burke-Fraga, Victoria; Namur, Salvador
2008-04-01
Omeprazole is a proton-pump inhibitor that acts to reduce acid secretion in the stomach and is used for treating various acid-related gastrointestinal disorders. There are several generic formulations of omeprazole available in Mexico; however, a literature search failed to identify published data concerning the bioavailability of these formulations in the Mexican population. The aim of this study was to compare the bioavailability of 2 oral formulations of omeprazole 20-mg capsules, marketed for use in Mexico, in healthy volunteers: Inhibitron (test formulation) and LosecA 20 mg (reference formulation). This study used a single-dose, open-label, randomized sequence, 2 x 2 crossover (2 administration periods x 2 treatments) design to compare the 2 formulations. Eligible subjects were healthy adult Mexican volunteers of both sexes. Subjects were randomly assigned in a 1:1 ratio to receive a single 20-mg dose of the test formulation followed by the reference formulation, or vice versa, with a 7-day washout period between administration periods. After a 12-hour (overnight) fast, subjects received a single, 20-mg dose of the corresponding formulation. Plasma samples were obtained over a 12-hour period after administration. Plasma omeprazole concentrations were analyzed by a nonstereospecific high-performance liquid chromatography method. For analysis of pharmacokinetic properties, including C(max), AUC from time 0 (baseline) to time t (AUC(0-t)), and AUC from baseline to infinity (AUC(0-infinity)), blood samples were drawn at baseline and 0.17, 0.33, 0.50, 0.75, 1, 1.25, 1.50, 1.75, 2, 2.50, 3, 4, 6, 8, and 12 hours after administration. The formulations were considered bioequivalent if the natural log (ln)-transformed ratios of C(max) and AUC were within the predetermined equivalence range of 80% to 125%, and if P disability, or required intervention to prevent permanent impairment or damage. Thirty-four subjects were enrolled and completed the study (25 men and 9
Optical orthogonal code-division multiple-access system - Part 2: Multibits/sequence-period OOCDMA
Kwon, Hyuck M.
1994-08-01
In a recently proposed optical orthogonal code division multiple-access (OOCDMA) system, one bit of user's data is transmitted per sequence-period, and a threshold is employed for the final bit decision. In this paper, a system that can transmit multibits per sequence-period is introduced, and avalanche photodiode (APD) noise, thermal noise, and interference, are included. This system, derived by exploiting orthogonal properties of the OOCDMA code sequence and using a maximum search (instead of a threshold) in the final decision, is log(sub 2) F times higher in throughput, where F is sequence-period. For example, four orders of magnitude are better in bit error probability at - 56 dBW received laser power, with F = 1000 chips, 10 'marks' in a sequence, and 10 users of 30 Mb/s data rate for one-bit/sequence-period and 270 Mb/s data rate for multibits/sequence-period system. Furthermore, an exact analysis is performed for the log(sub 2)F bits/sequence-period system with a hard-limiter placed before the receiver, and its performance is compared to the performance without hard-limiter, for the chip-synchronous case. The improvement from using a hard-limiter is significant in the log(sub 2)F bits/sequence-period OCCDMA system.
A symbolic dynamics approach for the complexity analysis of chaotic pseudo-random sequences
International Nuclear Information System (INIS)
Xiao Fanghong
2004-01-01
By considering a chaotic pseudo-random sequence as a symbolic sequence, authors present a symbolic dynamics approach for the complexity analysis of chaotic pseudo-random sequences. The method is applied to the cases of Logistic map and one-way coupled map lattice to demonstrate how it works, and a comparison is made between it and the approximate entropy method. The results show that this method is applicable to distinguish the complexities of different chaotic pseudo-random sequences, and it is superior to the approximate entropy method
Sequence periodicity in nucleosomal DNA and intrinsic curvature.
Nair, T Murlidharan
2010-05-17
Most eukaryotic DNA contained in the nucleus is packaged by wrapping DNA around histone octamers. Histones are ubiquitous and bind most regions of chromosomal DNA. In order to achieve smooth wrapping of the DNA around the histone octamer, the DNA duplex should be able to deform and should possess intrinsic curvature. The deformability of DNA is a result of the non-parallelness of base pair stacks. The stacking interaction between base pairs is sequence dependent. The higher the stacking energy the more rigid the DNA helix, thus it is natural to expect that sequences that are involved in wrapping around the histone octamer should be unstacked and possess intrinsic curvature. Intrinsic curvature has been shown to be dictated by the periodic recurrence of certain dinucleotides. Several genome-wide studies directed towards mapping of nucleosome positions have revealed periodicity associated with certain stretches of sequences. In the current study, these sequences have been analyzed with a view to understand their sequence-dependent structures. Higher order DNA structures and the distribution of molecular bend loci associated with 146 base nucleosome core DNA sequence from C. elegans and chicken have been analyzed using the theoretical model for DNA curvature. The curvature dispersion calculated by cyclically permuting the sequences revealed that the molecular bend loci were delocalized throughout the nucleosome core region and had varying degrees of intrinsic curvature. The higher order structures associated with nucleosomes of C.elegans and chicken calculated from the sequences revealed heterogeneity with respect to the deviation of the DNA axis. The results points to the possibility of context dependent curvature of varying degrees to be associated with nucleosomal DNA.
Correlations of pseudo-random numbers of multiplicative sequence
International Nuclear Information System (INIS)
Bukin, A.D.
1989-01-01
An algorithm is suggested for searching with a computer in unit n-dimensional cube the sets of planes where all the points fall whose coordinates are composed of n successive pseudo-random numbers of multiplicative sequence. This effect should be taken into account in Monte-Carlo calculations with definite constructive dimension. The parameters of these planes are obtained for three random number generators. 2 refs.; 2 tabs
On the Periods of the {ranshi} Random Number Generator
Gutbrod, F.
The stochastic properties of the pseudo-random number generator {ranshi} are discussed, with emphasis on the average period. Within a factor 2 this turns out to be the root of the maximally possible period. The actual set of periods depends on minor details of the algorithm, and the system settles down in one of only a few different cycles. These features are in perfect agreement with absolute random motion in phase space, to the extent allowed by deterministic dynamics.
Perceptions of randomness in binary sequences: Normative, heuristic, or both?
Reimers, Stian; Donkin, Chris; Le Pelley, Mike E
2018-03-01
When people consider a series of random binary events, such as tossing an unbiased coin and recording the sequence of heads (H) and tails (T), they tend to erroneously rate sequences with less internal structure or order (such as HTTHT) as more probable than sequences containing more structure or order (such as HHHHH). This is traditionally explained as a local representativeness effect: Participants assume that the properties of long sequences of random outcomes-such as an equal proportion of heads and tails, and little internal structure-should also apply to short sequences. However, recent theoretical work has noted that the probability of a particular sequence of say, heads and tails of length n, occurring within a larger (>n) sequence of coin flips actually differs by sequence, so P(HHHHH) rational norms based on limited experience. We test these accounts. Participants in Experiment 1 rated the likelihood of occurrence for all possible strings of 4, 5, and 6 observations in a sequence of coin flips. Judgments were better explained by representativeness in alternation rate, relative proportion of heads and tails, and sequence complexity, than by objective probabilities. Experiments 2 and 3 gave similar results using incentivized binary choice procedures. Overall the evidence suggests that participants are not sensitive to variation in objective probabilities of a sub-sequence occurring; they appear to use heuristics based on several distinct forms of representativeness. Copyright © 2017 Elsevier B.V. All rights reserved.
Chaos, periodic chaos, and the random-walk problem
International Nuclear Information System (INIS)
Kozak, J.J.; Musho, M.K.; Hatlee, M.D.
1982-01-01
The authors have studied whether numerically generated sequences from the logistic parabola f/sub b/(x) = 4bx(1-x) with b,xelement of[0,1], for values of b above the Feigenbaum critical value b/sub infinity/, are truly chaotic or whether they are periodic but with exceedingly large periods and very long transients. Using the logistic parabola the authors calculate via Monte Carlo simulation the average walk length for trapping on a one-dimensional lattice with a centrosymmetric trap. Comparison with exact results suggests that the only ''truly chaotic'' sequence is the one for which b = 1
Cryptographic pseudo-random sequence from the spatial chaotic map
International Nuclear Information System (INIS)
Sun Fuyan; Liu Shutang
2009-01-01
A scheme for pseudo-random binary sequence generation based on the spatial chaotic map is proposed. In order to face the challenge of using the proposed PRBS in cryptography, the proposed PRBS is subjected to statistical tests which are the well-known FIPS-140-1 in the area of cryptography, and correlation properties of the proposed sequences are investigated. The proposed PRBS successfully passes all these tests. Results of statistical testing of the sequences are found encouraging. The results of statistical tests suggest strong candidature for cryptographic applications.
Persaud, Navindra
2005-01-01
Computer algorithms can only produce seemingly random or pseudorandom numbers whereas certain natural phenomena, such as the decay of radioactive particles, can be utilized to produce truly random numbers. In this study, the ability of humans to generate random numbers was tested in healthy adults. Subjects were simply asked to generate and dictate random numbers. Generated numbers were tested for uniformity, independence and information density. The results suggest that humans can generate random numbers that are uniformly distributed, independent of one another and unpredictable. If humans can generate sequences of random numbers then neural networks or forms of artificial intelligence, which are purported to function in ways essentially the same as the human brain, should also be able to generate sequences of random numbers. Elucidating the precise mechanism by which humans generate random number sequences and the underlying neural substrates may have implications in the cognitive science of decision-making. It is possible that humans use their random-generating neural machinery to make difficult decisions in which all expected outcomes are similar. It is also possible that certain people, perhaps those with neurological or psychiatric impairments, are less able or unable to generate random numbers. If the random-generating neural machinery is employed in decision making its impairment would have profound implications in matters of agency and free will.
Baumgarten, Daniel; Eichardt, Roland; Crevecoeur, Guillaume; Supriyanto, Eko; Haueisen, Jens
2013-01-01
Biomedical applications of magnetic nanoparticles require a precise knowledge of their biodistribution. From multi-channel magnetorelaxometry measurements, this distribution can be determined by means of inverse methods. It was recently shown that the combination of sequential inhomogeneous excitation fields in these measurements is favorable regarding the reconstruction accuracy when compared to homogeneous activation . In this paper, approaches for the determination of activation sequences for these measurements are investigated. Therefor, consecutive activation of single coils, random activation patterns and families of m-sequences are examined in computer simulations involving a sample measurement setup and compared with respect to the relative condition number of the system matrix. We obtain that the values of this condition number decrease with larger number of measurement samples for all approaches. Random sequences and m-sequences reveal similar results with a significant reduction of the required number of samples. We conclude that the application of pseudo-random sequences for sequential activation in the magnetorelaxometry imaging of magnetic nanoparticles considerably reduces the number of required sequences while preserving the relevant measurement information.
Epidemic transmission on random mobile network with diverse infection periods
Li, Kezan; Yu, Hong; Zeng, Zhaorong; Ding, Yong; Ma, Zhongjun
2015-05-01
The heterogeneity of individual susceptibility and infectivity and time-varying topological structure are two realistic factors when we study epidemics on complex networks. Current research results have shown that the heterogeneity of individual susceptibility and infectivity can increase the epidemic threshold in a random mobile dynamical network with the same infection period. In this paper, we will focus on random mobile dynamical networks with diverse infection periods due to people's different constitutions and external circumstances. Theoretical results indicate that the epidemic threshold of the random mobile network with diverse infection periods is larger than the counterpart with the same infection period. Moreover, the heterogeneity of individual susceptibility and infectivity can play a significant impact on disease transmission. In particular, the homogeneity of individuals will avail to the spreading of epidemics. Numerical examples verify further our theoretical results very well.
Statistical distributions of optimal global alignment scores of random protein sequences
Directory of Open Access Journals (Sweden)
Tang Jiaowei
2005-10-01
Full Text Available Abstract Background The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function underlying the optimal global alignments has not been completely determined. Results In this study, random and real but unrelated sequences prepared in six different ways were selected as reference datasets to obtain their respective statistical distributions of global alignment scores. All alignments were carried out with the Needleman-Wunsch algorithm and optimal scores were fitted to the Gumbel, normal and gamma distributions respectively. The three-parameter gamma distribution performs the best as the theoretical distribution function of global alignment scores, as it agrees perfectly well with the distribution of alignment scores. The normal distribution also agrees well with the score distribution frequencies when the shape parameter of the gamma distribution is sufficiently large, for this is the scenario when the normal distribution can be viewed as an approximation of the gamma distribution. Conclusion We have shown that the optimal global alignment scores of random protein sequences fit the three-parameter gamma distribution function. This would be useful for the inference of homology between sequences whose relationship is unknown, through the evaluation of gamma distribution significance between sequences.
Prediction of Protein Hotspots from Whole Protein Sequences by a Random Projection Ensemble System
Directory of Open Access Journals (Sweden)
Jinjian Jiang
2017-07-01
Full Text Available Hotspot residues are important in the determination of protein-protein interactions, and they always perform specific functions in biological processes. The determination of hotspot residues is by the commonly-used method of alanine scanning mutagenesis experiments, which is always costly and time consuming. To address this issue, computational methods have been developed. Most of them are structure based, i.e., using the information of solved protein structures. However, the number of solved protein structures is extremely less than that of sequences. Moreover, almost all of the predictors identified hotspots from the interfaces of protein complexes, seldom from the whole protein sequences. Therefore, determining hotspots from whole protein sequences by sequence information alone is urgent. To address the issue of hotspot predictions from the whole sequences of proteins, we proposed an ensemble system with random projections using statistical physicochemical properties of amino acids. First, an encoding scheme involving sequence profiles of residues and physicochemical properties from the AAindex1 dataset is developed. Then, the random projection technique was adopted to project the encoding instances into a reduced space. Then, several better random projections were obtained by training an IBk classifier based on the training dataset, which were thus applied to the test dataset. The ensemble of random projection classifiers is therefore obtained. Experimental results showed that although the performance of our method is not good enough for real applications of hotspots, it is very promising in the determination of hotspot residues from whole sequences.
Scaling Limit of Symmetric Random Walk in High-Contrast Periodic Environment
Piatnitski, A.; Zhizhina, E.
2017-11-01
The paper deals with the asymptotic properties of a symmetric random walk in a high contrast periodic medium in Z^d, d≥1. From the existing homogenization results it follows that under diffusive scaling the limit behaviour of this random walk need not be Markovian. The goal of this work is to show that if in addition to the coordinate of the random walk in Z^d we introduce an extra variable that characterizes the position of the random walk inside the period then the limit dynamics of this two-component process is Markov. We describe the limit process and observe that the components of the limit process are coupled. We also prove the convergence in the path space for the said random walk.
Non-periodic pseudo-random numbers used in Monte Carlo calculations
Barberis, Gaston E.
2007-09-01
The generation of pseudo-random numbers is one of the interesting problems in Monte Carlo simulations, mostly because the common computer generators produce periodic numbers. We used simple pseudo-random numbers generated with the simplest chaotic system, the logistic map, with excellent results. The numbers generated in this way are non-periodic, which we demonstrated for 1013 numbers, and they are obtained in a deterministic way, which allows to repeat systematically any calculation. The Monte Carlo calculations are the ideal field to apply these numbers, and we did it for simple and more elaborated cases. Chemistry and Information Technology use this kind of simulations, and the application of this numbers to quantum Monte Carlo and cryptography is immediate. I present here the techniques to calculate, analyze and use these pseudo-random numbers, show that they lack periodicity up to 1013 numbers and that they are not correlated.
Non-periodic pseudo-random numbers used in Monte Carlo calculations
International Nuclear Information System (INIS)
Barberis, Gaston E.
2007-01-01
The generation of pseudo-random numbers is one of the interesting problems in Monte Carlo simulations, mostly because the common computer generators produce periodic numbers. We used simple pseudo-random numbers generated with the simplest chaotic system, the logistic map, with excellent results. The numbers generated in this way are non-periodic, which we demonstrated for 10 13 numbers, and they are obtained in a deterministic way, which allows to repeat systematically any calculation. The Monte Carlo calculations are the ideal field to apply these numbers, and we did it for simple and more elaborated cases. Chemistry and Information Technology use this kind of simulations, and the application of this numbers to quantum Monte Carlo and cryptography is immediate. I present here the techniques to calculate, analyze and use these pseudo-random numbers, show that they lack periodicity up to 10 13 numbers and that they are not correlated
Liu, Yan-Mei; Liu, Yun; Lu, Chuan; Jia, Jing-Ying; Liu, Gang-Yi; Weng, Li-Ping; Wang, Jia-Yan; Li, Guo-Xiu; Wang, Wei; Li, Shui-Jun; Yu, Chen
2010-11-01
Acetylcysteine may be used as a muco- lytic agent for the treatment of chronic bronchitis, chronic obstructive pulmonary disease, and other pulmonary diseases complicated by the production of viscous mucus. However, little is known of its pharmacokinetic properties when given orally in healthy volunteers, particularly in a Chinese Han population. This study was conducted to provide support for the marketing of a generic product in China. The purpose of this study was to compare the pharmacokinetics and relative bioavailability of a generic test formulation and a branded reference formulation of acetylcysteine in fasting healthy Chinese male volunteers. A single-dose, open-label, randomized-sequence, 2-period crossover design with a 7-day washout period between doses was used in this study. Healthy Chinese male nonsmokers aged 18 to 40 years with a body mass index (BMI) of 19 to 25 kg/m(2) were selected. Eligible volunteers were randomly assigned to receive acetylcysteine 600 mg PO as either the test formulation (3 tablets of 200 mg each) or reference formulation (1 tablet of 600 mg) under fasting conditions. A total of 15 serial blood samples were collected over a 24-hour interval, and total plasma acetylcysteine concentrations were analyzed by a validated liquid chromatography-isotopic dilution mass spectrometry method. Pharmacokinetic parameters (C(max), T(max), t(½) AUC(0-t), and AUC(0-∞) were calculated and analyzed statistically. The 2 formulations were considered bioequivalent if the 90% CIs of the log-transformed ratios (test/reference) of C(max) and AUC were within the predetermined bioequivalence ranges (70%-143% for C(max); 80%-125% for AUC), as established by the State Food and Drug Administration of China. Tolerability was determined by vital signs, clinical laboratory tests, 12-lead ECGs, physical examinations, and interviews with the subjects about adverse events (AEs). A total of 24 healthy Chinese Han male volunteers were enrolled in and
Fast convergence of spike sequences to periodic patterns in recurrent networks
International Nuclear Information System (INIS)
Jin, Dezhe Z.
2002-01-01
The dynamical attractors are thought to underlie many biological functions of recurrent neural networks. Here we show that stable periodic spike sequences with precise timings are the attractors of the spiking dynamics of recurrent neural networks with global inhibition. Almost all spike sequences converge within a finite number of transient spikes to these attractors. The convergence is fast, especially when the global inhibition is strong. These results support the possibility that precise spatiotemporal sequences of spikes are useful for information encoding and processing in biological neural networks
Random Sequence for Optimal Low-Power Laser Generated Ultrasound
Vangi, D.; Virga, A.; Gulino, M. S.
2017-08-01
Low-power laser generated ultrasounds are lately gaining importance in the research world, thanks to the possibility of investigating a mechanical component structural integrity through a non-contact and Non-Destructive Testing (NDT) procedure. The ultrasounds are, however, very low in amplitude, making it necessary to use pre-processing and post-processing operations on the signals to detect them. The cross-correlation technique is used in this work, meaning that a random signal must be used as laser input. For this purpose, a highly random and simple-to-create code called T sequence, capable of enhancing the ultrasound detectability, is introduced (not previously available at the state of the art). Several important parameters which characterize the T sequence can influence the process: the number of pulses Npulses , the pulse duration δ and the distance between pulses dpulses . A Finite Element FE model of a 3 mm steel disk has been initially developed to analytically study the longitudinal ultrasound generation mechanism and the obtainable outputs. Later, experimental tests have shown that the T sequence is highly flexible for ultrasound detection purposes, making it optimal to use high Npulses and δ but low dpulses . In the end, apart from describing all phenomena that arise in the low-power laser generation process, the results of this study are also important for setting up an effective NDT procedure using this technology.
Lower bounds on the periodic Hamming correlations of frequency hopping sequences with low hit zone
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
In this paper, several periodic Hamming correlation lower bounds for frequency hopping sequences with low hit zone, with respect to the size p of the frequency slot set, the sequence length L, the family size M, low hit zone LH ( or no hit zone NH ), the maximum periodic Hamming autocorrelation sidelobe Ha and the maximum periodic Hamming crosscorrelation Hc, are established. It is shown that the new bounds include the known Lempel-Greenberger bounds, T.S. Seay bounds and Peng-Fan bounds for the conventional frequency hopping sequences as special cases.
Systematic Onset of Periodic Patterns in Random Disk Packings
Topic, Nikola; Pöschel, Thorsten; Gallas, Jason A. C.
2018-04-01
We report evidence of a surprising systematic onset of periodic patterns in very tall piles of disks deposited randomly between rigid walls. Independently of the pile width, periodic structures are always observed in monodisperse deposits containing up to 1 07 disks. The probability density function of the lengths of disordered transient phases that precede the onset of periodicity displays an approximately exponential tail. These disordered transients may become very large when the channel width grows without bound. For narrow channels, the probability density of finding periodic patterns of a given period displays a series of discrete peaks, which, however, are washed out completely when the channel width grows.
Frequency characteristics of coordinate sequences of linear recurrences over Galois rings
Kamlovskii, O. V.
2013-12-01
We consider some properties of the coordinate sequences of linear recurrences over Galois rings which characterize the possibility of regarding them as pseudo-random sequences. We study the periodicity properties, linear complexity and frequency characteristics of these sequences. Up to now, these parameters have been studied mainly in the case when the linear recurring sequence has maximal possible period. We investigate the coordinate sequences of linear recurrences of not necessarily maximal period. We obtain sharpened and generalized estimates for the number of elements and r-patterns on the cycles and intervals of these sequences.
Frequency characteristics of coordinate sequences of linear recurrences over Galois rings
International Nuclear Information System (INIS)
Certification Research Center, Moscow (Russian Federation))" data-affiliation=" (LLC Certification Research Center, Moscow (Russian Federation))" >Kamlovskii, O V
2013-01-01
We consider some properties of the coordinate sequences of linear recurrences over Galois rings which characterize the possibility of regarding them as pseudo-random sequences. We study the periodicity properties, linear complexity and frequency characteristics of these sequences. Up to now, these parameters have been studied mainly in the case when the linear recurring sequence has maximal possible period. We investigate the coordinate sequences of linear recurrences of not necessarily maximal period. We obtain sharpened and generalized estimates for the number of elements and r-patterns on the cycles and intervals of these sequences
Srichaiya, Arunee; Longchoopol, Chaowanee; Oo-Puthinan, Sarawut; Sayasathid, Jarun; Sripalakit, Pattana; Viyoch, Jarupa
2008-10-01
Lamotrigine is an antiepileptic drug which has been used in the treatment of epilepsy and bipolar disorder. A search of the literature did not find previously published bioequivalence and pharmacokinetic evaluations of lamotrigine in healthy Thai male volunteers. The aim of this study was to compare the pharmacokinetic parameters between 2 brands of lamotrigine in healthy Thai male volunteers. A randomized, single-dose, 2-period, 2-sequence, crossover study design with a 2-week washout period was conducted in healthy Thai males. Subjects were randomized to receive either the test or reference formulation in the first period. All subjects were required to be nonsmokers and without a history of alcohol or drug abuse. Plasma samples were collected over a 120-hour period after 100-mg lamotrigine administration in each period. A validated high-performance liquid chromatography ultraviolet method was used to analyze lamotrigine concentration in plasma. Pharmacokinetic parameters were determined using a noncompartmental method. Bioequivalence between the test and reference products, as defined by the US Food and Drug Administration (FDA), is determined when the ratio for the 90% CIs of the difference in the means of the log-transformed AUC(0-t), AUC(0-infinity), and C(max) of the 2 products are within 0.80 and 1.25. Adverse events were determined by measuring vital signs after dosing. Subjects were also asked if they suffered from undesirable effects such as nausea, vomiting, dizziness, and headache. This bioequivalence study was performed in 24 healthy Thai males (mean [SD] age, 20.5 [1.3] years; range, 19-24 years; weight, 62.5 [7.4] kg; height, 172.8 [6.9] cm; body mass index, 20.9 [2.0] kg/m(2)). The mean (SD) C(max) and T(max) of the test formulation of lamotrigine were 1.7 (0.3) microg/mL and 1.2 (0.9) hours, respectively. The mean (SD) C(max) and T(max) of the reference formulation of lamotrigine were 1.7 (0.3) microg/mL and 1.4 (1.0) hours, respectively. The mean
Shi, Shaojun; Liu, Yani; Wu, Jianhong; Li, Zhongfang; Zhao, Yan; Zhong, Dafang; Zeng, Fandian
2010-10-01
The proprietary formulation of fluoxetine hydrochloride is an antidepressant of the selective serotonin reuptake inhibitor class. Pharmacokinetic studies investigating the bioequivalence of generic and branded formulations are needed to market generic fluoxetine in China. The aim of this study was to compare the bioavailability and tolerability of the proposed generic formulation with the established reference formulation of fluoxetine hydrochloride 20 mg in a fasting, healthy Chinese male population. This 10-week, open-label, randomized-sequence, single-dose, 2-period crossover study was conducted in healthy native Han Chinese male volunteers. Eligible subjects were randomly assigned in a 1:1 ratio to receive a single 20-mg dose of the test or reference formulation, followed by a 35-day washout period and administration of the alternate formulation. Doses were administered after a 12-hour overnight fast. For analysis of pharmacokinetic properties (including C(max), T(max), AUC(0-t), AUC(0-∞), and t(½)), blood samples were obtained over a 672-hour period after dosing. Plasma concentrations of fluoxetine and its active metabolite, norfluoxetine, were analyzed using a validated LC-MS/MS method. The formulations were to be considered bioequivalent if the ln-transformed ratios (test/ reference) of C(max) and AUC were within the predetermined bioequivalence range of 80% to 125%, as established by the US Food and Drug Administration, and if the P values were fasting, healthy Chinese male volunteers. Both formulations appeared to be well tolerated. Copyright © 2010 Excerpta Medica Inc. All rights reserved.
Automatic generation of randomized trial sequences for priming experiments.
Ihrke, Matthias; Behrendt, Jörg
2011-01-01
In most psychological experiments, a randomized presentation of successive displays is crucial for the validity of the results. For some paradigms, this is not a trivial issue because trials are interdependent, e.g., priming paradigms. We present a software that automatically generates optimized trial sequences for (negative-) priming experiments. Our implementation is based on an optimization heuristic known as genetic algorithms that allows for an intuitive interpretation due to its similarity to natural evolution. The program features a graphical user interface that allows the user to generate trial sequences and to interactively improve them. The software is based on freely available software and is released under the GNU General Public License.
Reduction of construction periods of PWRs by optimization of detailed sequence planning
International Nuclear Information System (INIS)
Stocker, W.; Leverenz, R.
1991-01-01
The construction of PWR's is an enterprise with high investment costs, in total up to three billion US$ and with long construction periods of five years and more. Besides the results reached by the intensive standardization, a further reduction of the construction period is possible by optimization of detailed sequence planning and interfaces of work units. During the execution of the three German Convoy plants ISAR 2, EMSLAND and NECKARWESTHEIM 2, the contractual construction periods were shortened between 4 and 8 months. These reductions were reached after individual investigations by measures like advanced finishing work activities; erection of an increased amount of prefabricated pipings; rearrangement of erection sequences; overlapping of piping erection and electrical installation; reduction of plant commissioning period. All these measures support directly the reduction of the total investment cost of a plant, as already demonstrated by the Convoy plants. (author). 8 figs
Network clustering coefficient approach to DNA sequence analysis
Energy Technology Data Exchange (ETDEWEB)
Gerhardt, Guenther J.L. [Universidade Federal do Rio Grande do Sul-Hospital de Clinicas de Porto Alegre, Rua Ramiro Barcelos 2350/sala 2040/90035-003 Porto Alegre (Brazil); Departamento de Fisica e Quimica da Universidade de Caxias do Sul, Rua Francisco Getulio Vargas 1130, 95001-970 Caxias do Sul (Brazil); Lemke, Ney [Programa Interdisciplinar em Computacao Aplicada, Unisinos, Av. Unisinos, 950, 93022-000 Sao Leopoldo, RS (Brazil); Corso, Gilberto [Departamento de Biofisica e Farmacologia, Centro de Biociencias, Universidade Federal do Rio Grande do Norte, Campus Universitario, 59072 970 Natal, RN (Brazil)]. E-mail: corso@dfte.ufrn.br
2006-05-15
In this work we propose an alternative DNA sequence analysis tool based on graph theoretical concepts. The methodology investigates the path topology of an organism genome through a triplet network. In this network, triplets in DNA sequence are vertices and two vertices are connected if they occur juxtaposed on the genome. We characterize this network topology by measuring the clustering coefficient. We test our methodology against two main bias: the guanine-cytosine (GC) content and 3-bp (base pairs) periodicity of DNA sequence. We perform the test constructing random networks with variable GC content and imposed 3-bp periodicity. A test group of some organisms is constructed and we investigate the methodology in the light of the constructed random networks. We conclude that the clustering coefficient is a valuable tool since it gives information that is not trivially contained in 3-bp periodicity neither in the variable GC content.
GenRGenS: Software for Generating Random Genomic Sequences and Structures
Ponty , Yann; Termier , Michel; Denise , Alain
2006-01-01
International audience; GenRGenS is a software tool dedicated to randomly generating genomic sequences and structures. It handles several classes of models useful for sequence analysis, such as Markov chains, hidden Markov models, weighted context-free grammars, regular expressions and PROSITE expressions. GenRGenS is the only program that can handle weighted context-free grammars, thus allowing the user to model and to generate structured objects (such as RNA secondary structures) of any giv...
RANDOMNUMBERS, Random Number Sequence Generated from Gas Ionisation Chamber Data
International Nuclear Information System (INIS)
Frigerio, N.A.; Sanathanan, L.P.; Morley, M.; Tyler, S.A.; Clark, N.A.; Wang, J.
1989-01-01
1 - Description of problem or function: RANDOM NUMBERS is a data collection of almost 2.7 million 31-bit random numbers generated by using a high resolution gas ionization detector chamber in conjunction with a 4096-channel multichannel analyzer to record the radioactive decay of alpha particles from a U-235 source. The signals from the decaying alpha particles were fed to the 4096-channel analyzer, and for each channel the frequency of signals registered in a 20,000-microsecond interval was recorded. The parity bits of these frequency counts, 0 for an even count and 1 for and odd count, were then assembled in sequence to form 31-bit random numbers and transcribed onto magnetic tape. This cycle was repeated to obtain the random numbers. 2 - Method of solution: The frequency distribution of counts from the device conforms to the Brockwell-Moyal distribution which takes into account the dead time of the counter. The count data were analyzed and tests for randomness on a sample indicate that the device is a highly reliable source of truly random numbers. 3 - Restrictions on the complexity of the problem: The RANDOM NUMBERS tape contains 2,669,568 31-bit numbers
Lotka-Volterra systems in environments with randomly disordered temporal periodicity
Naess, Arvid; Dimentberg, Michael F.; Gaidai, Oleg
2008-08-01
A generalized Lotka-Volterra model for a pair of interacting populations of predators and prey is studied. The model accounts for the prey’s interspecies competition and therefore is asymptotically stable, whereas its oscillatory behavior is induced by temporal variations in environmental conditions simulated by those in the prey’s reproduction rate. Two models of the variations are considered, each of them combining randomness with “hidden” periodicity. The stationary joint probability density function (PDF) of the number of predators and prey is calculated numerically by the path integration (PI) method based on the use of characteristic functions and the fast Fourier transform. The numerical results match those for the asymptotic case of white-noise variations for which an analytical solution is available. Several examples are studied, with calculations of important characteristics of oscillations, for example the expected rate of up-crossings given the level of the predator number. The calculated PDFs may be of predominantly random (unimodal) or predominantly periodic nature (bimodal). Thus, the PI method has been demonstrated to be a powerful tool for studies of the dynamics of predator-prey pairs. The method captures the random oscillations as observed in nature, taking into account potential periodicity in the environmental conditions.
Random and externally controlled occurrences of Dansgaard–Oeschger events
Directory of Open Access Journals (Sweden)
J. Lohmann
2018-05-01
Full Text Available Dansgaard–Oeschger (DO events constitute the most pronounced mode of centennial to millennial climate variability of the last glacial period. Since their discovery, many decades of research have been devoted to understand the origin and nature of these rapid climate shifts. In recent years, a number of studies have appeared that report emergence of DO-type variability in fully coupled general circulation models via different mechanisms. These mechanisms result in the occurrence of DO events at varying degrees of regularity, ranging from periodic to random. When examining the full sequence of DO events as captured in the North Greenland Ice Core Project (NGRIP ice core record, one can observe high irregularity in the timing of individual events at any stage within the last glacial period. In addition to the prevailing irregularity, certain properties of the DO event sequence, such as the average event frequency or the relative distribution of cold versus warm periods, appear to be changing throughout the glacial. By using statistical hypothesis tests on simple event models, we investigate whether the observed event sequence may have been generated by stationary random processes or rather was strongly modulated by external factors. We find that the sequence of DO warming events is consistent with a stationary random process, whereas dividing the event sequence into warming and cooling events leads to inconsistency with two independent event processes. As we include external forcing, we find a particularly good fit to the observed DO sequence in a model where the average residence time in warm periods are controlled by global ice volume and cold periods by boreal summer insolation.
Random and externally controlled occurrences of Dansgaard-Oeschger events
Lohmann, Johannes; Ditlevsen, Peter D.
2018-05-01
Dansgaard-Oeschger (DO) events constitute the most pronounced mode of centennial to millennial climate variability of the last glacial period. Since their discovery, many decades of research have been devoted to understand the origin and nature of these rapid climate shifts. In recent years, a number of studies have appeared that report emergence of DO-type variability in fully coupled general circulation models via different mechanisms. These mechanisms result in the occurrence of DO events at varying degrees of regularity, ranging from periodic to random. When examining the full sequence of DO events as captured in the North Greenland Ice Core Project (NGRIP) ice core record, one can observe high irregularity in the timing of individual events at any stage within the last glacial period. In addition to the prevailing irregularity, certain properties of the DO event sequence, such as the average event frequency or the relative distribution of cold versus warm periods, appear to be changing throughout the glacial. By using statistical hypothesis tests on simple event models, we investigate whether the observed event sequence may have been generated by stationary random processes or rather was strongly modulated by external factors. We find that the sequence of DO warming events is consistent with a stationary random process, whereas dividing the event sequence into warming and cooling events leads to inconsistency with two independent event processes. As we include external forcing, we find a particularly good fit to the observed DO sequence in a model where the average residence time in warm periods are controlled by global ice volume and cold periods by boreal summer insolation.
A measurement of disorder in binary sequences
Gong, Longyan; Wang, Haihong; Cheng, Weiwen; Zhao, Shengmei
2015-03-01
We propose a complex quantity, AL, to characterize the degree of disorder of L-length binary symbolic sequences. As examples, we respectively apply it to typical random and deterministic sequences. One kind of random sequences is generated from a periodic binary sequence and the other is generated from the logistic map. The deterministic sequences are the Fibonacci and Thue-Morse sequences. In these analyzed sequences, we find that the modulus of AL, denoted by |AL | , is a (statistically) equivalent quantity to the Boltzmann entropy, the metric entropy, the conditional block entropy and/or other quantities, so it is a useful quantitative measure of disorder. It can be as a fruitful index to discern which sequence is more disordered. Moreover, there is one and only one value of |AL | for the overall disorder characteristics. It needs extremely low computational costs. It can be easily experimentally realized. From all these mentioned, we believe that the proposed measure of disorder is a valuable complement to existing ones in symbolic sequences.
Frequency response testing at Experimental Breeder Reactor II using discrete-level periodic signals
International Nuclear Information System (INIS)
Rhodes, W.D.; Larson, H.A.
1990-01-01
The Experimental Breeder Reactor 2 (EBR-2) reactivity-to-power frequency-response function was measured with pseudo-random, discrete-level, periodic signals. The reactor power deviation was small with insignificant perturbation of normal operation and in-place irradiation experiments. Comparison of results with measured rod oscillator data and with theoretical predictions show good agreement. Moreover, measures of input signal quality (autocorrelation function and energy spectra) confirm the ability to enable this type of frequency response determination at EBR-2. Measurements were made with the pseudo-random binary sequence, quadratic residue binary sequence, pseudo-random ternary sequence, and the multifrequency binary sequence. 10 refs., 7 figs., 3 tabs
Pascale, Raffaella; Grossi, Gerarda; Cruciani, Gabriele; Mecca, Giansalvatore; Santoro, Donatello; Sarli Calace, Renzo; Falabella, Patrizia; Bianco, Giuliana
Sequence protein identification by a randomized sequence database and transcriptome mass spectrometry software package has been developed at the University of Basilicata in Potenza (Italy) and designed to facilitate the determination of the amino acid sequence of a peptide as well as an unequivocal identification of proteins in a high-throughput manner with enormous advantages of time, economical resource and expertise. The software package is a valid tool for the automation of a de novo sequencing approach, overcoming the main limits and a versatile platform useful in the proteomic field for an unequivocal identification of proteins, starting from tandem mass spectrometry data. The strength of this software is that it is a user-friendly and non-statistical approach, so protein identification can be considered unambiguous.
Directory of Open Access Journals (Sweden)
Аndriy V. Sadchenko
2015-12-01
Full Text Available Digital television systems need to ensure that all digital signals processing operations are performed simultaneously and consistently. Frame synchronization dictated by the need to match phases of transmitter and receiver so that it would be possible to identify the start of a frame. As a frame synchronization signals are often used long length binary sequence with good aperiodic autocorrelation function. Aim: This work is dedicated to the development of the algorithm of random length sequences synthesis. Materials and Methods: The paper provides a comparative analysis of the known sequences, which can be used at present as synchronization ones, revealed their advantages and disadvantages. This work proposes the algorithm for the synthesis of binary synchronization sequences of random length with good autocorrelation properties based on noise generator with a uniform distribution law of probabilities. A "white noise" semiconductor generator is proposed to use as the initial material for the synthesis of binary sequences with desired properties. Results: The statistical analysis of the initial implementations of the "white noise" and synthesized sequences for frame synchronization of digital television is conducted. The comparative analysis of the synthesized sequences with known ones was carried out. The results show the benefits of obtained sequences in compare with known ones. The performed simulations confirm the obtained results. Conclusions: Thus, the search algorithm of binary synchronization sequences with desired autocorrelation properties received. According to this algorithm, the sequence can be longer in length and without length limitations. The received sync sequence can be used for frame synchronization in modern digital communication systems that will increase their efficiency and noise immunity.
Random sequences are an abundant source of bioactive RNAs or peptides
DEFF Research Database (Denmark)
Neme, Rafik; Amador, Cristina; Yildirim, Burcin
2017-01-01
It is generally assumed that new genes arise through duplication and/or recombination of existing genes. The probability that a new functional gene could arise out of random non-coding DNA is so far considered to be negligible, as it seems unlikely that such an RNA or protein sequence could have ...
International Nuclear Information System (INIS)
Yan Zhizhong; Zhang Chuanzeng; Wang Yuesheng
2011-01-01
The band structures of in-plane elastic waves propagating in two-dimensional phononic crystals with one-dimensional random disorder and aperiodicity are analyzed in this paper. The localization of wave propagation is discussed by introducing the concept of the localization factor, which is calculated by the plane-wave-based transfer-matrix method. By treating the random disorder and aperiodicity as the deviation from the periodicity in a special way, three kinds of aperiodic phononic crystals that have normally distributed random disorder, Thue-Morse and Rudin-Shapiro sequence in one direction and translational symmetry in the other direction are considered and the band structures are characterized using localization factors. Besides, as a special case, we analyze the band gap properties of a periodic planar layered composite containing a periodic array of square inclusions. The transmission coefficients based on eigen-mode matching theory are also calculated and the results show the same behaviors as the localization factor does. In the case of random disorders, the localization degree of the normally distributed random disorder is larger than that of the uniformly distributed random disorder although the eigenstates are both localized no matter what types of random disorders, whereas, for the case of Thue-Morse and Rudin-Shapiro structures, the band structures of Thue-Morse sequence exhibit similarities with the quasi-periodic (Fibonacci) sequence not present in the results of the Rudin-Shapiro sequence.
Yu, Ji-young; Song, Hyun Ho; Kim, Bo Gyeom; Park, Hyeon Ju; Choi, Kwang Sik; Kwon, Young Ee
2009-11-01
Chlorphenesin carbamate is a skeletal muscle relaxant approved in Korea for use in the treatment of pain and discomfort related to skeletal muscle trauma and inflammation. The aim of this study was to assess the bioequivalence of a generic formulation of chlorphenesin carbamate at doses of 250 and 500 mg and 2 branded formulations of the same doses in healthy Korean adults. This single-dose, randomized-sequence, open-label, 2-period crossover study was conducted in healthy Korean male and female volunteers. Subjects were assigned to receive, in a randomized sequence, a single dose of the generic (test) and branded (reference) formulations of chlorphenesin carbamate at a dose of 250 or 500 mg. Blood samples were drawn at 0, 0.33, 0.67, 1, 1.5, 2, 3, 4, 6, 9, 12, and 15 hours after administration. Pharmacokinetic properties (C(max), T(max), AUC(0-t) AUC(0-infinity), t(1/2), and ke) were determined using HPLC. The formulations were to be considered bioequivalent if the 90% CIs of the treatment ratios of the geometric means of C(max) and AUC(0-t) were within a predetermined range of log 0.80 to log 1.25 based on regulatory criteria. Tolerability was assessed by monitoring for adverse events (AEs) on physical examination and/or e-mail and personal interview at the beginning and end of each study period. Twenty-eight subjects (22 men, 6 women) received chlorphenesin carbamate at the 250-mg dose, and 24 male subjects received the 500-mg dose. The mean (SD) ages of the subjects were 24.0 (2.6) and 24.0 (1.9) years in the 250- and 500-mg groups, respectively. No significant differences were found between the test and reference formulations (90% CIs: C(max), 1.0048-1.1153 with the 250-mg dose and 0.9630-1.1189 with the 500-mg dose; AUC(0-t), 0.9882-1.0546 and 0.9842-1.0578, respectively). No clinically significant AEs (upper gastric pain, abdominal bloating, pyrexia, edema, nausea, heartburn, constipation, headache, dizziness, drowsiness, or fatigue) were reported throughout
ERP Indices of Stimulus Prediction in Letter Sequences
Directory of Open Access Journals (Sweden)
Edith Kaan
2014-10-01
Full Text Available Given the current focus on anticipation in perception, action and cognition, including language processing, there is a need for a method to tap into predictive processing in situations in which cue and feedback stimuli are not explicitly marked as such. To this aim, event related potentials (ERPs were obtained while participants viewed alphabetic letter sequences (“A”, “B”, “C”, “D”, “E”, …, in which the letters were highly predictable, and random sequences (“S”, “B”, “A”, “I”, “F”, “M”, …, without feedback. Occasionally, the presentation of a letter in a sequence was delayed by 300 ms. During this delay period, an increased negativity was observed for predictive versus random sequences. In addition, the early positivity following the delay was larger for predictive compared with random sequences. These results suggest that expectation-sensitive ERP modulations can be elicited in anticipation of stimuli that are not explicit targets, rewards, feedback or instructions, and that a delay can strengthen the prediction for a particular stimulus. Applications to language processing will be discussed.
Randomly modulated periodic signals in Alberta's electricity market
Energy Technology Data Exchange (ETDEWEB)
Hinich, M. [Texas Univ., Austin, TX (United States); Serletis, A. [Calgary Univ., AB (Canada)
2005-04-01
The physical laws that determine the delivery of power across a transmission grid require a synchronized energy balance between the injection of power at generating points and offtake at demand points. Grid operators must continuously monitor the demand process and respond quickly to fluctuations in demand. This paper presented a parametric statistical model called Randomly Modulated Periodicity (RMP) which examined Alberta's spot wholesale power market, defined on hourly intervals. The concern was to test for periodic signals that can be perfectly predicted far into the future. A univariate approach was taken, although it was acknowledged that from an economic perspective, the interest in the price of electricity is in its relationship with the electricity load as well as with the prices of other primary fuel commodities. Sections 2 and 3 of the paper discussed the RMP model for the study of periodic signals. In section 4, randomly modulated periodicity was tested in hourly electricity prices and MWh demand for Alberta, over the deregulated period after 1996. It was concluded that electricity prices have low coherence with daily and weekly cycles. The mean value at each half hour of the daily demand and the weekend demand yielded good forecasts after the end of the data series. It was suggested that a statistical forecasting based on historical demand and co-factors such as the average hourly temperature per day and patterns of industrial usage should yield better short term forecasts. The development of a statistical technology for forecasting electricity demand is a challenging area of research. 6 refs., 4 figs.
Minimization of Dead-Periods in MRI Pulse Sequences for Imaging Oblique Planes
Atalar, Ergin; McVeigh, Elliot R.
2007-01-01
With the advent of breath-hold MR cardiac imaging techniques, the minimization of TR and TE for oblique planes has become a critical issue. The slew rates and maximum currents of gradient amplifiers limit the minimum possible TR and TE by adding dead-periods to the pulse sequences. We propose a method of designing gradient waveforms that will be applied to the amplifiers instead of the slice, readout, and phase encoding waveforms. Because this method ensures that the gradient amplifiers will always switch at their maximum slew rate, it results in the minimum possible dead-period for given imaging parameters and scan plane position. A GRASS pulse sequence has been designed and ultra-short TR and TE values have been obtained with standard gradient amplifiers and coils. For some oblique slices, we have achieved shorter TR and TE values than those for nonoblique slices. PMID:7869900
Quality pseudo-random number generator
International Nuclear Information System (INIS)
Tarasiuk, J.
1996-01-01
The pseudo-random number generator (RNG) was written to match needs of nuclear and high-energy physics computation which in some cases require very long and independent random number sequences. In this random number generator the repetition period is about 10 36 what should be sufficient for all computers in the world. In this article the test results of RNG correlation, speed and identity of computations for PC, Sun4 and VAX computer tests are presented
Reduced randomness in quantum cryptography with sequences of qubits encoded in the same basis
International Nuclear Information System (INIS)
Lamoureux, L.-P.; Cerf, N. J.; Bechmann-Pasquinucci, H.; Gisin, N.; Macchiavello, C.
2006-01-01
We consider the cloning of sequences of qubits prepared in the states used in the BB84 or six-state quantum cryptography protocol, and show that the single-qubit fidelity is unaffected even if entire sequences of qubits are prepared in the same basis. This result is only valid provided that the sequences are much shorter than the total key. It is of great importance for practical quantum cryptosystems because it reduces the need for high-speed random number generation without impairing on the security against finite-size cloning attacks
Modeling Interdependent and Periodic Real-World Action Sequences
Kurashima, Takeshi; Althoff, Tim; Leskovec, Jure
2018-01-01
Mobile health applications, including those that track activities such as exercise, sleep, and diet, are becoming widely used. Accurately predicting human actions in the real world is essential for targeted recommendations that could improve our health and for personalization of these applications. However, making such predictions is extremely difficult due to the complexities of human behavior, which consists of a large number of potential actions that vary over time, depend on each other, and are periodic. Previous work has not jointly modeled these dynamics and has largely focused on item consumption patterns instead of broader types of behaviors such as eating, commuting or exercising. In this work, we develop a novel statistical model, called TIPAS, for Time-varying, Interdependent, and Periodic Action Sequences. Our approach is based on personalized, multivariate temporal point processes that model time-varying action propensities through a mixture of Gaussian intensities. Our model captures short-term and long-term periodic interdependencies between actions through Hawkes process-based self-excitations. We evaluate our approach on two activity logging datasets comprising 12 million real-world actions (e.g., eating, sleep, and exercise) taken by 20 thousand users over 17 months. We demonstrate that our approach allows us to make successful predictions of future user actions and their timing. Specifically, TIPAS improves predictions of actions, and their timing, over existing methods across multiple datasets by up to 156%, and up to 37%, respectively. Performance improvements are particularly large for relatively rare and periodic actions such as walking and biking, improving over baselines by up to 256%. This demonstrates that explicit modeling of dependencies and periodicities in real-world behavior enables successful predictions of future actions, with implications for modeling human behavior, app personalization, and targeting of health interventions. PMID
WEB-server for search of a periodicity in amino acid and nucleotide sequences
E Frenkel, F.; Skryabin, K. G.; Korotkov, E. V.
2017-12-01
A new web server (http://victoria.biengi.ac.ru/splinter/login.php) was designed and developed to search for periodicity in nucleotide and amino acid sequences. The web server operation is based upon a new mathematical method of searching for multiple alignments, which is founded on the position weight matrices optimization, as well as on implementation of the two-dimensional dynamic programming. This approach allows the construction of multiple alignments of the indistinctly similar amino acid and nucleotide sequences that accumulated more than 1.5 substitutions per a single amino acid or a nucleotide without performing the sequences paired comparisons. The article examines the principles of the web server operation and two examples of studying amino acid and nucleotide sequences, as well as information that could be obtained using the web server.
Direct generation of all-optical random numbers from optical pulse amplitude chaos.
Li, Pu; Wang, Yun-Cai; Wang, An-Bang; Yang, Ling-Zhen; Zhang, Ming-Jiang; Zhang, Jian-Zhong
2012-02-13
We propose and theoretically demonstrate an all-optical method for directly generating all-optical random numbers from pulse amplitude chaos produced by a mode-locked fiber ring laser. Under an appropriate pump intensity, the mode-locked laser can experience a quasi-periodic route to chaos. Such a chaos consists of a stream of pulses with a fixed repetition frequency but random intensities. In this method, we do not require sampling procedure and external triggered clocks but directly quantize the chaotic pulses stream into random number sequence via an all-optical flip-flop. Moreover, our simulation results show that the pulse amplitude chaos has no periodicity and possesses a highly symmetric distribution of amplitude. Thus, in theory, the obtained random number sequence without post-processing has a high-quality randomness verified by industry-standard statistical tests.
Warris, Sven; Boymans, Sander; Muiser, Iwe; Noback, Michiel; Krijnen, Wim; Nap, Jan-Peter
2014-01-13
Small RNAs are important regulators of genome function, yet their prediction in genomes is still a major computational challenge. Statistical analyses of pre-miRNA sequences indicated that their 2D structure tends to have a minimal free energy (MFE) significantly lower than MFE values of equivalently randomized sequences with the same nucleotide composition, in contrast to other classes of non-coding RNA. The computation of many MFEs is, however, too intensive to allow for genome-wide screenings. Using a local grid infrastructure, MFE distributions of random sequences were pre-calculated on a large scale. These distributions follow a normal distribution and can be used to determine the MFE distribution for any given sequence composition by interpolation. It allows on-the-fly calculation of the normal distribution for any candidate sequence composition. The speedup achieved makes genome-wide screening with this characteristic of a pre-miRNA sequence practical. Although this particular property alone will not be able to distinguish miRNAs from other sequences sufficiently discriminative, the MFE-based P-value should be added to the parameters of choice to be included in the selection of potential miRNA candidates for experimental verification.
Pseudo-Random Sequences Generated by a Class of One-Dimensional Smooth Map
Wang, Xing-Yuan; Qin, Xue; Xie, Yi-Xin
2011-08-01
We extend a class of a one-dimensional smooth map. We make sure that for each desired interval of the parameter the map's Lyapunov exponent is positive. Then we propose a novel parameter perturbation method based on the good property of the extended one-dimensional smooth map. We perturb the parameter r in each iteration by the real number xi generated by the iteration. The auto-correlation function and NIST statistical test suite are taken to illustrate the method's randomness finally. We provide an application of this method in image encryption. Experiments show that the pseudo-random sequences are suitable for this application.
Koschate, J; Drescher, U; Thieschäfer, L; Heine, O; Baum, K; Hoffmann, U
2016-12-01
This study aims to compare cardiorespiratory kinetics as a response to a standardised work rate protocol with pseudo-random binary sequences between cycling and walking in young healthy subjects. Muscular and pulmonary oxygen uptake (V̇O 2 ) kinetics as well as heart rate kinetics were expected to be similar for walking and cycling. Cardiac data and V̇O 2 of 23 healthy young subjects were measured in response to pseudo-random binary sequences. Kinetics were assessed applying time series analysis. Higher maxima of cross-correlation functions between work rate and the respective parameter indicate faster kinetics responses. Muscular V̇O 2 kinetics were estimated from heart rate and pulmonary V̇O 2 using a circulatory model. Muscular (walking vs. cycling [mean±SD in arbitrary units]: 0.40±0.08 vs. 0.41±0.08) and pulmonary V̇O 2 kinetics (0.35±0.06 vs. 0.35±0.06) were not different, although the time courses of the cross-correlation functions of pulmonary V̇O 2 showed unexpected biphasic responses. Heart rate kinetics (0.50±0.14 vs. 0.40±0.14; P=0.017) was faster for walking. Regarding the biphasic cross-correlation functions of pulmonary V̇O 2 during walking, the assessment of muscular V̇O 2 kinetics via pseudo-random binary sequences requires a circulatory model to account for cardio-dynamic distortions. Faster heart rate kinetics for walking should be considered by comparing results from cycle and treadmill ergometry. © Georg Thieme Verlag KG Stuttgart · New York.
Zheng, Guanglou; Fang, Gengfa; Shankaran, Rajan; Orgun, Mehmet A; Zhou, Jie; Qiao, Li; Saleem, Kashif
2017-05-01
Generating random binary sequences (BSes) is a fundamental requirement in cryptography. A BS is a sequence of N bits, and each bit has a value of 0 or 1. For securing sensors within wireless body area networks (WBANs), electrocardiogram (ECG)-based BS generation methods have been widely investigated in which interpulse intervals (IPIs) from each heartbeat cycle are processed to produce BSes. Using these IPI-based methods to generate a 128-bit BS in real time normally takes around half a minute. In order to improve the time efficiency of such methods, this paper presents an ECG multiple fiducial-points based binary sequence generation (MFBSG) algorithm. The technique of discrete wavelet transforms is employed to detect arrival time of these fiducial points, such as P, Q, R, S, and T peaks. Time intervals between them, including RR, RQ, RS, RP, and RT intervals, are then calculated based on this arrival time, and are used as ECG features to generate random BSes with low latency. According to our analysis on real ECG data, these ECG feature values exhibit the property of randomness and, thus, can be utilized to generate random BSes. Compared with the schemes that solely rely on IPIs to generate BSes, this MFBSG algorithm uses five feature values from one heart beat cycle, and can be up to five times faster than the solely IPI-based methods. So, it achieves a design goal of low latency. According to our analysis, the complexity of the algorithm is comparable to that of fast Fourier transforms. These randomly generated ECG BSes can be used as security keys for encryption or authentication in a WBAN system.
Interference Suppression Performance of Automotive UWB Radars Using Pseudo Random Sequences
Directory of Open Access Journals (Sweden)
I. Pasya
2015-12-01
Full Text Available Ultra wideband (UWB automotive radars have attracted attention from the viewpoint of reducing traffic accidents. The performance of automotive radars may be degraded by interference from nearby radars using the same frequency. In this study, a scenario where two cars pass each other on a road was considered. Considering the utilization of cross-polarization, the desired-to-undesired signal power ratio (DUR was found to vary approximately from -10 to 30 dB. Different pseudo random sequences were employed for spectrum spreading the different radar signals to mitigate the interference effects. This paper evaluates the interference suppression provided by maximum length sequence (MLS and Gold sequence (GS through numerical simulations of the radar’s performance in terms of probability of false alarm and probability of detection. It was found that MLS and GS yielded nearly the same performance when the DUR is -10 dB (worst case; for example when fixing the probability of false alarm to 0.0001, the probabilities of detection were 0.964 and 0.946 respectively. The GS are more advantageous than MLS due to larger number of different sequences having the same length in GS than in MLS.
Partial summations of stationary sequences of non-Gaussian random variables
DEFF Research Database (Denmark)
Mohr, Gunnar; Ditlevsen, Ove Dalager
1996-01-01
The distribution of the sum of a finite number of identically distributed random variables is in many cases easily determined given that the variables are independent. The moments of any order of the sum can always be expressed by the moments of the single term without computational problems...... of convergence of the distribution of a sum (or an integral) of mutually dependent random variables to the Gaussian distribution. The paper is closely related to the work in Ditlevsen el al. [Ditlevsen, O., Mohr, G. & Hoffmeyer, P. Integration of non-Gaussian fields. Prob. Engng Mech 11 (1996) 15-23](2)....... lognormal variables or polynomials of standard Gaussian variables. The dependency structure is induced by specifying the autocorrelation structure of the sequence of standard Gaussian variables. Particularly useful polynomials are the Winterstein approximations that distributionally fit with non...
How random are random numbers generated using photons?
International Nuclear Information System (INIS)
Solis, Aldo; Angulo Martínez, Alí M; Ramírez Alarcón, Roberto; Cruz Ramírez, Hector; U’Ren, Alfred B; Hirsch, Jorge G
2015-01-01
Randomness is fundamental in quantum theory, with many philosophical and practical implications. In this paper we discuss the concept of algorithmic randomness, which provides a quantitative method to assess the Borel normality of a given sequence of numbers, a necessary condition for it to be considered random. We use Borel normality as a tool to investigate the randomness of ten sequences of bits generated from the differences between detection times of photon pairs generated by spontaneous parametric downconversion. These sequences are shown to fulfil the randomness criteria without difficulties. As deviations from Borel normality for photon-generated random number sequences have been reported in previous work, a strategy to understand these diverging findings is outlined. (paper)
Detection of M-Sequences from Spike Sequence in Neuronal Networks
Directory of Open Access Journals (Sweden)
Yoshi Nishitani
2012-01-01
Full Text Available In circuit theory, it is well known that a linear feedback shift register (LFSR circuit generates pseudorandom bit sequences (PRBS, including an M-sequence with the maximum period of length. In this study, we tried to detect M-sequences known as a pseudorandom sequence generated by the LFSR circuit from time series patterns of stimulated action potentials. Stimulated action potentials were recorded from dissociated cultures of hippocampal neurons grown on a multielectrode array. We could find several M-sequences from a 3-stage LFSR circuit (M3. These results show the possibility of assembling LFSR circuits or its equivalent ones in a neuronal network. However, since the M3 pattern was composed of only four spike intervals, the possibility of an accidental detection was not zero. Then, we detected M-sequences from random spike sequences which were not generated from an LFSR circuit and compare the result with the number of M-sequences from the originally observed raster data. As a result, a significant difference was confirmed: a greater number of “0–1” reversed the 3-stage M-sequences occurred than would have accidentally be detected. This result suggests that some LFSR equivalent circuits are assembled in neuronal networks.
Method for Generating Pseudorandom Sequences with the Assured Period Based on R-blocks
Directory of Open Access Journals (Sweden)
M. A. Ivanov
2011-03-01
Full Text Available The article describes the characteristics of a new class of fast-acting pseudorandom number generators, based on the use of stochastic adders or R-blocks. A new method for generating pseudorandom sequences with the assured length of period is offered.
Pseudo-Random Sequences Generated by a Class of One-Dimensional Smooth Map
International Nuclear Information System (INIS)
Wang Xing-Yuan; Qin Xue; Xie Yi-Xin
2011-01-01
We extend a class of a one-dimensional smooth map. We make sure that for each desired interval of the parameter the map's Lyapunov exponent is positive. Then we propose a novel parameter perturbation method based on the good property of the extended one-dimensional smooth map. We perturb the parameter r in each iteration by the real number x i generated by the iteration. The auto-correlation function and NIST statistical test suite are taken to illustrate the method's randomness finally. We provide an application of this method in image encryption. Experiments show that the pseudo-random sequences are suitable for this application. (general)
Parrillo-Campiglia, Susana; Ercoli, Mónica Cedres; Umpierrez, Ofelia; Rodríguez, Patricia; Márquez, Sara; Guarneri, Carolina; Estevez-Parrillo, Francisco T; Laurenz, Marilena; Estevez-Carrizo, Francisco E
2009-10-01
Imatinib is a tyrosine kinase inhibitor that has been established as a highly effective therapy for chronic myelogenous leukemia and gastrointestinal stromal tumors. A new generic, once-daily 400-mg tablet of imatinib has been developed by a pharmaceutical company in Argentina, where the regulatory standard for marketing authorization of an imatinib generic is in vitro dissolution testing. The aim of this study was to assess the bioequivalence of a new generic film-coated test tablet formulation versus a film-coated reference tablet formulation of imatinib 400 mg. The local manufacturer seeks to validate the in vitro performance of this new formulation with a bioequivalence study. A randomized, open-label, single-dose, fasting, 2-period, 2-sequence crossover design with a 2-week washout period was used in this study. The study population consisted of healthy male South American (Uruguayan) volunteers, who were assigned in a 1:1 ratio to a randomized sequence (test-reference or reference-test). In each period, the test or reference formulation was administered after an overnight fast. During the 72-hour follow-up period, participants were monitored for vital signs and symptoms. Blood samples were collected at 15 time points, including baseline, until 72 hours. Physical examination and laboratory tests (blood, urine) were repeated 1 week after study completion. A noncompartmental model was used to determine the pharmacokinetic parameters of imatinib. The 90% CIs of the test/reference ratios for AUC(0-infinity) and C(max) were determined; the test and reference formulations were considered bioequivalent if the 90% CIs were between 0.80 and 1.25. Adverse events were assessed by a nurse who administered a questionnaire while the healthy volunteers were admitted in the unit. The bioequivalence study was conducted in 30 Uruguayan male volunteers. Demographic characteristics (mean [SD]) included age, 27.8 (6.5) years; weight, 71.2 (9.8) kg; height, 1.71 (0.09) m; and body
Order and correlations in genomic DNA sequences. The spectral approach
International Nuclear Information System (INIS)
Lobzin, Vasilii V; Chechetkin, Vladimir R
2000-01-01
The structural analysis of genomic DNA sequences is discussed in the framework of the spectral approach, which is sufficiently universal due to the reciprocal correspondence and mutual complementarity of Fourier transform length scales. The spectral characteristics of random sequences of the same nucleotide composition possess the property of self-averaging for relatively short sequences of length M≥100-300. Comparison with the characteristics of random sequences determines the statistical significance of the structural features observed. Apart from traditional applications to the search for hidden periodicities, spectral methods are also efficient in studying mutual correlations in DNA sequences. By combining spectra for structure factors and correlation functions, not only integral correlations can be estimated but also their origin identified. Using the structural spectral entropy approach, the regularity of a sequence can be quantitatively assessed. A brief introduction to the problem is also presented and other major methods of DNA sequence analysis described. (reviews of topical problems)
Configurational statistics of a polymer chain with random sequence of elements
International Nuclear Information System (INIS)
Obukhov, S.P.
1984-10-01
It is shown that for a disordered polymer chain the upper critical dimension is d c =3. At d≤3 the effect of randomness increases on large scales due to the space correlations of attractive and repulsive monomers, but it can also be screened by repulsive two- or three-body interaction. The renorm group equations indicate that near the theta point it can be the large dispersion of sizes of polymers which differ only in sequences of elements. (orig.)
Monthus, Cécile
2017-07-01
When random quantum spin chains are submitted to some periodic Floquet driving, the eigenstates of the time-evolution operator over one period can be localized in real space. For the case of periodic quenches between two Hamiltonians (or periodic kicks), where the time-evolution operator over one period reduces to the product of two simple transfer matrices, we propose a block-self-dual renormalization procedure to construct the localized eigenstates of the Floquet dynamics. We also discuss the corresponding strong disorder renormalization procedure, that generalizes the RSRG-X procedure to construct the localized eigenstates of time-independent Hamiltonians.
Ong, Emily; Ho, Christopher; Miles, Peter
2011-03-01
To compare the efficiency of orthodontic archwire sequences produced by three manufacturers. Prospective, randomized clinical trial with three parallel groups. Private orthodontic practice in Caloundra, QLD, Australia. One hundred and thirty-two consecutive patients were randomized to one of three archwire sequence groups: (i) 3M Unitek, 0·014 inch Nitinol, 0·017 inch × 0·017 inch heat activated Ni-Ti; (ii) GAC international, 0·014 inch Sentalloy, 0·016 × 0·022 inch Bioforce; and (iii) Ormco corporation, 0·014 inch Damon Copper Ni-Ti, 0·014 × 0·025 inch Damon Copper Ni-Ti. All patients received 0·018 × 0·025 inch slot Victory Series™ brackets. Mandibular impressions were taken before the insertion of each archwire. Patients completed discomfort surveys according to a seven-point Likert Scale at 4 h, 24 h, 3 days and 7 days after the insertion of each archwire. Efficiency was measured by time required to reach the working archwire, mandibular anterior alignment and level of discomfort. No significant differences were found in the reduction of irregularity between the archwire sequences at any time-point (T1: P = 0·12; T2: P = 0·06; T3: P = 0·21) or in the time to reach the working archwire (P = 0·28). No significant differences were found in the overall discomfort scores between the archwire sequences (4 h: P = 0·30; 24 h: P = 0·18; 3 days: P = 0·53; 7 days: P = 0·47). When the time-points were analysed individually, the 3M Unitek archwire sequence induced significantly less discomfort than GAC and Ormco archwires 24 h after the insertion of the third archwire (P = 0·02). This could possibly be attributed to the progression in archwire material and archform. The archwire sequences were similar in alignment efficiency and overall discomfort. Progression in archwire dimension and archform may contribute to discomfort levels. This study provides clinical justification for three common archwire sequences in 0·018 × 0·025 inch slot brackets.
International Nuclear Information System (INIS)
Yang, Li; Ma, Xiaobing; Zhai, Qingqing; Zhao, Yu
2016-01-01
We propose an inspection and replacement policy for a single component system that successively executes missions with random durations. The failure process of the system can be divided into two states, namely, normal and defective, following the delay time concept. Inspections are carried out periodically and immediately after the completion of each mission (random inspections). The failed state is always identified immediately, whereas the defective state can only be revealed by an inspection. If the system fails or is defective at a periodic inspection, then replacement is immediate. If, however, the system is defective at a random inspection, then replacement will be postponed if the time to the subsequent periodic inspection is shorter than a pre-determined threshold, and immediate otherwise. We derive the long run expected cost per unit time and then investigate the optimal periodic inspection interval and postponement threshold. A numerical example is presented to demonstrate the applicability of the proposed maintenance policy. - Highlights: • A delay time model of inspection is introduced for mission-based systems. • Periodic and random inspections are performed to check the state. • Replacement of the defective system at a random inspection can be postponed.
International Nuclear Information System (INIS)
Meng, Haining; Liu, Jianjun; Hei, Xinhong
2015-01-01
Software aging is characterized by an increasing failure rate, progressive performance degradation and even a sudden crash in a long-running software system. Software rejuvenation is an effective method to counteract software aging. A periodically inspected rejuvenation policy for software systems is studied. The consecutive inspection intervals are assumed to be a decreasing geometric sequence, and upon the inspection times of software system and its failure features, software rejuvenation or system recovery is performed. The system availability function and cost rate function are obtained, and the optimal inspection time and rejuvenation interval are both derived to maximize system availability and minimize cost rate. Then, boundary conditions of the optimal rejuvenation policy are deduced. Finally, the numeric experiment result shows the effectiveness of the proposed policy. Further compared with the existing software rejuvenation policy, the new policy has higher system availability. - Highlights: • A periodically inspected rejuvenation policy for software systems is studied. • A decreasing geometric sequence is used to denote the consecutive inspection intervals. • The optimal inspection times and rejuvenation interval are found. • The new policy is capable of reducing average cost and improving system availability
Optimal Lot Sizing with Scrap and Random Breakdown Occurring in Backorder Replenishing Period
Ting, Chia-Kuan; Chiu, Yuan-Shyi; Chan, Chu-Chai
2011-01-01
This paper is concerned with determination of optimal lot size for an economic production quantity model with scrap and random breakdown occurring in backorder replenishing period. In most real-life manufacturing systems, generation of defective items and random breakdown of production equipment are inevitable. To deal with the stochastic machine failures, production planners practically calculate the mean time between failures (MTBF) and establish the robust plan accordingly, in terms of opt...
Amour, Julien; Le Manach, Yannick Le; Borel, Marie; Lenfant, François; Nicolas-Robin, Armelle; Carillion, Aude; Ripart, Jacques; Riou, Bruno; Langeron, Olivier
2010-02-01
Single-use metal laryngoscope blades are cheaper and carry a lower risk of infection than reusable metal blades. The authors compared single-use and reusable metal blades during rapid sequence induction of anesthesia in a multicenter cluster randomized trial. One thousand seventy-two adult patients undergoing general anesthesia under emergency conditions and requiring rapid sequence induction were randomly assigned on a weekly basis to either single-use or reusable metal blades (cluster randomization). After induction, a 60-s period was allowed to complete intubation. In the case of failed intubation, a second attempt was performed using the opposite type of blade. The primary endpoint was the rate of failed intubation, and the secondary endpoints were the incidence of complications (oxygen desaturation, lung aspiration, and/or oropharynx trauma) and the Cormack and Lehane score. Both groups were similar in their main characteristics, including the risk factors for difficult intubation. The rate of failed intubation was significantly decreased with single-use metal blades at the first attempt compared with reusable blades (2.8 vs. 5.4%, P < 0.05). In addition, the proportion of grades III and IV in Cormack and Lehane score were also significantly decreased with single-use metal blades (6 vs. 10%, P < 0.05). The global complication rate did not reach statistical significance, although the same trend was noted (6.8% vs. 11.5%, P = not significant). An investigator survey and a measure of illumination pointed that illumination might have been responsible for this result. The single-use metal blade was more efficient than a reusable metal blade in rapid sequence induction of anesthesia.
Nonparametric Inference for Periodic Sequences
Sun, Ying; Hart, Jeffrey D.; Genton, Marc G.
2012-01-01
the periodogram, a widely used tool for period estimation. The CV method is computationally simple and implicitly penalizes multiples of the smallest period, leading to a "virtually" consistent estimator of integer periods. This estimator is investigated both
Quasi-Coherent Noise Jamming to LFM Radar Based on Pseudo-random Sequence Phase-modulation
Directory of Open Access Journals (Sweden)
N. Tai
2015-12-01
Full Text Available A novel quasi-coherent noise jamming method is proposed against linear frequency modulation (LFM signal and pulse compression radar. Based on the structure of digital radio frequency memory (DRFM, the jamming signal is acquired by the pseudo-random sequence phase-modulation of sampled radar signal. The characteristic of jamming signal in time domain and frequency domain is analyzed in detail. Results of ambiguity function indicate that the blanket jamming effect along the range direction will be formed when jamming signal passes through the matched filter. By flexible controlling the parameters of interrupted-sampling pulse and pseudo-random sequence, different covering distances and jamming effects will be achieved. When the jamming power is equivalent, this jamming obtains higher process gain compared with non-coherent jamming. The jamming signal enhances the detection threshold and the real target avoids being detected. Simulation results and circuit engineering implementation validate that the jamming signal covers real target effectively.
Directory of Open Access Journals (Sweden)
von Reumont Björn M
2010-03-01
Full Text Available Abstract Background Methods of alignment masking, which refers to the technique of excluding alignment blocks prior to tree reconstructions, have been successful in improving the signal-to-noise ratio in sequence alignments. However, the lack of formally well defined methods to identify randomness in sequence alignments has prevented a routine application of alignment masking. In this study, we compared the effects on tree reconstructions of the most commonly used profiling method (GBLOCKS which uses a predefined set of rules in combination with alignment masking, with a new profiling approach (ALISCORE based on Monte Carlo resampling within a sliding window, using different data sets and alignment methods. While the GBLOCKS approach excludes variable sections above a certain threshold which choice is left arbitrary, the ALISCORE algorithm is free of a priori rating of parameter space and therefore more objective. Results ALISCORE was successfully extended to amino acids using a proportional model and empirical substitution matrices to score randomness in multiple sequence alignments. A complex bootstrap resampling leads to an even distribution of scores of randomly similar sequences to assess randomness of the observed sequence similarity. Testing performance on real data, both masking methods, GBLOCKS and ALISCORE, helped to improve tree resolution. The sliding window approach was less sensitive to different alignments of identical data sets and performed equally well on all data sets. Concurrently, ALISCORE is capable of dealing with different substitution patterns and heterogeneous base composition. ALISCORE and the most relaxed GBLOCKS gap parameter setting performed best on all data sets. Correspondingly, Neighbor-Net analyses showed the most decrease in conflict. Conclusions Alignment masking improves signal-to-noise ratio in multiple sequence alignments prior to phylogenetic reconstruction. Given the robust performance of alignment
Directory of Open Access Journals (Sweden)
Andreas Martin Lisewski
2008-09-01
Full Text Available The transmission of genomic information from coding sequence to protein structure during protein synthesis is subject to stochastic errors. To analyze transmission limits in the presence of spurious errors, Shannon's noisy channel theorem is applied to a communication channel between amino acid sequences and their structures established from a large-scale statistical analysis of protein atomic coordinates. While Shannon's theorem confirms that in close to native conformations information is transmitted with limited error probability, additional random errors in sequence (amino acid substitutions and in structure (structural defects trigger a decrease in communication capacity toward a Shannon limit at 0.010 bits per amino acid symbol at which communication breaks down. In several controls, simulated error rates above a critical threshold and models of unfolded structures always produce capacities below this limiting value. Thus an essential biological system can be realistically modeled as a digital communication channel that is (a sensitive to random errors and (b restricted by a Shannon error limit. This forms a novel basis for predictions consistent with observed rates of defective ribosomal products during protein synthesis, and with the estimated excess of mutual information in protein contact potentials.
Calculation of the mean differential group delay of periodically spun, randomly birefringent fibers
Galtarossa, Andrea; Griggio, Paola; Pizzinat, Anna; Palmieri, Luca
2002-05-01
Spinning is one of the most effective and well-known ways to reduce polarization mode dispersion of optical fibers. In spite of the popularity of spinning, a detailed theory of spin effects is still lacking. We report an analytical expression for the mean differential group delay of a randomly birefringent spun fiber. The result holds for any periodic spin function with a period shorter than the fiber's beat length.
Belotto, Karisa Cristina Rodrigues; Raposo, Nádia Rezende Barbosa; Ferreira, Aline Siqueira; Gattaz, Wagner Farid
2010-11-01
Risperidone (RSP) is a benzisoxazole antipsychotic agent used to treat schizophrenia and other psychiatric illnesses in adults and children (including those with autism). After oral administration, RSP is completely absorbed from the gastrointestinal tract and undergoes hydroxylation to yield 9-hydroxyrisperidone (9-OH-RSP), an active metabolite that has a pharmacologic profile and potency similar to RSP. The aims of this study were to compare the relative bioavailability of a pharmaceutical-equivalent (test) formulation with a reference formulation of oral RSP 2 mg, both available commercially on the Brazilian pharmaceutical market, and to generate data regarding the oral bioavailability of the tested drug in healthy Brazilian volunteers. This single-dose, randomized-sequence, open-label, 2-period crossover study was conducted in healthy Brazilian volunteers from August to December 2008. Subjects were randomly assigned to receive the test formulation followed by the reference formulation or vice versa, with a 30-day washout period between doses. Study drugs were administered after a 12-hour overnight fast. For pharmacokinetic analysis, blood samples were drawn at 0 (baseline), 0.25, 0.5, 1, 1.5, 3, 5, 8, 12, 24, 48, 72, 96, and 120 hours after administration. Plasma concentrations of RSP and 9-OH-RSP were determined using LC-MS/MS. The test and reference formulations were to be considered bioequivalent if the 90% CIs for the geometric mean test/reference ratios were within a predetermined range of 80% to 125%, in accordance with the policies of the Brazilian Sanitary Surveillance Agency and the US Food and Drug Administration. Tolerability was determined using clinical assessments, monitoring of vital signs, analysis of laboratory test results, and subject interviews regarding adverse events. A total of 22 subjects were enrolled (11 men, 11 women; mean [SD] age, 32 [12] years [range, 1858 years]; weight, 70.4 [11.9] kg [range, 50-103 kg]; height, 1.67 [0.08] m
The MIXMAX random number generator
Savvidy, Konstantin G.
2015-11-01
In this paper, we study the randomness properties of unimodular matrix random number generators. Under well-known conditions, these discrete-time dynamical systems have the highly desirable K-mixing properties which guarantee high quality random numbers. It is found that some widely used random number generators have poor Kolmogorov entropy and consequently fail in empirical tests of randomness. These tests show that the lowest acceptable value of the Kolmogorov entropy is around 50. Next, we provide a solution to the problem of determining the maximal period of unimodular matrix generators of pseudo-random numbers. We formulate the necessary and sufficient condition to attain the maximum period and present a family of specific generators in the MIXMAX family with superior performance and excellent statistical properties. Finally, we construct three efficient algorithms for operations with the MIXMAX matrix which is a multi-dimensional generalization of the famous cat-map. First, allowing to compute the multiplication by the MIXMAX matrix with O(N) operations. Second, to recursively compute its characteristic polynomial with O(N2) operations, and third, to apply skips of large number of steps S to the sequence in O(N2 log(S)) operations.
Vibrational spectra of four-coordinated random networks with periodic boundary conditions
International Nuclear Information System (INIS)
Guttman, L.
1976-01-01
Examples of perfectly four-coordinated networks satisfying periodic boundary conditions are constructed by a pseudo-random process, starting from a crystalline region. The unphysical features (high density, large deviations from the tetrahedral bond-angle) are removed by systematic modification of the bonding scheme. The vibrational spectra are calculated, using a valence-force potential, and the neutron scattering is computed by a phonon-expansion approximation
Study on random number generator in Monte Carlo code
International Nuclear Information System (INIS)
Oya, Kentaro; Kitada, Takanori; Tanaka, Shinichi
2011-01-01
The Monte Carlo code uses a sequence of pseudo-random numbers with a random number generator (RNG) to simulate particle histories. A pseudo-random number has its own period depending on its generation method and the period is desired to be long enough not to exceed the period during one Monte Carlo calculation to ensure the correctness especially for a standard deviation of results. The linear congruential generator (LCG) is widely used as Monte Carlo RNG and the period of LCG is not so long by considering the increasing rate of simulation histories in a Monte Carlo calculation according to the remarkable enhancement of computer performance. Recently, many kinds of RNG have been developed and some of their features are better than those of LCG. In this study, we investigate the appropriate RNG in a Monte Carlo code as an alternative to LCG especially for the case of enormous histories. It is found that xorshift has desirable features compared with LCG, and xorshift has a larger period, a comparable speed to generate random numbers, a better randomness, and good applicability to parallel calculation. (author)
Note on Marsaglia\\'s Xorshift Random Number Generators
Directory of Open Access Journals (Sweden)
Richard P. Brent
2004-08-01
Full Text Available Marsaglia (2003 has described a class of Xorshift random number generators (RNGs with periods 2n - 1 for n = 32, 64, etc. We show that the sequences generated by these RNGs are identical to the sequences generated by certain linear feedback shift register (LFSR generators using "exclusive or" (xor operations on n-bit words, with a recurrence defined by a primitive polynomial of degree n.
Optimal Policies for Random and Periodic Garbage Collections with Tenuring Threshold
Zhao, Xufeng; Nakamura, Syouji; Nakagawa, Toshio
It is an important problem to determine the tenuring threshold to meet the pause time goal for a generational garbage collector. From such viewpoint, this paper proposes two stochastic models based on the working schemes of a generational garbage collector: One is random collection which occurs at a nonhomogeneous Poisson process and the other is periodic collection which occurs at periodic times. Since the cost suffered for minor collection increases, as the amount of surviving objects accumulates, tenuring minor collection should be made at some tenuring threshold. Using the techniques of cumulative processes and reliability theory, expected cost rates with tenuring threshold are obtained, and optimal policies which minimize them are discussed analytically and computed numerically.
A Novel Motion Compensation Method for Random Stepped Frequency Radar with M-sequence
Liao, Zhikun; Hu, Jiemin; Lu, Dawei; Zhang, Jun
2018-01-01
The random stepped frequency radar is a new kind of synthetic wideband radar. In the research, it has been found that it possesses a thumbtack-like ambiguity function which is considered to be the ideal one. This also means that only a precise motion compensation could result in the correct high resolution range profile. In this paper, we will introduce the random stepped frequency radar coded by M-sequence firstly and briefly analyse the effect of relative motion between target and radar on the distance imaging, which is called defocusing problem. Then, a novel motion compensation method, named complementary code cancellation, will be put forward to solve this problem. Finally, the simulated experiments will demonstrate its validity and the computational analysis will show up its efficiency.
Growth rate for the expected value of a generalized random Fibonacci sequence
International Nuclear Information System (INIS)
Janvresse, Elise; De la Rue, Thierry; Rittaud, BenoIt
2009-01-01
We study the behaviour of generalized random Fibonacci sequences defined by the relation g n = |λg n-1 ± g n-2 |, where the ± sign is given by tossing an unbalanced coin, giving probability p to the + sign. We prove that the expected value of g n grows exponentially fast for any 0 (2 - λ)/4 when λ is of the form 2cos(π/k) for some fixed integer k ≥ 3. In both cases, we give an algebraic expression for the growth rate
International Nuclear Information System (INIS)
Xiong Gang; Wang, X.R.
2005-01-01
The zero-temperature transmission rate spectrum of a double-chain tight-binding model for real DNA is calculated. It is shown that a band of extended-like states exists only for finite chain length with strong inter-chain coupling. While the whole spectrum tends to zero in thermodynamic limit, regardless of the strength of inter-chain coupling. It is also shown that a more faithful model for real DNA with periodic sugar-phosphate chains in backbone structures can be mapped into the above simple double-chain tight-binding model. Combined with above results, the transmission rate of real DNA with long random sequence of nucleotides is expected to be poor
International Nuclear Information System (INIS)
Huang Zhenkun; Wang Xinghua; Gao Feng
2006-01-01
In this Letter, we discuss discrete-time analogue of a continuous-time cellular neural network. Sufficient conditions are obtained for the existence of a unique almost periodic sequence solution which is globally attractive. Our results demonstrate dynamics of the formulated discrete-time analogue as mathematical models for the continuous-time cellular neural network in almost periodic case. Finally, a computer simulation illustrates the suitability of our discrete-time analogue as numerical algorithms in simulating the continuous-time cellular neural network conveniently
Pseudo-random number generator based on asymptotic deterministic randomness
Wang, Kai; Pei, Wenjiang; Xia, Haishan; Cheung, Yiu-ming
2008-06-01
A novel approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness constructed by the piecewise linear map and the noninvertible nonlinearity transform, and then give the discretized systems in the finite digitized state space. The statistic characteristics of the asymptotic deterministic randomness are investigated numerically, such as stationary probability density function and random-like behavior. Furthermore, we analyze the dynamics of the symbolic sequence. Both theoretical and experimental results show that the symbolic sequence of the asymptotic deterministic randomness possesses very good cryptographic properties, which improve the security of chaos based PRBGs and increase the resistance against entropy attacks and symbolic dynamics attacks.
Pseudo-random number generator based on asymptotic deterministic randomness
International Nuclear Information System (INIS)
Wang Kai; Pei Wenjiang; Xia Haishan; Cheung Yiuming
2008-01-01
A novel approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness constructed by the piecewise linear map and the noninvertible nonlinearity transform, and then give the discretized systems in the finite digitized state space. The statistic characteristics of the asymptotic deterministic randomness are investigated numerically, such as stationary probability density function and random-like behavior. Furthermore, we analyze the dynamics of the symbolic sequence. Both theoretical and experimental results show that the symbolic sequence of the asymptotic deterministic randomness possesses very good cryptographic properties, which improve the security of chaos based PRBGs and increase the resistance against entropy attacks and symbolic dynamics attacks
RSARF: Prediction of residue solvent accessibility from protein sequence using random forest method
Ganesan, Pugalenthi; Kandaswamy, Krishna Kumar Umar; Chou -, Kuochen; Vivekanandan, Saravanan; Kolatkar, Prasanna R.
2012-01-01
Prediction of protein structure from its amino acid sequence is still a challenging problem. The complete physicochemical understanding of protein folding is essential for the accurate structure prediction. Knowledge of residue solvent accessibility gives useful insights into protein structure prediction and function prediction. In this work, we propose a random forest method, RSARF, to predict residue accessible surface area from protein sequence information. The training and testing was performed using 120 proteins containing 22006 residues. For each residue, buried and exposed state was computed using five thresholds (0%, 5%, 10%, 25%, and 50%). The prediction accuracy for 0%, 5%, 10%, 25%, and 50% thresholds are 72.9%, 78.25%, 78.12%, 77.57% and 72.07% respectively. Further, comparison of RSARF with other methods using a benchmark dataset containing 20 proteins shows that our approach is useful for prediction of residue solvent accessibility from protein sequence without using structural information. The RSARF program, datasets and supplementary data are available at http://caps.ncbs.res.in/download/pugal/RSARF/. - See more at: http://www.eurekaselect.com/89216/article#sthash.pwVGFUjq.dpuf
Classification of periodic, chaotic and random sequences using ...
Indian Academy of Sciences (India)
We analyse the problem with multiple values of initial conditions and perform statistical hypothesis testing for differences in means to determine the minimum ... the datasets showed a significant main effect (F3,196 = 77.04, P < 0.001). Post hoc.
Analysis of decision procedures for a sequence of inventory periods
International Nuclear Information System (INIS)
Avenhaus, R.
1982-07-01
Optimal test procedures for a sequence of inventory periods will be discussed. Starting with a game theoretical description of the conflict situation between the plant operator and the inspector, the objectives of the inspector as well as the general decision theoretical problem will be formulated. In the first part the objective of 'secure' detection will be emphasized which means that only at the end of the reference time a decision is taken by the inspector. In the second part the objective of 'timely' detection will be emphasized which will lead to sequential test procedures. At the end of the paper all procedures will be summarized, and in view of the multitude of procedures available at the moment some comments about future work will be given. (orig./HP) [de
ACORN—A new method for generating sequences of uniformly distributed Pseudo-random Numbers
Wikramaratna, R. S.
1989-07-01
A new family of pseudo-random number generators, the ACORN ( additive congruential random number) generators, is proposed. The resulting numbers are distributed uniformly in the interval [0, 1). The ACORN generators are defined recursively, and the ( k + 1)th order generator is easily derived from the kth order generator. Some theorems concerning the period length are presented and compared with existing results for linear congruential generators. A range of statistical tests are applied to the ACORN generators, and their performance is compared with that of the linear congruential generators and the Chebyshev generators. The tests show the ACORN generators to be statistically superior to the Chebyshev generators, while being statistically similar to the linear congruential generators. However, the ACORN generators execute faster than linear congruential generators for the same statistical faithfulness. The main advantages of the ACORN generator are speed of execution, long period length, and simplicity of coding.
Directory of Open Access Journals (Sweden)
Imen Chaieb Memmi
2013-09-01
Full Text Available Purpose: We aim to examine the capacitated multi-item lot sizing problem which is a typical example of a large bucket model, where many different items can be produced on the same machine in one time period. We propose a new approach to determine the production sequence and lot sizes that minimize the sum of start up and setup costs, inventory and production costs over all periods.Design/methodology/approach: The approach is composed of three steps. First, we compute a lower bound on total cost. Then we propose a three sub-steps iteration procedure. We solve optimally the lot sizing problem without considering products sequencing and their cost. Then, we determine products quantities to produce each period while minimizing the storage and variable production costs. Given the products to manufacture each period, we determine its correspondent optimal products sequencing, by using a Branch and Bound algorithm. Given the sequences of products within each period, we evaluate the total start up and setup cost. We compare then the total cost obtained to the lower bound of the total cost. If this value riches a prefixed value, we stop. Otherwise, we modify the results of lot sizing problem.Findings and Originality/value: We show using an illustrative example, that the difference between the total cost and its lower bound is only 10%. This gap depends on the significance of the inventory and production costs and the machine’s capacity. Comparing the approach we develop with a traditional one, we show that we manage to reduce the total cost by 30%.Research limitations/implications: Our model fits better to real-world situations where production systems run continuously. This model is applied for limited number of part types and periods.Practical implications: Our approach determines the products to manufacture each time period, their economic amounts, and their scheduling within each period. This outcome should help decision makers bearing expensive
Prediction of protein-protein interaction sites in sequences and 3D structures by random forests.
Directory of Open Access Journals (Sweden)
Mile Sikić
2009-01-01
Full Text Available Identifying interaction sites in proteins provides important clues to the function of a protein and is becoming increasingly relevant in topics such as systems biology and drug discovery. Although there are numerous papers on the prediction of interaction sites using information derived from structure, there are only a few case reports on the prediction of interaction residues based solely on protein sequence. Here, a sliding window approach is combined with the Random Forests method to predict protein interaction sites using (i a combination of sequence- and structure-derived parameters and (ii sequence information alone. For sequence-based prediction we achieved a precision of 84% with a 26% recall and an F-measure of 40%. When combined with structural information, the prediction performance increases to a precision of 76% and a recall of 38% with an F-measure of 51%. We also present an attempt to rationalize the sliding window size and demonstrate that a nine-residue window is the most suitable for predictor construction. Finally, we demonstrate the applicability of our prediction methods by modeling the Ras-Raf complex using predicted interaction sites as target binding interfaces. Our results suggest that it is possible to predict protein interaction sites with quite a high accuracy using only sequence information.
Vassy, Jason L; Lautenbach, Denise M; McLaughlin, Heather M; Kong, Sek Won; Christensen, Kurt D; Krier, Joel; Kohane, Isaac S; Feuerman, Lindsay Z; Blumenthal-Barby, Jennifer; Roberts, J Scott; Lehmann, Lisa Soleymani; Ho, Carolyn Y; Ubel, Peter A; MacRae, Calum A; Seidman, Christine E; Murray, Michael F; McGuire, Amy L; Rehm, Heidi L; Green, Robert C
2014-03-20
Whole genome sequencing (WGS) is already being used in certain clinical and research settings, but its impact on patient well-being, health-care utilization, and clinical decision-making remains largely unstudied. It is also unknown how best to communicate sequencing results to physicians and patients to improve health. We describe the design of the MedSeq Project: the first randomized trials of WGS in clinical care. This pair of randomized controlled trials compares WGS to standard of care in two clinical contexts: (a) disease-specific genomic medicine in a cardiomyopathy clinic and (b) general genomic medicine in primary care. We are recruiting 8 to 12 cardiologists, 8 to 12 primary care physicians, and approximately 200 of their patients. Patient participants in both the cardiology and primary care trials are randomly assigned to receive a family history assessment with or without WGS. Our laboratory delivers a genome report to physician participants that balances the needs to enhance understandability of genomic information and to convey its complexity. We provide an educational curriculum for physician participants and offer them a hotline to genetics professionals for guidance in interpreting and managing their patients' genome reports. Using varied data sources, including surveys, semi-structured interviews, and review of clinical data, we measure the attitudes, behaviors and outcomes of physician and patient participants at multiple time points before and after the disclosure of these results. The impact of emerging sequencing technologies on patient care is unclear. We have designed a process of interpreting WGS results and delivering them to physicians in a way that anticipates how we envision genomic medicine will evolve in the near future. That is, our WGS report provides clinically relevant information while communicating the complexity and uncertainty of WGS results to physicians and, through physicians, to their patients. This project will not only
2013-12-20
... DEPARTMENT OF TRANSPORTATION Federal Aviation Administration Random Drug and Alcohol Testing... the minimum random drug and alcohol testing percentage rates for the period January 1, 2014, through... Federal Regulations Title 14, section 120.109(b) (for drug testing), and 120.217(c) (for alcohol testing...
2010-12-07
... DEPARTMENT OF TRANSPORTATION Federal Aviation Administration Random Drug and Alcohol Testing... minimum random drug and alcohol testing percentage rates for the period January 1, 2011, through December... Regulations Title 14, section 120.109(b) (for drug testing), and 120.217(c) (for alcohol testing). Issued in...
2012-12-03
... DEPARTMENT OF TRANSPORTATION Federal Aviation Administration Random Drug and Alcohol Testing... the minimum random drug and alcohol testing percentage rates for the period January 1, 2013, through... Regulations Title 14, Sec. Sec. 120.109(b) (for drug testing), and 120.217(c) (for alcohol testing). Issued in...
2011-12-01
... DEPARTMENT OF TRANSPORTATION Federal Aviation Administration Random Drug and Alcohol Testing... the minimum random drug and alcohol testing percentage rates for the period January 1, 2012, through... Regulations Title 14, Sec. 120.109(b) (for drug testing), and 120.217(c) (for alcohol testing). Issued in...
Varley, Rosemary; Cowell, Patricia E; Dyson, Lucy; Inglis, Lesley; Roper, Abigail; Whiteside, Sandra P
2016-03-01
There is currently little evidence on effective interventions for poststroke apraxia of speech. We report outcomes of a trial of self-administered computer therapy for apraxia of speech. Effects of speech intervention on naming and repetition of treated and untreated words were compared with those of a visuospatial sham program. The study used a parallel-group, 2-period, crossover design, with participants receiving 2 interventions. Fifty participants with chronic and stable apraxia of speech were randomly allocated to 1 of 2 order conditions: speech-first condition versus sham-first condition. Period 1 design was equivalent to a randomized controlled trial. We report results for this period and profile the effect of the period 2 crossover. Period 1 results revealed significant improvement in naming and repetition only in the speech-first group. The sham-first group displayed improvement in speech production after speech intervention in period 2. Significant improvement of treated words was found in both naming and repetition, with little generalization to structurally similar and dissimilar untreated words. Speech gains were largely maintained after withdrawal of intervention. There was a significant relationship between treatment dose and response. However, average self-administered dose was modest for both groups. Future software design would benefit from incorporation of social and gaming components to boost motivation. Single-word production can be improved in chronic apraxia of speech with behavioral intervention. Self-administered computerized therapy is a promising method for delivering high-intensity speech/language rehabilitation. URL: http://orcid.org/0000-0002-1278-0601. Unique identifier: ISRCTN88245643. © 2016 American Heart Association, Inc.
Directory of Open Access Journals (Sweden)
Bilan Stepan
2017-01-01
Full Text Available To date, there are many tasks that are aimed at studying the dynamic changes in physical processes. These tasks do not give advance known result. The solution of such problems is based on the construction of a dynamic model of the object. Successful structural and functional implementation of the object model can give a positive result in time. This approach uses the task of constructing artificial biological objects. To solve such problems, pseudo-random number generators are used, which also find wide application for information protection tasks. Such generators should have good statistical properties and give a long repetition period of the generated pseudo-random bit sequence. This work is aimed at improving these characteristics. The paper considers the method of forming pseudo-random sequences of numbers on the basis of aperiodic cellular automata with two active cells. A pseudo-random number generator is proposed that generates three bit sequences. The first two bit sequences are formed by the corresponding two active cells in the cellular automaton. The third bit sequence is the result of executing the XOR function over the bits of the first two sequences and it has better characteristics compared to them. The use of cellular automata with two active cells allowed to improve the statistical properties of the formed bit sequence, as well as its repetition period. This is proved by using graphical tests for generators built based on cellular automata using the neighborhoods of von Neumann and Moore. The tests showed high efficiency of the generator based on an asynchronous cellular automaton with the neighborhood of Moore. The proposed pseudo-random number generators have good statistical properties, which makes it possible to use them in information security systems, as well as for simulation tasks of various dynamic processes.
2011-01-01
Introduction Succinylcholine and rocuronium are widely used to facilitate rapid sequence induction (RSI) intubation in intensive care. Concerns relate to the side effects of succinylcholine and to slower onset and inferior intubation conditions associated with rocuronium. So far, succinylcholine and rocuronium have not been compared in an adequately powered randomized trial in intensive care. Accordingly, the aim of the present study was to compare the incidence of hypoxemia after rocuronium or succinylcholine in critically ill patients requiring an emergent RSI. Methods This was a prospective randomized controlled single-blind trial conducted from 2006 to 2010 at the University Hospital of Basel. Participants were 401 critically ill patients requiring emergent RSI. Patients were randomized to receive 1 mg/kg succinylcholine or 0.6 mg/kg rocuronium for neuromuscular blockade. The primary outcome was the incidence of oxygen desaturations defined as a decrease in oxygen saturation ≥ 5%, assessed by continuous pulse oxymetry, at any time between the start of the induction sequence and two minutes after the completion of the intubation. A severe oxygen desaturation was defined as a decrease in oxygen saturation ≥ 5% leading to a saturation value of ≤ 80%. Results There was no difference between succinylcholine and rocuronium regarding oxygen desaturations (succinylcholine 73/196; rocuronium 66/195; P = 0.67); severe oxygen desaturations (succinylcholine 20/196; rocuronium 20/195; P = 1.0); and extent of oxygen desaturations (succinylcholine -14 ± 12%; rocuronium -16 ± 13%; P = 0.77). The duration of the intubation sequence was shorter after succinycholine than after rocuronium (81 ± 38 sec versus 95 ± 48 sec; P = 0.002). Intubation conditions (succinylcholine 8.3 ± 0.8; rocuronium 8.2 ± 0.9; P = 0.7) and failed first intubation attempts (succinylcholine 32/200; rocuronium 36/201; P = 1.0) did not differ between the groups. Conclusions In critically ill
An investigation of the uniform random number generator
Temple, E. C.
1982-01-01
Most random number generators that are in use today are of the congruential form X(i+1) + AX(i) + C mod M where A, C, and M are nonnegative integers. If C=O, the generator is called the multiplicative type and those for which C/O are called mixed congruential generators. It is easy to see that congruential generators will repeat a sequence of numbers after a maximum of M values have been generated. The number of numbers that a procedure generates before restarting the sequence is called the length or the period of the generator. Generally, it is desirable to make the period as long as possible. A detailed discussion of congruential generators is given. Also, several promising procedures that differ from the multiplicative and mixed procedure are discussed.
High-resolution characterization of sequence signatures due to non-random cleavage of cell-free DNA.
Chandrananda, Dineika; Thorne, Natalie P; Bahlo, Melanie
2015-06-17
High-throughput sequencing of cell-free DNA fragments found in human plasma has been used to non-invasively detect fetal aneuploidy, monitor organ transplants and investigate tumor DNA. However, many biological properties of this extracellular genetic material remain unknown. Research that further characterizes circulating DNA could substantially increase its diagnostic value by allowing the application of more sophisticated bioinformatics tools that lead to an improved signal to noise ratio in the sequencing data. In this study, we investigate various features of cell-free DNA in plasma using deep-sequencing data from two pregnant women (>70X, >50X) and compare them with matched cellular DNA. We utilize a descriptive approach to examine how the biological cleavage of cell-free DNA affects different sequence signatures such as fragment lengths, sequence motifs at fragment ends and the distribution of cleavage sites along the genome. We show that the size distributions of these cell-free DNA molecules are dependent on their autosomal and mitochondrial origin as well as the genomic location within chromosomes. DNA mapping to particular microsatellites and alpha repeat elements display unique size signatures. We show how cell-free fragments occur in clusters along the genome, localizing to nucleosomal arrays and are preferentially cleaved at linker regions by correlating the mapping locations of these fragments with ENCODE annotation of chromatin organization. Our work further demonstrates that cell-free autosomal DNA cleavage is sequence dependent. The region spanning up to 10 positions on either side of the DNA cleavage site show a consistent pattern of preference for specific nucleotides. This sequence motif is present in cleavage sites localized to nucleosomal cores and linker regions but is absent in nucleosome-free mitochondrial DNA. These background signals in cell-free DNA sequencing data stem from the non-random biological cleavage of these fragments. This
DEFF Research Database (Denmark)
Workman, Christopher; Krogh, Anders Stærmose
1999-01-01
This work investigates whether mRNA has a lower estimated folding free energy than random sequences. The free energy estimates are calculated by the mfold program for prediction of RNA secondary structures. For a set of 46 mRNAs it is shown that the predicted free energy is not significantly diff...
Random matrices and random difference equations
International Nuclear Information System (INIS)
Uppuluri, V.R.R.
1975-01-01
Mathematical models leading to products of random matrices and random difference equations are discussed. A one-compartment model with random behavior is introduced, and it is shown how the average concentration in the discrete time model converges to the exponential function. This is of relevance to understanding how radioactivity gets trapped in bone structure in blood--bone systems. The ideas are then generalized to two-compartment models and mammillary systems, where products of random matrices appear in a natural way. The appearance of products of random matrices in applications in demography and control theory is considered. Then random sequences motivated from the following problems are studied: constant pulsing and random decay models, random pulsing and constant decay models, and random pulsing and random decay models
Theory of the Flower Micelle Formation of Amphiphilic Random and Periodic Copolymers in Solution
Directory of Open Access Journals (Sweden)
Takahiro Sato
2018-01-01
Full Text Available The mixing Gibbs energy Δgm for the flower-micelle phase of amphiphilic random and periodic (including alternating copolymers was formulated on the basis of the lattice model. The formulated Δgm predicts (1 the inverse proportionality of the aggregation number to the degree of polymerization of the copolymer, (2 the increase of the critical micelle concentration with decreasing the hydrophobe content, and (3 the crossover from the micellization to the liquid–liquid phase separation as the hydrophobe content increases. The transition from the uni-core flower micelle to the multi-core flower necklace as the degree of polymerization increases was also implicitly indicated by the theory. These theoretical results were compared with experimental results for amphiphilic random and alternating copolymers reported so far.
QUASI-RANDOM TESTING OF COMPUTER SYSTEMS
Directory of Open Access Journals (Sweden)
S. V. Yarmolik
2013-01-01
Full Text Available Various modified random testing approaches have been proposed for computer system testing in the black box environment. Their effectiveness has been evaluated on the typical failure patterns by employing three measures, namely, P-measure, E-measure and F-measure. A quasi-random testing, being a modified version of the random testing, has been proposed and analyzed. The quasi-random Sobol sequences and modified Sobol sequences are used as the test patterns. Some new methods for Sobol sequence generation have been proposed and analyzed.
Blind sequence-length estimation of low-SNR cyclostationary sequences
CSIR Research Space (South Africa)
Vlok, JD
2014-06-01
Full Text Available Several existing direct-sequence spread spectrum (DSSS) detection and estimation algorithms assume prior knowledge of the symbol period or sequence length, although very few sequence-length estimation techniques are available in the literature...
International Nuclear Information System (INIS)
Vani, V C; Chatterjee, S
2010-01-01
The matched filter method for detecting a periodic structure on a surface hidden behind randomness is known to detect up to (r 0 /Λ)≥0.11, where r 0 is the coherence length of light on scattering from the rough part and Λ is the wavelength of the periodic part of the surface-the above limit being much lower than what is allowed by conventional detection methods. The primary goal of this technique is the detection and characterization of the periodic structure hidden behind randomness without the use of any complicated experimental or computational procedures. This paper examines this detection procedure for various values of the amplitude a of the periodic part beginning from a=0 to small finite values of a. We thus address the importance of the following quantities: '(a/λ)', which scales the amplitude of the periodic part with the wavelength of light, and (r 0 /Λ), in determining the detectability of the intensity peaks.
Short sequence motifs, overrepresented in mammalian conservednon-coding sequences
Energy Technology Data Exchange (ETDEWEB)
Minovitsky, Simon; Stegmaier, Philip; Kel, Alexander; Kondrashov,Alexey S.; Dubchak, Inna
2007-02-21
Background: A substantial fraction of non-coding DNAsequences of multicellular eukaryotes is under selective constraint. Inparticular, ~;5 percent of the human genome consists of conservednon-coding sequences (CNSs). CNSs differ from other genomic sequences intheir nucleotide composition and must play important functional roles,which mostly remain obscure.Results: We investigated relative abundancesof short sequence motifs in all human CNSs present in the human/mousewhole-genome alignments vs. three background sets of sequences: (i)weakly conserved or unconserved non-coding sequences (non-CNSs); (ii)near-promoter sequences (located between nucleotides -500 and -1500,relative to a start of transcription); and (iii) random sequences withthe same nucleotide composition as that of CNSs. When compared tonon-CNSs and near-promoter sequences, CNSs possess an excess of AT-richmotifs, often containing runs of identical nucleotides. In contrast, whencompared to random sequences, CNSs contain an excess of GC-rich motifswhich, however, lack CpG dinucleotides. Thus, abundance of short sequencemotifs in human CNSs, taken as a whole, is mostly determined by theiroverall compositional properties and not by overrepresentation of anyspecific short motifs. These properties are: (i) high AT-content of CNSs,(ii) a tendency, probably due to context-dependent mutation, of A's andT's to clump, (iii) presence of short GC-rich regions, and (iv) avoidanceof CpG contexts, due to their hypermutability. Only a small number ofshort motifs, overrepresented in all human CNSs are similar to bindingsites of transcription factors from the FOX family.Conclusion: Human CNSsas a whole appear to be too broad a class of sequences to possess strongfootprints of any short sequence-specific functions. Such footprintsshould be studied at the level of functional subclasses of CNSs, such asthose which flank genes with a particular pattern of expression. Overallproperties of CNSs are affected by
Pseudo random number generator based on quantum chaotic map
Akhshani, A.; Akhavan, A.; Mobaraki, A.; Lim, S.-C.; Hassan, Z.
2014-01-01
For many years dissipative quantum maps were widely used as informative models of quantum chaos. In this paper, a new scheme for generating good pseudo-random numbers (PRNG), based on quantum logistic map is proposed. Note that the PRNG merely relies on the equations used in the quantum chaotic map. The algorithm is not complex, which does not impose high requirement on computer hardware and thus computation speed is fast. In order to face the challenge of using the proposed PRNG in quantum cryptography and other practical applications, the proposed PRNG is subjected to statistical tests using well-known test suites such as NIST, DIEHARD, ENT and TestU01. The results of the statistical tests were promising, as the proposed PRNG successfully passed all these tests. Moreover, the degree of non-periodicity of the chaotic sequences of the quantum map is investigated through the Scale index technique. The obtained result shows that, the sequence is more non-periodic. From these results it can be concluded that, the new scheme can generate a high percentage of usable pseudo-random numbers for simulation and other applications in scientific computing.
Drake, C; Jones, M R; Baruch, C
2000-12-15
This paper is divided into three sections. The first section is theoretical; it extends Dynamic Attending Theory (Jones, M. R. Psychological Review 83 (1976) 323; Jones, M. R. Perception and Psychophysics 41(6) (1987) 631; Jones, M. R. Psychomusicology 9(2) (1990) 193; Jones, M. R., & Boltz, M. Psychological Review 96(3) (1989) 459) to developmental questions concerning tempo and time hierarchies. Generally Dynamic Attending Theory proposes that, when listening to a complex auditory sequence, listeners spontaneously focus on events occurring at an intermediate rate (the referent level), and they then may shift attention to events occurring over longer or shorter time spans, that is at lower (faster) or higher (slower) hierarchical levels (focal attending). The second section of the paper is experimental. It examines maturational changes of three dynamic attending activities involving referent period and level, attunement, and focal attending. Tasks involve both motor tapping (including spontaneous motor tempo and synchronization with simple sequences and music) and tempo discrimination. We compare performances by 4-, 6-, 8-, and 10-year-old children and adults, with or without musical training. Results indicate three changes with increased age and musical training: (1) a slowing of the mean spontaneous tapping rate (a reflection of the referent period) and mean synchronization rate (a reflection of the referent level), (2) enhanced ability to synchronize tapping and discriminate tempo (improved attunement), and (3) an enlarged range of tapping rates towards slower rates and higher hierarchical levels (improved focal attending). A final section considers results in light of the theory proposed here. It is suggested that growth trends can be expressed in terms of listeners' engagement of slower attending oscillators with age and experience, accompanied by the passage from the initial use of a single oscillator towards the coupling of multiple oscillators.
Directory of Open Access Journals (Sweden)
You-Wei Zhang
Full Text Available A general symplectic method for the random response analysis of infinitely periodic structures subjected to stationary/non-stationary random excitations is developed using symplectic mathematics in conjunction with variable separation and the pseudo-excitation method (PEM. Starting from the equation of motion for a single loaded substructure, symplectic analysis is firstly used to eliminate the dependent degrees of the freedom through condensation. A Fourier expansion of the condensed equation of motion is then applied to separate the variables of time and wave number, thus enabling the necessary recurrence scheme to be developed. The random response is finally determined by implementing PEM. The proposed method is justified by comparison with results available in the literature and is then applied to a more complicated time-dependent coupled system.
Directory of Open Access Journals (Sweden)
Elena Hilario
Full Text Available Genotyping by sequencing (GBS is a restriction enzyme based targeted approach developed to reduce the genome complexity and discover genetic markers when a priori sequence information is unavailable. Sufficient coverage at each locus is essential to distinguish heterozygous from homozygous sites accurately. The number of GBS samples able to be pooled in one sequencing lane is limited by the number of restriction sites present in the genome and the read depth required at each site per sample for accurate calling of single-nucleotide polymorphisms. Loci bias was observed using a slight modification of the Elshire et al.some restriction enzyme sites were represented in higher proportions while others were poorly represented or absent. This bias could be due to the quality of genomic DNA, the endonuclease and ligase reaction efficiency, the distance between restriction sites, the preferential amplification of small library restriction fragments, or bias towards cluster formation of small amplicons during the sequencing process. To overcome these issues, we have developed a GBS method based on randomly tagging genomic DNA (rtGBS. By randomly landing on the genome, we can, with less bias, find restriction sites that are far apart, and undetected by the standard GBS (stdGBS method. The study comprises two types of biological replicates: six different kiwifruit plants and two independent DNA extractions per plant; and three types of technical replicates: four samples of each DNA extraction, stdGBS vs. rtGBS methods, and two independent library amplifications, each sequenced in separate lanes. A statistically significant unbiased distribution of restriction fragment size by rtGBS showed that this method targeted 49% (39,145 of BamH I sites shared with the reference genome, compared to only 14% (11,513 by stdGBS.
Leblanc, Judith; Hejblum, Gilles; Costagliola, Dominique; Durand-Zaleski, Isabelle; Lert, France; de Truchis, Pierre; Verbeke, Geert; Rousseau, Alexandra; Piquet, Hélène; Simon, François; Pateron, Dominique; Simon, Tabassome; Crémieux, Anne-Claude
2017-10-30
This study compares the effectiveness and cost-effectiveness of nurse-driven targeted HIV screening alongside physician-directed diagnostic testing (intervention strategy) with diagnostic testing alone (control strategy) in 8 emergency departments. In this cluster-randomized, 2-period, crossover trial, 18- to 64-year-old patients presenting for reasons other than potential exposure to HIV were included. The strategy applied first was randomly assigned. During both periods, diagnostic testing was prescribed by physicians following usual care. During the intervention periods, patients were asked to complete a self-administered questionnaire. According to their answers, the triage nurse suggested performing a rapid test to patients belonging to a high-risk group. The primary outcome was the proportion of new diagnoses among included patients, which further refers to effectiveness. A secondary outcome was the intervention's incremental cost (health care system perspective) per additional diagnosis. During the intervention periods, 74,161 patients were included, 16,468 completed the questionnaire, 4,341 belonged to high-risk groups, and 2,818 were tested by nurses, yielding 13 new diagnoses. Combined with 9 diagnoses confirmed through 97 diagnostic tests, 22 new diagnoses were established. During the control periods, 74,166 patients were included, 92 were tested, and 6 received a new diagnosis. The proportion of new diagnoses among included patients was higher during the intervention than in the control periods (3.0 per 10,000 versus 0.8 per 10,000; difference 2.2 per 10,000, 95% CI 1.3 to 3.6; relative risk 3.7, 95% CI 1.4 to 9.8). The incremental cost was €1,324 per additional new diagnosis. The combined strategy of targeted screening and diagnostic testing was effective. Copyright © 2017 American College of Emergency Physicians. Published by Elsevier Inc. All rights reserved.
Random number generators in support of Monte Carlo problems in physics
International Nuclear Information System (INIS)
Dyadkin, I.G.
1993-01-01
The ability to support a modern users' expectations of random number generators to solve problems in physics is analyzed. The capabilities of the newest concepts and the old pseudo-random algorithms are compared. The author is in favor of multiplicative generators. Due to the 64-bit arithmetic of a modern PC, multiplicative generators have a sufficient number of periods (up to 2 62 ) and are quicker to generate and to govern independent sequences for parallel processing. In addition they are able to replicate sub-sequences (without storing their seeds) for each standard trial in any code and to simulate spatial and planar directions and EXP(-x) distributions often needed as ''bricks'' for simulating events in physics. Hundreds of multipliers for multiplicative generators have been tabulated and tested, and the required speeds have been obtained. (author)
Entropy of finite random binary sequences with weak long-range correlations.
Melnik, S S; Usatenko, O V
2014-11-01
We study the N-step binary stationary ergodic Markov chain and analyze its differential entropy. Supposing that the correlations are weak we express the conditional probability function of the chain through the pair correlation function and represent the entropy as a functional of the pair correlator. Since the model uses the two-point correlators instead of the block probability, it makes it possible to calculate the entropy of strings at much longer distances than using standard methods. A fluctuation contribution to the entropy due to finiteness of random chains is examined. This contribution can be of the same order as its regular part even at the relatively short lengths of subsequences. A self-similar structure of entropy with respect to the decimation transformations is revealed for some specific forms of the pair correlation function. Application of the theory to the DNA sequence of the R3 chromosome of Drosophila melanogaster is presented.
Energy Technology Data Exchange (ETDEWEB)
Lee, Eve J.; Chiang, Eugene, E-mail: evelee@berkeley.edu [Department of Astronomy, University of California, Berkeley, CA 94720-3411 (United States)
2017-06-10
Sub-Neptunes around FGKM dwarfs are evenly distributed in log orbital period down to ∼10 days, but dwindle in number at shorter periods. Both the break at ∼10 days and the slope of the occurrence rate down to ∼1 day can be attributed to the truncation of protoplanetary disks by their host star magnetospheres at corotation. We demonstrate this by deriving planet occurrence rate profiles from empirical distributions of pre-main-sequence stellar rotation periods. Observed profiles are better reproduced when planets are distributed randomly in disks—as might be expected if planets formed in situ—rather than piled up near disk edges, as would be the case if they migrated in by disk torques. Planets can be brought from disk edges to ultra-short (<1 day) periods by asynchronous equilibrium tides raised on their stars. Tidal migration can account for how ultra-short-period planets are more widely spaced than their longer-period counterparts. Our picture provides a starting point for understanding why the sub-Neptune population drops at ∼10 days regardless of whether the host star is of type FGK or early M. We predict planet occurrence rates around A stars to also break at short periods, but at ∼1 day instead of ∼10 days because A stars rotate faster than stars with lower masses (this prediction presumes that the planetesimal building blocks of planets can drift inside the dust sublimation radius).
International Nuclear Information System (INIS)
Lee, Eve J.; Chiang, Eugene
2017-01-01
Sub-Neptunes around FGKM dwarfs are evenly distributed in log orbital period down to ∼10 days, but dwindle in number at shorter periods. Both the break at ∼10 days and the slope of the occurrence rate down to ∼1 day can be attributed to the truncation of protoplanetary disks by their host star magnetospheres at corotation. We demonstrate this by deriving planet occurrence rate profiles from empirical distributions of pre-main-sequence stellar rotation periods. Observed profiles are better reproduced when planets are distributed randomly in disks—as might be expected if planets formed in situ—rather than piled up near disk edges, as would be the case if they migrated in by disk torques. Planets can be brought from disk edges to ultra-short (<1 day) periods by asynchronous equilibrium tides raised on their stars. Tidal migration can account for how ultra-short-period planets are more widely spaced than their longer-period counterparts. Our picture provides a starting point for understanding why the sub-Neptune population drops at ∼10 days regardless of whether the host star is of type FGK or early M. We predict planet occurrence rates around A stars to also break at short periods, but at ∼1 day instead of ∼10 days because A stars rotate faster than stars with lower masses (this prediction presumes that the planetesimal building blocks of planets can drift inside the dust sublimation radius).
Bernard, Stephen A; Nguyen, Vina; Cameron, Peter; Masci, Kevin; Fitzgerald, Mark; Cooper, David J; Walker, Tony; Std, B Paramed; Myles, Paul; Murray, Lynne; David; Taylor; Smith, Karen; Patrick, Ian; Edington, John; Bacon, Andrew; Rosenfeld, Jeffrey V; Judson, Rodney
2010-12-01
To determine whether paramedic rapid sequence intubation in patients with severe traumatic brain injury (TBI) improves neurologic outcomes at 6 months compared with intubation in the hospital. Severe TBI is associated with a high rate of mortality and long-term morbidity. Comatose patients with TBI routinely undergo endo-tracheal intubation to protect the airway, prevent hypoxia, and control ventilation. In many places, paramedics perform intubation prior to hospital arrival. However, it is unknown whether this approach improves outcomes. In a prospective, randomized, controlled trial, we assigned adults with severe TBI in an urban setting to either prehospital rapid sequence intubation by paramedics or transport to a hospital emergency department for intubation by physicians. The primary outcome measure was the median extended Glasgow Outcome Scale (GOSe) score at 6 months. Secondary end-points were favorable versus unfavorable outcome at 6 months, length of intensive care and hospital stay, and survival to hospital discharge. A total of 312 patients with severe TBI were randomly assigned to paramedic rapid sequence intubation or hospital intubation. The success rate for paramedic intubation was 97%. At 6 months, the median GOSe score was 5 (interquartile range, 1-6) in patients intubated by paramedics compared with 3 (interquartile range, 1-6) in the patients intubated at hospital (P = 0.28).The proportion of patients with favorable outcome (GOSe, 5-8) was 80 of 157 patients (51%) in the paramedic intubation group compared with 56 of 142 patients (39%) in the hospital intubation group (risk ratio, 1.28; 95% confidence interval, 1.00-1.64; P = 0.046). There were no differences in intensive care or hospital length of stay, or in survival to hospital discharge. In adults with severe TBI, prehospital rapid sequence intubation by paramedics increases the rate of favorable neurologic outcome at 6 months compared with intubation in the hospital.
International Nuclear Information System (INIS)
Hollow, M R; Parkes, M J; Clutton-Brock, T H
2011-01-01
Baroreflex sensitivity (BRS) is known to be attenuated by inspiration and all the original BRS methodologies took this into account by measuring only in expiration. Spontaneous sequence analysis (SSA) is a non-invasive clinical tool widely used to estimate BRS in Man but does not take breathing into account. We have therefore modified it to test whether it too can detect inspiratory attenuation. Traditional SSA is also entangled with issues of distinguishing causal from random relationships between blood pressure and heart period and of the optimum choice of data filter settings. We have also tested whether the sequences our modified SSA rejects do behave as random relationships and show the limitations of the absence of filter standardization. SSA was performed on eupneic data from 1 h periods in 20 healthy subjects. Applying SSA traditionally produced a mean BRS of 23 ± 3 ms mmHg −1 . After modification to measure breathing, SSA detected significant inspiratory attenuation (11 ± 1 ms mmHg −1 ), and the mean expiratory BRS was significantly higher (26 ± 5 ms mmHg −1 ). Traditional SSA therefore underestimates BRS by an amount (3 ms mmHg −1 ) as big as the major physiological and clinical factors known to alter BRS. We show that the sequences rejected by SSA do behave like random associations between pressure and period. We also show the minimal effect of the r 2 filter and the biases that some pressure and heart period filters can introduce. We discuss whether SSA might be improved by standardization of filter settings and by also measuring breathing
Motor sequence learning-induced neural efficiency in functional brain connectivity.
Karim, Helmet T; Huppert, Theodore J; Erickson, Kirk I; Wollam, Mariegold E; Sparto, Patrick J; Sejdić, Ervin; VanSwearingen, Jessie M
2017-02-15
Previous studies have shown the functional neural circuitry differences before and after an explicitly learned motor sequence task, but have not assessed these changes during the process of motor skill learning. Functional magnetic resonance imaging activity was measured while participants (n=13) were asked to tap their fingers to visually presented sequences in blocks that were either the same sequence repeated (learning block) or random sequences (control block). Motor learning was associated with a decrease in brain activity during learning compared to control. Lower brain activation was noted in the posterior parietal association area and bilateral thalamus during the later periods of learning (not during the control). Compared to the control condition, we found the task-related motor learning was associated with decreased connectivity between the putamen and left inferior frontal gyrus and left middle cingulate brain regions. Motor learning was associated with changes in network activity, spatial extent, and connectivity. Copyright © 2016 Elsevier B.V. All rights reserved.
Randomizer for High Data Rates
Garon, Howard; Sank, Victor J.
2018-01-01
NASA as well as a number of other space agencies now recognize that the current recommended CCSDS randomizer used for telemetry (TM) is too short. When multiple applications of the PN8 Maximal Length Sequence (MLS) are required in order to fully cover a channel access data unit (CADU), spectral problems in the form of elevated spurious discretes (spurs) appear. Originally the randomizer was called a bit transition generator (BTG) precisely because it was thought that its primary value was to insure sufficient bit transitions to allow the bit/symbol synchronizer to lock and remain locked. We, NASA, have shown that the old BTG concept is a limited view of the real value of the randomizer sequence and that the randomizer also aids in signal acquisition as well as minimizing the potential for false decoder lock. Under the guidelines we considered here there are multiple maximal length sequences under GF(2) which appear attractive in this application. Although there may be mitigating reasons why another MLS sequence could be selected, one sequence in particular possesses a combination of desired properties which offsets it from the others.
Chen, Peng
2014-12-03
Background Protein-ligand binding is important for some proteins to perform their functions. Protein-ligand binding sites are the residues of proteins that physically bind to ligands. Despite of the recent advances in computational prediction for protein-ligand binding sites, the state-of-the-art methods search for similar, known structures of the query and predict the binding sites based on the solved structures. However, such structural information is not commonly available. Results In this paper, we propose a sequence-based approach to identify protein-ligand binding residues. We propose a combination technique to reduce the effects of different sliding residue windows in the process of encoding input feature vectors. Moreover, due to the highly imbalanced samples between the ligand-binding sites and non ligand-binding sites, we construct several balanced data sets, for each of which a random forest (RF)-based classifier is trained. The ensemble of these RF classifiers forms a sequence-based protein-ligand binding site predictor. Conclusions Experimental results on CASP9 and CASP8 data sets demonstrate that our method compares favorably with the state-of-the-art protein-ligand binding site prediction methods.
Digital chaotic sequence generator based on coupled chaotic systems
International Nuclear Information System (INIS)
Shu-Bo, Liu; Jing, Sun; Jin-Shuo, Liu; Zheng-Quan, Xu
2009-01-01
Chaotic systems perform well as a new rich source of cryptography and pseudo-random coding. Unfortunately their digital dynamical properties would degrade due to the finite computing precision. Proposed in this paper is a modified digital chaotic sequence generator based on chaotic logistic systems with a coupling structure where one chaotic subsystem generates perturbation signals to disturb the control parameter of the other one. The numerical simulations show that the length of chaotic orbits, the output distribution of chaotic system, and the security of chaotic sequences have been greatly improved. Moreover the chaotic sequence period can be extended at least by one order of magnitude longer than that of the uncoupled logistic system and the difficulty in decrypting increases 2 128 *2 128 times indicating that the dynamical degradation of digital chaos is effectively improved. A field programmable gate array (FPGA) implementation of an algorithm is given and the corresponding experiment shows that the output speed of the generated chaotic sequences can reach 571.4 Mbps indicating that the designed generator can be applied to the real-time video image encryption. (general)
International Nuclear Information System (INIS)
Cummins, J.D.
1965-02-01
With several white noise sources the various transmission paths of a linear multivariable system may be determined simultaneously. This memorandum considers the restrictions on pseudo-random two state sequences to effect simultaneous identification of several transmission paths and the consequential rejection of cross-coupled signals in linear multivariable systems. The conditions for simultaneous identification are established by an example, which shows that the integration time required is large i.e. tends to infinity, as it does when white noise sources are used. (author)
Zhang, Guang-He; Poon, Carmen C Y; Zhang, Yuan-Ting
2012-01-01
Wireless body sensor network (WBSN), a key building block for m-Health, demands extremely stringent resource constraints and thus lightweight security methods are preferred. To minimize resource consumption, utilizing information already available to a WBSN, particularly common to different sensor nodes of a WBSN, for security purposes becomes an attractive solution. In this paper, we tested the randomness and distinctiveness of the 128-bit biometric binary sequences (BSs) generated from interpulse intervals (IPIs) of 20 healthy subjects as well as 30 patients suffered from myocardial infarction and 34 subjects with other cardiovascular diseases. The encoding time of a biometric BS on a WBSN node is on average 23 ms and memory occupation is 204 bytes for any given IPI sequence. The results from five U.S. National Institute of Standards and Technology statistical tests suggest that random biometric BSs can be generated from both healthy subjects and cardiovascular patients and can potentially be used as authentication identifiers for securing WBSNs. Ultimately, it is preferred that these biometric BSs can be used as encryption keys such that key distribution over the WBSN can be avoided.
Cryptographic pseudo-random sequences from the chaotic Hénon ...
Indian Academy of Sciences (India)
dimensional discrete-time Hénon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity proﬁle, correlation and auto-correlation are investigated. All these properties of the sequences suggest a ...
Ozcelik, M; Guclu, C; Bermede, O; Baytas, V; Altay, N; Karahan, M A; Erdogan, B; Can, O
2016-04-01
The topic of drug administration sequence in rapid sequence induction (RSI) is still an object of interest in terms of rocuronium effectiveness. The aim of this prospective, randomized trial was to evaluate the effect of administration sequence of propofol and remifentanil on ED50 and ED95 of rocuronium in a RSI model. Eighty-four patients were randomized into Group Remifentanil (Group R, n = 43), where induction of general anesthesia started with remifentanil (2 µg/kg) and followed by propofol (2 mg/kg) and rocuronium administrations; and Group Propofol (Group P, n = 41), where induction of general anesthesia started with propofol and followed by remifentanil and rocuronium. First patients in each group were paralyzed by 0.8 mg/kg rocuronium. In case of acceptable intubation as evaluated according to the criteria described by Viby-Mogensen et al, rocuronium dose was decreased by 0.1 mg/kg for the next patient; otherwise, rocuronium dose was increased by 0.1 mg/kg. After three crossover points, increments or decrements in rocuronium dosage were set to 0.05 mg/kg. The process was repeated until a total of ten crossover points were obtained. The ED50 and ED95 doses of rocuronium were similar in Group R (0.182 mg/kg, and 0.244 mg/kg, respectively) and Group P (0.121 mg/kg, and 0.243 mg/kg, respectively) according to 95% CI of the estimates. There was no statistically significant difference in terms of clinically acceptable intubation conditions between the two groups (56.1% in Group R vs. 59% in Group P, p = 0.795). The choice of administration sequence of propofol and remifentanil does not have an impact on estimated ED50 and ED95 of rocuronium in providing acceptable intubation conditions in the RSI technique.
Repp, Bruno H
2003-04-01
Four experiments showed that both single and periodic distractor tones affected the timing of finger taps produced in synchrony with an isochronous auditory target sequence. Single distractors had only small effects, but periodic distractors occurring at various fixed or changing phase relationships exerted strong phase attraction. The attraction was asymmetric, being stronger when distractors preceded target tones than when they lagged behind. A large pitch difference between target and distractor tones (20 vs. 3 semitones) did not reduce phase attraction substantially, although in the case of continuously changing phase relationships it did prevent complete capture of the taps by the distractors. The results support the hypothesis that phase attraction is an automatic process that is sensitive primarily to event onsets.
Information decomposition method to analyze symbolical sequences
International Nuclear Information System (INIS)
Korotkov, E.V.; Korotkova, M.A.; Kudryashov, N.A.
2003-01-01
The information decomposition (ID) method to analyze symbolical sequences is presented. This method allows us to reveal a latent periodicity of any symbolical sequence. The ID method is shown to have advantages in comparison with application of the Fourier transformation, the wavelet transform and the dynamic programming method to look for latent periodicity. Examples of the latent periods for poetic texts, DNA sequences and amino acids are presented. Possible origin of a latent periodicity for different symbolical sequences is discussed
Non-random alkylation of DNA sequences induced in vivo by chemical mutagens
Energy Technology Data Exchange (ETDEWEB)
Durante, M.; Geri, C.; Bonatti, S.; Parenti, R. (Universita di Pisa (Italy))
1989-08-01
Previous studies of the interaction of alkylating agents on the eukaryotic genome support the idea that induction of DNA adducts is at specific genomic sites. Here we show molecular and cytological evidence that alkylation is rather specific. Mammalian cell cultures were exposed to different doses of mutagens and the DNA was analyzed by density gradient ultracentrifugation, hydroxylapatite fractionation, and by restriction enzyme analysis. Studies with the labelled mutagens N-ethyl-N-nitrosourea and N-methyl-N'-nitro-N-nitrosoguanidine show that there is a non-random distribution of the adducts. The adducts are found more frequently in A-T, G-C rich satellite DNA and highly repetitive sequences. Analysis with restriction enzymes shows that both methyl and ethyl groups influence the restriction patterns of the enzymes HpaII and MspI that recognize specific endogenous DNA methylation. These data suggest, as a subsequent mechanism, a modification in the pattern of the normal endogenous methylation of 5-methylcytosine.
The additive congruential random number generator--A special case of a multiple recursive generator
Wikramaratna, Roy S.
2008-07-01
This paper considers an approach to generating uniformly distributed pseudo-random numbers which works well in serial applications but which also appears particularly well-suited for application on parallel processing systems. Additive Congruential Random Number (ACORN) generators are straightforward to implement for arbitrarily large order and modulus; if implemented using integer arithmetic, it becomes possible to generate identical sequences on any machine. Previously published theoretical analysis has demonstrated that a kth order ACORN sequence approximates to being uniformly distributed in up to k dimensions, for any given k. ACORN generators can be constructed to give period lengths exceeding any given number (for example, with period length in excess of 230p, for any given p). Results of empirical tests have demonstrated that, if p is greater than or equal to 2, then the ACORN generator can be used successfully for generating double precision uniform random variates. This paper demonstrates that an ACORN generator is a particular case of a multiple recursive generator (and, therefore, also a special case of a matrix generator). Both these latter approaches have been widely studied, and it is to be hoped that the results given in the present paper will lead to greater confidence in using the ACORN generators.
Qayyum, Aisha; Najmi, Muzammil Hasan; Abbas, Mateen
2013-11-01
Comparative bioavailability studies are conducted to establish the bioequivalence of generic formulation with that of branded reference formulation, providing confidence to clinicians to use these products interchangeably. This study was carried out to compare a locally manufactured formulation of flurbiprofen with that of a branded product. Twenty two healthy male adults received a single dose of flurbiprofen (100mg) either generic or branded product according to randomization scheme on each of 2 periods. Blood samples were collected and plasma flurbiprofen concentration was determined by a validated HPLC method. Pharmacokinetic parameters like AUC(0-t), AUC(0-oo), Cmax, Tmax, t½, Vd and clearance were determined. The 90% CI for the ratio of geometric means of test to reference product's pharmacokinetic variables was calculated. Pharmacokinetic parameters for two formulations were comparable. Ratio of means of AUC(0-24), AUC(0-oo) and Cmax for test to reference products and 90% CI for these ratios were within the acceptable range. The p-values calculated by TOST were much less than the specified value (p-0.05). ANOVA gave p-values which were more than the specified value (p-0.05) for sequence, subject, period and formulation. Test formulation of flurbiprofen (tablet Flurso) was found to meet the criteria for bioequivalence to branded product (tablet Ansaid) based on pharmacokinetic parameters.
Staskin, David; Herschorn, Sender; Fialkov, Jonathan; Tu, Le Mai; Walsh, Terry; Schermer, Carol R
2018-02-01
The objective of this study was to assess the tolerability and treatment preference in patients with overactive bladder (OAB) treated with mirabegron or tolterodine. This was a two-period, 8-week crossover, double-blind, phase IV study (PREFER; NCT02138747) in treatment-naive adults with OAB for 3 months or longer randomized to one of four treatment sequences in a 5:5:1:1 ratio (mirabegron/tolterodine, tolterodine/mirabegron, mirabegron/mirabegron, or tolterodine/tolterodine), separated by a washout period of 2 weeks. The primary endpoint was drug tolerability using the Medication Tolerability scale of the OAB Treatment Satisfaction (OAB-S) questionnaire at end of treatment (EoT). Period-by-treatment interactions were analyzed to determine any effect of drug order. Patient preference, change from baseline in OAB symptoms, and treatment-emergent adverse events (TEAEs) were assessed. A total of 358 randomized patients completed the OAB-S Medication Tolerability scale questionnaire at one or more visits after the baseline evaluation. The mean (95% CI) OAB-S Medication Tolerability scores were significantly higher (better tolerability) for mirabegron (86.29 [83.50, 89.08]) than for tolterodine (83.40 [80.59, 86.20]; p = 0.004). The period-by-treatment interaction was not significant (p = 0.955). Improvements in OAB-S Medication Tolerability scores at EoT were more evident in women, patients aged ≥65 years, and in patients without baseline incontinence, and were greater with mirabegron than with tolterodine extended release. There were no significant differences in patient preference or improvements in OAB symptoms. Significant differences in favor of mirabegron were observed for anticholinergic TEAEs (20.4% vs. 27.4%; p = 0.042) and specifically for gastrointestinal disorders (14.7% vs. 22.5%; p = 0.015). Tolerability of mirabegron was significantly higher than that of tolterodine, and patient preference and improvements in OAB symptoms were comparable
Xian, Zhi-Hong; Cong, Wen-Ming; Zhang, Shu-Hui; Wu, Meng-Chao
2005-01-01
AIM: To study the genetic alterations and their association with clinicopathological characteristics of hepatocellular carcinoma (HCC), and to find the tumor related DNA fragments. METHODS: DNA isolated from tumors and corresponding noncancerous liver tissues of 56 HCC patients was amplified by random amplified polymorphic DNA (RAPD) with 10 random 10-mer arbitrary primers. The RAPD bands showing obvious differences in tumor tissue DNA corresponding to that of normal tissue were separated, purified, cloned and sequenced. DNA sequences were analyzed and compared with GenBank data. RESULTS: A total of 56 cases of HCC were demonstrated to have genetic alterations, which were detected by at least one primer. The detestability of genetic alterations ranged from 20% to 70% in each case, and 17.9% to 50% in each primer. Serum HBV infection, tumor size, histological grade, tumor capsule, as well as tumor intrahepatic metastasis, might be correlated with genetic alterations on certain primers. A band with a higher intensity of 480 bp or so amplified fragments in tumor DNA relative to normal DNA could be seen in 27 of 56 tumor samples using primer 4. Sequence analysis of these fragments showed 91% homology with Homo sapiens double homeobox protein DUX10 gene. CONCLUSION: Genetic alterations are a frequent event in HCC, and tumor related DNA fragments have been found in this study, which may be associated with hepatocarcin-ogenesis. RAPD is an effective method for the identification and analysis of genetic alterations in HCC, and may provide new information for further evaluating the molecular mechanism of hepatocarcinogenesis. PMID:15996039
International Nuclear Information System (INIS)
Procassini, R J; Beck, B R
2004-01-01
It might be assumed that use of a ''high-quality'' random number generator (RNG), producing a sequence of ''pseudo random'' numbers with a ''long'' repetition period, is crucial for producing unbiased results in Monte Carlo particle transport simulations. While several theoretical and empirical tests have been devised to check the quality (randomness and period) of an RNG, for many applications it is not clear what level of RNG quality is required to produce unbiased results. This paper explores the issue of RNG quality in the context of parallel, Monte Carlo transport simulations in order to determine how ''good'' is ''good enough''. This study employs the MERCURY Monte Carlo code, which incorporates the CNPRNG library for the generation of pseudo-random numbers via linear congruential generator (LCG) algorithms. The paper outlines the usage of random numbers during parallel MERCURY simulations, and then describes the source and criticality transport simulations which comprise the empirical basis of this study. A series of calculations for each test problem in which the quality of the RNG (period of the LCG) is varied provides the empirical basis for determining the minimum repetition period which may be employed without producing a bias in the mean integrated results
Dwivedi, Prashant Povel; Choi, Hee Joo; Kim, Byoung Joo; Cha, Myoungsik
2013-12-16
Random duty-cycle errors (RDE) in ferroelectric quasi-phase-matching (QPM) devices not only affect the frequency conversion efficiency, but also generate non-phase-matched parasitic noise that can be detrimental to some applications. We demonstrate an accurate but simple method for measuring the RDE in periodically poled lithium niobate. Due to the equivalence between the undepleted harmonic generation spectrum and the diffraction pattern from the QPM grating, we employed linear diffraction measurement which is much simpler than tunable harmonic generation experiments [J. S. Pelc, et al., Opt. Lett.36, 864-866 (2011)]. As a result, we could relate the RDE for the QPM device to the relative noise intensity between the diffraction orders.
Autonomous Byte Stream Randomizer
Paloulian, George K.; Woo, Simon S.; Chow, Edward T.
2013-01-01
Net-centric networking environments are often faced with limited resources and must utilize bandwidth as efficiently as possible. In networking environments that span wide areas, the data transmission has to be efficient without any redundant or exuberant metadata. The Autonomous Byte Stream Randomizer software provides an extra level of security on top of existing data encryption methods. Randomizing the data s byte stream adds an extra layer to existing data protection methods, thus making it harder for an attacker to decrypt protected data. Based on a generated crypto-graphically secure random seed, a random sequence of numbers is used to intelligently and efficiently swap the organization of bytes in data using the unbiased and memory-efficient in-place Fisher-Yates shuffle method. Swapping bytes and reorganizing the crucial structure of the byte data renders the data file unreadable and leaves the data in a deconstructed state. This deconstruction adds an extra level of security requiring the byte stream to be reconstructed with the random seed in order to be readable. Once the data byte stream has been randomized, the software enables the data to be distributed to N nodes in an environment. Each piece of the data in randomized and distributed form is a separate entity unreadable on its own right, but when combined with all N pieces, is able to be reconstructed back to one. Reconstruction requires possession of the key used for randomizing the bytes, leading to the generation of the same cryptographically secure random sequence of numbers used to randomize the data. This software is a cornerstone capability possessing the ability to generate the same cryptographically secure sequence on different machines and time intervals, thus allowing this software to be used more heavily in net-centric environments where data transfer bandwidth is limited.
International Nuclear Information System (INIS)
Li, Yang; Chen, Xingfan; Liu, Cheng
2015-01-01
The frequency characteristic is an important indicator of a system’s dynamic performance. The identification of a fiber optic gyroscope (FOG)’s frequency characteristic using a correlation spectrum analysis method based on a pseudo-random sequence is proposed. Taking the angle vibrator as the source of the test rotation stimulation and a pseudo-random sequence as the test signal, the frequency characteristic of a FOG is calculated according to the power spectral density of the rotation rate signal and the cross-power spectral density of the FOG’s output signal and rotation rate signal. A theoretical simulation is done to confirm the validity of this method. An experiment system is built and the test results indicate that the measurement error of the normalized amplitude–frequency response is less than 0.01, that the error of the phase–frequency response is less than 0.3 rad, and the overall measurement accuracy is superior to the traditional frequency-sweep method. By using this method, the FOG’s amplitude–frequency response and phase–frequency response can be measured simultaneously, quickly, accurately, and with a high frequency resolution. The described method meets the requirements of engineering applications. (paper)
Directory of Open Access Journals (Sweden)
Xin Ma
2015-01-01
Full Text Available The prediction of RNA-binding proteins is one of the most challenging problems in computation biology. Although some studies have investigated this problem, the accuracy of prediction is still not sufficient. In this study, a highly accurate method was developed to predict RNA-binding proteins from amino acid sequences using random forests with the minimum redundancy maximum relevance (mRMR method, followed by incremental feature selection (IFS. We incorporated features of conjoint triad features and three novel features: binding propensity (BP, nonbinding propensity (NBP, and evolutionary information combined with physicochemical properties (EIPP. The results showed that these novel features have important roles in improving the performance of the predictor. Using the mRMR-IFS method, our predictor achieved the best performance (86.62% accuracy and 0.737 Matthews correlation coefficient. High prediction accuracy and successful prediction performance suggested that our method can be a useful approach to identify RNA-binding proteins from sequence information.
DEFF Research Database (Denmark)
Jensen, Peter Ruhdal; Hammer, Karin
1998-01-01
A library of synthetic promoters for Lactococcus lactis was constructed, in which the known consensus sequences were kept constant while the sequences of the separating spacers were randomized. The library consists of 38 promoters which differ in strength from 0.3 relative units, and up to more t......-reactors and cell factories....
Directory of Open Access Journals (Sweden)
Roniram Pereira da Silva
2014-04-01
Full Text Available The planting of diversified crops during the sugarcane fallow period can improve the chemical and physical properties and increase the production potential of the soil for the next sugarcane cycle. The primary purpose of this study was to assess the influence of various soil uses during the sugarcane fallow period on soil chemical and physical properties and productivity after the first sugarcane harvest. The experiment was conducted in two areas located in Jaboticabal, São Paulo State, Brazil (21º 14' 05'' S, 48º 17' 09'' W with two different soil types, namely: an eutroferric Red Latosol (RLe with high-clay texture (clay content = 680 g kg-1 and an acric Red Latosol (RLa with clayey texture (clay content = 440 g kg-1. A randomized block design with five replications and four treatments (crop sequences was used. The crop sequences during the sugarcane fallow period were soybean/millet/soybean, soybean/sunn hemp/soybean, soybean/fallow/soybean, and soybean. Soil use was found not to affect chemical properties and sugarcane productivity of RLe or RLa. The soybean/millet/soybean sequence improved aggregation in the acric Latosol.
Randomness at the root of things 1: Random walks
Ogborn, Jon; Collins, Simon; Brown, Mick
2003-09-01
This is the first of a pair of articles about randomness in physics. In this article, we use some variations on the idea of a `random walk' to consider first the path of a particle in Brownian motion, and then the random variation to be expected in radioactive decay. The arguments are set in the context of the general importance of randomness both in physics and in everyday life. We think that the ideas could usefully form part of students' A-level work on random decay and quantum phenomena, as well as being good for their general education. In the second article we offer a novel and simple approach to Poisson sequences.
Deroost, Natacha; Coomans, Daphné
2018-02-01
We examined the role of sequence awareness in a pure perceptual sequence learning design. Participants had to react to the target's colour that changed according to a perceptual sequence. By varying the mapping of the target's colour onto the response keys, motor responses changed randomly. The effect of sequence awareness on perceptual sequence learning was determined by manipulating the learning instructions (explicit versus implicit) and assessing the amount of sequence awareness after the experiment. In the explicit instruction condition (n = 15), participants were instructed to intentionally search for the colour sequence, whereas in the implicit instruction condition (n = 15), they were left uninformed about the sequenced nature of the task. Sequence awareness after the sequence learning task was tested by means of a questionnaire and the process-dissociation-procedure. The results showed that the instruction manipulation had no effect on the amount of perceptual sequence learning. Based on their report to have actively applied their sequence knowledge during the experiment, participants were subsequently regrouped in a sequence strategy group (n = 14, of which 4 participants from the implicit instruction condition and 10 participants from the explicit instruction condition) and a no-sequence strategy group (n = 16, of which 11 participants from the implicit instruction condition and 5 participants from the explicit instruction condition). Only participants of the sequence strategy group showed reliable perceptual sequence learning and sequence awareness. These results indicate that perceptual sequence learning depends upon the continuous employment of strategic cognitive control processes on sequence knowledge. Sequence awareness is suggested to be a necessary but not sufficient condition for perceptual learning to take place. Copyright © 2018 Elsevier B.V. All rights reserved.
The RANDOM computer program: A linear congruential random number generator
Miles, R. F., Jr.
1986-01-01
The RANDOM Computer Program is a FORTRAN program for generating random number sequences and testing linear congruential random number generators (LCGs). The linear congruential form of random number generator is discussed, and the selection of parameters of an LCG for a microcomputer described. This document describes the following: (1) The RANDOM Computer Program; (2) RANDOM.MOD, the computer code needed to implement an LCG in a FORTRAN program; and (3) The RANCYCLE and the ARITH Computer Programs that provide computational assistance in the selection of parameters for an LCG. The RANDOM, RANCYCLE, and ARITH Computer Programs are written in Microsoft FORTRAN for the IBM PC microcomputer and its compatibles. With only minor modifications, the RANDOM Computer Program and its LCG can be run on most micromputers or mainframe computers.
Random skew plane partitions with a piecewise periodic back wall
DEFF Research Database (Denmark)
Boutillier, Cedric; Mkrtchyan, Sevak; Reshetikhin, Nicolai
Random skew plane partitions of large size distributed according to an appropriately scaled Schur process develop limit shapes. In the present work we consider the limit of large random skew plane partitions where the inner boundary approaches a piecewise linear curve with non-lattice slopes. Muc...
Subjective randomness as statistical inference.
Griffiths, Thomas L; Daniels, Dylan; Austerweil, Joseph L; Tenenbaum, Joshua B
2018-06-01
Some events seem more random than others. For example, when tossing a coin, a sequence of eight heads in a row does not seem very random. Where do these intuitions about randomness come from? We argue that subjective randomness can be understood as the result of a statistical inference assessing the evidence that an event provides for having been produced by a random generating process. We show how this account provides a link to previous work relating randomness to algorithmic complexity, in which random events are those that cannot be described by short computer programs. Algorithmic complexity is both incomputable and too general to capture the regularities that people can recognize, but viewing randomness as statistical inference provides two paths to addressing these problems: considering regularities generated by simpler computing machines, and restricting the set of probability distributions that characterize regularity. Building on previous work exploring these different routes to a more restricted notion of randomness, we define strong quantitative models of human randomness judgments that apply not just to binary sequences - which have been the focus of much of the previous work on subjective randomness - but also to binary matrices and spatial clustering. Copyright © 2018 Elsevier Inc. All rights reserved.
Conchon, Marilia Ferrari; Fonseca, Ligia Fahl
2018-04-01
Perioperative thirst is an intense discomfort with high incidence in the immediate postoperative period, but nonetheless, it is highly neglected in clinical practice. The purpose of this study was to evaluate the efficacy of an ice popsicle compared with water at room temperature for thirst relief in the immediate postoperative period in terms of variation in the intensity of the initial compared with the final thirst and the satiety reached after an hour of evaluation and intervention. A parallel randomized clinical trial was used. A total of 208 patients in the immediate postoperative period were assessed for 1 hour, every 15 minutes. Thirst intensity was assessed initially and subsequently; interventions were performed according to the group: (1) control group, 10 mL of water at room temperature; and (2) experimental group, 10-mL ice popsicle. The ice popsicle was 37.8% (P popsicle has greater efficacy than water at room temperature for thirst management in the immediate postoperative period. Copyright © 2016 American Society of PeriAnesthesia Nurses. Published by Elsevier Inc. All rights reserved.
Tori sequences as remnants of multiple accreting periods of Kerr SMBHs
Pugliese, D.; Stuchlík, Z.
2018-03-01
Super-massive black holes (SMBHs) hosted in active galactic nuclei (AGNs) can be characterized by multi-accreting periods as the attractors interact with the environment during their life-time. These multi-accretion episodes should leave traces in the matter orbiting the attractor. Counterrotating and even misaligned structures orbiting around the SMBHs would be consequences of these episodes. Our task in this work is to consider situations where such accretions occur and to trace their remnants represented by several toroidal accreting fluids, corotating or counterrotating relative to the central Kerr attractor, and created in various regimes during the evolution of matter configurations around SMBHs. We focus particularly on the emergence of matter instabilities, i.e., tori collisions, accretion onto the central Kerr black hole, or creation of jet-like structures (proto-jets). Each orbiting configuration is governed by the general relativistic hydrodynamic Boyer condition of equilibrium configurations of rotating perfect fluid. We prove that sequences of configurations and hot points, where an instability occurs, characterize the Kerr SMBHs, depending mainly on their spin-mass ratios. The occurrence of tori accretion or collision are strongly constrained by the fluid rotation with respect to the central black hole and the relative rotation with respect to each other. Our investigation provides characteristic of attractors where traces of multi-accreting episodes can be found and observed.
Random walks in Euclidean space
Varjú, Péter Pál
2012-01-01
Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove a local limit theorem under a suitable moment condition and a necessary non-degeneracy condition. Under stronger hypothesis, we prove a limit theorem on a wide range of scales: between e^(-cl^(1/4)) and l^(1/2), where l is the number of steps.
Sequence memory based on coherent spin-interaction neural networks.
Xia, Min; Wong, W K; Wang, Zhijie
2014-12-01
Sequence information processing, for instance, the sequence memory, plays an important role on many functions of brain. In the workings of the human brain, the steady-state period is alterable. However, in the existing sequence memory models using heteroassociations, the steady-state period cannot be changed in the sequence recall. In this work, a novel neural network model for sequence memory with controllable steady-state period based on coherent spininteraction is proposed. In the proposed model, neurons fire collectively in a phase-coherent manner, which lets a neuron group respond differently to different patterns and also lets different neuron groups respond differently to one pattern. The simulation results demonstrating the performance of the sequence memory are presented. By introducing a new coherent spin-interaction sequence memory model, the steady-state period can be controlled by dimension parameters and the overlap between the input pattern and the stored patterns. The sequence storage capacity is enlarged by coherent spin interaction compared with the existing sequence memory models. Furthermore, the sequence storage capacity has an exponential relationship to the dimension of the neural network.
International Nuclear Information System (INIS)
Guo Ya'nan; Jin Dapeng; Zhao Dixin; Liu Zhen'an; Qiao Qiao; Chinese Academy of Sciences, Beijing
2007-01-01
Due to the randomness of radioactive decay and nuclear reaction, the signals from detectors are random in time. But normal pulse generator generates periodical pulses. To measure the performances of nuclear electronic devices under random inputs, a random generator is necessary. Types of random pulse generator are reviewed, 2 digital random pulse generators are introduced. (authors)
Quantitative measure of randomness and order for complete genomes
Kong, Sing-Guan; Fan, Wen-Lang; Chen, Hong-Da; Wigger, Jan; Torda, Andrew E.; Lee, H. C.
2009-06-01
We propose an order index, ϕ , which gives a quantitative measure of randomness and order of complete genomic sequences. It maps genomes to a number from 0 (random and of infinite length) to 1 (fully ordered) and applies regardless of sequence length. The 786 complete genomic sequences in GenBank were found to have ϕ values in a very narrow range, ϕg=0.031-0.015+0.028 . We show this implies that genomes are halfway toward being completely random, or, at the “edge of chaos.” We further show that artificial “genomes” converted from literary classics have ϕ ’s that almost exactly coincide with ϕg , but sequences of low information content do not. We infer that ϕg represents a high information-capacity “fixed point” in sequence space, and that genomes are driven to it by the dynamics of a robust growth and evolution process. We show that a growth process characterized by random segmental duplication can robustly drive genomes to the fixed point.
Least squares deconvolution for leak detection with a pseudo random binary sequence excitation
Nguyen, Si Tran Nguyen; Gong, Jinzhe; Lambert, Martin F.; Zecchin, Aaron C.; Simpson, Angus R.
2018-01-01
Leak detection and localisation is critical for water distribution system pipelines. This paper examines the use of the time-domain impulse response function (IRF) for leak detection and localisation in a pressurised water pipeline with a pseudo random binary sequence (PRBS) signal excitation. Compared to the conventional step wave generated using a single fast operation of a valve closure, a PRBS signal offers advantageous correlation properties, in that the signal has very low autocorrelation for lags different from zero and low cross correlation with other signals including noise and other interference. These properties result in a significant improvement in the IRF signal to noise ratio (SNR), leading to more accurate leak localisation. In this paper, the estimation of the system IRF is formulated as an optimisation problem in which the l2 norm of the IRF is minimised to suppress the impact of noise and interference sources. Both numerical and experimental data are used to verify the proposed technique. The resultant estimated IRF provides not only accurate leak location estimation, but also good sensitivity to small leak sizes due to the improved SNR.
Nittayananta, W; DeRouen, TA; Arirachakaran, P; Laothumthut, T; Pangsomboon, K; Petsantad, S; Vuddhakul, V; Sriplung, H; Jaruratanasirikul, S; Martin, MD
2011-01-01
OBJECTIVE To determine if chlorhexidine can be used as an intervention to prolong the time to relapse of oral candidiasis. SUBJECTS AND METHODS A double-blinded randomized clinical trial was performed in 75 HIV/AIDS subjects with oral candidiasis. Clotrimazole troche was prescribed, and the subjects were re-examined every 2 weeks until the lesions were completely eradicated. The subjects were then randomly divided into two groups; 0.12% chlorhexidine (n = 37, aged 22–52 years, mean 34 years) and 0.9% normal saline (n = 38, aged 22–55 years, mean 38 years). They were re-examined every 2 weeks until the next episode was observed. RESULTS The time to recurrence of oral candidiasis between the chlorhexidine and the saline group was not statistically significant (P > 0.05). The following variables were significantly associated with the time of recurrence; frequency of antifungal therapy (P = 0.011), total lymphocyte (P = 0.017), alcohol consumption (P = 0.043), and candidiasis on gingiva (P = 0.048). The subjects with lower lymphocyte showed shorter oral candidiasis-free periods (P = 0.034). CONCLUSIONS Chlorhexidine showed a small but not statistically significant effect in maintenance of oral candidiasis-free period. This lack of significance may be due to the small sample size. Further study should be performed to better assess the size of the effect, or to confirm our findings. PMID:18627504
Secure self-calibrating quantum random-bit generator
International Nuclear Information System (INIS)
Fiorentino, M.; Santori, C.; Spillane, S. M.; Beausoleil, R. G.; Munro, W. J.
2007-01-01
Random-bit generators (RBGs) are key components of a variety of information processing applications ranging from simulations to cryptography. In particular, cryptographic systems require 'strong' RBGs that produce high-entropy bit sequences, but traditional software pseudo-RBGs have very low entropy content and therefore are relatively weak for cryptography. Hardware RBGs yield entropy from chaotic or quantum physical systems and therefore are expected to exhibit high entropy, but in current implementations their exact entropy content is unknown. Here we report a quantum random-bit generator (QRBG) that harvests entropy by measuring single-photon and entangled two-photon polarization states. We introduce and implement a quantum tomographic method to measure a lower bound on the 'min-entropy' of the system, and we employ this value to distill a truly random-bit sequence. This approach is secure: even if an attacker takes control of the source of optical states, a secure random sequence can be distilled
Random walk centrality for temporal networks
International Nuclear Information System (INIS)
Rocha, Luis E C; Masuda, Naoki
2014-01-01
Nodes can be ranked according to their relative importance within a network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks, for example the PageRank, have focused on static structures. However, several realistic networks are indeed dynamic, meaning that their structure changes in time. In this paper, we propose a centrality measure for temporal networks based on random walks under periodic boundary conditions that we call TempoRank. It is known that, in static networks, the stationary density of the random walk is proportional to the degree or the strength of a node. In contrast, we find that, in temporal networks, the stationary density is proportional to the in-strength of the so-called effective network, a weighted and directed network explicitly constructed from the original sequence of transition matrices. The stationary density also depends on the sojourn probability q, which regulates the tendency of the walker to stay in the node, and on the temporal resolution of the data. We apply our method to human interaction networks and show that although it is important for a node to be connected to another node with many random walkers (one of the principles of the PageRank) at the right moment, this effect is negligible in practice when the time order of link activation is included. (paper)
Random walk centrality for temporal networks
Rocha, Luis E. C.; Masuda, Naoki
2014-06-01
Nodes can be ranked according to their relative importance within a network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks, for example the PageRank, have focused on static structures. However, several realistic networks are indeed dynamic, meaning that their structure changes in time. In this paper, we propose a centrality measure for temporal networks based on random walks under periodic boundary conditions that we call TempoRank. It is known that, in static networks, the stationary density of the random walk is proportional to the degree or the strength of a node. In contrast, we find that, in temporal networks, the stationary density is proportional to the in-strength of the so-called effective network, a weighted and directed network explicitly constructed from the original sequence of transition matrices. The stationary density also depends on the sojourn probability q, which regulates the tendency of the walker to stay in the node, and on the temporal resolution of the data. We apply our method to human interaction networks and show that although it is important for a node to be connected to another node with many random walkers (one of the principles of the PageRank) at the right moment, this effect is negligible in practice when the time order of link activation is included.
Randomness confidence bands of fractal scaling exponents for financial price returns
International Nuclear Information System (INIS)
Ibarra-Valdez, C.; Alvarez, J.; Alvarez-Ramirez, J.
2016-01-01
Highlights: • A robust test for randomness of price returns is proposed. • The DFA scaling exponent is contrasted against confidence bands for random sequences. • The size of the band depends of the sequence length. • Crude oil and USA stock markets have been rarely inefficient. - Abstract: The weak-form of the efficient market hypothesis (EMH) establishes that price returns behave as a pure random process and so their outcomes cannot be forecasted. The detrended fluctuation analysis (DFA) has been widely used to test the weak-form of the EMH by showing that time series of price returns are serially uncorrelated. In this case, the DFA scaling exponent exhibits deviations from the theoretical value of 0.5. This work considers the test of the EMH for DFA implementation on a sliding window, which is an approach that is intended to monitor the evolution of markets. Under these conditions, the scaling exponent exhibits important variations over the scrutinized period that can offer valuable insights in the behavior of the market provided the estimated scaling value is kept within strict statistical tests to verify the presence or not of serial correlations in the price returns. In this work, the statistical tests are based on comparing the estimated scaling exponent with the values obtained from pure Gaussian sequences with the length of the real time series. In this way, the presence of serial correlations can be guaranteed only in terms of the confidence bands of a pure Gaussian process. The crude oil (WTI) and the USA stock (DJIA) markets are used to illustrate the methodology.
Roden, Suzanne E; Dutton, Peter H; Morin, Phillip A
2009-01-01
The green sea turtle, Chelonia mydas, was used as a case study for single nucleotide polymorphism (SNP) discovery in a species that has little genetic sequence information available. As green turtles have a complex population structure, additional nuclear markers other than microsatellites could add to our understanding of their complex life history. Amplified fragment length polymorphism technique was used to generate sets of random fragments of genomic DNA, which were then electrophoretically separated with precast gels, stained with SYBR green, excised, and directly sequenced. It was possible to perform this method without the use of polyacrylamide gels, radioactive or fluorescent labeled primers, or hybridization methods, reducing the time, expense, and safety hazards of SNP discovery. Within 13 loci, 2547 base pairs were screened, resulting in the discovery of 35 SNPs. Using this method, it was possible to yield a sufficient number of loci to screen for SNP markers without the availability of prior sequence information.
Random number generation and creativity.
Bains, William
2008-01-01
A previous paper suggested that humans can generate genuinely random numbers. I tested this hypothesis by repeating the experiment with a larger number of highly numerate subjects, asking them to call out a sequence of digits selected from 0 through 9. The resulting sequences were substantially non-random, with an excess of sequential pairs of numbers and a deficit of repeats of the same number, in line with previous literature. However, the previous literature suggests that humans generate random numbers with substantial conscious effort, and distractions which reduce that effort reduce the randomness of the numbers. I reduced my subjects' concentration by asking them to call out in another language, and with alcohol - neither affected the randomness of their responses. This suggests that the ability to generate random numbers is a 'basic' function of the human mind, even if those numbers are not mathematically 'random'. I hypothesise that there is a 'creativity' mechanism, while not truly random, provides novelty as part of the mind's defence against closed programming loops, and that testing for the effects seen here in people more or less familiar with numbers or with spontaneous creativity could identify more features of this process. It is possible that training to perform better at simple random generation tasks could help to increase creativity, through training people to reduce the conscious mind's suppression of the 'spontaneous', creative response to new questions.
Application of random numbers at computerized simulation of proton magnetic resonance signals
International Nuclear Information System (INIS)
Populyakh, S.N.; Sapiga, A.V.
2006-01-01
One calculated numerically spectra of proton magnetic resonance of water molecules diffusing along the regular positions in a natrolite. One reached adequate conformity of the experimental and the calculated spectra within wide temperature range including a transition region. To ensure calculations one used generators of the pseudorandom Markov sequences. The numerical analysis, in particular, has shown that at the binary Markov process the time period when physical value remains unchanged is described by the random value with exponential distribution [ru
DEFF Research Database (Denmark)
Sindrup, Søren Hein; Konder, R; Lehmann, R
2012-01-01
with tramadol. During 4-week treatment periods, daily oral doses of either GRT9906 120-240 mg, or placebo, or tramadol 200-400 mg were given. These were separated by 1-week washout periods. The primary endpoint was the average pain intensity (average of daily current pain intensity over the last 3 days of each......GRT9906 is an investigational novel compound with μ-opioid receptor agonism and inhibition of noradrenalin/serotonin re-uptake. In this randomized, double-blind, placebo-controlled, three-way cross-over trial in painful polyneuropathy, the efficacy and safety of GRT9906 was assessed and compared...... treatment period rated on a 0 to 10-point numeric rating scale). One hundred seventeen patients were enrolled and 64 were randomized to one of six treatment sequences. Forty-seven patients qualified for the per protocol analysis. GRT9906 reduced average pain intensity by 2.1 points compared with a reduction...
Multiformity of inherent randomicity and visitation density in n symbolic dynamics
International Nuclear Information System (INIS)
Zhang Yagang; Wang Changjiang
2007-01-01
The multiformity of inherent randomicity and visitation density in n symbolic dynamics will be clarified in this paper. These stochastic symbolic sequences bear three features. The distribution of frequency, inter-occurrence times and the alignment of two random sequences are amplified in detail. The features of visitation density in surjective maps presents catholicity and the catholicity in n letters randomicity has the same measure foundation. We hope to offer a symbolic platform that satisfies these stochastic properties and to attempt to study certain properties of DNA base sequences, 20 amino acids symbolic sequences of proteid structure, and the time series that can be symbolic in finance market et al
Effects of changing the random number stride in Monte Carlo calculations
International Nuclear Information System (INIS)
Hendricks, J.S.
1991-01-01
This paper reports on a common practice in Monte Carlo radiation transport codes which is to start each random walk a specified number of steps up the random number sequence from the previous one. This is called the stride in the random number sequence between source particles. It is used for correlated sampling or to provide tree-structured random numbers. A new random number generator algorithm for the major Monte Carlo code MCNP has been written to allow adjustment of the random number stride. This random number generator is machine portable. The effects of varying the stride for several sample problems are examined
International Nuclear Information System (INIS)
Chakraborty, Brahmananda
2009-01-01
Random number plays an important role in any Monte Carlo simulation. The accuracy of the results depends on the quality of the sequence of random numbers employed in the simulation. These include randomness of the random numbers, uniformity of their distribution, absence of correlation and long period. In a typical Monte Carlo simulation of particle transport in a nuclear reactor core, the history of a particle from its birth in a fission event until its death by an absorption or leakage event is tracked. The geometry of the core and the surrounding materials are exactly modeled in the simulation. To track a neutron history one needs random numbers for determining inter collision distance, nature of the collision, the direction of the scattered neutron etc. Neutrons are tracked in batches. In one batch approximately 2000-5000 neutrons are tracked. The statistical accuracy of the results of the simulation depends on the total number of particles (number of particles in one batch multiplied by the number of batches) tracked. The number of histories to be generated is usually large for a typical radiation transport problem. To track a very large number of histories one needs to generate a long sequence of independent random numbers. In other words the cycle length of the random number generator (RNG) should be more than the total number of random numbers required for simulating the given transport problem. The number of bits of the machine generally limits the cycle length. For a binary machine of p bits the maximum cycle length is 2 p . To achieve higher cycle length in the same machine one has to use either register arithmetic or bit manipulation technique
DNA-based random number generation in security circuitry.
Gearheart, Christy M; Arazi, Benjamin; Rouchka, Eric C
2010-06-01
DNA-based circuit design is an area of research in which traditional silicon-based technologies are replaced by naturally occurring phenomena taken from biochemistry and molecular biology. This research focuses on further developing DNA-based methodologies to mimic digital data manipulation. While exhibiting fundamental principles, this work was done in conjunction with the vision that DNA-based circuitry, when the technology matures, will form the basis for a tamper-proof security module, revolutionizing the meaning and concept of tamper-proofing and possibly preventing it altogether based on accurate scientific observations. A paramount part of such a solution would be self-generation of random numbers. A novel prototype schema employs solid phase synthesis of oligonucleotides for random construction of DNA sequences; temporary storage and retrieval is achieved through plasmid vectors. A discussion of how to evaluate sequence randomness is included, as well as how these techniques are applied to a simulation of the random number generation circuitry. Simulation results show generated sequences successfully pass three selected NIST random number generation tests specified for security applications.
Complete genome sequences of six measles virus strains
Phan, M.V.T. (My V.T.); C.M.E. Schapendonk (Claudia); B.B. Oude Munnink (Bas B.); M.P.G. Koopmans D.V.M. (Marion); R.L. de Swart (Rik); Cotten, M. (Matthew)
2018-01-01
textabstractGenetic characterization of wild-type measles virus (MV) strains is a critical component of measles surveillance and molecular epidemiology. We have obtained complete genome sequences of six MV strains belonging to different genotypes, using random-primed next generation sequencing.
Chaotic generation of PN sequences : a VLSI implementation
Dornbusch, A.; Pineda de Gyvez, J.
1999-01-01
Generation of repeatable pseudo-random sequences with chaotic analog electronics is not feasible using standard circuit topologies. Component variation caused by imperfect fabrication causes the same divergence of output sequences as does varying initial conditions. By quantizing the output of a
Improved nonparametric inference for multiple correlated periodic sequences
Sun, Ying; Hart, Jeffrey D.; Genton, Marc G.
2013-01-01
cross-validation method to the temperature data obtained from multiple ice cores, investigating the periodicity of the El Niño effect. Our methodology is also illustrated by estimating patients' cardiac cycle from different physiological signals
International Nuclear Information System (INIS)
Mie, Masayasu; Shimizu, Shun; Takahashi, Fumio; Kobatake, Eiry
2008-01-01
The 5'-untranslated region (5'-UTR) of mRNAs functions as a translation enhancer, promoting translation efficiency. Many in vitro translation systems exhibit a reduced efficiency in protein translation due to decreased translation initiation. The use of a 5'-UTR sequence with high translation efficiency greatly enhances protein production in these systems. In this study, we have developed an in vitro selection system that favors 5'-UTRs with high translation efficiency using a ribosome display technique. A 5'-UTR random library, comprised of 5'-UTRs tagged with a His-tag and Renilla luciferase (R-luc) fusion, were in vitro translated in rabbit reticulocytes. By limiting the translation period, only mRNAs with high translation efficiency were translated. During translation, mRNA, ribosome and translated R-luc with His-tag formed ternary complexes. They were collected with translated His-tag using Ni-particles. Extracted mRNA from ternary complex was amplified using RT-PCR and sequenced. Finally, 5'-UTR with high translation efficiency was obtained from random 5'-UTR library
Visual Perceptual Echo Reflects Learning of Regularities in Rapid Luminance Sequences.
Chang, Acer Y-C; Schwartzman, David J; VanRullen, Rufin; Kanai, Ryota; Seth, Anil K
2017-08-30
A novel neural signature of active visual processing has recently been described in the form of the "perceptual echo", in which the cross-correlation between a sequence of randomly fluctuating luminance values and occipital electrophysiological signals exhibits a long-lasting periodic (∼100 ms cycle) reverberation of the input stimulus (VanRullen and Macdonald, 2012). As yet, however, the mechanisms underlying the perceptual echo and its function remain unknown. Reasoning that natural visual signals often contain temporally predictable, though nonperiodic features, we hypothesized that the perceptual echo may reflect a periodic process associated with regularity learning. To test this hypothesis, we presented subjects with successive repetitions of a rapid nonperiodic luminance sequence, and examined the effects on the perceptual echo, finding that echo amplitude linearly increased with the number of presentations of a given luminance sequence. These data suggest that the perceptual echo reflects a neural signature of regularity learning.Furthermore, when a set of repeated sequences was followed by a sequence with inverted luminance polarities, the echo amplitude decreased to the same level evoked by a novel stimulus sequence. Crucially, when the original stimulus sequence was re-presented, the echo amplitude returned to a level consistent with the number of presentations of this sequence, indicating that the visual system retained sequence-specific information, for many seconds, even in the presence of intervening visual input. Altogether, our results reveal a previously undiscovered regularity learning mechanism within the human visual system, reflected by the perceptual echo. SIGNIFICANCE STATEMENT How the brain encodes and learns fast-changing but nonperiodic visual input remains unknown, even though such visual input characterizes natural scenes. We investigated whether the phenomenon of "perceptual echo" might index such learning. The perceptual echo is a
Quasirandom geometric networks from low-discrepancy sequences
Estrada, Ernesto
2017-08-01
We define quasirandom geometric networks using low-discrepancy sequences, such as Halton, Sobol, and Niederreiter. The networks are built in d dimensions by considering the d -tuples of digits generated by these sequences as the coordinates of the vertices of the networks in a d -dimensional Id unit hypercube. Then, two vertices are connected by an edge if they are at a distance smaller than a connection radius. We investigate computationally 11 network-theoretic properties of two-dimensional quasirandom networks and compare them with analogous random geometric networks. We also study their degree distribution and their spectral density distributions. We conclude from this intensive computational study that in terms of the uniformity of the distribution of the vertices in the unit square, the quasirandom networks look more random than the random geometric networks. We include an analysis of potential strategies for generating higher-dimensional quasirandom networks, where it is know that some of the low-discrepancy sequences are highly correlated. In this respect, we conclude that up to dimension 20, the use of scrambling, skipping and leaping strategies generate quasirandom networks with the desired properties of uniformity. Finally, we consider a diffusive process taking place on the nodes and edges of the quasirandom and random geometric graphs. We show that the diffusion time is shorter in the quasirandom graphs as a consequence of their larger structural homogeneity. In the random geometric graphs the diffusion produces clusters of concentration that make the process more slow. Such clusters are a direct consequence of the heterogeneous and irregular distribution of the nodes in the unit square in which the generation of random geometric graphs is based on.
IDENTIFICATION OF AVIAN-SPECIFIC FECAL METAGENOMIC SEQUENCES USING GENOME FRAGMENT ENRICHMENTS
Sequence analysis of microbial genomes has provided biologists the opportunity to compare genetic differences between closely related microorganisms. While random sequencing has also been used to study natural microbial communities, metagenomic comparisons via sequencing analysis...
Selective retrieval of memory and concept sequences through neuro-windows
Kakeya, Hideki; Okabe, Yoichi
1999-01-01
This letter presents a crosscorrelational associative memory model which realizes selective retrieval of pattern sequences. When hierarchically correlated sequences are memorized, sequences of the correlational centers can be defined as the concept sequences. The authors propose a modified neuro-window method which enables selective retrieval of memory sequences and concept sequences. It is also shown that the proposed model realizes capacity expansion of the memory which stores random sequen...
Ancestral sequence alignment under optimal conditions
Directory of Open Access Journals (Sweden)
Brown Daniel G
2005-11-01
Full Text Available Abstract Background Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multiple alignments. Many popular alignment algorithms for DNA use the sum-of-pairs heuristic, where the score of a multiple alignment is the sum of its induced pairwise alignment scores. However, the biological meaning of the sum-of-pairs of pairs heuristic is not obvious. Additionally, many algorithms based on the sum-of-pairs heuristic are complicated and slow, compared to pairwise alignment algorithms. An alternative approach to aligning alignments is to first infer ancestral sequences for each alignment, and then align the two ancestral sequences. In addition to being fast, this method has a clear biological basis that takes into account the evolution implied by an underlying phylogenetic tree. In this study we explore the accuracy of aligning alignments by ancestral sequence alignment. We examine the use of both maximum likelihood and parsimony to infer ancestral sequences. Additionally, we investigate the effect on accuracy of allowing ambiguity in our ancestral sequences. Results We use synthetic sequence data that we generate by simulating evolution on a phylogenetic tree. We use two different types of phylogenetic trees: trees with a period of rapid growth followed by a period of slow growth, and trees with a period of slow growth followed by a period of rapid growth. We examine the alignment accuracy of four ancestral sequence reconstruction and alignment methods: parsimony, maximum likelihood, ambiguous parsimony, and ambiguous maximum likelihood. Additionally, we compare against the alignment accuracy of two sum-of-pairs algorithms: ClustalW and the heuristic of Ma, Zhang, and Wang. Conclusion We find that allowing ambiguity in ancestral sequences does not lead to better multiple alignments. Regardless of whether we use parsimony or maximum likelihood, the
Directory of Open Access Journals (Sweden)
Mariana André Honorato Franzoi
Full Text Available ABSTRACT Objective: to investigate the effects of music listening, for 15 minutes, on the preoperative anxiety levels in children undergoing elective surgery in comparison with conventional pediatric surgical care. Method: randomized controlled clinical trial pilot study with 52 children in the preoperative period, aged 3 to 12 years, undergoing elective surgery and randomly allocated in the experimental group (n = 26 and control group (n = 26. Anxiety was assessed in both groups by the application of the modified Yale Preoperative Anxiety Scale and measurement of the physiological variables, upon arrival and 15 minutes after the first measurement. Results: there was a statistically significant difference in preoperative anxiety between the two groups only in relation to the physiological variable, since the respiratory rate of preschool children in the experimental group reduced in the second measurement compared to the control group (p = 0.0453. The experimental group showed a statistically significant reduction in anxiety levels after 15 minutes of music listening (p = 0.0441, specifically with regard to the behavioral domains of activity, vocalization, emotional expression and apparent awakening state. Conclusion: music listening emerges as a potential nursing intervention for relief of preoperative anxiety in children undergoing surgical procedures. RBR-7mcr59.
RDNAnalyzer: A tool for DNA secondary structure prediction and sequence analysis.
Afzal, Muhammad; Shahid, Ahmad Ali; Shehzadi, Abida; Nadeem, Shahid; Husnain, Tayyab
2012-01-01
RDNAnalyzer is an innovative computer based tool designed for DNA secondary structure prediction and sequence analysis. It can randomly generate the DNA sequence or user can upload the sequences of their own interest in RAW format. It uses and extends the Nussinov dynamic programming algorithm and has various application for the sequence analysis. It predicts the DNA secondary structure and base pairings. It also provides the tools for routinely performed sequence analysis by the biological scientists such as DNA replication, reverse compliment generation, transcription, translation, sequence specific information as total number of nucleotide bases, ATGC base contents along with their respective percentages and sequence cleaner. RDNAnalyzer is a unique tool developed in Microsoft Visual Studio 2008 using Microsoft Visual C# and Windows Presentation Foundation and provides user friendly environment for sequence analysis. It is freely available. http://www.cemb.edu.pk/sw.html RDNAnalyzer - Random DNA Analyser, GUI - Graphical user interface, XAML - Extensible Application Markup Language.
Gene Discovery through Genomic Sequencing of Brucella abortus
Sánchez, Daniel O.; Zandomeni, Ruben O.; Cravero, Silvio; Verdún, Ramiro E.; Pierrou, Ester; Faccio, Paula; Diaz, Gabriela; Lanzavecchia, Silvia; Agüero, Fernán; Frasch, Alberto C. C.; Andersson, Siv G. E.; Rossetti, Osvaldo L.; Grau, Oscar; Ugalde, Rodolfo A.
2001-01-01
Brucella abortus is the etiological agent of brucellosis, a disease that affects bovines and human. We generated DNA random sequences from the genome of B. abortus strain 2308 in order to characterize molecular targets that might be useful for developing immunological or chemotherapeutic strategies against this pathogen. The partial sequencing of 1,899 clones allowed the identification of 1,199 genomic sequence surveys (GSSs) with high homology (BLAST expect value < 10−5) to sequences deposit...
The Discrete Beverton-Holt Model with Periodic Harvesting in a Periodically Fluctuating Environment
Directory of Open Access Journals (Sweden)
Ziyad AlSharawi
2010-01-01
Full Text Available We investigate the effect of constant and periodic harvesting on the Beverton-Holt model in a periodically fluctuating environment. We show that in a periodically fluctuating environment, periodic harvesting gives a better maximum sustainable yield compared to constant harvesting. However, if one can also fix the environment, then constant harvesting in a constant environment can be a better option, especially for sufficiently large initial populations. Also, we investigate the combinatorial structure of the periodic sequence of carrying capacities and its effect on the maximum sustainable yield. Finally, we leave some questions worth further investigations.
Nuel, Gregory; Regad, Leslie; Martin, Juliette; Camproux, Anne-Claude
2010-01-26
In bioinformatics it is common to search for a pattern of interest in a potentially large set of rather short sequences (upstream gene regions, proteins, exons, etc.). Although many methodological approaches allow practitioners to compute the distribution of a pattern count in a random sequence generated by a Markov source, no specific developments have taken into account the counting of occurrences in a set of independent sequences. We aim to address this problem by deriving efficient approaches and algorithms to perform these computations both for low and high complexity patterns in the framework of homogeneous or heterogeneous Markov models. The latest advances in the field allowed us to use a technique of optimal Markov chain embedding based on deterministic finite automata to introduce three innovative algorithms. Algorithm 1 is the only one able to deal with heterogeneous models. It also permits to avoid any product of convolution of the pattern distribution in individual sequences. When working with homogeneous models, Algorithm 2 yields a dramatic reduction in the complexity by taking advantage of previous computations to obtain moment generating functions efficiently. In the particular case of low or moderate complexity patterns, Algorithm 3 exploits power computation and binary decomposition to further reduce the time complexity to a logarithmic scale. All these algorithms and their relative interest in comparison with existing ones were then tested and discussed on a toy-example and three biological data sets: structural patterns in protein loop structures, PROSITE signatures in a bacterial proteome, and transcription factors in upstream gene regions. On these data sets, we also compared our exact approaches to the tempting approximation that consists in concatenating the sequences in the data set into a single sequence. Our algorithms prove to be effective and able to handle real data sets with multiple sequences, as well as biological patterns of
Amour, Julien; Marmion, Frédéric; Birenbaum, Aurélie; Nicolas-Robin, Armelle; Coriat, Pierre; Riou, Bruno; Langeron, Olivier
2006-01-01
Plastic single-use laryngoscope blades are inexpensive and carry a lower risk of infection compared with metal reusable blades, but their efficiency during rapid sequence induction remains a matter of debate. The authors therefore compared plastic and metal blades during rapid sequence induction in a prospective randomized trial. Two hundred eighty-four adult patients undergoing general anesthesia requiring rapid sequence induction were randomly assigned on a weekly basis to either plastic single-use or reusable metal blades (cluster randomization). After induction, a 60-s period was allowed to complete intubation. In the case of failed intubation, a second attempt was performed using metal blade. The primary endpoint of the study was the rate of failed intubations, and the secondary endpoint was the incidence of complications (oxygen desaturation, lung aspiration, and oropharynx trauma). Both groups were similar in their main characteristics, including risk factors for difficult intubation. On the first attempt, the rate of failed intubation was significantly increased in plastic blade group (17 vs. 3%; P < 0.01). In metal blade group, 50% of failed intubations were still difficult after the second attempt. In plastic blade group, all initial failed intubations were successfully intubated using metal blade, with an improvement in Cormack and Lehane grade. There was a significant increase in the complication rate in plastic group (15 vs. 6%; P < 0.05). In rapid sequence induction of anesthesia, the plastic laryngoscope blade is less efficient than a metal blade and thus should not be recommended for use in this clinical setting.
DEFF Research Database (Denmark)
Wanscher, Jørgen Bundgaard; Sørensen, Majken Vildrik
2006-01-01
Random numbers are used for a great variety of applications in almost any field of computer and economic sciences today. Examples ranges from stock market forecasting in economics, through stochastic traffic modelling in operations research to photon and ray tracing in graphics. The construction...... distributions into others with most of the required characteristics. In essence, a uniform sequence which is transformed into a new sequence with the required distribution. The subject of this article is to consider the well known highly uniform Halton sequence and modifications to it. The intent is to generate...
Nonlinear analysis of sequence repeats of multi-domain proteins
Energy Technology Data Exchange (ETDEWEB)
Huang Yanzhao [Biomolecular Physics and Modeling Group, Department of Physics, Huazhong University of Science and Technology, Wuhan 430074, Hubei (China); Li Mingfeng [Biomolecular Physics and Modeling Group, Department of Physics, Huazhong University of Science and Technology, Wuhan 430074, Hubei (China); Xiao Yi [Biomolecular Physics and Modeling Group, Department of Physics, Huazhong University of Science and Technology, Wuhan 430074, Hubei (China)]. E-mail: lmf_bill@sina.com
2007-11-15
Many multi-domain proteins have repetitive three-dimensional structures but nearly-random amino acid sequences. In the present paper, by using a modified recurrence plot proposed by us previously, we show that these amino acid sequences have hidden repetitions in fact. These results indicate that the repetitive domain structures are encoded by the repetitive sequences. This also gives a method to detect the repetitive domain structures directly from amino acid sequences.
Inter simple sequence repeats (ISSR) and random amplified ...
African Journals Online (AJOL)
21 of 30 random amplified polymorphic DNA (RAPD) primers produced 220 reproducible bands with average of 10.47 bands per primer and 80.12% of polymorphism. OPR02 primer showed the highest number of effective allele (Ne), Shannon index (I) and genetic diversity (H). Some of the cultivars had specific bands, ...
Time fluctuation analysis of forest fire sequences
Vega Orozco, Carmen D.; Kanevski, Mikhaïl; Tonini, Marj; Golay, Jean; Pereira, Mário J. G.
2013-04-01
Forest fires are complex events involving both space and time fluctuations. Understanding of their dynamics and pattern distribution is of great importance in order to improve the resource allocation and support fire management actions at local and global levels. This study aims at characterizing the temporal fluctuations of forest fire sequences observed in Portugal, which is the country that holds the largest wildfire land dataset in Europe. This research applies several exploratory data analysis measures to 302,000 forest fires occurred from 1980 to 2007. The applied clustering measures are: Morisita clustering index, fractal and multifractal dimensions (box-counting), Ripley's K-function, Allan Factor, and variography. These algorithms enable a global time structural analysis describing the degree of clustering of a point pattern and defining whether the observed events occur randomly, in clusters or in a regular pattern. The considered methods are of general importance and can be used for other spatio-temporal events (i.e. crime, epidemiology, biodiversity, geomarketing, etc.). An important contribution of this research deals with the analysis and estimation of local measures of clustering that helps understanding their temporal structure. Each measure is described and executed for the raw data (forest fires geo-database) and results are compared to reference patterns generated under the null hypothesis of randomness (Poisson processes) embedded in the same time period of the raw data. This comparison enables estimating the degree of the deviation of the real data from a Poisson process. Generalizations to functional measures of these clustering methods, taking into account the phenomena, were also applied and adapted to detect time dependences in a measured variable (i.e. burned area). The time clustering of the raw data is compared several times with the Poisson processes at different thresholds of the measured function. Then, the clustering measure value
Visuospatial working memory training facilitates visually-aided explicit sequence learning.
Chan, John S Y; Wu, Qiaofeng; Liang, Danxia; Yan, Jin H
2015-10-01
Finger sequence learning requires visuospatial working memory (WM). However, the dynamics between age, WM training, and motor skill acquisition are unclear. Therefore, we examined how visuospatial WM training improves finger movement sequential accuracy in younger (n=26, 21.1±1.37years) and older adults (n=22, 70.6±4.01years). After performing a finger sequence learning exercise and numerical and spatial WM tasks, participants in each age group were randomly assigned to either the experimental (EX) or control (CO) groups. For one hour daily over a 10-day period, the EX group practiced an adaptive n-back spatial task while those in the CO group practiced a non-adaptive version. As a result of WM practice, the EX participants increased their accuracy in the spatial n-back tasks, while accuracy remained unimproved in the numerical n-back tasks. In all groups, reaction times (RT) became shorter in most numerical and spatial n-back tasks. The learners in the EX group - but not in the CO group - showed improvements in their retention of finger sequences. The findings support our hypothesis that computerized visuospatial WM training improves finger sequence learning both in younger and in older adults. We discuss the theoretical implications and clinical relevance of this research for motor learning and functional rehabilitation. Copyright © 2015 Elsevier B.V. All rights reserved.
Effects of Colored Noise on Periodic Orbits in a One-Dimensional Map
Li, Feng-Guo; Ai, Bao-Quan
2011-06-01
Noise can induce inverse period-doubling transition and chaos. The effects of the colored noise on periodic orbits, of the different periodic sequences in the logistic map, are investigated. It is found that the dynamical behaviors of the orbits, induced by an exponentially correlated colored noise, are different in the mergence of transition, and the effects of the noise intensity on their dynamical behaviors are different from the effects of the correlation time of noise. Remarkably, the noise can induce new periodic orbits, namely, two new orbits emerge in the period-four sequence at the bifurcation parameter value μ = 3.5, four new orbits in the period-eight sequence at μ = 3.55, and three new orbits in the period-six sequence at μ = 3.846, respectively. Moreover, the dynamical behaviors of the new orbits clearly show the resonancelike response to the colored noise.
Effects of Colored Noise on Periodic Orbits in a One-Dimensional Map
International Nuclear Information System (INIS)
Li Fengguo; Ai Baoquan
2011-01-01
Noise can induce inverse period-doubling transition and chaos. The effects of the colored noise on periodic orbits, of the different periodic sequences in the logistic map, are investigated. It is found that the dynamical behaviors of the orbits, induced by an exponentially correlated colored noise, are different in the mergence of transition, and the effects of the noise intensity on their dynamical behaviors are different from the effects of the correlation time of noise. Remarkably, the noise can induce new periodic orbits, namely, two new orbits emerge in the period-four sequence at the bifurcation parameter value μ = 3.5, four new orbits in the period-eight sequence at μ = 3.55, and three new orbits in the period-six sequence at μ = 3.846, respectively. Moreover, the dynamical behaviors of the new orbits clearly show the resonancelike response to the colored noise. (general)
Brain potentials index executive functions during random number generation.
Joppich, Gregor; Däuper, Jan; Dengler, Reinhard; Johannes, Sönke; Rodriguez-Fornells, Antoni; Münte, Thomas F
2004-06-01
The generation of random sequences is considered to tax different executive functions. To explore the involvement of these functions further, brain potentials were recorded in 16 healthy young adults while either engaging in random number generation (RNG) by pressing the number keys on a computer keyboard in a random sequence or in ordered number generation (ONG) necessitating key presses in the canonical order. Key presses were paced by an external auditory stimulus to yield either fast (1 press/800 ms) or slow (1 press/1300 ms) sequences in separate runs. Attentional demands of random and ordered tasks were assessed by the introduction of a secondary task (key-press to a target tone). The P3 amplitude to the target tone of this secondary task was reduced during RNG, reflecting the greater consumption of attentional resources during RNG. Moreover, RNG led to a left frontal negativity peaking 140 ms after the onset of the pacing stimulus, whenever the subjects produced a true random response. This negativity could be attributed to the left dorsolateral prefrontal cortex and was absent when numbers were repeated. This negativity was interpreted as an index for the inhibition of habitual responses. Finally, in response locked ERPs a negative component was apparent peaking about 50 ms after the key-press that was more prominent during RNG. Source localization suggested a medial frontal source. This effect was tentatively interpreted as a reflection of the greater monitoring demands during random sequence generation.
Cryptographic pseudo-random sequences from the chaotic Hénon ...
Indian Academy of Sciences (India)
2-dimensional chaotic maps for the generation of pseudorandom sequences. 3. ... map. Consider the bit-stream Bx formed by choosing every Pth bit of Sx, ... Similarly, the probability of the linear complexity C assuming the value c(c < N) when.
International Nuclear Information System (INIS)
Iglói, Ferenc; Lin, Yu-Cheng
2008-01-01
Using free-fermionic techniques we study the entanglement entropy of a block of contiguous spins in a large finite quantum Ising chain in a transverse field, with couplings of different types: homogeneous, periodically modulated and random. We carry out a systematic study of finite-size effects at the quantum critical point, and evaluate subleading corrections both for open and for periodic boundary conditions. For a block corresponding to a half of a finite chain, the position of the maximum of the entropy as a function of the control parameter (e.g. the transverse field) can define the effective critical point in the finite sample. On the basis of homogeneous chains, we demonstrate that the scaling behavior of the entropy near the quantum phase transition is in agreement with the universality hypothesis, and calculate the shift of the effective critical point, which has different scaling behaviors for open and for periodic boundary conditions
Blocked Randomization with Randomly Selected Block Sizes
Directory of Open Access Journals (Sweden)
Jimmy Efird
2010-12-01
Full Text Available When planning a randomized clinical trial, careful consideration must be given to how participants are selected for various arms of a study. Selection and accidental bias may occur when participants are not assigned to study groups with equal probability. A simple random allocation scheme is a process by which each participant has equal likelihood of being assigned to treatment versus referent groups. However, by chance an unequal number of individuals may be assigned to each arm of the study and thus decrease the power to detect statistically significant differences between groups. Block randomization is a commonly used technique in clinical trial design to reduce bias and achieve balance in the allocation of participants to treatment arms, especially when the sample size is small. This method increases the probability that each arm will contain an equal number of individuals by sequencing participant assignments by block. Yet still, the allocation process may be predictable, for example, when the investigator is not blind and the block size is fixed. This paper provides an overview of blocked randomization and illustrates how to avoid selection bias by using random block sizes.
All-optical fast random number generator.
Li, Pu; Wang, Yun-Cai; Zhang, Jian-Zhong
2010-09-13
We propose a scheme of all-optical random number generator (RNG), which consists of an ultra-wide bandwidth (UWB) chaotic laser, an all-optical sampler and an all-optical comparator. Free from the electric-device bandwidth, it can generate 10Gbit/s random numbers in our simulation. The high-speed bit sequences can pass standard statistical tests for randomness after all-optical exclusive-or (XOR) operation.
Avrachenkov, Konstantin; Borkar, Vivek S; Kadavankandy, Arun; Sreedharan, Jithin K
2018-01-01
In the framework of network sampling, random walk (RW) based estimation techniques provide many pragmatic solutions while uncovering the unknown network as little as possible. Despite several theoretical advances in this area, RW based sampling techniques usually make a strong assumption that the samples are in stationary regime, and hence are impelled to leave out the samples collected during the burn-in period. This work proposes two sampling schemes without burn-in time constraint to estimate the average of an arbitrary function defined on the network nodes, for example, the average age of users in a social network. The central idea of the algorithms lies in exploiting regeneration of RWs at revisits to an aggregated super-node or to a set of nodes, and in strategies to enhance the frequency of such regenerations either by contracting the graph or by making the hitting set larger. Our first algorithm, which is based on reinforcement learning (RL), uses stochastic approximation to derive an estimator. This method can be seen as intermediate between purely stochastic Markov chain Monte Carlo iterations and deterministic relative value iterations. The second algorithm, which we call the Ratio with Tours (RT)-estimator, is a modified form of respondent-driven sampling (RDS) that accommodates the idea of regeneration. We study the methods via simulations on real networks. We observe that the trajectories of RL-estimator are much more stable than those of standard random walk based estimation procedures, and its error performance is comparable to that of respondent-driven sampling (RDS) which has a smaller asymptotic variance than many other estimators. Simulation studies also show that the mean squared error of RT-estimator decays much faster than that of RDS with time. The newly developed RW based estimators (RL- and RT-estimators) allow to avoid burn-in period, provide better control of stability along the sample path, and overall reduce the estimation time. Our
Simulation of a directed random-walk model: the effect of pseudo-random-number correlations
Shchur, L. N.; Heringa, J. R.; Blöte, H. W. J.
1996-01-01
We investigate the mechanism that leads to systematic deviations in cluster Monte Carlo simulations when correlated pseudo-random numbers are used. We present a simple model, which enables an analysis of the effects due to correlations in several types of pseudo-random-number sequences. This model provides qualitative understanding of the bias mechanism in a class of cluster Monte Carlo algorithms.
A weak zero-one law for sequences of random distance graphs
Energy Technology Data Exchange (ETDEWEB)
Zhukovskii, Maksim E [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)
2012-07-31
We study zero-one laws for properties of random distance graphs. Properties written in a first-order language are considered. For p(N) such that pN{sup {alpha}}{yields}{infinity} as N{yields}{infinity}, and (1-p)N{sup {alpha}} {yields} {infinity} as N {yields} {infinity} for any {alpha}>0, we succeed in refuting the law. In this connection, we consider a weak zero-one j-law. For this law, we obtain results for random distance graphs which are similar to the assertions concerning the classical zero-one law for random graphs. Bibliography: 18 titles.
PREDICTION OF CHROMATIN STATES USING DNA SEQUENCE PROPERTIES
Bahabri, Rihab R.
2013-06-01
Activities of DNA are to a great extent controlled epigenetically through the internal struc- ture of chromatin. This structure is dynamic and is influenced by different modifications of histone proteins. Various combinations of epigenetic modification of histones pinpoint to different functional regions of the DNA determining the so-called chromatin states. How- ever, the characterization of chromatin states by the DNA sequence properties remains largely unknown. In this study we aim to explore whether DNA sequence patterns in the human genome can characterize different chromatin states. Using DNA sequence motifs we built binary classifiers for each chromatic state to eval- uate whether a given genomic sequence is a good candidate for belonging to a particular chromatin state. Of four classification algorithms (C4.5, Naive Bayes, Random Forest, and SVM) used for this purpose, the decision tree based classifiers (C4.5 and Random Forest) yielded best results among those we evaluated. Our results suggest that in general these models lack sufficient predictive power, although for four chromatin states (insulators, het- erochromatin, and two types of copy number variation) we found that presence of certain motifs in DNA sequences does imply an increased probability that such a sequence is one of these chromatin states.
Application of quasi-random numbers for simulation
International Nuclear Information System (INIS)
Kazachenko, O.N.; Takhtamyshev, G.G.
1985-01-01
Application of the Monte-Carlo method for multidimensional integration is discussed. The main goal is to check the statement that the application of quasi-random numbers instead of regular pseudo-random numbers provides more rapid convergency. The Sobol, Richtmayer and Halton algorithms of quasi-random sequences are described. Over 50 tests to compare these quasi-random numbers as well as pseudo-random numbers were fulfilled. In all cases quasi-random numbers have clearly demonstrated a more rapid convergency as compared with pseudo-random ones. Positive test results on quasi-random trend in Monte-Carlo method seem very promising
CMOS Compressed Imaging by Random Convolution
Jacques, Laurent; Vandergheynst, Pierre; Bibet, Alexandre; Majidzadeh, Vahid; Schmid, Alexandre; Leblebici, Yusuf
2009-01-01
We present a CMOS imager with built-in capability to perform Compressed Sensing. The adopted sensing strategy is the random Convolution due to J. Romberg. It is achieved by a shift register set in a pseudo-random configuration. It acts as a convolutive filter on the imager focal plane, the current issued from each CMOS pixel undergoing a pseudo-random redirection controlled by each component of the filter sequence. A pseudo-random triggering of the ADC reading is finally applied to comp...
A Comparison of Three Random Number Generators for Aircraft Dynamic Modeling Applications
Grauer, Jared A.
2017-01-01
Three random number generators, which produce Gaussian white noise sequences, were compared to assess their suitability in aircraft dynamic modeling applications. The first generator considered was the MATLAB (registered) implementation of the Mersenne-Twister algorithm. The second generator was a website called Random.org, which processes atmospheric noise measured using radios to create the random numbers. The third generator was based on synthesis of the Fourier series, where the random number sequences are constructed from prescribed amplitude and phase spectra. A total of 200 sequences, each having 601 random numbers, for each generator were collected and analyzed in terms of the mean, variance, normality, autocorrelation, and power spectral density. These sequences were then applied to two problems in aircraft dynamic modeling, namely estimating stability and control derivatives from simulated onboard sensor data, and simulating flight in atmospheric turbulence. In general, each random number generator had good performance and is well-suited for aircraft dynamic modeling applications. Specific strengths and weaknesses of each generator are discussed. For Monte Carlo simulation, the Fourier synthesis method is recommended because it most accurately and consistently approximated Gaussian white noise and can be implemented with reasonable computational effort.
Directory of Open Access Journals (Sweden)
Guziolowski Carito
2007-09-01
Full Text Available Abstract Background: We present the N-map method, a pairwise and asymmetrical approach which allows us to compare sequences by taking into account evolutionary events that produce shuffled, reversed or repeated elements. Basically, the optimal N-map of a sequence s over a sequence t is the best way of partitioning the first sequence into N parts and placing them, possibly complementary reversed, over the second sequence in order to maximize the sum of their gapless alignment scores. Results: We introduce an algorithm computing an optimal N-map with time complexity O (|s| × |t| × N using O (|s| × |t| × N memory space. Among all the numbers of parts taken in a reasonable range, we select the value N for which the optimal N-map has the most significant score. To evaluate this significance, we study the empirical distributions of the scores of optimal N-maps and show that they can be approximated by normal distributions with a reasonable accuracy. We test the functionality of the approach over random sequences on which we apply artificial evolutionary events. Practical Application: The method is illustrated with four case studies of pairs of sequences involving non-standard evolutionary events.
PuLSE: Quality control and quantification of peptide sequences explored by phage display libraries.
Shave, Steven; Mann, Stefan; Koszela, Joanna; Kerr, Alastair; Auer, Manfred
2018-01-01
The design of highly diverse phage display libraries is based on assumption that DNA bases are incorporated at similar rates within the randomized sequence. As library complexity increases and expected copy numbers of unique sequences decrease, the exploration of library space becomes sparser and the presence of truly random sequences becomes critical. We present the program PuLSE (Phage Library Sequence Evaluation) as a tool for assessing randomness and therefore diversity of phage display libraries. PuLSE runs on a collection of sequence reads in the fastq file format and generates tables profiling the library in terms of unique DNA sequence counts and positions, translated peptide sequences, and normalized 'expected' occurrences from base to residue codon frequencies. The output allows at-a-glance quantitative quality control of a phage library in terms of sequence coverage both at the DNA base and translated protein residue level, which has been missing from toolsets and literature. The open source program PuLSE is available in two formats, a C++ source code package for compilation and integration into existing bioinformatics pipelines and precompiled binaries for ease of use.
Law of Iterated Logarithm for NA Sequences with Non-Identical ...
Indian Academy of Sciences (India)
Based on a law of the iterated logarithm for independent random variables sequences, an iterated logarithm theorem for NA sequences with non-identical distributions is obtained. The proof is based on a Kolmogrov-type exponential inequality.
Parallel random number generator for inexpensive configurable hardware cells
Ackermann, J.; Tangen, U.; Bödekker, B.; Breyer, J.; Stoll, E.; McCaskill, J. S.
2001-11-01
A new random number generator ( RNG) adapted to parallel processors has been created. This RNG can be implemented with inexpensive hardware cells. The correlation between neighboring cells is suppressed with smart connections. With such connection structures, sequences of pseudo-random numbers are produced. Numerical tests including a self-avoiding random walk test and the simulation of the order parameter and energy of the 2D Ising model give no evidence for correlation in the pseudo-random sequences. Because the new random number generator has suppressed the correlation between neighboring cells which is usually observed in cellular automaton implementations, it is applicable for extended time simulations. It gives an immense speed-up factor if implemented directly in configurable hardware, and has recently been used for long time simulations of spatially resolved molecular evolution.
Ondersma, Steven J; Svikis, Dace S; Thacker, Casey; Resnicow, Ken; Beatty, Jessica R; Janisse, James; Puder, Karoline
2018-04-01
Under-reporting of drug use in the perinatal period is well-documented, and significantly limits the reach of proactive intervention approaches. The Wayne Indirect Drug Use Screener (WIDUS) focuses on correlates of drug use rather than use itself. This trial tested a computer-delivered, brief intervention designed for use with indirect screen-positive cases, seeking to motivate reductions in drug use without presuming its presence. Randomized clinical trial with 500 WIDUS-positive postpartum women recruited between August 14, 2012 and November 19, 2014. Participants were randomly assigned to either a time control condition or a single-session, tailored, indirect brief intervention. The primary outcome was days of drug use over the 6-month follow-up period; secondary outcomes included urine and hair analyses results at 3- and 6-month follow-up. All outcomes were measured by blinded evaluators. Of the 500 participants (252 intervention and 248 control), 36.1% of participants acknowledged drug use in the 3 months prior to pregnancy, but 89% tested positive at the 6-month follow-up. Participants rated the intervention as easy to use (4.9/5) and helpful (4.4/5). Analyses revealed no between-group differences in drug use (52% in the intervention group, vs. 53% among controls; OR 1.03). Exploratory analyses also showed that intervention effects were not moderated by baseline severity, WIDUS score, or readiness to change. The present trial showed no evidence of efficacy for an indirect, single-session, computer-delivered, brief intervention designed as a complement to indirect screening. More direct approaches that still do not presume active drug use may be possible and appropriate. Copyright © 2018 Elsevier B.V. All rights reserved.
Fast physical random bit generation with chaotic semiconductor lasers
Uchida, Atsushi; Amano, Kazuya; Inoue, Masaki; Hirano, Kunihito; Naito, Sunao; Someya, Hiroyuki; Oowada, Isao; Kurashige, Takayuki; Shiki, Masaru; Yoshimori, Shigeru; Yoshimura, Kazuyuki; Davis, Peter
2008-12-01
Random number generators in digital information systems make use of physical entropy sources such as electronic and photonic noise to add unpredictability to deterministically generated pseudo-random sequences. However, there is a large gap between the generation rates achieved with existing physical sources and the high data rates of many computation and communication systems; this is a fundamental weakness of these systems. Here we show that good quality random bit sequences can be generated at very fast bit rates using physical chaos in semiconductor lasers. Streams of bits that pass standard statistical tests for randomness have been generated at rates of up to 1.7 Gbps by sampling the fluctuating optical output of two chaotic lasers. This rate is an order of magnitude faster than that of previously reported devices for physical random bit generators with verified randomness. This means that the performance of random number generators can be greatly improved by using chaotic laser devices as physical entropy sources.
Perfect sequences over the real quaternions
Kuznetsov, Oleg
2017-01-01
In this Thesis, perfect sequences over the real quaternions are first considered. Definitions for the right and left periodic autocorrelation functions are given, and right and left perfect sequences introduced. It is shown that the right (left) perfection of any sequence implies the left (right) perfection, so concepts of right and left perfect sequences over the real quaternions are equivalent. Unitary transformations of the quaternion space ℍ are then considered. Using the equivalence of t...
Directory of Open Access Journals (Sweden)
Regad Leslie
2010-01-01
Full Text Available Abstract Background In bioinformatics it is common to search for a pattern of interest in a potentially large set of rather short sequences (upstream gene regions, proteins, exons, etc.. Although many methodological approaches allow practitioners to compute the distribution of a pattern count in a random sequence generated by a Markov source, no specific developments have taken into account the counting of occurrences in a set of independent sequences. We aim to address this problem by deriving efficient approaches and algorithms to perform these computations both for low and high complexity patterns in the framework of homogeneous or heterogeneous Markov models. Results The latest advances in the field allowed us to use a technique of optimal Markov chain embedding based on deterministic finite automata to introduce three innovative algorithms. Algorithm 1 is the only one able to deal with heterogeneous models. It also permits to avoid any product of convolution of the pattern distribution in individual sequences. When working with homogeneous models, Algorithm 2 yields a dramatic reduction in the complexity by taking advantage of previous computations to obtain moment generating functions efficiently. In the particular case of low or moderate complexity patterns, Algorithm 3 exploits power computation and binary decomposition to further reduce the time complexity to a logarithmic scale. All these algorithms and their relative interest in comparison with existing ones were then tested and discussed on a toy-example and three biological data sets: structural patterns in protein loop structures, PROSITE signatures in a bacterial proteome, and transcription factors in upstream gene regions. On these data sets, we also compared our exact approaches to the tempting approximation that consists in concatenating the sequences in the data set into a single sequence. Conclusions Our algorithms prove to be effective and able to handle real data sets with
Augmented brain function by coordinated reset stimulation with slowly varying sequences
Directory of Open Access Journals (Sweden)
Magteld eZeitler
2015-03-01
Full Text Available Several brain disorders are characterized by abnormally strong neuronal synchrony. Coordinated Reset (CR stimulation was developed to selectively counteract abnormal neuronal synchrony by desynchronization. For this, phase resetting stimuli are delivered to different subpopulations in a timely coordinated way. In neural networks with spike timing-dependent plasticity CR stimulation may eventually lead to an anti-kindling, i.e. an unlearning of abnormal synaptic connectivity and abnormal synchrony. The spatiotemporal sequence by which all stimulation sites are stimulated exactly once is called the stimulation site sequence, or briefly sequence. So far, in simulations, pre-clinical and clinical applications CR was applied either with fixed sequences or rapidly varying sequences (RVS. In this computational study we show that appropriate repetition of the sequence with occasional random switching to the next sequence may significantly improve the anti-kindling effect of CR. To this end, a sequence is applied many times before randomly switching to the next sequence. This new method is called SVS CR stimulation, i.e. CR with slowly varying sequences. In a neuronal network with strong short-range excitatory and weak long-range inhibitory dynamic couplings SVS CR stimulation turns out to be superior to CR stimulation with fixed sequences or RVS.
Augmented brain function by coordinated reset stimulation with slowly varying sequences.
Zeitler, Magteld; Tass, Peter A
2015-01-01
Several brain disorders are characterized by abnormally strong neuronal synchrony. Coordinated Reset (CR) stimulation was developed to selectively counteract abnormal neuronal synchrony by desynchronization. For this, phase resetting stimuli are delivered to different subpopulations in a timely coordinated way. In neural networks with spike timing-dependent plasticity CR stimulation may eventually lead to an anti-kindling, i.e., an unlearning of abnormal synaptic connectivity and abnormal synchrony. The spatiotemporal sequence by which all stimulation sites are stimulated exactly once is called the stimulation site sequence, or briefly sequence. So far, in simulations, pre-clinical and clinical applications CR was applied either with fixed sequences or rapidly varying sequences (RVS). In this computational study we show that appropriate repetition of the sequence with occasional random switching to the next sequence may significantly improve the anti-kindling effect of CR. To this end, a sequence is applied many times before randomly switching to the next sequence. This new method is called SVS CR stimulation, i.e., CR with slowly varying sequences. In a neuronal network with strong short-range excitatory and weak long-range inhibitory dynamic couplings SVS CR stimulation turns out to be superior to CR stimulation with fixed sequences or RVS.
Noncoding sequence classification based on wavelet transform analysis: part I
Paredes, O.; Strojnik, M.; Romo-Vázquez, R.; Vélez Pérez, H.; Ranta, R.; Garcia-Torales, G.; Scholl, M. K.; Morales, J. A.
2017-09-01
DNA sequences in human genome can be divided into the coding and noncoding ones. Coding sequences are those that are read during the transcription. The identification of coding sequences has been widely reported in literature due to its much-studied periodicity. Noncoding sequences represent the majority of the human genome. They play an important role in gene regulation and differentiation among the cells. However, noncoding sequences do not exhibit periodicities that correlate to their functions. The ENCODE (Encyclopedia of DNA elements) and Epigenomic Roadmap Project projects have cataloged the human noncoding sequences into specific functions. We study characteristics of noncoding sequences with wavelet analysis of genomic signals.
International Nuclear Information System (INIS)
Johnson, D.E.; Johnson, R.P.
1989-01-01
The Colliding Beam Sequencer (CBS) is a computer program used to operate the pbar-p Collider by synchronizing the applications programs and simulating the activities of the accelerator operators during filling and storage. The Sequencer acts as a meta-program, running otherwise stand alone applications programs, to do the set-up, beam transfers, acceleration, low beta turn on, and diagnostics for the transfers and storage. The Sequencer and its operational performance will be described along with its special features which include a periodic scheduler and command logger. 14 refs., 3 figs
Mining olive genome through library sequencing and bioinformatics ...
African Journals Online (AJOL)
As one of the initial steps of olive (Olea europaea L.) genome analysis, a small insert genomic DNA library was constructed (digesting olive genomic DNA with SmaI and cloning the digestion products into pUC19 vector) and randomly picked 83 colonies were sequenced. Analysis of the insert sequences revealed 12 clones ...
The recurrence sequences via Sylvester matrices
Karaduman, Erdal; Deveci, Ömür
2017-07-01
In this work, we define the Pell-Jacobsthal-Slyvester sequence and the Jacobsthal-Pell-Slyvester sequence by using the Slyvester matrices which are obtained from the characteristic polynomials of the Pell and Jacobsthal sequences and then, we study the sequences defined modulo m. Also, we obtain the cyclic groups and the semigroups from the generating matrices of these sequences when read modulo m and then, we derive the relationships among the orders of the cyclic groups and the periods of the sequences. Furthermore, we redefine Pell-Jacobsthal-Slyvester sequence and the Jacobsthal-Pell-Slyvester sequence by means of the elements of the groups and then, we examine them in the finite groups.
The period-luminosity relation for Cepheids
International Nuclear Information System (INIS)
Brodie, J.P.
1980-01-01
Numerical simulations of the empirical determination of the period-luminosity-colour relation for classical Cepheids are presented. In this study the quantitative effects of random errors, reddening, sample size and the presence of both colour and period cut-offs (imposed by the finite extent of the instability strip) on the observational redetermination of the original relation are evaluated. Both random errors in the photometry and correlated errors in the reddening corrections are shown to have systematic effects. Especially sensitive to these errors is the colour coefficient in the period-luminosity-colour relation, where the ratio of the error to the width of the instability strip is the determining factor. With present observations only broad confidence limits can be placed on present knowledge of the intrinsic period-luminosity-colour relation and/or its variations from galaxy to galaxy. (author)
How edge-reinforced random walk arises naturally
Rolles, S.W.W.
2003-01-01
We give a characterization of a modified edge-reinforced random walk in terms of certain partially exchangeable sequences. In particular, we obtain a characterization of an edge-reinforced random walk (introduced by Coppersmith and Diaconis) on a 2-edge-connected graph. Modifying the notion of
Directory of Open Access Journals (Sweden)
Sari Agustini Hafman
2013-05-01
Full Text Available According to Kerchoffs (1883, the security system should only rely on cryptographic keys which is used in that system. Generally, the key sequences are generated by a Pseudo Random Number Generator (PRNG or Random Number Generator (RNG. There are three types of randomness sequences that generated by the RNG and PRNG i.e. pseudorandom sequence, cryptographically secure pseudorandom sequences, and real random sequences. Several statistical tests, including diehard battery of tests of randomness, is used to check the type of randomness sequences that generated by PRNG or RNG. Due to its purpose, the principle on taking the testing parameters and the test statistic are associated with the validity of the conclusion produced by a statistical test, then the theoretical analysis is performed by applying a variety of statistical theory to evaluate craps test, one of the test included in the diehard battery of randomness tests. Craps test, inspired by craps game, aims to examine whether a PRNG produces an independent and identically distributed (iid pseudorandom sequences. To demonstrate the process to produce a test statistics equation and to show how craps games applied on that test, will be carried out theoretical analysis by applying a variety of statistical theory. Furthermore, empirical observations will be done by applying craps test on a PRNG in order to check the test effectiveness in detecting the distribution and independency of sequences which produced by PRNG
Error Analysis of Deep Sequencing of Phage Libraries: Peptides Censored in Sequencing
Directory of Open Access Journals (Sweden)
Wadim L. Matochko
2013-01-01
Full Text Available Next-generation sequencing techniques empower selection of ligands from phage-display libraries because they can detect low abundant clones and quantify changes in the copy numbers of clones without excessive selection rounds. Identification of errors in deep sequencing data is the most critical step in this process because these techniques have error rates >1%. Mechanisms that yield errors in Illumina and other techniques have been proposed, but no reports to date describe error analysis in phage libraries. Our paper focuses on error analysis of 7-mer peptide libraries sequenced by Illumina method. Low theoretical complexity of this phage library, as compared to complexity of long genetic reads and genomes, allowed us to describe this library using convenient linear vector and operator framework. We describe a phage library as N×1 frequency vector n=ni, where ni is the copy number of the ith sequence and N is the theoretical diversity, that is, the total number of all possible sequences. Any manipulation to the library is an operator acting on n. Selection, amplification, or sequencing could be described as a product of a N×N matrix and a stochastic sampling operator (Sa. The latter is a random diagonal matrix that describes sampling of a library. In this paper, we focus on the properties of Sa and use them to define the sequencing operator (Seq. Sequencing without any bias and errors is Seq=Sa IN, where IN is a N×N unity matrix. Any bias in sequencing changes IN to a nonunity matrix. We identified a diagonal censorship matrix (CEN, which describes elimination or statistically significant downsampling, of specific reads during the sequencing process.
Aspects of insertion in random trees
Bagchi, Arunabha; Reingold, E.M.
1982-01-01
A method formulated by Yao and used by Brown has yielded bounds on the fraction of nodes with specified properties in trees bult by a sequence of random internal nodes in a random tree built by binary search and insertion, and show that in such a tree about bounds better than those now known. We
Locomotor sequence learning in visually guided walking
DEFF Research Database (Denmark)
Choi, Julia T; Jensen, Peter; Nielsen, Jens Bo
2016-01-01
walking. In addition, we determined how age (i.e., healthy young adults vs. children) and biomechanical factors (i.e., walking speed) affected the rate and magnitude of locomotor sequence learning. The results showed that healthy young adults (age 24 ± 5 years, N = 20) could learn a specific sequence...... of step lengths over 300 training steps. Younger children (age 6-10 years, N = 8) have lower baseline performance, but their magnitude and rate of sequence learning was the same compared to older children (11-16 years, N = 10) and healthy adults. In addition, learning capacity may be more limited...... to modify step length from one trial to the next. Our sequence learning paradigm is derived from the serial reaction-time (SRT) task that has been used in upper limb studies. Both random and ordered sequences of step lengths were used to measure sequence-specific and sequence non-specific learning during...
Random number generators tested on quantum Monte Carlo simulations.
Hongo, Kenta; Maezono, Ryo; Miura, Kenichi
2010-08-01
We have tested and compared several (pseudo) random number generators (RNGs) applied to a practical application, ground state energy calculations of molecules using variational and diffusion Monte Carlo metheds. A new multiple recursive generator with 8th-order recursion (MRG8) and the Mersenne twister generator (MT19937) are tested and compared with the RANLUX generator with five luxury levels (RANLUX-[0-4]). Both MRG8 and MT19937 are proven to give the same total energy as that evaluated with RANLUX-4 (highest luxury level) within the statistical error bars with less computational cost to generate the sequence. We also tested the notorious implementation of linear congruential generator (LCG), RANDU, for comparison. (c) 2010 Wiley Periodicals, Inc.
Shaping the spectrum of random-phase radar waveforms
Doerry, Armin W.; Marquette, Brandeis
2017-05-09
The various technologies presented herein relate to generation of a desired waveform profile in the form of a spectrum of apparently random noise (e.g., white noise or colored noise), but with precise spectral characteristics. Hence, a waveform profile that could be readily determined (e.g., by a spoofing system) is effectively obscured. Obscuration is achieved by dividing the waveform into a series of chips, each with an assigned frequency, wherein the sequence of chips are subsequently randomized. Randomization can be a function of the application of a key to the chip sequence. During processing of the echo pulse, a copy of the randomized transmitted pulse is recovered or regenerated against which the received echo is correlated. Hence, with the echo energy range-compressed in this manner, it is possible to generate a radar image with precise impulse response.
Mathematical Use Of Polynomials Of Different End Periods Of ...
African Journals Online (AJOL)
This paper focused on how polynomials of different end period of random numbers can be used in the application of encryption and decryption of a message. Eight steps were used in generating information on how polynomials of different end periods of random numbers in the application of encryption and decryption of a ...
Fibonacci order in the period-doubling cascade to chaos
International Nuclear Information System (INIS)
Linage, G.; Montoya, Fernando; Sarmiento, A.; Showalter, K.; Parmananda, P.
2006-01-01
In this contribution, we describe how the Fibonacci sequence appears within the Feigenbaum scaling of the period-doubling cascade to chaos. An important consequence of this discovery is that the ratio of successive Fibonacci numbers converges to the golden mean in every period-doubling sequence and therefore the convergence to φ, the most irrational number, occurs in concert with the onset of deterministic chaos
Fibonacci order in the period-doubling cascade to chaos
Energy Technology Data Exchange (ETDEWEB)
Linage, G. [Facultad de Ciencias UAEM, Avenida Universidad 1001, Colonia Chamilpa, C.P. 62210 Cuernavaca, Morelos (Mexico); Montoya, Fernando [Facultad de Ciencias UAEM, Avenida Universidad 1001, Colonia Chamilpa, C.P. 62210 Cuernavaca, Morelos (Mexico); Sarmiento, A. [Instituto de Matematicas, UNAM, Colonia Chamilpa, C.P. 62210 Cuernavaca, Morelos (Mexico); Showalter, K. [Department of Chemistry, West Virginia University, Morgantown, WV 26506-6045 (United States); Parmananda, P. [Facultad de Ciencias UAEM, Avenida Universidad 1001, Colonia Chamilpa, C.P. 62210 Cuernavaca, Morelos (Mexico)]. E-mail: punit@servm.fc.uaem.mx
2006-12-11
In this contribution, we describe how the Fibonacci sequence appears within the Feigenbaum scaling of the period-doubling cascade to chaos. An important consequence of this discovery is that the ratio of successive Fibonacci numbers converges to the golden mean in every period-doubling sequence and therefore the convergence to {phi}, the most irrational number, occurs in concert with the onset of deterministic chaos.
Tanet, Antoine; Hubert-Barthelemy, Annik; Crespin, Graciela C; Bodeau, Nicolas; Cohen, David; Saint-Georges, Catherine
2016-01-01
Individuals with autism spectrum disorder (ASD) who also exhibit severe-to-moderate ranges of intellectual disability (ID) still face many challenges (i.e., less evidence-based trials, less inclusion in school with peers). We implemented a novel model called the "Developmental and Sequenced One-to-One Educational Intervention" (DS1-EI) in 5- to 9-year-old children with co-occurring ASD and ID. The treatment protocol was adapted for school implementation by designing it using an educational agenda. The intervention was based on intensity, regular assessments, updating objectives, encouraging spontaneous communication, promoting skills through play with peers, supporting positive behaviors, providing supervision, capitalizing on teachers' unique skills, and providing developmental and sequenced learning. Developmental learning implies that the focus of training is what is close to the developmental expectations given a child's development in a specific domain. Sequenced learning means that the teacher changes the learning activities every 10-15 min to maintain the child's attention in the context of an anticipated time agenda. We selected 11 French institutions in which we implemented the model in small classrooms. Each institution recruited participants per dyads matched by age, sex, and developmental quotient. Patients from each dyad were then randomized to a DS1-EI group or a Treatment as usual (TAU) group for 36 months. The primary variables - the Childhood Autism Rating scale (CARS) and the psychoeducational profile (PEP-3) - will be blindly assessed by independent raters at the 18-month and 36-month follow-up. We enrolled 75 participants: 38 were randomized to the DS1-EI and 37 to the TAU groups. At enrollment, we found no significant differences in participants' characteristics between groups. As expected, exposure to school was the only significant difference [9.4 (±4.1) h/week in the DS1-EI group vs. 3.4 (±4.5) h/week in the TAU group, Student's t
da Fonseca, Allex Jardim; Galvão, Renata Silva; Miranda, Angelica Espinosa; Ferreira, Luiz Carlos de Lima; Chen, Zigui
2016-05-01
To compare the diagnostic performance for HPV infection using three laboratorial techniques. Ninty-five cervicovaginal samples were randomly selected; each was tested for HPV DNA and genotypes using 3 methods in parallel: Multiplex-PCR, the Nested PCR followed by Sanger sequencing, and the Next_Gen Sequencing (NGS) with two assays (NGS-A1, NGS-A2). The study was approved by the Brazilian National IRB (CONEP protocol 16,800). The prevalence of HPV by the NGS assays was higher than that using the Multiplex-PCR (64.2% vs. 45.2%, respectively; P = 0.001) and the Nested-PCR (64.2% vs. 49.5%, respectively; P = 0.003). NGS also showed better performance in detecting high-risk HPV (HR-HPV) and HPV16. There was a weak interobservers agreement between the results of Multiplex-PCR and Nested-PCR in relation to NGS for the diagnosis of HPV infection, and a moderate correlation for HR-HPV detection. Both NGS assays showed a strong correlation for detection of HPVs (k = 0.86), HR-HPVs (k = 0.91), HPV16 (k = 0.92) and HPV18 (k = 0.91). NGS is more sensitive than the traditional Sanger sequencing and the Multiplex PCR to genotype HPVs, with promising ability to detect multiple infections, and may have the potential to establish an alternative method for the diagnosis and genotyping of HPV. © 2015 Wiley Periodicals, Inc.
DNA Sequences of RAPD Fragments in the Egyptian cotton ...
African Journals Online (AJOL)
Random Amplified Polymorphic DNAs (RAPDs) is a DNA polymorphism assay based on the amplification of random DNA segments with single primers of arbitrary nucleotide sequence. Despite the fact that the RAPD technique has become a very powerful tool and has found use in numerous applications, yet, the nature of ...
Experimental Rugged Fitness Landscape in Protein Sequence Space
HAYASHI, Yuuki; 相田, 拓洋; TOYOTA, Hitoshi; 伏見, 譲; URABE, Itaru; YOMO, Tetsuya
2006-01-01
The fitness landscape in sequence space determines the process of biomolecular evolution. To plot the fitness landscape of protein function, we carried out in vitro molecular evolution beginning with a defective fd phage carrying a random polypeptide of 139 amino acids in place of the g3p minor coat protein D2 domain, which is essential for phage infection. After 20 cycles of random substitution at sites 12-130 of the initial random polypeptide and selection for infectivity, the selected phag...
Díaz Fernández, Ester
2010-01-01
In this thesis, new models and methodologies are introduced for the analysis of dynamic processes characterized by image sequences with spatial temporal overlapping. The spatial temporal overlapping exists in many natural phenomena and should be addressed properly in several Science disciplines such as Microscopy, Material Sciences, Biology, Geostatistics or Communication Networks. This work is related to the Point Process and Random Closed Set theories, within Stochastic Ge...
The Polytopic-k-Step Fibonacci Sequences in Finite Groups
Directory of Open Access Journals (Sweden)
Ömür Deveci
2011-01-01
Full Text Available We study the polytopic-k-step Fibonacci sequences, the polytopic-k-step Fibonacci sequences modulo m, and the polytopic-k-step Fibonacci sequences in finite groups. Also, we examine the periods of the polytopic-k-step Fibonacci sequences in semidihedral group SD2m.
Random Item Generation Is Affected by Age
Multani, Namita; Rudzicz, Frank; Wong, Wing Yiu Stephanie; Namasivayam, Aravind Kumar; van Lieshout, Pascal
2016-01-01
Purpose: Random item generation (RIG) involves central executive functioning. Measuring aspects of random sequences can therefore provide a simple method to complement other tools for cognitive assessment. We examine the extent to which RIG relates to specific measures of cognitive function, and whether those measures can be estimated using RIG…
Differentiating Visual from Response Sequencing during Long-term Skill Learning.
Lynch, Brighid; Beukema, Patrick; Verstynen, Timothy
2017-01-01
The dual-system model of sequence learning posits that during early learning there is an advantage for encoding sequences in sensory frames; however, it remains unclear whether this advantage extends to long-term consolidation. Using the serial RT task, we set out to distinguish the dynamics of learning sequential orders of visual cues from learning sequential responses. On each day, most participants learned a new mapping between a set of symbolic cues and responses made with one of four fingers, after which they were exposed to trial blocks of either randomly ordered cues or deterministic ordered cues (12-item sequence). Participants were randomly assigned to one of four groups (n = 15 per group): Visual sequences (same sequence of visual cues across training days), Response sequences (same order of key presses across training days), Combined (same serial order of cues and responses on all training days), and a Control group (a novel sequence each training day). Across 5 days of training, sequence-specific measures of response speed and accuracy improved faster in the Visual group than any of the other three groups, despite no group differences in explicit awareness of the sequence. The two groups that were exposed to the same visual sequence across days showed a marginal improvement in response binding that was not found in the other groups. These results indicate that there is an advantage, in terms of rate of consolidation across multiple days of training, for learning sequences of actions in a sensory representational space, rather than as motoric representations.
The Properties of Long Period Variables in the LMC from MACHO
Energy Technology Data Exchange (ETDEWEB)
Fraser, O J; Hawley, S L; Cook, K H
2008-05-06
We present a new analysis of the long period variables in the Large Magellanic Cloud from the MACHO Variable Star Catalog. Three-quarters of our sample of evolved, variable stars have periodic light curves. We characterize the stars in our sample using the multiple periods found in their frequency spectra. Additionally, we use single-epoch 2MASS measurements to construct the average infrared light curves for different groups of these stars. Comparison with evolutionary models shows that stars on the RGB or the Early AGB often show non-periodic variability, but begin to pulsate with periods on the two shortest period-luminosity sequences (1 & 2) when they brighten to K{sub s} {approx} 13. The stars on the Thermally Pulsing AGB are more likely to pulsate with longer periods that lie on the next two P-L sequences (3 & 4), including the sequence associated with the Miras in the LMC. The Petersen diagram and its variants show that multi-periodic stars on each pair of these sequences (3 & 4, and 1 & 2), typically pulsate with periods associated only with that pair. The periods in these multi-periodic stars become longer and stronger as the star evolves. We further constrain the mechanism behind the long secondary periods (LSPs) seen in half of our sample, and find that there is a close match between the luminosity functions of the LSP stars and all of the stars in our sample, and that these star's pulsation amplitudes are relatively wavelength independent. Although this is characteristic of stellar multiplicity, the large number of these variables is problematic for that explanation.
Data verification and materials accountancy for two accounting periods
International Nuclear Information System (INIS)
Beedgen, R.
1985-01-01
In the framework of near-real-time accountancy for nuclear materials, safeguards statistical analysis based on the operator's data of a sequence of materials balance periods has been performed. Up to now, it is assumed that the operator's data are correct. A statistical model is presented that enables inspector verification measurements for a sequence of accounting periods to be included into a safeguards procedure. The analysis uses a two balance period and statistical concepts which are applied in the case of one accounting period. The interconnection of different safeguards measures shall be studied to get a basic idea about the procedure and it is shown that there might be fundamental differences to the one balance case
Probabilistic Motor Sequence Yields Greater Offline and Less Online Learning than Fixed Sequence.
Du, Yue; Prashad, Shikha; Schoenbrun, Ilana; Clark, Jane E
2016-01-01
It is well acknowledged that motor sequences can be learned quickly through online learning. Subsequently, the initial acquisition of a motor sequence is boosted or consolidated by offline learning. However, little is known whether offline learning can drive the fast learning of motor sequences (i.e., initial sequence learning in the first training session). To examine offline learning in the fast learning stage, we asked four groups of young adults to perform the serial reaction time (SRT) task with either a fixed or probabilistic sequence and with or without preliminary knowledge (PK) of the presence of a sequence. The sequence and PK were manipulated to emphasize either procedural (probabilistic sequence; no preliminary knowledge (NPK)) or declarative (fixed sequence; with PK) memory that were found to either facilitate or inhibit offline learning. In the SRT task, there were six learning blocks with a 2 min break between each consecutive block. Throughout the session, stimuli followed the same fixed or probabilistic pattern except in Block 5, in which stimuli appeared in a random order. We found that PK facilitated the learning of a fixed sequence, but not a probabilistic sequence. In addition to overall learning measured by the mean reaction time (RT), we examined the progressive changes in RT within and between blocks (i.e., online and offline learning, respectively). It was found that the two groups who performed the fixed sequence, regardless of PK, showed greater online learning than the other two groups who performed the probabilistic sequence. The groups who performed the probabilistic sequence, regardless of PK, did not display online learning, as indicated by a decline in performance within the learning blocks. However, they did demonstrate remarkably greater offline improvement in RT, which suggests that they are learning the probabilistic sequence offline. These results suggest that in the SRT task, the fast acquisition of a motor sequence is driven
Parallel motif extraction from very long sequences
Sahli, Majed; Mansour, Essam; Kalnis, Panos
2013-01-01
Motifs are frequent patterns used to identify biological functionality in genomic sequences, periodicity in time series, or user trends in web logs. In contrast to a lot of existing work that focuses on collections of many short sequences, modern
Security Flaws in an Efficient Pseudo-Random Number Generator for Low-Power Environments
Peris-Lopez, Pedro; Hernandez-Castro, Julio C.; Tapiador, Juan M. E.; Millán, Enrique San; van der Lubbe, Jan C. A.
In 2004, Settharam and Rhee tackled the design of a lightweight Pseudo-Random Number Generator (PRNG) suitable for low-power environments (e.g. sensor networks, low-cost RFID tags). First, they explicitly fixed a set of requirements for this primitive. Then, they proposed a PRNG conforming to these requirements and using a free-running timer [9]. We analyze this primitive discovering important security faults. The proposed algorithm fails to pass even relatively non-stringent batteries of randomness such as ENT (i.e. a pseudorandom number sequence test program). We prove that their recommended PRNG has a very short period due to the flawed design of its core. The internal state can be easily revealed, compromising its backward and forward security. Additionally, the rekeying algorithm is defectively designed mainly related to the unpractical value proposed for this purpose.
Targeted reduction of highly abundant transcripts using pseudo-random primers.
Arnaud, Ophélie; Kato, Sachi; Poulain, Stéphane; Plessy, Charles
2016-04-01
Transcriptome studies based on quantitative sequencing can estimate levels of gene expression by measuring target RNA abundance in sequencing libraries. Sequencing costs are proportional to the total number of sequenced reads, and in order to cover rare RNAs, considerable quantities of abundant and identical reads are needed. This major limitation can be addressed by depleting a proportion of the most abundant sequences from the library. However, such depletion strategies involve either extra handling of the input RNA sample or use of a large number of reverse transcription primers, termed not-so-random (NSR) primers, which are costly to synthesize. Taking advantage of the high tolerance of reverse transcriptase to mis-prime, we found that it is possible to use as few as 40 pseudo-random (PS) reverse transcription primers to decrease the rate of undesirable abundant sequences within a library without affecting the overall transcriptome diversity. PS primers are simple to design and can be used to deplete several undesirable RNAs simultaneously, thus creating a flexible tool for enriching transcriptome libraries for rare transcript sequences.
Study of RNA structures with a connection to random matrix theory
International Nuclear Information System (INIS)
Bhadola, Pradeep; Deo, Nivedita
2015-01-01
This manuscript investigates the level of complexity and thermodynamic properties of the real RNA structures and compares the properties with the random RNA sequences. A discussion on the similarities of thermodynamical properties of the real structures with the non linear random matrix model of RNA folding is presented. The structural information contained in the PDB file is exploited to get the base pairing information. The complexity of an RNA structure is defined by a topological quantity called genus which is calculated from the base pairing information. Thermodynamic analysis of the real structures is done numerically. The real structures have a minimum free energy which is very small compared to the randomly generated sequences of the same length. This analysis suggests that there are specific patterns in the structures which are preserved during the evolution of the sequences and certain sequences are discarded by the evolutionary process. Further analyzing the sequences of a fixed length reveal that the RNA structures exist in ensembles i.e. although all the sequences in the ensemble have different series of nucleotides (sequence) they fold into structures that have the same pairs of hydrogen bonding as well as the same minimum free energy. The specific heat of the RNA molecule is numerically estimated at different lengths. The specific heat curve with temperature shows a bump and for some RNA, a double peak behavior is observed. The same behavior is seen in the study of the random matrix model with non linear interaction of RNA folding. The bump in the non linear matrix model can be controlled by the change in the interaction strength.
Experimental Rugged Fitness Landscape in Protein Sequence Space
Hayashi, Yuuki; Aita, Takuyo; Toyota, Hitoshi; Husimi, Yuzuru; Urabe, Itaru; Yomo, Tetsuya
2006-01-01
The fitness landscape in sequence space determines the process of biomolecular evolution. To plot the fitness landscape of protein function, we carried out in vitro molecular evolution beginning with a defective fd phage carrying a random polypeptide of 139 amino acids in place of the g3p minor coat protein D2 domain, which is essential for phage infection. After 20 cycles of random substitution at sites 12–130 of the initial random polypeptide and selection for infectivity, the selected phage showed a 1.7×104-fold increase in infectivity, defined as the number of infected cells per ml of phage suspension. Fitness was defined as the logarithm of infectivity, and we analyzed (1) the dependence of stationary fitness on library size, which increased gradually, and (2) the time course of changes in fitness in transitional phases, based on an original theory regarding the evolutionary dynamics in Kauffman's n-k fitness landscape model. In the landscape model, single mutations at single sites among n sites affect the contribution of k other sites to fitness. Based on the results of these analyses, k was estimated to be 18–24. According to the estimated parameters, the landscape was plotted as a smooth surface up to a relative fitness of 0.4 of the global peak, whereas the landscape had a highly rugged surface with many local peaks above this relative fitness value. Based on the landscapes of these two different surfaces, it appears possible for adaptive walks with only random substitutions to climb with relative ease up to the middle region of the fitness landscape from any primordial or random sequence, whereas an enormous range of sequence diversity is required to climb further up the rugged surface above the middle region. PMID:17183728
Experimental rugged fitness landscape in protein sequence space.
Hayashi, Yuuki; Aita, Takuyo; Toyota, Hitoshi; Husimi, Yuzuru; Urabe, Itaru; Yomo, Tetsuya
2006-12-20
The fitness landscape in sequence space determines the process of biomolecular evolution. To plot the fitness landscape of protein function, we carried out in vitro molecular evolution beginning with a defective fd phage carrying a random polypeptide of 139 amino acids in place of the g3p minor coat protein D2 domain, which is essential for phage infection. After 20 cycles of random substitution at sites 12-130 of the initial random polypeptide and selection for infectivity, the selected phage showed a 1.7x10(4)-fold increase in infectivity, defined as the number of infected cells per ml of phage suspension. Fitness was defined as the logarithm of infectivity, and we analyzed (1) the dependence of stationary fitness on library size, which increased gradually, and (2) the time course of changes in fitness in transitional phases, based on an original theory regarding the evolutionary dynamics in Kauffman's n-k fitness landscape model. In the landscape model, single mutations at single sites among n sites affect the contribution of k other sites to fitness. Based on the results of these analyses, k was estimated to be 18-24. According to the estimated parameters, the landscape was plotted as a smooth surface up to a relative fitness of 0.4 of the global peak, whereas the landscape had a highly rugged surface with many local peaks above this relative fitness value. Based on the landscapes of these two different surfaces, it appears possible for adaptive walks with only random substitutions to climb with relative ease up to the middle region of the fitness landscape from any primordial or random sequence, whereas an enormous range of sequence diversity is required to climb further up the rugged surface above the middle region.
Experimental rugged fitness landscape in protein sequence space.
Directory of Open Access Journals (Sweden)
Yuuki Hayashi
Full Text Available The fitness landscape in sequence space determines the process of biomolecular evolution. To plot the fitness landscape of protein function, we carried out in vitro molecular evolution beginning with a defective fd phage carrying a random polypeptide of 139 amino acids in place of the g3p minor coat protein D2 domain, which is essential for phage infection. After 20 cycles of random substitution at sites 12-130 of the initial random polypeptide and selection for infectivity, the selected phage showed a 1.7x10(4-fold increase in infectivity, defined as the number of infected cells per ml of phage suspension. Fitness was defined as the logarithm of infectivity, and we analyzed (1 the dependence of stationary fitness on library size, which increased gradually, and (2 the time course of changes in fitness in transitional phases, based on an original theory regarding the evolutionary dynamics in Kauffman's n-k fitness landscape model. In the landscape model, single mutations at single sites among n sites affect the contribution of k other sites to fitness. Based on the results of these analyses, k was estimated to be 18-24. According to the estimated parameters, the landscape was plotted as a smooth surface up to a relative fitness of 0.4 of the global peak, whereas the landscape had a highly rugged surface with many local peaks above this relative fitness value. Based on the landscapes of these two different surfaces, it appears possible for adaptive walks with only random substitutions to climb with relative ease up to the middle region of the fitness landscape from any primordial or random sequence, whereas an enormous range of sequence diversity is required to climb further up the rugged surface above the middle region.
Directory of Open Access Journals (Sweden)
Yuichi eYamashita
2011-04-01
Full Text Available How the brain learns and generates temporal sequences is a fundamental issue in neuroscience. The production of birdsongs, a process which involves complex learned sequences, provides researchers with an excellent biological model for this topic. The Bengalese finch in particular learns a highly complex song with syntactical structure. The nucleus HVC (HVC, a premotor nucleus within the avian song system, plays a key role in generating the temporal structures of their songs. From lesion studies, the nucleus interfacialis (NIf projecting to the HVC is considered one of the essential regions that contribute to the complexity of their songs. However, the types of interaction between the HVC and the NIf that can produce complex syntactical songs remain unclear. In order to investigate the function of interactions between the HVC and NIf, we have proposed a neural network model based on previous biological evidence. The HVC is modeled by a recurrent neural network (RNN that learns to generate temporal patterns of songs. The NIf is modeled as a mechanism that provides auditory feedback to the HVC and generates random noise that feeds into the HVC. The model showed that complex syntactical songs can be replicated by simple interactions between deterministic dynamics of the RNN and random noise. In the current study, the plausibility of the model is tested by the comparison between the changes in the songs of actual birds induced by pharmacological inhibition of the NIf and the changes in the songs produced by the model resulting from modification of parameters representing NIf functions. The efficacy of the model demonstrates that the changes of songs induced by pharmacological inhibition of the NIf can be interpreted as a trade-off between the effects of noise and the effects of feedback on the dynamics of the RNN of the HVC. These facts suggest that the current model provides a convincing hypothesis for the functional role of NIf-HVC interaction.
Otsuka, Sachio; Saiki, Jun
2016-02-01
Prior studies have shown that visual statistical learning (VSL) enhances familiarity (a type of memory) of sequences. How do statistical regularities influence the processing of each triplet element and inserted distractors that disrupt the regularity? Given that increased attention to triplets induced by VSL and inhibition of unattended triplets, we predicted that VSL would promote memory for each triplet constituent, and degrade memory for inserted stimuli. Across the first two experiments, we found that objects from structured sequences were more likely to be remembered than objects from random sequences, and that letters (Experiment 1) or objects (Experiment 2) inserted into structured sequences were less likely to be remembered than those inserted into random sequences. In the subsequent two experiments, we examined an alternative account for our results, whereby the difference in memory for inserted items between structured and random conditions is due to individuation of items within random sequences. Our findings replicated even when control letters (Experiment 3A) or objects (Experiment 3B) were presented before or after, rather than inserted into, random sequences. Our findings suggest that statistical learning enhances memory for each item in a regular set and impairs memory for items that disrupt the regularity. Copyright © 2015 Elsevier B.V. All rights reserved.
Nonlinear analysis of sequence symmetry of beta-trefoil family proteins
Energy Technology Data Exchange (ETDEWEB)
Li Mingfeng [Biomolecular Physics and Modeling Group, Department of Physics, Huazhong University of Science and Technology, Wuhan 430074, Hubei (China); Huang Yanzhao [Biomolecular Physics and Modeling Group, Department of Physics, Huazhong University of Science and Technology, Wuhan 430074, Hubei (China); Xu Ruizhen [Biomolecular Physics and Modeling Group, Department of Physics, Huazhong University of Science and Technology, Wuhan 430074, Hubei (China); Xiao Yi [Biomolecular Physics and Modeling Group, Department of Physics, Huazhong University of Science and Technology, Wuhan 430074, Hubei (China)]. E-mail: yxiao@mail.hust.edu.cn
2005-07-01
The tertiary structures of proteins of beta-trefoil family have three-fold quasi-symmetry while their amino acid sequences appear almost at random. In the present paper we show that these amino acid sequences have hidden symmetries in fact and furthermore the degrees of these hidden symmetries are the same as those of their tertiary structures. We shall present a modified recurrence plot to reveal hidden symmetries in protein sequences. Our results can explain the contradiction in sequence-structure relations of proteins of beta-trefoil family.
Tamaki, Kentaro; Fukuyama, Akiko Komatsu; Terukina, Shigeharu; Kamada, Yoshihiko; Uehara, Kano; Arakaki, Miwa; Yamashiro, Kazuko; Miyashita, Minoru; Ishida, Takanori; McNamara, Keely May; Ohuchi, Noriaki; Tamaki, Nobumitsu; Sasano, Hironobu
2017-04-01
Several studies focused on the effect of aromatherapy on mood, quality of life (QOL), and physical symptoms in patients with cancer. We compared the effects on QOL, vital signs, and sleep quality between aromatherapy and conventional therapy during perioperative periods of the breast cancer patients in this study. Patients were randomly assigned in a 2:1 ratio to receive aromatherapy or usual care. The primary endpoint was QOL, which was assessed using the quality of life questionnaire QLQ-C30, Version 3.0 of the European Organization for Research and Treatment of Cancer (EORTC) Study Group on quality of life. Secondary endpoints included the necessity of hypnotics, vital signs including blood pressure and heart rate and adverse events. In addition, we also summarized the patients' perception of the experience from a free description-type questionnaire. A total of 249 patients had breast cancer surgery and 162 patients gave physician consent and were recruited; 110 were randomly assigned to aromatherapy group (eight patients showed incomplete EORTC QLQ-C30) and 52 to control group (one patient showed incomplete EORTC QLQ-C30). There were no statistically significant differences between the aromatherapy group and control group in the EORTC QLQ-C30 at the surgery day. As for the results of the post-operation day 1, trends for differentiations of physical functioning and role functioning were detected between aromatherapy group and control group, but the differences did not reach statistical significance (p = 0.08 and 0.09). There were no significant differences of systolic and diastolic blood pressures between aromatherapy group and control group (p = 0.82 and 0.68). There was no statistically significant difference in heart rates between aromatherapy group (70.6 ± 11.0 bpm) and control group (71.2 ± 9.8 bpm) (p = 0.73). Likewise, the rate of hypnotic use was not statistically significant (p = 0.10). No adverse events were reported after aromatherapy
On the design of henon and logistic map-based random number generator
Magfirawaty; Suryadi, M. T.; Ramli, Kalamullah
2017-10-01
The key sequence is one of the main elements in the cryptosystem. True Random Number Generators (TRNG) method is one of the approaches to generating the key sequence. The randomness source of the TRNG divided into three main groups, i.e. electrical noise based, jitter based and chaos based. The chaos based utilizes a non-linear dynamic system (continuous time or discrete time) as an entropy source. In this study, a new design of TRNG based on discrete time chaotic system is proposed, which is then simulated in LabVIEW. The principle of the design consists of combining 2D and 1D chaotic systems. A mathematical model is implemented for numerical simulations. We used comparator process as a harvester method to obtain the series of random bits. Without any post processing, the proposed design generated random bit sequence with high entropy value and passed all NIST 800.22 statistical tests.
Multiple sequence alignment accuracy and phylogenetic inference.
Ogden, T Heath; Rosenberg, Michael S
2006-04-01
Phylogenies are often thought to be more dependent upon the specifics of the sequence alignment rather than on the method of reconstruction. Simulation of sequences containing insertion and deletion events was performed in order to determine the role that alignment accuracy plays during phylogenetic inference. Data sets were simulated for pectinate, balanced, and random tree shapes under different conditions (ultrametric equal branch length, ultrametric random branch length, nonultrametric random branch length). Comparisons between hypothesized alignments and true alignments enabled determination of two measures of alignment accuracy, that of the total data set and that of individual branches. In general, our results indicate that as alignment error increases, topological accuracy decreases. This trend was much more pronounced for data sets derived from more pectinate topologies. In contrast, for balanced, ultrametric, equal branch length tree shapes, alignment inaccuracy had little average effect on tree reconstruction. These conclusions are based on average trends of many analyses under different conditions, and any one specific analysis, independent of the alignment accuracy, may recover very accurate or inaccurate topologies. Maximum likelihood and Bayesian, in general, outperformed neighbor joining and maximum parsimony in terms of tree reconstruction accuracy. Results also indicated that as the length of the branch and of the neighboring branches increase, alignment accuracy decreases, and the length of the neighboring branches is the major factor in topological accuracy. Thus, multiple-sequence alignment can be an important factor in downstream effects on topological reconstruction.
Tzvi, Elinor; Bauhaus, Leon J; Kessler, Till U; Liebrand, Matthias; Wöstmann, Malte; Krämer, Ulrike M
2018-03-01
Cross-frequency coupling is suggested to serve transfer of information between wide-spread neuronal assemblies and has been shown to underlie many cognitive functions including learning and memory. In previous work, we found that alpha (8-13 Hz) - gamma (30-48 Hz) phase amplitude coupling (αγPAC) is decreased during sequence learning in bilateral frontal cortex and right parietal cortex. We interpreted this to reflect decreased demands for visuo-motor mapping once the sequence has been encoded. In the present study, we put this hypothesis to the test by adding a "simple" condition to the standard serial reaction time task (SRTT) with minimal needs for visuo-motor mapping. The standard SRTT in our paradigm entailed a perceptual sequence allowing for implicit learning of a sequence of colors with randomly assigned motor responses. Sequence learning in this case was thus not associated with reduced demands for visuo-motor mapping. Analysis of oscillatory power revealed a learning-related alpha decrease pointing to a stronger recruitment of occipito-parietal areas when encoding the perceptual sequence. Replicating our previous findings but in contrast to our hypothesis, αγPAC was decreased in sequence compared to random trials over right frontal and parietal cortex. It also tended to be smaller compared to trials requiring a simple motor sequence. We additionally analyzed αγPAC in resting-state data of a separate cohort. PAC in electrodes over right parietal cortex was significantly stronger compared to sequence trials and tended to be higher compared to simple and random trials of the SRTT data. We suggest that αγPAC in right parietal cortex reflects a "default-mode" brain state, which gets perturbed to allow for encoding of visual regularities into memory. Copyright © 2018 Elsevier Inc. All rights reserved.
Spreading Sequences Generated Using Asymmetrical Integer-Number Maps
Directory of Open Access Journals (Sweden)
V. Sebesta
2007-09-01
Full Text Available Chaotic sequences produced by piecewise linear maps can be transformed to binary sequences. The binary sequences are optimal for the asynchronous DS/CDMA systems in case of certain shapes of the maps. This paper is devoted to the one-to-one integer-number maps derived from the suitable asymmetrical piecewise linear maps. Such maps give periodic integer-number sequences, which can be transformed to the binary sequences. The binary sequences produced via proposed modified integer-number maps are perfectly balanced and embody good autocorrelation and crosscorrelation properties. The number of different binary sequences is sizable. The sequences are suitable as spreading sequences in DS/CDMA systems.
Cluster-Based Multipolling Sequencing Algorithm for Collecting RFID Data in Wireless LANs
Choi, Woo-Yong; Chatterjee, Mainak
2015-03-01
With the growing use of RFID (Radio Frequency Identification), it is becoming important to devise ways to read RFID tags in real time. Access points (APs) of IEEE 802.11-based wireless Local Area Networks (LANs) are being integrated with RFID networks that can efficiently collect real-time RFID data. Several schemes, such as multipolling methods based on the dynamic search algorithm and random sequencing, have been proposed. However, as the number of RFID readers associated with an AP increases, it becomes difficult for the dynamic search algorithm to derive the multipolling sequence in real time. Though multipolling methods can eliminate the polling overhead, we still need to enhance the performance of the multipolling methods based on random sequencing. To that extent, we propose a real-time cluster-based multipolling sequencing algorithm that drastically eliminates more than 90% of the polling overhead, particularly so when the dynamic search algorithm fails to derive the multipolling sequence in real time.
Central limit theorems for sequences with m(n)-dependent main part
Nieuwenhuis, G.
1992-01-01
Let (Xi(n); n ϵ N, 1⩽i⩽h(n)) be a double sequence of random variables with h(n)→∞ as n→∞. Suppose that the sequence can be split into two parts: an m(n)-dependent sequence (Xi,m(n); n ϵ N, 1⩽i⩽h(n)) of main terms and a sequence (Xi,m(n); n ϵ N, 1⩽i⩽h(n)) of residual terms. Here (m(n)) may be
Directory of Open Access Journals (Sweden)
Aaron Silva-Sanchez
Full Text Available Variability in the developing antibody repertoire is focused on the third complementarity determining region of the H chain (CDR-H3, which lies at the center of the antigen binding site where it often plays a decisive role in antigen binding. The power of VDJ recombination and N nucleotide addition has led to the common conception that the sequence of CDR-H3 is unrestricted in its variability and random in its composition. Under this view, the immune response is solely controlled by somatic positive and negative clonal selection mechanisms that act on individual B cells to promote production of protective antibodies and prevent the production of self-reactive antibodies. This concept of a repertoire of random antigen binding sites is inconsistent with the observation that diversity (DH gene segment sequence content by reading frame (RF is evolutionarily conserved, creating biases in the prevalence and distribution of individual amino acids in CDR-H3. For example, arginine, which is often found in the CDR-H3 of dsDNA binding autoantibodies, is under-represented in the commonly used DH RFs rearranged by deletion, but is a frequent component of rarely used inverted RF1 (iRF1, which is rearranged by inversion. To determine the effect of altering this germline bias in DH gene segment sequence on autoantibody production, we generated mice that by genetic manipulation are forced to utilize an iRF1 sequence encoding two arginines. Over a one year period we collected serial serum samples from these unimmunized, specific pathogen-free mice and found that more than one-fifth of them contained elevated levels of dsDNA-binding IgG, but not IgM; whereas mice with a wild type DH sequence did not. Thus, germline bias against the use of arginine enriched DH sequence helps to reduce the likelihood of producing self-reactive antibodies.
A P-N Sequence Generator Using LFSR with Dual Edge Trigger Technique
Directory of Open Access Journals (Sweden)
Naghwal Nitin Kumar
2016-01-01
Full Text Available This paper represents the design and implementation of a low power 4-bit LFSR using Dual edge triggered flip flop. A linear feedback shift register (LFSR is assembled by N number of flip flops connected in series and a combinational logic generally xor gate. An LFSR can generate random number sequence which acts as cipher in cryptography. A known text encrypted over long PN sequence, in order to improve security sequence made longer ie 128 bit; require long chain of flip flop leads to more power consumption. In this paper a novel circuit of random sequence generator using dual edge triggered flip flop has been proposed. Data has been generated on every edge of flip flop instead of single edge. A DETFF-LFSR can generate random number require with less number of clock cycle, it minimizes the number of flip flop result in power saving. In this paper we concentrates on the designing of power competent Test Pattern Generator (TPG using four dual edge triggered flip-flops as the basic building block, overall there is reduction of power around 25% by using these techniques.
Bobrova, E V; Liakhovetskiĭ, V A; Borshchevskaia, E R
2011-01-01
The dependence of errors during reproduction of a sequence of hand movements without visual feedback on the previous right- and left-hand performance ("prehistory") and on positions in space of sequence elements (random or ordered by the explicit rule) was analyzed. It was shown that the preceding information about the ordered positions of the sequence elements was used during right-hand movements, whereas left-hand movements were performed with involvement of the information about the random sequence. The data testify to a central mechanism of the analysis of spatial structure of sequence elements. This mechanism activates movement coding specific for the left hemisphere (vector coding) in case of an ordered sequence structure and positional coding specific for the right hemisphere in case of a random sequence structure.
Directory of Open Access Journals (Sweden)
Marek Kouba
Full Text Available In altricial birds, the nestling period is an important part of the breeding phase because the juveniles may spend quite a long time in the nest, with associated high energy costs for the parents. The length of the nestling period can be variable and its duration may be influenced by both biotic and abiotic factors; however, studies of this have mostly been undertaken on passerine birds. We studied individual duration of nestling period of 98 Tengmalm's owl chicks (Aegolius funereus at 27 nests during five breeding seasons using a camera and chip system and radio-telemetry. We found the nestlings stayed in the nest box for 27 - 38 days from hatching (mean ± SD, 32.4 ± 2.2 days. The individual duration of nestling period was negatively related to wing length, but no formally significant effect was found for body weight, sex, prey availability and/or weather conditions. The fledging sequence of individual nestlings was primarily related to hatching order; no relationship with wing length and/or other factors was found in this case. We suggest the length of wing is the most important measure of body condition and individual quality in Tengmalm's owl young determining the duration of the nestling period. Other differences from passerines (e.g., the lack of effect of weather or prey availability on nestling period are considered likely to be due to different life-history traits, in particular different food habits and nesting sites and greater risk of nest predation among passerines.
Influence of Layup Sequence on the Surface Accuracy of Carbon Fiber Composite Space Mirrors
Yang, Zhiyong; Liu, Qingnian; Zhang, Boming; Xu, Liang; Tang, Zhanwen; Xie, Yongjie
2018-04-01
Layup sequence is directly related to stiffness and deformation resistance of the composite space mirror, and error caused by layup sequence can affect the surface precision of composite mirrors evidently. Variation of layup sequence with the same total thickness of composite space mirror changes surface form of the composite mirror, which is the focus of our study. In our research, the influence of varied quasi-isotropic stacking sequences and random angular deviation on the surface accuracy of composite space mirrors was investigated through finite element analyses (FEA). We established a simulation model for the studied concave mirror with 500 mm diameter, essential factors of layup sequences and random angular deviations on different plies were discussed. Five guiding findings were described in this study. Increasing total plies, optimizing stacking sequence and keeping consistency of ply alignment in ply placement are effective to improve surface accuracy of composite mirror.
Reliability analysis of structures under periodic proof tests in service
Yang, J.-N.
1976-01-01
A reliability analysis of structures subjected to random service loads and periodic proof tests treats gust loads and maneuver loads as random processes. Crack initiation, crack propagation, and strength degradation are treated as the fatigue process. The time to fatigue crack initiation and ultimate strength are random variables. Residual strength decreases during crack propagation, so that failure rate increases with time. When a structure fails under periodic proof testing, a new structure is built and proof-tested. The probability of structural failure in service is derived from treatment of all the random variables, strength degradations, service loads, proof tests, and the renewal of failed structures. Some numerical examples are worked out.
The span of correlations in dolphin whistle sequences
International Nuclear Information System (INIS)
Ferrer-i-Cancho, Ramon; McCowan, Brenda
2012-01-01
Long-range correlations are found in symbolic sequences from human language, music and DNA. Determining the span of correlations in dolphin whistle sequences is crucial for shedding light on their communicative complexity. Dolphin whistles share various statistical properties with human words, i.e. Zipf's law for word frequencies (namely that the probability of the ith most frequent word of a text is about i −α ) and a parallel of the tendency of more frequent words to have more meanings. The finding of Zipf's law for word frequencies in dolphin whistles has been the topic of an intense debate on its implications. One of the major arguments against the relevance of Zipf's law in dolphin whistles is that it is not possible to distinguish the outcome of a die-rolling experiment from that of a linguistic or communicative source producing Zipf's law for word frequencies. Here we show that statistically significant whistle–whistle correlations extend back to the second previous whistle in the sequence, using a global randomization test, and to the fourth previous whistle, using a local randomization test. None of these correlations are expected by a die-rolling experiment and other simple explanations of Zipf's law for word frequencies, such as Simon's model, that produce sequences of unpredictable elements
International Nuclear Information System (INIS)
Pinnarò, Paola; Giordano, Carolina; Farneti, Alessia; Strigari, Lidia; Landoni, Valeria; Marucci, Laura; Petrongari, Maria Grazia; Sanguineti, Giuseppe
2016-01-01
Purpose: To compare long-term late local toxicity after either concomitant or sequential chemoradiation therapy after breast-conserving surgery. Methods and Materials: From 1997 to 2002, women aged 18 to 75 years who underwent breast-conserving surgery and axillary dissection for early breast cancer and in whom CMF (cyclophosphamide, methotrexate, and 5-fluorouracil) chemotherapy was planned were randomized between concomitant and sequential radiation therapy. Radiation therapy was delivered to the whole breast through tangential fields to 50 Gy in 20 fractions over a period of 4 weeks, followed by an electron boost. Surviving patients were tentatively contacted and examined between March and September 2014. Patients in whom progressive disease had developed or who had undergone further breast surgery were excluded. Local toxicity (fibrosis, telangiectasia, and breast atrophy or retraction) was scored blindly to the treatment received. A logistic regression was run to investigate the effect of treatment sequence after correction for several patient-, treatment-, and tumor-related covariates on selected endpoints. The median time to cross-sectional analysis was 15.7 years (range, 12.0-17.8 years). Results: Of 206 patients randomized, 154 (74.8%) were potentially eligible. Of these, 43 (27.9%) refused participation and 4 (2.6%) had been lost to follow-up, and for 5 (3.2%), we could not restore planning data; thus, the final number of analyzed patients was 102. No grade 4 toxicity had been observed, whereas the number of grade 3 toxicity events was low (<8%) for each item, allowing pooling of grade 2 and 3 events for further analysis. Treatment sequence (concomitant vs sequential) was an independent predictor of grade 2 or 3 fibrosis according to both the National Cancer Institute Common Terminology Criteria for Adverse Events (odds ratio [OR], 4.05; 95% confidence interval [CI], 1.34-12.2; P=.013) and the SOMA (Subjective, Objective, Management and Analytic
Energy Technology Data Exchange (ETDEWEB)
Pinnarò, Paola; Giordano, Carolina; Farneti, Alessia [Department of Radiation Oncology, Regina Elena National Cancer Institute, Rome (Italy); Strigari, Lidia; Landoni, Valeria [Department of Physics, Regina Elena National Cancer Institute, Rome (Italy); Marucci, Laura; Petrongari, Maria Grazia [Department of Radiation Oncology, Regina Elena National Cancer Institute, Rome (Italy); Sanguineti, Giuseppe, E-mail: sanguineti@ifo.it [Department of Radiation Oncology, Regina Elena National Cancer Institute, Rome (Italy)
2016-07-15
Purpose: To compare long-term late local toxicity after either concomitant or sequential chemoradiation therapy after breast-conserving surgery. Methods and Materials: From 1997 to 2002, women aged 18 to 75 years who underwent breast-conserving surgery and axillary dissection for early breast cancer and in whom CMF (cyclophosphamide, methotrexate, and 5-fluorouracil) chemotherapy was planned were randomized between concomitant and sequential radiation therapy. Radiation therapy was delivered to the whole breast through tangential fields to 50 Gy in 20 fractions over a period of 4 weeks, followed by an electron boost. Surviving patients were tentatively contacted and examined between March and September 2014. Patients in whom progressive disease had developed or who had undergone further breast surgery were excluded. Local toxicity (fibrosis, telangiectasia, and breast atrophy or retraction) was scored blindly to the treatment received. A logistic regression was run to investigate the effect of treatment sequence after correction for several patient-, treatment-, and tumor-related covariates on selected endpoints. The median time to cross-sectional analysis was 15.7 years (range, 12.0-17.8 years). Results: Of 206 patients randomized, 154 (74.8%) were potentially eligible. Of these, 43 (27.9%) refused participation and 4 (2.6%) had been lost to follow-up, and for 5 (3.2%), we could not restore planning data; thus, the final number of analyzed patients was 102. No grade 4 toxicity had been observed, whereas the number of grade 3 toxicity events was low (<8%) for each item, allowing pooling of grade 2 and 3 events for further analysis. Treatment sequence (concomitant vs sequential) was an independent predictor of grade 2 or 3 fibrosis according to both the National Cancer Institute Common Terminology Criteria for Adverse Events (odds ratio [OR], 4.05; 95% confidence interval [CI], 1.34-12.2; P=.013) and the SOMA (Subjective, Objective, Management and Analytic
Disentangling the effects of alternation rate and maximum run length on judgments of randomness
Directory of Open Access Journals (Sweden)
Sabine G. Scholl
2011-08-01
Full Text Available Binary sequences are characterized by various features. Two of these characteristics---alternation rate and run length---have repeatedly been shown to influence judgments of randomness. The two characteristics, however, have usually been investigated separately, without controlling for the other feature. Because the two features are correlated but not identical, it seems critical to analyze their unique impact, as well as their interaction, so as to understand more clearly what influences judgments of randomness. To this end, two experiments on the perception of binary sequences orthogonally manipulated alternation rate and maximum run length (i.e., length of the longest run within the sequence. Results show that alternation rate consistently exerts a unique effect on judgments of randomness, but that the effect of alternation rate is contingent on the length of the longest run within the sequence. The effect of maximum run length was found to be small and less consistent. Together, these findings extend prior randomness research by integrating literature from the realms of perception, categorization, and prediction, as well as by showing the unique and joint effects of alternation rate and maximum run length on judgments of randomness.
Homogenization of metasurfaces formed by random resonant particles in periodical lattices
DEFF Research Database (Denmark)
Andryieuski, Andrei; Lavrinenko, Andrei; Petrov, Mihail
2016-01-01
In this paper we suggest a simple analytical method for description of electromagnetic properties of a geometrically regular two-dimensional subwavelength arrays (metasurfaces) formed by particles with randomly fluctuating polarizabilities. We propose an analytical homogenization method applicable...
Directory of Open Access Journals (Sweden)
Soosan Alimohammadzadeh Taher
2008-06-01
Full Text Available Objective: The study evaluated the efficacy of oral calcium carbonate supplement on leg pain in pregnancy and nursing period.Materials and methods: A total number of 176 women at third trimester of pregnancy or nursing period till to one year after delivery with complaint of leg pain, low back pain (LBP, and posterior pelvic pain (PPP were evaluated for distinct primary causes and were excluded, then 58 patients randomized into calcium group (n=27 treated with 500 mg calcium carbonate orally per day just for one week, and control group (n=31 received no drug. Incidence of days with leg, low back, and posterior pelvic pain per week were evaluated and compared between the two groups at 3 different weeks before, during, and after discontinuation of drug. Statistical significance was defined as P<0.05. Results: Mean number of days with leg pain per week during calcium carbonate intake was significantly different between the study and control groups (P<0.05. Mean number of days with LBP and PPP was not significantly different between two groups.Conclusion: The use of oral calcium supplement was associated with lower episodes of leg pain but failed to reduce the incidence of LBP and PPP in pregnancy and nursery period.
Quantifying biodiversity and asymptotics for a sequence of random strings.
Koyano, Hitoshi; Kishino, Hirohisa
2010-06-01
We present a methodology for quantifying biodiversity at the sequence level by developing the probability theory on a set of strings. Further, we apply our methodology to the problem of quantifying the population diversity of microorganisms in several extreme environments and digestive organs and reveal the relation between microbial diversity and various environmental parameters.
Real-time definition of non-randomness in the distribution of genomic events.
Directory of Open Access Journals (Sweden)
Ulrich Abel
Full Text Available Features such as mutations or structural characteristics can be non-randomly or non-uniformly distributed within a genome. So far, computer simulations were required for statistical inferences on the distribution of sequence motifs. Here, we show that these analyses are possible using an analytical, mathematical approach. For the assessment of non-randomness, our calculations only require information including genome size, number of (sampled sequence motifs and distance parameters. We have developed computer programs evaluating our analytical formulas for the real-time determination of expected values and p-values. This approach permits a flexible cluster definition that can be applied to most effectively identify non-random or non-uniform sequence motif distribution. As an example, we show the effectivity and reliability of our mathematical approach in clinical retroviral vector integration site distribution.
Detecting change in stochastic sound sequences.
Directory of Open Access Journals (Sweden)
Benjamin Skerritt-Davis
2018-05-01
Full Text Available Our ability to parse our acoustic environment relies on the brain's capacity to extract statistical regularities from surrounding sounds. Previous work in regularity extraction has predominantly focused on the brain's sensitivity to predictable patterns in sound sequences. However, natural sound environments are rarely completely predictable, often containing some level of randomness, yet the brain is able to effectively interpret its surroundings by extracting useful information from stochastic sounds. It has been previously shown that the brain is sensitive to the marginal lower-order statistics of sound sequences (i.e., mean and variance. In this work, we investigate the brain's sensitivity to higher-order statistics describing temporal dependencies between sound events through a series of change detection experiments, where listeners are asked to detect changes in randomness in the pitch of tone sequences. Behavioral data indicate listeners collect statistical estimates to process incoming sounds, and a perceptual model based on Bayesian inference shows a capacity in the brain to track higher-order statistics. Further analysis of individual subjects' behavior indicates an important role of perceptual constraints in listeners' ability to track these sensory statistics with high fidelity. In addition, the inference model facilitates analysis of neural electroencephalography (EEG responses, anchoring the analysis relative to the statistics of each stochastic stimulus. This reveals both a deviance response and a change-related disruption in phase of the stimulus-locked response that follow the higher-order statistics. These results shed light on the brain's ability to process stochastic sound sequences.
A universal algorithm to generate pseudo-random numbers based on uniform mapping as homeomorphism
International Nuclear Information System (INIS)
Fu-Lai, Wang
2010-01-01
A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0–1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator. (general)
A universal algorithm to generate pseudo-random numbers based on uniform mapping as homeomorphism
Wang, Fu-Lai
2010-09-01
A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0-1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator.
Memory and learning with rapid audiovisual sequences
Keller, Arielle S.; Sekuler, Robert
2015-01-01
We examined short-term memory for sequences of visual stimuli embedded in varying multisensory contexts. In two experiments, subjects judged the structure of the visual sequences while disregarding concurrent, but task-irrelevant auditory sequences. Stimuli were eight-item sequences in which varying luminances and frequencies were presented concurrently and rapidly (at 8 Hz). Subjects judged whether the final four items in a visual sequence identically replicated the first four items. Luminances and frequencies in each sequence were either perceptually correlated (Congruent) or were unrelated to one another (Incongruent). Experiment 1 showed that, despite encouragement to ignore the auditory stream, subjects' categorization of visual sequences was strongly influenced by the accompanying auditory sequences. Moreover, this influence tracked the similarity between a stimulus's separate audio and visual sequences, demonstrating that task-irrelevant auditory sequences underwent a considerable degree of processing. Using a variant of Hebb's repetition design, Experiment 2 compared musically trained subjects and subjects who had little or no musical training on the same task as used in Experiment 1. Test sequences included some that intermittently and randomly recurred, which produced better performance than sequences that were generated anew for each trial. The auditory component of a recurring audiovisual sequence influenced musically trained subjects more than it did other subjects. This result demonstrates that stimulus-selective, task-irrelevant learning of sequences can occur even when such learning is an incidental by-product of the task being performed. PMID:26575193
Memory and learning with rapid audiovisual sequences.
Keller, Arielle S; Sekuler, Robert
2015-01-01
We examined short-term memory for sequences of visual stimuli embedded in varying multisensory contexts. In two experiments, subjects judged the structure of the visual sequences while disregarding concurrent, but task-irrelevant auditory sequences. Stimuli were eight-item sequences in which varying luminances and frequencies were presented concurrently and rapidly (at 8 Hz). Subjects judged whether the final four items in a visual sequence identically replicated the first four items. Luminances and frequencies in each sequence were either perceptually correlated (Congruent) or were unrelated to one another (Incongruent). Experiment 1 showed that, despite encouragement to ignore the auditory stream, subjects' categorization of visual sequences was strongly influenced by the accompanying auditory sequences. Moreover, this influence tracked the similarity between a stimulus's separate audio and visual sequences, demonstrating that task-irrelevant auditory sequences underwent a considerable degree of processing. Using a variant of Hebb's repetition design, Experiment 2 compared musically trained subjects and subjects who had little or no musical training on the same task as used in Experiment 1. Test sequences included some that intermittently and randomly recurred, which produced better performance than sequences that were generated anew for each trial. The auditory component of a recurring audiovisual sequence influenced musically trained subjects more than it did other subjects. This result demonstrates that stimulus-selective, task-irrelevant learning of sequences can occur even when such learning is an incidental by-product of the task being performed.
Okamoto, Hidehiko; Stracke, Henning; Lagemann, Lothar; Pantev, Christo
2010-01-01
The capability of involuntarily tracking certain sound signals during the simultaneous presence of noise is essential in human daily life. Previous studies have demonstrated that top-down auditory focused attention can enhance excitatory and inhibitory neural activity, resulting in sharpening of frequency tuning of auditory neurons. In the present study, we investigated bottom-up driven involuntary neural processing of sound signals in noisy environments by means of magnetoencephalography. We contrasted two sound signal sequencing conditions: "constant sequencing" versus "random sequencing." Based on a pool of 16 different frequencies, either identical (constant sequencing) or pseudorandomly chosen (random sequencing) test frequencies were presented blockwise together with band-eliminated noises to nonattending subjects. The results demonstrated that the auditory evoked fields elicited in the constant sequencing condition were significantly enhanced compared with the random sequencing condition. However, the enhancement was not significantly different between different band-eliminated noise conditions. Thus the present study confirms that by constant sound signal sequencing under nonattentive listening the neural activity in human auditory cortex can be enhanced, but not sharpened. Our results indicate that bottom-up driven involuntary neural processing may mainly amplify excitatory neural networks, but may not effectively enhance inhibitory neural circuits.
Chen, Y C; Huang, F D; Chen, N H; Shou, J Y; Wu, L
1998-04-01
In the last 2-3 decades the role of the premotor cortex (PM) of monkey in memorized spatial sequential (MSS) movements has been amply investigated. However, it is as yet not known whether PM participates in the movement sequence behaviour guided by recognition of visual figures (i.e. the figure-recognition sequence, FRS). In the present work three monkeys were trained to perform both FRS and MSS tasks. Postmortem examination showed that 202 cells were in the dorso-lateral premotor cortex. Among 111 cells recorded during the two tasks, more than 50% changed their activity during the cue periods in either task. During the response period, the ratios of cells with changes of firing rate in both FRS and MSS were high and roughly equal to each other, while during the image period, the proportion in the FRS (83.7%) was significantly higher than that in the MSS (66.7%). Comparison of neuronal activities during same motor sequence of two different tasks showed that during the image periods PM neuronal activities were more closely related to the FRS task, while during the cue periods no difference could be found. Analysis of cell responses showed that the neurons with longer latency were much more in MSS than in FRS in either cue or image period. The present results indicate that the premotor cortex participates in FRS motor sequence as well as in MSS and suggest that the dorso-lateral PM represents another subarea in function shared by both FRS and MSS tasks. However, in view of the differences of PM neuronal responses in cue or image periods of FRS and MSS tasks, it seems likely that neural networks involved in FRS and MSS tasks are different.
How universal is the period doubling phenomenon in equations with quadratic nonlinearity
International Nuclear Information System (INIS)
Malta, C.P.; Oliveira, C.R. de.
1983-09-01
Varying one parameter, the solution of nonlinear 1 sup(st) order differential equation with time delay tau is Fourier analysed. After the Hopf bifurcation, period-doubling phenomenon always occurs when tau is one of the fixed parameters (both for small and large tau). Varying tau, there are values of the fixed parameters for which no period-doubling occurs. 'Chaos' follows the period-doubling sequence and the rate at which 'chaos' is approached is very close to the universal delta = 4.6692016... characterising the period-doubling sequence to chaos in nonlinear difference equations. (Author) [pt
Asymptotic Properties of Multistate Random Walks. I. Theory
Roerdink, J.B.T.M.; Shuler, K.E.
1985-01-01
A calculation is presented of the long-time behavior of various random walk properties (moments, probability of return to the origin, expected number of distinct sites visited) for multistate random walks on periodic lattices. In particular, we consider inhomogeneous periodic lattices, consisting of
Random walk generated by random permutations of {1, 2, 3, ..., n + 1}
International Nuclear Information System (INIS)
Oshanin, G; Voituriez, R
2004-01-01
We study properties of a non-Markovian random walk X (n) l , l = 0, 1, 2, ..., n, evolving in discrete time l on a one-dimensional lattice of integers, whose moves to the right or to the left are prescribed by the rise-and-descent sequences characterizing random permutations π of [n + 1] = {1, 2, 3, ..., n + 1}. We determine exactly the probability of finding the end-point X n = X (n) n of the trajectory of such a permutation-generated random walk (PGRW) at site X, and show that in the limit n → ∞ it converges to a normal distribution with a smaller, compared to the conventional Polya random walk, diffusion coefficient. We formulate, as well, an auxiliary stochastic process whose distribution is identical to the distribution of the intermediate points X (n) l , l < n, which enables us to obtain the probability measure of different excursions and to define the asymptotic distribution of the number of 'turns' of the PGRW trajectories
Damsbo-Svendsen, Signe; Rønsholdt, Mia Dybkjær; Lauritzen, Lotte
2013-07-01
Marine n-3 fatty acids are hypothesized to have beneficial effects on obesity and cancer cachexia possibly via an effect on appetite. The aim of this study was to investigate, if fish oil-supplementation affects appetite in healthy individuals. In a randomized cross-over study, 20 normal-weight subjects (50% females) were given ten 0.5-mL capsules/day of fish oil or soybean oil for 3 weeks separated by 1-week wash-out. In the end of each period, appetite was assessed by 10-cm visual analog scales immediately before and after a standardized breakfast. Results were analyzed in accordance with the paired design considering oil sequence and gender. All subjects completed both periods with a compliance of 96% and oil sequence did not affect the results. There was no difference between the two supplements in any pre-breakfast appetite scores, but the post-prandial sensation of being full was 1.21 cm (0.20; 2.22) lower after the fish oil-period. Furthermore, there was a supplement × gender-interaction on "desire to eat more" due to a score increase of 1.09 cm (0.28; 1.90) in women only. These results suggest that marine n-3 fatty acid may increase appetite. This finding would be potentially beneficial for patients with compromised nutritional status. Copyright © 2013 Elsevier Ltd. All rights reserved.
Küstner, Thomas; Würslin, Christian; Schwartz, Martin; Martirosian, Petros; Gatidis, Sergios; Brendle, Cornelia; Seith, Ferdinand; Schick, Fritz; Schwenzer, Nina F; Yang, Bin; Schmidt, Holger
2017-08-01
To enable fast and flexible high-resolution four-dimensional (4D) MRI of periodic thoracic/abdominal motion for motion visualization or motion-corrected imaging. We proposed a Cartesian three-dimensional k-space sampling scheme that acquires a random combination of k-space lines in the ky/kz plane. A partial Fourier-like constraint compacts the sampling space to one half of k-space. The central k-space line is periodically acquired to allow an extraction of a self-navigated respiration signal used to populate a k-space of multiple breathing positions. The randomness of the acquisition (induced by periodic breathing pattern) yields a subsampled k-space that is reconstructed using compressed sensing. Local image evaluations (coefficient of variation and slope steepness through organs) reveal information about motion resolvability. Image quality is inspected by a blinded reading. Sequence and reconstruction method are made publicly available. The method is able to capture and reconstruct 4D images with high image quality and motion resolution within a short scan time of less than 2 min. These findings are supported by restricted-isometry-property analysis, local image evaluation, and blinded reading. The proposed method provides a clinical feasible setup to capture periodic respiratory motion with a fast acquisition protocol and can be extended by further surrogate signals to capture additional periodic motions. Retrospective parametrization allows for flexible tuning toward the targeted applications. Magn Reson Med 78:632-644, 2017. © 2016 International Society for Magnetic Resonance in Medicine. © 2016 International Society for Magnetic Resonance in Medicine.
A Bidirectional Generalized Synchronization Theorem-Based Chaotic Pseudo-random Number Generator
Directory of Open Access Journals (Sweden)
Han Shuangshuang
2013-07-01
Full Text Available Based on a bidirectional generalized synchronization theorem for discrete chaos system, this paper introduces a new 5-dimensional bidirectional generalized chaos synchronization system (BGCSDS, whose prototype is a novel chaotic system introduced in [12]. Numerical simulation showed that two pair variables of the BGCSDS achieve generalized chaos synchronization via a transform H.A chaos-based pseudo-random number generator (CPNG was designed by the new BGCSDS. Using the FIPS-140-2 tests issued by the National Institute of Standard and Technology (NIST verified the randomness of the 1000 binary number sequences generated via the CPNG and the RC4 algorithm respectively. The results showed that all the tested sequences passed the FIPS-140-2 tests. The confidence interval analysis showed the statistical properties of the randomness of the sequences generated via the CPNG and the RC4 algorithm do not have significant differences.
The randomly renewed general item and the randomly inspected item with exponential life distribution
International Nuclear Information System (INIS)
Schneeweiss, W.G.
1979-01-01
For a randomly renewed item the probability distributions of the time to failure and of the duration of down time and the expectations of these random variables are determined. Moreover, it is shown that the same theory applies to randomly checked items with exponential probability distribution of life such as electronic items. The case of periodic renewals is treated as an example. (orig.) [de
Daily birth numbers in Passo Fundo, South Brazil, 1997-1999: trends and periodicities
Directory of Open Access Journals (Sweden)
M. Mikulecky
2002-08-01
Full Text Available Between October 6, 1997 and April 30, 1999, 5011 births (mean: 8.76 per day were registered in the city of Passo Fundo, South Brazil. The sequence of 572 daily birth numbers was not random (iteration test. Neyman distribution (m = ¥ showed the best fit. Clusters of days with higher birth numbers alternated with days with low numbers of births. Periodogram analysis revealed a significant periodicity of 6.98 days. The cosinor regression, testing 10 a priori supposed period lengths, found significant seasonality peaking in August-September and significantly highest birth numbers on Thursdays. Among the lunar and solar rotation cycles, the tropic lunar cycle and its 4th harmonic were most pronounced, in agreement with results concerning natality in Germany obtained by Svante Arrhenius in the 19th century. These findings confirm Derer-Halberg's concept of multiseptans. In addition to cycling, a significantly increasing linear trend with a daily increase of 0.0045 births was encountered. This documents a growth of the population in agreement with national statistical data.
Tvete, Ingunn F; Olsen, Inge C; Fagerland, Morten W; Meland, Nils; Aldrin, Magne; Smerud, Knut T; Holden, Lars
2012-04-01
In active run-in trials, where patients may be excluded after a run-in period based on their response to the treatment, it is implicitly assumed that patients have individual treatment effects. If individual patient data are available, active run-in trials can be modelled using patient-specific random effects. With more than one trial on the same medication available, one can obtain a more precise overall treatment effect estimate. We present a model for joint analysis of a two-sequence, four-period cross-over trial (AABB/BBAA) and a three-sequence, two-period active run-in trial (AB/AA/A), where the aim is to investigate the effect of a new treatment for patients with pain due to osteoarthritis. Our approach enables us to separately estimate the direct treatment effect for all patients, for the patients excluded after the active run-in trial prior to randomisation, and for the patients who completed the active run-in trial. A similar model approach can be used to analyse other types of run-in trials, but this depends on the data and type of other trials available. We assume equality of the various carry-over effects over time. The proposed approach is flexible and can be modified to handle other designs. Our results should be encouraging for those responsible for planning cost-efficient clinical development programmes.
Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence
Directory of Open Access Journals (Sweden)
Valeri Stefanov
2007-01-01
Full Text Available A binary sequence of zeros and ones is called a (d,k-sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, but fixed, non-negative integers and d < k. Such sequences find an abundance of applications in communications, in particular for magnetic and optical recording. Occasionally, one requires that (d,k-sequences do not contain a specific pattern w. Therefore, distribution results concerning pattern occurrence in (d,k-sequences are of interest. In this paper we study the distribution of the waiting time until the r th occurrence of a pattern w in a random (d,k-sequence generated by a Markov source. Numerical examples are also provided.
International Nuclear Information System (INIS)
Trastoy, J; Rouco, V; Bernard, R; Briatico, J; Villegas, J E; Ulysse, C; Faini, G; Palau, A; Puig, T; Lesueur, J
2013-01-01
We study the general problem of a manifold of interacting elastic lines whose spatial correlations are strongly affected by the competition between random and ordered pinning. This is done through magneto-transport experiments with YBa 2 Cu 3 O 7−δ thin films that contain a periodic vortex pinning array created via masked ion irradiation, in addition to the native random pinning. The strong field-matching effects we observe suggest the prevalence of periodic pinning, and indicate that at the matching field each vortex line is bound to an artificial pinning site. However, the vortex-glass transition dimensionality—quasi-two dimensional instead of the usual three dimensional—evidences reduced vortex-glass correlations along the vortex line. This is also supported by an unusual angular dependence of the magneto-resistance, which greatly differs from that of Bose-glass systems. A quantitative analysis of the angular magneto-resistance allows us to link this behaviour to the enhancement of the system anisotropy, a collateral effect of the ion irradiation. (paper)
Metaheuristic approaches to order sequencing on a unidirectional picking line
Directory of Open Access Journals (Sweden)
AP de Villiers
2013-06-01
Full Text Available In this paper the sequencing of orders on a unidirectional picking line is considered. The aim of the order sequencing is to minimise the number of cycles travelled by a picker within the picking line to complete all orders. A tabu search, simulated annealing, genetic algorithm, generalised extremal optimisation and a random local search are presented as possible solution approaches. Computational results based on real life data instances are presented for these metaheuristics and compared to the performance of a lower bound and the solutions used in practise. The random local search exhibits the best overall solution quality, however, the generalised extremal optimisation approach delivers comparable results in considerably shorter computational times.
PILOT DECONTAMINATION THROUGH PILOT SEQUENCE HOPPING IN MASSIVE MIMO SYSTEMS
DEFF Research Database (Denmark)
2015-01-01
path between one of the users and one of the base stations define one of the channels. The system comprises a pilot generation unit configured to assign pilot sequences randomly among the users and a pilot processing unit configured to filter the pilot sequences received from a user of interest so...... that the channel coefficient of the channel of the user of interest is determined. The pilot sequences received from the user of interest are contaminated by other non-orthogonal or identical pilot sequences from other users of the cell of interest or other cells. The filter is configured so that the contamination...... caused by the other non-orthogonal or identical pilot sequences from the other users is reduced....
Calibration of Correlation Radiometers Using Pseudo-Random Noise Signals
Directory of Open Access Journals (Sweden)
Sebastián Pantoja
2009-08-01
Full Text Available The calibration of correlation radiometers, and particularly aperture synthesis interferometric radiometers, is a critical issue to ensure their performance. Current calibration techniques are based on the measurement of the cross-correlation of receivers’ outputs when injecting noise from a common noise source requiring a very stable distribution network. For large interferometric radiometers this centralized noise injection approach is very complex from the point of view of mass, volume and phase/amplitude equalization. Distributed noise injection techniques have been proposed as a feasible alternative, but are unable to correct for the so-called “baseline errors” associated with the particular pair of receivers forming the baseline. In this work it is proposed the use of centralized Pseudo-Random Noise (PRN signals to calibrate correlation radiometers. PRNs are sequences of symbols with a long repetition period that have a flat spectrum over a bandwidth which is determined by the symbol rate. Since their spectrum resembles that of thermal noise, they can be used to calibrate correlation radiometers. At the same time, since these sequences are deterministic, new calibration schemes can be envisaged, such as the correlation of each receiver’s output with a baseband local replica of the PRN sequence, as well as new distribution schemes of calibration signals. This work analyzes the general requirements and performance of using PRN sequences for the calibration of microwave correlation radiometers, and particularizes the study to a potential implementation in a large aperture synthesis radiometer using an optical distribution network.
A Streaming Distance Transform Algorithm for Neighborhood-Sequence Distances
Directory of Open Access Journals (Sweden)
Nicolas Normand
2014-09-01
Full Text Available We describe an algorithm that computes a “translated” 2D Neighborhood-Sequence Distance Transform (DT using a look up table approach. It requires a single raster scan of the input image and produces one line of output for every line of input. The neighborhood sequence is specified either by providing one period of some integer periodic sequence or by providing the rate of appearance of neighborhoods. The full algorithm optionally derives the regular (centered DT from the “translated” DT, providing the result image on-the-ﬂy, with a minimal delay, before the input image is fully processed. Its efficiency can benefit all applications that use neighborhood- sequence distances, particularly when pipelined processing architectures are involved, or when the size of objects in the source image is limited.
An efficient binomial model-based measure for sequence comparison and its application.
Liu, Xiaoqing; Dai, Qi; Li, Lihua; He, Zerong
2011-04-01
Sequence comparison is one of the major tasks in bioinformatics, which could serve as evidence of structural and functional conservation, as well as of evolutionary relations. There are several similarity/dissimilarity measures for sequence comparison, but challenges remains. This paper presented a binomial model-based measure to analyze biological sequences. With help of a random indicator, the occurrence of a word at any position of sequence can be regarded as a random Bernoulli variable, and the distribution of a sum of the word occurrence is well known to be a binomial one. By using a recursive formula, we computed the binomial probability of the word count and proposed a binomial model-based measure based on the relative entropy. The proposed measure was tested by extensive experiments including classification of HEV genotypes and phylogenetic analysis, and further compared with alignment-based and alignment-free measures. The results demonstrate that the proposed measure based on binomial model is more efficient.
Extending generalized Fibonacci sequences and their binet-type formula
Directory of Open Access Journals (Sweden)
Saeki Osamu
2006-01-01
Full Text Available We study the extension problem of a given sequence defined by a finite order recurrence to a sequence defined by an infinite order recurrence with periodic coefficient sequence. We also study infinite order recurrence relations in a strong sense and give a complete answer to the extension problem. We also obtain a Binet-type formula, answering several open questions about these sequences and their characteristic power series.
Paritakul, Panwara; Ruangrongmorakot, Kasem; Laosooksathit, Wipada; Suksamarnwong, Maysita; Puapornpong, Pawin
2016-09-01
In Thailand, ginger is a popular natural galactagogue among breastfeeding women. However, there has never been evidence to support the effectiveness of ginger in increasing the breast milk volume. To compare breast milk volume on the third and seventh day postpartum between lactating mothers who receive 500 mg dried ginger capsules twice daily with those receiving placebo. A randomized, double-blind controlled trial was conducted. Women who deliver a term baby were randomly assigned to receive dried ginger or placebo for 7 days postpartum. Breast milk volume was measured on third day postpartum using test weight method for a period of 24 hours and on seventh day postpartum using 1 hour milk production. We also compared the third day serum prolactin level between the two groups. Data from 63 women were available for analysis, 30 from the ginger group and 33 from the placebo group. The two groups were similar regarding baseline characteristics. Women in the ginger group have higher milk volume than the placebo group (191.0 ± 71.2 mL/day versus 135.0 ± 61.5 mL/day, p ginger group does not differ from the placebo group (80.0 ± 58.5 mL versus 112.1 ± 91.6 mL, p = 0.24). The mean serum prolactin levels were similar in both groups (321.5 ± 131.8 ng/L in the ginger group, and 331.4 ± 100.7 ng/L in the placebo group, p = 0.74). No side effect was reported in this study. Ginger is a promising natural galactagogue to improve breast milk volume in the immediate postpartum period without any notable side effect.
Implicit sequence learning in deaf children with cochlear implants.
Conway, Christopher M; Pisoni, David B; Anaya, Esperanza M; Karpicke, Jennifer; Henning, Shirley C
2011-01-01
Deaf children with cochlear implants (CIs) represent an intriguing opportunity to study neurocognitive plasticity and reorganization when sound is introduced following a period of auditory deprivation early in development. Although it is common to consider deafness as affecting hearing alone, it may be the case that auditory deprivation leads to more global changes in neurocognitive function. In this paper, we investigate implicit sequence learning abilities in deaf children with CIs using a novel task that measured learning through improvement to immediate serial recall for statistically consistent visual sequences. The results demonstrated two key findings. First, the deaf children with CIs showed disturbances in their visual sequence learning abilities relative to the typically developing normal-hearing children. Second, sequence learning was significantly correlated with a standardized measure of language outcome in the CI children. These findings suggest that a period of auditory deprivation has secondary effects related to general sequencing deficits, and that disturbances in sequence learning may at least partially explain why some deaf children still struggle with language following cochlear implantation. © 2010 Blackwell Publishing Ltd.
Tan, Shurun
The objective of my research is two-fold: to study wave scattering phenomena in dense volumetric random media and in periodic wave functional materials. For the first part, the goal is to use the microwave remote sensing technique to monitor water resources and global climate change. Towards this goal, I study the microwave scattering behavior of snow and ice sheet. For snowpack scattering, I have extended the traditional dense media radiative transfer (DMRT) approach to include cyclical corrections that give rise to backscattering enhancements, enabling the theory to model combined active and passive observations of snowpack using the same set of physical parameters. Besides DMRT, a fully coherent approach is also developed by solving Maxwell's equations directly over the entire snowpack including a bottom half space. This revolutionary new approach produces consistent scattering and emission results, and demonstrates backscattering enhancements and coherent layer effects. The birefringence in anisotropic snow layers is also analyzed by numerically solving Maxwell's equation directly. The effects of rapid density fluctuations in polar ice sheet emission in the 0.5˜2.0 GHz spectrum are examined using both fully coherent and partially coherent layered media emission theories that agree with each other and distinct from incoherent approaches. For the second part, the goal is to develop integral equation based methods to solve wave scattering in periodic structures such as photonic crystals and metamaterials that can be used for broadband simulations. Set upon the concept of modal expansion of the periodic Green's function, we have developed the method of broadband Green's function with low wavenumber extraction (BBGFL), where a low wavenumber component is extracted and results a non-singular and fast-converging remaining part with simple wavenumber dependence. We've applied the technique to simulate band diagrams and modal solutions of periodic structures, and to
A Note on Sequence Prediction over Large Alphabets
Directory of Open Access Journals (Sweden)
Travis Gagie
2012-02-01
Full Text Available Building on results from data compression, we prove nearly tight bounds on how well sequences of length n can be predicted in terms of the size σ of the alphabet and the length k of the context considered when making predictions. We compare the performance achievable by an adaptive predictor with no advance knowledge of the sequence, to the performance achievable by the optimal static predictor using a table listing the frequency of each (k + 1-tuple in the sequence. We show that, if the elements of the sequence are chosen uniformly at random, then an adaptive predictor can compete in the expected case if k ≤ logσ n – 3 – ε, for a constant ε > 0, but not if k ≥ logσ n.
Energy Technology Data Exchange (ETDEWEB)
Revel, Marie Pierre [Hopital Europeen Georges Pompidou, APHP, Departments of Radiology, Paris (France); Universite Paris Descartes Sorbonne Paris Cite, Paris (France); Hotel-Dieu, Service de Radiologie, Paris (France); Sanchez, Olivier; Meyer, Guy [Hopital Europeen Georges Pompidou, APHP, Respiratory and intensive care and, Paris (France); Universite Paris Descartes Sorbonne Paris Cite, Paris (France); INSERM Unite 765, Paris (France); Lefort, Catherine; Couchon, Sophie; Hernigou, Anne; Frija, Guy [Hopital Europeen Georges Pompidou, APHP, Departments of Radiology, Paris (France); Niarra, Ralph [Hopital Europeen Georges Pompidou, APHP, Clinical Epidemiology, Paris (France); Universite Paris Descartes Sorbonne Paris Cite, Paris (France); Chatellier, Gilles [Hopital Europeen Georges Pompidou, APHP, Clinical Epidemiology, Paris (France); Universite Paris Descartes Sorbonne Paris Cite, Paris (France); INSERM CIC-EC E4, Paris (France)
2013-09-15
To independently evaluate unenhanced, contrast-enhanced perfusion and angiographic MR sequences for pulmonary embolism (PE) diagnosis. Prospective investigation, including 274 patients who underwent perfusion, unenhanced 2D steady-state-free-precession (SSFP) and contrast-enhanced 3D angiographic MR sequences on a 1.5-T unit, in addition to CTA (CT angiography). Two independent readers evaluated each sequence independently in random order. Sensitivity, specificity, predictive values and inter-reader agreement were calculated for each sequence, excluding sequences judged inconclusive. Sensitivity was also calculated according to PE location. Contrast-enhanced angiographic sequences showed the highest sensitivity (82.9 and 89.7 %, reader 1 and reader 2, respectively), specificity (98.5 and 100 %) and agreement (kappa value 0.77). Unenhanced angiographic sequences, although less sensitive overall (68.7 and 76.4 %), were sensitive for the detection of proximal PE (92.7 and 100 %) and showed high specificity (96.1 and 99.1 %) and good agreement (kappa value 0.62). Perfusion sequences showed lower sensitivity (75.0 and 79.3 %), specificity (84.8 and 89.7 %) and agreement (kappa value 0.51), and a negative predictive value of 84.8 % at best. Compared with contrast-enhanced angiographic sequences, unenhanced sequences demonstrate lower sensitivity, except for proximal PE, but high specificity and agreement. The negative predictive value of perfusion sequences was insufficient to safely rule out PE. (orig.)
On the remarkable spectrum of a non-Hermitian random matrix model
International Nuclear Information System (INIS)
Holz, D E; Orland, H; Zee, A
2003-01-01
A non-Hermitian random matrix model proposed a few years ago has a remarkably intricate spectrum. Various attempts have been made to understand the spectrum, but even its dimension is not known. Using the Dyson-Schmidt equation, we show that the spectrum consists of a non-denumerable set of lines in the complex plane. Each line is the support of the spectrum of a periodic Hamiltonian, obtained by the infinite repetition of any finite sequence of the disorder variables. Our approach is based on the 'theory of words'. We make a complete study of all four-letter words. The spectrum is complicated because our matrix contains everything that will ever be written in the history of the universe, including this particular paper
An investigation of Hebbian phase sequences as assembly graphs
Directory of Open Access Journals (Sweden)
Daniel Gomes Almeida Filho
2014-04-01
Full Text Available Hebb proposed that synapses between neurons that fire synchronously are strengthened, forming cell assemblies and phase sequences. The former, on a shorter scale, are ensembles of synchronized cells that function transiently as a closed processing system; the latter, on a larger scale, correspond to the sequential activation of cell assemblies able to represent percepts and behaviors. Nowadays, the recording of large neuronal populations allows for the detection of multiple cell assemblies. Within Hebb’s theory, the next logical step is the analysis of phase sequences. Here we detected phase sequences as consecutive assembly activation patterns, and then analyzed their graph attributes in relation to behavior. We investigated action potentials recorded from the adult rat hippocampus and neocortex before, during and after novel object exploration (experimental periods. Within assembly graphs, each assembly corresponded to a node, and each edge corresponded to the temporal sequence of consecutive node activations. The sum of all assembly activations was proportional to firing rates, but the activity of individual assemblies was not. Assembly repertoire was stable across experimental periods, suggesting that novel experience does not create new assemblies in the adult rat. Assembly graph attributes, on the other hand, varied significantly across behavioral states and experimental periods, and were separable enough to correctly classify experimental periods (Naïve Bayes classifier; maximum AUROCs ranging from 0.55 to 0.99 and behavioral states (waking, slow wave sleep, and rapid eye movement sleep; maximum AUROCs s ranging from 0.64 to 0.98. Our findings agree with Hebb’s view that assemblies correspond to primitive building blocks of representation, nearly unchanged in the adult, while phase sequences are labile across behavioral states and change after novel experience. The results are compatible with a role for phase sequences in behavior
Distribution and sequence homogeneity of an abundant satellite DNA in the beetle, Tenebrio molitor.
Davis, C A; Wyatt, G R
1989-01-01
The mealworm beetle, Tenebrio molitor, contains an unusually abundant and homogeneous satellite DNA which constitutes up to 60% of its genome. The satellite DNA is shown to be present in all of the chromosomes by in situ hybridization. 18 dimers of the repeat unit were cloned and sequenced. The consensus sequence is 142 nt long and lacks any internal repeat structure. Monomers of the sequence are very similar, showing on average a 2% divergence from the calculated consensus. Variant nucleotides are scattered randomly throughout the sequence although some variants are more common than others. Neighboring repeat units are no more alike than randomly chosen ones. The results suggest that some mechanism, perhaps gene conversion, is acting to maintain the homogeneity of the satellite DNA despite its abundance and distribution on all of the chromosomes. Images PMID:2762148
Michas, Georgios; Vallianatos, Filippos; Karakostas, Vassilios; Papadimitriou, Eleftheria; Sammonds, Peter
2014-05-01
Efpalion aftershock sequence occurred in January 2010, when an M=5.5 earthquake was followed four days later by another strong event (M=5.4) and numerous aftershocks (Karakostas et al., 2012). This activity interrupted a 15 years period of low to moderate earthquake occurrence in Corinth rift, where the last major event was the 1995 Aigion earthquake (M=6.2). Coulomb stress analysis performed in previous studies (Karakostas et al., 2012; Sokos et al., 2012; Ganas et al., 2013) indicated that the second major event and most of the aftershocks were triggered due to stress transfer. The aftershocks production rate decays as a power-law with time according to the modified Omori law (Utsu et al., 1995) with an exponent larger than one for the first four days, while after the occurrence of the second strong event the exponent turns to unity. We consider the earthquake sequence as a point process in time and space and study its spatiotemporal evolution considering a Continuous Time Random Walk (CTRW) model with a joint probability density function of inter-event times and jumps between the successive earthquakes (Metzler and Klafter, 2000). Jump length distribution exhibits finite variance, whereas inter-event times scale as a q-generalized gamma distribution (Michas et al., 2013) with a long power-law tail. These properties are indicative of a subdiffusive process in terms of CTRW. Additionally, the mean square displacement of aftershocks is constant with time after the occurrence of the first event, while it changes to a power-law with exponent close to 0.15 after the second major event, illustrating a slow diffusive process. During the first four days aftershocks cluster around the epicentral area of the second major event, while after that and taking as a reference the second event, the aftershock zone is migrating slowly with time to the west near the epicentral area of the first event. This process is much slower from what would be expected from normal diffusion, a
Entropy and long-range memory in random symbolic additive Markov chains.
Melnik, S S; Usatenko, O V
2016-06-01
The goal of this paper is to develop an estimate for the entropy of random symbolic sequences with elements belonging to a finite alphabet. As a plausible model, we use the high-order additive stationary ergodic Markov chain with long-range memory. Supposing that the correlations between random elements of the chain are weak, we express the conditional entropy of the sequence by means of the symbolic pair correlation function. We also examine an algorithm for estimating the conditional entropy of finite symbolic sequences. We show that the entropy contains two contributions, i.e., the correlation and the fluctuation. The obtained analytical results are used for numerical evaluation of the entropy of written English texts and DNA nucleotide sequences. The developed theory opens the way for constructing a more consistent and sophisticated approach to describe the systems with strong short-range and weak long-range memory.
Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs
van der Hofstad, Remco; Kliem, Sandra; van Leeuwaarden, Johan S. H.
2018-04-01
Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-1 type having finite variance but infinite third moment degrees was obtained in Bhamidi et al. (Ann Probab 40:2299-2361, 2012). It was proved that when the degrees obey a power law with exponent τ \\in (3,4), the sequence of clusters ordered in decreasing size and multiplied through by n^{-(τ -2)/(τ -1)} converges as n→ ∞ to a sequence of decreasing non-degenerate random variables. Here, we study the tails of the limit of the rescaled largest cluster, i.e., the probability that the scaling limit of the largest cluster takes a large value u, as a function of u. This extends a related result of Pittel (J Combin Theory Ser B 82(2):237-269, 2001) for the Erdős-Rényi random graph to the setting of rank-1 inhomogeneous random graphs with infinite third moment degrees. We make use of delicate large deviations and weak convergence arguments.
Leblanc, Judith; Rousseau, Alexandra; Hejblum, Gilles; Durand-Zaleski, Isabelle; de Truchis, Pierre; Lert, France; Costagliola, Dominique; Simon, Tabassome; Crémieux, Anne-Claude
2016-02-01
In 2010, to reduce late HIV diagnosis, the French national health agency endorsed non-targeted HIV screening in health care settings. Despite these recommendations, non-targeted screening has not been implemented and only physician-directed diagnostic testing is currently performed. A survey conducted in 2010 in 29 French Emergency Departments (EDs) showed that non-targeted nurse-driven screening was feasible though only a few new HIV diagnoses were identified, predominantly among high-risk groups. A strategy targeting high-risk groups combined with current practice could be shown to be feasible, more efficient and cost-effective than current practice alone. DICI-VIH (acronym for nurse-driven targeted HIV screening) is a multicentre, cluster-randomized, two-period crossover trial. The primary objective is to compare the effectiveness of 2 strategies for diagnosing HIV among adult patients visiting EDs: nurse-driven targeted HIV screening combined with current practice (physician-directed diagnostic testing) versus current practice alone. Main secondary objectives are to compare access to specialist consultation and how early HIV diagnosis occurs in the course of the disease between the 2 groups, and to evaluate the implementation, acceptability and cost-effectiveness of nurse-driven targeted screening. The 2 strategies take place during 2 randomly assigned periods in 8 EDs of metropolitan Paris, where 42 % of France's new HIV patients are diagnosed every year. All patients aged 18 to 64, not presenting secondary to HIV exposure are included. During the intervention period, patients are invited to fill a 7-item questionnaire (country of birth, sexual partners and injection drug use) in order to select individuals who are offered a rapid test. If the rapid test is reactive, a follow-up visit with an infectious disease specialist is scheduled within 72 h. Assuming an 80 % statistical power and a 5 % type 1 error, with 1.04 and 3.38 new diagnoses per 10,000 patients in
Simulating efficiently the evolution of DNA sequences.
Schöniger, M; von Haeseler, A
1995-02-01
Two menu-driven FORTRAN programs are described that simulate the evolution of DNA sequences in accordance with a user-specified model. This general stochastic model allows for an arbitrary stationary nucleotide composition and any transition-transversion bias during the process of base substitution. In addition, the user may define any hypothetical model tree according to which a family of sequences evolves. The programs suggest the computationally most inexpensive approach to generate nucleotide substitutions. Either reproducible or non-repeatable simulations, depending on the method of initializing the pseudo-random number generator, can be performed. The corresponding options are offered by the interface menu.
In silico evidence for sequence-dependent nucleosome sliding
Energy Technology Data Exchange (ETDEWEB)
Lequieu, Joshua; Schwartz, David C.; de Pablo, Juan J.
2017-10-18
Nucleosomes represent the basic building block of chromatin and provide an important mechanism by which cellular processes are controlled. The locations of nucleosomes across the genome are not random but instead depend on both the underlying DNA sequence and the dynamic action of other proteins within the nucleus. These processes are central to cellular function, and the molecular details of the interplay between DNA sequence and nudeosome dynamics remain poorly understood. In this work, we investigate this interplay in detail by relying on a molecular model, which permits development of a comprehensive picture of the underlying free energy surfaces and the corresponding dynamics of nudeosome repositioning. The mechanism of nudeosome repositioning is shown to be strongly linked to DNA sequence and directly related to the binding energy of a given DNA sequence to the histone core. It is also demonstrated that chromatin remodelers can override DNA-sequence preferences by exerting torque, and the histone H4 tail is then identified as a key component by which DNA-sequence, histone modifications, and chromatin remodelers could in fact be coupled.
Multineuronal Spike Sequences Repeat with Millisecond Precision
Directory of Open Access Journals (Sweden)
Koki eMatsumoto
2013-06-01
Full Text Available Cortical microcircuits are nonrandomly wired by neurons. As a natural consequence, spikes emitted by microcircuits are also nonrandomly patterned in time and space. One of the prominent spike organizations is a repetition of fixed patterns of spike series across multiple neurons. However, several questions remain unsolved, including how precisely spike sequences repeat, how the sequences are spatially organized, how many neurons participate in sequences, and how different sequences are functionally linked. To address these questions, we monitored spontaneous spikes of hippocampal CA3 neurons ex vivo using a high-speed functional multineuron calcium imaging technique that allowed us to monitor spikes with millisecond resolution and to record the location of spiking and nonspiking neurons. Multineuronal spike sequences were overrepresented in spontaneous activity compared to the statistical chance level. Approximately 75% of neurons participated in at least one sequence during our observation period. The participants were sparsely dispersed and did not show specific spatial organization. The number of sequences relative to the chance level decreased when larger time frames were used to detect sequences. Thus, sequences were precise at the millisecond level. Sequences often shared common spikes with other sequences; parts of sequences were subsequently relayed by following sequences, generating complex chains of multiple sequences.
Rapid-Sequence Serial Sexual Homicides.
Schlesinger, Louis B; Ramirez, Stephanie; Tusa, Brittany; Jarvis, John P; Erdberg, Philip
2017-03-01
Serial sexual murderers have been described as committing homicides in a methodical manner, taking substantial time between offenses to elude the authorities. The results of our study of the temporal patterns (i.e., the length of time between homicides) of a nonrandom national sample of 44 serial sexual murderers and their 201 victims indicate that this representation may not always be accurate. Although 25 offenders (56.8%) killed with longer than a 14-day period between homicides, a sizeable subgroup was identified: 19 offenders (43.2%) who committed homicides in rapid-sequence fashion, with fewer than 14 days between all or some of the murders. Six offenders (13.6%) killed all their victims in one rapid-sequence, spree-like episode, with homicides just days apart or sometimes two murders in the same day. Thirteen offenders (29.5%) killed in one or two rapid-sequence clusters (i.e., more than one murder within a 14-day period, as well as additional homicides with greater than 14 days between each). The purpose of our study was to describe this subgroup of rapid-sequence offenders who have not been identified until now. These findings argue for accelerated forensic assessments of dangerousness and public safety when a sexual murder is detected. Psychiatric disorders with rapidly occurring symptom patterns, or even atypical mania or mood dysregulation, may serve as exemplars for understanding this extraordinary group of offenders. © 2017 American Academy of Psychiatry and the Law.
Free Energy Self-Averaging in Protein-Sized Random Heteropolymers
International Nuclear Information System (INIS)
Chuang, Jeffrey; Grosberg, Alexander Yu.; Kardar, Mehran
2001-01-01
Current theories of heteropolymers are inherently macroscopic, but are applied to mesoscopic proteins. To compute the free energy over sequences, one assumes self-averaging -- a property established only in the macroscopic limit. By enumerating the states and energies of compact 18, 27, and 36mers on a lattice with an ensemble of random sequences, we test the self-averaging approximation. We find that fluctuations in the free energy between sequences are weak, and that self-averaging is valid at the scale of real proteins. The results validate sequence design methods which exponentially speed up computational design and simplify experimental realizations
Consistent errors in first strand cDNA due to random hexamer mispriming.
Directory of Open Access Journals (Sweden)
Thomas P van Gurp
Full Text Available Priming of random hexamers in cDNA synthesis is known to show sequence bias, but in addition it has been suggested recently that mismatches in random hexamer priming could be a cause of mismatches between the original RNA fragment and observed sequence reads. To explore random hexamer mispriming as a potential source of these errors, we analyzed two independently generated RNA-seq datasets of synthetic ERCC spikes for which the reference is known. First strand cDNA synthesized by random hexamer priming on RNA showed consistent position and nucleotide-specific mismatch errors in the first seven nucleotides. The mismatch errors found in both datasets are consistent in distribution and thermodynamically stable mismatches are more common. This strongly indicates that RNA-DNA mispriming of specific random hexamers causes these errors. Due to their consistency and specificity, mispriming errors can have profound implications for downstream applications if not dealt with properly.
Algebraic polynomials with random coefficients
Directory of Open Access Journals (Sweden)
K. Farahmand
2002-01-01
Full Text Available This paper provides an asymptotic value for the mathematical expected number of points of inflections of a random polynomial of the form a0(ω+a1(ω(n11/2x+a2(ω(n21/2x2+…an(ω(nn1/2xn when n is large. The coefficients {aj(w}j=0n, w∈Ω are assumed to be a sequence of independent normally distributed random variables with means zero and variance one, each defined on a fixed probability space (A,Ω,Pr. A special case of dependent coefficients is also studied.
Bayesian Age-Period-Cohort Modeling and Prediction - BAMP
Directory of Open Access Journals (Sweden)
Volker J. Schmid
2007-10-01
Full Text Available The software package BAMP provides a method of analyzing incidence or mortality data on the Lexis diagram, using a Bayesian version of an age-period-cohort model. A hierarchical model is assumed with a binomial model in the first-stage. As smoothing priors for the age, period and cohort parameters random walks of first and second order, with and without an additional unstructured component are available. Unstructured heterogeneity can also be included in the model. In order to evaluate the model fit, posterior deviance, DIC and predictive deviances are computed. By projecting the random walk prior into the future, future death rates can be predicted.
Communication with spatial periodic chaos synchronization
International Nuclear Information System (INIS)
Zhou, J.; Huang, H.B.; Qi, G.X.; Yang, P.; Xie, X.
2005-01-01
Based on the spatial periodic chaos synchronization in coupled ring and linear arrays, we proposed a random high-dimensional chaotic encryption scheme. The transmitter can choose hyperchaotic signals randomly from the ring at any different time and simultaneously transmit the information of chaotic oscillators in the ring to receiver through public channel, so that the message can be masked by different hyperchaotic signals in different time intervals during communication, and the receiver can decode the message based on chaos synchronization but the attacker does not know the random hyperchaotic dynamics and cannot decode the message. Furthermore, the high sensitivity to the symmetry of the coupling structure makes the attacker very difficult to obtain any useful message from the channel
Random digital encryption secure communication system
Doland, G. D. (Inventor)
1982-01-01
The design of a secure communication system is described. A product code, formed from two pseudorandom sequences of digital bits, is used to encipher or scramble data prior to transmission. The two pseudorandom sequences are periodically changed at intervals before they have had time to repeat. One of the two sequences is transmitted continuously with the scrambled data for synchronization. In the receiver portion of the system, the incoming signal is compared with one of two locally generated pseudorandom sequences until correspondence between the sequences is obtained. At this time, the two locally generated sequences are formed into a product code which deciphers the data from the incoming signal. Provision is made to ensure synchronization of the transmitting and receiving portions of the system.
Boundary conditions in random sequential adsorption
Cieśla, Michał; Ziff, Robert M.
2018-04-01
The influence of different boundary conditions on the density of random packings of disks is studied. Packings are generated using the random sequential adsorption algorithm with three different types of boundary conditions: periodic, open, and wall. It is found that the finite size effects are smallest for periodic boundary conditions, as expected. On the other hand, in the case of open and wall boundaries it is possible to introduce an effective packing size and a constant correction term to significantly improve the packing densities.
Doi, I.; Kawakata, H.
2012-12-01
Laboratory experiments [e.g. Scholz, 1968; Lockner et al., 1992] and field observations [e.g. Dodge et al., 1996; Helmstetter and Sornette, 2003; Bouchon et al., 2011] have elucidated part of foreshock behavior and mechanism, but we cannot identify foreshocks while they are occurring. Recently, in Japan, a dense seismic network, Hi-net (High Sensitivity Seismograph Network), provides continuous waveform records for regional seismic events. The data from this network enable us to analyze small foreshocks which occur on long period time scales prior to a major event. We have an opportunity to grasp the more detailed pattern of foreshock generation. Using continuous waveforms recorded at a seismic station located in close proximity to the epicenter of the 2008 Iwate-Miyagi inland earthquake, we conducted a detailed investigation of its foreshocks. In addition to the two officially recognized foreshocks, calculation of cross-correlation coefficients between the continuous waveform record and one of the previously recognized foreshocks revealed that 20 micro foreshocks occurred within the same general area. Our analysis also shows that all of these foreshocks occurred within the same general area relative to the main event. Over the two week period leading up to the Iwate-Miyagi earthquake, such foreshocks only occurred during the last 45 minutes, specifically over a 35 minute period followed by a 10 minute period of quiescence just before the mainshock. We found no evidence of acceleration of this foreshock sequence. Rock fracturing experiments using a constant loading rate or creep tests have consistently shown that the occurrence rate of small fracturing events (acoustic emissions; AEs) increases before the main rupture [Scholz, 1968]. This accelerative pattern of preceding events was recognized in case of the 1999 Izmit earthquake [Bouchon et al., 2011]. Large earthquakes however need not be accompanied by acceleration of foreshocks if a given fault's host rock
Some limit theorems for negatively associated random variables
Indian Academy of Sciences (India)
random sampling without replacement, and (i) joint distribution of ranks. ... wide applications in multivariate statistical analysis and system reliability, the ... strong law of large numbers for negatively associated sequences under the case where.
Maximal Increments of Local Time of a Random Walk
Jain, Naresh C.; Pruitt, William E.
1987-01-01
Let $(S_j)$ be a lattice random walk, i.e., $S_j = X_1 + \\cdots + X_j$, where $X_1, X_2,\\ldots$ are independent random variables with values in $\\mathbb{Z}$ and common nondegenerate distribution $F$. Let $\\{t_n\\}$ be a nondecreasing sequence of positive integers, $t_n \\leq n$, and $L^\\ast_n = \\max_{0\\leq j\\leq n-t_n}(L_{j+t_n} - L_j)$, where $L_n = \\sum^n_{j=1}1_{\\{0\\}}(S_j)$, the number of times zero is visited by the random walk by time $n$. Assuming that the random walk is recurrent and sa...
On Sequence Lengths of Some Special External Exclusive OR Type LFSR Structures – Study and Analysis
Directory of Open Access Journals (Sweden)
A Ahmad
2014-12-01
Full Text Available The study of the length of pseudo-random binary sequences generated by Linear- Feedback Shift Registers (LFSRs plays an important role in the design approaches of built-in selftest, cryptosystems, and other applications. However, certain LFSR structures might not be appropriate in some situations. Given that determining the length of generated pseudo-random binary sequence is a complex task, therefore, before using an LFSR structure, it is essential to investigate the length and the properties of the sequence. This paper investigates some conditions and LFSR’s structures, which restrict the pseudo-random binary sequences’ generation to a certain fixed length. The outcomes of this paper are presented in the form of theorems, simulations, and analyses. We believe that these outcomes are of great importance to the designers of built-in self-test equipment, cryptosystems, and other applications such as radar, CDMA, error correction, and Monte Carlo simulation.
The Matrix Method of Representation, Analysis and Classification of Long Genetic Sequences
Directory of Open Access Journals (Sweden)
Ivan V. Stepanyan
2017-01-01
Full Text Available The article is devoted to a matrix method of comparative analysis of long nucleotide sequences by means of presenting each sequence in the form of three digital binary sequences. This method uses a set of symmetries of biochemical attributes of nucleotides. It also uses the possibility of presentation of every whole set of N-mers as one of the members of a Kronecker family of genetic matrices. With this method, a long nucleotide sequence can be visually represented as an individual fractal-like mosaic or another regular mosaic of binary type. In contrast to natural nucleotide sequences, artificial random sequences give non-regular patterns. Examples of binary mosaics of long nucleotide sequences are shown, including cases of human chromosomes and penicillins. The obtained results are then discussed.
International Nuclear Information System (INIS)
Mason, Jay W; Moon, Thomas E; O’Boyle, Erin; Dietz, Albert
2014-01-01
Regulatory concern about potential QT-interval prolongation by serotonin-receptor antagonist antiemetics prompted product-label changes. The first-generation serotonin-receptor antagonist granisetron is available in oral (PO), intravenous (IV), and transdermal formulations. APF530 is a formulation that provides sustained release of granisetron when administered as a single subcutaneous (SC) injection. The Phase I study reported here evaluated effects of APF530 on electrocardiographic intervals. This single-site, double-blind, placebo-controlled, four-period crossover trial randomized healthy men and women to receive varying sequences of APF530 1 g SC, granisetron 50 μg/kg IV, moxifloxacin 400 mg PO, and placebo. Subjects were assessed for 49 hours after each treatment. The primary objective was to evaluate differences between baseline-adjusted, heart rate-corrected QT-interval change using the Fridericia rate correction (dQTcF) for APF530 1 g SC and placebo. Electrocardiograms were performed at various times throughout the assessment period. Pharmacokinetics and safety were evaluated. The upper one-sided 95% confidence interval (CI) for mean baseline-adjusted dQTcF at each post-dose time point between APF530 and placebo excluded 10 ms, indicating that APF530 1 g SC had no clinically significant effect on QTcF. Maximum observed QTcF change was 4.15 ms (90% CI, 0.94 to 7.36) at Hour 3. No clinically significant changes in other electrocardiogram intervals were observed. APF530 SC pharmacokinetics were as expected, with slow absorption (maximum plasma concentration 35.8 ng/mL, median time to maximum plasma concentration 11.1 hours) and slow elimination (mean half-life 18.6 hours; systemic clearance 20.2 L/hour) of granisetron versus the expected early peak concentration and elimination of granisetron IV. APF530 SC was well tolerated. Adverse events, most commonly constipation and SC injection-site reactions, were generally mild and quickly resolved. APF530 1 g SC did
Explore Stochastic Instabilities of Periodic Points by Transition Path Theory
Cao, Yu; Lin, Ling; Zhou, Xiang
2016-06-01
We consider the noise-induced transitions from a linearly stable periodic orbit consisting of T periodic points in randomly perturbed discrete logistic map. Traditional large deviation theory and asymptotic analysis at small noise limit cannot distinguish the quantitative difference in noise-induced stochastic instabilities among the T periodic points. To attack this problem, we generalize the transition path theory to the discrete-time continuous-space stochastic process. In our first criterion to quantify the relative instability among T periodic points, we use the distribution of the last passage location related to the transitions from the whole periodic orbit to a prescribed disjoint set. This distribution is related to individual contributions to the transition rate from each periodic points. The second criterion is based on the competency of the transition paths associated with each periodic point. Both criteria utilize the reactive probability current in the transition path theory. Our numerical results for the logistic map reveal the transition mechanism of escaping from the stable periodic orbit and identify which periodic point is more prone to lose stability so as to make successful transitions under random perturbations.
Li, Zhongshan; Liu, Zhenwei; Jiang, Yi; Chen, Denghui; Ran, Xia; Sun, Zhong Sheng; Wu, Jinyu
2017-01-01
Exome sequencing has been widely used to identify the genetic variants underlying human genetic disorders for clinical diagnoses, but the identification of pathogenic sequence variants among the huge amounts of benign ones is complicated and challenging. Here, we describe a new Web server named mirVAFC for pathogenic sequence variants prioritizations from clinical exome sequencing (CES) variant data of single individual or family. The mirVAFC is able to comprehensively annotate sequence variants, filter out most irrelevant variants using custom criteria, classify variants into different categories as for estimated pathogenicity, and lastly provide pathogenic variants prioritizations based on classifications and mutation effects. Case studies using different types of datasets for different diseases from publication and our in-house data have revealed that mirVAFC can efficiently identify the right pathogenic candidates as in original work in each case. Overall, the Web server mirVAFC is specifically developed for pathogenic sequence variant identifications from family-based CES variants using classification-based prioritizations. The mirVAFC Web server is freely accessible at https://www.wzgenomics.cn/mirVAFC/. © 2016 WILEY PERIODICALS, INC.
A spatio-temporal synchronization of periodic markets: evidence ...
African Journals Online (AJOL)
This study seeks to identify the 'rings' of periodic market days in Akwa Ibom State, using eighteen periodic markets as case study The entire landmass of the state was covered with a network of grids. These grids were numbered and a table of random numbers was used in selecting a target population of eighteen ...
A hybrid-type quantum random number generator
Hai-Qiang, Ma; Wu, Zhu; Ke-Jin, Wei; Rui-Xue, Li; Hong-Wei, Liu
2016-05-01
This paper proposes a well-performing hybrid-type truly quantum random number generator based on the time interval between two independent single-photon detection signals, which is practical and intuitive, and generates the initial random number sources from a combination of multiple existing random number sources. A time-to-amplitude converter and multichannel analyzer are used for qualitative analysis to demonstrate that each and every step is random. Furthermore, a carefully designed data acquisition system is used to obtain a high-quality random sequence. Our scheme is simple and proves that the random number bit rate can be dramatically increased to satisfy practical requirements. Project supported by the National Natural Science Foundation of China (Grant Nos. 61178010 and 11374042), the Fund of State Key Laboratory of Information Photonics and Optical Communications (Beijing University of Posts and Telecommunications), China, and the Fundamental Research Funds for the Central Universities of China (Grant No. bupt2014TS01).
Comparative effectiveness of inter-simple sequence repeat and ...
African Journals Online (AJOL)
A study to compare the effectiveness of inter-simple sequence repeats (ISSR) and randomly amplified polymorphic DNA (RAPD) profiling was carried out with a total of 65 DNA samples using 12 species of Indian Garcinia. ISSR and RAPD profiling were performed with 19 and 12 primers, respectively. ISSR markers ...
True random number generation from mobile telephone photo based on chaotic cryptography
International Nuclear Information System (INIS)
Zhao Liang; Liao Xiaofeng; Xiao Di; Xiang Tao; Zhou Qing; Duan Shukai
2009-01-01
A cheap, convenient and universal TRNG based on mobile telephone photo for producing random bit sequence is proposed. To settle the problem of sequential pixels and comparability, three chaos-based approaches are applied to post-process the generated binary image. The random numbers produced by three users are tested using US NIST RNG statistical test software. The experimental results indicate that the Arnold cat map is the fastest way to generate a random bit sequence and can be accepted on general PC. The 'MASK' algorithm also performs well. Finally, comparing with the TRNG of Hu et al. [Hu Y, Liao X, Wong KW, Zhou Q. A true random number generator based on mouse movement and chaotic cryptography. Chaos, Solitons and Fractals 2007. doi: 10.1016/j.chaos.2007.10.022] which is presented by Hu et al., many merits of the proposed TRNG in this paper has been found.
Increasing average period lengths by switching of robust chaos maps in finite precision
Nagaraj, N.; Shastry, M. C.; Vaidya, P. G.
2008-12-01
Grebogi, Ott and Yorke (Phys. Rev. A 38, 1988) have investigated the effect of finite precision on average period length of chaotic maps. They showed that the average length of periodic orbits (T) of a dynamical system scales as a function of computer precision (ɛ) and the correlation dimension (d) of the chaotic attractor: T ˜ɛ-d/2. In this work, we are concerned with increasing the average period length which is desirable for chaotic cryptography applications. Our experiments reveal that random and chaotic switching of deterministic chaotic dynamical systems yield higher average length of periodic orbits as compared to simple sequential switching or absence of switching. To illustrate the application of switching, a novel generalization of the Logistic map that exhibits Robust Chaos (absence of attracting periodic orbits) is first introduced. We then propose a pseudo-random number generator based on chaotic switching between Robust Chaos maps which is found to successfully pass stringent statistical tests of randomness.
Directory of Open Access Journals (Sweden)
Christiane Alves Ferreira
2011-01-01
Full Text Available OBJECTIVE: To evaluate the validity of the Qualis database in identifying the levels of scientific evidence and the quality of randomized controlled trials indexed in the Lilacs database. METHODS: We selected 40 open-access journals and performed a page-by-page hand search, to identify published articles according to the type of study during a period of six years. Classification of studies was performed by independent reviewers assessed for their reliability. Randomized controlled trials were identified for separate evaluation of risk of bias using four dimensions: generation of allocation sequence, allocation concealment, blinding, and incomplete outcome data. The Qualis classification was considered to be the outcome variable. The statistical tests used included Kappa, Spearman's correlation, Kendall-tau and ordinal regressions. RESULTS: Studies with low levels of scientific evidence received similar Qualis classifications when compared to studies with high levels of evidence. In addition, randomized controlled trials with a high risk of bias for the generation of allocation sequences and allocation concealment were more likely to be published in journals with higher Qualis levels. DISCUSSION: The hierarchy level of the scientific evidence as classified by type of research design, as well as by the validity of studies according to the bias control level, was not correlated or associated with Qualis stratification. CONCLUSION: Qualis classifications for journals are not an approximate or indirect predictor of the validity of randomized controlled trials published in these journals and are therefore not a legitimate or appropriate indicator of the validity of randomized controlled trials.
Directory of Open Access Journals (Sweden)
Feng Wang
2014-01-01
Full Text Available This paper studies a single-period supply chain with a buy-back contract under a Stackelberg game model, in which the supplier (leader decides on the wholesale price, and the retailer (follower responds to determine the retail price and the order quantity. We analytically investigate the decentralized retailer’s optimal decision. Our results demonstrate that the retailer has a unique optimal simultaneous decision on the retail price and the order quantity, under a mild restriction on the demand distribution. Moreover, as it can be shown that the decentralized supply chain facing price-sensitive random demand cannot be coordinated with buy-back contract, we propose a scheme for the system to achieve Pareto-improvement. Theoretical analysis suggests that there exists a unique Pareto-equilibrium for the supply chain. In particular, when the Pareto-equilibrium is reached, the supply chain is coordinated. Numerical experiments confirm our results.
Buchenau, Wolfgang; Urschitz, Michael S; Sautermeister, Judit; Bacher, Margit; Herberts, Tina; Arand, Joerg; Poets, Christian F
2007-08-01
To test the hypothesis that a new orthodontic appliance with a velar extension that shifts the tongue anteriorly would reduce upper airway obstruction in infants with Pierre Robin sequence (PRS). Eleven infants with PRS (median age, 3 days) and an apnea index (AI) >3 were studied. The effect of the new appliance on the AI was compared with that of a conventional appliance without a velar extension by using a crossover study design with random allocation. Compared with baseline (mean AI, 13.8), there was a significant decrease in the AI with the new appliance (3.9; P value appliance (14.8; P = .842). Thus, the relative change in AI was -71% (95% CI, -84--49) for the new appliance and +8% (95% CI, -52-142) for the conventional appliance, which was significantly different (P = .004). No severe adverse effects were observed. This new orthodontic appliance appears to be safe and effective in reducing upper airway obstruction in infants with PRS.
Noisy: Identification of problematic columns in multiple sequence alignments
Directory of Open Access Journals (Sweden)
Grünewald Stefan
2008-06-01
Full Text Available Abstract Motivation Sequence-based methods for phylogenetic reconstruction from (nucleic acid sequence data are notoriously plagued by two effects: homoplasies and alignment errors. Large evolutionary distances imply a large number of homoplastic sites. As most protein-coding genes show dramatic variations in substitution rates that are not uncorrelated across the sequence, this often leads to a patchwork pattern of (i phylogenetically informative and (ii effectively randomized regions. In highly variable regions, furthermore, alignment errors accumulate resulting in sometimes misleading signals in phylogenetic reconstruction. Results We present here a method that, based on assessing the distribution of character states along a cyclic ordering of the taxa, allows the identification of phylogenetically uninformative homoplastic sites in a multiple sequence alignment. Removal of these sites appears to improve the performance of phylogenetic reconstruction algorithms as measured by various indices of "tree quality". In particular, we obtain more stable trees due to the exclusion of phylogenetically incompatible sites that most likely represent strongly randomized characters. Software The computer program noisy implements this approach. It can be employed to improving phylogenetic reconstruction capability with quite a considerable success rate whenever (1 the average bootstrap support obtained from the original alignment is low, and (2 there are sufficiently many taxa in the data set – at least, say, 12 to 15 taxa. The software can be obtained under the GNU Public License from http://www.bioinf.uni-leipzig.de/Software/noisy/.
Tong, Xiaojun; Cui, Minggen; Wang, Zhu
2009-07-01
The design of the new compound two-dimensional chaotic function is presented by exploiting two one-dimensional chaotic functions which switch randomly, and the design is used as a chaotic sequence generator which is proved by Devaney's definition proof of chaos. The properties of compound chaotic functions are also proved rigorously. In order to improve the robustness against difference cryptanalysis and produce avalanche effect, a new feedback image encryption scheme is proposed using the new compound chaos by selecting one of the two one-dimensional chaotic functions randomly and a new image pixels method of permutation and substitution is designed in detail by array row and column random controlling based on the compound chaos. The results from entropy analysis, difference analysis, statistical analysis, sequence randomness analysis, cipher sensitivity analysis depending on key and plaintext have proven that the compound chaotic sequence cipher can resist cryptanalytic, statistical and brute-force attacks, and especially it accelerates encryption speed, and achieves higher level of security. By the dynamical compound chaos and perturbation technology, the paper solves the problem of computer low precision of one-dimensional chaotic function.
Conversion of the random amplified polymorphic DNA (RAPD ...
African Journals Online (AJOL)
Conversion of the random amplified polymorphic DNA (RAPD) marker UBC#116 linked to Fusarium crown and root rot resistance gene (Frl) into a co-dominant sequence characterized amplified region (SCAR) marker for marker-assisted selection of tomato.
DEFF Research Database (Denmark)
Tsangaras, Kyriakos; Wales, Nathan; Sicheritz-Pontén, Thomas
2014-01-01
nucleotides) can result in enrichment across entire mitochondrial and bacterial genomes. Our findings suggest that some of the off-target sequences derived in capture experiments are non-randomly enriched, and that CapFlank will facilitate targeted enrichment of large contiguous sequences with minimal prior...
Malaviya, P; Singh, R P; Singh, S P; Hasker, E; Ostyn, B; Shankar, R; Boelaert, M; Sundar, S
2011-09-01
In 2009, a random survey was conducted in Muzaffarpur district to document the clinical outcomes of visceral leishmaniasis patients (VL) treated by the public health care system in 2008, to assess the effectiveness of miltefosine against VL. We analysed the operational feasibility and cost of such periodic random surveys as compared with health facility-based routine monitoring. A random sample of 150 patients was drawn from registers kept at Primary Health Care centres. Patient records were examined, and the patients were located at their residence. Patients and physicians were interviewed with the help of two specifically designed questionnaires by a team of one supervisor, one physician and one field worker. Costs incurred during this survey were properly documented, and vehicle log books maintained for analysis. Hundred and 39 (76.7%) of the patients could be located. Eleven patients were not traceable. Per patient, follow-up cost was US$ 15.51 and on average 2.27 patients could be visited per team-day. Human resource involvement constituted 75% of the total cost whereas involvement of physician costs 51% of the total cost. A random survey to document clinical outcomes is costly and labour intensive but gives probably the most accurate information on drug effectiveness. A health service-based retrospective cohort reporting system modelled on the monitoring system developed by tuberculosis programmes could be a better alternative. Involvement of community health workers in such monitoring would offer the additional advantage of treatment supervision and support. © 2011 Blackwell Publishing Ltd.
Doerr, Timothy P.; Alves, Gelio; Yu, Yi-Kuo
2005-08-01
Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time using the transfer matrix technique or, equivalently, the dynamic programming approach. This suggests a way to efficiently find approximate solutions-find a transformation that makes the cost function as similar as possible to that of the solvable class. After keeping many high-ranking solutions using the approximate cost function, one may then re-assess these solutions with the full cost function to find the best approximate solution. Under this approach, it is important to be able to assess the quality of the solutions obtained, e.g., by finding the true ranking of the kth best approximate solution when all possible solutions are considered exhaustively. To tackle this statistical issue, we provide a systematic method starting with a scaling function generated from the finite number of high-ranking solutions followed by a convergent iterative mapping. This method, useful in a variant of the directed paths in random media problem proposed here, can also provide a statistical significance assessment for one of the most important proteomic tasks-peptide sequencing using tandem mass spectrometry data. For directed paths in random media, the scaling function depends on the particular realization of randomness; in the mass spectrometry case, the scaling function is spectrum-specific.
Randomized Prediction Games for Adversarial Machine Learning.
Rota Bulo, Samuel; Biggio, Battista; Pillai, Ignazio; Pelillo, Marcello; Roli, Fabio
In spam and malware detection, attackers exploit randomization to obfuscate malicious data and increase their chances of evading detection at test time, e.g., malware code is typically obfuscated using random strings or byte sequences to hide known exploits. Interestingly, randomization has also been proposed to improve security of learning algorithms against evasion attacks, as it results in hiding information about the classifier to the attacker. Recent work has proposed game-theoretical formulations to learn secure classifiers, by simulating different evasion attacks and modifying the classification function accordingly. However, both the classification function and the simulated data manipulations have been modeled in a deterministic manner, without accounting for any form of randomization. In this paper, we overcome this limitation by proposing a randomized prediction game, namely, a noncooperative game-theoretic formulation in which the classifier and the attacker make randomized strategy selections according to some probability distribution defined over the respective strategy set. We show that our approach allows one to improve the tradeoff between attack detection and false alarms with respect to the state-of-the-art secure classifiers, even against attacks that are different from those hypothesized during design, on application examples including handwritten digit recognition, spam, and malware detection.In spam and malware detection, attackers exploit randomization to obfuscate malicious data and increase their chances of evading detection at test time, e.g., malware code is typically obfuscated using random strings or byte sequences to hide known exploits. Interestingly, randomization has also been proposed to improve security of learning algorithms against evasion attacks, as it results in hiding information about the classifier to the attacker. Recent work has proposed game-theoretical formulations to learn secure classifiers, by simulating different
International Nuclear Information System (INIS)
Savage, Gordon J.; Zhang, Xufang; Son, Young Kap; Pandey, Mahesh D.
2016-01-01
Resonance in a dynamic system is to be avoided since it often leads to impaired performance, overstressing, fatigue fracture and adverse human reactions. Thus, it is necessary to know the modal frequencies and ensure they do not coincide with any applied periodic loadings. For a rotating planar mechanism, the coefficients in the mass and stiffness matrices are periodically varying, and if the underlying geometry and material properties are treated as random variables then the modal frequencies are both position-dependent and probabilistic. The avoidance of resonance is now a complex problem. Herein, free vibration analysis helps determine ranges of modal frequencies that in turn, identify the running speeds of the mechanism to be avoided. This paper presents an efficient and accurate sample-based approach to determine probabilistic minimum and maximum extremes of the fundamental frequencies and the angular positions of their occurrence. Then, given critical lower and upper frequency constraints it is straightforward to determine reliability in terms of probability of exceedance. The novelty of the proposed approach is that the original expensive and implicit mechanistic model is replaced by an explicit meta-model that captures the tolerances of the design variables over the entire range of angular positions: position-dependent eigenvalues can be found easily and quickly. Extreme-value statistics of the modal frequencies and extreme-value statistics of the angular positions are readily computed through MCS. Limit-state surfaces that connect the frequencies to the design variables may be easily constructed. Error analysis identifies three errors and the paper presents ways to control them so the methodology can be sufficiently accurate. A numerical example of a flexible four-bar linkage shows the proposed methodology has engineering applications. The impact of the proposed methodology is two-fold: it presents a safe-side analysis based on free vibration methods to
DEFF Research Database (Denmark)
Richards, Stephen; Liu, Yue; Bettencourt, Brian R.
2005-01-01
years (Myr) since the pseudoobscura/melanogaster divergence. Genes expressed in the testes had higher amino acid sequence divergence than the genome-wide average, consistent with the rapid evolution of sex-specific proteins. Cis-regulatory sequences are more conserved than random and nearby sequences......We have sequenced the genome of a second Drosophila species, Drosophila pseudoobscura, and compared this to the genome sequence of Drosophila melanogaster, a primary model organism. Throughout evolution the vast majority of Drosophila genes have remained on the same chromosome arm, but within each...... between the species-but the difference is slight, suggesting that the evolution of cis-regulatory elements is flexible. Overall, a pattern of repeat-mediated chromosomal rearrangement, and high coadaptation of both male genes and cis-regulatory sequences emerges as important themes of genome divergence...
Revollo, Javier R; Crabtree, Nathaniel M; Pearce, Mason G; Pacheco-Martinez, M Monserrat; Dobrovolsky, Vasily N
2016-03-01
Identification of mutations induced by xenotoxins is a common task in the field of genetic toxicology. Mutations are often detected by clonally expanding potential mutant cells and genotyping each viable clone by Sanger sequencing. Such a "clone-by-clone" approach requires significant time and effort, and sometimes is even impossible to implement. Alternative techniques for efficient mutation identification would greatly benefit both basic and regulatory genetic toxicology research. Here, we report the development of Mutation Analysis with Random DNA Identifiers (MARDI), a novel high-fidelity Next Generation Sequencing (NGS) approach that circumvents clonal expansion and directly catalogs mutations in pools of mutant cells. MARDI uses oligonucleotides carrying Random DNA Identifiers (RDIs) to tag progenitor DNA molecules before PCR amplification, enabling clustering of descendant DNA molecules and eliminating NGS- and PCR-induced sequencing artifacts. When applied to the Pig-a cDNA analysis of heterogeneous pools of CD48-deficient T cells derived from DMBA-treated rats, MARDI detected nearly all Pig-a mutations that were previously identified by conventional clone-by-clone analysis and discovered many additional ones consistent with DMBA exposure: mostly A to T transversions, with the mutated A located on the non-transcribed DNA strand. © 2015 Wiley Periodicals, Inc.
A New Images Hiding Scheme Based on Chaotic Sequences
Institute of Scientific and Technical Information of China (English)
LIU Nian-sheng; GUO Dong-hui; WU Bo-xi; Parr G
2005-01-01
We propose a data hidding technique in a still image. This technique is based on chaotic sequence in the transform domain of covert image. We use different chaotic random sequences multiplied by multiple sensitive images, respectively, to spread the spectrum of sensitive images. Multiple sensitive images are hidden in a covert image as a form of noise. The results of theoretical analysis and computer simulation show the new hiding technique have better properties with high security, imperceptibility and capacity for hidden information in comparison with the conventional scheme such as LSB (Least Significance Bit).
Accident sequence precursor events with age-related contributors
Energy Technology Data Exchange (ETDEWEB)
Murphy, G.A.; Kohn, W.E.
1995-12-31
The Accident Sequence Precursor (ASP) Program at ORNL analyzed about 14.000 Licensee Event Reports (LERs) filed by US nuclear power plants 1987--1993. There were 193 events identified as precursors to potential severe core accident sequences. These are reported in G/CR-4674. Volumes 7 through 20. Under the NRC Nuclear Plant Aging Research program, the authors evaluated these events to determine the extent to which component aging played a role. Events were selected that involved age-related equipment degradation that initiated an event or contributed to an event sequence. For the 7-year period, ORNL identified 36 events that involved aging degradation as a contributor to an ASP event. Except for 1992, the percentage of age-related events within the total number of ASP events over the 7-year period ({approximately}19%) appears fairly consistent up to 1991. No correlation between plant ape and number of precursor events was found. A summary list of the age-related events is presented in the report.
Stochastic Optimal Estimation with Fuzzy Random Variables and Fuzzy Kalman Filtering
Institute of Scientific and Technical Information of China (English)
FENG Yu-hu
2005-01-01
By constructing a mean-square performance index in the case of fuzzy random variable, the optimal estimation theorem for unknown fuzzy state using the fuzzy observation data are given. The state and output of linear discrete-time dynamic fuzzy system with Gaussian noise are Gaussian fuzzy random variable sequences. An approach to fuzzy Kalman filtering is discussed. Fuzzy Kalman filtering contains two parts: a real-valued non-random recurrence equation and the standard Kalman filtering.
a Pseudo-Random Number Generator Employing Multiple RÉNYI Maps
Lui, Oi-Yan; Yuen, Ching-Hung; Wong, Kwok-Wo
2013-11-01
The increasing risk along with the drastic development of multimedia data transmission has raised a big concern on data security. A good pseudo-random number generator is an essential tool in cryptography. In this paper, we propose a novel pseudo-random number generator based on the controlled combination of the outputs of several digitized chaotic Rényi maps. The generated pseudo-random sequences have passed both the NIST 800-22 Revision 1a and the DIEHARD tests. Moreover, simulation results show that the proposed pseudo-random number generator requires less operation time than existing generators and is highly sensitive to the seed.
Composite Binary Sequences with a Large Ensemble and Zero Correlation Zone
Directory of Open Access Journals (Sweden)
S. S. Yudachev
2015-01-01
Full Text Available The article considers a proposed class of derived signals such as composite binary sequences for application in advanced spread spectrum radio systems of various purposes, using signals based on spectrum spreading by direct sequence method. Considered composite sequences, having a representative set of lengths and unique correlation properties, compares favorably with the widely used at present large ensembles formed on a single algorithmic basis. To evaluate the properties of the composite sequences generated on the basis of two components - the Barker code and Kerdock sequences, expressions of periodic and aperiodic correlation functions are given.An algorithm for generating practical ensembles of composite sequences is presented. On the basis of the algorithm and its software implementation in C #, the samples of the sequence ensembles of various lengths were obtained and their periodic and aperiodic correlation functions and statistical characteristics were studied in detail. As an illustration, some of the most typical correlation functions are presented. The most remarkable characteristics allowing a ssessing the feasibility of using this type of sequences in the design of specific types of radio systems are considered.On the basis of the proposed program and the performed calculations the conclusions can be drawn about the possibility of using the sequences of these classes, with the aim of reducing intra-system disturbance in the projected spread spectrum CDMA.
A Repetition Test for Pseudo-Random Number Generators
Gil, Manuel; Gonnet, Gaston H.; Petersen, Wesley P.
2017-01-01
A new statistical test for uniform pseudo-random number generators (PRNGs) is presented. The idea is that a sequence of pseudo-random numbers should have numbers reappear with a certain probability. The expectation time that a repetition occurs provides the metric for the test. For linear congruential generators (LCGs) failure can be shown theoretically. Empirical test results for a number of commonly used PRNGs are reported, showing that some PRNGs considered to have good statistical propert...
Return probabilities for the reflected random walk on N_0
Essifi, R.; Peigné, M.
2015-01-01
Let \\((Y_n)\\) be a sequence of i.i.d. \\(\\mathbb{Z }\\)-valued random variables with law \\(\\mu \\). The reflected random walk \\((X_n)\\) is defined recursively by \\(X_0=x \\in \\mathbb{N }_0, X_{n+1}=\\vert X_n+Y_{n+1}\\vert \\). Under mild hypotheses on the law \\(\\mu \\), it is proved that, for any \\( y \\in
Energy Technology Data Exchange (ETDEWEB)
Kalchev, D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Ketelsen, C. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Vassilevski, P. S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2013-11-07
Our paper proposes an adaptive strategy for reusing a previously constructed coarse space by algebraic multigrid to construct a two-level solver for a problem with nearby characteristics. Furthermore, a main target application is the solution of the linear problems that appear throughout a sequence of Markov chain Monte Carlo simulations of subsurface flow with uncertain permeability field. We demonstrate the efficacy of the method with extensive set of numerical experiments.
International Nuclear Information System (INIS)
Zu-Guo, Yu; Qian-Jun, Xiao; Long, Shi; Jun-Wu, Yu; Anh, Vo
2010-01-01
Investigating the biological function of proteins is a key aspect of protein studies. Bioinformatic methods become important for studying the biological function of proteins. In this paper, we first give the chaos game representation (CGR) of randomly-linked functional protein sequences, then propose the use of the recurrent iterated function systems (RIFS) in fractal theory to simulate the measure based on their chaos game representations. This method helps to extract some features of functional protein sequences, and furthermore the biological functions of these proteins. Then multifractal analysis of the measures based on the CGRs of randomly-linked functional protein sequences are performed. We find that the CGRs have clear fractal patterns. The numerical results show that the RIFS can simulate the measure based on the CGR very well. The relative standard error and the estimated probability matrix in the RIFS do not depend on the order to link the functional protein sequences. The estimated probability matrices in the RIFS with different biological functions are evidently different. Hence the estimated probability matrices in the RIFS can be used to characterise the difference among linked functional protein sequences with different biological functions. From the values of the D q curves, one sees that these functional protein sequences are not completely random. The D q of all linked functional proteins studied are multifractal-like and sufficiently smooth for the C q (analogous to specific heat) curves to be meaningful. Furthermore, the D q curves of the measure μ based on their CGRs for different orders to link the functional protein sequences are almost identical if q ≥ 0. Finally, the C q curves of all linked functional proteins resemble a classical phase transition at a critical point. (cross-disciplinary physics and related areas of science and technology)
High-Throughput Next-Generation Sequencing of Polioviruses
Montmayeur, Anna M.; Schmidt, Alexander; Zhao, Kun; Magaña, Laura; Iber, Jane; Castro, Christina J.; Chen, Qi; Henderson, Elizabeth; Ramos, Edward; Shaw, Jing; Tatusov, Roman L.; Dybdahl-Sissoko, Naomi; Endegue-Zanga, Marie Claire; Adeniji, Johnson A.; Oberste, M. Steven; Burns, Cara C.
2016-01-01
ABSTRACT The poliovirus (PV) is currently targeted for worldwide eradication and containment. Sanger-based sequencing of the viral protein 1 (VP1) capsid region is currently the standard method for PV surveillance. However, the whole-genome sequence is sometimes needed for higher resolution global surveillance. In this study, we optimized whole-genome sequencing protocols for poliovirus isolates and FTA cards using next-generation sequencing (NGS), aiming for high sequence coverage, efficiency, and throughput. We found that DNase treatment of poliovirus RNA followed by random reverse transcription (RT), amplification, and the use of the Nextera XT DNA library preparation kit produced significantly better results than other preparations. The average viral reads per total reads, a measurement of efficiency, was as high as 84.2% ± 15.6%. PV genomes covering >99 to 100% of the reference length were obtained and validated with Sanger sequencing. A total of 52 PV genomes were generated, multiplexing as many as 64 samples in a single Illumina MiSeq run. This high-throughput, sequence-independent NGS approach facilitated the detection of a diverse range of PVs, especially for those in vaccine-derived polioviruses (VDPV), circulating VDPV, or immunodeficiency-related VDPV. In contrast to results from previous studies on other viruses, our results showed that filtration and nuclease treatment did not discernibly increase the sequencing efficiency of PV isolates. However, DNase treatment after nucleic acid extraction to remove host DNA significantly improved the sequencing results. This NGS method has been successfully implemented to generate PV genomes for molecular epidemiology of the most recent PV isolates. Additionally, the ability to obtain full PV genomes from FTA cards will aid in facilitating global poliovirus surveillance. PMID:27927929
Problems with the random number generator RANF implemented on the CDC cyber 205
Kalle, Claus; Wansleben, Stephan
1984-10-01
We show that using RANF may lead to wrong results when lattice models are simulated by Monte Carlo methods. We present a shift-register sequence random number generator which generates two random numbers per cycle on a two pipe CDC Cyber 205.
International Nuclear Information System (INIS)
Cornejo Diaz, N.; Vergara Gil, A.; Jurado Vargas, M.
2010-01-01
The Monte Carlo method has become a valuable numerical laboratory framework in which to simulate complex physical systems. It is based on the generation of pseudo-random number sequences by numerical algorithms called random generators. In this work we assessed the suitability of different well-known random number generators for the simulation of gamma-ray spectrometry systems during efficiency calibrations. The assessment was carried out in two stages. The generators considered (Delphi's linear congruential, mersenne twister, XorShift, multiplier with carry, universal virtual array, and non-periodic logistic map based generator) were first evaluated with different statistical empirical tests, including moments, correlations, uniformity, independence of terms and the DIEHARD battery of tests. In a second step, an application-specific test was conducted by implementing the generators in our Monte Carlo program DETEFF and comparing the results obtained with them. The calculations were performed with two different CPUs, for a typical HpGe detector and a water sample in Marinelli geometry, with gamma-rays between 59 and 1800 keV. For the Non-periodic Logistic Map based generator, dependence of the most significant bits was evident. This explains the bias, in excess of 5%, of the efficiency values obtained with this generator. The results of the application-specific assessment and the statistical performance of the other algorithms studied indicate their suitability for the Monte Carlo simulation of gamma-ray spectrometry systems for efficiency calculations.
Díaz, N Cornejo; Gil, A Vergara; Vargas, M Jurado
2010-03-01
The Monte Carlo method has become a valuable numerical laboratory framework in which to simulate complex physical systems. It is based on the generation of pseudo-random number sequences by numerical algorithms called random generators. In this work we assessed the suitability of different well-known random number generators for the simulation of gamma-ray spectrometry systems during efficiency calibrations. The assessment was carried out in two stages. The generators considered (Delphi's linear congruential, mersenne twister, XorShift, multiplier with carry, universal virtual array, and non-periodic logistic map based generator) were first evaluated with different statistical empirical tests, including moments, correlations, uniformity, independence of terms and the DIEHARD battery of tests. In a second step, an application-specific test was conducted by implementing the generators in our Monte Carlo program DETEFF and comparing the results obtained with them. The calculations were performed with two different CPUs, for a typical HpGe detector and a water sample in Marinelli geometry, with gamma-rays between 59 and 1800 keV. For the Non-periodic Logistic Map based generator, dependence of the most significant bits was evident. This explains the bias, in excess of 5%, of the efficiency values obtained with this generator. The results of the application-specific assessment and the statistical performance of the other algorithms studied indicate their suitability for the Monte Carlo simulation of gamma-ray spectrometry systems for efficiency calculations. Copyright 2009 Elsevier Ltd. All rights reserved.
Random recurrence equations and ruin in a Markov-dependent stochastic economic environment
DEFF Research Database (Denmark)
Collamore, Jeffrey F.
2009-01-01
series models. Our results build upon work of Goldie, who has developed tail asymptotics applicable for independent sequences of random variables subject to a random recurrence equation. In contrast, we adopt a general approach based on the theory of Harris recurrent Markov chains and the associated...
Musical Scales in Tone Sequences Improve Temporal Accuracy.
Li, Min S; Di Luca, Massimiliano
2018-01-01
Predicting the time of stimulus onset is a key component in perception. Previous investigations of perceived timing have focused on the effect of stimulus properties such as rhythm and temporal irregularity, but the influence of non-temporal properties and their role in predicting stimulus timing has not been exhaustively considered. The present study aims to understand how a non-temporal pattern in a sequence of regularly timed stimuli could improve or bias the detection of temporal deviations. We presented interspersed sequences of 3, 4, 5, and 6 auditory tones where only the timing of the last stimulus could slightly deviate from isochrony. Participants reported whether the last tone was 'earlier' or 'later' relative to the expected regular timing. In two conditions, the tones composing the sequence were either organized into musical scales or they were random tones. In one experiment, all sequences ended with the same tone; in the other experiment, each sequence ended with a different tone. Results indicate higher discriminability of anisochrony with musical scales and with longer sequences, irrespective of the knowledge of the final tone. Such an outcome suggests that the predictability of non-temporal properties, as enabled by the musical scale pattern, can be a factor in determining the sensitivity of time judgments.
Did A Planet Survive A Post-Main Sequence Evolutionary Event?
Sorber, Rebecca; Jang-Condell, Hannah; Zimmerman, Mara
2018-06-01
The GL86 is star system approximately 10 pc away with a main sequence K- type ~ 0.77 M⊙ star (GL 86A) with a white dwarf ~0.49 M⊙ companion (GL86 B). The system has a ~ 18.4 AU semi-major axis, an orbital period of ~353 yrs, and an eccentricity of ~ 0.39. A 4.5 MJ planet orbits the main sequence star with a semi-major axis of 0.113 AU, an orbital period of 15.76 days, in a near circular orbit with an eccentricity of 0.046. If we assume that this planet was formed during the time when the white dwarf was a main sequence star, it would be difficult for the planet to have remained in a stable orbit during the post-main sequence evolution of GL86 B. The post-main sequence evolution with planet survival will be examined by modeling using the program Mercury (Chambers 1999). Using the model, we examine the origins of the planet: whether it formed before or after the post-main sequence evolution of GL86B. The modeling will give us insight into the dynamical evolution of, not only, the binary star system, but also the planet’s life cycle.
Nobile, Fabio
2015-01-07
We consider a general problem F(u, y) = 0 where u is the unknown solution, possibly Hilbert space valued, and y a set of uncertain parameters. We specifically address the situation in which the parameterto-solution map u(y) is smooth, however y could be very high (or even infinite) dimensional. In particular, we are interested in cases in which F is a differential operator, u a Hilbert space valued function and y a distributed, space and/or time varying, random field. We aim at reconstructing the parameter-to-solution map u(y) from random noise-free or noisy observations in random points by discrete least squares on polynomial spaces. The noise-free case is relevant whenever the technique is used to construct metamodels, based on polynomial expansions, for the output of computer experiments. In the case of PDEs with random parameters, the metamodel is then used to approximate statistics of the output quantity. We discuss the stability of discrete least squares on random points show convergence estimates both in expectation and probability. We also present possible strategies to select, either a-priori or by adaptive algorithms, sequences of approximating polynomial spaces that allow to reduce, and in some cases break, the curse of dimensionality
Cryptography, statistics and pseudo-randomness (Part 1)
Brands, S.; Gill, R.D.
1995-01-01
In the classical approach to pseudo-random number generators, a generator is considered to perform well if its output sequences pass a battery of statistical tests that has become standard. In recent years, it has turned out that this approach is not satisfactory. Many generators have turned out to
Properties making a chaotic system a good Pseudo Random Number Generator
Falcioni, Massimo; Palatella, Luigi; Pigolotti, Simone; Vulpiani, Angelo
2005-01-01
We discuss two properties making a deterministic algorithm suitable to generate a pseudo random sequence of numbers: high value of Kolmogorov-Sinai entropy and high-dimensionality. We propose the multi dimensional Anosov symplectic (cat) map as a Pseudo Random Number Generator. We show what chaotic features of this map are useful for generating Pseudo Random Numbers and investigate numerically which of them survive in the discrete version of the map. Testing and comparisons with other generat...
Super fast physical-random number generation using laser diode frequency noises
Ushiki, Tetsuro; Doi, Kohei; Maehara, Shinya; Sato, Takashi; Ohkawa, Masashi; Ohdaira, Yasuo
2011-02-01
Random numbers can be classified as either pseudo- or physical-random in character. Pseudo-random numbers' periodicity renders them inappropriate for use in cryptographic applications, but naturally-generated physical-random numbers have no calculable periodicity, thereby making them ideally-suited to the task. The laser diode naturally produces a wideband "noise" signal that is believed to have tremendous capacity and great promise, for the rapid generation of physical-random numbers for use in cryptographic applications. We measured a laser diode's output, at a fast photo detector and generated physical-random numbers from frequency noises. We then identified and evaluated the binary-number-line's statistical properties. The result shows that physical-random number generation, at speeds as high as 40Gbps, is obtainable, using the laser diode's frequency noise characteristic.
Predicting tissue-specific expressions based on sequence characteristics
Paik, Hyojung; Ryu, Tae Woo; Heo, Hyoungsam; Seo, Seungwon; Lee, Doheon; Hur, Cheolgoo
2011-01-01
In multicellular organisms, including humans, understanding expression specificity at the tissue level is essential for interpreting protein function, such as tissue differentiation. We developed a prediction approach via generated sequence features from overrepresented patterns in housekeeping (HK) and tissue-specific (TS) genes to classify TS expression in humans. Using TS domains and transcriptional factor binding sites (TFBSs), sequence characteristics were used as indices of expressed tissues in a Random Forest algorithm by scoring exclusive patterns considering the biological intuition; TFBSs regulate gene expression, and the domains reflect the functional specificity of a TS gene. Our proposed approach displayed better performance than previous attempts and was validated using computational and experimental methods.
Predicting tissue-specific expressions based on sequence characteristics
Paik, Hyojung
2011-04-30
In multicellular organisms, including humans, understanding expression specificity at the tissue level is essential for interpreting protein function, such as tissue differentiation. We developed a prediction approach via generated sequence features from overrepresented patterns in housekeeping (HK) and tissue-specific (TS) genes to classify TS expression in humans. Using TS domains and transcriptional factor binding sites (TFBSs), sequence characteristics were used as indices of expressed tissues in a Random Forest algorithm by scoring exclusive patterns considering the biological intuition; TFBSs regulate gene expression, and the domains reflect the functional specificity of a TS gene. Our proposed approach displayed better performance than previous attempts and was validated using computational and experimental methods.
ESPRIT: A Method for Defining Soluble Expression Constructs in Poorly Understood Gene Sequences.
Mas, Philippe J; Hart, Darren J
2017-01-01
Production of soluble, purifiable domains or multi-domain fragments of proteins is a prerequisite for structural biology and other applications. When target sequences are poorly annotated, or when there are few similar sequences available for alignments, identification of domains can be problematic. A method called expression of soluble proteins by random incremental truncation (ESPRIT) addresses this problem by high-throughput automated screening of tens of thousands of enzymatically truncated gene fragments. Rare soluble constructs are identified by experimental screening, and the boundaries revealed by DNA sequencing.
Directory of Open Access Journals (Sweden)
CARLOS ZAVALA
2001-07-01
Full Text Available Upper Tertiary aeolian strata (Río Negro Formation outcrop in extensive sea cliffs at the Northeast of Patagonia. These outcrops show deposits corresponding to a complete suite of aeolian and aeolian related sub-environments, and also provide excellent exposures to analyse the sedimentology and internal architecture from a sequence stratigraphic point of view. Field studies, supplemented withline-drawings of oblique photographs, allowed the recognition of seven aeolian depositional sequences within the succession, each one bounded by regional super surfaces (or deflation surfaces. Internally these aeolian sequences display a cyclic recurrence in facies, that yields a tentative genetic model for their evolution. As documented from field examples, each basic aeolian depositional sequence was deposited during a single aggradational period, and is bounded by unconformities related to degradational periods. Degradational periods are regional deflationary events, that resulted in deep-scoured to flat surfaces, characterised by erosion / non deposition in which the only recognised accumulation is isolated and large angular blocks of fine-grained aggregates, interpreted as residual remnants of deposits of the previous sequence. Aggradational periods are characterised by a near- continuous accumulations responsible for the sequence building. Differences in the aeolian sediment budget to the area and the rising rate of water table control the related facies types, and allow to discriminateearly and late aggradational sub-periods. Early aggradational sub-periods form under conditions of relatively fast rising water tables associated with moderate aeolian sediment budget, thus resulting in the development of extended wet interduneslaterally associated with aeolian dunes and dry interdunes. During late aggradational sub-periods, the depositional surface outdistanced the water table, and aeolian dunes and dry interdunes tend to predominate. This sub-period
Abstracting Sequences: Reasoning That Is a Key to Academic Achievement.
Pasnak, Robert; Kidd, Julie K; Gadzichowski, K Marinka; Gallington, Debbie A; Schmerold, Katrina Lea; West, Heather
2015-01-01
The ability to understand sequences of items may be an important cognitive ability. To test this proposition, 8 first-grade children from each of 36 classes were randomly assigned to four conditions. Some were taught sequences that represented increasing or decreasing values, or were symmetrical, or were rotations of an object through 6 or 8 positions. Control children received equal numbers of sessions on mathematics, reading, or social studies. Instruction was conducted three times weekly in 15-min sessions for seven months. In May, the children taught sequences applied their understanding to novel sequences, and scored as well or better on three standardized reading tests as the control children. They outscored all children on tests of mathematics concepts, and scored better than control children on some mathematics scales. These findings indicate that developing an understanding of sequences is a form of abstraction, probably involving fluid reasoning, that provides a foundation for academic achievement in early education.
Aaby, Peter; Roth, Adam; Ravn, Henrik; Napirna, Bitiguida Mutna; Rodrigues, Amabelia; Lisse, Ida Maria; Stensballe, Lone; Diness, Birgitte Rode; Lausch, Karen Rokkedal; Lund, Najaaraq; Biering-Sørensen, Sofie; Whittle, Hilton; Benn, Christine Stabell
2011-07-15
Observational studies have suggested that BCG may have nonspecific beneficial effects on survival. Low-birth-weight (LBW) children are not given BCG at birth in Guinea-Bissau; we conducted a randomized trial of BCG at birth (early BCG) vs delayed BCG. In the period 2004-2008 we recruited 2320 LBW children in Bissau. The children were visited at home at 2, 6, and 12 months of age. With a pretrial infant mortality of 250 per 1000, we hypothesized a 25% reduction in infant mortality for LBW children. Infant mortality was only 101 per 1000 during the trial. In the primary analysis, infant mortality was reduced insignificantly by 17% (mortality rate ratio [MRR] = .83 [.63-1.08]). In secondary analyses, early BCG vaccine was safe with an MRR of .49 (.21-1.15) after 3 days and .55 (.34-.89) after 4 weeks. The reduction in neonatal mortality was mainly due to fewer cases of neonatal sepsis, respiratory infection, and fever. The impact of early BCG on infant mortality was marked for children weighing <1.5 kg (MRR = .43 [.21-.85]) who had lower coverage for diphtheria-tetanus-pertussis vaccinations. Though early BCG did not reduce infant mortality significantly, it may have a beneficial effect in the neonatal period. This could be important for public health because BCG is often delayed in low-income countries.
A Bayesian test for periodic signals in red noise
Vaughan, S.
2010-02-01
Many astrophysical sources, especially compact accreting sources, show strong, random brightness fluctuations with broad power spectra in addition to periodic or quasi-periodic oscillations (QPOs) that have narrower spectra. The random nature of the dominant source of variance greatly complicates the process of searching for possible weak periodic signals. We have addressed this problem using the tools of Bayesian statistics; in particular, using Markov Chain Monte Carlo techniques to approximate the posterior distribution of model parameters, and posterior predictive model checking to assess model fits and search for periodogram outliers that may represent periodic signals. The methods developed are applied to two example data sets, both long XMM-Newton observations of highly variable Seyfert 1 galaxies: RE J1034 + 396 and Mrk 766. In both cases, a bend (or break) in the power spectrum is evident. In the case of RE J1034 + 396, the previously reported QPO is found but with somewhat weaker statistical significance than reported in previous analyses. The difference is due partly to the improved continuum modelling, better treatment of nuisance parameters and partly to different data selection methods.
First steps in random walks from tools to applications
Klafter, J
2011-01-01
The name ""random walk"" for a problem of a displacement of a point in a sequence of independent random steps was coined by Karl Pearson in 1905 in a question posed to readers of ""Nature"". The same year, a similar problem was formulated by Albert Einstein in one of his Annus Mirabilis works. Even earlier such a problem was posed by Louis Bachelier in his thesis devoted to the theory of financial speculations in 1900. Nowadays the theory of random walks has proved useful in physics andchemistry (diffusion, reactions, mixing in flows), economics, biology (from animal spread to motion of subcel
Pseudo-random bit generator based on lag time series
García-Martínez, M.; Campos-Cantón, E.
2014-12-01
In this paper, we present a pseudo-random bit generator (PRBG) based on two lag time series of the logistic map using positive and negative values in the bifurcation parameter. In order to hidden the map used to build the pseudo-random series we have used a delay in the generation of time series. These new series when they are mapped xn against xn+1 present a cloud of points unrelated to the logistic map. Finally, the pseudo-random sequences have been tested with the suite of NIST giving satisfactory results for use in stream ciphers.
Onsongo, Getiria; Baughn, Linda B; Bower, Matthew; Henzler, Christine; Schomaker, Matthew; Silverstein, Kevin A T; Thyagarajan, Bharat
2016-11-01
Simultaneous detection of small copy number variations (CNVs) (<0.5 kb) and single-nucleotide variants in clinically significant genes is of great interest for clinical laboratories. The analytical variability in next-generation sequencing (NGS) and artifacts in coverage data because of issues with mappability along with lack of robust bioinformatics tools for CNV detection have limited the utility of targeted NGS data to identify CNVs. We describe the development and implementation of a bioinformatics algorithm, copy number variation-random forest (CNV-RF), that incorporates a machine learning component to identify CNVs from targeted NGS data. Using CNV-RF, we identified 12 of 13 deletions in samples with known CNVs, two cases with duplications, and identified novel deletions in 22 additional cases. Furthermore, no CNVs were identified among 60 genes in 14 cases with normal copy number and no CNVs were identified in another 104 patients with clinical suspicion of CNVs. All positive deletions and duplications were confirmed using a quantitative PCR method. CNV-RF also detected heterozygous deletions and duplications with a specificity of 50% across 4813 genes. The ability of CNV-RF to detect clinically relevant CNVs with a high degree of sensitivity along with confirmation using a low-cost quantitative PCR method provides a framework for providing comprehensive NGS-based CNV/single-nucleotide variant detection in a clinical molecular diagnostics laboratory. Copyright © 2016 American Society for Investigative Pathology and the Association for Molecular Pathology. Published by Elsevier Inc. All rights reserved.
Periodicity, the Canon and Sport
Directory of Open Access Journals (Sweden)
Thomas F. Scanlon
2015-10-01
Full Text Available The topic according to this title is admittedly a broad one, embracing two very general concepts of time and of the cultural valuation of artistic products. Both phenomena are, in the present view, largely constructed by their contemporary cultures, and given authority to a great extent from the prestige of the past. The antiquity of tradition brings with it a certain cachet. Even though there may be peripheral debates in any given society which question the specifics of periodization or canonicity, individuals generally accept the consensus designation of a sequence of historical periods and they accept a list of highly valued artistic works as canonical or authoritative. We will first examine some of the processes of periodization and of canon-formation, after which we will discuss some specific examples of how these processes have worked in the sport of two ancient cultures, namely Greece and Mesoamerica.
Conditional Monte Carlo randomization tests for regression models.
Parhat, Parwen; Rosenberger, William F; Diao, Guoqing
2014-08-15
We discuss the computation of randomization tests for clinical trials of two treatments when the primary outcome is based on a regression model. We begin by revisiting the seminal paper of Gail, Tan, and Piantadosi (1988), and then describe a method based on Monte Carlo generation of randomization sequences. The tests based on this Monte Carlo procedure are design based, in that they incorporate the particular randomization procedure used. We discuss permuted block designs, complete randomization, and biased coin designs. We also use a new technique by Plamadeala and Rosenberger (2012) for simple computation of conditional randomization tests. Like Gail, Tan, and Piantadosi, we focus on residuals from generalized linear models and martingale residuals from survival models. Such techniques do not apply to longitudinal data analysis, and we introduce a method for computation of randomization tests based on the predicted rate of change from a generalized linear mixed model when outcomes are longitudinal. We show, by simulation, that these randomization tests preserve the size and power well under model misspecification. Copyright © 2014 John Wiley & Sons, Ltd.
Origin of very-short orbital-period binary systems
International Nuclear Information System (INIS)
Miyaji, S.
1983-01-01
Recent observations of four close binaries have established that there is a group of very-short orbital-period (VSOP) binaries whose orbital periods are less than 60 minutes. The VSOP binaries consist of both X-ray close binaries and cataclysmic variables. Their orbital periods are too short to have a main-sequence companion. However, four binaries, none of which belongs to any globular cluster, are too abundant to be explained by the capturing mechanism of a white dwarf. Therefore it seemed to be worthwhile to present an evolutionary scenario from an original binary system which can be applied for all VSOP binaries. (Auth.)
Ghasemi Gojani, Marzieh; Kordi, Masoumeh; Asgharipour, Negar; Esmaeili, Habibollah
2018-04-01
The outcomes of fertility treatments are unpredictable, and levels of depressive symptoms increase in patients during the waiting period of the result of intrauterine insemination (IUI) treatment. The aim of this study was to compare the effects of a positive reappraisal coping intervention (PRCI) and problem-solving skills training (PSS) on depression during the waiting period of the result of IUI Treatment. This randomized control clinical trial was done among 108 women undergoing IUI treatment. In the control group, the women received routine care. In the PRCI group, women attended two training sessions and were asked to complete coping thoughts cards and fill out daily monitoring forms during the waiting period. In the PSS group, PSS were taught over three sessions. The depression was measured by the beck depression inventory. On the 10 th th day of the IUI waiting period, there were significant differences between the control group (21.42 ± 11.42) and the PSS group (12.52 ± 8.05) and PRCI groups (13.14 ± 9.7) (P<0.001), but no significant difference between the PRCI group and the PSS group. According to the results of this randomized control trial there is no difference between a PRCI and PSS on depression during the waiting period of the result of IUI treatment. This suggests that both interventions can be used to help infertile women combat depression during the waiting period of the result of fertility treatments (Registration number: IRCT2016020926490N1). Copyright© by Royan Institute. All rights reserved.
Directory of Open Access Journals (Sweden)
Marzieh Ghasemi gojani, , ,
2018-01-01
Full Text Available Background The outcomes of fertility treatments are unpredictable, and levels of depressive symptoms increase in patients during the waiting period of the result of intrauterine insemination (IUI treatment. The aim of this study was to compare the effects of a positive reappraisal coping intervention (PRCI and problem-solving skills training (PSS on depression during the waiting period of the result of IUI Treatment. Materials and Methods This randomized control clinical trial was done among 108 women undergoing IUI treat- ment. In the control group, the women received routine care. In the PRCI group, women attended two training sessions and were asked to complete coping thoughts cards and fill out daily monitoring forms during the waiting period. In the PSS group, PSS were taught over three sessions. The depression was measured by the beck depression inventory. Results On the 10th day of the IUI waiting period, there were significant differences between the control group (21.42 ± 11.42 and the PSS group (12.52 ± 8.05 and PRCI groups (13.14 ± 9.7 (P<0.001, but no significant difference between the PRCI group and the PSS group. Conclusion According to the results of this randomized control trial there is no difference between a PRCI and PSS on depression during the waiting period of the result of IUI treatment. This suggests that both interventions can be used to help infertile women combat depression during the waiting period of the result of fertility treatments (Registration number: IRCT2016020926490N1.
PHARMACOGENETIC TESTING OPPORTUNITIES IN CARDIOLOGY BASED ON EXOME SEQUENCING
Directory of Open Access Journals (Sweden)
N. V. Shcherbakova
2014-01-01
Full Text Available Aim. To study what cardiac drugs currently have any comments on biomarkers and what information can be obtained by pharmacogenetic testing using data exome sequencing in patients with cardiac diseases.Material and methods. Exome sequencing in random participant of the ATEROGEN IVANOVO study and bioinformatics analysis of the data were performed. Point mutations were annotated using ANNOVAR program, as well as comparison with a number of specialized databases was done on the basis of user protocols.Results. 11 cardiac drugs and 7 genes which variants can influence cardiac drug metabolism were analyzed. According to exome sequencing of the participant we did not reveal allelic variants that require dose regime correction and careful efficacy control.Conclusion. The exome sequencing application is the next step to a wide range of personalized therapy. Future opportunities for improvement of the risk-benefit ratio in each patient are the main purpose of the collection and analysis of pharmacogenetic data.
Mixed models, linear dependency, and identification in age-period-cohort models.
O'Brien, Robert M
2017-07-20
This paper examines the identification problem in age-period-cohort models that use either linear or categorically coded ages, periods, and cohorts or combinations of these parameterizations. These models are not identified using the traditional fixed effect regression model approach because of a linear dependency between the ages, periods, and cohorts. However, these models can be identified if the researcher introduces a single just identifying constraint on the model coefficients. The problem with such constraints is that the results can differ substantially depending on the constraint chosen. Somewhat surprisingly, age-period-cohort models that specify one or more of ages and/or periods and/or cohorts as random effects are identified. This is the case without introducing an additional constraint. I label this identification as statistical model identification and show how statistical model identification comes about in mixed models and why which effects are treated as fixed and which are treated as random can substantially change the estimates of the age, period, and cohort effects. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.
Templated sequence insertion polymorphisms in the human genome
Onozawa, Masahiro; Aplan, Peter
2016-11-01
Templated Sequence Insertion Polymorphism (TSIP) is a recently described form of polymorphism recognized in the human genome, in which a sequence that is templated from a distant genomic region is inserted into the genome, seemingly at random. TSIPs can be grouped into two classes based on nucleotide sequence features at the insertion junctions; Class 1 TSIPs show features of insertions that are mediated via the LINE-1 ORF2 protein, including 1) target-site duplication (TSD), 2) polyadenylation 10-30 nucleotides downstream of a “cryptic” polyadenylation signal, and 3) preference for insertion at a 5’-TTTT/A-3’ sequence. In contrast, class 2 TSIPs show features consistent with repair of a DNA double-strand break via insertion of a DNA “patch” that is derived from a distant genomic region. Survey of a large number of normal human volunteers demonstrates that most individuals have 25-30 TSIPs, and that these TSIPs track with specific geographic regions. Similar to other forms of human polymorphism, we suspect that these TSIPs may be important for the generation of human diversity and genetic diseases.
Jiancheng, Shi; Min, Luo; Chusheng, Huang
2017-08-01
The cooperative effect of random coupling strength and time-periodic coupling strengh on synchronization transitions in one-way coupled neural system has been investigated by mean field approach. Results show that cooperative coupling strength (CCS) plays an active role for the enhancement of synchronization transitions. There exist an optimal frequency of CCS which makes the system display the best CCS-induced synchronization transitions, a critical frequency of CCS which can not further affect the CCS-induced synchronization transitions, and a critical amplitude of CCS which can not occur the CCS-induced synchronization transitions. Meanwhile, noise intensity plays a negative role for the CCS-induced synchronization transitions. Furthermore, it is found that the novel CCS amplitude-induced synchronization transitions and CCS frequency-induced synchronization transitions are found.
DEFF Research Database (Denmark)
Tsangaras, Kyriakos; Wales, Nathan; Sicheritz-Pontén, Thomas
2014-01-01
, a non-negligible fraction of the resulting sequence reads are not homologous to the bait. We demonstrate that during capture, the bait-hybridized library molecules add additional flanking library sequences iteratively, such that baits limited to targeting relatively short regions (e.g. few hundred...... nucleotides) can result in enrichment across entire mitochondrial and bacterial genomes. Our findings suggest that some of the off-target sequences derived in capture experiments are non-randomly enriched, and that CapFlank will facilitate targeted enrichment of large contiguous sequences with minimal prior...
Gungorduk, Kemal; Asicioglu, Osman; Gungorduk, Ozgu Celikkol; Yildirim, Gokhan; Besimoğlu, Berhan; Ark, Cemal
2014-03-01
To determine whether maternal vitamin C and vitamin E supplementation after the premature rupture of membranes is associated with an increase in the latency period before delivery. In the present prospective open randomized trial, 229 pregnant women with preterm premature rupture of membranes (PPROM) at ≥ 24.0 and vitamin C and 400 IU of vitamin E (n = 126) or a placebo (n = 123). The primary outcome was the latency period until delivery. Analysis was performed on an intention-to-treat basis. No significant differences in demographic or clinical characteristics were observed between the groups. Latency period until delivery was significantly higher in the group that received vitamins compared with the control group (11.2 ± 6.3 days versus 6.2 ± 4.0 days; p vitamin group compared with the control group (31.9 ± 2.6 weeks versus 31.0 ± 2.6 weeks; p = 0.01). No significant differences in adverse maternal outcome (i.e., chorioamnionitis or endometritis) or neonatal outcome (i.e., neonatal sepsis, neonatal death, necrotizing enterocolitis, or grade 3 to 4 intraventricular hemorrhage) were noted between groups. The findings of the present study suggest that the use of vitamins C and E in women with PPROM is associated with a longer latency period before delivery. Moreover, adverse neonatal and maternal outcomes, which are often associated with prolonged latency periods, were similar between the groups. Thieme Medical Publishers 333 Seventh Avenue, New York, NY 10001, USA.
Molotkov, S. N.
2017-03-01
Various methods for the clustering of photocounts constituting a sequence of random numbers are considered. It is shown that the clustering of photocounts resulting in the Fermi-Dirac distribution makes it possible to achieve the theoretical limit of the random number generation rate.
Helmy, Sally A; El-Bedaiwy, Heba M
2014-11-01
Piroxicam is a NSAID with analgesic and antipyretic properties, used for the treatment of rheumatoid diseases. The aim of this study was to evaluate the bioequivalence of two brands of piroxicam capsules (20 mg) in 24 Egyptian volunteers. The in vivo study was established according to a single-center, randomized, single-dose, laboratory-blinded, 2-period, 2-sequence, crossover study with a washout period of 3 weeks. Under fasting conditions, 24 healthy male volunteers were randomly selected to receive a single oral dose of one capsule (20 mg) of either test or reference product. Plasma samples were obtained over a 144-hour interval and analyzed for piroxicam by HPLC with UV detection. The pharmacokinetic parameters Cmax , tmax , AUC0-t , AUC0-∞ , Vd /F, Cl/F, and t1/2 were determined from plasma concentration-time profiles. The 90% confidence intervals for the ratio of log transformed values of Cmax , AUC0-t , and AUC0-∞ of the two treatments were within the acceptable range (0.8-1.25) for bioequivalence. From PK perspectives, the two piroxicam formulations were considered bioequivalent, based on the rate and extent of absorption. No adverse events occurred or were reported after a single 20-mg piroxicam and both formulations were well-tolerated. © 2014, The American College of Clinical Pharmacology.
Photometric Analysis and Period Investigation of the EW Type ...
Indian Academy of Sciences (India)
Photometric Analysis and Period Investigation of the EW Type. Eclipsing ... binary with the less massive secondary component filling the inner Roche lobe. ..... Cox 2000) assuming that the primary component is a normal main sequence star.
Herschorn, Sender; Staskin, David; Tu, Le Mai; Fialkov, Jonathan; Walsh, Terry; Gooch, Katherine; Schermer, Carol R
2018-04-19
The PREFER study was an assessment of medication tolerability, treatment preference and symptom improvement during treatment with mirabegron (M) and tolterodine (T) extended release (ER) in patients with overactive bladder (OAB). In this analysis of PREFER, patient-reported outcomes (PROs) were assessed during treatment. PREFER was a two-period, 8-week crossover, double-blind, phase IV study (NCT02138747) of treatment-naïve adults with OAB ≥3 months randomized to 1 of 4 treatment sequences (M/T; T/M; M/M; T/T), separated by a 2-week washout. Tolterodine ER was dosed at 4 mg for 8 weeks and mirabegron was dosed at 25 mg for 4 weeks then increased to 50 mg for the next 4 weeks. At each visit, PROs related to treatment satisfaction, quality of life and symptom bother were assessed using the OAB Satisfaction (OAB-S; 3 independent scales/5 single-item overall assessments), OAB-q (total health-related QoL [HRQoL] and subscales [Sleep, Social, Coping, Concern] and Symptom Bother scale) and Patient Perception of Bladder Condition (PPBC) questionnaires. Responder rates were reported for OAB-q subscales based on a minimal important difference (MID; ≥ 10-point improvement) and OAB-S Medication Tolerability score ≥ 90. In total, 358 randomized patients received ≥1 dose of double-blind study medication and completed ≥1 post-baseline value (OAB-S scale, OAB-q, PPBC): M/T (n = 154), T/M (n = 144), M/M (n = 30) or T/T (n = 30). At end of treatment (EoT), mirabegron and tolterodine ER were associated with similar mean improvements in 7 of the 8 OAB-S scores investigated, OAB-q scales and PPBC. A higher percentage of patients achieved clinically relevant improvements (MID) in OAB-q scales and OAB-S Medication Tolerability score during treatment with mirabegron than tolterodine ER. On average, patients with OAB experienced improvements in treatment satisfaction, HRQoL and symptom bother that were of a similar magnitude during treatment with
Quasi-periodicity in deep redshift surveys
International Nuclear Information System (INIS)
Weygaert, R. van de
1991-01-01
The recent result by Broadhurst et al., (1990. Nature 343, 726) showing a striking, nearly periodic, galaxy redshift distribution in a narrow pencil-beam survey, is explained within the Voronoi cellular model of clustering of galaxies. Galaxies, whose luminosities are selected from a Schechter luminosity function, are placed randomly within the walls of this cellular model. Narrow and deep, magnitude-limited, pencil-beam surveys through these structures are simulated. Some 15 per cent of these beams show that observed regular pattern, with a spacing between the peaks of the order of 105 h -1 -150 h -1 Mpc, but most pencil-beams show peaks in the redshift distribution without periodicity, so we may conclude that, even within a cellular universe, periodicity is not a common phenomenon. (author)
Directory of Open Access Journals (Sweden)
ALTINOZ, O. T.
2014-08-01
Full Text Available Nature-inspired optimization algorithms can obtain the optima by updating the position of each member in the population. At the beginning of the algorithm, the particles of the population are spread into the search space. The initial distribution of particles corresponds to the beginning points of the search process. Hence, the aim is to alter the position for each particle beginning with this initial position until the optimum solution will be found with respect to the pre-determined conditions like maximum iteration, and specific error value for the fitness function. Therefore, initial positions of the population have a direct effect on both accuracy of the optima and the computational cost. If any member in the population is close enough to the optima, this eases the achievement of the exact solution. On the contrary, individuals grouped far away from the optima might yield pointless efforts. In this study, low-discrepancy quasi-random number sequence is preferred for the localization of the population at the initialization phase. By this way, the population is distributed into the search space in a more uniform manner at the initialization phase. The technique is applied to the Gravitational Search Algorithm and compared via the performance on benchmark function solutions.
Directory of Open Access Journals (Sweden)
Sunirmal Sheet
2018-03-01
Full Text Available Apart from being fed to silkworms in sericulture, the ecologically important Mulberry plant has been used for traditional medicine in Asian countries as well as in manufacturing wine, food, and beverages. Germplasm analysis among Mulberry cultivars originating from South Korea is crucial in the plant breeding program for cultivar development. Hence, the genetic deviations and relations among 8 Morus alba plants, and one Morus lhou plant, of different cultivars collected from South Korea were investigated using 10 random amplified polymorphic DNA (RAPD and 10 inter-simple sequence repeat (ISSR markers in the present study. The ISSR markers exhibited a higher polymorphism (63.42% among mulberry genotypes in comparison to RAPD markers. Furthermore, the similarity coefficient was estimated for both markers and found to be varying between 0.183 and 0.814 for combined pooled data of ISSR and RAPD. The phenogram drawn using the UPGMA cluster method based on combined pooled data of RAPD and ISSR markers divided the nine mulberry genotypes into two divergent major groups and the two individual independent accessions. The distant relationship between Dae-Saug (SM1 and SangchonJo Sang Saeng (SM5 offers a possibility of utilizing them in mulberry cultivar improvement of Morus species of South Korea.
Self-similarities of periodic structures for a discrete model of a two-gene system
International Nuclear Information System (INIS)
Souza, S.L.T. de; Lima, A.A.; Caldas, I.L.; Medrano-T, R.O.; Guimarães-Filho, Z.O.
2012-01-01
We report self-similar properties of periodic structures remarkably organized in the two-parameter space for a two-gene system, described by two-dimensional symmetric map. The map consists of difference equations derived from the chemical reactions for gene expression and regulation. We characterize the system by using Lyapunov exponents and isoperiodic diagrams identifying periodic windows, denominated Arnold tongues and shrimp-shaped structures. Period-adding sequences are observed for both periodic windows. We also identify Fibonacci-type series and Golden ratio for Arnold tongues, and period multiple-of-three windows for shrimps. -- Highlights: ► The existence of noticeable periodic windows has been reported recently for several nonlinear systems. ► The periodic window distributions appear highly organized in two-parameter space. ► We characterize self-similar properties of Arnold tongues and shrimps for a two-gene model. ► We determine the period of the Arnold tongues recognizing a Fibonacci-type sequence. ► We explore self-similar features of the shrimps identifying multiple period-three structures.
Self-similarities of periodic structures for a discrete model of a two-gene system
Energy Technology Data Exchange (ETDEWEB)
Souza, S.L.T. de, E-mail: thomaz@ufsj.edu.br [Departamento de Física e Matemática, Universidade Federal de São João del-Rei, Ouro Branco, MG (Brazil); Lima, A.A. [Escola de Farmácia, Universidade Federal de Ouro Preto, Ouro Preto, MG (Brazil); Caldas, I.L. [Instituto de Física, Universidade de São Paulo, São Paulo, SP (Brazil); Medrano-T, R.O. [Departamento de Ciências Exatas e da Terra, Universidade Federal de São Paulo, Diadema, SP (Brazil); Guimarães-Filho, Z.O. [Aix-Marseille Univ., CNRS PIIM UMR6633, International Institute for Fusion Science, Marseille (France)
2012-03-12
We report self-similar properties of periodic structures remarkably organized in the two-parameter space for a two-gene system, described by two-dimensional symmetric map. The map consists of difference equations derived from the chemical reactions for gene expression and regulation. We characterize the system by using Lyapunov exponents and isoperiodic diagrams identifying periodic windows, denominated Arnold tongues and shrimp-shaped structures. Period-adding sequences are observed for both periodic windows. We also identify Fibonacci-type series and Golden ratio for Arnold tongues, and period multiple-of-three windows for shrimps. -- Highlights: ► The existence of noticeable periodic windows has been reported recently for several nonlinear systems. ► The periodic window distributions appear highly organized in two-parameter space. ► We characterize self-similar properties of Arnold tongues and shrimps for a two-gene model. ► We determine the period of the Arnold tongues recognizing a Fibonacci-type sequence. ► We explore self-similar features of the shrimps identifying multiple period-three structures.
Drescher, U; Koschate, J; Schiffer, T; Schneider, S; Hoffmann, U
2017-06-01
The aim of the study was to compare the kinetics responses of heart rate (HR), pulmonary (V˙O 2 pulm) and predicted muscular (V˙O 2 musc) oxygen uptake between two different pseudo-random binary sequence (PRBS) work rate (WR) amplitudes both below anaerobic threshold. Eight healthy individuals performed two PRBS WR protocols implying changes between 30W and 80W and between 30W and 110W. HR and V˙O 2 pulm were measured beat-to-beat and breath-by-breath, respectively. V˙O 2 musc was estimated applying the approach of Hoffmann et al. (Eur J Appl Physiol 113: 1745-1754, 2013) considering a circulatory model for venous return and cross-correlation functions (CCF) for the kinetics analysis. HR and V˙O 2 musc kinetics seem to be independent of WR intensity (p>0.05). V˙O 2 pulm kinetics show prominent differences in the lag of the CCF maximum (39±9s; 31±4s; p<0.05). A mean difference of 14W between the PRBS WR amplitudes impacts venous return significantly, while HR and V˙O 2 musc kinetics remain unchanged. Copyright © 2017 Elsevier B.V. All rights reserved.
Variable depth recursion algorithm for leaf sequencing
International Nuclear Information System (INIS)
Siochi, R. Alfredo C.
2007-01-01
The processes of extraction and sweep are basic segmentation steps that are used in leaf sequencing algorithms. A modified version of a commercial leaf sequencer changed the way that the extracts are selected and expanded the search space, but the modification maintained the basic search paradigm of evaluating multiple solutions, each one consisting of up to 12 extracts and a sweep sequence. While it generated the best solutions compared to other published algorithms, it used more computation time. A new, faster algorithm selects one extract at a time but calls itself as an evaluation function a user-specified number of times, after which it uses the bidirectional sweeping window algorithm as the final evaluation function. To achieve a performance comparable to that of the modified commercial leaf sequencer, 2-3 calls were needed, and in all test cases, there were only slight improvements beyond two calls. For the 13 clinical test maps, computation speeds improved by a factor between 12 and 43, depending on the constraints, namely the ability to interdigitate and the avoidance of the tongue-and-groove under dose. The new algorithm was compared to the original and modified versions of the commercial leaf sequencer. It was also compared to other published algorithms for 1400, random, 15x15, test maps with 3-16 intensity levels. In every single case the new algorithm provided the best solution
Theoretical and empirical convergence results for additive congruential random number generators
Wikramaratna, Roy S.
2010-03-01
Additive Congruential Random Number (ACORN) generators represent an approach to generating uniformly distributed pseudo-random numbers that is straightforward to implement efficiently for arbitrarily large order and modulus; if it is implemented using integer arithmetic, it becomes possible to generate identical sequences on any machine. This paper briefly reviews existing results concerning ACORN generators and relevant theory concerning sequences that are well distributed mod 1 in k dimensions. It then demonstrates some new theoretical results for ACORN generators implemented in integer arithmetic with modulus M=2[mu] showing that they are a family of generators that converge (in a sense that is defined in the paper) to being well distributed mod 1 in k dimensions, as [mu]=log2M tends to infinity. By increasing k, it is possible to increase without limit the number of dimensions in which the resulting sequences approximate to well distributed. The paper concludes by applying the standard TestU01 test suite to ACORN generators for selected values of the modulus (between 260 and 2150), the order (between 4 and 30) and various odd seed values. On the basis of these and earlier results, it is recommended that an order of at least 9 be used together with an odd seed and modulus equal to 230p, for a small integer value of p. While a choice of p=2 should be adequate for most typical applications, increasing p to 3 or 4 gives a sequence that will consistently pass all the tests in the TestU01 test suite, giving additional confidence in more demanding applications. The results demonstrate that the ACORN generators are a reliable source of uniformly distributed pseudo-random numbers, and that in practice (as suggested by the theoretical convergence results) the quality of the ACORN sequences increases with increasing modulus and order.
Multi-Period Trading via Convex Optimization
DEFF Research Database (Denmark)
Boyd, Stephen; Busseti, Enzo; Diamond, Steve
2017-01-01
We consider a basic model of multi-period trading, which can be used to evaluate the performance of a trading strategy. We describe a framework for single-period optimization, where the trades in each period are found by solving a convex optimization problem that trades oﬀ expected return, risk......, transaction cost and holding cost such as the borrowing cost for shorting assets. We then describe a multi-period version of the trading method, where optimization is used to plan a sequence of trades, with only the ﬁrst one executed, using estimates of future quantities that are unknown when the trades....... In this paper, we do not address a critical component in a trading algorithm, the predictions or forecasts of future quantities. The methods we describe in this paper can be thought of as good ways to exploit predictions, no matter how they are made. We have also developed a companion open-source software...
Wave propagation in one-dimensional solid-fluid quasi-periodic and aperiodic phononic crystals
Energy Technology Data Exchange (ETDEWEB)
Chen Ali, E-mail: alchen@bjtu.edu.cn [Institute of Engineering Mechanics, Beijing Jiaotong University, Beijing 100044 (China); Wang Yuesheng [Institute of Engineering Mechanics, Beijing Jiaotong University, Beijing 100044 (China); Zhang Chuanzeng [Department of Civil Engineering, University of Siegen, D-57068 Siegen (Germany)
2012-02-01
The propagation of the elastic waves in one-dimensional (1D) solid-fluid quasi-periodic phononic crystals is studied by employing the concept of the localization factor, which is calculated by the transfer matrix method. The solid-fluid interaction effect at the interfaces between the solid and the fluid components is considered. For comparison, the periodic systems and aperiodic Thue-Morse sequence are also analyzed in this paper. The splitting phenomenon of the pass bands and bandgaps are discussed for these 1D solid-fluid systems. At last the influences of the material impedance ratios on the band structures of the 1D solid-fluid quasi-periodic phononic crystals arranged as Fibonacci sequence are discussed.
Sequence complexity and work extraction
International Nuclear Information System (INIS)
Merhav, Neri
2015-01-01
We consider a simplified version of a solvable model by Mandal and Jarzynski, which constructively demonstrates the interplay between work extraction and the increase of the Shannon entropy of an information reservoir which is in contact with a physical system. We extend Mandal and Jarzynski’s main findings in several directions: first, we allow sequences of correlated bits rather than just independent bits. Secondly, at least for the case of binary information, we show that, in fact, the Shannon entropy is only one measure of complexity of the information that must increase in order for work to be extracted. The extracted work can also be upper bounded in terms of the increase in other quantities that measure complexity, like the predictability of future bits from past ones. Third, we provide an extension to the case of non-binary information (i.e. a larger alphabet), and finally, we extend the scope to the case where the incoming bits (before the interaction) form an individual sequence, rather than a random one. In this case, the entropy before the interaction can be replaced by the Lempel–Ziv (LZ) complexity of the incoming sequence, a fact that gives rise to an entropic meaning of the LZ complexity, not only in information theory, but also in physics. (paper)
Chaotic behavior of current-carrying plasmas in external periodic oscillations
Energy Technology Data Exchange (ETDEWEB)
Ohno, Noriyasu; Tanaka, Masayoshi; Komori, Akio; Kawai, Yoshinobu
1989-01-01
A set of cascading bifurcations and a chaotic state in the presence of an external periodic oscillation are experimentally investigated in a current-carrying plasma. The measured bifurcation sequence leading to chaos, which is controlled by changing plasma densities and the frequencies of external oscillations, is in qualitative agreement with a theory which describes anharmonic systems in periodic fields. (author).
Thudium, Karen; Gallo, Jorge; Bouillaud, Emmanuel; Sachs, Carolin; Eddy, Simantini; Cheung, Wing
2015-01-01
The mammalian target of rapamycin (mTOR) inhibitor everolimus has a well-established pharmacokinetics profile. We conducted a randomized, single-center, open-label, two-sequence, two-period crossover study of healthy volunteers to assess the relative bioavailability of everolimus administered as one 5 mg tablet or five 1 mg tablets. Subjects were randomized 1:1 to receive everolimus dosed as one 5 mg tablet or as five 1 mg tablets on day 1, followed by a washout period on days 8-14 and then the opposite formulation on day 15. Blood sampling for pharmacokinetic evaluation was performed at prespecified time points, with 17 samples taken for each treatment period. Primary variables for evaluation of relative bioavailability were area under the concentration-time curve from time zero to infinity (AUCinf) and maximum blood concentration (Cmax). Safety was assessed by reporting the incidence of adverse events (AEs). Twenty-two participants received everolimus as one 5 mg tablet followed by five 1 mg tablets (n=11) or the opposite sequence (n=11). The Cmax of five 1 mg tablets was 48% higher than that of one 5 mg tablet (geometric mean ratio, 1.48; 90% confidence interval [CI], 1.35-1.62). AUCinf was similar (geometric mean ratio, 1.08; 90% CI, 1.02-1.16), as were the extent of absorption and the distribution and elimination kinetics. AEs, all grade 1 or 2, were observed in 54.5% of subjects. Although the extent of absorption was similar, the Cmax of five 1 mg tablets was higher than that of one 5 mg tablet, suggesting these formulations lead to different peak blood concentrations and are not interchangeable at the dose tested.
Isolation and sequence analysis of a cDNA clone encoding the fifth complement component
DEFF Research Database (Denmark)
Lundwall, Åke B; Wetsel, Rick A; Kristensen, Torsten
1985-01-01
DNA clone of 1.85 kilobase pairs was isolated. Hybridization of the mixed-sequence probe to the complementary strand of the plasmid insert and sequence analysis by the dideoxy method predicted the expected protein sequence of C5a (positions 1-12), amino-terminal to the anticipated priming site. The sequence......, subcloned into M13 mp8, and sequenced at random by the dideoxy technique, thereby generating a contiguous sequence of 1703 base pairs. This clone contained coding sequence for the C-terminal 262 amino acid residues of the beta-chain, the entire C5a fragment, and the N-terminal 98 residues of the alpha......'-chain. The 3' end of the clone had a polyadenylated tail preceded by a polyadenylation recognition site, a 3'-untranslated region, and base pairs homologous to the human Alu concensus sequence. Comparison of the derived partial human C5 protein sequence with that previously determined for murine C3 and human...
Bordism, stable homotopy and adams spectral sequences
Kochman, Stanley O
1996-01-01
This book is a compilation of lecture notes that were prepared for the graduate course "Adams Spectral Sequences and Stable Homotopy Theory" given at The Fields Institute during the fall of 1995. The aim of this volume is to prepare students with a knowledge of elementary algebraic topology to study recent developments in stable homotopy theory, such as the nilpotence and periodicity theorems. Suitable as a text for an intermediate course in algebraic topology, this book provides a direct exposition of the basic concepts of bordism, characteristic classes, Adams spectral sequences, Brown-Peter
Pseudo-Random Number Generator Based on Coupled Map Lattices
Lü, Huaping; Wang, Shihong; Hu, Gang
A one-way coupled chaotic map lattice is used for generating pseudo-random numbers. It is shown that with suitable cooperative applications of both chaotic and conventional approaches, the output of the spatiotemporally chaotic system can easily meet the practical requirements of random numbers, i.e., excellent random statistical properties, long periodicity of computer realizations, and fast speed of random number generations. This pseudo-random number generator system can be used as ideal synchronous and self-synchronizing stream cipher systems for secure communications.
Fast random-number generation using a diode laser's frequency noise characteristic
Takamori, Hiroki; Doi, Kohei; Maehara, Shinya; Kawakami, Kohei; Sato, Takashi; Ohkawa, Masashi; Ohdaira, Yasuo
2012-02-01
Random numbers can be classified as either pseudo- or physical-random, in character. Pseudo-random numbers are generated by definite periodicity, so, their usefulness in cryptographic applications is somewhat limited. On the other hand, naturally-generated physical-random numbers have no calculable periodicity, thereby making them ideal for the task. Diode lasers' considerable wideband noise gives them tremendous capacity for generating physical-random numbers, at a high rate of speed. We measured a diode laser's output with a fast photo detector, and evaluated the binary-numbers from the diode laser's frequency noise characteristics. We then identified and evaluated the binary-number-line's statistical properties. We also investigate the possibility that much faster physical-random number parallel-generation is possible, using separate outputs of different optical-path length and character, which we refer to as "coherence collapse".
International Nuclear Information System (INIS)
Yeong, C.L.; Torquato, S.
1998-01-01
We formulate a procedure to reconstruct the structure of general random heterogeneous media from limited morphological information by extending the methodology of Rintoul and Torquato [J. Colloid Interface Sci. 186, 467 (1997)] developed for dispersions. The procedure has the advantages that it is simple to implement and generally applicable to multidimensional, multiphase, and anisotropic structures. Furthermore, an extremely useful feature is that it can incorporate any type and number of correlation functions in order to provide as much morphological information as is necessary for accurate reconstruction. We consider a variety of one- and two-dimensional reconstructions, including periodic and random arrays of rods, various distribution of disks, Debye random media, and a Fontainebleau sandstone sample. We also use our algorithm to construct heterogeneous media from specified hypothetical correlation functions, including an exponentially damped, oscillating function as well as physically unrealizable ones. copyright 1998 The American Physical Society
Applying Agrep to r-NSA to solve multiple sequences approximate matching.
Ni, Bing; Wong, Man-Hon; Lam, Chi-Fai David; Leung, Kwong-Sak
2014-01-01
This paper addresses the approximate matching problem in a database consisting of multiple DNA sequences, where the proposed approach applies Agrep to a new truncated suffix array, r-NSA. The construction time of the structure is linear to the database size, and the computations of indexing a substring in the structure are constant. The number of characters processed in applying Agrep is analysed theoretically, and the theoretical upper-bound can approximate closely the empirical number of characters, which is obtained through enumerating the characters in the actual structure built. Experiments are carried out using (synthetic) random DNA sequences, as well as (real) genome sequences including Hepatitis-B Virus and X-chromosome. Experimental results show that, compared to the straight-forward approach that applies Agrep to multiple sequences individually, the proposed approach solves the matching problem in much shorter time. The speed-up of our approach depends on the sequence patterns, and for highly similar homologous genome sequences, which are the common cases in real-life genomes, it can be up to several orders of magnitude.
Spreading Sequence Design and Theoretical Limits for Quasisynchronous CDMA Systems
Directory of Open Access Journals (Sweden)
Fan Pingzhi
2004-01-01
Full Text Available For various quasisynchronous (QS CDMA systems such as LAS-CDMA system which emerged recently, in order to reduce or eliminate the multiple access interference and multipath interference, it is required to design a set of spreading sequences which are mutually orthogonal within a designed shift zone, called orthogonal zone. For traditional orthogonal sequences, such as Walsh sequences and orthogonal Gold sequences, the orthogonality can only be achieved at the inphase point; in other words, the orthogonality is destroyed whenever there is a relative shift between the sequences, that is, their orthogonal zone is 0. In this paper, new concepts of generalized orthogonality (GO and generalized quasiorthogonality (GQO for spreading sequence design in both direct sequence (DS QS-CDMA systems and time/frequency hopping (TH/FH QS-CDMA systems are presented. Besides, selected GO/GQO sequence designs and general theoretical periodic and aperiodic limits, together with several applications in QS-CDMA systems, are also reviewed and analyzed.
Pesticide Residues, Results from the period 2004-2011
DEFF Research Database (Denmark)
Petersen, Annette; Jensen, Bodil Hamborg; Andersen, Jens Hinge
The present report presents the results from the 2004-2011 period of the monitoring programmes conducted by The Danish Veterinary and Food Administration. The programmes included commodities of fruit, vegetable, cereals and animal origin using random sampling from food on the Danish market. Since...... the beginning of the 1960, Denmark has monitored fruit and vegetables for pesticides residues. For the periods 1993-1997 and 1998-2003, results were collated and the dietary exposure was calculated. In this report data for the analyses carried out in the period 2004-2011 are reported as well as the exposure...
Chaos and periodicity in Vallis model for El Niño
International Nuclear Information System (INIS)
Borghezan, Monik; Rech, Paulo C.
2017-01-01
We investigate a two-dimensional parameter-space of a three-parameter, three-variable, continuous-time dynamical system, namely the Vallis model for El Niño phenomenon. We report on modifications in this parameter-space, as a function of the third parameter which is varied. More specifically we report on organization of chaos and periodicity, showing the existence of periodic structures embedded in a chaotic region, which are organized in period-adding sequences.
An extended sequence specificity for UV-induced DNA damage.
Chung, Long H; Murray, Vincent
2018-01-01
The sequence specificity of UV-induced DNA damage was determined with a higher precision and accuracy than previously reported. UV light induces two major damage adducts: cyclobutane pyrimidine dimers (CPDs) and pyrimidine(6-4)pyrimidone photoproducts (6-4PPs). Employing capillary electrophoresis with laser-induced fluorescence and taking advantages of the distinct properties of the CPDs and 6-4PPs, we studied the sequence specificity of UV-induced DNA damage in a purified DNA sequence using two approaches: end-labelling and a polymerase stop/linear amplification assay. A mitochondrial DNA sequence that contained a random nucleotide composition was employed as the target DNA sequence. With previous methodology, the UV sequence specificity was determined at a dinucleotide or trinucleotide level; however, in this paper, we have extended the UV sequence specificity to a hexanucleotide level. With the end-labelling technique (for 6-4PPs), the consensus sequence was found to be 5'-GCTC*AC (where C* is the breakage site); while with the linear amplification procedure, it was 5'-TCTT*AC. With end-labelling, the dinucleotide frequency of occurrence was highest for 5'-TC*, 5'-TT* and 5'-CC*; whereas it was 5'-TT* for linear amplification. The influence of neighbouring nucleotides on the degree of UV-induced DNA damage was also examined. The core sequences consisted of pyrimidine nucleotides 5'-CTC* and 5'-CTT* while an A at position "1" and C at position "2" enhanced UV-induced DNA damage. Crown Copyright © 2017. Published by Elsevier B.V. All rights reserved.
Periodic cluster mutations and related integrable maps
International Nuclear Information System (INIS)
Fordy, Allan P
2014-01-01
One of the remarkable properties of cluster algebras is that any cluster, obtained from a sequence of mutations from an initial cluster, can be written as a Laurent polynomial in the initial cluster (known as the ‘Laurent phenomenon’). There are many nonlinear recurrences which exhibit the Laurent phenomenon and thus unexpectedly generate integer sequences. The mutation of a typical quiver will not generate a recurrence, but rather an erratic sequence of exchange relations. How do we ‘design’ a quiver which gives rise to a given recurrence? A key role is played by the concept of ‘periodic cluster mutation’, introduced in 2009. Each recurrence corresponds to a finite dimensional map. In the context of cluster mutations, these are called ‘cluster maps’. What properties do cluster maps have? Are they integrable in some standard sense?In this review I describe how integrable maps arise in the context of cluster mutations. I first explain the concept of ‘periodic cluster mutation’, giving some classification results. I then give a review of what is meant by an integrable map and apply this to cluster maps. Two classes of integrable maps are related to interesting monodromy problems, which generate interesting Poisson algebras of functions, used to prove complete integrability and a linearization. A connection to the Hirota–Miwa equation is explained. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Cluster algebras in mathematical physics’. (review)
International Nuclear Information System (INIS)
Cerrada, Lucia; San Martin, Jesus
2011-01-01
In this Letter, it is shown that from a two region partition of the phase space of a one-dimensional dynamical system, a p-region partition can be obtained for the CRL...LR...R orbits. That is, permutations associated with symbolic sequences are obtained. As a consequence, the trajectory in phase space is directly deduced from permutation. From this permutation other permutations associated with period-doubling and saddle-node bifurcation cascades are derived, as well as other composite permutations. - Research highlights: → Symbolic sequences are the usual topological approach to dynamical systems. → Permutations bear more physical information than symbolic sequences. → Period-doubling cascade permutations associated with original sequences are obtained. → Saddle-node cascade permutations associated with original sequences are obtained. → Composite permutations are derived.
Hou, Qingzhen; De Geest, Paul F.G.; Vranken, Wim F.; Heringa, Jaap; Feenstra, K. Anton
2017-01-01
Motivation: Genome sequencing is producing an ever-increasing amount of associated protein sequences. Few of these sequences have experimentally validated annotations, however, and computational predictions are becoming increasingly successful in producing such annotations. One key challenge remains
Optimization of periodical interrogation of transducers of radioisotope measuring systems
International Nuclear Information System (INIS)
Ivashchenko, A.S.; Kaznakov, V.P.; Korolev, V.M.
1978-01-01
Certain methods are examined of optimizing periodic interrogation of sensors connected in a definite sequence to device for data processing in a system for controlling production processes. It is shown that in designing multiinput radioisotope measurement systems with a centralized data processing, the choice of the method of organizing periodic interrogation should be made with account for the conditions existing in each specific case
Efficient error correction for next-generation sequencing of viral amplicons.
Skums, Pavel; Dimitrova, Zoya; Campo, David S; Vaughan, Gilberto; Rossi, Livia; Forbi, Joseph C; Yokosawa, Jonny; Zelikovsky, Alex; Khudyakov, Yury
2012-06-25
Next-generation sequencing allows the analysis of an unprecedented number of viral sequence variants from infected patients, presenting a novel opportunity for understanding virus evolution, drug resistance and immune escape. However, sequencing in bulk is error prone. Thus, the generated data require error identification and correction. Most error-correction methods to date are not optimized for amplicon analysis and assume that the error rate is randomly distributed. Recent quality assessment of amplicon sequences obtained using 454-sequencing showed that the error rate is strongly linked to the presence and size of homopolymers, position in the sequence and length of the amplicon. All these parameters are strongly sequence specific and should be incorporated into the calibration of error-correction algorithms designed for amplicon sequencing. In this paper, we present two new efficient error correction algorithms optimized for viral amplicons: (i) k-mer-based error correction (KEC) and (ii) empirical frequency threshold (ET). Both were compared to a previously published clustering algorithm (SHORAH), in order to evaluate their relative performance on 24 experimental datasets obtained by 454-sequencing of amplicons with known sequences. All three algorithms show similar accuracy in finding true haplotypes. However, KEC and ET were significantly more efficient than SHORAH in removing false haplotypes and estimating the frequency of true ones. Both algorithms, KEC and ET, are highly suitable for rapid recovery of error-free haplotypes obtained by 454-sequencing of amplicons from heterogeneous viruses.The implementations of the algorithms and data sets used for their testing are available at: http://alan.cs.gsu.edu/NGS/?q=content/pyrosequencing-error-correction-algorithm.
Nonquadratic Variation of the Blum Blum Shub Pseudorandom Number Generator
2016-09-01
analyzes it for repetition and periodic behavior . Theoretically, in a random sequence , 95 percent of the values will not exceed T , where T is given by the...excursion of random walks within a sequence . A random walk can be defined in terms of a graph. First, this test changes all zeroes within the tested...Technology (NIST) tests. The original BBS is a quadratic generator that generates bits based on the output of squaring terms in a sequence . The first
Directory of Open Access Journals (Sweden)
Bogdan Gheorghe Munteanu
2013-01-01
Full Text Available Using the stochastic approximations, in this paper it was studiedthe convergence in distribution of the fractional parts of the sum of random variables to the truncated exponential distribution with parameter lambda. This fact is feasible by means of the Fourier-Stieltjes sequence (FSS of the random variable.
On the Periods of Biperiodic Fibonacci and Biperiodic Lucas Numbers
Directory of Open Access Journals (Sweden)
Dursun Tascı
2016-01-01
Full Text Available This paper is concerned with periods of Biperiodic Fibonacci and Biperiodic Lucas sequences taken as modulo prime and prime power. By using Fermat’s little theorem, quadratic reciprocity, many results are obtained.
Han, Ji Won; Son, Kyung Lak; Byun, Hye Jin; Ko, Ji Won; Kim, Kayoung; Hong, Jong Woo; Kim, Tae Hyun; Kim, Ki Woong
2017-06-06
Spaced retrieval training (SRT) is a nonpharmacological intervention for mild cognitive impairment (MCI) and dementia that trains the learning and retention of target information by recalling it over increasingly long intervals. We recently developed the Ubiquitous Spaced Retrieval-based Memory Advancement and Rehabilitation Training (USMART) program as a convenient, self-administered tablet-based SRT program. We also demonstrated the utility of USMART for improving memory in individuals with MCI through an open-label uncontrolled trial. This study had an open-label, single-blind, randomized, controlled, two-period crossover design. Fifty patients with MCI were randomized into USMART-usual care and usual care-USMART treatment sequences. USMART was completed or usual care was provided biweekly over a 4-week treatment period with a 2-week washout period between treatment periods. Primary outcome measures included the Word List Memory Test, Word List Recall Test (WLRT), and Word List Recognition Test. Outcomes were measured at baseline, week 5, and week 11 by raters who were blinded to intervention type. An intention-to-treat analysis and linear mixed modeling were used. Of 50 randomized participants, 41 completed the study (18% dropout rate). The USMART group had larger improvements in WLRT score (effect size = 0.49, p = 0.031) than the usual care group. There were no significant differences in other primary or secondary measures between the USMART and usual care groups. Moreover, no USMART-related adverse events were reported. The 4-week USMART modestly improved information retrieval in older people with MCI, and was well accepted with minimal technical support. ClinicalTrials.gov NCT01688128 . Registered 12 September 2012.
Doubly Periodic Traveling Waves in a Cellular Neural Network with Linear Reaction
Directory of Open Access Journals (Sweden)
Lin JianJhong
2009-01-01
Full Text Available Szekeley observed that the dynamic pattern of the locomotion of salamanders can be explained by periodic vector sequences generated by logical neural networks. Such sequences can mathematically be described by "doubly periodic traveling waves" and therefore it is of interest to propose dynamic models that may produce such waves. One such dynamic network model is built here based on reaction-diffusion principles and a complete discussion is given for the existence of doubly periodic waves as outputs. Since there are 2 parameters in our model and 4 a priori unknown parameters involved in our search of solutions, our results are nontrivial. The reaction term in our model is a linear function and hence our results can also be interpreted as existence criteria for solutions of a nontrivial linear problem depending on 6 parameters.
Six-term exact sequences for smooth generalized crossed products
DEFF Research Database (Denmark)
Gabriel, Olivier; Grensing, Martin
2013-01-01
We define smooth generalized crossed products and prove six-term exact sequences of Pimsner–Voiculescu type. This sequence may, in particular, be applied to smooth subalgebras of the quantum Heisenberg manifolds in order to compute the generators of their cyclic cohomology. Further, our results...... include the known results for smooth crossed products. Our proof is based on a combination of arguments from the setting of (Cuntz–)Pimsner algebras and the Toeplitz proof of Bott periodicity....
Deffains, Marc; Legallet, Eric; Apicella, Paul
2011-10-01
The capacity to acquire motor skills through repeated practice of a sequence of movements underlies many everyday activities. Extensive research in humans has dealt with the importance of spatial and temporal factors on motor sequence learning, standing in contrast to the few studies available in animals, particularly in nonhuman primates. In the present experiments, we studied the effect of the serial order of stimuli and associated movements in macaque monkeys overtrained to make arm-reaching movements in response to spatially distinct visual targets. Under different conditions, the temporal structure of the motor sequence was varied by changing the duration of the interval between successive target stimuli or by adding a cue that reliably signaled the onset time of the forthcoming target stimulus. In each condition, the extent to which the monkeys are sensitive to the spatial regularities was assessed by comparing performance when stimulus locations follow a repeating sequence, as opposed to a random sequence. We observed no improvement in task performance on repeated sequence blocks, compared to random sequence blocks, when target stimuli are relatively distant from each other in time. On the other hand, the shortening of the time interval between successive target stimuli or, more efficiently, the addition of a temporal cue before the target stimulus yielded a performance advantage under repeated sequence, reflected in a decrease in the latency of arm and saccadic eye movements accompanied by an increased tendency for eye movements to occur in an anticipatory manner. Contrary to the effects on movement initiation, the serial order of stimuli and movements did not markedly affect the execution of movement. Moreover, the location of a given target in the random sequence influenced task performance based on the location of the preceding target, monkeys being faster in responding as a result of familiarity caused by extensive practice with some target transitions
Exploring the correlations between sequence evolution rate and ...
Indian Academy of Sciences (India)
2012-10-15
Oct 15, 2012 ... The vast functional divergence within mammalian lineages that ... Keywords. Phylogenetics; molecular clock; sequence evolutionary rate; phenotypic evolution; morphology; genomics .... entire lineages during periods with ecosystem-level commu- ... increases from fish to amphibians to birds to mammals.
Rybalko, S.; Larionov, S.; Poptsova, M.; Loskutov, A.
2011-10-01
Large-scale dynamical properties of complete chromosome DNA sequences of eukaryotes are considered. Using the proposed deterministic models with intermittency and symbolic dynamics we describe a wide spectrum of large-scale patterns inherent in these sequences, such as segmental duplications, tandem repeats, and other complex sequence structures. It is shown that the recently discovered gene number balance on the strands is not of a random nature, and certain subsystems of a complete chromosome DNA sequence exhibit the properties of deterministic chaos.
Sampling problems for randomly broken sticks
Energy Technology Data Exchange (ETDEWEB)
Huillet, Thierry [Laboratoire de Physique Theorique et Modelisation, CNRS-UMR 8089 et Universite de Cergy-Pontoise, 5 mail Gay-Lussac, 95031, Neuville sur Oise (France)
2003-04-11
Consider the random partitioning model of a population (represented by a stick of length 1) into n species (fragments) with identically distributed random weights (sizes). Upon ranking the fragments' weights according to ascending sizes, let S{sub m:n} be the size of the mth smallest fragment. Assume that some observer is sampling such populations as follows: drop at random k points (the sample size) onto this stick and record the corresponding numbers of visited fragments. We shall investigate the following sampling problems: (1) what is the sample size if the sampling is carried out until the first visit of the smallest fragment (size S{sub 1:n})? (2) For a given sample size, have all the fragments of the stick been visited at least once or not? This question is related to Feller's random coupon collector problem. (3) In what order are new fragments being discovered and what is the random number of samples separating the discovery of consecutive new fragments until exhaustion of the list? For this problem, the distribution of the size-biased permutation of the species' weights, as the sequence of their weights in their order of appearance is needed and studied.
Singh, Bipin K; Pandey, Praveen C
2016-07-20
Engineering of thermally tunable terahertz photonic and omnidirectional bandgaps has been demonstrated theoretically in one-dimensional quasi-periodic photonic crystals (PCs) containing semiconductor and dielectric materials. The considered quasi-periodic structures are taken in the form of Fibonacci, Thue-Morse, and double periodic sequences. We have shown that the photonic and omnidirectional bandgaps in the quasi-periodic structures with semiconductor constituents are strongly depend on the temperature, thickness of the constituted semiconductor and dielectric material layers, and generations of the quasi-periodic sequences. It has been found that the number of photonic bandgaps increases with layer thickness and generation of the quasi-periodic sequences. Omnidirectional bandgaps in the structures have also been obtained. Results show that the bandwidths of photonic and omnidirectional bandgaps are tunable by changing the temperature and lattice parameters of the structures. The generation of quasi-periodic sequences can also change the properties of photonic and omnidirectional bandgaps remarkably. The frequency range of the photonic and omnidirectional bandgaps can be tuned by the change of temperature and layer thickness of the considered quasi-periodic structures. This work will be useful to design tunable terahertz PC devices.
Directory of Open Access Journals (Sweden)
Jenkins TM
2012-07-01
Full Text Available Tim M Jenkins, Trevor S Smart, Frances Hackman, Carol Cooke, Keith KC TanClinical Research, Pfizer Worldwide Research and Development, Sandwich, Kent, UKBackground: Detecting the efficacy of novel analgesic agents in neuropathic pain is challenging. There is a critical need for study designs with the desirable characteristics of assay sensitivity, low placebo response, reliable pain recordings, low cost, short duration of exposure to test drug and placebo, and relevant and recruitable population.Methods: We designed a proof-of-concept, double-blind, randomized, placebo-controlled, crossover study in patients with post-traumatic peripheral neuropathic pain (PTNP to evaluate whether such a study design had the potential to detect efficacious agents. Pregabalin, known to be efficacious in neuropathic pain, was used as the active analgesic. We also assessed physical activity throughout the study.Results: Twenty-five adults (20–70 years of age with PTNP for ≥3 months entered a screening week and were then randomized to one of the two following treatment sequences: (1 pregabalin followed by placebo or (2 placebo followed by pregabalin. These 2-week treatment periods were separated by a 2-week washout period. Patients on pregabalin treatment received escalating doses to a final dosage of 300 mg/day (days 5–15. In an attempt to minimize placebo response, patients received placebo treatment during the screening week and the 2-week washout period. Average daily pain scores (primary endpoint were significantly reduced for pregabalin versus placebo, with a mean treatment difference of -0.81 (95% confidence interval: -1.45 to -0.17; P = 0.015.Conclusion: The efficacy of pregabalin was similar to that identified in a large, parallel group trial in PTNP. Therefore, this efficient crossover study design has potential utility for future proof-of-concept studies in neuropathic pain.Keywords: pregabalin, post-traumatic peripheral neuropathic pain, randomized
Efficiency of random amplified polymorphic DNA (RAPD) and inter ...
African Journals Online (AJOL)
Efficiency of random amplified polymorphic DNA (RAPD) and inter-simple sequence repeats (ISSR) markers for genotype fingerprinting and genetic diversity studies in canola ( ) ... The number of amplified fragments with RAPD primers ranged from 8 to 21, with the size of amplicons ranging from 162 to 3154 bp.
Directory of Open Access Journals (Sweden)
Jason Trigg
Full Text Available The alpha-helical coiled coil can adopt a variety of topologies, among the most common of which are parallel and antiparallel dimers and trimers. We present Multicoil2, an algorithm that predicts both the location and oligomerization state (two versus three helices of coiled coils in protein sequences. Multicoil2 combines the pairwise correlations of the previous Multicoil method with the flexibility of Hidden Markov Models (HMMs in a Markov Random Field (MRF. The resulting algorithm integrates sequence features, including pairwise interactions, through multinomial logistic regression to devise an optimized scoring function for distinguishing dimer, trimer and non-coiled-coil oligomerization states; this scoring function is used to produce Markov Random Field potentials that incorporate pairwise correlations localized in sequence. Multicoil2 significantly improves both coiled-coil detection and dimer versus trimer state prediction over the original Multicoil algorithm retrained on a newly-constructed database of coiled-coil sequences. The new database, comprised of 2,105 sequences containing 124,088 residues, includes reliable structural annotations based on experimental data in the literature. Notably, the enhanced performance of Multicoil2 is evident when tested in stringent leave-family-out cross-validation on the new database, reflecting expected performance on challenging new prediction targets that have minimal sequence similarity to known coiled-coil families. The Multicoil2 program and training database are available for download from http://multicoil2.csail.mit.edu.
The genome sequence of pepper vein yellows virus (family Luteoviridae, genus Polerovirus)
Murakami, Ritsuko; Nakashima, Nobuhiko; Hinomoto, Norihide; Kawano, Shinji; Toyosato, Tetsuya
2011-01-01
The complete genome of pepper vein yellows virus (PeVYV) was sequenced using random amplification of RNA samples isolated from vector insects (Aphis gossypii) that had been given access to PeVYV-infected plants. The PeVYV genome consisted of 6244 nucleotides and had a genomic organization characteristic of members of the genus Polerovirus. PeVYV had highest amino acid sequence identities in ORF0 to ORF3 (75.9 - 91.9%) with tobacco vein distorting polerovirus, with which it was only 25.1% iden...
The genome sequence of pepper vein yellows virus (family Luteoviridae, genus Polerovirus).
Murakami, Ritsuko; Nakashima, Nobuhiko; Hinomoto, Norihide; Kawano, Shinji; Toyosato, Tetsuya
2011-05-01
The complete genome of pepper vein yellows virus (PeVYV) was sequenced using random amplification of RNA samples isolated from vector insects (Aphis gossypii) that had been given access to PeVYV-infected plants. The PeVYV genome consisted of 6244 nucleotides and had a genomic organization characteristic of members of the genus Polerovirus. PeVYV had highest amino acid sequence identities in ORF0 to ORF3 (75.9 - 91.9%) with tobacco vein distorting polerovirus, with which it was only 25.1% identical in ORF5. These sequence comparisons and previously studied biological properties indicate that PeVYV is a distinctly different virus and belongs to a new species of the genus Polerovirus.
Williams, Tyler D; Tolusso, Danilo V; Fedewa, Michael V; Esco, Michael R
2017-10-01
Periodization is a logical method of organizing training into sequential phases and cyclical time periods in order to increase the potential for achieving specific performance goals while minimizing the potential for overtraining. Periodized resistance training plans are proposed to be superior to non-periodized training plans for enhancing maximal strength. The primary aim of this study was to examine the previous literature comparing periodized resistance training plans to non-periodized resistance training plans and determine a quantitative estimate of effect on maximal strength. All studies included in the meta-analysis met the following inclusion criteria: (1) peer-reviewed publication; (2) published in English; (3) comparison of a periodized resistance training group to a non-periodized resistance training group; (4) maximal strength measured by 1-repetition maximum (1RM) squat, bench press, or leg press. Data were extracted and independently coded by two authors. Random-effects models were used to aggregate a mean effect size (ES), 95% confidence intervals (CIs) and potential moderators. The cumulative results of 81 effects gathered from 18 studies published between 1988 and 2015 indicated that the magnitude of improvement in 1RM following periodized resistance training was greater than non-periodized resistance training (ES = 0.43, 95% CI 0.27-0.58; P training status (β = -0.59; P = 0.0305), study length (β = 0.03; P = 0.0067), and training frequency (β = 0.46; P = 0.0123) were associated with a change in 1RM. These results indicate that undulating programs were more favorable for strength gains. Improvements in 1RM were greater among untrained participants. Additionally, higher training frequency and longer study length were associated with larger improvements in 1RM. These results suggest that periodized resistance training plans have a moderate effect on 1RM compared to non-periodized training plans. Variation in training stimuli
High-Throughput Mapping of Single-Neuron Projections by Sequencing of Barcoded RNA.
Kebschull, Justus M; Garcia da Silva, Pedro; Reid, Ashlan P; Peikon, Ian D; Albeanu, Dinu F; Zador, Anthony M
2016-09-07
Neurons transmit information to distant brain regions via long-range axonal projections. In the mouse, area-to-area connections have only been systematically mapped using bulk labeling techniques, which obscure the diverse projections of intermingled single neurons. Here we describe MAPseq (Multiplexed Analysis of Projections by Sequencing), a technique that can map the projections of thousands or even millions of single neurons by labeling large sets of neurons with random RNA sequences ("barcodes"). Axons are filled with barcode mRNA, each putative projection area is dissected, and the barcode mRNA is extracted and sequenced. Applying MAPseq to the locus coeruleus (LC), we find that individual LC neurons have preferred cortical targets. By recasting neuroanatomy, which is traditionally viewed as a problem of microscopy, as a problem of sequencing, MAPseq harnesses advances in sequencing technology to permit high-throughput interrogation of brain circuits. Copyright © 2016 Elsevier Inc. All rights reserved.
Nallaseth, Ferez Soli
The Y-chromosome presents a unique cytogenetic framework for the evolution of nucleotide sequences. Alignment of nine Y-chromosomal fragments in their increasing Y-specific/non Y-specific (male/female) sequence divergence ratios was directly and inversely related to their interspersion on these two respective genomic fractions. Sequence analysis confirmed a direct relationship between divergence ratios and the Alu, LINE-1, Satellite and their derivative oligonucleotide contents. Thus their relocation on the Y-chromosome is followed by sequence divergence rather than the well documented concerted evolution of these non-coding progenitor repeated sequences. Five of the nine Y-chromosomal fragments are non-pseudoautosomal and transcribed into heterogeneous PolyA^+ RNA and thus can be retrotransposed. Evolutionary and computer analysis identified homologous oligonucleotide tracts in several human loci suggesting common and random mechanistic origins. Dysgenic genomes represent the accelerated evolution driving sequence divergence (McClintock, 1984). Sex reversal and sterility characterizing dysgenesis occurs in C57BL/6JY ^{rm Pos} but not in 129/SvY^{rm Pos} derivative strains. High frequency, random, multi-locus deletion products of the feral Y^{ rm Pos}-chromosome are generated in the germlines of F1(C57BL/6J X 129/SvY^{ rm Pos})(male) and C57BL/6JY ^{rm Pos}(male) but not in 129/SvY^{rm Pos}(male). Equal, 10^{-1}, 10^ {-2}, and 0 copies (relative to males) of Y^{rm Pos}-specific deletion products respectively characterize C57BL/6JY ^{rm Pos} (HC), (LC), (T) and (F) females. The testes determining loci of inactive Y^{rm Pos}-chromosomes in C57BL/6JY^{rm Pos} HC females are the preferentially deleted/rearranged Y ^{rm Pos}-sequences. Disruption of regulation of plasma testosterone and hepatic MUP-A mRNA levels, TRD of a 4.7 Kbp EcoR1 fragment suggest disruption of autosomal/X-chromosomal sequences. These data and the highly repeated progenitor (Alu, GATA, LINE-1
Information-Theoretical Analysis of EEG Microstate Sequences in Python
Directory of Open Access Journals (Sweden)
Frederic von Wegner
2018-06-01
Full Text Available We present an open-source Python package to compute information-theoretical quantities for electroencephalographic data. Electroencephalography (EEG measures the electrical potential generated by the cerebral cortex and the set of spatial patterns projected by the brain's electrical potential on the scalp surface can be clustered into a set of representative maps called EEG microstates. Microstate time series are obtained by competitively fitting the microstate maps back into the EEG data set, i.e., by substituting the EEG data at a given time with the label of the microstate that has the highest similarity with the actual EEG topography. As microstate sequences consist of non-metric random variables, e.g., the letters A–D, we recently introduced information-theoretical measures to quantify these time series. In wakeful resting state EEG recordings, we found new characteristics of microstate sequences such as periodicities related to EEG frequency bands. The algorithms used are here provided as an open-source package and their use is explained in a tutorial style. The package is self-contained and the programming style is procedural, focusing on code intelligibility and easy portability. Using a sample EEG file, we demonstrate how to perform EEG microstate segmentation using the modified K-means approach, and how to compute and visualize the recently introduced information-theoretical tests and quantities. The time-lagged mutual information function is derived as a discrete symbolic alternative to the autocorrelation function for metric time series and confidence intervals are computed from Markov chain surrogate data. The software package provides an open-source extension to the existing implementations of the microstate transform and is specifically designed to analyze resting state EEG recordings.
Search for a perfect generator of random numbers
International Nuclear Information System (INIS)
Musyck, E.
1977-01-01
Theoretical tests have been carried out by COVEYOU and MAC PHERSON to verify the applications of the LEHMER algorithm. In a similar way, a theoretical method is proposed to evaluate in a rigorous way the random character of numbers generated by a shift register. This theory introduces the concept of ''degree of randomness'' of the elements, taken in a definite order, of a shift register. It permits making the judicious choice of the elements of the shift register which will produce the bits of the random numbers. On the other hand, a calculation method is developed in order to verify the primitive character of any shift register of high complexity. A new test, called ''slice test'', of empirical and theoretical use is also described; it constitutes a significant contribution to the understanding of certain properties of pseudo-random sequences. As a practical example, a random number generator structure formed with 32 bits, built out of a shift register with 61 elements and 60 modulo-2 adder circuits was made. The author is convinced that this generator can be considered to be practically perfect for all empirical applications of random numbers, particularly for the solution of Monte-Carlo problems. (author)
Duplex scanning using sparse data sequences
DEFF Research Database (Denmark)
Møllenbach, S. K.; Jensen, Jørgen Arendt
2008-01-01
reconstruction of the missing samples possible. The periodic pattern has the length T = M + A samples, where M are for B-mode and A for velocity estimation. The missing samples can now be reconstructed using a filter bank. One filter bank reconstructs one missing sample, so the number of filter banks corresponds...... to M. The number of sub filters in every filter bank is the same as A. Every sub filter contains fractional delay (FD) filter and an interpolation function. Many different sequences can be selected to adapt the B-mode frame rate needed. The drawback of the method is that the maximum velocity detectable......, the fprf and the resolution are 15 MHz, 3.5 kHz, and 12 bit sample (8 kHz and 16 bit for the Carotid artery). The resulting data contains 8000 RF lines with 128 samples at a depth of 45 mm for the vein and 50 mm for Aorta. Sparse sequences are constructed from the full data sequences to have both...
Walker, David Lee
1999-12-01
This study uses dynamical analysis to examine in a quantitative fashion the information coding mechanism in DNA sequences. This exceeds the simple dichotomy of either modeling the mechanism by comparing DNA sequence walks as Fractal Brownian Motion (fbm) processes. The 2-D mappings of the DNA sequences for this research are from Iterated Function System (IFS) (Also known as the ``Chaos Game Representation'' (CGR)) mappings of the DNA sequences. This technique converts a 1-D sequence into a 2-D representation that preserves subsequence structure and provides a visual representation. The second step of this analysis involves the application of Wavelet Packet Transforms, a recently developed technique from the field of signal processing. A multi-fractal model is built by using wavelet transforms to estimate the Hurst exponent, H. The Hurst exponent is a non-parametric measurement of the dynamism of a system. This procedure is used to evaluate gene- coding events in the DNA sequence of cystic fibrosis mutations. The H exponent is calculated for various mutation sites in this gene. The results of this study indicate the presence of anti-persistent, random walks and persistent ``sub-periods'' in the sequence. This indicates the hypothesis of a multi-fractal model of DNA information encoding warrants further consideration. This work examines the model's behavior in both pathological (mutations) and non-pathological (healthy) base pair sequences of the cystic fibrosis gene. These mutations both natural and synthetic were introduced by computer manipulation of the original base pair text files. The results show that disease severity and system ``information dynamics'' correlate. These results have implications for genetic engineering as well as in mathematical biology. They suggest that there is scope for more multi-fractal models to be developed.
Random Generators and Normal Numbers
Bailey, David H.; Crandall, Richard E.
2002-01-01
Pursuant to the authors' previous chaotic-dynamical model for random digits of fundamental constants, we investigate a complementary, statistical picture in which pseudorandom number generators (PRNGs) are central. Some rigorous results are achieved: We establish b-normality for constants of the form $\\sum_i 1/(b^{m_i} c^{n_i})$ for certain sequences $(m_i), (n_i)$ of integers. This work unifies and extends previously known classes of explicit normals. We prove that for coprime $b,c>1$ the...
A random walk description of individual animal movement accounting for periods of rest
Tilles, Paulo F. C.; Petrovskii, Sergei V.; Natti, Paulo L.
2016-11-01
Animals do not move all the time but alternate the period of actual movement (foraging) with periods of rest (e.g. eating or sleeping). Although the existence of rest times is widely acknowledged in the literature and has even become a focus of increased attention recently, the theoretical approaches to describe animal movement by calculating the dispersal kernel and/or the mean squared displacement (MSD) rarely take rests into account. In this study, we aim to bridge this gap. We consider a composite stochastic process where the periods of active dispersal or `bouts' (described by a certain baseline probability density function (pdf) of animal dispersal) alternate with periods of immobility. For this process, we derive a general equation that determines the pdf of this composite movement. The equation is analysed in detail in two special but important cases such as the standard Brownian motion described by a Gaussian kernel and the Levy flight described by a Cauchy distribution. For the Brownian motion, we show that in the large-time asymptotics the effect of rests results in a rescaling of the diffusion coefficient. The movement occurs as a subdiffusive transition between the two diffusive asymptotics. Interestingly, the Levy flight case shows similar properties, which indicates a certain universality of our findings.
Gene Expression Profiling in the Pituitary Gland of Laying Period and Ceased Period Huoyan Geese
Directory of Open Access Journals (Sweden)
Xinhong Luan
2013-07-01
Full Text Available Huoyan goose is a Chinese local breed famous for its higher laying performance, but the problems of variety degeneration have emerged recently, especially a decrease in the number of eggs laid. In order to better understand the molecular mechanism that underlies egg laying in Huoyan geese, gene profiles in the pituitary gland of Huoyan geese taken during the laying period and ceased period were investigated using the suppression subtractive hybridization (SSH method. Total RNA was extracted from pituitary glands of ceased period and laying period geese. The cDNA in the pituitary glands of ceased geese was subtracted from the cDNA in the pituitary glands of laying geese (forward subtraction; the reverse subtraction was also performed. After sequencing and annotation, a total of 30 and 24 up and down-regulated genes were obtained from the forward and reverse SSH libraries, respectively. These genes mostly related to biosynthetic process, cellular nitrogen compound metabolic process, transport, cell differentiation, cellular protein modification process, signal transduction, small molecule metabolic process. Furthermore, eleven genes were selected for further analyses by quantitative real-time PCR (qRT-PCR. The qRT-PCR results for the most part were consistent with the SSH results. Among these genes, Synaptotagmin-1 (SYT1 and Stathmin-2 (STMN2 were substantially over-expressed in laying period compared to ceased period. These results could serve as an important reference for elucidating the molecular mechanism of higher laying performance in Huoyan geese.
Directory of Open Access Journals (Sweden)
Bingshan Li
2009-05-01
Full Text Available There is strong evidence that rare variants are involved in complex disease etiology. The first step in implicating rare variants in disease etiology is their identification through sequencing in both randomly ascertained samples (e.g., the 1,000 Genomes Project and samples ascertained according to disease status. We investigated to what extent rare variants will be observed across the genome and in candidate genes in randomly ascertained samples, the magnitude of variant enrichment in diseased individuals, and biases that can occur due to how variants are discovered. Although sequencing cases can enrich for casual variants, when a gene or genes are not involved in disease etiology, limiting variant discovery to cases can lead to association studies with dramatically inflated false positive rates.
On the expected duration of a search for a fixed pattern in random data
DEFF Research Database (Denmark)
Nielsen, Peter Tolstrup
1973-01-01
An expression is obtained for the expected duration of a search to find a givenL-ary sequence in a semi-infinite stream of randomL-ary data. The search time is found to be an increasing function of the lengths of the "bifices" of the pattern, where the term bifix denotes a sequence which is both...
Analysis of long-range correlation in sequences data of proteins
Directory of Open Access Journals (Sweden)
ADRIANA ISVORAN
2007-04-01
Full Text Available The results presented here suggest the existence of correlations in the sequence data of proteins. 32 proteins, both globular and fibrous, both monomeric and polymeric, were analyzed. The primary structures of these proteins were treated as time series. Three spatial series of data for each sequence of a protein were generated from numerical correspondences between each amino acid and a physical property associated with it, i.e., its electric charge, its polar character and its dipole moment. For each series, the spectral coefficient, the scaling exponent and the Hurst coefficient were determined. The values obtained for these coefficients revealed non-randomness in the series of data.
Exploring pseudo- and chaotic random Monte Carlo simulations
Blais, J. A. Rod; Zhang, Zhan
2011-07-01
Computer simulations are an increasingly important area of geoscience research and development. At the core of stochastic or Monte Carlo simulations are the random number sequences that are assumed to be distributed with specific characteristics. Computer-generated random numbers, uniformly distributed on (0, 1), can be very different depending on the selection of pseudo-random number (PRN) or chaotic random number (CRN) generators. In the evaluation of some definite integrals, the resulting error variances can even be of different orders of magnitude. Furthermore, practical techniques for variance reduction such as importance sampling and stratified sampling can be applied in most Monte Carlo simulations and significantly improve the results. A comparative analysis of these strategies has been carried out for computational applications in planar and spatial contexts. Based on these experiments, and on some practical examples of geodetic direct and inverse problems, conclusions and recommendations concerning their performance and general applicability are included.
A generative Bezier curve model for surf-zone tracking in coastal image sequences
CSIR Research Space (South Africa)
Burke, Michael G
2017-09-01
Full Text Available This work introduces a generative Bezier curve model suitable for surf-zone curve tracking in coastal image sequences. The model combines an adaptive curve parametrised by control points governed by local random walks with a global sinusoidal motion...
Using random forests for assistance in the curation of G-protein coupled receptor databases.
Shkurin, Aleksei; Vellido, Alfredo
2017-08-18
Biology is experiencing a gradual but fast transformation from a laboratory-centred science towards a data-centred one. As such, it requires robust data engineering and the use of quantitative data analysis methods as part of database curation. This paper focuses on G protein-coupled receptors, a large and heterogeneous super-family of cell membrane proteins of interest to biology in general. One of its families, Class C, is of particular interest to pharmacology and drug design. This family is quite heterogeneous on its own, and the discrimination of its several sub-families is a challenging problem. In the absence of known crystal structure, such discrimination must rely on their primary amino acid sequences. We are interested not as much in achieving maximum sub-family discrimination accuracy using quantitative methods, but in exploring sequence misclassification behavior. Specifically, we are interested in isolating those sequences showing consistent misclassification, that is, sequences that are very often misclassified and almost always to the same wrong sub-family. Random forests are used for this analysis due to their ensemble nature, which makes them naturally suited to gauge the consistency of misclassification. This consistency is here defined through the voting scheme of their base tree classifiers. Detailed consistency results for the random forest ensemble classification were obtained for all receptors and for all data transformations of their unaligned primary sequences. Shortlists of the most consistently misclassified receptors for each subfamily and transformation, as well as an overall shortlist including those cases that were consistently misclassified across transformations, were obtained. The latter should be referred to experts for further investigation as a data curation task. The automatic discrimination of the Class C sub-families of G protein-coupled receptors from their unaligned primary sequences shows clear limits. This study has
Sequence charge decoration dictates coil-globule transition in intrinsically disordered proteins.
Firman, Taylor; Ghosh, Kingshuk
2018-03-28
We present an analytical theory to compute conformations of heteropolymers-applicable to describe disordered proteins-as a function of temperature and charge sequence. The theory describes coil-globule transition for a given protein sequence when temperature is varied and has been benchmarked against the all-atom Monte Carlo simulation (using CAMPARI) of intrinsically disordered proteins (IDPs). In addition, the model quantitatively shows how subtle alterations of charge placement in the primary sequence-while maintaining the same charge composition-can lead to significant changes in conformation, even as drastic as a coil (swelled above a purely random coil) to globule (collapsed below a random coil) and vice versa. The theory provides insights on how to control (enhance or suppress) these changes by tuning the temperature (or solution condition) and charge decoration. As an application, we predict the distribution of conformations (at room temperature) of all naturally occurring IDPs in the DisProt database and notice significant size variation even among IDPs with a similar composition of positive and negative charges. Based on this, we provide a new diagram-of-states delineating the sequence-conformation relation for proteins in the DisProt database. Next, we study the effect of post-translational modification, e.g., phosphorylation, on IDP conformations. Modifications as little as two-site phosphorylation can significantly alter the size of an IDP with everything else being constant (temperature, salt concentration, etc.). However, not all possible modification sites have the same effect on protein conformations; there are certain "hot spots" that can cause maximal change in conformation. The location of these "hot spots" in the parent sequence can readily be identified by using a sequence charge decoration metric originally introduced by Sawle and Ghosh. The ability of our model to predict conformations (both expanded and collapsed states) of IDPs at a high
Importance sampling of heavy-tailed iterated random functions
B. Chen (Bohan); C.H. Rhee (Chang-Han); A.P. Zwart (Bert)
2016-01-01
textabstractWe consider a stochastic recurrence equation of the form $Z_{n+1} = A_{n+1} Z_n+B_{n+1}$, where $\\mathbb{E}[\\log A_1]<0$, $\\mathbb{E}[\\log^+ B_1]<\\infty$ and $\\{(A_n,B_n)\\}_{n\\in\\mathbb{N}}$ is an i.i.d. sequence of positive random vectors. The stationary distribution of this Markov
About the cumulants of periodic signals
Barrau, Axel; El Badaoui, Mohammed
2018-01-01
This note studies cumulants of time series. These functions originating from the probability theory being commonly used as features of deterministic signals, their classical properties are examined in this modified framework. We show additivity of cumulants, ensured in the case of independent random variables, requires here a different hypothesis. Practical applications are proposed, in particular an analysis of the failure of the JADE algorithm to separate some specific periodic signals.
Kuznetsova, Olga M; Tymofyeyev, Yevgen
2014-04-30
In open-label studies, partial predictability of permuted block randomization provides potential for selection bias. To lessen the selection bias in two-arm studies with equal allocation, a number of allocation procedures that limit the imbalance in treatment totals at a pre-specified level but do not require the exact balance at the ends of the blocks were developed. In studies with unequal allocation, however, the task of designing a randomization procedure that sets a pre-specified limit on imbalance in group totals is not resolved. Existing allocation procedures either do not preserve the allocation ratio at every allocation or do not include all allocation sequences that comply with the pre-specified imbalance threshold. Kuznetsova and Tymofyeyev described the brick tunnel randomization for studies with unequal allocation that preserves the allocation ratio at every step and, in the two-arm case, includes all sequences that satisfy the smallest possible imbalance threshold. This article introduces wide brick tunnel randomization for studies with unequal allocation that allows all allocation sequences with imbalance not exceeding any pre-specified threshold while preserving the allocation ratio at every step. In open-label studies, allowing a larger imbalance in treatment totals lowers selection bias because of the predictability of treatment assignments. The applications of the technique in two-arm and multi-arm open-label studies with unequal allocation are described. Copyright © 2013 John Wiley & Sons, Ltd.
Biesecker, Barbara B; Lewis, Katie L; Umstead, Kendall L; Johnston, Jennifer J; Turbitt, Erin; Fishler, Kristen P; Patton, John H; Miller, Ilana M; Heidlebaugh, Alexis R; Biesecker, Leslie G
2018-03-01
A critical bottleneck in clinical genomics is the mismatch between large volumes of results and the availability of knowledgeable professionals to return them. To test whether a web-based platform is noninferior to a genetic counselor for educating patients about their carrier results from exome sequencing. A randomized noninferiority trial conducted in a longitudinal sequencing cohort at the National Institutes of Health from February 5, 2014, to December 16, 2016, was used to compare the web-based platform with a genetic counselor. Among the 571 eligible participants, 1 to 7 heterozygous variants were identified in genes that cause a phenotype that is recessively inherited. Surveys were administered after cohort enrollment, immediately following trial education, and 1 month and 6 months later to primarily healthy postreproductive participants who expressed interest in learning their carrier results. Both intention-to-treat and per-protocol analyses were applied. A web-based platform that integrated education on carrier results with personal test results was designed to directly parallel disclosure education by a genetic counselor. The sessions took a mean (SD) time of 21 (10.6), and 27 (9.3) minutes, respectively. The primary outcomes and noninferiority margins (δNI) were knowledge (0 to 8, δNI = -1), test-specific distress (0 to 30, δNI = +1), and decisional conflict (15 to 75, δNI = +6). After 462 participants (80.9%) provided consent and were randomized, all but 3 participants (n = 459) completed surveys following education and counseling; 398 (86.1%) completed 1-month surveys and 392 (84.8%) completed 6-month surveys. Participants were predominantly well-educated, non-Hispanic white, married parents; mean (SD) age was 63 (63.1) years and 246 (53.6%) were men. The web platform was noninferior to the genetic counselor on outcomes assessed at 1 and 6 months: knowledge (mean group difference, -0.18; lower limit of 97.5% CI, -0.63;
Replacement and inspection policies for products with random life cycle
International Nuclear Information System (INIS)
Yun, Won Young; Nakagawa, Toshio
2010-01-01
In this paper, we consider maintenance policies for products in which the economical life cycle of products is a random variable. First, we study a periodic replacement policy with minimal repair. The system is minimally repaired at failure and is replaced by new one at age T (periodic replacement policy with minimal repair of Barlow and Hunter). The expected present value of total maintenance cost of products with random life cycle is obtained and the optimal replacement interval minimizing the cost is found. Second, we consider an inspection policy for products with random life cycle to detect the system failure. The expected total cost is obtained and the optimal inspection interval is found. Numerical examples are also included.
Population genetic analysis of shotgun assemblies of genomic sequences from multiple individuals
DEFF Research Database (Denmark)
Hellmann, Ines; Mang, Yuan; Gu, Zhiping
2008-01-01
We introduce a simple, broadly applicable method for obtaining estimates of nucleotide diversity from genomic shotgun sequencing data. The method takes into account the special nature of these data: random sampling of genomic segments from one or more individuals and a relatively high error rate...... for individual reads. Applying this method to data from the Celera human genome sequencing and SNP discovery project, we obtain estimates of nucleotide diversity in windows spanning the human genome and show that the diversity to divergence ratio is reduced in regions of low recombination. Furthermore, we show...
Period doubling in a model of magnetoconvection with Ohmic heating
International Nuclear Information System (INIS)
Osman, M. B. H.
2000-01-01
In this work it has been studied an idealized model of rotating nonlinear magneto convection to investigate the effects of Ohmic heating. In the over stable region it was found that Ohmic heating can lead to a period-doubling sequence
A random forest classifier for detecting rare variants in NGS data from viral populations
Directory of Open Access Journals (Sweden)
Raunaq Malhotra
Full Text Available We propose a random forest classifier for detecting rare variants from sequencing errors in Next Generation Sequencing (NGS data from viral populations. The method utilizes counts of varying length of k-mers from the reads of a viral population to train a Random forest classifier, called MultiRes, that classifies k-mers as erroneous or rare variants. Our algorithm is rooted in concepts from signal processing and uses a frame-based representation of k-mers. Frames are sets of non-orthogonal basis functions that were traditionally used in signal processing for noise removal. We define discrete spatial signals for genomes and sequenced reads, and show that k-mers of a given size constitute a frame.We evaluate MultiRes on simulated and real viral population datasets, which consist of many low frequency variants, and compare it to the error detection methods used in correction tools known in the literature. MultiRes has 4 to 500 times less false positives k-mer predictions compared to other methods, essential for accurate estimation of viral population diversity and their de-novo assembly. It has high recall of the true k-mers, comparable to other error correction methods. MultiRes also has greater than 95% recall for detecting single nucleotide polymorphisms (SNPs and fewer false positive SNPs, while detecting higher number of rare variants compared to other variant calling methods for viral populations. The software is available freely from the GitHub link https://github.com/raunaq-m/MultiRes. Keywords: Sequencing error detection, Reference free methods, Next-generation sequencing, Viral populations, Multi-resolution frames, Random forest classifier
Using TESS to predict transcription factor binding sites in DNA sequence.
Schug, Jonathan
2008-03-01
This unit describes how to use the Transcription Element Search System (TESS). This Web site predicts transcription factor binding sites (TFBS) in DNA sequence using two different kinds of models of sites, strings and positional weight matrices. The binding of transcription factors to DNA is a major part of the control of gene expression. Transcription factors exhibit sequence-specific binding; they form stronger bonds to some DNA sequences than to others. Identification of a good binding site in the promoter for a gene suggests the possibility that the corresponding factor may play a role in the regulation of that gene. However, the sequences transcription factors recognize are typically short and allow for some amount of mismatch. Because of this, binding sites for a factor can typically be found at random every few hundred to a thousand base pairs. TESS has features to help sort through and evaluate the significance of predicted sites.
DEFF Research Database (Denmark)
Larsen, P B; Hansen, E G; Jacobsen, L S
2005-01-01
Background and objective: Previous studies mainly conducted on elective patients recommend doses of 0.9-1.2 mg kg[-1] rocuronium to obtain comparable intubation conditions with succinylcholine 1.0 mg kg[-1] after 60 s during a rapid-sequence induction. We decided to compare the overall intubating...... conditions of standard doses of rocuronium 0.6 mg kg[-1] and succinylcholine 1.0 mg kg[-1] during a strict rapid-sequence induction regimen including propofol and alfentanil. Methods: Male and female patients (ASA I-III) older than 17 yr scheduled for emergency abdominal or gynaecological surgery...... and with increased risk of pulmonary aspiration of gastric content were randomized to a rapid-sequence induction with succinylcholine 1.0 mg kg[-1] or rocuronium 0.6 mg kg[-1]. Patients with a predicted difficult airway were excluded. A senior anaesthesiologist 'blinded' for the randomization performed...
Accurate and fast methods to estimate the population mutation rate from error prone sequences
Directory of Open Access Journals (Sweden)
Miyamoto Michael M
2009-08-01
Full Text Available Abstract Background The population mutation rate (θ remains one of the most fundamental parameters in genetics, ecology, and evolutionary biology. However, its accurate estimation can be seriously compromised when working with error prone data such as expressed sequence tags, low coverage draft sequences, and other such unfinished products. This study is premised on the simple idea that a random sequence error due to a chance accident during data collection or recording will be distributed within a population dataset as a singleton (i.e., as a polymorphic site where one sampled sequence exhibits a unique base relative to the common nucleotide of the others. Thus, one can avoid these random errors by ignoring the singletons within a dataset. Results This strategy is implemented under an infinite sites model that focuses on only the internal branches of the sample genealogy where a shared polymorphism can arise (i.e., a variable site where each alternative base is represented by at least two sequences. This approach is first used to derive independently the same new Watterson and Tajima estimators of θ, as recently reported by Achaz 1 for error prone sequences. It is then used to modify the recent, full, maximum-likelihood model of Knudsen and Miyamoto 2, which incorporates various factors for experimental error and design with those for coalescence and mutation. These new methods are all accurate and fast according to evolutionary simulations and analyses of a real complex population dataset for the California seahare. Conclusion In light of these results, we recommend the use of these three new methods for the determination of θ from error prone sequences. In particular, we advocate the new maximum likelihood model as a starting point for the further development of more complex coalescent/mutation models that also account for experimental error and design.
Using hidden Markov models to align multiple sequences.
Mount, David W
2009-07-01
A hidden Markov model (HMM) is a probabilistic model of a multiple sequence alignment (msa) of proteins. In the model, each column of symbols in the alignment is represented by a frequency distribution of the symbols (called a "state"), and insertions and deletions are represented by other states. One moves through the model along a particular path from state to state in a Markov chain (i.e., random choice of next move), trying to match a given sequence. The next matching symbol is chosen from each state, recording its probability (frequency) and also the probability of going to that state from a previous one (the transition probability). State and transition probabilities are multiplied to obtain a probability of the given sequence. The hidden nature of the HMM is due to the lack of information about the value of a specific state, which is instead represented by a probability distribution over all possible values. This article discusses the advantages and disadvantages of HMMs in msa and presents algorithms for calculating an HMM and the conditions for producing the best HMM.
Random matrix approach to cross correlations in financial data
Plerou, Vasiliki; Gopikrishnan, Parameswaran; Rosenow, Bernd; Amaral, Luís A.; Guhr, Thomas; Stanley, H. Eugene
2002-06-01
We analyze cross correlations between price fluctuations of different stocks using methods of random matrix theory (RMT). Using two large databases, we calculate cross-correlation matrices C of returns constructed from (i) 30-min returns of 1000 US stocks for the 2-yr period 1994-1995, (ii) 30-min returns of 881 US stocks for the 2-yr period 1996-1997, and (iii) 1-day returns of 422 US stocks for the 35-yr period 1962-1996. We test the statistics of the eigenvalues λi of C against a ``null hypothesis'' - a random correlation matrix constructed from mutually uncorrelated time series. We find that a majority of the eigenvalues of C fall within the RMT bounds [λ-,λ+] for the eigenvalues of random correlation matrices. We test the eigenvalues of C within the RMT bound for universal properties of random matrices and find good agreement with the results for the Gaussian orthogonal ensemble of random matrices-implying a large degree of randomness in the measured cross-correlation coefficients. Further, we find that the distribution of eigenvector components for the eigenvectors corresponding to the eigenvalues outside the RMT bound display systematic deviations from the RMT prediction. In addition, we find that these ``deviating eigenvectors'' are stable in time. We analyze the components of the deviating eigenvectors and find that the largest eigenvalue corresponds to an influence common to all stocks. Our analysis of the remaining deviating eigenvectors shows distinct groups, whose identities correspond to conventionally identified business sectors. Finally, we discuss applications to the construction of portfolios of stocks that have a stable ratio of risk to return.
Yaari, Gur; Eisenmann, Shmuel
2011-01-01
The long lasting debate initiated by Gilovich, Vallone and Tversky in [Formula: see text] is revisited: does a "hot hand" phenomenon exist in sports? Hereby we come back to one of the cases analyzed by the original study, but with a much larger data set: all free throws taken during five regular seasons ([Formula: see text]) of the National Basketball Association (NBA). Evidence supporting the existence of the "hot hand" phenomenon is provided. However, while statistical traces of this phenomenon are observed in the data, an open question still remains: are these non random patterns a result of "success breeds success" and "failure breeds failure" mechanisms or simply "better" and "worse" periods? Although free throws data is not adequate to answer this question in a definite way, we speculate based on it, that the latter is the dominant cause behind the appearance of the "hot hand" phenomenon in the data.
Progress in methodology for probabilistic assessment of accidents: timing of accident sequences
International Nuclear Information System (INIS)
Lanore, J.M.; Villeroux, C.; Bouscatie, F.; Maigret, N.
1981-09-01
There is an important problem for probabilistic studies of accident sequences using the current event tree techniques. Indeed this method does not take into account the dependence in time of the real accident scenarios, involving the random behaviour of the systems (lack or delay in intervention, partial failures, repair, operator actions ...) and the correlated evolution of the physical parameters. A powerful method to perform the probabilistic treatment of these complex sequences (dynamic evolution of systems and associated physics) is Monte-Carlo simulation, very rare events being treated with the help of suitable weighting and biasing techniques. As a practical example the accident sequences related to the loss of the residual heat removal system in a fast breeder reactor has been treated with that method
The genesis of period-adding bursting without bursting-chaos in the Chay model
International Nuclear Information System (INIS)
Yang Zhuoqin; Lu Qishao; Li Li
2006-01-01
According to the period-adding firing patterns without chaos observed in neuronal experiments, the genesis of the period-adding 'fold/homoclinic' bursting sequence without bursting-chaos is explored by numerical simulation, fast/slow dynamics and bifurcation analysis of limit cycle in the neuronal Chay model. It is found that each periodic bursting, from period-1 to 7, is separately generated by the corresponding periodic spiking pattern through two period-doubling bifurcations, except for the period-1 bursting occurring via a Hopf bifurcation. Consequently, it can be revealed that this period-adding bursting bifurcation without chaos has a compound bifurcation structure with transitions from spiking to bursting, which is closely related to period-doubling bifurcations of periodic spiking in essence
Directory of Open Access Journals (Sweden)
Qunying Wu
2017-05-01
Full Text Available Abstract In this paper, we study the equivalent conditions of complete moment convergence for sequences of identically distributed extended negatively dependent random variables. As a result, we extend and generalize some results of complete moment convergence obtained by Chow (Bull. Inst. Math. Acad. Sin. 16:177-201, 1988 and Li and Spătaru (J. Theor. Probab. 18:933-947, 2005 from the i.i.d. case to extended negatively dependent sequences.
Directory of Open Access Journals (Sweden)
Humam Saltaji
Full Text Available To examine the risks of bias, risks of random errors, reporting quality, and methodological quality of randomized clinical trials of oral health interventions and the development of these aspects over time.We included 540 randomized clinical trials from 64 selected systematic reviews. We extracted, in duplicate, details from each of the selected randomized clinical trials with respect to publication and trial characteristics, reporting and methodologic characteristics, and Cochrane risk of bias domains. We analyzed data using logistic regression and Chi-square statistics.Sequence generation was assessed to be inadequate (at unclear or high risk of bias in 68% (n = 367 of the trials, while allocation concealment was inadequate in the majority of trials (n = 464; 85.9%. Blinding of participants and blinding of the outcome assessment were judged to be inadequate in 28.5% (n = 154 and 40.5% (n = 219 of the trials, respectively. A sample size calculation before the initiation of the study was not performed/reported in 79.1% (n = 427 of the trials, while the sample size was assessed as adequate in only 17.6% (n = 95 of the trials. Two thirds of the trials were not described as double blinded (n = 358; 66.3%, while the method of blinding was appropriate in 53% (n = 286 of the trials. We identified a significant decrease over time (1955-2013 in the proportion of trials assessed as having inadequately addressed methodological quality items (P < 0.05 in 30 out of the 40 quality criteria, or as being inadequate (at high or unclear risk of bias in five domains of the Cochrane risk of bias tool: sequence generation, allocation concealment, incomplete outcome data, other sources of bias, and overall risk of bias.The risks of bias, risks of random errors, reporting quality, and methodological quality of randomized clinical trials of oral health interventions have improved over time; however, further efforts that contribute to the development of more stringent
Stochastic space interval as a link between quantum randomness and macroscopic randomness?
Haug, Espen Gaarder; Hoff, Harald
2018-03-01
For many stochastic phenomena, we observe statistical distributions that have fat-tails and high-peaks compared to the Gaussian distribution. In this paper, we will explain how observable statistical distributions in the macroscopic world could be related to the randomness in the subatomic world. We show that fat-tailed (leptokurtic) phenomena in our everyday macroscopic world are ultimately rooted in Gaussian - or very close to Gaussian-distributed subatomic particle randomness, but they are not, in a strict sense, Gaussian distributions. By running a truly random experiment over a three and a half-year period, we observed a type of random behavior in trillions of photons. Combining our results with simple logic, we find that fat-tailed and high-peaked statistical distributions are exactly what we would expect to observe if the subatomic world is quantized and not continuously divisible. We extend our analysis to the fact that one typically observes fat-tails and high-peaks relative to the Gaussian distribution in stocks and commodity prices and many aspects of the natural world; these instances are all observable and documentable macro phenomena that strongly suggest that the ultimate building blocks of nature are discrete (e.g. they appear in quanta).
High-Tg Polynorbornene-Based Block and Random Copolymers for Butanol Pervaporation Membranes
Register, Richard A.; Kim, Dong-Gyun; Takigawa, Tamami; Kashino, Tomomasa; Burtovyy, Oleksandr; Bell, Andrew
Vinyl addition polymers of substituted norbornene (NB) monomers possess desirably high glass transition temperatures (Tg); however, until very recently, the lack of an applicable living polymerization chemistry has precluded the synthesis of such polymers with controlled architecture, or copolymers with controlled sequence distribution. We have recently synthesized block and random copolymers of NB monomers bearing hydroxyhexafluoroisopropyl and n-butyl substituents (HFANB and BuNB) via living vinyl addition polymerization with Pd-based catalysts. Both series of polymers were cast into the selective skin layers of thin film composite (TFC) membranes, and these organophilic membranes investigated for the isolation of n-butanol from dilute aqueous solution (model fermentation broth) via pervaporation. The block copolymers show well-defined microphase-separated morphologies, both in bulk and as the selective skin layers on TFC membranes, while the random copolymers are homogeneous. Both block and random vinyl addition copolymers are effective as n-butanol pervaporation membranes, with the block copolymers showing a better flux-selectivity balance. While polyHFANB has much higher permeability and n-butanol selectivity than polyBuNB, incorporating BuNB units into the polymer (in either a block or random sequence) limits the swelling of the polyHFANB and thereby improves the n-butanol pervaporation selectivity.
Evaluation of Bearing Capacity of Strip Footing Using Random Layers Concept
Directory of Open Access Journals (Sweden)
Kawa Marek
2015-09-01
Full Text Available The paper deals with evaluation of bearing capacity of strip foundation on random purely cohesive soil. The approach proposed combines random field theory in the form of random layers with classical limit analysis and Monte Carlo simulation. For given realization of random the bearing capacity of strip footing is evaluated by employing the kinematic approach of yield design theory. The results in the form of histograms for both bearing capacity of footing as well as optimal depth of failure mechanism are obtained for different thickness of random layers. For zero and infinite thickness of random layer the values of depth of failure mechanism as well as bearing capacity assessment are derived in a closed form. Finally based on a sequence of Monte Carlo simulations the bearing capacity of strip footing corresponding to a certain probability of failure is estimated. While the mean value of the foundation bearing capacity increases with the thickness of the random layers, the ultimate load corresponding to a certain probability of failure appears to be a decreasing function of random layers thickness.
Counting of oligomers in sequences generated by markov chains for DNA motif discovery.
Shan, Gao; Zheng, Wei-Mou
2009-02-01
By means of the technique of the imbedded Markov chain, an efficient algorithm is proposed to exactly calculate first, second moments of word counts and the probability for a word to occur at least once in random texts generated by a Markov chain. A generating function is introduced directly from the imbedded Markov chain to derive asymptotic approximations for the problem. Two Z-scores, one based on the number of sequences with hits and the other on the total number of word hits in a set of sequences, are examined for discovery of motifs on a set of promoter sequences extracted from A. thaliana genome. Source code is available at http://www.itp.ac.cn/zheng/oligo.c.
Quantum random number generator based on quantum nature of vacuum fluctuations
Ivanova, A. E.; Chivilikhin, S. A.; Gleim, A. V.
2017-11-01
Quantum random number generator (QRNG) allows obtaining true random bit sequences. In QRNG based on quantum nature of vacuum, optical beam splitter with two inputs and two outputs is normally used. We compare mathematical descriptions of spatial beam splitter and fiber Y-splitter in the quantum model for QRNG, based on homodyne detection. These descriptions were identical, that allows to use fiber Y-splitters in practical QRNG schemes, simplifying the setup. Also we receive relations between the input radiation and the resulting differential current in homodyne detector. We experimentally demonstrate possibility of true random bits generation by using QRNG based on homodyne detection with Y-splitter.
Parallel motif extraction from very long sequences
Sahli, Majed
2013-01-01
Motifs are frequent patterns used to identify biological functionality in genomic sequences, periodicity in time series, or user trends in web logs. In contrast to a lot of existing work that focuses on collections of many short sequences, modern applications require mining of motifs in one very long sequence (i.e., in the order of several gigabytes). For this case, there exist statistical approaches that are fast but inaccurate; or combinatorial methods that are sound and complete. Unfortunately, existing combinatorial methods are serial and very slow. Consequently, they are limited to very short sequences (i.e., a few megabytes), small alphabets (typically 4 symbols for DNA sequences), and restricted types of motifs. This paper presents ACME, a combinatorial method for extracting motifs from a single very long sequence. ACME arranges the search space in contiguous blocks that take advantage of the cache hierarchy in modern architectures, and achieves almost an order of magnitude performance gain in serial execution. It also decomposes the search space in a smart way that allows scalability to thousands of processors with more than 90% speedup. ACME is the only method that: (i) scales to gigabyte-long sequences; (ii) handles large alphabets; (iii) supports interesting types of motifs with minimal additional cost; and (iv) is optimized for a variety of architectures such as multi-core systems, clusters in the cloud, and supercomputers. ACME reduces the extraction time for an exact-length query from 4 hours to 7 minutes on a typical workstation; handles 3 orders of magnitude longer sequences; and scales up to 16, 384 cores on a supercomputer. Copyright is held by the owner/author(s).
Post-processing Free Quantum Random Number Generator Based on Avalanche Photodiode Array
International Nuclear Information System (INIS)
Li Yang; Liao Sheng-Kai; Liang Fu-Tian; Shen Qi; Liang Hao; Peng Cheng-Zhi
2016-01-01
Quantum random number generators adopting single photon detection have been restricted due to the non-negligible dead time of avalanche photodiodes (APDs). We propose a new approach based on an APD array to improve the generation rate of random numbers significantly. This method compares the detectors' responses to consecutive optical pulses and generates the random sequence. We implement a demonstration experiment to show its simplicity, compactness and scalability. The generated numbers are proved to be unbiased, post-processing free, ready to use, and their randomness is verified by using the national institute of standard technology statistical test suite. The random bit generation efficiency is as high as 32.8% and the potential generation rate adopting the 32 × 32 APD array is up to tens of Gbits/s. (paper)
Basha, Tamer A; Akçakaya, Mehmet; Goddu, Beth; Berg, Sophie; Nezafat, Reza
2015-01-01
The aim of this study was to implement and evaluate an accelerated three-dimensional (3D) cine phase contrast MRI sequence by combining a randomly sampled 3D k-space acquisition sequence with an echo planar imaging (EPI) readout. An accelerated 3D cine phase contrast MRI sequence was implemented by combining EPI readout with randomly undersampled 3D k-space data suitable for compressed sensing (CS) reconstruction. The undersampled data were then reconstructed using low-dimensional structural self-learning and thresholding (LOST). 3D phase contrast MRI was acquired in 11 healthy adults using an overall acceleration of 7 (EPI factor of 3 and CS rate of 3). For comparison, a single two-dimensional (2D) cine phase contrast scan was also performed with sensitivity encoding (SENSE) rate 2 and approximately at the level of the pulmonary artery bifurcation. The stroke volume and mean velocity in both the ascending and descending aorta were measured and compared between two sequences using Bland-Altman plots. An average scan time of 3 min and 30 s, corresponding to an acceleration rate of 7, was achieved for 3D cine phase contrast scan with one direction flow encoding, voxel size of 2 × 2 × 3 mm(3) , foot-head coverage of 6 cm and temporal resolution of 30 ms. The mean velocity and stroke volume in both the ascending and descending aorta were statistically equivalent between the proposed 3D sequence and the standard 2D cine phase contrast sequence. The combination of EPI with a randomly undersampled 3D k-space sampling sequence using LOST reconstruction allows a seven-fold reduction in scan time of 3D cine phase contrast MRI without compromising blood flow quantification. Copyright © 2014 John Wiley & Sons, Ltd.
Beksinska, Mags E; Smit, Jenni; Greener, Ross; Todd, Catherine S; Lee, Mei-ling Ting; Maphumulo, Virginia; Hoffmann, Vivian
2015-02-01
In low-income settings, many women and girls face activity restrictions during menses, owing to lack of affordable menstrual products. The menstrual cup (MC) is a nonabsorbent reusable cup that collects menstrual blood. We assessed the acceptability and performance of the MPower® MC compared to pads or tampons among women in a low-resource setting. We conducted a randomized two-period crossover trial at one site in Durban, South Africa, between January and November 2013. Participants aged 18-45 years with regular menstrual cycles were eligible for inclusion if they had no intention of becoming pregnant, were using an effective contraceptive method, had water from the municipal system as their primary water source, and had no sexually transmitted infections. We used a computer-generated randomization sequence to assign participants to one of two sequences of menstrual product use, with allocation concealed only from the study investigators. Participants used each method over three menstrual cycles (total 6 months) and were interviewed at baseline and monthly follow-up visits. The product acceptability outcome compared product satisfaction question scores using an ordinal logistic regression model with individual random effects. This study is registered on the South African Clinical Trials database: number DOH-27-01134273. Of 124 women assessed, 110 were eligible and randomly assigned to selected menstrual products. One hundred and five women completed all follow-up visits. By comparison to pads/tampons (usual product used), the MC was rated significantly better for comfort, quality, menstrual blood collection, appearance, and preference. Both of these comparative outcome measures, along with likelihood of continued use, recommending the product, and future purchase, increased for the MC over time. MC acceptance in a population of novice users, many with limited experience with tampons, indicates that there is a pool of potential users in low-resource settings.
The genesis of period-adding bursting without bursting-chaos in the Chay model
International Nuclear Information System (INIS)
Yang Zhuoqin; Lu Qishao; Li Li
2006-01-01
According to the period-adding firing patterns without chaos observed in neuronal experiments, the genesis of the period-adding 'fold/homoclinic' bursting sequence without bursting-chaos is explored by numerical simulation, fast/slow dynamics and bifurcation analysis of limit cycle in the neuronal Chay model. It is found that each periodic bursting, from period-1 to period-7, is separately generated by the corresponding periodic spiking pattern through two period-doubling bifurcations, except for the period-1 bursting occurring via a Hopf bifurcation. Consequently, it can be revealed that this period-adding bursting bifurcation without chaos has a compound bifurcation structure with transitions from spiking to bursting, which is closely related to period-doubling bifurcations of periodic spiking in essence
A periodic pattern of SNPs in the human genome
DEFF Research Database (Denmark)
Madsen, Bo Eskerod; Villesen, Palle; Wiuf, Carsten
2007-01-01
By surveying a filtered, high-quality set of SNPs in the human genome, we have found that SNPs positioned 1, 2, 4, 6, or 8 bp apart are more frequent than SNPs positioned 3, 5, 7, or 9 bp apart. The observed pattern is not restricted to genomic regions that are known to cause sequencing...... periodic DNA. Our results suggest that not all SNPs in the human genome are created by independent single nucleotide mutations, and that care should be taken in analysis of SNPs from periodic DNA. The latter may have important consequences for SNP and association studies....... or alignment errors, for example, transposable elements (SINE, LINE, and LTR), tandem repeats, and large duplicated regions. However, we found that the pattern is almost entirely confined to what we define as "periodic DNA." Periodic DNA is a genomic region with a high degree of periodicity in nucleotide usage...
Random numbers spring from alpha decay
International Nuclear Information System (INIS)
Frigerio, N.A.; Sanathanan, L.P.; Morley, M.; Clark, N.A.; Tyler, S.A.
1980-05-01
Congruential random number generators, which are widely used in Monte Carlo simulations, are deficient in that the number they generate are concentrated in a relatively small number of hyperplanes. While this deficiency may not be a limitation in small Monte Carlo studies involving a few variables, it introduces a significant bias in large simulations requiring high resolution. This bias was recognized and assessed during preparations for an accident analysis study of nuclear power plants. This report describes a random number device based on the radioactive decay of alpha particles from a 235 U source in a high-resolution gas proportional counter. The signals were fed to a 4096-channel analyzer and for each channel the frequency of signals registered in a 20,000-microsecond interval was recorded. The parity bits of these frequency counts (0 for an even count and 1 for an odd count) were then assembled in sequence to form 31-bit binary random numbers and transcribed to a magnetic tape. This cycle was repeated as many times as were necessary to create 3 million random numbers. The frequency distribution of counts from the present device conforms to the Brockwell-Moyal distribution, which takes into account the dead time of the counter (both the dead time and decay constant of the underlying Poisson process were estimated). Analysis of the count data and tests of randomness on a sample set of the 31-bit binary numbers indicate that this random number device is a highly reliable source of truly random numbers. Its use is, therefore, recommended in Monte Carlo simulations for which the congruential pseudorandom number generators are found to be inadequate. 6 figures, 5 tables