Log in

Relevant bibliographies by topics / Pseudo-random maximum length sequences / Journal articles

To see the other types of publications on this topic, follow the link: Pseudo-random maximum length sequences.

Journal articles on the topic 'Pseudo-random maximum length sequences'

Author: Grafiati

Published: 4 June 2021

Last updated: 5 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Pseudo-random maximum length sequences.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Barker, H. Anthony. "Primitive maximum-length sequences and pseudo-random signals." Transactions of the Institute of Measurement and Control 26, no. 4 (2004): 339–48. http://dx.doi.org/10.1191/0142331204tm123oa.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

KILIAS, T. "GENERATION OF PSEUDO-CHAOTIC SEQUENCES." International Journal of Bifurcation and Chaos 04, no. 03 (1994): 709–13. http://dx.doi.org/10.1142/s0218127494000502.

Full text

Abstract:

This paper deals with the spectral properties of pseudo-random signals generated in maximum-length shift registers. It is shown that infinitely long registers are comparable in behavior with one-dimensional discrete-time chaotic maps. Therefore the theory, results and tools developed for chaotic systems can be applied to the design of the spectral properties of maximum-length shift register sequences.

APA, Harvard, Vancouver, ISO, and other styles

3

Compagner, A., and A. Hoogland. "Maximum-length sequences, cellular automata, and random numbers." Journal of Computational Physics 71, no. 2 (1987): 391–428. http://dx.doi.org/10.1016/0021-9991(87)90037-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Mamun, Md Selim Al, and Fatema Akhter. "Pseudo Random Binary Sequence Based on Cyclic Difference Set." Symmetry 12, no. 8 (2020): 1202. http://dx.doi.org/10.3390/sym12081202.

Full text

Abstract:

With the increasing reliance on technology, it has become crucial to secure every aspect of online information where pseudo random binary sequences (PRBS) can play an important role in today’s world of Internet. PRBS work in the fundamental mathematics behind the security of different protocols and cryptographic applications. This paper proposes a new PRBS namely MK (Mamun, Kumu) sequence for security applications. Proposed sequence is generated by primitive polynomial, cyclic difference set in elements of the field and binarized by quadratic residue (QR) and quadratic nonresidue (QNR). Introd

APA, Harvard, Vancouver, ISO, and other styles

5

Ahmad, A., S. Al-Busaidi, M. J. Al-Mushrafi, and J. A. Jervase. "Study on Cyclic Cross-Correlation Behaviour of Maximal Length Pseudo-Random Binary Sequences." Indian Journal of Industrial and Applied Mathematics 4, no. 1a (2013): 33. http://dx.doi.org/10.5958/j.1945-919x.4.1a.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Haas, Peter J. "The maximum and mean of a random length sequence." Journal of Applied Probability 29, no. 2 (1992): 460–66. http://dx.doi.org/10.2307/3214583.

Full text

Abstract:

We obtain a limit theorem for the joint distribution of the maximum value and sample mean of a random length sequence of independent and identically distributed random variables. This extends a previous bivariate convergence result for fixed length sequences and incidentally yields a new proof of Berman's classical limit theorem for the maximum value of a random number of random variables. Our approach uses a property of record time sequences and leads to probabilistically intuitive proofs. We also consider the partition of a finite interval into a random number of subintervals by the points o

APA, Harvard, Vancouver, ISO, and other styles

7

Haas, Peter J. "The maximum and mean of a random length sequence." Journal of Applied Probability 29, no. 02 (1992): 460–66. http://dx.doi.org/10.1017/s0021900200043217.

Full text

Abstract:

We obtain a limit theorem for the joint distribution of the maximum value and sample mean of a random length sequence of independent and identically distributed random variables. This extends a previous bivariate convergence result for fixed length sequences and incidentally yields a new proof of Berman's classical limit theorem for the maximum value of a random number of random variables. Our approach uses a property of record time sequences and leads to probabilistically intuitive proofs. We also consider the partition of a finite interval into a random number of subintervals by the points o

APA, Harvard, Vancouver, ISO, and other styles

8

Garai, Massimo. "Measurement of the sound-absorption coefficient in situ: The reflection method using periodic pseudo-random sequences of maximum length." Applied Acoustics 39, no. 1-2 (1993): 119–39. http://dx.doi.org/10.1016/0003-682x(93)90032-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kong, Sing-Guan, Hong-Da Chen, Andrew Torda, and H. C. Lee. "Genomes: At the edge of chaos with maximum information capacity." International Journal of Modern Physics B 30, no. 02 (2016): 1550255. http://dx.doi.org/10.1142/s0217979215502550.

