We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotie...We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.展开更多
Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = ...Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = 2,3,the number of sequences with given k-error linear complexity and the expected k-error linear complexity are provided. Moreover,the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.展开更多
The conformational and dynamic properties of polypropylene （PP） for both pure melts and blends with different chain tacticity were investigated by Monte Carlo simulation of isotactic （iPP）, atactic （aPP） and syn...The conformational and dynamic properties of polypropylene （PP） for both pure melts and blends with different chain tacticity were investigated by Monte Carlo simulation of isotactic （iPP）, atactic （aPP） and syndiotactic （sPP） polypropylenes. The simulation of coarse-grained PP models was performed on a high coordination lattice incorporating short- and long-range intramolecular interactions from the rotational isomeric state （RIS） model and Lennard-Jones （LJ） potential function of propane pairs, respectively. The dynamics of chains in binary PP/PP mixture were investigated with the composition of C150H302 with different chain taciticity. The diffusion rates of PP with different stereochemistry are generally in the order as： iPP 〉 aPP 〉〉 sPP. For PP/PP blends with 50：50 wt% binary mixtures, immiscibility was observed when sPP was introduced into the mixtures. The diffusion rate of iPP and aPP became slower after mixing, while sPP diffuses significantly faster in the binary mixtures. The mobility of PP chains depends on both intramolecular （molecular size and chain stiffness） and intermolecular （chain packing） interactions. The effect of intramolecular contribution is greater than that of intermolecular contribution for iPP and aPP chains in binary mixtures. For sPP chain, intermolecular interaction has greater influence on the dynamics than intramolecular contribution.展开更多
The sequences with good correlation properties are widely used in engineering applications, especially in the area of communications. In this paper, the relationships among crosscorrelation functions of arbitrary four...The sequences with good correlation properties are widely used in engineering applications, especially in the area of communications. In this paper, the relationships among crosscorrelation functions of arbitrary four binary sequences of period N are presented. Based on them, for a sequences set, the relationships between cross-correlation functions and autocorrelation functions are studied, by which we prove that they cannot keep optimal at the same time.展开更多
The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are tw...The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are two odd primes satisfying that 2 is a primitive root module p and q^2 and gcd（p-1, q-1） = 2, we analyze the relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.展开更多
Stream cipher, DNA cryptography and DNA analysis are the most important R&D fields in both Cryptography and Bioinformatics. HC-256 is an emerged scheme as the new generation of stream ciphers for advanced network ...Stream cipher, DNA cryptography and DNA analysis are the most important R&D fields in both Cryptography and Bioinformatics. HC-256 is an emerged scheme as the new generation of stream ciphers for advanced network security. From a random sequencing viewpoint, both sequences of HC-256 and real DNA data may have intrinsic pseudo-random properties respectively. In a recent decade, many DNA sequencing projects are developed on cells, plants and animals over the world into huge DNA databases. Researchers notice that mammalian genomes encode thousands of large noncoding RNAs (lncRNAs), interact with chromatin regulatory complexes, and are thought to play a role in localizing these complexes to target loci across the genome. It is a challenge target using higher dimensional visualization tools to organize various complex interactive properties as visual maps. The Variant Map System (VMS) as an emerging scheme is systematically proposed in this paper to apply multiple maps that used four Meta symbols as same as DNA or RNA representations. System architecture of key components and core mechanism on the VMS are described. Key modules, equations and their I/O parameters are discussed. Applying the VM System, two sets of real DNA sequences from both sample human (noncoding DNA) and corn (coding DNA) genomes are collected in comparison with pseudo DNA sequences generated by HC-256 to show their intrinsic properties in higher levels of similar relationships among relevant DNA sequences on 2D maps. Sample 2D maps are listed and their characteristics are illustrated under controllable environment. Visual results are briefly analyzed to explore their intrinsic properties on selected genome sequences.展开更多
Binary sequences constructed by Legendre symbols are widely used in communication and cryptography since they have many good pseudo-random properties.In this paper,we determine the 2-adic complexity of the sum sequenc...Binary sequences constructed by Legendre symbols are widely used in communication and cryptography since they have many good pseudo-random properties.In this paper,we determine the 2-adic complexity of the sum sequence of any k many Legendre sequences and show that the 2-adic complexity of the sum sequences of any k many Legendre sequences reaches the maximum by proving the case of k=2 and 3,which implies that the sum sequences can resist the attack of rational approximation algorithm.展开更多
Two new families of finite binary sequences are constructed using multiplicative inverse. The sequences are shown to have strong pseudorandom properties by using some estimates of certain exponential sums over finite ...Two new families of finite binary sequences are constructed using multiplicative inverse. The sequences are shown to have strong pseudorandom properties by using some estimates of certain exponential sums over finite fields. The constructions can be implemented fast since multiplicative inverse over finite fields can be computed in polynomial time.展开更多
Noise interfereuce and multiple access interference are the main impairment to the performance of DS/CDMA communication system. This letter presents that OverSampled Chaotic Map (OSCM) binary sequences are secure as s...Noise interfereuce and multiple access interference are the main impairment to the performance of DS/CDMA communication system. This letter presents that OverSampled Chaotic Map (OSCM) binary sequences are secure as spreading sequences, and based on the optimal quantizing method, the BER performance of the system has been derived in detail. the internal relationships among the number of users, the power of noise and the length of code chips are revealed in mathematical formulae. The performance of the system can be improved by employing these formulae. Numerical results conform the efficiency of discussion in this letter.展开更多
This paper presents the definition of perfect punctured binary sequence pair and the combinatorial admissible conditions for searching the perfect punctured binary sequence pairs and proves that all of the pseudo-rand...This paper presents the definition of perfect punctured binary sequence pair and the combinatorial admissible conditions for searching the perfect punctured binary sequence pairs and proves that all of the pseudo-random binary sequences satisfy these conditions. Computer calculation verifies that the pseudo-random binary sequences with length up to N=127 can be easily turned into perfect punctured binary sequence pairs.展开更多
A new set of binary sequences-Periodic Complementary Binary Sequence Pair (PCSP) is proposed. A new class of block design-Difference Family Pair (DFP) is also proposed.The relationship between PCSP and DFP, the proper...A new set of binary sequences-Periodic Complementary Binary Sequence Pair (PCSP) is proposed. A new class of block design-Difference Family Pair (DFP) is also proposed.The relationship between PCSP and DFP, the properties and existing conditions of PCSP and the recursive constructions for PCSP are given.展开更多
The concept of the binary sequence pair is generalized from a single binary sequence. Binary sequence pairs are applied in many fields of radar, sonar or communication systems, in which signals with optimal periodic c...The concept of the binary sequence pair is generalized from a single binary sequence. Binary sequence pairs are applied in many fields of radar, sonar or communication systems, in which signals with optimal periodic correlation are required. Several types of almost perfect binary sequence pairs of length T = 2q are constructed, where q is an odd number. These almost perfect binary sequence pairs are based on binary ideal sequence or binary ideal two-level correlation sequence pairs by using Chinese remainder theorem. For these almost perfect binary sequence pairs with good balanced property, their corresponding divisible difference set pairs(DDSPs) are also derived.展开更多
In this paper,a new class of almost binary sequence pair with a single zero element is presented.The almost binary sequence pairs with three-level correlation are constructed based on cyclotomic numbers of order 2,4,a...In this paper,a new class of almost binary sequence pair with a single zero element is presented.The almost binary sequence pairs with three-level correlation are constructed based on cyclotomic numbers of order 2,4,and 6.Most of them have good correlation and balance property,whose maximum nontrivial correlation magnitudes are 2 and the difference between the numbers of occurrence of +1's and-1's are 0 or 1.In addition,the corresponding binary sequence pairs are investigated as well and we can also get some kinds of binary sequence pairs with optimum balance and good correlation.展开更多
Based on stochastic optimization strategy, a formulation methodology is proposed for synthesizing distillation column sequences, allowing more than one middle component as the distributing components between a pair of...Based on stochastic optimization strategy, a formulation methodology is proposed for synthesizing distillation column sequences, allowing more than one middle component as the distributing components between a pair of key components in the non-sharp split. In order to represent and manipulate the distillation configuration structures, a new coding procedure is proposed in the form of one-dimensional array. Theoretically, an array can represent any kind of split(non-sharp and sharp). With the application of a binary sort tree approach, a robust flow sheet encoding and decoding procedure is developed so that the problem formulation and solution becomes tractable. In this paper,the synthesis problem is formulated as a mixed-integer nonlinear programming(MINLP) problem and an improved simulated annealing approach is adopted to solve the optimization problem. Besides, a shortcut method is applied to the evaluation of all required design parameters as well as the total function.展开更多
The group correlation properties of binary sequences is studied, and a conclusion is drawn that not only the group correlation function of a binary sequence itself is ideal, but also some of its subsets, which code le...The group correlation properties of binary sequences is studied, and a conclusion is drawn that not only the group correlation function of a binary sequence itself is ideal, but also some of its subsets, which code length N is even, is ideal. Finally a general formula of the group correlation of a binary sequence set is derived.展开更多
Infinite sequences defined with a finite alphabet are studied and it is shown that the set of sequences with bounded run-length has measure zero with respect to the Borel measure.Such sequences arise in many applicati...Infinite sequences defined with a finite alphabet are studied and it is shown that the set of sequences with bounded run-length has measure zero with respect to the Borel measure.Such sequences arise in many applications including digitization of certain linear systems involving flows on the circle and 2-torus,large scale simulation,and cryptology.They are basic objects of study in ergodic theory.展开更多
M-Sequences play a big important role,as the other binary orthogonal sequences,for collection the information on the input links and distribution these information on the output links of the communication channels and...M-Sequences play a big important role,as the other binary orthogonal sequences,for collection the information on the input links and distribution these information on the output links of the communication channels and for building new systems with more complexity,larger period,and security,through multiplication these sequences.In our article we try to study the construction of the multiplication sequence{zn}and its linear equivalent,this multiplication sequence is as multiple two sequences,the first sequence{an}is an arbitrary M-sequence and the second sequence{bn}is not completely different but is the reciprocal sequence of the first sequence{an}that is the reciprocal sequence has characteristic polynomial g(x)is reciprocal of f(x),which is the characteristic polynomial of the first sequence{an},also we will study the linear equivalent of the multiplication sequence{zn}and we will see that the length of the linear equivalent of{zn}is equal to((deg f(x))^(2)-deg(f(x)).展开更多
It is well known that the periodic performance of spread spectrum sequence heavily affects the correlative and secure characteristics of communication systems. The chaotic binary sequence is paid more and more attenti...It is well known that the periodic performance of spread spectrum sequence heavily affects the correlative and secure characteristics of communication systems. The chaotic binary sequence is paid more and more attention since it is one kind of applicable spread spectrum sequences. However, there are unavoidable short cyclic problems for chaotic binary sequences in finite precision. The chaotic binary sequence generating methods are studied first. Then the short cyclic behavior of the chaotic sequences is analyzed in detail, which are generated by quantification approaches with finite word-length. At the same time, a chaotic similar function is defined for presenting the cyclic characteristics of the sequences. Based on these efforts, an improved method with scrambling control for generating chaotic binary sequences is proposed. To quantitatively describe the improvement of periodic performance of the sequences, an orthogonal estimator is also defined. Some simulating results are provided. From the theoretical deduction and the experimental results, it is concluded that the proposed method can effectively increase the period and raise the complexity of the chaotic sequences to some extent.展开更多
With the rapid development of the Internet,a large number of private protocols emerge on the network.However,some of them are constructed by attackers to avoid being analyzed,posing a threat to computer network securi...With the rapid development of the Internet,a large number of private protocols emerge on the network.However,some of them are constructed by attackers to avoid being analyzed,posing a threat to computer network security.The blockchain uses the P2P protocol to implement various functions across the network.Furthermore,the P2P protocol format of blockchain may differ from the standard format specification,which leads to sniffing tools such as Wireshark and Fiddler not being able to recognize them.Therefore,the ability to distinguish different types of unknown network protocols is vital for network security.In this paper,we propose an unsupervised clustering algorithm based on maximum frequent sequences for binary protocols,which can distinguish various unknown protocols to provide support for analyzing unknown protocol formats.We mine the maximum frequent sequences of protocolmessage sets in bytes.Andwe calculate the fuzzymembership of the protocolmessage to each maximum frequent sequence,which is based on fuzzy set theory.Then we construct the fuzzy membership vector for each protocol message.Finally,we adopt K-means++to split different types of protocol messages into several clusters and evaluate the performance by calculating homogeneity,integrity,and Fowlkes and Mallows Index(FMI).Besides,the clustering algorithms based onNeedleman–Wunsch and the fixed-length prefix are compared with the algorithm presented in this paper.Compared with these traditional clustering methods,we demonstrate a certain improvement in the clustering performance of our work.展开更多
Evolutionary algorithm is applied for distillation separation sequence optimization synthesis problems with combination explosion. The binary tree data structure is used to describe the distillation separation sequenc...Evolutionary algorithm is applied for distillation separation sequence optimization synthesis problems with combination explosion. The binary tree data structure is used to describe the distillation separation sequence, and it is directly applied as the coding method. Genetic operators, which ensure to prohibit illegal filial generations completely, are designed by using the method of graph theory. The crossover operator based on a single parent or two parents is designed successfully. The example shows that the average ratio of search space from evolutionary algorithm with two-parent genetic operation is lower, whereas the rate of successful minimizations from evolutionary algorithm with single parent genetic operation is higher.展开更多
基金the National Natural Science Foundation of China，the Open Funds of State Key Laboratory of Information Security (Chinese Academy of Sciences)，the Program for New Century Excellent Talents in Fujian Province University
文摘We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.
基金the National Natural Science Foundation of China (No.60373092).
文摘Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = 2,3,the number of sequences with given k-error linear complexity and the expected k-error linear complexity are provided. Moreover,the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.
基金financially supported by the Strategic Scholarships Fellowship Research Network,Commission on Higher Education,Ministry of Education Thailand
文摘The conformational and dynamic properties of polypropylene （PP） for both pure melts and blends with different chain tacticity were investigated by Monte Carlo simulation of isotactic （iPP）, atactic （aPP） and syndiotactic （sPP） polypropylenes. The simulation of coarse-grained PP models was performed on a high coordination lattice incorporating short- and long-range intramolecular interactions from the rotational isomeric state （RIS） model and Lennard-Jones （LJ） potential function of propane pairs, respectively. The dynamics of chains in binary PP/PP mixture were investigated with the composition of C150H302 with different chain taciticity. The diffusion rates of PP with different stereochemistry are generally in the order as： iPP 〉 aPP 〉〉 sPP. For PP/PP blends with 50：50 wt% binary mixtures, immiscibility was observed when sPP was introduced into the mixtures. The diffusion rate of iPP and aPP became slower after mixing, while sPP diffuses significantly faster in the binary mixtures. The mobility of PP chains depends on both intramolecular （molecular size and chain stiffness） and intermolecular （chain packing） interactions. The effect of intramolecular contribution is greater than that of intermolecular contribution for iPP and aPP chains in binary mixtures. For sPP chain, intermolecular interaction has greater influence on the dynamics than intramolecular contribution.
基金Supported by the Natural Science Foundation of Anhui(1608085MF143)the National Natural Science Foundation of China(60573026,10101008)the Natural Science Foundation of Anhui Higher Education Institutions of China(KJ2018A0678)
文摘The sequences with good correlation properties are widely used in engineering applications, especially in the area of communications. In this paper, the relationships among crosscorrelation functions of arbitrary four binary sequences of period N are presented. Based on them, for a sequences set, the relationships between cross-correlation functions and autocorrelation functions are studied, by which we prove that they cannot keep optimal at the same time.
基金Supported by the National Natural Science Foun-dation of China (60373092)
文摘The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are two odd primes satisfying that 2 is a primitive root module p and q^2 and gcd（p-1, q-1） = 2, we analyze the relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.
文摘Stream cipher, DNA cryptography and DNA analysis are the most important R&D fields in both Cryptography and Bioinformatics. HC-256 is an emerged scheme as the new generation of stream ciphers for advanced network security. From a random sequencing viewpoint, both sequences of HC-256 and real DNA data may have intrinsic pseudo-random properties respectively. In a recent decade, many DNA sequencing projects are developed on cells, plants and animals over the world into huge DNA databases. Researchers notice that mammalian genomes encode thousands of large noncoding RNAs (lncRNAs), interact with chromatin regulatory complexes, and are thought to play a role in localizing these complexes to target loci across the genome. It is a challenge target using higher dimensional visualization tools to organize various complex interactive properties as visual maps. The Variant Map System (VMS) as an emerging scheme is systematically proposed in this paper to apply multiple maps that used four Meta symbols as same as DNA or RNA representations. System architecture of key components and core mechanism on the VMS are described. Key modules, equations and their I/O parameters are discussed. Applying the VM System, two sets of real DNA sequences from both sample human (noncoding DNA) and corn (coding DNA) genomes are collected in comparison with pseudo DNA sequences generated by HC-256 to show their intrinsic properties in higher levels of similar relationships among relevant DNA sequences on 2D maps. Sample 2D maps are listed and their characteristics are illustrated under controllable environment. Visual results are briefly analyzed to explore their intrinsic properties on selected genome sequences.
文摘Binary sequences constructed by Legendre symbols are widely used in communication and cryptography since they have many good pseudo-random properties.In this paper,we determine the 2-adic complexity of the sum sequence of any k many Legendre sequences and show that the 2-adic complexity of the sum sequences of any k many Legendre sequences reaches the maximum by proving the case of k=2 and 3,which implies that the sum sequences can resist the attack of rational approximation algorithm.
基金Supported by the Open Funds of Key Lab of Fujian Province University Network Security and Cryptology (07B005)the Funds of the Education Department of Fujian Province (JA07164)the Natural Science Foundation of Fujian Province of China (2007F3086)
文摘Two new families of finite binary sequences are constructed using multiplicative inverse. The sequences are shown to have strong pseudorandom properties by using some estimates of certain exponential sums over finite fields. The constructions can be implemented fast since multiplicative inverse over finite fields can be computed in polynomial time.
文摘Noise interfereuce and multiple access interference are the main impairment to the performance of DS/CDMA communication system. This letter presents that OverSampled Chaotic Map (OSCM) binary sequences are secure as spreading sequences, and based on the optimal quantizing method, the BER performance of the system has been derived in detail. the internal relationships among the number of users, the power of noise and the length of code chips are revealed in mathematical formulae. The performance of the system can be improved by employing these formulae. Numerical results conform the efficiency of discussion in this letter.
基金Supported by the National Natural Science Foundation of China under Grant 69972042
文摘This paper presents the definition of perfect punctured binary sequence pair and the combinatorial admissible conditions for searching the perfect punctured binary sequence pairs and proves that all of the pseudo-random binary sequences satisfy these conditions. Computer calculation verifies that the pseudo-random binary sequences with length up to N=127 can be easily turned into perfect punctured binary sequence pairs.
基金Supported by National Natural Science Foundation of China (69972042),Natural Science Fund of Hebei Provice(599245)and Science Foundation of Yanshan University
文摘A new set of binary sequences-Periodic Complementary Binary Sequence Pair (PCSP) is proposed. A new class of block design-Difference Family Pair (DFP) is also proposed.The relationship between PCSP and DFP, the properties and existing conditions of PCSP and the recursive constructions for PCSP are given.
基金supported by the National Natural Science Foundation of China(6160140161501395+6 种基金6160139961671402)Natural Science Foundation of Hebei Province(F2015203150F2016203293F2016203312)Natural Science Research Programs of Hebei Educational Committee(QN2016120)the Independent Research Programs for Young Teachers of Yanshan University(15LGB013)
文摘The concept of the binary sequence pair is generalized from a single binary sequence. Binary sequence pairs are applied in many fields of radar, sonar or communication systems, in which signals with optimal periodic correlation are required. Several types of almost perfect binary sequence pairs of length T = 2q are constructed, where q is an odd number. These almost perfect binary sequence pairs are based on binary ideal sequence or binary ideal two-level correlation sequence pairs by using Chinese remainder theorem. For these almost perfect binary sequence pairs with good balanced property, their corresponding divisible difference set pairs(DDSPs) are also derived.
基金Supported by the National Natural Science Foundation of China (No. 60872061,60971126,and 61172094)
文摘In this paper,a new class of almost binary sequence pair with a single zero element is presented.The almost binary sequence pairs with three-level correlation are constructed based on cyclotomic numbers of order 2,4,and 6.Most of them have good correlation and balance property,whose maximum nontrivial correlation magnitudes are 2 and the difference between the numbers of occurrence of +1's and-1's are 0 or 1.In addition,the corresponding binary sequence pairs are investigated as well and we can also get some kinds of binary sequence pairs with optimum balance and good correlation.
基金Supported by the 973 Program of China(2012CB720503)the Open Research Project of State Kay Laboratory of Chemical Engineering(SKL-Ch E-13B02)
文摘Based on stochastic optimization strategy, a formulation methodology is proposed for synthesizing distillation column sequences, allowing more than one middle component as the distributing components between a pair of key components in the non-sharp split. In order to represent and manipulate the distillation configuration structures, a new coding procedure is proposed in the form of one-dimensional array. Theoretically, an array can represent any kind of split(non-sharp and sharp). With the application of a binary sort tree approach, a robust flow sheet encoding and decoding procedure is developed so that the problem formulation and solution becomes tractable. In this paper,the synthesis problem is formulated as a mixed-integer nonlinear programming(MINLP) problem and an improved simulated annealing approach is adopted to solve the optimization problem. Besides, a shortcut method is applied to the evaluation of all required design parameters as well as the total function.
文摘The group correlation properties of binary sequences is studied, and a conclusion is drawn that not only the group correlation function of a binary sequence itself is ideal, but also some of its subsets, which code length N is even, is ideal. Finally a general formula of the group correlation of a binary sequence set is derived.
文摘Infinite sequences defined with a finite alphabet are studied and it is shown that the set of sequences with bounded run-length has measure zero with respect to the Borel measure.Such sequences arise in many applications including digitization of certain linear systems involving flows on the circle and 2-torus,large scale simulation,and cryptology.They are basic objects of study in ergodic theory.
文摘M-Sequences play a big important role,as the other binary orthogonal sequences,for collection the information on the input links and distribution these information on the output links of the communication channels and for building new systems with more complexity,larger period,and security,through multiplication these sequences.In our article we try to study the construction of the multiplication sequence{zn}and its linear equivalent,this multiplication sequence is as multiple two sequences,the first sequence{an}is an arbitrary M-sequence and the second sequence{bn}is not completely different but is the reciprocal sequence of the first sequence{an}that is the reciprocal sequence has characteristic polynomial g(x)is reciprocal of f(x),which is the characteristic polynomial of the first sequence{an},also we will study the linear equivalent of the multiplication sequence{zn}and we will see that the length of the linear equivalent of{zn}is equal to((deg f(x))^(2)-deg(f(x)).
基金the National Natural Science Foundation of China (60572075)the Natural Science Researching Project for Jiangsu Universities (05KJD510177).
文摘It is well known that the periodic performance of spread spectrum sequence heavily affects the correlative and secure characteristics of communication systems. The chaotic binary sequence is paid more and more attention since it is one kind of applicable spread spectrum sequences. However, there are unavoidable short cyclic problems for chaotic binary sequences in finite precision. The chaotic binary sequence generating methods are studied first. Then the short cyclic behavior of the chaotic sequences is analyzed in detail, which are generated by quantification approaches with finite word-length. At the same time, a chaotic similar function is defined for presenting the cyclic characteristics of the sequences. Based on these efforts, an improved method with scrambling control for generating chaotic binary sequences is proposed. To quantitatively describe the improvement of periodic performance of the sequences, an orthogonal estimator is also defined. Some simulating results are provided. From the theoretical deduction and the experimental results, it is concluded that the proposed method can effectively increase the period and raise the complexity of the chaotic sequences to some extent.
基金National Natural Science Foundation of China under Grant No.61872111Sichuan Science and Technology Program(No.2019YFSY0049)the“Project for the Development and Application of Safety Testing and Verification Platform for Industrial Robots”of the Ministry of Industry and Information Technology.
文摘With the rapid development of the Internet,a large number of private protocols emerge on the network.However,some of them are constructed by attackers to avoid being analyzed,posing a threat to computer network security.The blockchain uses the P2P protocol to implement various functions across the network.Furthermore,the P2P protocol format of blockchain may differ from the standard format specification,which leads to sniffing tools such as Wireshark and Fiddler not being able to recognize them.Therefore,the ability to distinguish different types of unknown network protocols is vital for network security.In this paper,we propose an unsupervised clustering algorithm based on maximum frequent sequences for binary protocols,which can distinguish various unknown protocols to provide support for analyzing unknown protocol formats.We mine the maximum frequent sequences of protocolmessage sets in bytes.Andwe calculate the fuzzymembership of the protocolmessage to each maximum frequent sequence,which is based on fuzzy set theory.Then we construct the fuzzy membership vector for each protocol message.Finally,we adopt K-means++to split different types of protocol messages into several clusters and evaluate the performance by calculating homogeneity,integrity,and Fowlkes and Mallows Index(FMI).Besides,the clustering algorithms based onNeedleman–Wunsch and the fixed-length prefix are compared with the algorithm presented in this paper.Compared with these traditional clustering methods,we demonstrate a certain improvement in the clustering performance of our work.
文摘Evolutionary algorithm is applied for distillation separation sequence optimization synthesis problems with combination explosion. The binary tree data structure is used to describe the distillation separation sequence, and it is directly applied as the coding method. Genetic operators, which ensure to prohibit illegal filial generations completely, are designed by using the method of graph theory. The crossover operator based on a single parent or two parents is designed successfully. The example shows that the average ratio of search space from evolutionary algorithm with two-parent genetic operation is lower, whereas the rate of successful minimizations from evolutionary algorithm with single parent genetic operation is higher.