Full text

Abstract:

We propose an order index, [Formula: see text], which quantifies the notion of “life at the edge of chaos” when applied to genome sequences. It maps genomes to a number from 0 (random and of infinite length) to 1 (fully ordered) and applies regardless of sequence length and base composition. The 786 complete genomic sequences in GenBank were found to have [Formula: see text] values in a very narrow range, 0.037 ± 0.027. We show this implies that genomes are halfway towards being completely random, namely, at the edge of chaos. We argue that this narrow range represents the neighborhood of a fi

APA, Harvard, Vancouver, ISO, and other styles

10

Poluyanenko, Nikolay. "DEVELOPMENT OF THE SEARCH METHOD FOR NON-LINEAR SHIFT REGISTERS USING HARDWARE, IMPLEMENTED ON FIELD PROGRAMMABLE GATE ARRAYS." EUREKA: Physics and Engineering 1 (January 31, 2017): 53–60. http://dx.doi.org/10.21303/2461-4262.2017.00271.

Full text

Abstract:

The nonlinear feedback shift registers of the second order inare considered, because based on them it can be developed a generator of stream ciphers with enhanced cryptographic strength. Feasibility of nonlinear feedback shift register search is analyzed. These registers form a maximal length sequence, using programmable logic devices. Performance evaluation of programmable logic devices in the generation of pseudo-random sequence by nonlinear feedback shift registers is given. Recommendations to increase this performance are given. The dependence of the maximum generation rate (clock frequenc

APA, Harvard, Vancouver, ISO, and other styles

11

Aaronson, Neil L., and William M. Hartmann. "Maximum length sequences versus random telegraph noise in measuring impulse responses and transfer functions." Journal of the Acoustical Society of America 119, no. 5 (2006): 3430. http://dx.doi.org/10.1121/1.4786884.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Pesoshin, V. A., V. M. Kuznetsov, and A. S. Kuznetsova. "Pseudo-random sequences with non-maximal length realized according to the Galois scheme based on the primitive polynomial in degree." Journal of Physics: Conference Series 1658 (October 2020): 012036. http://dx.doi.org/10.1088/1742-6596/1658/1/012036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

XING, CHANGMING, and LIN YANG. "RANDOM WALKS IN HETEROGENEOUS WEIGHTED PSEUDO-FRACTAL WEBS WITH THE SAME WEIGHT SEQUENCE." Fractals 27, no. 06 (2019): 1950089. http://dx.doi.org/10.1142/s0218348x19500890.

Full text

Abstract:

Intuitively, link weight could affect the dynamics of the network. However, the theoretical research on the effects of link weight on network dynamics is still rare. In this paper, we present two heterogeneous weighted pseudo-fractal webs controlled by two weight parameters [Formula: see text] and [Formula: see text] ([Formula: see text]). Both graph models are scale-free deterministic graphs, and they have the same weight sequence when [Formula: see text] and [Formula: see text] are fixed. Based on their self-similar graph structure, we study the effect of heterogeneous weight on the random w

APA, Harvard, Vancouver, ISO, and other styles

14

Ahmad, A., and A. M. Elabdalla. "An efficient method to determine linear feedback connections in shift registers that generate maximal length pseudo-random up and down binary sequences." Computers & Electrical Engineering 23, no. 1 (1997): 33–39. http://dx.doi.org/10.1016/s0045-7906(96)00020-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Nishitani, Yoshi, Chie Hosokawa, Yuko Mizuno-Matsumoto, Tomomitsu Miyoshi, Hajime Sawai, and Shinichi Tamura. "Detection of M-Sequences from Spike Sequence in Neuronal Networks." Computational Intelligence and Neuroscience 2012 (2012): 1–9. http://dx.doi.org/10.1155/2012/862579.

Full text

Abstract:

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 assembli

APA, Harvard, Vancouver, ISO, and other styles

16

Prasitsupparote, Amonrat, Norio Konno, and Junji Shikata. "Numerical and Non-Asymptotic Analysis of Elias’s and Peres’s Extractors with Finite Input Sequences." Entropy 20, no. 10 (2018): 729. http://dx.doi.org/10.3390/e20100729.

Full text

Abstract:

Many cryptographic systems require random numbers, and the use of weak random numbers leads to insecure systems. In the modern world, there are several techniques for generating random numbers, of which the most fundamental and important methods are deterministic extractors proposed by von Neumann, Elias, and Peres. Elias’s extractor achieves the optimal rate (i.e., information-theoretic upper bound) h ( p ) if the block size tends to infinity, where h ( · ) is the binary entropy function and p is the probability that each bit of input sequences occurs. Peres’s extractor achieves the optimal r

APA, Harvard, Vancouver, ISO, and other styles

17

Žibret, G., and T. Verbovšek. "Quantitative analysis of randomness exhibited by river channels using chaos game technique: Mississippi, Amazon, Sava and Danube case studies." Nonlinear Processes in Geophysics 16, no. 3 (2009): 419–29. http://dx.doi.org/10.5194/npg-16-419-2009.

Full text

Abstract:

Abstract. This paper presents a numerical evaluation of the randomness which can be observed in the geometry of major river channels. The method used is based upon that of generating a Sierpinski triangle via the chaos game technique, played with the sequence representing the river topography. The property of the Sierpinski triangle is that it can be constructed only by playing a chaos game with random values. Periodic or chaotic sequences always produce an incomplete triangle. The quantitative data about the scale of the random behaviour of the river channel pathway was evaluated by determina

APA, Harvard, Vancouver, ISO, and other styles

18

Yang, Xiao-Fei, Yuan-Ke Zhou, Lin Zhang, Yang Gao, and Pu-Feng Du. "Predicting LncRNA Subcellular Localization Using Unbalanced Pseudo-k Nucleotide Compositions." Current Bioinformatics 15, no. 6 (2020): 554–62. http://dx.doi.org/10.2174/1574893614666190902151038.

Full text

Abstract:

Background: Long non-coding RNAs (lncRNAs) are transcripts with a length more than 200 nucleotides, functioning in the regulation of gene expression. More evidence has shown that the biological functions of lncRNAs are intimately related to their subcellular localizations. Therefore, it is very important to confirm the lncRNA subcellular localization. Methods: In this paper, we proposed a novel method to predict the subcellular localization of lncRNAs. To more comprehensively utilize lncRNA sequence information, we exploited both kmer nucleotide composition and sequence order correlated factor

APA, Harvard, Vancouver, ISO, and other styles

19

Rousseau, Christine M., Gerald H. Learn, Tanmoy Bhattacharya, et al. "Extensive Intrasubtype Recombination in South African Human Immunodeficiency Virus Type 1 Subtype C Infections." Journal of Virology 81, no. 9 (2007): 4492–500. http://dx.doi.org/10.1128/jvi.02050-06.

Full text

Abstract:

ABSTRACT Recombinant human immunodeficiency virus type 1 (HIV-1) strains containing sequences from different viral genetic subtypes (intersubtype) and different lineages from within the same subtype (intrasubtype) have been observed. A consequence of recombination can be the distortion of the phylogenetic signal. Several intersubtype recombinants have been identified; however, less is known about the frequency of intrasubtype recombination. For this study, near-full-length HIV-1 subtype C genomes from 270 individuals were evaluated for the presence of intrasubtype recombination. A sliding wind

APA, Harvard, Vancouver, ISO, and other styles

20

Zurita, A., R. Callejón, M. de Rojas, and C. Cutillas. "Morphological, biometrical and molecular characterization of Archaeopsylla erinacei (Bouché, 1835)." Bulletin of Entomological Research 108, no. 6 (2017): 726–38. http://dx.doi.org/10.1017/s0007485317001274.

Full text

Abstract:

AbstractIn the present work, we carried out a morphological, biometrical and molecular study of the species Archaeopsylla erinacei (Bouché, 1835) and their subspecies: Archaeopsylla erinacei erinacei (Bouché, 1835) and Archaeopsylla erinacei maura (Jordan & Rothschild, 1912) isolated from hedgehogs (Erinaceus europaeus) from different geographical regions (Seville and Corse). We have found morphological differences in females of A. erinacei from the same geographical origin that did not correspond with molecular differences. We suggest that some morphological characters traditionally used

APA, Harvard, Vancouver, ISO, and other styles

21

Querfurth, H. "Encoder response of isolated frog muscle spindle elicited by pseudorandom noise stimuli." Journal of Neurophysiology 55, no. 1 (1986): 13–22. http://dx.doi.org/10.1152/jn.1986.55.1.13.

Full text

Abstract:

The present experiments investigated the signal transfer in the isolated frog muscle spindle by using pseudorandom noise (PRN) as the analytical probe. In order to guarantee that the random stimulus covered the entire dynamic range of the receptor, PRN stimuli of different intensities were applied around a constant mean length, or PRN stimuli of the same intensity were used while varying the mean length of the spindle. Subthreshold receptor potentials, local responses, and propagated action potentials were recorded simultaneously from the first Ranvier node of the afferent stem fiber, thus pro

APA, Harvard, Vancouver, ISO, and other styles

22

Kramosil, Ivan. "On Pseudo-Random Sequences over Finite Automata." Fundamenta Informaticae 8, no. 1 (1985): 55–62. http://dx.doi.org/10.3233/fi-1985-8104.

Full text

Abstract:

It is a well-known fact that binary sequences (strings) of high algorithmic complexity can be taken as good approximations of statistically independent random sequences with two equiprobable outputs. Here “sequence of high algorithmic complexity” is such one, that the length of the shortest program generating this sequence by a universal Turing machine differs only by an a priori given constant from the length of the generated sequence. The present paper generalizes this result to the case of a finite (not necessarily binary) alphabet. Considering an infinite sequence of finite sequences of hi

APA, Harvard, Vancouver, ISO, and other styles

23

Karlin, Samuel, and Friedemann Ost. "Maximal Length of Common Words Among Random Letter Sequences." Annals of Probability 16, no. 2 (1988): 535–63. http://dx.doi.org/10.1214/aop/1176991772.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Prakasa Rao, B. L. S., and M. Sreehari. "Limit theorem for maximal segmental score for random sequences of random length." Theory of Probability and Mathematical Statistics 76 (2008): 155–58. http://dx.doi.org/10.1090/s0094-9000-08-00739-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Ahmad, A., and A. Al Maashri. "On Sequence Lengths of Some Special External Exclusive OR Type LFSR Structures – Study and Analysis." Journal of Engineering Research [TJER] 11, no. 2 (2014): 1. http://dx.doi.org/10.24200/tjer.vol11iss2pp1-14.

Full text

Abstract:

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 p

APA, Harvard, Vancouver, ISO, and other styles

26

Kumari, Priti, and Pramod Kumar Kewat. "2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four." International Journal of Foundations of Computer Science 30, no. 05 (2019): 759–79. http://dx.doi.org/10.1142/s0129054119500205.

Full text

Abstract:

Although for more than 20 years, Whiteman’s generalized cyclotomic sequences have been thought of as the most important pseudo-random sequences, but, there are only a few papers in which their 2-adic complexities have been discussed. In this paper, we construct a class of binary sequences of order four with odd length (product of two distinct odd primes) from Whiteman’s generalized cyclotomic classes. After that, we determine both 2-adic complexity and linear complexity of these sequences. Our results show that these complexities are greater than half of the period of the sequences, therefore,

APA, Harvard, Vancouver, ISO, and other styles

27

Oliveira, S. A. S., E. F. M. Abreu, T. S. Araújo, et al. "First Report of a 16SrIII-L Phytoplasma Associated with Frogskin Disease in Cassava (Manihot esculenta Crantz) in Brazil." Plant Disease 98, no. 1 (2014): 153. http://dx.doi.org/10.1094/pdis-05-13-0499-pdn.

Full text

Abstract:

Cassava (Manihot esculenta Crantz) is a major staple crop in developing countries and a large source of raw material for industrial purposes as flour, starch, and ethanol. In July 2012, 24 cassava genotypes (corresponding to 1.85% of the accessions) with typical symptoms of frogskin disease (CFSD) were observed in one of the maintenance areas of the Brazilian Cassava Germplasm (located at Embrapa Cassava & Fruits, Cruz das Almas, Bahia State, Brazil). All diseased plants were asymptomatic on the aboveground parts (leaves and stem). However, for accessions BGM 880, BGM 1094, BGM 1100, BGM 1

APA, Harvard, Vancouver, ISO, and other styles

28

Kozachok, A. V., A. A. Spirin, and O. M. Golembiovskaya. "Random forest based pseudorandom sequences classification algorithm." Proceedings of Tomsk State University of Control Systems and Radioelectronics 23, no. 3 (2020): 55–60. http://dx.doi.org/10.21293/1818-0442-2020-23-3-55-60.

Full text

Abstract:

Recently, the number of confidential data leaks caused by internal violators has increased. Since modern DLP-systems cannot detect and prevent information leakage channels in encrypted or compressed form, an algorithm was proposed to classify pseudo-random sequences formed by data encryption and compression algorithms. Algorithm for constructing a random forest was used. An array of the frequency of occurrence of binary subsequences of 9-bit length and statistical characteristics of the byte distribution of sequences was chosen as the feature space. The presented algorithm showed the accuracy

APA, Harvard, Vancouver, ISO, and other styles

29

Unkašević, Tomislav, Zoran Banjac, and Milan Milosavljević. "A Generic Model of the Pseudo-Random Generator Based on Permutations Suitable for Security Solutions in Computationally-Constrained Environments." Sensors 19, no. 23 (2019): 5322. http://dx.doi.org/10.3390/s19235322.

Full text

Abstract:

Symmetric cryptography methods have an important role in security solutions design in data protection. In that context, symmetric cryptography algorithms and pseudo-random generators connected with them have strong influence on designed security solutions. In the computationally constrained environment, security efficiency is also important. In this paper we proposed the design of a new efficient pseudo-random generator parameterized by two pseudo-random sequences. By the probabilistic, information-theoretic and number theory methods we analyze characteristics of the generator. Analysis produc

APA, Harvard, Vancouver, ISO, and other styles

30

Querfurth, H. "Transducer action of isolated frog muscle spindle evoked by pseudorandom noise stimuli." Journal of Neurophysiology 55, no. 1 (1986): 1–12. http://dx.doi.org/10.1152/jn.1986.55.1.1.

Full text

Abstract:

The dynamic response properties of the isolated frog muscle spindle receptor were investigated by recording the receptor potential evoked by pseudorandom noise (PRN) stimuli. The entire dynamic range of the receptor was determined by measuring the sensory response either at different intensities of the PRN stimulus (sigma = 8-30 microns) around a constant mean length or at the same intensity while varying the mean length from resting length L0 up to L0 + 150 microns. The 3-dB bandwidth of the test signal was 130 Hz. Random stimuli often evoked brief receptor potentials with variable size but c

APA, Harvard, Vancouver, ISO, and other styles

31

Pesoshin, V. A., V. M. Kuznetsov, and A. K. Rakhmatullin. "Pseudo-random sequences with nonmaximal length based on the shift register and reducible polynomial." Journal of Physics: Conference Series 1352 (October 2019): 012035. http://dx.doi.org/10.1088/1742-6596/1352/1/012035.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Бутусов, Денис, Sergey Butusov, Александра Тутуева, et al. "MODELS OF RANDOM SYSTEMS WITH CONTROLLED SYMMETRY IN STREAM ENCRYPTION." Bulletin of Bryansk state technical university 2019, no. 11 (2019): 46–54. http://dx.doi.org/10.30987/1999-8775-2019-2019-11-46-54.

Full text

Abstract:

Information safety plays an important role in modern technologies. A stream encryption is one of the common means for information safety support. The sequences with pseudo-random characteristics are often required in the algorithms of stream enciphering. Random systems are recently used as a source of pseudo-random numbers with desired statistical properties. A small length of a sequence period is one of the known problems of the generators of pseudo-random numbers based on chaos realized with a small length of a digit grid. The disturbance of a path or a parameter of random system nonlinearit

APA, Harvard, Vancouver, ISO, and other styles

33

Liao, Chun Guang, and Ping Liu. "Performance Analysis of Chaotic Spread Spectrum Sequences." Advanced Materials Research 852 (January 2014): 608–12. http://dx.doi.org/10.4028/www.scientific.net/amr.852.608.

Full text

Abstract:

The properties of chaotic maps based on Logistic map, Tent map, Improved Logistic map and Chebyshev map are analyzed in this paper .Then we discuss the performance of correlation, balance and run-length of the chaotic binary sequences . Simulation results show that the characteristics of chaotic sequences are similar to the traditional pseudo-random sequences, and chaotic sequence is suitable for direct sequence spread spectrum systems as spreading sequence.

APA, Harvard, Vancouver, ISO, and other styles

34

Kotrova, Michaela, Vincent H. J. van der Velden, Jacques J. M. van Dongen, et al. "NGS-Based Minimal Residual Disease (MRD) after Stem Cell Transplantation (SCT) Is More Specific for Relapse Prediction Than qPCR and Suggests the Possibility of False-Positive qPCR Results." Blood 128, no. 22 (2016): 3494. http://dx.doi.org/10.1182/blood.v128.22.3494.3494.

Full text

Abstract:

Abstract Background MRD detection using qPCR for IG/TR rearrangements has been the gold standard approach for relapse prediction and for guiding post-transplant therapeutic interventions for already two decades. Despite its thorough standardization within the EuroMRD laboratories and very strict rules for defining MRD positivity (van der Velden, Leukemia, 2007) this method carries the risk of false-positive MRD results, mainly in post-transplant time-points with massive B-cell regeneration (Fronkova, Bone Marrow Transplantation, 2008). This may lead to application of unneeded therapeutic inter

APA, Harvard, Vancouver, ISO, and other styles

35

Valli S, Abiraami, and Mythili T. "BIOINFORMATIC STUDY OF AN ANTITUMOR PROTEIN, AZURIN." Asian Journal of Pharmaceutical and Clinical Research 11, no. 6 (2018): 169. http://dx.doi.org/10.22159/ajpcr.2018.v11i6.23339.

Full text

Abstract:

Objective: The main objective of this study is to analyze the structure and function of an antitumor protein, azurin, thereby giving validation to the protein structure and existing physicochemical properties in the anticancer protein which are responsible for the anticancer activity.Methods: Protein sequence analysis was done using Basic Local Alignment Search Tool (BLAST) with ten different randomly selected species of Pseudomonas obtained from GenBank. The physicochemical properties, prediction of secondary structure, identification of motifs and domains, three-dimensional (3-D) structure o

APA, Harvard, Vancouver, ISO, and other styles

36

Hsu, Tai-Hsin, and Su-Long Nyeo. "Simple Deviation Analysis of Two-Dimensional Viral DNA Walks." Journal of Biological Systems 11, no. 03 (2003): 221–43. http://dx.doi.org/10.1142/s0218339003000841.

Full text

Abstract:

We consider the method of two-dimensional DNA walks based on three independent groups of mapping rules for 21 DNA sequences of animal and plant viruses, and for the sequences of irrational and random numbers. This method provides a visualization tool for the determination of the regional abundance of nucleotides in DNA sequences. By defining a statistical deviation and a maximum-deviation ratio for a DNA walk, we find that the maximum-deviation ratios for the 21 viral DNA sequences are generally larger than those of the random-number sequences of same lengths. It is shown that the viral DNA se

APA, Harvard, Vancouver, ISO, and other styles

37

Liu, Longfei, Xiaoyuan Yang, Bin Wei, and Liqiang Wu. "A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity." International Journal of Wavelets, Multiresolution and Information Processing 16, no. 01 (2018): 1850006. http://dx.doi.org/10.1142/s0219691318500066.

Full text

Abstract:

Periodic sequences over finite fields, constructed by classical cyclotomic classes and generalized cyclotomic classes, have good pseudo-random properties. The linear complexity of a period sequence plays a fundamental role in the randomness of sequences. In this paper, we construct a new family of quaternary generalized cyclotomic sequences with order [Formula: see text] and length [Formula: see text], which generalize the sequences constructed by Ke et al. in 2012. In addition, we determine its linear complexity using cyclotomic theory. The conclusions reveal that these sequences have high li

APA, Harvard, Vancouver, ISO, and other styles

38

Karlin, Samuel, and Friedemann Ost. "Counts of long aligned word matches among random letter sequences." Advances in Applied Probability 19, no. 02 (1987): 293–351. http://dx.doi.org/10.1017/s0001867800016578.

Full text

Abstract:

Asymptotic distributional properties of the maximal length aligned word (a contiguous set of letters) among multiple random Markov dependent sequences composed of letters from a finite alphabet are given. For sequences of length N, Cr,s (N) defined as the longest common aligned word found in r or more of s sequences has order growth log N/(–logλ) where λis the maximal eigenvalue of r-Schur product matrices from among the collections of Markov matrices that generate the sequences. The count Z ∗ r,s (N, k) of positions that initiate an aligned match of length exceeding k = log N/(–logλ) + x but

APA, Harvard, Vancouver, ISO, and other styles

39

Karlin, Samuel, and Friedemann Ost. "Counts of long aligned word matches among random letter sequences." Advances in Applied Probability 19, no. 2 (1987): 293–351. http://dx.doi.org/10.2307/1427422.

Full text

Abstract:

Asymptotic distributional properties of the maximal length aligned word (a contiguous set of letters) among multiple random Markov dependent sequences composed of letters from a finite alphabet are given. For sequences of length N, Cr,s(N) defined as the longest common aligned word found in r or more of s sequences has order growth log N/(–logλ) where λis the maximal eigenvalue of r-Schur product matrices from among the collections of Markov matrices that generate the sequences. The count Z∗r,s(N, k) of positions that initiate an aligned match of length exceeding k = log N/(–logλ) + x but fail

APA, Harvard, Vancouver, ISO, and other styles

40

Lobov, Evgeniy M., Dmitry N. Shubin, Nikolai A. Kandaurov, and Elizaveta O. Lobova. "A new class of polyphase pseudo-random sequences with a nonlinear generation algorithm for secure radio communication link between unmanned vehicles and dispatch centers of the "smart city"." T-Comm 14, no. 8 (2020): 42–46. http://dx.doi.org/10.36724/2072-8735-2020-14-8-42-46.

Full text

Abstract:

The article discusses an algorithm for generating a new class of polyphase pseudo-random sequences with a nonlinear generation algorithm for use in secure communication systems with spread spectrum technology. In particular, the proposed sequences are relevant to use for generating signals in a secure command radio link between unmanned vehicles located in different environments, and dispatch centers of the "smart city". An analysis of the existing ensembles and an assessment of their main characteristics are carried out. Namely, the size of the ensemble, which affects the security of the comm

APA, Harvard, Vancouver, ISO, and other styles

41

VIVALDI, FRANCO, and IGOR VLADIMIROV. "PSEUDO-RANDOMNESS OF ROUND-OFF ERRORS IN DISCRETIZED LINEAR MAPS ON THE PLANE." International Journal of Bifurcation and Chaos 13, no. 11 (2003): 3373–93. http://dx.doi.org/10.1142/s0218127403008557.

Full text

Abstract:

We analyze the sequences of round-off errors of the orbits of a discretized planar rotation, from a probabilistic angle. It was shown [Bosio & Vivaldi, 2000] that for a dense set of parameters, the discretized map can be embedded into an expanding p-adic dynamical system, which serves as a source of deterministic randomness. For each parameter value, these systems can generate infinitely many distinct pseudo-random sequences over a finite alphabet, whose average period is conjectured to grow exponentially with the bit-length of the initial condition (the seed). We study some properties of

APA, Harvard, Vancouver, ISO, and other styles

42

Huang, Chang Jiang, Yu Hua, Yong Hui Hu, and Yu Xiang. "Research on Time-Domain Correlation Technique Based on ZC Sequences in OFDM System." Applied Mechanics and Materials 519-520 (February 2014): 500–503. http://dx.doi.org/10.4028/www.scientific.net/amm.519-520.500.

Full text

Abstract:

OFDM modulation signal based on different Pseudo-random Noise sequences cant be discriminated in time domain in OFDM system. In order to resolve this problem, the time-domain sliding correlation technique based on ZC sequences is proposed, and the relations between the time-domain correlation properties and the length of the sequence are analyzed. On the basis of the analysis of the technique, the optimum scheme of time-domain sliding correlation is done by the aid of the comparison of the auto-correlation gain on the condition of limited symbol length and band-width. Simulation results in AWG

APA, Harvard, Vancouver, ISO, and other styles

43

Vašáková, Jana, and Jan Čermák. "Modelling of gaseous phase in bubble columns." Collection of Czechoslovak Chemical Communications 56, no. 6 (1991): 1238–48. http://dx.doi.org/10.1135/cccc19911238.

Full text

Abstract:

An axial dispersion model of a bubble column was verified by an experimental method based on pseudo-random binary signals of maximum length. The diameter of the column was 0.292 m and the height of the dispersion layer was 1.33 m. Water formed a stagnant liquid layer and a mixture of air with up to 5 vol.% of CO2 formed a streaming gas phase. The model was evaluated from the response of the bubble column to pseudo-random binary signals and from impulse characteristics calculated from this response by the correlation method. The use of the axial dispersion model with mass transfer was evaluated

APA, Harvard, Vancouver, ISO, and other styles

44

Cheng, Ye, and Jianhao Hu. "Random Error Reduction Scheme for Combinational Stochastic Circuit." Mathematical Problems in Engineering 2017 (2017): 1–14. http://dx.doi.org/10.1155/2017/4038765.

Full text

Abstract:

In conventional stochastic computation, all the input streams are Bernoulli sequences (BSs), which may result in large random error. To reduce random error and improve computational accuracy, some other sequences have been reported as alternatives to BSs. However, these sequences only apply to the specific stochastic circuits, have difficulties in hardware generation, or have length constraints. To this end, new sequences without these disadvantages should be considered. This paper proposes the random error analysis method for stochastic computation based on autocorrelation sequence (AS), whic

APA, Harvard, Vancouver, ISO, and other styles

45

Khadari, Bouchaib, Amal Zine El Aabidine, Cinderella Grout, et al. "A Genetic Linkage Map of Olive Based on Amplified Fragment Length Polymorphism, Intersimple Sequence Repeat and Simple Sequence Repeat Markers." Journal of the American Society for Horticultural Science 135, no. 6 (2010): 548–55. http://dx.doi.org/10.21273/jashs.135.6.548.

Full text

Abstract:

A detailed genomic linkage map of the olive [Olea europaea L. ssp. europaea (2x = 2n = 46)] was constructed with a 147 F1 full-sib ‘Olivière’ × ‘Arbequina’ progeny in a two-way pseudo-test cross-mapping configuration. Based on a logarithm of odds threshold of 6 and a maximum recombination fraction of 0.4, maternal and paternal maps were constructed using 222 makers [178 amplified fragment length polymorphism (AFLP), 37 simple sequence repeat (SSR), seven intersimple sequence repeat (ISSR)] and 219 markers (174 AFLP, 39 SSR, 6 ISSR) markers, respectively. The female map regrouped 36 linkage gro

APA, Harvard, Vancouver, ISO, and other styles

46

Caflisch, Russel E. "Monte Carlo and quasi-Monte Carlo methods." Acta Numerica 7 (January 1998): 1–49. http://dx.doi.org/10.1017/s0962492900002804.

Full text

Abstract:

Monte Carlo is one of the most versatile and widely used numerical methods. Its convergence rate, O(N−1/2), is independent of dimension, which shows Monte Carlo to be very robust but also slow. This article presents an introduction to Monte Carlo methods for integration problems, including convergence theory, sampling methods and variance reduction techniques. Accelerated convergence for Monte Carlo quadrature is attained using quasi-random (also called low-discrepancy) sequences, which are a deterministic alternative to random or pseudo-random sequences. The points in a quasi-random sequence

APA, Harvard, Vancouver, ISO, and other styles

47

Schäfer, Marius, Hendrik Theado, Michael M. Becker, and Sarah C. L. Fischer. "Optimization of the Unambiguity of Cross-Correlated Ultrasonic Signals through Coded Excitation Sequences for Robust Time-of-Flight Measurements." Signals 2, no. 2 (2021): 366–77. http://dx.doi.org/10.3390/signals2020023.

Full text

Abstract:

The cross-correlation function (CCF) is an established technique to calculate time-of-flight for ultrasonic signals. However, the quality of the CCF depends on the shape of the input signals. In many use cases, the CCF can exhibit secondary maxima in the same order of magnitude as the main maximum, making its interpretation less robust against external disturbances. This paper describes an approach to optimize ultrasonic signals for time-of-flight measurements through coded excitation sequences. The main challenge for applying coded excitation sequences to ultrasonic signals is the influence o

APA, Harvard, Vancouver, ISO, and other styles

48

Cek, Mehmet Emre. "M-Ary Alpha-Stable Noise Modulation in Spread-Spectrum Communication." Fluctuation and Noise Letters 14, no. 03 (2015): 1550022. http://dx.doi.org/10.1142/s0219477515500224.

Full text

Abstract:

In this paper, a spread-spectrum communication system based on a random carrier is proposed which transmits M-ary information. The random signal is considered as a single realization of a random process taken from prescribed symmetric α-stable (SαS) distribution that carries digital M-ary information to be transmitted. Considering the noise model in the channel as additive white Gaussian noise (AWGN), the transmitter sends the information carrying random signal from non-Gaussian density. Alpha-stable distribution is used to encode the M-ary message. Inspired by the chaos shift keying technique

APA, Harvard, Vancouver, ISO, and other styles

49

Vašáková, Jana, and Jan Čermák. "A Simple Probabilistic Model of Bubble Column." Collection of Czechoslovak Chemical Communications 57, no. 5 (1992): 1043–52. http://dx.doi.org/10.1135/cccc19921043.

Full text

Abstract:

A probabilistic model of bubble column was derived from a deterministic model so that noncorrelated or autocorrelated noise was added at the column outlet. A pseudo-random binary series of maximum length - PRBS was used as input signal The effect of noise was observed in terms of impulse characteristics calculated by the correlation method from the responses of model to the PRBS input. The possibilities of PRBS when simulating the behaviour of bubble column were judged in the work, and the effect of magnitude of noise amplitude on the form of impulse characteristics was evaluated.

APA, Harvard, Vancouver, ISO, and other styles

50

Song, Xijin, Xuelong Wang, Zhao Dong, Xiaojiao Zhao, and Xudong Feng. "Analysis of Pseudo-Random Sequence Correlation Identification Parameters and Anti-Noise Performance." Energies 11, no. 10 (2018): 2586. http://dx.doi.org/10.3390/en11102586.

Full text

Abstract:

Using a pseudo-random sequence to encode the transmitted waveform can significantly improve the working efficiency and depth of detection of electromagnetic exploration. The selection of parameters of pseudo-random sequence plays an important role in correlation identification and noise suppression. A discrete cycle correlation identification method for extracting the earth impulse response is proposed. It can suppress the distortion in the early stage of the excitation field and the glitches of the cross correlation function by traditional method. This effectively improves the accuracy of cor

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!