The FPGA realization of the general cellular automata based cryptographic hash functions: Performance and effectiveness

Directory of Open Access Journals (Sweden)

P. G. Klyucharev

2014-01-01

Full Text Available In the paper the author considers hardware implementation of the GRACE-H family general cellular automata based cryptographic hash functions. VHDL is used as a language and Altera FPGA as a platform for hardware implementation. Performance and effectiveness of the FPGA implementations of GRACE-H hash functions were compared with Keccak (SHA-3, SHA-256, BLAKE, Groestl, JH, Skein hash functions. According to the performed tests, performance of the hardware implementation of GRACE-H family hash functions significantly (up to 12 times exceeded performance of the hardware implementation of previously known hash functions, and effectiveness of that hardware implementation was also better (up to 4 times.

Proposals for Iterated Hash Functions

DEFF Research Database (Denmark)

Knudsen, Lars Ramkilde; Thomsen, Søren Steffen

2008-01-01

The past few years have seen an increase in the number of attacks on cryptographic hash functions. These include attacks directed at specific hash functions, and generic attacks on the typical method of constructing hash functions. In this paper we discuss possible methods for protecting against...... some generic attacks. We also give a concrete proposal for a new hash function construction, given a secure compression function which, unlike in typical existing constructions, is not required to be resistant to all types of collisions. Finally, we show how members of the SHA-family can be turned...

Proposals for iterated hash functions

DEFF Research Database (Denmark)

Knudsen, Lars Ramkilde; Thomsen, Søren Steffen

2006-01-01

The past few years have seen an increase in the number of attacks on cryptographic hash functions. These include attacks directed at specific hash functions, and generic attacks on the typical method of constructing hash functions. In this paper we discuss possible methods for protecting against...... some generic attacks. We also give a concrete proposal for a new hash function construction, given a secure compression function which, unlike in typical existing constructions, is not required to be resistant to all types of collisions. Finally, we show how members of the SHA-family can be turned...

Cryptanalysis of an Iterated Halving-based hash function: CRUSH

DEFF Research Database (Denmark)

Bagheri, Nasour; Henricksen, Matt; Knudsen, Lars Ramkilde

2009-01-01

Iterated Halving has been suggested as a replacement to the Merkle–Damgård (MD) construction in 2004 anticipating the attacks on the MDx family of hash functions. The CRUSH hash function provides a specific instantiation of the block cipher for Iterated Halving. The authors identify structural pr...

The Grindahl Hash Functions

DEFF Research Database (Denmark)

Knudsen, Lars Ramkilde; Rechberger, Christian; Thomsen, Søren Steffen

2007-01-01

to the state. We propose two concrete hash functions, Grindahl-256 and Grindahl-512 with claimed security levels with respect to collision, preimage and second preimage attacks of 2^128 and 2^256, respectively. Both proposals have lower memory requirements than other hash functions at comparable speeds...

Cryptanalysis of Tav-128 hash function

DEFF Research Database (Denmark)

Many RFID protocols use cryptographic hash functions for their security. The resource constrained nature of RFID systems forces the use of light weight cryptographic algorithms. Tav-128 is one such 128-bit light weight hash function proposed by Peris-Lopez et al. for a low-cost RFID tag...... authentication protocol. Apart from some statistical tests for randomness by the designers themselves, Tav-128 has not undergone any other thorough security analysis. Based on these tests, the designers claimed that Tav-128 does not posses any trivial weaknesses. In this article, we carry out the first third...... party security analysis of Tav-128 and show that this hash function is neither collision resistant nor second preimage resistant. Firstly, we show a practical collision attack on Tav-128 having a complexity of 237 calls to the compression function and produce message pairs of arbitrary length which...

DEVELOPMENT AND IMPLEMENTATION OF HASH FUNCTION FOR GENERATING HASHED MESSAGE

Directory of Open Access Journals (Sweden)

Amir Ghaeedi

2016-09-01

Full Text Available Steganography is a method of sending confidential information in a way that the existence of the channel in this communication remains secret. A collaborative approach between steganography and digital signature provides a high secure hidden data. Unfortunately, there are wide varieties of attacks that affect the quality of image steganography. Two issues that required to be addressed are large size of the ciphered data in digital signature and high bandwidth. The aim of the research is to propose a new method for producing a dynamic hashed message algorithm in digital signature and then embedded into image for enhancing robustness of image steganography with reduced bandwidth. A digital signature with smaller hash size than other hash algorithms was developed for authentication purposes. A hash function is used in the digital signature generation. The encoder function encoded the hashed message to generate the digital signature and then embedded into an image as a stego-image. In enhancing the robustness of the digital signature, we compressed or encoded it or performed both operations before embedding the data into the image. This encryption algorithm is also computationally efficient whereby for messages with the sizes less than 1600 bytes, the hashed file reduced the original file up to 8.51%.

Ranking Based Locality Sensitive Hashing Enabled Cancelable Biometrics: Index-of-Max Hashing

OpenAIRE

Jin, Zhe; Lai, Yen-Lung; Hwang, Jung-Yeon; Kim, Soohyung; Teoh, Andrew Beng Jin

2017-01-01

In this paper, we propose a ranking based locality sensitive hashing inspired two-factor cancelable biometrics, dubbed "Index-of-Max" (IoM) hashing for biometric template protection. With externally generated random parameters, IoM hashing transforms a real-valued biometric feature vector into discrete index (max ranked) hashed code. We demonstrate two realizations from IoM hashing notion, namely Gaussian Random Projection based and Uniformly Random Permutation based hashing schemes. The disc...

On hash functions using checksums

DEFF Research Database (Denmark)

Gauravaram, Praveen; Kelsey, John; Knudsen, Lars Ramkilde

2010-01-01

We analyse the security of iterated hash functions that compute an input dependent checksum which is processed as part of the hash computation. We show that a large class of such schemes, including those using non-linear or even one-way checksum functions, is not secure against the second preimag...

On hash functions using checksums

DEFF Research Database (Denmark)

Gauravaram, Praveen; Kelsey, John; Knudsen, Lars Ramkilde

2008-01-01

We analyse the security of iterated hash functions that compute an input dependent checksum which is processed as part of the hash computation. We show that a large class of such schemes, including those using non-linear or even one-way checksum functions, is not secure against the second preimag...

One-way Hash function construction based on the chaotic map with changeable-parameter

International Nuclear Information System (INIS)

Xiao Di; Liao Xiaofeng; Deng Shaojiang

2005-01-01

An algorithm for one-way Hash function construction based on the chaotic map with changeable-parameter is proposed in this paper. A piecewise linear chaotic map with changeable-parameter P is chosen, and cipher block chaining mode (CBC) is introduced to ensure that the parameter P in each iteration is dynamically decided by the last-time iteration value and the corresponding message bit in different positions. The final Hash value is obtained by means of the linear transform on the iteration sequence. Theoretical analysis and computer simulation indicate that our algorithm can satisfy all the performance requirements of Hash function in an efficient and flexible manner. It is practicable and reliable, with high potential to be adopted for E-commerce

One-way Hash function construction based on the chaotic map with changeable-parameter

Energy Technology Data Exchange (ETDEWEB)

Xiao Di [College of Computer Science and Engineering, Chongqing University, Chongqing 400044 (China) and College of Mechanical Engineering, Chongqing University, Chongqing 400044 (China)]. E-mail: xiaodi_cqu@hotmail.com; Liao Xiaofeng [College of Computer Science and Engineering, Chongqing University, Chongqing 400044 (China)]. E-mail: xfliao@cqu.edu.cn; Deng Shaojiang [College of Computer Science and Engineering, Chongqing University, Chongqing 400044 (China)

2005-04-01

An algorithm for one-way Hash function construction based on the chaotic map with changeable-parameter is proposed in this paper. A piecewise linear chaotic map with changeable-parameter P is chosen, and cipher block chaining mode (CBC) is introduced to ensure that the parameter P in each iteration is dynamically decided by the last-time iteration value and the corresponding message bit in different positions. The final Hash value is obtained by means of the linear transform on the iteration sequence. Theoretical analysis and computer simulation indicate that our algorithm can satisfy all the performance requirements of Hash function in an efficient and flexible manner. It is practicable and reliable, with high potential to be adopted for E-commerce.

The hash function BLAKE

CERN Document Server

Aumasson, Jean-Philippe; Phan, Raphael; Henzen, Luca

2014-01-01

This is a comprehensive description of the cryptographic hash function BLAKE, one of the five final contenders in the NIST SHA3 competition, and of BLAKE2, an improved version popular among developers. It describes how BLAKE was designed and why BLAKE2 was developed, and it offers guidelines on implementing and using BLAKE, with a focus on software implementation.   In the first two chapters, the authors offer a short introduction to cryptographic hashing, the SHA3 competition, and BLAKE. They review applications of cryptographic hashing, they describe some basic notions such as security de

Cryptanalysis of Tav-128 hash function

DEFF Research Database (Denmark)

Kumar, Ashish; Sanadhya, Somitra Kumar; Gauravaram, Praveen

2010-01-01

Many RFID protocols use cryptographic hash functions for their security. The resource constrained nature of RFID systems forces the use of light weight cryptographic algorithms. Tav-128 is one such 128-bit light weight hash function proposed by Peris-Lopez et al. for a low-cost RFID tag authentic...

Cryptographic Hash Functions

DEFF Research Database (Denmark)

Gauravaram, Praveen; Knudsen, Lars Ramkilde

2010-01-01

functions, also called message authentication codes (MACs) serve data integrity and data origin authentication in the secret key setting. The building blocks of hash functions can be designed using block ciphers, modular arithmetic or from scratch. The design principles of the popular Merkle...

Security problems with a chaos-based deniable authentication scheme

International Nuclear Information System (INIS)

Alvarez, Gonzalo

2005-01-01

Recently, a new scheme was proposed for deniable authentication. Its main originality lied on applying a chaos-based encryption-hash parallel algorithm and the semi-group property of the Chebyshev chaotic map. Although original and practicable, its insecurity and inefficiency are shown in this paper, thus rendering it inadequate for adoption in e-commerce

Security problems with a chaos-based deniable authentication scheme

Energy Technology Data Exchange (ETDEWEB)

Alvarez, Gonzalo [Instituto de Fisica Aplicada, Consejo Superior de Investigaciones Cientificas, Serrano 144, 28006 Madrid (Spain)] e-mail: gonzalo@iec.csic.es

2005-10-01

Recently, a new scheme was proposed for deniable authentication. Its main originality lied on applying a chaos-based encryption-hash parallel algorithm and the semi-group property of the Chebyshev chaotic map. Although original and practicable, its insecurity and inefficiency are shown in this paper, thus rendering it inadequate for adoption in e-commerce.

Incremental cryptography and security of public hash functions ...

African Journals Online (AJOL)

An investigation of incremental algorithms for crytographic functions was initiated. The problem, for collision-free hashing, is to design a scheme for which there exists an efficient “update” algorithm: this algorithm is given the hash function H, the hash h = H(M) of message M and the “replacement request” (j, m), and outputs ...

Hash function construction using weighted complex dynamical networks

International Nuclear Information System (INIS)

Song Yu-Rong; Jiang Guo-Ping

2013-01-01

A novel scheme to construct a hash function based on a weighted complex dynamical network (WCDN) generated from an original message is proposed in this paper. First, the original message is divided into blocks. Then, each block is divided into components, and the nodes and weighted edges are well defined from these components and their relations. Namely, the WCDN closely related to the original message is established. Furthermore, the node dynamics of the WCDN are chosen as a chaotic map. After chaotic iterations, quantization and exclusive-or operations, the fixed-length hash value is obtained. This scheme has the property that any tiny change in message can be diffused rapidly through the WCDN, leading to very different hash values. Analysis and simulation show that the scheme possesses good statistical properties, excellent confusion and diffusion, strong collision resistance and high efficiency. (general)

Cryptanalysis on a parallel keyed hash function based on chaotic maps

International Nuclear Information System (INIS)

Guo Wei; Wang Xiaoming; He Dake; Cao Yang

2009-01-01

This Letter analyzes the security of a novel parallel keyed hash function based on chaotic maps, proposed by Xiao et al. to improve the efficiency in parallel computing environment. We show how to devise forgery attacks on Xiao's scheme with differential cryptanalysis and give the experiment results of two kinds of forgery attacks firstly. Furthermore, we discuss the problem of weak keys in the scheme and demonstrate how to utilize weak keys to construct collision.

Security Analysis of Randomize-Hash-then-Sign Digital Signatures

DEFF Research Database (Denmark)

Gauravaram, Praveen; Knudsen, Lars Ramkilde

2012-01-01

At CRYPTO 2006, Halevi and Krawczyk proposed two randomized hash function modes and analyzed the security of digital signature algorithms based on these constructions. They showed that the security of signature schemes based on the two randomized hash function modes relies on properties similar...... functions, such as for the Davies-Meyer construction used in the popular hash functions such as MD5 designed by Rivest and the SHA family of hash functions designed by the National Security Agency (NSA), USA and published by NIST in the Federal Information Processing Standards (FIPS). We show an online...... 800-106. We discuss some important applications of our attacks and discuss their applicability on signature schemes based on hash functions with ‘built-in’ randomization. Finally, we compare our attacks on randomize-hash-then-sign schemes with the generic forgery attacks on the standard hash...

Final report for LDRD Project 93633 : new hash function for data protection.

Energy Technology Data Exchange (ETDEWEB)

Draelos, Timothy John; Dautenhahn, Nathan; Schroeppel, Richard Crabtree; Tolk, Keith Michael; Orman, Hilarie (PurpleStreak, Inc.); Walker, Andrea Mae; Malone, Sean; Lee, Eric; Neumann, William Douglas; Cordwell, William R.; Torgerson, Mark Dolan; Anderson, Eric; Lanzone, Andrew J.; Collins, Michael Joseph; McDonald, Timothy Scott; Caskey, Susan Adele

2009-03-01

The security of the widely-used cryptographic hash function SHA1 has been impugned. We have developed two replacement hash functions. The first, SHA1X, is a drop-in replacement for SHA1. The second, SANDstorm, has been submitted as a candidate to the NIST-sponsored SHA3 Hash Function competition.

Error function attack of chaos synchronization based encryption schemes.

Science.gov (United States)

Wang, Xingang; Zhan, Meng; Lai, C-H; Gang, Hu

2004-03-01

Different chaos synchronization based encryption schemes are reviewed and compared from the practical point of view. As an efficient cryptanalysis tool for chaos encryption, a proposal based on the error function attack is presented systematically and used to evaluate system security. We define a quantitative measure (quality factor) of the effective applicability of a chaos encryption scheme, which takes into account the security, the encryption speed, and the robustness against channel noise. A comparison is made of several encryption schemes and it is found that a scheme based on one-way coupled chaotic map lattices performs outstandingly well, as judged from quality factor. Copyright 2004 American Institute of Physics.

Cryptographic quantum hashing

Science.gov (United States)

Ablayev, F. M.; Vasiliev, A. V.

2014-02-01

We present a version of quantum hash functions based on non-binary discrete functions. The proposed quantum procedure is ‘classical-quantum’, that is, it takes a classical bit string as an input and produces a quantum state. The resulting function has the property of a one-way function (pre-image resistance); in addition it has properties analogous to classical cryptographic hash second pre-image resistance and collision resistance. We also show that the proposed function can be naturally used in a quantum digital signature protocol.

Cryptographic quantum hashing

International Nuclear Information System (INIS)

Ablayev, F M; Vasiliev, A V

2014-01-01

We present a version of quantum hash functions based on non-binary discrete functions. The proposed quantum procedure is ‘classical-quantum’, that is, it takes a classical bit string as an input and produces a quantum state. The resulting function has the property of a one-way function (pre-image resistance); in addition it has properties analogous to classical cryptographic hash second pre-image resistance and collision resistance. We also show that the proposed function can be naturally used in a quantum digital signature protocol. (letter)

Linear Subspace Ranking Hashing for Cross-Modal Retrieval.

Science.gov (United States)

Li, Kai; Qi, Guo-Jun; Ye, Jun; Hua, Kien A

2017-09-01

Hashing has attracted a great deal of research in recent years due to its effectiveness for the retrieval and indexing of large-scale high-dimensional multimedia data. In this paper, we propose a novel ranking-based hashing framework that maps data from different modalities into a common Hamming space where the cross-modal similarity can be measured using Hamming distance. Unlike existing cross-modal hashing algorithms where the learned hash functions are binary space partitioning functions, such as the sign and threshold function, the proposed hashing scheme takes advantage of a new class of hash functions closely related to rank correlation measures which are known to be scale-invariant, numerically stable, and highly nonlinear. Specifically, we jointly learn two groups of linear subspaces, one for each modality, so that features' ranking orders in different linear subspaces maximally preserve the cross-modal similarities. We show that the ranking-based hash function has a natural probabilistic approximation which transforms the original highly discontinuous optimization problem into one that can be efficiently solved using simple gradient descent algorithms. The proposed hashing framework is also flexible in the sense that the optimization procedures are not tied up to any specific form of loss function, which is typical for existing cross-modal hashing methods, but rather we can flexibly accommodate different loss functions with minimal changes to the learning steps. We demonstrate through extensive experiments on four widely-used real-world multimodal datasets that the proposed cross-modal hashing method can achieve competitive performance against several state-of-the-arts with only moderate training and testing time.

Fast and powerful hashing using tabulation

DEFF Research Database (Denmark)

Thorup, Mikkel

2017-01-01

Randomized algorithms are often enjoyed for their simplicity, but the hash functions employed to yield the desired probabilistic guarantees are often too complicated to be practical. Here, we survey recent results on how simple hashing schemes based on tabulation provide unexpectedly strong......, linear probing and Cuckoo hashing. Next, we consider twisted tabulation where one input character is "twisted" in a simple way. The resulting hash function has powerful distributional properties: Chernoffstyle tail bounds and a very small bias for minwise hashing. This is also yields an extremely fast...... pseudorandom number generator that is provably good for many classic randomized algorithms and data-structures. Finally, we consider double tabulation where we compose two simple tabulation functions, applying one to the output of the other, and show that this yields very high independence in the classic...

Efficient computation of hashes

International Nuclear Information System (INIS)

Lopes, Raul H C; Franqueira, Virginia N L; Hobson, Peter R

2014-01-01

The sequential computation of hashes at the core of many distributed storage systems and found, for example, in grid services can hinder efficiency in service quality and even pose security challenges that can only be addressed by the use of parallel hash tree modes. The main contributions of this paper are, first, the identification of several efficiency and security challenges posed by the use of sequential hash computation based on the Merkle-Damgard engine. In addition, alternatives for the parallel computation of hash trees are discussed, and a prototype for a new parallel implementation of the Keccak function, the SHA-3 winner, is introduced.

Online Hashing for Scalable Remote Sensing Image Retrieval

Directory of Open Access Journals (Sweden)

Peng Li

2018-05-01

Full Text Available Recently, hashing-based large-scale remote sensing (RS image retrieval has attracted much attention. Many new hashing algorithms have been developed and successfully applied to fast RS image retrieval tasks. However, there exists an important problem rarely addressed in the research literature of RS image hashing. The RS images are practically produced in a streaming manner in many real-world applications, which means the data distribution keeps changing over time. Most existing RS image hashing methods are batch-based models whose hash functions are learned once for all and kept fixed all the time. Therefore, the pre-trained hash functions might not fit the ever-growing new RS images. Moreover, the batch-based models have to load all the training images into memory for model learning, which consumes many computing and memory resources. To address the above deficiencies, we propose a new online hashing method, which learns and adapts its hashing functions with respect to the newly incoming RS images in terms of a novel online partial random learning scheme. Our hash model is updated in a sequential mode such that the representative power of the learned binary codes for RS images are improved accordingly. Moreover, benefiting from the online learning strategy, our proposed hashing approach is quite suitable for scalable real-world remote sensing image retrieval. Extensive experiments on two large-scale RS image databases under online setting demonstrated the efficacy and effectiveness of the proposed method.

Structure Sensitive Hashing With Adaptive Product Quantization.

Science.gov (United States)

Liu, Xianglong; Du, Bowen; Deng, Cheng; Liu, Ming; Lang, Bo

2016-10-01

Hashing has been proved as an attractive solution to approximate nearest neighbor search, owing to its theoretical guarantee and computational efficiency. Though most of prior hashing algorithms can achieve low memory and computation consumption by pursuing compact hash codes, however, they are still far beyond the capability of learning discriminative hash functions from the data with complex inherent structure among them. To address this issue, in this paper, we propose a structure sensitive hashing based on cluster prototypes, which explicitly exploits both global and local structures. An alternating optimization algorithm, respectively, minimizing the quantization loss and spectral embedding loss, is presented to simultaneously discover the cluster prototypes for each hash function, and optimally assign unique binary codes to them satisfying the affinity alignment between them. For hash codes of a desired length, an adaptive bit assignment is further appended to the product quantization of the subspaces, approximating the Hamming distances and meanwhile balancing the variance among hash functions. Experimental results on four large-scale benchmarks CIFAR-10, NUS-WIDE, SIFT1M, and GIST1M demonstrate that our approach significantly outperforms state-of-the-art hashing methods in terms of semantic and metric neighbor search.

Authentication codes from ε-ASU hash functions with partially secret keys

NARCIS (Netherlands)

Liu, S.L.; Tilborg, van H.C.A.; Weng, J.; Chen, Kefei

2014-01-01

An authentication code can be constructed with a family of e-Almost strong universal (e-ASU) hash functions, with the index of hash functions as the authentication key. This paper considers the performance of authentication codes from e-ASU, when the authentication key is only partially secret. We

Neighborhood Discriminant Hashing for Large-Scale Image Retrieval.

Science.gov (United States)

Tang, Jinhui; Li, Zechao; Wang, Meng; Zhao, Ruizhen

2015-09-01

With the proliferation of large-scale community-contributed images, hashing-based approximate nearest neighbor search in huge databases has aroused considerable interest from the fields of computer vision and multimedia in recent years because of its computational and memory efficiency. In this paper, we propose a novel hashing method named neighborhood discriminant hashing (NDH) (for short) to implement approximate similarity search. Different from the previous work, we propose to learn a discriminant hashing function by exploiting local discriminative information, i.e., the labels of a sample can be inherited from the neighbor samples it selects. The hashing function is expected to be orthogonal to avoid redundancy in the learned hashing bits as much as possible, while an information theoretic regularization is jointly exploited using maximum entropy principle. As a consequence, the learned hashing function is compact and nonredundant among bits, while each bit is highly informative. Extensive experiments are carried out on four publicly available data sets and the comparison results demonstrate the outperforming performance of the proposed NDH method over state-of-the-art hashing techniques.

Side channel analysis of some hash based MACs: A response to SHA-3 requirements

DEFF Research Database (Denmark)

Gauravaram, Praveen; Okeya, Katsuyuki

2008-01-01

The forthcoming NIST's Advanced Hash Standard (AHS) competition to select SHA-3 hash function requires that each candidate hash function submission must have at least one construction to support FIPS 198 HMAC application. As part of its evaluation, NIST is aiming to select either a candidate hash...

Cache-Oblivious Hashing

DEFF Research Database (Denmark)

Pagh, Rasmus; Wei, Zhewei; Yi, Ke

2014-01-01

The hash table, especially its external memory version, is one of the most important index structures in large databases. Assuming a truly random hash function, it is known that in a standard external hash table with block size b, searching for a particular key only takes expected average t q =1...

Analysis and Implementation of Cryptographic Hash Functions in Programmable Logic Devices

Directory of Open Access Journals (Sweden)

Tautvydas Brukštus

2016-06-01

Full Text Available In this day’s world, more and more focused on data pro-tection. For data protection using cryptographic science. It is also important for the safe storage of passwords for this uses a cryp-tographic hash function. In this article has been selected the SHA-256 cryptographic hash function to implement and explore, based on fact that it is now a popular and safe. SHA-256 cryp-tographic function did not find any theoretical gaps or conflict situations. Also SHA-256 cryptographic hash function used cryptographic currencies. Currently cryptographic currency is popular and their value is high. For the measurements have been chosen programmable logic integrated circuits as they less effi-ciency then ASIC. We chose Altera Corporation produced prog-rammable logic integrated circuits. Counting speed will be inves-tigated by three programmable logic integrated circuit. We will use programmable logic integrated circuits belong to the same family, but different generations. Each programmable logic integ-rated circuit made using different dimension technology. Choo-sing these programmable logic integrated circuits: EP3C16, EP4CE115 and 5CSEMA5F31. To compare calculations perfor-mances parameters are provided in the tables and graphs. Re-search show the calculation speed and stability of different prog-rammable logic circuits.

Deep Hashing Based Fusing Index Method for Large-Scale Image Retrieval

Directory of Open Access Journals (Sweden)

Lijuan Duan

2017-01-01

Full Text Available Hashing has been widely deployed to perform the Approximate Nearest Neighbor (ANN search for the large-scale image retrieval to solve the problem of storage and retrieval efficiency. Recently, deep hashing methods have been proposed to perform the simultaneous feature learning and the hash code learning with deep neural networks. Even though deep hashing has shown the better performance than traditional hashing methods with handcrafted features, the learned compact hash code from one deep hashing network may not provide the full representation of an image. In this paper, we propose a novel hashing indexing method, called the Deep Hashing based Fusing Index (DHFI, to generate a more compact hash code which has stronger expression ability and distinction capability. In our method, we train two different architecture’s deep hashing subnetworks and fuse the hash codes generated by the two subnetworks together to unify images. Experiments on two real datasets show that our method can outperform state-of-the-art image retrieval applications.

On Randomizing Hash Functions to Strengthen the Security of Digital Signatures

DEFF Research Database (Denmark)

Halevi and Krawczyk proposed a message randomization algorithm called RMX as a front-end tool to the hash-then-sign digital signature schemes such as DSS and RSA in order to free their reliance on the collision resistance property of the hash functions. They have shown that to forge a RMX-hash-th...... that use Davies-Meyer schemes and a variant of RMX published by NIST in its Draft Special Publication (SP) 800-106. We discuss some important applications of our attack....

On randomizing hash functions to strengthen the security of digital signatures

DEFF Research Database (Denmark)

Gauravaram, Praveen; Knudsen, Lars Ramkilde

2009-01-01

Halevi and Krawczyk proposed a message randomization algorithm called RMX as a front-end tool to the hash-then-sign digital signature schemes such as DSS and RSA in order to free their reliance on the collision resistance property of the hash functions. They have shown that to forge a RMX-hash-th...... schemes that use Davies-Meyer schemes and a variant of RMX published by NIST in its Draft Special Publication (SP) 800-106. We discuss some important applications of our attack....

Large-Scale Unsupervised Hashing with Shared Structure Learning.

Science.gov (United States)

Liu, Xianglong; Mu, Yadong; Zhang, Danchen; Lang, Bo; Li, Xuelong

2015-09-01

Hashing methods are effective in generating compact binary signatures for images and videos. This paper addresses an important open issue in the literature, i.e., how to learn compact hash codes by enhancing the complementarity among different hash functions. Most of prior studies solve this problem either by adopting time-consuming sequential learning algorithms or by generating the hash functions which are subject to some deliberately-designed constraints (e.g., enforcing hash functions orthogonal to one another). We analyze the drawbacks of past works and propose a new solution to this problem. Our idea is to decompose the feature space into a subspace shared by all hash functions and its complementary subspace. On one hand, the shared subspace, corresponding to the common structure across different hash functions, conveys most relevant information for the hashing task. Similar to data de-noising, irrelevant information is explicitly suppressed during hash function generation. On the other hand, in case that the complementary subspace also contains useful information for specific hash functions, the final form of our proposed hashing scheme is a compromise between these two kinds of subspaces. To make hash functions not only preserve the local neighborhood structure but also capture the global cluster distribution of the whole data, an objective function incorporating spectral embedding loss, binary quantization loss, and shared subspace contribution is introduced to guide the hash function learning. We propose an efficient alternating optimization method to simultaneously learn both the shared structure and the hash functions. Experimental results on three well-known benchmarks CIFAR-10, NUS-WIDE, and a-TRECVID demonstrate that our approach significantly outperforms state-of-the-art hashing methods.

Multiview alignment hashing for efficient image search.

Science.gov (United States)

Liu, Li; Yu, Mengyang; Shao, Ling

2015-03-01

Hashing is a popular and efficient method for nearest neighbor search in large-scale data spaces by embedding high-dimensional feature descriptors into a similarity preserving Hamming space with a low dimension. For most hashing methods, the performance of retrieval heavily depends on the choice of the high-dimensional feature descriptor. Furthermore, a single type of feature cannot be descriptive enough for different images when it is used for hashing. Thus, how to combine multiple representations for learning effective hashing functions is an imminent task. In this paper, we present a novel unsupervised multiview alignment hashing approach based on regularized kernel nonnegative matrix factorization, which can find a compact representation uncovering the hidden semantics and simultaneously respecting the joint probability distribution of data. In particular, we aim to seek a matrix factorization to effectively fuse the multiple information sources meanwhile discarding the feature redundancy. Since the raised problem is regarded as nonconvex and discrete, our objective function is then optimized via an alternate way with relaxation and converges to a locally optimal solution. After finding the low-dimensional representation, the hashing functions are finally obtained through multivariable logistic regression. The proposed method is systematically evaluated on three data sets: 1) Caltech-256; 2) CIFAR-10; and 3) CIFAR-20, and the results show that our method significantly outperforms the state-of-the-art multiview hashing techniques.

The suffix-free-prefix-free hash function construction and its indifferentiability security analysis

DEFF Research Database (Denmark)

Bagheri, Nasour; Gauravaram, Praveen; Knudsen, Lars R.

2012-01-01

In this paper, we observe that in the seminal work on indifferentiability analysis of iterated hash functions by Coron et al. and in subsequent works, the initial value $$(IV)$$ of hash functions is fixed. In addition, these indifferentiability results do not depend on the Merkle–Damgård (MD) str...

Discriminative Projection Selection Based Face Image Hashing

Science.gov (United States)

Karabat, Cagatay; Erdogan, Hakan

Face image hashing is an emerging method used in biometric verification systems. In this paper, we propose a novel face image hashing method based on a new technique called discriminative projection selection. We apply the Fisher criterion for selecting the rows of a random projection matrix in a user-dependent fashion. Moreover, another contribution of this paper is to employ a bimodal Gaussian mixture model at the quantization step. Our simulation results on three different databases demonstrate that the proposed method has superior performance in comparison to previously proposed random projection based methods.

Internal differential collision attacks on the reduced-round Grøstl-0 hash function

DEFF Research Database (Denmark)

Ideguchi, Kota; Tischhauser, Elmar Wolfgang; Preneel, Bart

2014-01-01

. This results in collision attacks and semi-free-start collision attacks on the Grøstl-0 hash function and compression function with reduced rounds. Specifically, we show collision attacks on the Grøstl-0-256 hash function reduced to 5 and 6 out of 10 rounds with time complexities 248 and 2112 and on the Grøstl......-0-512 hash function reduced to 6 out of 14 rounds with time complexity 2183. Furthermore, we demonstrate semi-free-start collision attacks on the Grøstl-0-256 compression function reduced to 8 rounds and the Grøstl-0-512 compression function reduced to 9 rounds. Finally, we show improved...

Side channel analysis of some hash based MACs:A response to SHA-3 requirements

DEFF Research Database (Denmark)

The forthcoming NIST's Advanced Hash Standard (AHS) competition to select SHA-3 hash function requires that each candidate hash function submission must have at least one construction to support FIPS 198 HMAC application. As part of its evaluation, NIST is aiming to select either a candidate hash...... function which is more resistant to known side channel attacks (SCA) when plugged into HMAC, or that has an alternative MAC mode which is more resistant to known SCA than the other submitted alternatives. In response to this, we perform differential power analysis (DPA) on the possible smart card...... implementations of some of the recently proposed MAC alternatives to NMAC (a fully analyzed variant of HMAC) and HMAC algorithms and NMAC/HMAC versions of some recently proposed hash and compression function modes. We show that the recently proposed BNMAC and KMDP MAC schemes are even weaker than NMAC...

Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512

DEFF Research Database (Denmark)

Gauravaram, Praveen; Leurent, Gaëtan; Mendel, Florian

2010-01-01

In this paper, we analyze SHAvite-3-512 hash function, as proposed for round 2 of the SHA-3 competition. We present cryptanalytic results on 10 out of 14 rounds of the hash function SHAvite-3-512, and on the full 14 round compression function of SHAvite-3-512. We show a second preimage attack on ...

Construction of secure and fast hash functions using nonbinary error-correcting codes

DEFF Research Database (Denmark)

Knudsen, Lars Ramkilde; Preneel, Bart

2002-01-01

constructions based on block ciphers such as the Data Encryption Standard (DES), where the key size is slightly smaller than the block size; IDEA, where the key size is twice the block size; Advanced Encryption Standard (AES), with a variable key size; and to MD4-like hash functions. Under reasonable...

Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption

Science.gov (United States)

Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min

2016-01-01

Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.

Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption

Science.gov (United States)

Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min

2016-01-01

Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information. PMID:26823196

Practical Attacks on AES-like Cryptographic Hash Functions

DEFF Research Database (Denmark)

Kölbl, Stefan; Rechberger, Christian

2015-01-01

to drastically reduce the complexity of attacks to very practical values for reduced-round versions. Furthermore, we describe new and practical attacks on Whirlpool and the recently proposed GOST R hash function with one or more of the following properties: more rounds, less time/memory complexity, and more...

Architecture-Conscious Hashing

NARCIS (Netherlands)

M. Zukowski (Marcin); S. Héman (Sándor); P.A. Boncz (Peter)

2006-01-01

textabstractHashing is one of the fundamental techniques used to implement query processing operators such as grouping, aggregation and join. This paper studies the interaction between modern computer architecture and hash-based query processing techniques. First, we focus on extracting maximum

Remarks on Gödel's Code as a Hash Function

Czech Academy of Sciences Publication Activity Database

Mikuš, M.; Savický, Petr

2010-01-01

Roč. 47, č. 3 (2010), s. 67-80 ISSN 1210-3195 R&D Projects: GA ČR GAP202/10/1333 Institutional research plan: CEZ:AV0Z10300504 Keywords : Gödel numbering function * hash function * rational reconstruction * integer relation algorithm Subject RIV: BA - General Mathematics http://www.sav.sk/journals/uploads/0317151904m-s.pdf

Rebound Attacks on the Reduced Grøstl Hash Function

DEFF Research Database (Denmark)

Mendel, Florian; Rechberger, C.; Schlaffer, Martin

2010-01-01

Grøstl is one of 14 second round candidates of the NIST SHA-3 competition. Cryptanalytic results on the wide-pipe compression function of Grøstl-256 have already been published. However, little is known about the hash function, arguably a much more interesting cryptanalytic setting. Also, Grøstl...

FSH: fast spaced seed hashing exploiting adjacent hashes.

Science.gov (United States)

Girotto, Samuele; Comin, Matteo; Pizzi, Cinzia

2018-01-01

Patterns with wildcards in specified positions, namely spaced seeds , are increasingly used instead of k -mers in many bioinformatics applications that require indexing, querying and rapid similarity search, as they can provide better sensitivity. Many of these applications require to compute the hashing of each position in the input sequences with respect to the given spaced seed, or to multiple spaced seeds. While the hashing of k -mers can be rapidly computed by exploiting the large overlap between consecutive k -mers, spaced seeds hashing is usually computed from scratch for each position in the input sequence, thus resulting in slower processing. The method proposed in this paper, fast spaced-seed hashing (FSH), exploits the similarity of the hash values of spaced seeds computed at adjacent positions in the input sequence. In our experiments we compute the hash for each positions of metagenomics reads from several datasets, with respect to different spaced seeds. We also propose a generalized version of the algorithm for the simultaneous computation of multiple spaced seeds hashing. In the experiments, our algorithm can compute the hashing values of spaced seeds with a speedup, with respect to the traditional approach, between 1.6[Formula: see text] to 5.3[Formula: see text], depending on the structure of the spaced seed. Spaced seed hashing is a routine task for several bioinformatics application. FSH allows to perform this task efficiently and raise the question of whether other hashing can be exploited to further improve the speed up. This has the potential of major impact in the field, making spaced seed applications not only accurate, but also faster and more efficient. The software FSH is freely available for academic use at: https://bitbucket.org/samu661/fsh/overview.

Feature hashing for fast image retrieval

Science.gov (United States)

Yan, Lingyu; Fu, Jiarun; Zhang, Hongxin; Yuan, Lu; Xu, Hui

2018-03-01

Currently, researches on content based image retrieval mainly focus on robust feature extraction. However, due to the exponential growth of online images, it is necessary to consider searching among large scale images, which is very timeconsuming and unscalable. Hence, we need to pay much attention to the efficiency of image retrieval. In this paper, we propose a feature hashing method for image retrieval which not only generates compact fingerprint for image representation, but also prevents huge semantic loss during the process of hashing. To generate the fingerprint, an objective function of semantic loss is constructed and minimized, which combine the influence of both the neighborhood structure of feature data and mapping error. Since the machine learning based hashing effectively preserves neighborhood structure of data, it yields visual words with strong discriminability. Furthermore, the generated binary codes leads image representation building to be of low-complexity, making it efficient and scalable to large scale databases. Experimental results show good performance of our approach.

Authenticated hash tables

DEFF Research Database (Denmark)

Triandopoulos, Nikolaos; Papamanthou, Charalampos; Tamassia, Roberto

2008-01-01

Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so that the client can save space or achieve load balancing. Authenticating the hash table functionality, i.e., verifying...... to a scheme that achieves different trade-offs---namely, constant update time and O(nε/logκε n) query time for fixed ε > 0 and κ > 0. An experimental evaluation of our solution shows very good scalability....

Simulation-Based Performance Evaluation of Predictive-Hashing Based Multicast Authentication Protocol

Directory of Open Access Journals (Sweden)

Seonho Choi

2012-12-01

Full Text Available A predictive-hashing based Denial-of-Service (DoS resistant multicast authentication protocol was proposed based upon predictive-hashing, one-way key chain, erasure codes, and distillation codes techniques [4, 5]. It was claimed that this new scheme should be more resistant to various types of DoS attacks, and its worst-case resource requirements were derived in terms of coarse-level system parameters including CPU times for signature verification and erasure/distillation decoding operations, attack levels, etc. To show the effectiveness of our approach and to analyze exact resource requirements in various attack scenarios with different parameter settings, we designed and implemented an attack simulator which is platformindependent. Various attack scenarios may be created with different attack types and parameters against a receiver equipped with the predictive-hashing based protocol. The design of the simulator is explained, and the simulation results are presented with detailed resource usage statistics. In addition, resistance level to various types of DoS attacks is formulated with a newly defined resistance metric. By comparing these results to those from another approach, PRABS [8], we show that the resistance level of our protocol is greatly enhanced even in the presence of many attack streams.

Deep Constrained Siamese Hash Coding Network and Load-Balanced Locality-Sensitive Hashing for Near Duplicate Image Detection.

Science.gov (United States)

Hu, Weiming; Fan, Yabo; Xing, Junliang; Sun, Liang; Cai, Zhaoquan; Maybank, Stephen

2018-09-01

We construct a new efficient near duplicate image detection method using a hierarchical hash code learning neural network and load-balanced locality-sensitive hashing (LSH) indexing. We propose a deep constrained siamese hash coding neural network combined with deep feature learning. Our neural network is able to extract effective features for near duplicate image detection. The extracted features are used to construct a LSH-based index. We propose a load-balanced LSH method to produce load-balanced buckets in the hashing process. The load-balanced LSH significantly reduces the query time. Based on the proposed load-balanced LSH, we design an effective and feasible algorithm for near duplicate image detection. Extensive experiments on three benchmark data sets demonstrate the effectiveness of our deep siamese hash encoding network and load-balanced LSH.

Quantum hashing is maximally secure against classical leakage

OpenAIRE

Huang, Cupjin; Shi, Yaoyun

2017-01-01

Cryptographic hash functions are fundamental primitives widely used in practice. For such a function $f:\\{0, 1\\}^n\\to\\{0, 1\\}^m$, it is nearly impossible for an adversary to produce the hash $f(x)$ without knowing the secret message $x\\in\\{0, 1\\}^n$. Unfortunately, all hash functions are vulnerable under the side-channel attack, which is a grave concern for information security in practice. This is because typically $m\\ll n$ and an adversary needs only $m$ bits of information to pass the veri...

Hash3: Proofs, Analysis and Implementation

DEFF Research Database (Denmark)

Gauravaram, Praveen

2009-01-01

This report outlines the talks presented at the winter school on Hash3: Proofs, Analysis, and Implementation, ECRYPT II Event on Hash Functions. In general, speakers may not write everything what they talk on the slides. So, this report also outlines such findings following the understanding of t...

The LabelHash algorithm for substructure matching

Directory of Open Access Journals (Sweden)

Bryant Drew H

2010-11-01

Full Text Available Abstract Background There is an increasing number of proteins with known structure but unknown function. Determining their function would have a significant impact on understanding diseases and designing new therapeutics. However, experimental protein function determination is expensive and very time-consuming. Computational methods can facilitate function determination by identifying proteins that have high structural and chemical similarity. Results We present LabelHash, a novel algorithm for matching substructural motifs to large collections of protein structures. The algorithm consists of two phases. In the first phase the proteins are preprocessed in a fashion that allows for instant lookup of partial matches to any motif. In the second phase, partial matches for a given motif are expanded to complete matches. The general applicability of the algorithm is demonstrated with three different case studies. First, we show that we can accurately identify members of the enolase superfamily with a single motif. Next, we demonstrate how LabelHash can complement SOIPPA, an algorithm for motif identification and pairwise substructure alignment. Finally, a large collection of Catalytic Site Atlas motifs is used to benchmark the performance of the algorithm. LabelHash runs very efficiently in parallel; matching a motif against all proteins in the 95% sequence identity filtered non-redundant Protein Data Bank typically takes no more than a few minutes. The LabelHash algorithm is available through a web server and as a suite of standalone programs at http://labelhash.kavrakilab.org. The output of the LabelHash algorithm can be further analyzed with Chimera through a plugin that we developed for this purpose. Conclusions LabelHash is an efficient, versatile algorithm for large-scale substructure matching. When LabelHash is running in parallel, motifs can typically be matched against the entire PDB on the order of minutes. The algorithm is able to identify

Probabilistic hypergraph based hash codes for social image search

Institute of Scientific and Technical Information of China (English)

Yi XIE; Hui-min YU; Roland HU

2014-01-01

With the rapid development of the Internet, recent years have seen the explosive growth of social media. This brings great challenges in performing efficient and accurate image retrieval on a large scale. Recent work shows that using hashing methods to embed high-dimensional image features and tag information into Hamming space provides a powerful way to index large collections of social images. By learning hash codes through a spectral graph partitioning algorithm, spectral hashing (SH) has shown promising performance among various hashing approaches. However, it is incomplete to model the relations among images only by pairwise simple graphs which ignore the relationship in a higher order. In this paper, we utilize a probabilistic hypergraph model to learn hash codes for social image retrieval. A probabilistic hypergraph model offers a higher order repre-sentation among social images by connecting more than two images in one hyperedge. Unlike a normal hypergraph model, a probabilistic hypergraph model considers not only the grouping information, but also the similarities between vertices in hy-peredges. Experiments on Flickr image datasets verify the performance of our proposed approach.

Efficient hash tables for network applications.

Science.gov (United States)

Zink, Thomas; Waldvogel, Marcel

2015-01-01

Hashing has yet to be widely accepted as a component of hard real-time systems and hardware implementations, due to still existing prejudices concerning the unpredictability of space and time requirements resulting from collisions. While in theory perfect hashing can provide optimal mapping, in practice, finding a perfect hash function is too expensive, especially in the context of high-speed applications. The introduction of hashing with multiple choices, d-left hashing and probabilistic table summaries, has caused a shift towards deterministic DRAM access. However, high amounts of rare and expensive high-speed SRAM need to be traded off for predictability, which is infeasible for many applications. In this paper we show that previous suggestions suffer from the false precondition of full generality. Our approach exploits four individual degrees of freedom available in many practical applications, especially hardware and high-speed lookups. This reduces the requirement of on-chip memory up to an order of magnitude and guarantees constant lookup and update time at the cost of only minute amounts of additional hardware. Our design makes efficient hash table implementations cheaper, more predictable, and more practical.

76 FR 11433 - Federal Transition To Secure Hash Algorithm (SHA)-256

Science.gov (United States)

2011-03-02

... ADMINISTRATION [FAR-N-2011-01; Docket No. 2011-0083; Sequence 1] Federal Transition To Secure Hash Algorithm (SHA... acquisition community to transition to Secure Hash Algorithm SHA-256. SHA-256 is a cryptographic hash function... persons attending. Please cite ``Federal Transition to Secure Hash Algorithm SHA-256'' in all...

Hierarchical Recurrent Neural Hashing for Image Retrieval With Hierarchical Convolutional Features.

Science.gov (United States)

Lu, Xiaoqiang; Chen, Yaxiong; Li, Xuelong

Hashing has been an important and effective technology in image retrieval due to its computational efficiency and fast search speed. The traditional hashing methods usually learn hash functions to obtain binary codes by exploiting hand-crafted features, which cannot optimally represent the information of the sample. Recently, deep learning methods can achieve better performance, since deep learning architectures can learn more effective image representation features. However, these methods only use semantic features to generate hash codes by shallow projection but ignore texture details. In this paper, we proposed a novel hashing method, namely hierarchical recurrent neural hashing (HRNH), to exploit hierarchical recurrent neural network to generate effective hash codes. There are three contributions of this paper. First, a deep hashing method is proposed to extensively exploit both spatial details and semantic information, in which, we leverage hierarchical convolutional features to construct image pyramid representation. Second, our proposed deep network can exploit directly convolutional feature maps as input to preserve the spatial structure of convolutional feature maps. Finally, we propose a new loss function that considers the quantization error of binarizing the continuous embeddings into the discrete binary codes, and simultaneously maintains the semantic similarity and balanceable property of hash codes. Experimental results on four widely used data sets demonstrate that the proposed HRNH can achieve superior performance over other state-of-the-art hashing methods.Hashing has been an important and effective technology in image retrieval due to its computational efficiency and fast search speed. The traditional hashing methods usually learn hash functions to obtain binary codes by exploiting hand-crafted features, which cannot optimally represent the information of the sample. Recently, deep learning methods can achieve better performance, since deep

Cracking PwdHash: A Bruteforce Attack on Client-side Password Hashing

OpenAIRE

Llewellyn-Jones, David; Rymer, Graham Matthew

2017-01-01

PwdHash is a widely-used tool for client-side password hashing. Originally released as a browser extension, it replaces the user’s password with a hash that combines both the password and the website’s domain. As a result, while the user only remembers a single secret, the passwords received are all unique for each site. We demonstrate how the hashcat password recovery tool can be extended to allow passwords generated using PwdHash to be identified and recovered, revealing the user’s master p...

A Novel Perceptual Hash Algorithm for Multispectral Image Authentication

Directory of Open Access Journals (Sweden)

Kaimeng Ding

2018-01-01

Full Text Available The perceptual hash algorithm is a technique to authenticate the integrity of images. While a few scholars have worked on mono-spectral image perceptual hashing, there is limited research on multispectral image perceptual hashing. In this paper, we propose a perceptual hash algorithm for the content authentication of a multispectral remote sensing image based on the synthetic characteristics of each band: firstly, the multispectral remote sensing image is preprocessed with band clustering and grid partition; secondly, the edge feature of the band subsets is extracted by band fusion-based edge feature extraction; thirdly, the perceptual feature of the same region of the band subsets is compressed and normalized to generate the perceptual hash value. The authentication procedure is achieved via the normalized Hamming distance between the perceptual hash value of the recomputed perceptual hash value and the original hash value. The experiments indicated that our proposed algorithm is robust compared to content-preserved operations and it efficiently authenticates the integrity of multispectral remote sensing images.

Hashing for Statistics over K-Partitions

DEFF Research Database (Denmark)

Dahlgaard, Soren; Knudsen, Mathias Baek Tejs; Rotenberg, Eva

2015-01-01

In this paper we analyze a hash function for k-partitioning a set into bins, obtaining strong concentration bounds for standard algorithms combining statistics from each bin. This generic method was originally introduced by Flajolet and Martin [FOCS'83] in order to save a factor Ω(k) of time per...... concentration bounds on the most popular applications of k-partitioning similar to those we would get using a truly random hash function. The analysis is very involved and implies several new results of independent interest for both simple and double tabulation, e.g. A simple and efficient construction...

Scalable Packet Classification with Hash Tables

Science.gov (United States)

Wang, Pi-Chung

In the last decade, the technique of packet classification has been widely deployed in various network devices, including routers, firewalls and network intrusion detection systems. In this work, we improve the performance of packet classification by using multiple hash tables. The existing hash-based algorithms have superior scalability with respect to the required space; however, their search performance may not be comparable to other algorithms. To improve the search performance, we propose a tuple reordering algorithm to minimize the number of accessed hash tables with the aid of bitmaps. We also use pre-computation to ensure the accuracy of our search procedure. Performance evaluation based on both real and synthetic filter databases shows that our scheme is effective and scalable and the pre-computation cost is moderate.

A Hash Based Remote User Authentication and Authenticated Key Agreement Scheme for the Integrated EPR Information System.

Science.gov (United States)

Li, Chun-Ta; Weng, Chi-Yao; Lee, Cheng-Chi; Wang, Chun-Cheng

2015-11-01

To protect patient privacy and ensure authorized access to remote medical services, many remote user authentication schemes for the integrated electronic patient record (EPR) information system have been proposed in the literature. In a recent paper, Das proposed a hash based remote user authentication scheme using passwords and smart cards for the integrated EPR information system, and claimed that the proposed scheme could resist various passive and active attacks. However, in this paper, we found that Das's authentication scheme is still vulnerable to modification and user duplication attacks. Thereafter we propose a secure and efficient authentication scheme for the integrated EPR information system based on lightweight hash function and bitwise exclusive-or (XOR) operations. The security proof and performance analysis show our new scheme is well-suited to adoption in remote medical healthcare services.

Forensic hash for multimedia information

Science.gov (United States)

Lu, Wenjun; Varna, Avinash L.; Wu, Min

2010-01-01

Digital multimedia such as images and videos are prevalent on today's internet and cause significant social impact, which can be evidenced by the proliferation of social networking sites with user generated contents. Due to the ease of generating and modifying images and videos, it is critical to establish trustworthiness for online multimedia information. In this paper, we propose novel approaches to perform multimedia forensics using compact side information to reconstruct the processing history of a document. We refer to this as FASHION, standing for Forensic hASH for informatION assurance. Based on the Radon transform and scale space theory, the proposed forensic hash is compact and can effectively estimate the parameters of geometric transforms and detect local tampering that an image may have undergone. Forensic hash is designed to answer a broader range of questions regarding the processing history of multimedia data than the simple binary decision from traditional robust image hashing, and also offers more efficient and accurate forensic analysis than multimedia forensic techniques that do not use any side information.

Implementation of 4-way Superscalar Hash MIPS Processor Using FPGA

Science.gov (United States)

Sahib Omran, Safaa; Fouad Jumma, Laith

2018-05-01

Due to the quick advancements in the personal communications systems and wireless communications, giving data security has turned into a more essential subject. This security idea turns into a more confounded subject when next-generation system requirements and constant calculation speed are considered in real-time. Hash functions are among the most essential cryptographic primitives and utilized as a part of the many fields of signature authentication and communication integrity. These functions are utilized to acquire a settled size unique fingerprint or hash value of an arbitrary length of message. In this paper, Secure Hash Algorithms (SHA) of types SHA-1, SHA-2 (SHA-224, SHA-256) and SHA-3 (BLAKE) are implemented on Field-Programmable Gate Array (FPGA) in a processor structure. The design is described and implemented using a hardware description language, namely VHSIC “Very High Speed Integrated Circuit” Hardware Description Language (VHDL). Since the logical operation of the hash types of (SHA-1, SHA-224, SHA-256 and SHA-3) are 32-bits, so a Superscalar Hash Microprocessor without Interlocked Pipelines (MIPS) processor are designed with only few instructions that were required in invoking the desired Hash algorithms, when the four types of hash algorithms executed sequentially using the designed processor, the total time required equal to approximately 342 us, with a throughput of 4.8 Mbps while the required to execute the same four hash algorithms using the designed four-way superscalar is reduced to 237 us with improved the throughput to 5.1 Mbps.

The Speech multi features fusion perceptual hash algorithm based on tensor decomposition

Science.gov (United States)

Huang, Y. B.; Fan, M. H.; Zhang, Q. Y.

2018-03-01

With constant progress in modern speech communication technologies, the speech data is prone to be attacked by the noise or maliciously tampered. In order to make the speech perception hash algorithm has strong robustness and high efficiency, this paper put forward a speech perception hash algorithm based on the tensor decomposition and multi features is proposed. This algorithm analyses the speech perception feature acquires each speech component wavelet packet decomposition. LPCC, LSP and ISP feature of each speech component are extracted to constitute the speech feature tensor. Speech authentication is done by generating the hash values through feature matrix quantification which use mid-value. Experimental results showing that the proposed algorithm is robust for content to maintain operations compared with similar algorithms. It is able to resist the attack of the common background noise. Also, the algorithm is highly efficiency in terms of arithmetic, and is able to meet the real-time requirements of speech communication and complete the speech authentication quickly.

Building Modern GPU Brute-Force Collision Resistible Hash Algorithm

Directory of Open Access Journals (Sweden)

L. A. Nadeinsky

2012-03-01

Full Text Available The article considers methods of fixing storing passwords in hashed form security vulnerability. Suggested hashing algorithm is based on the specifics of architecture of modern graphics processors.

FBC: a flat binary code scheme for fast Manhattan hash retrieval

Science.gov (United States)

Kong, Yan; Wu, Fuzhang; Gao, Lifa; Wu, Yanjun

2018-04-01

Hash coding is a widely used technique in approximate nearest neighbor (ANN) search, especially in document search and multimedia (such as image and video) retrieval. Based on the difference of distance measurement, hash methods are generally classified into two categories: Hamming hashing and Manhattan hashing. Benefitting from better neighborhood structure preservation, Manhattan hashing methods outperform earlier methods in search effectiveness. However, due to using decimal arithmetic operations instead of bit operations, Manhattan hashing becomes a more time-consuming process, which significantly decreases the whole search efficiency. To solve this problem, we present an intuitive hash scheme which uses Flat Binary Code (FBC) to encode the data points. As a result, the decimal arithmetic used in previous Manhattan hashing can be replaced by more efficient XOR operator. The final experiments show that with a reasonable memory space growth, our FBC speeds up more than 80% averagely without any search accuracy loss when comparing to the state-of-art Manhattan hashing methods.

Local Deep Hashing Matching of Aerial Images Based on Relative Distance and Absolute Distance Constraints

Directory of Open Access Journals (Sweden)

Suting Chen

2017-12-01

Full Text Available Aerial images have features of high resolution, complex background, and usually require large amounts of calculation, however, most algorithms used in matching of aerial images adopt the shallow hand-crafted features expressed as floating-point descriptors (e.g., SIFT (Scale-invariant Feature Transform, SURF (Speeded Up Robust Features, which may suffer from poor matching speed and are not well represented in the literature. Here, we propose a novel Local Deep Hashing Matching (LDHM method for matching of aerial images with large size and with lower complexity or fast matching speed. The basic idea of the proposed algorithm is to utilize the deep network model in the local area of the aerial images, and study the local features, as well as the hash function of the images. Firstly, according to the course overlap rate of aerial images, the algorithm extracts the local areas for matching to avoid the processing of redundant information. Secondly, a triplet network structure is proposed to mine the deep features of the patches of the local image, and the learned features are imported to the hash layer, thus obtaining the representation of a binary hash code. Thirdly, the constraints of the positive samples to the absolute distance are added on the basis of the triplet loss, a new objective function is constructed to optimize the parameters of the network and enhance the discriminating capabilities of image patch features. Finally, the obtained deep hash code of each image patch is used for the similarity comparison of the image patches in the Hamming space to complete the matching of aerial images. The proposed LDHM algorithm evaluates the UltraCam-D dataset and a set of actual aerial images, simulation result demonstrates that it may significantly outperform the state-of-the-art algorithm in terms of the efficiency and performance.

Dakota - hashing from a combination of modular arithmetic and symmetric cryptography

DEFF Research Database (Denmark)

Damgård, Ivan Bjerre; Knudsen, Lars Ramkilde; Thomsen, Søren Steffen

In this paper a cryptographic hash function is proposed, where collision resistance is based upon an assumption that involves squaring modulo an RSA modulus in combination with a one-way function that does not compress its input, and may therefore be constructed from standard techniques and assum...

Hashing in computer science fifty years of slicing and dicing

CERN Document Server

Konheim, Alan G

2009-01-01

Written by one of the developers of the technology, Hashing is both a historical document on the development of hashing and an analysis of the applications of hashing in a society increasingly concerned with security. The material in this book is based on courses taught by the author, and key points are reinforced in sample problems and an accompanying instructor s manual. Graduate students and researchers in mathematics, cryptography, and security will benefit from this overview of hashing and the complicated mathematics that it requires

Locality-sensitive Hashing without False Negatives

DEFF Research Database (Denmark)

Pagh, Rasmus

2016-01-01

We consider a new construction of locality-sensitive hash functions for Hamming space that is covering in the sense that is it guaranteed to produce a collision for every pair of vectors within a given radius r. The construction is efficient in the sense that the expected number of hash collisions......(n)/k, where n is the number of points in the data set and k ∊ N, and differs from it by at most a factor ln(4) in the exponent for general values of cr. As a consequence, LSH-based similarity search in Hamming space can avoid the problem of false negatives at little or no cost in efficiency. Read More: http...... between vectors at distance cr, for a given c > 1, comes close to that of the best possible data independent LSH without the covering guarantee, namely, the seminal LSH construction of Indyk and Motwani (FOCS ′98). The efficiency of the new construction essentially matches their bound if cr = log...

Poincaré chaos and unpredictable functions

Science.gov (United States)

Akhmet, Marat; Fen, Mehmet Onur

2017-07-01

The results of this study are continuation of the research of Poincaré chaos initiated in the papers (M. Akhmet and M.O. Fen, Commun Nonlinear Sci Numer Simulat 40 (2016) 1-5; M. Akhmet and M.O. Fen, Turk J Math, doi:10.3906/mat-1603-51, in press). We focus on the construction of an unpredictable function, continuous on the real axis. As auxiliary results, unpredictable orbits for the symbolic dynamics and the logistic map are obtained. By shaping the unpredictable function as well as Poisson function we have performed the first step in the development of the theory of unpredictable solutions for differential and discrete equations. The results are preliminary ones for deep analysis of chaos existence in differential and hybrid systems. Illustrative examples concerning unpredictable solutions of differential equations are provided.

A Robust and Effective Smart-Card-Based Remote User Authentication Mechanism Using Hash Function

Science.gov (United States)

Odelu, Vanga; Goswami, Adrijit

2014-01-01

In a remote user authentication scheme, a remote server verifies whether a login user is genuine and trustworthy, and also for mutual authentication purpose a login user validates whether the remote server is genuine and trustworthy. Several remote user authentication schemes using the password, the biometrics, and the smart card have been proposed in the literature. However, most schemes proposed in the literature are either computationally expensive or insecure against several known attacks. In this paper, we aim to propose a new robust and effective password-based remote user authentication scheme using smart card. Our scheme is efficient, because our scheme uses only efficient one-way hash function and bitwise XOR operations. Through the rigorous informal and formal security analysis, we show that our scheme is secure against possible known attacks. We perform the simulation for the formal security analysis using the widely accepted AVISPA (Automated Validation Internet Security Protocols and Applications) tool to ensure that our scheme is secure against passive and active attacks. Furthermore, our scheme supports efficiently the password change phase always locally without contacting the remote server and correctly. In addition, our scheme performs significantly better than other existing schemes in terms of communication, computational overheads, security, and features provided by our scheme. PMID:24892078

A Robust and Effective Smart-Card-Based Remote User Authentication Mechanism Using Hash Function

Directory of Open Access Journals (Sweden)

Ashok Kumar Das

2014-01-01

Full Text Available In a remote user authentication scheme, a remote server verifies whether a login user is genuine and trustworthy, and also for mutual authentication purpose a login user validates whether the remote server is genuine and trustworthy. Several remote user authentication schemes using the password, the biometrics, and the smart card have been proposed in the literature. However, most schemes proposed in the literature are either computationally expensive or insecure against several known attacks. In this paper, we aim to propose a new robust and effective password-based remote user authentication scheme using smart card. Our scheme is efficient, because our scheme uses only efficient one-way hash function and bitwise XOR operations. Through the rigorous informal and formal security analysis, we show that our scheme is secure against possible known attacks. We perform the simulation for the formal security analysis using the widely accepted AVISPA (Automated Validation Internet Security Protocols and Applications tool to ensure that our scheme is secure against passive and active attacks. Furthermore, our scheme supports efficiently the password change phase always locally without contacting the remote server and correctly. In addition, our scheme performs significantly better than other existing schemes in terms of communication, computational overheads, security, and features provided by our scheme.

A robust and effective smart-card-based remote user authentication mechanism using hash function.

Science.gov (United States)

Das, Ashok Kumar; Odelu, Vanga; Goswami, Adrijit

2014-01-01

In a remote user authentication scheme, a remote server verifies whether a login user is genuine and trustworthy, and also for mutual authentication purpose a login user validates whether the remote server is genuine and trustworthy. Several remote user authentication schemes using the password, the biometrics, and the smart card have been proposed in the literature. However, most schemes proposed in the literature are either computationally expensive or insecure against several known attacks. In this paper, we aim to propose a new robust and effective password-based remote user authentication scheme using smart card. Our scheme is efficient, because our scheme uses only efficient one-way hash function and bitwise XOR operations. Through the rigorous informal and formal security analysis, we show that our scheme is secure against possible known attacks. We perform the simulation for the formal security analysis using the widely accepted AVISPA (Automated Validation Internet Security Protocols and Applications) tool to ensure that our scheme is secure against passive and active attacks. Furthermore, our scheme supports efficiently the password change phase always locally without contacting the remote server and correctly. In addition, our scheme performs significantly better than other existing schemes in terms of communication, computational overheads, security, and features provided by our scheme.

CHAOS-BASED ADVANCED ENCRYPTION STANDARD

KAUST Repository

Abdulwahed, Naif B.

2013-05-01

This thesis introduces a new chaos-based Advanced Encryption Standard (AES). The AES is a well-known encryption algorithm that was standardized by U.S National Institute of Standard and Technology (NIST) in 2001. The thesis investigates and explores the behavior of the AES algorithm by replacing two of its original modules, namely the S-Box and the Key Schedule, with two other chaos- based modules. Three chaos systems are considered in designing the new modules which are Lorenz system with multiplication nonlinearity, Chen system with sign modules nonlinearity, and 1D multiscroll system with stair case nonlinearity. The three systems are evaluated on their sensitivity to initial conditions and as Pseudo Random Number Generators (PRNG) after applying a post-processing technique to their output then performing NIST SP. 800-22 statistical tests. The thesis presents a hardware implementation of dynamic S-Boxes for AES that are populated using the three chaos systems. Moreover, a full MATLAB package to analyze the chaos generated S-Boxes based on graphical analysis, Walsh-Hadamard spectrum analysis, and image encryption analysis is developed. Although these S-Boxes are dynamic, meaning they are regenerated whenever the encryption key is changed, the analysis results show that such S-Boxes exhibit good properties like the Strict Avalanche Criterion (SAC) and the nonlinearity and in the application of image encryption. Furthermore, the thesis presents a new Lorenz-chaos-based key expansion for the AES. Many researchers have pointed out that there are some defects in the original key expansion of AES and thus have motivated such chaos-based key expansion proposal. The new proposed key schedule is analyzed and assessed in terms of confusion and diffusion by performing the frequency and SAC test respectively. The obtained results show that the new proposed design is more secure than the original AES key schedule and other proposed designs in the literature. The proposed

Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography

DEFF Research Database (Denmark)

Damgård, Ivan Bjerre; Knudsen, Lars Ramkilde; Thomsen, Søren Steffen

2008-01-01

In this paper a cryptographic hash function is proposed, where collision resistance is based upon an assumption that involves squaring modulo an RSA modulus in combination with a one-way function that does not compress its input, and may therefore be constructed from standard techniques and assum...

Cryptanalysis of the LAKE Hash Family

DEFF Research Database (Denmark)

Biryukov, Alex; Gauravaram, Praveen; Guo, Jian

2009-01-01

We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitives of LAKE, we show three different collision and near-collision attacks on the compression function. The first attac...

Socioeconomic Risk Moderates the Link between Household Chaos and Maternal Executive Function

Science.gov (United States)

Deater-Deckard, Kirby; Chen, Nan; Wang, Zhe; Bell, Martha Ann

2012-01-01

We examined the link between household chaos (i.e., noise, clutter, disarray, lack of routines) and maternal executive function (i.e., effortful regulation of attention and memory), and whether it varied as a function of socioeconomic risk (i.e., single parenthood, lower mother and father educational attainment, housing situation, and father unemployment). We hypothesized that: 1) higher levels of household chaos would be linked with poorer maternal executive function, even when controlling for other measures of cognitive functioning (e.g., verbal ability), and 2) this link would be strongest in the most socioeconomically distressed or lowest-socioeconomic status households. The diverse sample included 153 mothers from urban and rural areas who completed a questionnaire and a battery of cognitive executive function tasks and a verbal ability task in the laboratory. Results were mixed for hypothesis 1, and consistent with hypothesis 2. Two-thirds of the variance overlapped between household chaos and maternal executive function, but only in families with high levels of socioeconomic risk. This pattern was not found for chaos and maternal verbal ability, suggesting that the potentially deleterious effects of household chaos may be specific to maternal executive function. The findings implicate household chaos as a powerful statistical predictor of maternal executive function in socioeconomically distressed contexts. PMID:22563703

Robust hashing for 3D models

Science.gov (United States)

Berchtold, Waldemar; Schäfer, Marcel; Rettig, Michael; Steinebach, Martin

2014-02-01

3D models and applications are of utmost interest in both science and industry. With the increment of their usage, their number and thereby the challenge to correctly identify them increases. Content identification is commonly done by cryptographic hashes. However, they fail as a solution in application scenarios such as computer aided design (CAD), scientific visualization or video games, because even the smallest alteration of the 3D model, e.g. conversion or compression operations, massively changes the cryptographic hash as well. Therefore, this work presents a robust hashing algorithm for 3D mesh data. The algorithm applies several different bit extraction methods. They are built to resist desired alterations of the model as well as malicious attacks intending to prevent correct allocation. The different bit extraction methods are tested against each other and, as far as possible, the hashing algorithm is compared to the state of the art. The parameters tested are robustness, security and runtime performance as well as False Acceptance Rate (FAR) and False Rejection Rate (FRR), also the probability calculation of hash collision is included. The introduced hashing algorithm is kept adaptive e.g. in hash length, to serve as a proper tool for all applications in practice.

Socioeconomic risk moderates the link between household chaos and maternal executive function.

Science.gov (United States)

Deater-Deckard, Kirby; Chen, Nan; Wang, Zhe; Bell, Martha Ann

2012-06-01

We examined the link between household chaos (i.e., noise, clutter, disarray, lack of routines) and maternal executive function (i.e., effortful regulation of attention and memory), and whether it varied as a function of socioeconomic risk (i.e., single parenthood, lower mother and father educational attainment, housing situation, and father unemployment). We hypothesized that: 1) higher levels of household chaos would be linked with poorer maternal executive function, even when controlling for other measures of cognitive functioning (e.g., verbal ability), and 2) this link would be strongest in the most socioeconomically distressed or lowest-socioeconomic status households. The diverse sample included 153 mothers from urban and rural areas who completed a questionnaire and a battery of cognitive executive function tasks and a verbal ability task in the laboratory. Results were mixed for Hypothesis 1, and consistent with Hypothesis 2. Two-thirds of the variance overlapped between household chaos and maternal executive function, but only in families with high levels of socioeconomic risk. This pattern was not found for chaos and maternal verbal ability, suggesting that the potentially deleterious effects of household chaos may be specific to maternal executive function. The findings implicate household chaos as a powerful statistical predictor of maternal executive function in socioeconomically distressed contexts. PsycINFO Database Record (c) 2012 APA, all rights reserved.

Design of High-Security USB Flash Drives Based on Chaos Authentication

Directory of Open Access Journals (Sweden)

Teh-Lu Liao

2018-05-01

Full Text Available This paper aims to propose a novel design of high-security USB flash drives with the chaos authentication. A chaos authentication approach with the non-linear encryption and decryption function design is newly proposed and realized based on the controller design of chaos synchronization. To complete the design of high-security USB flash drives, first, we introduce six parameters into the original Henon map to adjust and obtain richer chaotic state responses. Then a discrete sliding mode scheme is proposed to solve the synchronization problem of discrete hyperchaotic Henon maps. The proposed sliding mode controller can ensure the synchronization of the master-slave Henon maps. The selection of the switching surface and the existence of the sliding motion are also addressed. Finally, the obtained results are applied to design a new high-security USB flash drive with chaos authentication. We built discrete hyperchaotic Henon maps in the smartphone (master and microcontroller (slave, respectively. The Bluetooth module is used to communicate between the master and the slave to achieve chaos synchronization such that the same random and dynamical chaos signal can be simultaneously obtained at both the USB flash drive and smartphone, and pass the chaos authentication. When users need to access data in the flash drive, they can easily enable the encryption APP in the smartphone (master for chaos authentication. After completing the chaos synchronization and authentication, the ARM-based microcontroller allows the computer to access the data in the high-security USB flash drive.

Simulation on control of beam halo-chaos by power function in the hackle periodic-focusing channel

Institute of Scientific and Technical Information of China (English)

无

2008-01-01

The K-V beam through a hackle periodic-focusing magnetic field is studied using the particle-core model. The beam halo-chaos is found, and a power function controller is proposed based on mechanism of halo formation and strategy of controlling halo-chaos. Multiparticle simulation was performed to control the halo by using the power function control method. The results show that the halo-chaos and its regeneration can be eliminated effectively. We also find that the radial particle density evolvement is of uniformity at the beam's centre as long as appropriate paramours are chosen.

Robust visual hashing via ICA

International Nuclear Information System (INIS)

Fournel, Thierry; Coltuc, Daniela

2010-01-01

Designed to maximize information transmission in the presence of noise, independent component analysis (ICA) could appear in certain circumstances as a statistics-based tool for robust visual hashing. Several ICA-based scenarios can attempt to reach this goal. A first one is here considered.

Quicksort, largest bucket, and min-wise hashing with limited independence

DEFF Research Database (Denmark)

Knudsen, Mathias Bæk Tejs; Stöckel, Morten

2015-01-01

Randomized algorithms and data structures are often analyzed under the assumption of access to a perfect source of randomness. The most fundamental metric used to measure how “random” a hash function or a random number generator is, is its independence: a sequence of random variables is said...... to be k-independent if every variable is uniform and every size k subset is independent. In this paper we consider three classic algorithms under limited independence. Besides the theoretical interest in removing the unrealistic assumption of full independence, the work is motivated by lower independence...... being more practical. We provide new bounds for randomized quicksort, min-wise hashing and largest bucket size under limited independence. Our results can be summarized as follows. Randomized Quicksort. When pivot elements are computed using a 5-independent hash function, Karloff and Raghavan, J.ACM’93...

Parallel Algorithm of Geometrical Hashing Based on NumPy Package and Processes Pool

Directory of Open Access Journals (Sweden)

Klyachin Vladimir Aleksandrovich

2015-10-01

Full Text Available The article considers the problem of multi-dimensional geometric hashing. The paper describes a mathematical model of geometric hashing and considers an example of its use in localization problems for the point. A method of constructing the corresponding hash matrix by parallel algorithm is considered. In this paper an algorithm of parallel geometric hashing using a development pattern «pool processes» is proposed. The implementation of the algorithm is executed using the Python programming language and NumPy package for manipulating multidimensional data. To implement the process pool it is proposed to use a class Process Pool Executor imported from module concurrent.futures, which is included in the distribution of the interpreter Python since version 3.2. All the solutions are presented in the paper by corresponding UML class diagrams. Designed GeomNash package includes classes Data, Result, GeomHash, Job. The results of the developed program presents the corresponding graphs. Also, the article presents the theoretical justification for the application process pool for the implementation of parallel algorithms. It is obtained condition t2 > (p/(p-1*t1 of the appropriateness of process pool. Here t1 - the time of transmission unit of data between processes, and t2 - the time of processing unit data by one processor.

Chaos based encryption system for encrypting electroencephalogram signals.

Science.gov (United States)

Lin, Chin-Feng; Shih, Shun-Han; Zhu, Jin-De

2014-05-01

In the paper, we use the Microsoft Visual Studio Development Kit and C# programming language to implement a chaos-based electroencephalogram (EEG) encryption system involving three encryption levels. A chaos logic map, initial value, and bifurcation parameter for the map were used to generate Level I chaos-based EEG encryption bit streams. Two encryption-level parameters were added to these elements to generate Level II chaos-based EEG encryption bit streams. An additional chaotic map and chaotic address index assignment process was used to implement the Level III chaos-based EEG encryption system. Eight 16-channel EEG Vue signals were tested using the encryption system. The encryption was the most rapid and robust in the Level III system. The test yielded superior encryption results, and when the correct deciphering parameter was applied, the EEG signals were completely recovered. However, an input parameter error (e.g., a 0.00001 % initial point error) causes chaotic encryption bit streams, preventing the recovery of 16-channel EEG Vue signals.

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

Energy Technology Data Exchange (ETDEWEB)

Ahlfeld, R., E-mail: r.ahlfeld14@imperial.ac.uk; Belkouchi, B.; Montomoli, F.

2016-09-01

A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

International Nuclear Information System (INIS)

Ahlfeld, R.; Belkouchi, B.; Montomoli, F.

2016-01-01

A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10

Efficient tabling of structured data with enhanced hash-consing

DEFF Research Database (Denmark)

Zhou, Neng-Fa; Have, Christian Theil

2012-01-01

techniques, called input sharing and hash code memoization, for reducing the time complexity by avoiding computing hash codes for certain terms. The improved system is able to eliminate the extra linear factor in the old system for processing sequences, thus significantly enhancing the scalability...... uses hash tables, but also systems that use tries such as XSB and YAP. In this paper, we apply hash-consing to tabling structured data in B-Prolog. While hash-consing can reduce the space consumption when sharing is effective, it does not change the time complexity. We enhance hash-consing with two...

Nonlinear Multiuser Receiver for Optimized Chaos-Based DS-CDMA Systems

Directory of Open Access Journals (Sweden)

S. Shaerbaf

2011-09-01

Full Text Available Chaos based communications have drawn increasing attention over the past years. Chaotic signals are derived from non-linear dynamic systems. They are aperiodic, broadband and deterministic signals that appear random in the time domain. Because of these properties, chaotic signals have been proposed to generate spreading sequences for wide-band secure communication recently. Like conventional DS-CDMA systems, chaos-based CDMA systems suffer from multi-user interference (MUI due to other users transmitting in the cell. In this paper, we propose a novel method based on radial basis function (RBF for both blind and non-blind multiuser detection in chaos-based DS-CDMA systems. We also propose a new method for optimizing generation of binary chaotic sequences using Genetic Algorithm. Simulation results show that our proposed nonlinear receiver with optimized chaotic sequences outperforms in comparison to other conventional detectors such as a single-user detector, decorrelating detector and minimum mean square error detector, particularly for under-loaded CDMA condition, which the number of active users is less than processing gain.

EPC: A Provably Secure Permutation Based Compression Function

DEFF Research Database (Denmark)

Bagheri, Nasour; Gauravaram, Praveen; Naderi, Majid

2010-01-01

The security of permutation-based hash functions in the ideal permutation model has been studied when the input-length of compression function is larger than the input-length of the permutation function. In this paper, we consider permutation based compression functions that have input lengths sh...

Object-Location-Aware Hashing for Multi-Label Image Retrieval via Automatic Mask Learning.

Science.gov (United States)

Huang, Chang-Qin; Yang, Shang-Ming; Pan, Yan; Lai, Han-Jiang

2018-09-01

Learning-based hashing is a leading approach of approximate nearest neighbor search for large-scale image retrieval. In this paper, we develop a deep supervised hashing method for multi-label image retrieval, in which we propose to learn a binary "mask" map that can identify the approximate locations of objects in an image, so that we use this binary "mask" map to obtain length-limited hash codes which mainly focus on an image's objects but ignore the background. The proposed deep architecture consists of four parts: 1) a convolutional sub-network to generate effective image features; 2) a binary "mask" sub-network to identify image objects' approximate locations; 3) a weighted average pooling operation based on the binary "mask" to obtain feature representations and hash codes that pay most attention to foreground objects but ignore the background; and 4) the combination of a triplet ranking loss designed to preserve relative similarities among images and a cross entropy loss defined on image labels. We conduct comprehensive evaluations on four multi-label image data sets. The results indicate that the proposed hashing method achieves superior performance gains over the state-of-the-art supervised or unsupervised hashing baselines.

Prediction based chaos control via a new neural network

International Nuclear Information System (INIS)

Shen Liqun; Wang Mao; Liu Wanyu; Sun Guanghui

2008-01-01

In this Letter, a new chaos control scheme based on chaos prediction is proposed. To perform chaos prediction, a new neural network architecture for complex nonlinear approximation is proposed. And the difficulty in building and training the neural network is also reduced. Simulation results of Logistic map and Lorenz system show the effectiveness of the proposed chaos control scheme and the proposed neural network

HashDist: Reproducible, Relocatable, Customizable, Cross-Platform Software Stacks for Open Hydrological Science

Science.gov (United States)

Ahmadia, A. J.; Kees, C. E.

2014-12-01

Developing scientific software is a continuous balance between not reinventing the wheel and getting fragile codes to interoperate with one another. Binary software distributions such as Anaconda provide a robust starting point for many scientific software packages, but this solution alone is insufficient for many scientific software developers. HashDist provides a critical component of the development workflow, enabling highly customizable, source-driven, and reproducible builds for scientific software stacks, available from both the IPython Notebook and the command line. To address these issues, the Coastal and Hydraulics Laboratory at the US Army Engineer Research and Development Center has funded the development of HashDist in collaboration with Simula Research Laboratories and the University of Texas at Austin. HashDist is motivated by a functional approach to package build management, and features intelligent caching of sources and builds, parametrized build specifications, and the ability to interoperate with system compilers and packages. HashDist enables the easy specification of "software stacks", which allow both the novice user to install a default environment and the advanced user to configure every aspect of their build in a modular fashion. As an advanced feature, HashDist builds can be made relocatable, allowing the easy redistribution of binaries on all three major operating systems as well as cloud, and supercomputing platforms. As a final benefit, all HashDist builds are reproducible, with a build hash specifying exactly how each component of the software stack was installed. This talk discusses the role of HashDist in the hydrological sciences, including its use by the Coastal and Hydraulics Laboratory in the development and deployment of the Proteus Toolkit as well as the Rapid Operational Access and Maneuver Support project. We demonstrate HashDist in action, and show how it can effectively support development, deployment, teaching, and

An Ad Hoc Adaptive Hashing Technique forNon-Uniformly Distributed IP Address Lookup in Computer Networks

Directory of Open Access Journals (Sweden)

Christopher Martinez

2007-02-01

Full Text Available Hashing algorithms long have been widely adopted to design a fast address look-up process which involves a search through a large database to find a record associated with a given key. Hashing algorithms involve transforming a key inside each target data to a hash value hoping that the hashing would render the database a uniform distribution with respect to this new hash value. The close the final distribution is to uniform, the less search time would be required when a query is made. When the database is already key-wise uniformly distributed, any regular hashing algorithm, such as bit-extraction, bit-group XOR, etc., would easily lead to a statistically perfect uniform distribution after the hashing. On the other hand, if records in the database are instead not uniformly distributed as in almost all known practical applications, then even different regular hash functions would lead to very different performance. When the target database has a key with a highly skewed distributed value, performance delivered by regular hashing algorithms usually becomes far from desirable. This paper aims at designing a hashing algorithm to achieve the highest probability in leading to a uniformly distributed hash result from a non-uniformly distributed database. An analytical pre-process on the original database is first performed to extract critical information that would significantly benefit the design of a better hashing algorithm. This process includes sorting on the bits of the key to prioritize the use of them in the XOR hashing sequence, or in simple bit extraction, or even a combination of both. Such an ad hoc hash design is critical to adapting to all real-time situations when there exists a changing (and/or expanding database with an irregular non-uniform distribution. Significant improvement from simulation results is obtained in randomly generated data as well as real data.

Order in large and chaos in small components of nuclear wave functions

International Nuclear Information System (INIS)

Soloviev, V.G.

1992-06-01

An investigation of the order and chaos of the nuclear excited states has shown that there is order in the large and chaos in the small quasiparticle or phonon components of the nuclear wave functions. The order-to-chaos transition is treated as a transition from the large to the small components of the nuclear wave function. The analysis has shown that relatively large many-quasiparticle components of the wave function at an excitation energy (4-8)MeV may exist. The large many-quasiparticle components of the wave functions of the neutron resonances are responsible for enhanced E1-, M1- and E2-transition probabilities from neutron resonance to levels lying (1-2)MeV below them. (author)

On the efficiency of chaos optimization algorithms for global optimization

International Nuclear Information System (INIS)

Yang Dixiong; Li Gang; Cheng Gengdong

2007-01-01

Chaos optimization algorithms as a novel method of global optimization have attracted much attention, which were all based on Logistic map. However, we have noticed that the probability density function of the chaotic sequences derived from Logistic map is a Chebyshev-type one, which may affect the global searching capacity and computational efficiency of chaos optimization algorithms considerably. Considering the statistical property of the chaotic sequences of Logistic map and Kent map, the improved hybrid chaos-BFGS optimization algorithm and the Kent map based hybrid chaos-BFGS algorithm are proposed. Five typical nonlinear functions with multimodal characteristic are tested to compare the performance of five hybrid optimization algorithms, which are the conventional Logistic map based chaos-BFGS algorithm, improved Logistic map based chaos-BFGS algorithm, Kent map based chaos-BFGS algorithm, Monte Carlo-BFGS algorithm, mesh-BFGS algorithm. The computational performance of the five algorithms is compared, and the numerical results make us question the high efficiency of the chaos optimization algorithms claimed in some references. It is concluded that the efficiency of the hybrid optimization algorithms is influenced by the statistical property of chaotic/stochastic sequences generated from chaotic/stochastic algorithms, and the location of the global optimum of nonlinear functions. In addition, it is inappropriate to advocate the high efficiency of the global optimization algorithms only depending on several numerical examples of low-dimensional functions

Chaos-based wireless communication resisting multipath effects

Science.gov (United States)

Yao, Jun-Liang; Li, Chen; Ren, Hai-Peng; Grebogi, Celso

2017-09-01

In additive white Gaussian noise channel, chaos has been shown to be the optimal coherent communication waveform in the sense of using a very simple matched filter to maximize the signal-to-noise ratio. Recently, Lyapunov exponent spectrum of the chaotic signals after being transmitted through a wireless channel has been shown to be unaltered, paving the way for wireless communication using chaos. In wireless communication systems, inter-symbol interference caused by multipath propagation is one of the main obstacles to achieve high bit transmission rate and low bit-error rate (BER). How to resist the multipath effect is a fundamental problem in a chaos-based wireless communication system (CWCS). In this paper, a CWCS is built to transmit chaotic signals generated by a hybrid dynamical system and then to filter the received signals by using the corresponding matched filter to decrease the noise effect and to detect the binary information. We find that the multipath effect can be effectively resisted by regrouping the return map of the received signal and by setting the corresponding threshold based on the available information. We show that the optimal threshold is a function of the channel parameters and of the information symbols. Practically, the channel parameters are time-variant, and the future information symbols are unavailable. In this case, a suboptimal threshold is proposed, and the BER using the suboptimal threshold is derived analytically. Simulation results show that the CWCS achieves a remarkable competitive performance even under inaccurate channel parameters.

Compact binary hashing for music retrieval

Science.gov (United States)

Seo, Jin S.

2014-03-01

With the huge volume of music clips available for protection, browsing, and indexing, there is an increased attention to retrieve the information contents of the music archives. Music-similarity computation is an essential building block for browsing, retrieval, and indexing of digital music archives. In practice, as the number of songs available for searching and indexing is increased, so the storage cost in retrieval systems is becoming a serious problem. This paper deals with the storage problem by extending the supervector concept with the binary hashing. We utilize the similarity-preserving binary embedding in generating a hash code from the supervector of each music clip. Especially we compare the performance of the various binary hashing methods for music retrieval tasks on the widely-used genre dataset and the in-house singer dataset. Through the evaluation, we find an effective way of generating hash codes for music similarity estimation which improves the retrieval performance.

A digital bandlimited chaos-based communication system

Science.gov (United States)

Fontes, Rodrigo T.; Eisencraft, Marcio

2016-08-01

In recent years, many communication systems that use a function to encode an information in a chaotic signal were proposed. Since every transmission channel is bandlimited in nature, it is required to determine and to control the chaotic signal spectrum. This way, a bandlimited chaos-based communication system (CBCS) was proposed using digital filters and chaotic synchronization. As the filters modify the original chaotic system, it is necessary to study how their insertion affects chaotic synchronization. In this work, we present a digital discrete-time bandlimited CBCS system analysis, considering practical settings encountered in conventional communication systems. The proposed system is based on master-slave chaotic synchronization and the required conditions for its synchronization is obtained analytically for a general K-dimensional chaos generator map. The performance of this system is evaluated in terms of bit error rate. As a way to improve the signal to noise ratio, we also propose to filter the out-of-band noise in the receiver. Numerical simulations show the advantages of using such a scheme.

SECOM: A novel hash seed and community detection based-approach for genome-scale protein domain identification

KAUST Repository

Fan, Ming

2012-06-28

With rapid advances in the development of DNA sequencing technologies, a plethora of high-throughput genome and proteome data from a diverse spectrum of organisms have been generated. The functional annotation and evolutionary history of proteins are usually inferred from domains predicted from the genome sequences. Traditional database-based domain prediction methods cannot identify novel domains, however, and alignment-based methods, which look for recurring segments in the proteome, are computationally demanding. Here, we propose a novel genome-wide domain prediction method, SECOM. Instead of conducting all-against-all sequence alignment, SECOM first indexes all the proteins in the genome by using a hash seed function. Local similarity can thus be detected and encoded into a graph structure, in which each node represents a protein sequence and each edge weight represents the shared hash seeds between the two nodes. SECOM then formulates the domain prediction problem as an overlapping community-finding problem in this graph. A backward graph percolation algorithm that efficiently identifies the domains is proposed. We tested SECOM on five recently sequenced genomes of aquatic animals. Our tests demonstrated that SECOM was able to identify most of the known domains identified by InterProScan. When compared with the alignment-based method, SECOM showed higher sensitivity in detecting putative novel domains, while it was also three orders of magnitude faster. For example, SECOM was able to predict a novel sponge-specific domain in nucleoside-triphosphatase (NTPases). Furthermore, SECOM discovered two novel domains, likely of bacterial origin, that are taxonomically restricted to sea anemone and hydra. SECOM is an open-source program and available at http://sfb.kaust.edu.sa/Pages/Software.aspx. © 2012 Fan et al.

SECOM: A novel hash seed and community detection based-approach for genome-scale protein domain identification

KAUST Repository

Fan, Ming; Wong, Ka-Chun; Ryu, Tae Woo; Ravasi, Timothy; Gao, Xin

2012-01-01

With rapid advances in the development of DNA sequencing technologies, a plethora of high-throughput genome and proteome data from a diverse spectrum of organisms have been generated. The functional annotation and evolutionary history of proteins are usually inferred from domains predicted from the genome sequences. Traditional database-based domain prediction methods cannot identify novel domains, however, and alignment-based methods, which look for recurring segments in the proteome, are computationally demanding. Here, we propose a novel genome-wide domain prediction method, SECOM. Instead of conducting all-against-all sequence alignment, SECOM first indexes all the proteins in the genome by using a hash seed function. Local similarity can thus be detected and encoded into a graph structure, in which each node represents a protein sequence and each edge weight represents the shared hash seeds between the two nodes. SECOM then formulates the domain prediction problem as an overlapping community-finding problem in this graph. A backward graph percolation algorithm that efficiently identifies the domains is proposed. We tested SECOM on five recently sequenced genomes of aquatic animals. Our tests demonstrated that SECOM was able to identify most of the known domains identified by InterProScan. When compared with the alignment-based method, SECOM showed higher sensitivity in detecting putative novel domains, while it was also three orders of magnitude faster. For example, SECOM was able to predict a novel sponge-specific domain in nucleoside-triphosphatase (NTPases). Furthermore, SECOM discovered two novel domains, likely of bacterial origin, that are taxonomically restricted to sea anemone and hydra. SECOM is an open-source program and available at http://sfb.kaust.edu.sa/Pages/Software.aspx. © 2012 Fan et al.

Prediction of chaos in a Josephson junction by the Melnikov-function technique

DEFF Research Database (Denmark)

Bartuccelli, M.; Christiansen, Peter Leth; Pedersen, Niels Falsig

1986-01-01

The Melnikov function for prediction of Smale horseshoe chaos is applied to the rf-driven Josephson junction. Linear and quadratic damping resistors are considered. In the latter case the analytic solution including damping and dc bias is used to obtain an improved threshold curve for the onset...... of chaos. The prediction is compared to new computational solutions. The Melnikov technique provides a good, but slightly low, estimate of the chaos threshold....

CHAOS: An SDN-Based Moving Target Defense System

Directory of Open Access Journals (Sweden)

Yuan Shi

2017-01-01

Full Text Available Moving target defense (MTD has provided a dynamic and proactive network defense to reduce or move the attack surface that is available for exploitation. However, traditional network is difficult to realize dynamic and active security defense effectively and comprehensively. Software-defined networking (SDN points out a brand-new path for building dynamic and proactive defense system. In this paper, we propose CHAOS, an SDN-based MTD system. Utilizing the programmability and flexibility of SDN, CHAOS obfuscates the attack surface including host mutation obfuscation, ports obfuscation, and obfuscation based on decoy servers, thereby enhancing the unpredictability of the networking environment. We propose the Chaos Tower Obfuscation (CTO method, which uses the Chaos Tower Structure (CTS to depict the hierarchy of all the hosts in an intranet and define expected connection and unexpected connection. Moreover, we develop fast CTO algorithms to achieve a different degree of obfuscation for the hosts in each layer. We design and implement CHAOS as an application of SDN controller. Our approach makes it very easy to realize moving target defense in networks. Our experimental results show that a network protected by CHAOS is capable of decreasing the percentage of information disclosure effectively to guarantee the normal flow of traffic.

A bound on chaos

Energy Technology Data Exchange (ETDEWEB)

Maldacena, Juan [School of Natural Sciences, Institute for Advanced Study,1 Einstein Drive, Princeton, NJ (United States); Shenker, Stephen H. [Stanford Institute for Theoretical Physics and Department of Physics, Stanford University,382 Via Pueblo Mall, Stanford, CA (United States); Stanford, Douglas [School of Natural Sciences, Institute for Advanced Study,1 Einstein Drive, Princeton, NJ (United States)

2016-08-17

We conjecture a sharp bound on the rate of growth of chaos in thermal quantum systems with a large number of degrees of freedom. Chaos can be diagnosed using an out-of-time-order correlation function closely related to the commutator of operators separated in time. We conjecture that the influence of chaos on this correlator can develop no faster than exponentially, with Lyapunov exponent λ{sub L}≤2πk{sub B}T/ℏ. We give a precise mathematical argument, based on plausible physical assumptions, establishing this conjecture.

Breaking a chaos-based secure communication scheme designed by an improved modulation method

Energy Technology Data Exchange (ETDEWEB)

Li Shujun [Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong (China)]. E-mail: hooklee@mail.com; Alvarez, Gonzalo [Instituto de Fisica Aplicada, Consejo Superior de Investigaciones Cientificas, Serrano 144-28006 Madrid (Spain); Chen Guanrong [Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong (China)

2005-07-01

Recently Bu and Wang [Bu S, Wang B-H. Chaos, Solitons and Fractals 2004;19(4):919-24] proposed a simple modulation method aiming to improve the security of chaos-based secure communications against return-map-based attacks. Soon this modulation method was independently cryptanalyzed by Chee et al. [Chee CY, Xu D, Bishop SR. Chaos, Solitons and Fractals 2004;21(5):1129-34], Wu et al. [Wu X, Hu H, Zhang B. Chaos, Solitons and Fractals 2004;22(2):367-73], and Alvarez et al. [Alvarez G, Montoya F, Romera M, Pastor G. Chaos, Solitons and Fractals, in press, arXiv:nlin/0406065] via different attacks. As an enhancement to the Bu-Wang method, an improving scheme was suggested by Wu et al. by removing the relationship between the modulating function and the zero-points. The present paper points out that the improved scheme proposed by Wu et al. is still insecure against a new attack. Compared with the existing attacks, the proposed attack is more powerful and can also break the original Bu-Wang scheme. Furthermore, it is pointed out that the security of the modulation-based schemes proposed by Wu et al. is not so satisfactory from a pure cryptographical point of view. The synchronization performance of this class of modulation-based schemes is also discussed.

Breaking a chaos-based secure communication scheme designed by an improved modulation method

International Nuclear Information System (INIS)

Li Shujun; Alvarez, Gonzalo; Chen Guanrong

2005-01-01

Recently Bu and Wang [Bu S, Wang B-H. Chaos, Solitons and Fractals 2004;19(4):919-24] proposed a simple modulation method aiming to improve the security of chaos-based secure communications against return-map-based attacks. Soon this modulation method was independently cryptanalyzed by Chee et al. [Chee CY, Xu D, Bishop SR. Chaos, Solitons and Fractals 2004;21(5):1129-34], Wu et al. [Wu X, Hu H, Zhang B. Chaos, Solitons and Fractals 2004;22(2):367-73], and Alvarez et al. [Alvarez G, Montoya F, Romera M, Pastor G. Chaos, Solitons and Fractals, in press, arXiv:nlin/0406065] via different attacks. As an enhancement to the Bu-Wang method, an improving scheme was suggested by Wu et al. by removing the relationship between the modulating function and the zero-points. The present paper points out that the improved scheme proposed by Wu et al. is still insecure against a new attack. Compared with the existing attacks, the proposed attack is more powerful and can also break the original Bu-Wang scheme. Furthermore, it is pointed out that the security of the modulation-based schemes proposed by Wu et al. is not so satisfactory from a pure cryptographical point of view. The synchronization performance of this class of modulation-based schemes is also discussed

Adaptive method for multi-dimensional integration and selection of a base of chaos polynomials

International Nuclear Information System (INIS)

Crestaux, T.

2011-01-01

This research thesis addresses the propagation of uncertainty in numerical simulations and its processing within a probabilistic framework by a functional approach based on random variable functions. The author reports the use of the spectral method to represent random variables by development in polynomial chaos. More precisely, the author uses the method of non-intrusive projection which uses the orthogonality of Chaos Polynomials to compute the development coefficients by approximation of scalar products. The approach is applied to a cavity and to waste storage [fr

Meet-in-the-Middle Preimage Attacks on Hash Modes of Generalized Feistel and Misty Schemes with SP Round Function

Science.gov (United States)

Moon, Dukjae; Hong, Deukjo; Kwon, Daesung; Hong, Seokhie

We assume that the domain extender is the Merkle-Damgård (MD) scheme and he message is padded by a ‘1’, and minimum number of ‘0’s, followed by a fixed size length information so that the length of padded message is multiple of block length. Under this assumption, we analyze securities of the hash mode when the compression function follows the Davies-Meyer (DM) scheme and the underlying block cipher is one of the plain Feistel or Misty scheme or the generalized Feistel or Misty schemes with Substitution-Permutation (SP) round function. We do this work based on Meet-in-the-Middle (MitM) preimage attack techniques, and develop several useful initial structures.

SPONGENT: The Design Space of Lightweight Cryptographic Hashing

DEFF Research Database (Denmark)

Bogdanov, Andrey; Knezevic, Miroslav; Leander, Gregor

2013-01-01

construction instantiated with present-type permutations. The resulting family of hash functions is called spongent. We propose 13 spongent variants--or different levels of collision and (second) preimage resistance as well as for various implementation constraints. For each of them, we provide several ASIC...

Simultenious binary hash and features learning for image retrieval

Science.gov (United States)

Frantc, V. A.; Makov, S. V.; Voronin, V. V.; Marchuk, V. I.; Semenishchev, E. A.; Egiazarian, K. O.; Agaian, S.

2016-05-01

Content-based image retrieval systems have plenty of applications in modern world. The most important one is the image search by query image or by semantic description. Approaches to this problem are employed in personal photo-collection management systems, web-scale image search engines, medical systems, etc. Automatic analysis of large unlabeled image datasets is virtually impossible without satisfactory image-retrieval technique. It's the main reason why this kind of automatic image processing has attracted so much attention during recent years. Despite rather huge progress in the field, semantically meaningful image retrieval still remains a challenging task. The main issue here is the demand to provide reliable results in short amount of time. This paper addresses the problem by novel technique for simultaneous learning of global image features and binary hash codes. Our approach provide mapping of pixel-based image representation to hash-value space simultaneously trying to save as much of semantic image content as possible. We use deep learning methodology to generate image description with properties of similarity preservation and statistical independence. The main advantage of our approach in contrast to existing is ability to fine-tune retrieval procedure for very specific application which allow us to provide better results in comparison to general techniques. Presented in the paper framework for data- dependent image hashing is based on use two different kinds of neural networks: convolutional neural networks for image description and autoencoder for feature to hash space mapping. Experimental results confirmed that our approach has shown promising results in compare to other state-of-the-art methods.

ANALISA FUNGSI HASH DALAM ENKRIPSI IDEA UNTUK KEAMANAN RECORD INFORMASI

Directory of Open Access Journals (Sweden)

Ramen Antonov Purba

2014-02-01

Full Text Available Issues of security and confidentiality of data is very important to organization or individual. If the data in a network of computers connected with a public network such as the Internet. Of course a very important data is viewed or hijacked by unauthorized persons. Because if this happens we will probably corrupted data can be lost even that will cause huge material losses. This research discusses the security system of sending messages/data using the encryption aims to maintain access of security a message from the people who are not authorized/ eligible. Because of this delivery system is very extensive security with the scope then this section is limited only parsing the IDEA Algorithm with hash functions, which include encryption, decryption. By combining the encryption IDEA methods (International Data Encryption Algorithm to encrypt the contents of the messages/data with the hash function to detect changes the content of messages/data is expected security level to be better. Results from this study a software that can perform encryption and decryption of messages/data, generate the security key based on the message/data is encrypted.

Digital Communication Devices Based on Nonlinear Dynamics and Chaos

National Research Council Canada - National Science Library

Larson, Lawrence

2003-01-01

The final report of the ARO MURI "Digital Communications Based on Chaos and Nonlinear Dynamics" contains research results in the areas of chaos and nonlinear dynamics applied to wireless and optical communications...

Practical security and privacy attacks against biometric hashing using sparse recovery

Science.gov (United States)

Topcu, Berkay; Karabat, Cagatay; Azadmanesh, Matin; Erdogan, Hakan

2016-12-01

Biometric hashing is a cancelable biometric verification method that has received research interest recently. This method can be considered as a two-factor authentication method which combines a personal password (or secret key) with a biometric to obtain a secure binary template which is used for authentication. We present novel practical security and privacy attacks against biometric hashing when the attacker is assumed to know the user's password in order to quantify the additional protection due to biometrics when the password is compromised. We present four methods that can reconstruct a biometric feature and/or the image from a hash and one method which can find the closest biometric data (i.e., face image) from a database. Two of the reconstruction methods are based on 1-bit compressed sensing signal reconstruction for which the data acquisition scenario is very similar to biometric hashing. Previous literature introduced simple attack methods, but we show that we can achieve higher level of security threats using compressed sensing recovery techniques. In addition, we present privacy attacks which reconstruct a biometric image which resembles the original image. We quantify the performance of the attacks using detection error tradeoff curves and equal error rates under advanced attack scenarios. We show that conventional biometric hashing methods suffer from high security and privacy leaks under practical attacks, and we believe more advanced hash generation methods are necessary to avoid these attacks.

Linear Matrix Inequality Based Fuzzy Synchronization for Fractional Order Chaos

Directory of Open Access Journals (Sweden)

Bin Wang

2015-01-01

Full Text Available This paper investigates fuzzy synchronization for fractional order chaos via linear matrix inequality. Based on generalized Takagi-Sugeno fuzzy model, one efficient stability condition for fractional order chaos synchronization or antisynchronization is given. The fractional order stability condition is transformed into a set of linear matrix inequalities and the rigorous proof details are presented. Furthermore, through fractional order linear time-invariant (LTI interval theory, the approach is developed for fractional order chaos synchronization regardless of the system with uncertain parameters. Three typical examples, including synchronization between an integer order three-dimensional (3D chaos and a fractional order 3D chaos, anti-synchronization of two fractional order hyperchaos, and the synchronization between an integer order 3D chaos and a fractional order 4D chaos, are employed to verify the theoretical results.

A scalable lock-free hash table with open addressing

DEFF Research Database (Denmark)

Nielsen, Jesper Puge; Karlsson, Sven

2016-01-01

and concurrent operations without any locks. In this paper, we present a new fully lock-free open addressed hash table with a simpler design than prior published work. We split hash table insertions into two atomic phases: first inserting a value ignoring other concurrent operations, then in the second phase......Concurrent data structures synchronized with locks do not scale well with the number of threads. As more scalable alternatives, concurrent data structures and algorithms based on widely available, however advanced, atomic operations have been proposed. These data structures allow for correct...

Toward Optimal Manifold Hashing via Discrete Locally Linear Embedding.

Science.gov (United States)

Rongrong Ji; Hong Liu; Liujuan Cao; Di Liu; Yongjian Wu; Feiyue Huang

2017-11-01

Binary code learning, also known as hashing, has received increasing attention in large-scale visual search. By transforming high-dimensional features to binary codes, the original Euclidean distance is approximated via Hamming distance. More recently, it is advocated that it is the manifold distance, rather than the Euclidean distance, that should be preserved in the Hamming space. However, it retains as an open problem to directly preserve the manifold structure by hashing. In particular, it first needs to build the local linear embedding in the original feature space, and then quantize such embedding to binary codes. Such a two-step coding is problematic and less optimized. Besides, the off-line learning is extremely time and memory consuming, which needs to calculate the similarity matrix of the original data. In this paper, we propose a novel hashing algorithm, termed discrete locality linear embedding hashing (DLLH), which well addresses the above challenges. The DLLH directly reconstructs the manifold structure in the Hamming space, which learns optimal hash codes to maintain the local linear relationship of data points. To learn discrete locally linear embeddingcodes, we further propose a discrete optimization algorithm with an iterative parameters updating scheme. Moreover, an anchor-based acceleration scheme, termed Anchor-DLLH, is further introduced, which approximates the large similarity matrix by the product of two low-rank matrices. Experimental results on three widely used benchmark data sets, i.e., CIFAR10, NUS-WIDE, and YouTube Face, have shown superior performance of the proposed DLLH over the state-of-the-art approaches.

Scalable Content Authentication in H.264/SVC Videos Using Perceptual Hashing based on Dempster-Shafer theory

Directory of Open Access Journals (Sweden)

Ye Dengpan

2012-09-01

Full Text Available The content authenticity of the multimedia delivery is important issue with rapid development and widely used of multimedia technology. Till now many authentication solutions had been proposed, such as cryptology and watermarking based methods. However, in latest heterogeneous network the video stream transmission has been coded in scalable way such as H.264/SVC, there is still no good authentication solution. In this paper, we firstly summarized related works and proposed a scalable content authentication scheme using a ratio of different energy (RDE based perceptual hashing in Q/S dimension, which is used Dempster-Shafer theory and combined with the latest scalable video coding (H.264/SVC construction. The idea of aldquo;sign once and verify in scalable wayardquo; can be realized. Comparing with previous methods, the proposed scheme based on perceptual hashing outperforms previous works in uncertainty (robustness and efficiencies in the H.264/SVC video streams. At last, the experiment results verified the performance of our scheme.

Model-based recognition of 3-D objects by geometric hashing technique

International Nuclear Information System (INIS)

Severcan, M.; Uzunalioglu, H.

1992-09-01

A model-based object recognition system is developed for recognition of polyhedral objects. The system consists of feature extraction, modelling and matching stages. Linear features are used for object descriptions. Lines are obtained from edges using rotation transform. For modelling and recognition process, geometric hashing method is utilized. Each object is modelled using 2-D views taken from the viewpoints on the viewing sphere. A hidden line elimination algorithm is used to find these views from the wire frame model of the objects. The recognition experiments yielded satisfactory results. (author). 8 refs, 5 figs

CHAOS-BASED ADVANCED ENCRYPTION STANDARD

KAUST Repository

Abdulwahed, Naif B.

2013-01-01

This thesis introduces a new chaos-based Advanced Encryption Standard (AES). The AES is a well-known encryption algorithm that was standardized by U.S National Institute of Standard and Technology (NIST) in 2001. The thesis investigates and explores

MinHash-Based Fuzzy Keyword Search of Encrypted Data across Multiple Cloud Servers

Directory of Open Access Journals (Sweden)

Jingsha He

2018-05-01

Full Text Available To enhance the efficiency of data searching, most data owners store their data files in different cloud servers in the form of cipher-text. Thus, efficient search using fuzzy keywords becomes a critical issue in such a cloud computing environment. This paper proposes a method that aims at improving the efficiency of cipher-text retrieval and lowering storage overhead for fuzzy keyword search. In contrast to traditional approaches, the proposed method can reduce the complexity of Min-Hash-based fuzzy keyword search by using Min-Hash fingerprints to avoid the need to construct the fuzzy keyword set. The method will utilize Jaccard similarity to rank the results of retrieval, thus reducing the amount of calculation for similarity and saving a lot of time and space overhead. The method will also take consideration of multiple user queries through re-encryption technology and update user permissions dynamically. Security analysis demonstrates that the method can provide better privacy preservation and experimental results show that efficiency of cipher-text using the proposed method can improve the retrieval time and lower storage overhead as well.

Accelerating SPARQL queries by exploiting hash-based locality and adaptive partitioning

KAUST Repository

Al-Harbi, Razen; Abdelaziz, Ibrahim; Kalnis, Panos; Mamoulis, Nikos; Ebrahim, Yasser; Sahli, Majed

2016-01-01

State-of-the-art distributed RDF systems partition data across multiple computer nodes (workers). Some systems perform cheap hash partitioning, which may result in expensive query evaluation. Others try to minimize inter-node communication, which

Privacy-Preserving and Scalable Service Recommendation Based on SimHash in a Distributed Cloud Environment

Directory of Open Access Journals (Sweden)

Yanwei Xu

2017-01-01

Full Text Available With the increasing volume of web services in the cloud environment, Collaborative Filtering- (CF- based service recommendation has become one of the most effective techniques to alleviate the heavy burden on the service selection decisions of a target user. However, the service recommendation bases, that is, historical service usage data, are often distributed in different cloud platforms. Two challenges are present in such a cross-cloud service recommendation scenario. First, a cloud platform is often not willing to share its data to other cloud platforms due to privacy concerns, which decreases the feasibility of cross-cloud service recommendation severely. Second, the historical service usage data recorded in each cloud platform may update over time, which reduces the recommendation scalability significantly. In view of these two challenges, a novel privacy-preserving and scalable service recommendation approach based on SimHash, named SerRecSimHash, is proposed in this paper. Finally, through a set of experiments deployed on a real distributed service quality dataset WS-DREAM, we validate the feasibility of our proposal in terms of recommendation accuracy and efficiency while guaranteeing privacy-preservation.

MATCHING AERIAL IMAGES TO 3D BUILDING MODELS BASED ON CONTEXT-BASED GEOMETRIC HASHING

Directory of Open Access Journals (Sweden)

J. Jung

2016-06-01

Full Text Available In this paper, a new model-to-image framework to automatically align a single airborne image with existing 3D building models using geometric hashing is proposed. As a prerequisite process for various applications such as data fusion, object tracking, change detection and texture mapping, the proposed registration method is used for determining accurate exterior orientation parameters (EOPs of a single image. This model-to-image matching process consists of three steps: 1 feature extraction, 2 similarity measure and matching, and 3 adjustment of EOPs of a single image. For feature extraction, we proposed two types of matching cues, edged corner points representing the saliency of building corner points with associated edges and contextual relations among the edged corner points within an individual roof. These matching features are extracted from both 3D building and a single airborne image. A set of matched corners are found with given proximity measure through geometric hashing and optimal matches are then finally determined by maximizing the matching cost encoding contextual similarity between matching candidates. Final matched corners are used for adjusting EOPs of the single airborne image by the least square method based on co-linearity equations. The result shows that acceptable accuracy of single image's EOP can be achievable by the proposed registration approach as an alternative to labour-intensive manual registration process.

Accelerating SPARQL queries by exploiting hash-based locality and adaptive partitioning

KAUST Repository

Al-Harbi, Razen

2016-02-08

State-of-the-art distributed RDF systems partition data across multiple computer nodes (workers). Some systems perform cheap hash partitioning, which may result in expensive query evaluation. Others try to minimize inter-node communication, which requires an expensive data preprocessing phase, leading to a high startup cost. Apriori knowledge of the query workload has also been used to create partitions, which, however, are static and do not adapt to workload changes. In this paper, we propose AdPart, a distributed RDF system, which addresses the shortcomings of previous work. First, AdPart applies lightweight partitioning on the initial data, which distributes triples by hashing on their subjects; this renders its startup overhead low. At the same time, the locality-aware query optimizer of AdPart takes full advantage of the partitioning to (1) support the fully parallel processing of join patterns on subjects and (2) minimize data communication for general queries by applying hash distribution of intermediate results instead of broadcasting, wherever possible. Second, AdPart monitors the data access patterns and dynamically redistributes and replicates the instances of the most frequent ones among workers. As a result, the communication cost for future queries is drastically reduced or even eliminated. To control replication, AdPart implements an eviction policy for the redistributed patterns. Our experiments with synthetic and real data verify that AdPart: (1) starts faster than all existing systems; (2) processes thousands of queries before other systems become online; and (3) gracefully adapts to the query load, being able to evaluate queries on billion-scale RDF data in subseconds.

Secure image encryption algorithm design using a novel chaos based S-Box

International Nuclear Information System (INIS)

Çavuşoğlu, Ünal; Kaçar, Sezgin; Pehlivan, Ihsan; Zengin, Ahmet

2017-01-01

Highlights: • A new chaotic system is developed for creating S-Box and image encryption algorithm. • Chaos based random number generator is designed with the help of the new chaotic system. NIST tests are run on generated random numbers to verify randomness. • A new S-Box design algorithm is developed to create the chaos based S-Box to be utilized in encryption algorithm and performance tests are made. • The new developed S-Box based image encryption algorithm is introduced and image encryption application is carried out. • To show the quality and strong of the encryption process, security analysis are performed and compared with the AES and chaos algorithms. - Abstract: In this study, an encryption algorithm that uses chaos based S-BOX is developed for secure and speed image encryption. First of all, a new chaotic system is developed for creating S-Box and image encryption algorithm. Chaos based random number generator is designed with the help of the new chaotic system. Then, NIST tests are run on generated random numbers to verify randomness. A new S-Box design algorithm is developed to create the chaos based S-Box to be utilized in encryption algorithm and performance tests are made. As the next step, the new developed S-Box based image encryption algorithm is introduced in detail. Finally, image encryption application is carried out. To show the quality and strong of the encryption process, security analysis are performed. Proposed algorithm is compared with the AES and chaos algorithms. According to tests results, the proposed image encryption algorithm is secure and speed for image encryption application.

A hash based mutual RFID tag authentication protocol in telecare medicine information system.

Science.gov (United States)

Srivastava, Keerti; Awasthi, Amit K; Kaul, Sonam D; Mittal, R C

2015-01-01

Radio Frequency Identification (RFID) is a technology which has multidimensional applications to reduce the complexity of today life. Everywhere, like access control, transportation, real-time inventory, asset management and automated payment systems etc., RFID has its enormous use. Recently, this technology is opening its wings in healthcare environments, where potential applications include patient monitoring, object traceability and drug administration systems etc. In this paper, we propose a secure RFID-based protocol for the medical sector. This protocol is based on hash operation with synchronized secret. The protocol is safe against active and passive attacks such as forgery, traceability, replay and de-synchronization attack.

A Proposed Stochastic Finite Difference Approach Based on Homogenous Chaos Expansion

Directory of Open Access Journals (Sweden)

O. H. Galal

2013-01-01

Full Text Available This paper proposes a stochastic finite difference approach, based on homogenous chaos expansion (SFDHC. The said approach can handle time dependent nonlinear as well as linear systems with deterministic or stochastic initial and boundary conditions. In this approach, included stochastic parameters are modeled as second-order stochastic processes and are expanded using Karhunen-Loève expansion, while the response function is approximated using homogenous chaos expansion. Galerkin projection is used in converting the original stochastic partial differential equation (PDE into a set of coupled deterministic partial differential equations and then solved using finite difference method. Two well-known equations were used for efficiency validation of the method proposed. First one being the linear diffusion equation with stochastic parameter and the second is the nonlinear Burger's equation with stochastic parameter and stochastic initial and boundary conditions. In both of these examples, the probability distribution function of the response manifested close conformity to the results obtained from Monte Carlo simulation with optimized computational cost.

An Access Control Protocol for Wireless Sensor Network Using Double Trapdoor Chameleon Hash Function

Directory of Open Access Journals (Sweden)

Tejeshwari Thakur

2016-01-01

Full Text Available Wireless sensor network (WSN, a type of communication system, is normally deployed into the unattended environment where the intended user can get access to the network. The sensor nodes collect data from this environment. If the data are valuable and confidential, then security measures are needed to protect them from the unauthorized access. This situation requires an access control protocol (ACP in the design of sensor network because of sensor nodes which are vulnerable to various malicious attacks during the authentication and key establishment and the new node addition phase. In this paper, we propose a secured ACP for such WSN. This protocol is based on Elliptic Curve Discrete Log Problem (ECDLP and double trapdoor chameleon hash function which secures the WSN from malicious attacks such as node masquerading attack, replay attack, man-in-the-middle attack, and forgery attacks. Proposed ACP has a special feature known as session key security. Also, the proposed ACP is more efficient as it requires only one modular multiplication during the initialization phase.

Encounters with chaos and fractals

CERN Document Server

Gulick, Denny

2012-01-01

Periodic Points Iterates of Functions Fixed Points Periodic Points Families of Functions The Quadratic Family Bifurcations Period-3 Points The Schwarzian Derivative One-Dimensional Chaos Chaos Transitivity and Strong Chaos Conjugacy Cantor Sets Two-Dimensional Chaos Review of Matrices Dynamics of Linear FunctionsNonlinear Maps The Hénon Map The Horseshoe Map Systems of Differential Equations Review of Systems of Differential Equations Almost Linearity The Pendulum The Lorenz System Introduction to Fractals Self-Similarity The Sierpiński Gasket and Other "Monsters"Space-Filling Curves Similarity and Capacity DimensionsLyapunov Dimension Calculating Fractal Dimensions of Objects Creating Fractals Sets Metric Spaces The Hausdorff Metric Contractions and Affine Functions Iterated Function SystemsAlgorithms for Drawing Fractals Complex Fractals: Julia Sets and the Mandelbrot Set Complex Numbers and Functions Julia Sets The Mandelbrot Set Computer Programs Answers to Selected Exercises References Index.

Parameter identification of chaos system based on unknown parameter observer

International Nuclear Information System (INIS)

Wang Shaoming; Luo Haigeng; Yue Chaoyuan; Liao Xiaoxin

2008-01-01

Parameter identification of chaos system based on unknown parameter observer is discussed generally. Based on the work of Guan et al. [X.P. Guan, H.P. Peng, L.X. Li, et al., Acta Phys. Sinica 50 (2001) 26], the design of unknown parameter observer is improved. The application of the improved approach is extended greatly. The works in some literatures [X.P. Guan, H.P. Peng, L.X. Li, et al., Acta Phys. Sinica 50 (2001) 26; J.H. Lue, S.C. Zhang, Phys. Lett. A 286 (2001) 148; X.Q. Wu, J.A. Lu, Chaos Solitons Fractals 18 (2003) 721; J. Liu, S.H. Chen, J. Xie, Chaos Solitons Fractals 19 (2004) 533] are only the special cases of our Corollaries 1 and 2. Some observers for Lue system and a new chaos system are designed to test our improved method, and simulations results demonstrate the effectiveness and feasibility of the improved approach

Chaos based on Riemannian geometric approach to Abelian-Higgs dynamical system

International Nuclear Information System (INIS)

Kawabe, Tetsuji

2003-01-01

Based on the Riemannian geometric approach, we study chaos of the Abelian-Higgs dynamical system derived from a classical field equation consisting of a spatially homogeneous Abelian gauge field and Higgs field. Using the global indicator of chaos formulated by the sectional curvature of the ambient manifold, we show that this approach brings the same qualitative and quantitative information about order and chaos as has been provided by the Lyapunov exponents in the conventional and phenomenological approach. We confirm that the mechanism of chaos is a parametric instability of the system. By analyzing a close relation between the sectional curvature and the Gaussian curvature, we point out that the Toda-Brumer criterion becomes a sufficient condition to the criterion based on this geometric approach as to the stability condition

MULTIMEDIA DATA TRANSMISSION THROUGH TCP/IP USING HASH BASED FEC WITH AUTO-XOR SCHEME

OpenAIRE

R. Shalin; D. Kesavaraja

2012-01-01

The most preferred mode for communication of multimedia data is through the TCP/IP protocol. But on the other hand the TCP/IP protocol produces huge packet loss unavoidable due to network traffic and congestion. In order to provide a efficient communication it is necessary to recover the loss of packets. The proposed scheme implements Hash based FEC with auto XOR scheme for this purpose. The scheme is implemented through Forward error correction, MD5 and XOR for providing efficient transmissi...

Chaos game representation of functional protein sequences, and simulation and multifractal analysis of induced measures

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)

Chaos control of ferroresonance system based on RBF-maximum entropy clustering algorithm

International Nuclear Information System (INIS)

Liu Fan; Sun Caixin; Sima Wenxia; Liao Ruijin; Guo Fei

2006-01-01

With regards to the ferroresonance overvoltage of neutral grounded power system, a maximum-entropy learning algorithm based on radial basis function neural networks is used to control the chaotic system. The algorithm optimizes the object function to derive learning rule of central vectors, and uses the clustering function of network hidden layers. It improves the regression and learning ability of neural networks. The numerical experiment of ferroresonance system testifies the effectiveness and feasibility of using the algorithm to control chaos in neutral grounded system

Matching Aerial Images to 3D Building Models Using Context-Based Geometric Hashing

Directory of Open Access Journals (Sweden)

Jaewook Jung

2016-06-01

Full Text Available A city is a dynamic entity, which environment is continuously changing over time. Accordingly, its virtual city models also need to be regularly updated to support accurate model-based decisions for various applications, including urban planning, emergency response and autonomous navigation. A concept of continuous city modeling is to progressively reconstruct city models by accommodating their changes recognized in spatio-temporal domain, while preserving unchanged structures. A first critical step for continuous city modeling is to coherently register remotely sensed data taken at different epochs with existing building models. This paper presents a new model-to-image registration method using a context-based geometric hashing (CGH method to align a single image with existing 3D building models. This model-to-image registration process consists of three steps: (1 feature extraction; (2 similarity measure; and matching, and (3 estimating exterior orientation parameters (EOPs of a single image. For feature extraction, we propose two types of matching cues: edged corner features representing the saliency of building corner points with associated edges, and contextual relations among the edged corner features within an individual roof. A set of matched corners are found with given proximity measure through geometric hashing, and optimal matches are then finally determined by maximizing the matching cost encoding contextual similarity between matching candidates. Final matched corners are used for adjusting EOPs of the single airborne image by the least square method based on collinearity equations. The result shows that acceptable accuracy of EOPs of a single image can be achievable using the proposed registration approach as an alternative to a labor-intensive manual registration process.

A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol.

Directory of Open Access Journals (Sweden)

Ping Zeng

Full Text Available In this paper, based on our previous multi-pattern uniform resource locator (URL binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can be applied to the fields of network security, data analysis, load balancing, cloud robotic communications, and so on-all of which require string matching from a fixed starting position. Our approach effectively solves the performance problems of the classical multi-pattern matching algorithms. This paper explores ways to improve string matching performance under the HTTP protocol by using a hash method combined with a binary method that transforms the symbol-space matching problem into a digital-space numerical-size comparison and hashing problem. The MH approach has a fast matching speed, requires little memory, performs better than both the classical algorithms and HEM for matching fields in an HTTP stream, and it has great promise for use in real-world applications.

Short-term data forecasting based on wavelet transformation and chaos theory

Science.gov (United States)

Wang, Yi; Li, Cunbin; Zhang, Liang

2017-09-01

A sketch of wavelet transformation and its application was given. Concerning the characteristics of time sequence, Haar wavelet was used to do data reduction. After processing, the effect of “data nail” on forecasting was reduced. Chaos theory was also introduced, a new chaos time series forecasting flow based on wavelet transformation was proposed. The largest Lyapunov exponent was larger than zero from small data sets, it verified the data change behavior still met chaotic behavior. Based on this, chaos time series to forecast short-term change behavior could be used. At last, the example analysis of the price from a real electricity market showed that the forecasting method increased the precision of the forecasting more effectively and steadily.

Defining chaos.

Science.gov (United States)

Hunt, Brian R; Ott, Edward

2015-09-01

In this paper, we propose, discuss, and illustrate a computationally feasible definition of chaos which can be applied very generally to situations that are commonly encountered, including attractors, repellers, and non-periodically forced systems. This definition is based on an entropy-like quantity, which we call "expansion entropy," and we define chaos as occurring when this quantity is positive. We relate and compare expansion entropy to the well-known concept of topological entropy to which it is equivalent under appropriate conditions. We also present example illustrations, discuss computational implementations, and point out issues arising from attempts at giving definitions of chaos that are not entropy-based.

Chaos in neurons and its application: perspective of chaos engineering.

Science.gov (United States)

Hirata, Yoshito; Oku, Makito; Aihara, Kazuyuki

2012-12-01

We review our recent work on chaos in neurons and its application to neural networks from perspective of chaos engineering. Especially, we analyze a dataset of a squid giant axon by newly combining our previous work of identifying Devaney's chaos with surrogate data analysis, and show that an axon can behave chaotically. Based on this knowledge, we use a chaotic neuron model to investigate possible information processing in the brain.

Secure communications of CAP-4 and OOK signals over MMF based on electro-optic chaos.

Science.gov (United States)

Ai, Jianzhou; Wang, Lulu; Wang, Jian

2017-09-15

Chaos-based secure communication can provide a high level of privacy in data transmission. Here, we experimentally demonstrate secure signal transmission over two kinds of multimode fiber (MMF) based on electro-optic intensity chaos. High-quality synchronization is achieved in an electro-optic feedback configuration. Both 5  Gbit/s carrier-less amplitude/phase (CAP-4) modulation and 10  Gbit/s on-off key (OOK) signals are recovered efficiently in electro-optic chaos-based communication systems. Degradations of chaos synchronization and communication system due to mismatch of various hardware keys are also discussed.

Robust Image Hashing Using Radon Transform and Invariant Features

Directory of Open Access Journals (Sweden)

Y.L. Liu

2016-09-01

Full Text Available A robust image hashing method based on radon transform and invariant features is proposed for image authentication, image retrieval, and image detection. Specifically, an input image is firstly converted into a counterpart with a normalized size. Then the invariant centroid algorithm is applied to obtain the invariant feature point and the surrounding circular area, and the radon transform is employed to acquire the mapping coefficient matrix of the area. Finally, the hashing sequence is generated by combining the feature vectors and the invariant moments calculated from the coefficient matrix. Experimental results show that this method not only can resist against the normal image processing operations, but also some geometric distortions. Comparisons of receiver operating characteristic (ROC curve indicate that the proposed method outperforms some existing methods in classification between perceptual robustness and discrimination.

Polynomial chaos functions and stochastic differential equations

International Nuclear Information System (INIS)

Williams, M.M.R.

2006-01-01

The Karhunen-Loeve procedure and the associated polynomial chaos expansion have been employed to solve a simple first order stochastic differential equation which is typical of transport problems. Because the equation has an analytical solution, it provides a useful test of the efficacy of polynomial chaos. We find that the convergence is very rapid in some cases but that the increased complexity associated with many random variables can lead to very long computational times. The work is illustrated by exact and approximate solutions for the mean, variance and the probability distribution itself. The usefulness of a white noise approximation is also assessed. Extensive numerical results are given which highlight the weaknesses and strengths of polynomial chaos. The general conclusion is that the method is promising but requires further detailed study by application to a practical problem in transport theory

Chaos synchronization based on contraction principle

International Nuclear Information System (INIS)

Wang Junwei; Zhou Tianshou

2007-01-01

This paper introduces contraction principle. Based on such a principle, a novel scheme is proposed to synchronize coupled systems with global diffusive coupling. A rigorous sufficient condition on chaos synchronization is derived. As an example, coupled Lorenz systems with nearest-neighbor diffusive coupling are investigated, and numerical simulations are given to validate the proposed synchronization approach

Hardware Realization of Chaos Based Symmetric Image Encryption

KAUST Repository

Barakat, Mohamed L.

2012-01-01

This thesis presents a novel work on hardware realization of symmetric image encryption utilizing chaos based continuous systems as pseudo random number generators. Digital implementation of chaotic systems results in serious degradations

Hyperbolic Chaos A Physicist’s View

CERN Document Server

Kuznetsov, Sergey P

2012-01-01

"Hyperbolic Chaos: A Physicist’s View” presents recent progress on uniformly hyperbolic attractors in dynamical systems from a physical rather than mathematical perspective (e.g. the Plykin attractor, the Smale – Williams solenoid). The structurally stable attractors manifest strong stochastic properties, but are insensitive to variation of functions and parameters in the dynamical systems. Based on these characteristics of hyperbolic chaos, this monograph shows how to find hyperbolic chaotic attractors in physical systems and how to design a physical systems that possess hyperbolic chaos.   This book is designed as a reference work for university professors and researchers in the fields of physics, mechanics, and engineering.   Dr. Sergey P. Kuznetsov is a professor at the Department of Nonlinear Processes, Saratov State University, Russia.  

Analysis and improvement of a chaos-based image encryption algorithm

International Nuclear Information System (INIS)

Xiao Di; Liao Xiaofeng; Wei Pengcheng

2009-01-01

The security of digital image attracts much attention recently. In Guan et al. [Guan Z, Huang F, Guan W. Chaos-based image encryption algorithm. Phys Lett A 2005; 346: 153-7.], a chaos-based image encryption algorithm has been proposed. In this paper, the cause of potential flaws in the original algorithm is analyzed in detail, and then the corresponding enhancement measures are proposed. Both theoretical analysis and computer simulation indicate that the improved algorithm can overcome these flaws and maintain all the merits of the original one.

De Moivre's formula: are Sands' H-functions the same as Chao's?

International Nuclear Information System (INIS)

Nishikawa, P

2012-01-01

It has often been said that there is no clear extension of the Courant-Snyder theory to coupled dynamics. In particular, one never sees an extension of the symplectic de Moivre type formula beyond one degree of freedom. In the process of analysing the existence and meaning of such a formula, I discovered quite accidentally that Sands' formalism, if expressed in terms of Ripken-like lattice functions germane to the full three dimensional oscillator, gives the exact same result as the more accurate Chao theory. This semi-serious paper displays this elegant connection. It is based in the lattice functions of Ripken as extended by Forest. We review Forest's derivation from the point of view de Moivre's formula extended to three degrees of freedom.

Hardware Realization of Chaos-based Symmetric Video Encryption

KAUST Repository

Ibrahim, Mohamad A.

2013-01-01

This thesis reports original work on hardware realization of symmetric video encryption using chaos-based continuous systems as pseudo-random number generators. The thesis also presents some of the serious degradations caused by digitally

Supervised chaos genetic algorithm based state of charge determination for LiFePO4 batteries in electric vehicles

Science.gov (United States)

Shen, Yanqing

2018-04-01

LiFePO4 battery is developed rapidly in electric vehicle, whose safety and functional capabilities are influenced greatly by the evaluation of available cell capacity. Added with adaptive switch mechanism, this paper advances a supervised chaos genetic algorithm based state of charge determination method, where a combined state space model is employed to simulate battery dynamics. The method is validated by the experiment data collected from battery test system. Results indicate that the supervised chaos genetic algorithm based state of charge determination method shows great performance with less computation complexity and is little influenced by the unknown initial cell state.

Chaos synchronization of coupled hyperchaotic system

International Nuclear Information System (INIS)

Yang Lixin; Chu Yandong; Zhang Jiangang; Li Xianfeng

2009-01-01

Chaos synchronization, as an important topic, has become an active research subject in nonlinear science. Over the past two decades, chaos synchronization between nonlinear systems has been extensively studied, and many types of synchronization have been announced. This paper introduces synchronization of coupled hyperchaotic system, based on the Lapunov stability theory, asymptotic stability of the system is guaranteed by means of Lapunov function. The numerical simulation was provided in order to show the effectiveness of this method for the synchronization of the chaotic hyperchaotic Chen system and Rossler system.

MULTIMEDIA DATA TRANSMISSION THROUGH TCP/IP USING HASH BASED FEC WITH AUTO-XOR SCHEME

Directory of Open Access Journals (Sweden)

R. Shalin

2012-09-01

Full Text Available The most preferred mode for communication of multimedia data is through the TCP/IP protocol. But on the other hand the TCP/IP protocol produces huge packet loss unavoidable due to network traffic and congestion. In order to provide a efficient communication it is necessary to recover the loss of packets. The proposed scheme implements Hash based FEC with auto XOR scheme for this purpose. The scheme is implemented through Forward error correction, MD5 and XOR for providing efficient transmission of multimedia data. The proposed scheme provides transmission high accuracy, throughput and low latency and loss.

Range-efficient consistent sampling and locality-sensitive hashing for polygons

DEFF Research Database (Denmark)

Gudmundsson, Joachim; Pagh, Rasmus

2017-01-01

Locality-sensitive hashing (LSH) is a fundamental technique for similarity search and similarity estimation in high-dimensional spaces. The basic idea is that similar objects should produce hash collisions with probability significantly larger than objects with low similarity. We consider LSH for...... or union of a set of preprocessed polygons. Curiously, our consistent sampling method uses transformation to a geometric problem....

Linear-XOR and Additive Checksums Don't Protect Damgard-Merkle Hashes

DEFF Research Database (Denmark)

Gauravaram, Praveen; Kelsey, John

2008-01-01

We consider the security of Damg\\aa{}rd-Merkle variants which compute linear-XOR or additive checksums over message blocks, intermediate hash values, or both, and process these checksums in computing the final hash value. We show that these Damg\\aa{}rd-Merkle variants gain almost no security...

Noise tolerant spatiotemporal chaos computing.

Science.gov (United States)

Kia, Behnam; Kia, Sarvenaz; Lindner, John F; Sinha, Sudeshna; Ditto, William L

2014-12-01

We introduce and design a noise tolerant chaos computing system based on a coupled map lattice (CML) and the noise reduction capabilities inherent in coupled dynamical systems. The resulting spatiotemporal chaos computing system is more robust to noise than a single map chaos computing system. In this CML based approach to computing, under the coupled dynamics, the local noise from different nodes of the lattice diffuses across the lattice, and it attenuates each other's effects, resulting in a system with less noise content and a more robust chaos computing architecture.

Chaos excited chaos synchronizations of integral and fractional order generalized van der Pol systems

International Nuclear Information System (INIS)

Ge Zhengming; Hsu Maoyuan

2008-01-01

In this paper, chaos excited chaos synchronizations of generalized van der Pol systems with integral and fractional order are studied. Synchronizations of two identified autonomous generalized van der Pol chaotic systems are obtained by replacing their corresponding exciting terms by the same function of chaotic states of a third nonautonomous or autonomous generalized van der Pol system. Numerical simulations, such as phase portraits, Poincare maps and state error plots are given. It is found that chaos excited chaos synchronizations exist for the fractional order systems with the total fractional order both less than and more than the number of the states of the integer order generalized van der Pol system

Speaker Linking and Applications using Non-Parametric Hashing Methods

Science.gov (United States)

2016-09-08

nonparametric estimate of a multivariate density function,” The Annals of Math- ematical Statistics , vol. 36, no. 3, pp. 1049–1051, 1965. [9] E. A. Patrick...Speaker Linking and Applications using Non-Parametric Hashing Methods† Douglas Sturim and William M. Campbell MIT Lincoln Laboratory, Lexington, MA...with many approaches [1, 2]. For this paper, we focus on using i-vectors [2], but the methods apply to any embedding. For the task of speaker QBE and

Random number generation based on digital differential chaos

KAUST Repository

Zidan, Mohammed A.; Radwan, Ahmed G.; Salama, Khaled N.

2012-01-01

In this paper, we present a fully digital differential chaos based random number generator. The output of the digital circuit is proved to be chaotic by calculating the output time series maximum Lyapunov exponent. We introduce a new post processing

Hash-chain-based authentication for IoT

Directory of Open Access Journals (Sweden)

Antonio PINTO

2016-12-01

Full Text Available The number of everyday interconnected devices continues to increase and constitute the Internet of Things (IoT. Things are small computers equipped with sensors and wireless communications capabilities that are driven by energy constraints, since they use batteries and may be required to operate over long periods of time. The majority of these devices perform data collection. The collected data is stored on-line using web-services that, sometimes, operate without any special considerations regarding security and privacy. The current work proposes a modified hash-chain authentication mechanism that, with the help of a smartphone, can authenticate each interaction of the devices with a REST web-service using One Time Passwords (OTP while using open wireless networks. Moreover, the proposed authentication mechanism adheres to the stateless, HTTP-like behavior expected of REST web-services, even allowing the caching of server authentication replies within a predefined time window. No other known web-service authentication mechanism operates in such manner.

Controlling Chaos and Voltage Collapse using Layered Recurrent Network-based PID-SVC in Power Systems

Directory of Open Access Journals (Sweden)

I Made Ginarsa

2013-11-01

Full Text Available Chaos and voltage collapse occurred in critical power systems due to disturbing of energy. PID-SVC layered reccurrent neural network-based (LRN-based PID-SVC was proposed to solve this problem. A PID was used to control chaos and voltage collapse. Then, an SVC LRN-based to maintan the load voltage. By using the proposed controller, chaos and voltage collapse were able to suppress and maintain the load voltage around the setting value. Furthemore, the proposed controller gives better response than PI-SVC controller.

Order against chaos in nuclei

International Nuclear Information System (INIS)

Soloviev, V.G.

1995-01-01

Order and chaos and order-to-chaos transition are treated in terms of nuclear wave functions. A quasiparticle-phonon interaction is responsible for the fragmentation of one- and many-quasiparticle and phonon states and for the mixing of closely spaced states. Complete damping of one-quasiparticle states cannot be considered as a transition to chaos due to large many-quasiparticle or quasiparticle-phonon terms in their wave functions. An experimental investigation of the strength distribution of many-quasiparticle and quasiparticle-phonon states should uncover a new region of a regularity in nuclei at intermediate excitation energy. A chaotic behaviour of nuclear states can be shifted to higher excitation energies. ((orig.))

Stochastic resonance based on modulation instability in spatiotemporal chaos.

Science.gov (United States)

Han, Jing; Liu, Hongjun; Huang, Nan; Wang, Zhaolu

2017-04-03

A novel dynamic of stochastic resonance in spatiotemporal chaos is presented, which is based on modulation instability of perturbed partially coherent wave. The noise immunity of chaos can be reinforced through this effect and used to restore the coherent signal information buried in chaotic perturbation. A theoretical model with fluctuations term is derived from the complex Ginzburg-Landau equation via Wigner transform. It shows that through weakening the nonlinear threshold and triggering energy redistribution, the coherent component dominates the instability damped by incoherent component. The spatiotemporal output showing the properties of stochastic resonance may provide a potential application of signal encryption and restoration.

An enhanced biometric authentication scheme for telecare medicine information systems with nonce using chaotic hash function.

Science.gov (United States)

Das, Ashok Kumar; Goswami, Adrijit

2014-06-01

Recently, Awasthi and Srivastava proposed a novel biometric remote user authentication scheme for the telecare medicine information system (TMIS) with nonce. Their scheme is very efficient as it is based on efficient chaotic one-way hash function and bitwise XOR operations. In this paper, we first analyze Awasthi-Srivastava's scheme and then show that their scheme has several drawbacks: (1) incorrect password change phase, (2) fails to preserve user anonymity property, (3) fails to establish a secret session key beween a legal user and the server, (4) fails to protect strong replay attack, and (5) lacks rigorous formal security analysis. We then a propose a novel and secure biometric-based remote user authentication scheme in order to withstand the security flaw found in Awasthi-Srivastava's scheme and enhance the features required for an idle user authentication scheme. Through the rigorous informal and formal security analysis, we show that our scheme is secure against possible known attacks. In addition, we simulate our scheme for the formal security verification using the widely-accepted AVISPA (Automated Validation of Internet Security Protocols and Applications) tool and show that our scheme is secure against passive and active attacks, including the replay and man-in-the-middle attacks. Our scheme is also efficient as compared to Awasthi-Srivastava's scheme.

Stochastic chaos induced by diffusion processes with identical spectral density but different probability density functions.

Science.gov (United States)

Lei, Youming; Zheng, Fan

2016-12-01

Stochastic chaos induced by diffusion processes, with identical spectral density but different probability density functions (PDFs), is investigated in selected lightly damped Hamiltonian systems. The threshold amplitude of diffusion processes for the onset of chaos is derived by using the stochastic Melnikov method together with a mean-square criterion. Two quasi-Hamiltonian systems, namely, a damped single pendulum and damped Duffing oscillator perturbed by stochastic excitations, are used as illustrative examples. Four different cases of stochastic processes are taking as the driving excitations. It is shown that in such two systems the spectral density of diffusion processes completely determines the threshold amplitude for chaos, regardless of the shape of their PDFs, Gaussian or otherwise. Furthermore, the mean top Lyapunov exponent is employed to verify analytical results. The results obtained by numerical simulations are in accordance with the analytical results. This demonstrates that the stochastic Melnikov method is effective in predicting the onset of chaos in the quasi-Hamiltonian systems.

Five Performance Enhancements for Hybrid Hash Join

National Research Council Canada - National Science Library

Graefe, Goetz

1992-01-01

.... We discuss five performance enhancements for hybrid hash join algorithms, namely data compression, large cluster sizes and multi-level recursion, role reversal of build and probe inputs, histogram...

Chaos in collective nuclei

International Nuclear Information System (INIS)

Whelan, N.D.

1993-01-01

Random Matrix Theory successfully describes the statistics of the low-lying spectra of some nuclei but not of others. It is currently believed that this theory applies to systems in which the corresponding classical motion is chaotic. This conjecture is tested for collective nuclei by studying the Interacting Boson Model. Quantum and classical measures of chaos are proposed and found to be in agreement throughout the parameter space of the model. For some parameter values the measures indicate the presence of a previously unknown approximate symmetry. A phenomenon called partial dynamical symmetry is explored and shown to lead to a suppression of chaos. A time dependent function calculated from the quantum spectrum is discussed. This function is sensitive to the extent of chaos and provides a robust method of analyzing experimental spectra

GATHERING TECHNOLOGY BASED ON REGEX WEB PAGE DENOISING HASH ALIGNMENTS WEB CRAWLER WITHOUT LANDING THE MICRO - BLOG ABUNDANT%基于 Regex 网页去噪 Hash 比对的网络爬虫无登陆微博采集技术

Institute of Scientific and Technical Information of China (English)

陈宇; 孟凡龙; 刘培玉; 朱振方

2015-01-01

针对当前微博采集无精确去噪方法和微博无法无登陆采集现象，笔者提出了基于 Regex 网页去噪 Hash 对比的网络爬虫采集方案并利用插件采集实现了无登陆采集。该方法通过 Regex 构建 DFA 和 NFA 模型来去除网页噪声，通过 Hash 对比对确定采集页面，并通过插件权限提升实现无登陆技术。有效的避免了 Hash 值的变化与网页内容变化产生偏离的现象，解决了网络爬虫虚拟登录时多次对 URL 采集造成的身份认证问题。实验表明，该方法可以实时快速的获取微博信息，为舆情数据分析提供批量精准的数据。%In view of the current micro - blog acquisition without accurate denoising method and unable abundantly the non - debarkation gathering phenomenon,we present a web crawler acquisition scheme of Regex Webpage denoising Hash based on comparison and realize no landing collection by using plug - in acquisition. The method of Regex to construct DFA and NFA model to remove Webpage noise,comparing the Hash to determine the collection page,and the plug - in privilege without landing techniques are presented. Experiments show that,this method quickly gets micro - blog information in real time,and provides,accurate data for the mass public opinion data analysis.

System using data compression and hashing adapted for use for multimedia encryption

Science.gov (United States)

Coffland, Douglas R [Livermore, CA

2011-07-12

A system and method is disclosed for multimedia encryption. Within the system of the present invention, a data compression module receives and compresses a media signal into a compressed data stream. A data acquisition module receives and selects a set of data from the compressed data stream. And, a hashing module receives and hashes the set of data into a keyword. The method of the present invention includes the steps of compressing a media signal into a compressed data stream; selecting a set of data from the compressed data stream; and hashing the set of data into a keyword.

Distributed hash table theory, platforms and applications

CERN Document Server

Zhang, Hao; Xie, Haiyong; Yu, Nenghai

2013-01-01

This SpringerBrief summarizes the development of Distributed Hash Table in both academic and industrial fields. It covers the main theory, platforms and applications of this key part in distributed systems and applications, especially in large-scale distributed environments. The authors teach the principles of several popular DHT platforms that can solve practical problems such as load balance, multiple replicas, consistency and latency. They also propose DHT-based applications including multicast, anycast, distributed file systems, search, storage, content delivery network, file sharing and c

Controlling chaos in permanent magnet synchronous motor based on finite-time stability theory

International Nuclear Information System (INIS)

Du-Qu, Wei; Bo, Zhang

2009-01-01

This paper reports that the performance of permanent magnet synchronous motor (PMSM) degrades due to chaos when its systemic parameters fall into a certain area. To control the undesirable chaos in PMSM, a nonlinear controller, which is simple and easy to be constructed, is presented to achieve finite-time chaos control based on the finite-time stability theory. Computer simulation results show that the proposed controller is very effective. The obtained results may help to maintain the industrial servo driven system's security operation. (general)

General definitions of chaos for continuous and discrete-time processes

OpenAIRE

Vieru, Andrei

2008-01-01

A precise definition of chaos for discrete processes based on iteration already exists. We shall first reformulate it in a more general frame, taking into account the fact that discrete chaotic behavior is neither necessarily based on iteration nor strictly related to compact metric spaces or to bounded functions. Then we shall apply the central idea of this definition to continuous processes. We shall try to see what chaos is, regardless of the way it is generated.

Chaos control of the brushless direct current motor using adaptive dynamic surface control based on neural network with the minimum weights

International Nuclear Information System (INIS)

Luo, Shaohua; Wu, Songli; Gao, Ruizhen

2015-01-01

This paper investigates chaos control for the brushless DC motor (BLDCM) system by adaptive dynamic surface approach based on neural network with the minimum weights. The BLDCM system contains parameter perturbation, chaotic behavior, and uncertainty. With the help of radial basis function (RBF) neural network to approximate the unknown nonlinear functions, the adaptive law is established to overcome uncertainty of the control gain. By introducing the RBF neural network and adaptive technology into the dynamic surface control design, a robust chaos control scheme is developed. It is proved that the proposed control approach can guarantee that all signals in the closed-loop system are globally uniformly bounded, and the tracking error converges to a small neighborhood of the origin. Simulation results are provided to show that the proposed approach works well in suppressing chaos and parameter perturbation

Chaos control of the brushless direct current motor using adaptive dynamic surface control based on neural network with the minimum weights.

Science.gov (United States)

Luo, Shaohua; Wu, Songli; Gao, Ruizhen

2015-07-01

This paper investigates chaos control for the brushless DC motor (BLDCM) system by adaptive dynamic surface approach based on neural network with the minimum weights. The BLDCM system contains parameter perturbation, chaotic behavior, and uncertainty. With the help of radial basis function (RBF) neural network to approximate the unknown nonlinear functions, the adaptive law is established to overcome uncertainty of the control gain. By introducing the RBF neural network and adaptive technology into the dynamic surface control design, a robust chaos control scheme is developed. It is proved that the proposed control approach can guarantee that all signals in the closed-loop system are globally uniformly bounded, and the tracking error converges to a small neighborhood of the origin. Simulation results are provided to show that the proposed approach works well in suppressing chaos and parameter perturbation.

Data Collision Prevention with Overflow Hashing Technique in Closed Hash Searching Process

Science.gov (United States)

Rahim, Robbi; Nurjamiyah; Rafika Dewi, Arie

2017-12-01

Hash search is a method that can be used for various search processes such as search engines, sorting, machine learning, neural network and so on, in the search process the possibility of collision data can happen and to prevent the occurrence of collision can be done in several ways one of them is to use Overflow technique, the use of this technique perform with varying length of data and this technique can prevent the occurrence of data collisions.

Family Chaos and Child Functioning in Relation to Sleep Problems Among Children at Risk for Obesity.

Science.gov (United States)

Boles, Richard E; Halbower, Ann C; Daniels, Stephen; Gunnarsdottir, Thrudur; Whitesell, Nancy; Johnson, Susan L

2017-01-01

This study evaluated the influence of child and family functioning on child sleep behaviors in low-income minority families who are at risk for obesity. A cross-sectional study was utilized to measure child and family functioning from 2013 to 2014. Participants were recruited from Head Start classrooms while data were collected during home visits. A convenience sample of 72 low-income Hispanic (65%) and African American (32%) families of preschool-aged children were recruited for this study. We assessed the association of child and family functioning with child sleep behaviors using a multivariate multiple linear regression model. Bootstrap mediation analyses examined the effects of family chaos between child functioning and child sleep problems. Poorer child emotional and behavioral functioning related to total sleep behavior problems. Chaos associated with bedtime resistance significantly mediated the relationship between Behavioral and Emotional Screening System (BESS) and Bedtime Resistance. Families at high risk for obesity showed children with poorer emotional and behavioral functioning were at higher risk for problematic sleep behaviors, although we found no link between obesity and child sleep. Family chaos appears to play a significant role in understanding part of these relationships. Future longitudinal studies are necessary to establish causal relationships between child and family functioning and sleep problems to further guide obesity interventions aimed at improving child sleep routines and increasing sleep duration.

Quantum signatures of chaos or quantum chaos?

International Nuclear Information System (INIS)

Bunakov, V. E.

2016-01-01

A critical analysis of the present-day concept of chaos in quantum systems as nothing but a “quantum signature” of chaos in classical mechanics is given. In contrast to the existing semi-intuitive guesses, a definition of classical and quantum chaos is proposed on the basis of the Liouville–Arnold theorem: a quantum chaotic system featuring N degrees of freedom should have M < N independent first integrals of motion (good quantum numbers) specified by the symmetry of the Hamiltonian of the system. Quantitative measures of quantum chaos that, in the classical limit, go over to the Lyapunov exponent and the classical stability parameter are proposed. The proposed criteria of quantum chaos are applied to solving standard problems of modern dynamical chaos theory.

Quantum signatures of chaos or quantum chaos?

Energy Technology Data Exchange (ETDEWEB)

Bunakov, V. E., E-mail: bunakov@VB13190.spb.edu [St. Petersburg State University (Russian Federation)

2016-11-15

A critical analysis of the present-day concept of chaos in quantum systems as nothing but a “quantum signature” of chaos in classical mechanics is given. In contrast to the existing semi-intuitive guesses, a definition of classical and quantum chaos is proposed on the basis of the Liouville–Arnold theorem: a quantum chaotic system featuring N degrees of freedom should have M < N independent first integrals of motion (good quantum numbers) specified by the symmetry of the Hamiltonian of the system. Quantitative measures of quantum chaos that, in the classical limit, go over to the Lyapunov exponent and the classical stability parameter are proposed. The proposed criteria of quantum chaos are applied to solving standard problems of modern dynamical chaos theory.

A novel image encryption scheme based on spatial chaos map

International Nuclear Information System (INIS)

Sun Fuyan; Liu Shutang; Li Zhongqin; Lue Zongwang

2008-01-01

In recent years, the chaos-based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques, but the drawbacks of small key space and weak security in one-dimensional chaotic cryptosystems are obvious. In this paper, spatial chaos system are used for high degree security image encryption while its speed is acceptable. The proposed algorithm is described in detail. The basic idea is to encrypt the image in space with spatial chaos map pixel by pixel, and then the pixels are confused in multiple directions of space. Using this method one cycle, the image becomes indistinguishable in space due to inherent properties of spatial chaotic systems. Several experimental results, key sensitivity tests, key space analysis, and statistical analysis show that the approach for image cryptosystems provides an efficient and secure way for real time image encryption and transmission from the cryptographic viewpoint

Survival and weak chaos.

Science.gov (United States)

Nee, Sean

2018-05-01

Survival analysis in biology and reliability theory in engineering concern the dynamical functioning of bio/electro/mechanical units. Here we incorporate effects of chaotic dynamics into the classical theory. Dynamical systems theory now distinguishes strong and weak chaos. Strong chaos generates Type II survivorship curves entirely as a result of the internal operation of the system, without any age-independent, external, random forces of mortality. Weak chaos exhibits (a) intermittency and (b) Type III survivorship, defined as a decreasing per capita mortality rate: engineering explicitly defines this pattern of decreasing hazard as 'infant mortality'. Weak chaos generates two phenomena from the normal functioning of the same system. First, infant mortality- sensu engineering-without any external explanatory factors, such as manufacturing defects, which is followed by increased average longevity of survivors. Second, sudden failure of units during their normal period of operation, before the onset of age-dependent mortality arising from senescence. The relevance of these phenomena encompasses, for example: no-fault-found failure of electronic devices; high rates of human early spontaneous miscarriage/abortion; runaway pacemakers; sudden cardiac death in young adults; bipolar disorder; and epilepsy.

Improved PSO algorithm based on chaos theory and its application to design flood hydrograph

Directory of Open Access Journals (Sweden)

Si-Fang Dong

2010-06-01

Full Text Available The deficiencies of basic particle swarm optimization (bPSO are its ubiquitous prematurity and its inability to seek the global optimal solution when optimizing complex high-dimensional functions. To overcome such deficiencies, the chaos-PSO (COSPSO algorithm was established by introducing the chaos optimization mechanism and a global particle stagnation-disturbance strategy into bPSO. In the improved algorithm, chaotic movement was adopted for the particles' initial movement trajectories to replace the former stochastic movement, and the chaos factor was used to guide the particles' path. When the global particles were stagnant, the disturbance strategy was used to keep the particles in motion. Five benchmark optimizations were introduced to test COSPSO, and they proved that COSPSO can remarkably improve efficiency in optimizing complex functions. Finally, a case study of COSPSO in calculating design flood hydrographs demonstrated the applicability of the improved algorithm.

DAQ application of PC oscilloscope for chaos fiber-optic fence system based on LabVIEW

Science.gov (United States)

Lu, Manman; Fang, Nian; Wang, Lutang; Huang, Zhaoming; Sun, Xiaofei

2011-12-01

In order to obtain simultaneously high sample rate and large buffer in data acquisition (DAQ) for a chaos fiber-optic fence system, we developed a double-channel high-speed DAQ application of a digital oscilloscope of PicoScope 5203 based on LabVIEW. We accomplished it by creating call library function (CLF) nodes to call the DAQ functions in the two dynamic link libraries (DLLs) of PS5000.dll and PS5000wrap.dll provided by Pico Technology Company. The maximum real-time sample rate of the DAQ application can reach 1GS/s. We can control the resolutions of the application at the sample time and data amplitudes by changing their units in the block diagram, and also control the start and end times of the sampling operations. The experimental results show that the application has enough high sample rate and large buffer to meet the demanding DAQ requirements of the chaos fiber-optic fence system.

LSHSIM: A Locality Sensitive Hashing based method for multiple-point geostatistics

Science.gov (United States)

Moura, Pedro; Laber, Eduardo; Lopes, Hélio; Mesejo, Daniel; Pavanelli, Lucas; Jardim, João; Thiesen, Francisco; Pujol, Gabriel

2017-10-01

Reservoir modeling is a very important task that permits the representation of a geological region of interest, so as to generate a considerable number of possible scenarios. Since its inception, many methodologies have been proposed and, in the last two decades, multiple-point geostatistics (MPS) has been the dominant one. This methodology is strongly based on the concept of training image (TI) and the use of its characteristics, which are called patterns. In this paper, we propose a new MPS method that combines the application of a technique called Locality Sensitive Hashing (LSH), which permits to accelerate the search for patterns similar to a target one, with a Run-Length Encoding (RLE) compression technique that speeds up the calculation of the Hamming similarity. Experiments with both categorical and continuous images show that LSHSIM is computationally efficient and produce good quality realizations. In particular, for categorical data, the results suggest that LSHSIM is faster than MS-CCSIM, one of the state-of-the-art methods.

Cryptanalysis of a chaos-based image encryption algorithm

International Nuclear Information System (INIS)

Cokal, Cahit; Solak, Ercan

2009-01-01

A chaos-based image encryption algorithm was proposed in [Z.-H. Guan, F. Huang, W. Guan, Phys. Lett. A 346 (2005) 153]. In this Letter, we analyze the security weaknesses of the proposal. By applying chosen-plaintext and known-plaintext attacks, we show that all the secret parameters can be revealed

An efficient entire chaos-based scheme for deniable authentication

International Nuclear Information System (INIS)

Xiao Di; Liao Xiaofeng; Wong, K.W.

2005-01-01

By using a chaotic encryption-hash parallel algorithm and the semi-group property of Chebyshev chaotic map, we propose a secure and efficient scheme for the deniable authentication. The scheme is efficient, practicable and reliable, with high potential to be adopted for e-commerce

An efficient entire chaos-based scheme for deniable authentication

Energy Technology Data Exchange (ETDEWEB)

Xiao Di [College of Computer Science and Engineering, Chongqing University, Chongqing, 400044 (China) and College of Mechanical Engineering, Chongqing University, Chongqing, 400044 (China)]. E-mail: xiaodi_cqu@hotmail.com; Liao Xiaofeng [College of Computer Science and Engineering, Chongqing University, Chongqing, 400044 (China); Wong, K.W. [Department of Computer Engineering and Information Technology, City University of Hong Kong, Hong Kong (China)

2005-02-01

By using a chaotic encryption-hash parallel algorithm and the semi-group property of Chebyshev chaotic map, we propose a secure and efficient scheme for the deniable authentication. The scheme is efficient, practicable and reliable, with high potential to be adopted for e-commerce.

A multiparameter chaos control method based on OGY approach

International Nuclear Information System (INIS)

Souza de Paula, Aline; Amorim Savi, Marcelo

2009-01-01

Chaos control is based on the richness of responses of chaotic behavior and may be understood as the use of tiny perturbations for the stabilization of a UPO embedded in a chaotic attractor. Since one of these UPO can provide better performance than others in a particular situation the use of chaos control can make this kind of behavior to be desirable in a variety of applications. The OGY method is a discrete technique that considers small perturbations promoted in the neighborhood of the desired orbit when the trajectory crosses a specific surface, such as a Poincare section. This contribution proposes a multiparameter semi-continuous method based on OGY approach in order to control chaotic behavior. Two different approaches are possible with this method: coupled approach, where all control parameters influences system dynamics although they are not active; and uncoupled approach that is a particular case where control parameters return to the reference value when they become passive parameters. As an application of the general formulation, it is investigated a two-parameter actuation of a nonlinear pendulum control employing coupled and uncoupled approaches. Analyses are carried out considering signals that are generated by numerical integration of the mathematical model using experimentally identified parameters. Results show that the procedure can be a good alternative for chaos control since it provides a more effective UPO stabilization than the classical single-parameter approach.

Chaos and its control in an impulsive differential system

International Nuclear Information System (INIS)

Jiang Guirong; Lu Qishao; Qian Linning

2007-01-01

In this paper, the existence of chaos and its control in an autonomous impulsive differential system are discussed both theoretically and numerically. The existence of a snap-back repeller, as well as the chaos in the sense of Li-Yorke, is proved based on the qualitative analysis using the Poincare map and the Lambert W-function. Moreover, the existence of the period-3 periodic window embedded in the chaotic region is also demonstrated. An algorithm of chaos control to stabilize the unstable periodic solutions is proposed. Detailed numerical results of chaotic attractors and stabilization of unstable periodic orbits by the impulsive effects, which are illustrated by an example, are in good agreement with the theoretical analysis

Nuclear structure and order-to-chaos transition

International Nuclear Information System (INIS)

Solov'ev, V.G.

1995-01-01

A general scheme of the nuclear many-body problem is presented. Different models for description of low-lying states and giant resonances are discussed. The wave functions of the low-lying states have a single dominating one-quasiparticle or quasiparticle O+ phonon or one-phonon component. They demonstrate the regularity in nuclei. Giant resonances are determined by strongly fragmented one-phonon components of the wave functions. The wave functions at higher excitation energies have two-, three-and many-phonon components. Based on the statement that there is order in the large and chaos in the small components of the nuclear wave functions, the order-to-chaos transition is treated as a transition from the large to the small components of the wave functions. A quasiparticle-phonon interaction is responsible for the fragmentation of one- and many-quasiparticle and phonon states and for the mixing of closely spaced states. Therefore, experimental investigation of the fragmentation of many-quasiparticle and phonon states plays a decisive role. 30 refs

Robinson's chaos in set-valued discrete systems

International Nuclear Information System (INIS)

Roman-Flores, Heriberto; Chalco-Cano, Y.

2005-01-01

Let (X,d) be a compact metric space and f:X->X a continuous function. If we consider the space (K(X),H) of all non-empty compact subsets of X endowed with the Hausdorff metric induced by d and f-bar :K(X)->K(X), f-bar (A)={f(a)/a-bar A}, then the aim of this work is to show that Robinson's chaos in f-bar implies Robinson's chaos in f. Also, we give an example showing that R-chaos in f does not implies R-chaos in f-bar

The chaos cookbook a practical programming guide

CERN Document Server

Pritchard, Joe

2014-01-01

The Chaos Cookbook: A Practical Programming Guide discusses the use of chaos in computer programming. The book is comprised of 11 chapters that tackle various topics relevant to chaos and programming. Chapter 1 reviews the concept of chaos, and Chapter 2 discusses the iterative functions. Chapters 3 and 4 cover differential and Lorenz equations. Chapter 5 talks about strange attractors, while Chapter 6 deals with the fractal link. The book also discusses the Mandelbrot set, and then covers the Julia sets. The other fractal systems and the cellular automata are also explained. The last chapter

Chaos in a dynamic model of urban transportation network flow based on user equilibrium states

International Nuclear Information System (INIS)

Xu Meng; Gao Ziyou

2009-01-01

In this study, we investigate the dynamical behavior of network traffic flow. We first build a two-stage mathematical model to analyze the complex behavior of network flow, a dynamical model, which is based on the dynamical gravity model proposed by Dendrinos and Sonis [Dendrinos DS, Sonis M. Chaos and social-spatial dynamic. Berlin: Springer-Verlag; 1990] is used to estimate the number of trips. Considering the fact that the Origin-Destination (O-D) trip cost in the traffic network is hard to express as a functional form, in the second stage, the user equilibrium network assignment model was used to estimate the trip cost, which is the minimum cost of used path when user equilibrium (UE) conditions are satisfied. It is important to use UE to estimate the O-D cost, since a connection is built among link flow, path flow, and O-D flow. The dynamical model describes the variations of O-D flows over discrete time periods, such as each day and each week. It is shown that even in a system with dimensions equal to two, chaos phenomenon still exists. A 'Chaos Propagation' phenomenon is found in the given model.

Experimental Induction of Genome Chaos.

Science.gov (United States)

Ye, Christine J; Liu, Guo; Heng, Henry H

2018-01-01

Genome chaos, or karyotype chaos, represents a powerful survival strategy for somatic cells under high levels of stress/selection. Since the genome context, not the gene content, encodes the genomic blueprint of the cell, stress-induced rapid and massive reorganization of genome topology functions as a very important mechanism for genome (karyotype) evolution. In recent years, the phenomenon of genome chaos has been confirmed by various sequencing efforts, and many different terms have been coined to describe different subtypes of the chaotic genome including "chromothripsis," "chromoplexy," and "structural mutations." To advance this exciting field, we need an effective experimental system to induce and characterize the karyotype reorganization process. In this chapter, an experimental protocol to induce chaotic genomes is described, following a brief discussion of the mechanism and implication of genome chaos in cancer evolution.

Application of Chaos Theory to Engine Systems

OpenAIRE

Matsumoto, Kazuhiro; Diebner, Hans H.; Tsuda, Ichiro; Hosoi, Yukiharu

2008-01-01

We focus on the control issue for engine systems from the perspective of chaos theory, which is based on the fact that engine systems have a low-dimensional chaotic dynamics. Two approaches are discussed: controlling chaos and harnessing chaos, respectively. We apply Pyragas' chaos control method to an actual engine system. The experimental results show that the chaotic motion of an engine system may be stabilized to a periodic motion. Alternatively, harnessing chaos for engine systems is add...

Chaos M-ary modulation and demodulation method based on Hamilton oscillator and its application in communication.

Science.gov (United States)

Fu, Yongqing; Li, Xingyuan; Li, Yanan; Yang, Wei; Song, Hailiang

2013-03-01

Chaotic communication has aroused general interests in recent years, but its communication effect is not ideal with the restriction of chaos synchronization. In this paper a new chaos M-ary digital modulation and demodulation method is proposed. By using region controllable characteristics of spatiotemporal chaos Hamilton map in phase plane and chaos unique characteristic, which is sensitive to initial value, zone mapping method is proposed. It establishes the map relationship between M-ary digital information and the region of Hamilton map phase plane, thus the M-ary information chaos modulation is realized. In addition, zone partition demodulation method is proposed based on the structure characteristic of Hamilton modulated information, which separates M-ary information from phase trajectory of chaotic Hamilton map, and the theory analysis of zone partition demodulator's boundary range is given. Finally, the communication system based on the two methods is constructed on the personal computer. The simulation shows that in high speed transmission communications and with no chaos synchronization circumstance, the proposed chaotic M-ary modulation and demodulation method has outperformed some conventional M-ary modulation methods, such as quadrature phase shift keying and M-ary pulse amplitude modulation in bit error rate. Besides, it has performance improvement in bandwidth efficiency, transmission efficiency and anti-noise performance, and the system complexity is low and chaos signal is easy to generate.

Quantum chaos induced by nonadiabatic coupling in wave-packet dynamics

International Nuclear Information System (INIS)

Higuchi, Hisashi; Takatsuka, Kazuo

2002-01-01

The effect of nonadiabatic coupling due to breakdown of the Born-Oppenheimer approximation on chaos is investigated. A couple of measures (indicators) that detect the extent of chaos in wave-packet dynamics on coupled potential functions are devised. Using them, we show that chaos is indeed induced by a nonadiabatic coupling in individual time-dependent wave-packet dynamics. This chaos is genuinely of quantum nature, since it arises from bifurcation and merging of a wave packet at the quasicrossing region of two coupled potential functions

Chaos applications in telecommunications

CERN Document Server

Stavroulakis, Peter

2005-01-01

IntroductionPeter StavroulakisChaotic Signal Generation and Transmission Antonio Cândido Faleiros,Waldecir João Perrella,TâniaNunes Rabello,Adalberto Sampaio Santos, andNeiYoshihiro SomaChaotic Transceiver Design Arthur Fleming-DahlChaos-Based Modulation and DemodulationTechniques Francis C.M. Lau and Chi K. TseA Chaos Approach to Asynchronous DS-CDMASystems S. Callegari, G. Mazzini, R. Rovatti, and G. SettiChannel Equalization in Chaotic CommunicationSystems Mahmut CiftciOptical Communications using ChaoticTechniques Gregory D. VanWiggerenAPPENDIX AFundamental Concepts of the Theory ofChaos a

Chaos synchronization of uncertain chaotic systems using composite nonlinear feedback based integral sliding mode control.

Science.gov (United States)

Mobayen, Saleh

2018-06-01

This paper proposes a combination of composite nonlinear feedback and integral sliding mode techniques for fast and accurate chaos synchronization of uncertain chaotic systems with Lipschitz nonlinear functions, time-varying delays and disturbances. The composite nonlinear feedback method allows accurate following of the master chaotic system and the integral sliding mode control provides invariance property which rejects the perturbations and preserves the stability of the closed-loop system. Based on the Lyapunov- Krasovskii stability theory and linear matrix inequalities, a novel sufficient condition is offered for the chaos synchronization of uncertain chaotic systems. This method not only guarantees the robustness against perturbations and time-delays, but also eliminates reaching phase and avoids chattering problem. Simulation results demonstrate that the suggested procedure leads to a great control performance. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Chaos Criminology: A critical analysis

Science.gov (United States)

McCarthy, Adrienne L.

There has been a push since the early 1980's for a paradigm shift in criminology from a Newtonian-based ontology to one of quantum physics. Primarily this effort has taken the form of integrating Chaos Theory into Criminology into what this thesis calls 'Chaos Criminology'. However, with the melding of any two fields, terms and concepts need to be translated properly, which has yet to be done. In addition to proving a translation between fields, this thesis also uses a set of criteria to evaluate the effectiveness of the current use of Chaos Theory in Criminology. While the results of the theory evaluation reveal that the current Chaos Criminology work is severely lacking and in need of development, there is some promise in the development of Marx's dialectical materialism with Chaos Theory.

Application of chaos-based chaotic invasive weed optimization techniques for environmental OPF problems in the power system

International Nuclear Information System (INIS)

Ghasemi, Mojtaba; Ghavidel, Sahand; Aghaei, Jamshid; Gitizadeh, Mohsen; Falah, Hasan

2014-01-01

Highlights: • Chaotic invasive weed optimization techniques based on chaos. • Nonlinear environmental OPF problem considering non-smooth fuel cost curves. • A comparative study of CIWO techniques for environmental OPF problem. - Abstract: This paper presents efficient chaotic invasive weed optimization (CIWO) techniques based on chaos for solving optimal power flow (OPF) problems with non-smooth generator fuel cost functions (non-smooth OPF) with the minimum pollution level (environmental OPF) in electric power systems. OPF problem is used for developing corrective strategies and to perform least cost dispatches. However, cost based OPF problem solutions usually result in unattractive system gaze emission issue (environmental OPF). In the present paper, the OPF problem is formulated by considering the emission issue. The total emission can be expressed as a non-linear function of power generation, as a multi-objective optimization problem, where optimal control settings for simultaneous minimization of fuel cost and gaze emission issue are obtained. The IEEE 30-bus test power system is presented to illustrate the application of the environmental OPF problem using CIWO techniques. Our experimental results suggest that CIWO techniques hold immense promise to appear as efficient and powerful algorithm for optimization in the power systems

A novel image encryption algorithm based on chaos maps with Markov properties

Science.gov (United States)

Liu, Quan; Li, Pei-yue; Zhang, Ming-chao; Sui, Yong-xin; Yang, Huai-jiang

2015-02-01

In order to construct high complexity, secure and low cost image encryption algorithm, a class of chaos with Markov properties was researched and such algorithm was also proposed. The kind of chaos has higher complexity than the Logistic map and Tent map, which keeps the uniformity and low autocorrelation. An improved couple map lattice based on the chaos with Markov properties is also employed to cover the phase space of the chaos and enlarge the key space, which has better performance than the original one. A novel image encryption algorithm is constructed on the new couple map lattice, which is used as a key stream generator. A true random number is used to disturb the key which can dynamically change the permutation matrix and the key stream. From the experiments, it is known that the key stream can pass SP800-22 test. The novel image encryption can resist CPA and CCA attack and differential attack. The algorithm is sensitive to the initial key and can change the distribution the pixel values of the image. The correlation of the adjacent pixels can also be eliminated. When compared with the algorithm based on Logistic map, it has higher complexity and better uniformity, which is nearer to the true random number. It is also efficient to realize which showed its value in common use.

A fast chaos-based image encryption scheme with a dynamic state variables selection mechanism

Science.gov (United States)

Chen, Jun-xin; Zhu, Zhi-liang; Fu, Chong; Yu, Hai; Zhang, Li-bo

2015-03-01

In recent years, a variety of chaos-based image cryptosystems have been investigated to meet the increasing demand for real-time secure image transmission. Most of them are based on permutation-diffusion architecture, in which permutation and diffusion are two independent procedures with fixed control parameters. This property results in two flaws. (1) At least two chaotic state variables are required for encrypting one plain pixel, in permutation and diffusion stages respectively. Chaotic state variables produced with high computation complexity are not sufficiently used. (2) The key stream solely depends on the secret key, and hence the cryptosystem is vulnerable against known/chosen-plaintext attacks. In this paper, a fast chaos-based image encryption scheme with a dynamic state variables selection mechanism is proposed to enhance the security and promote the efficiency of chaos-based image cryptosystems. Experimental simulations and extensive cryptanalysis have been carried out and the results prove the superior security and high efficiency of the scheme.

Improved particle swarm optimization combined with chaos

International Nuclear Information System (INIS)

Liu Bo; Wang Ling; Jin Yihui; Tang Fang; Huang Dexian

2005-01-01

As a novel optimization technique, chaos has gained much attention and some applications during the past decade. For a given energy or cost function, by following chaotic ergodic orbits, a chaotic dynamic system may eventually reach the global optimum or its good approximation with high probability. To enhance the performance of particle swarm optimization (PSO), which is an evolutionary computation technique through individual improvement plus population cooperation and competition, hybrid particle swarm optimization algorithm is proposed by incorporating chaos. Firstly, adaptive inertia weight factor (AIWF) is introduced in PSO to efficiently balance the exploration and exploitation abilities. Secondly, PSO with AIWF and chaos are hybridized to form a chaotic PSO (CPSO), which reasonably combines the population-based evolutionary searching ability of PSO and chaotic searching behavior. Simulation results and comparisons with the standard PSO and several meta-heuristics show that the CPSO can effectively enhance the searching efficiency and greatly improve the searching quality

Early Exposure to Environmental Chaos and Children's Physical and Mental Health.

Science.gov (United States)

Coley, Rebekah Levine; Lynch, Alicia Doyle; Kull, Melissa

Environmental chaos has been proposed as a central influence impeding children's health and development, with the potential for particularly pernicious effects during the earliest years when children are most susceptible to environmental insults. This study evaluated a high-risk sample, following 495 low-income children living in poor urban neighborhoods from infancy to age 6. Longitudinal multilevel models tested the main tenets of the ecobiodevelopmental theory, finding that: (1) numerous distinct domains of environmental chaos were associated with children's physical and mental health outcomes, including housing disorder, neighborhood disorder, and relationship instability, with no significant results for residential instability; (2) different patterns emerged in relation to the timing of exposure to chaos, with more proximal exposure most strongly associated with children's functioning; and (3) the intensity of chaos also was a robust predictor of child functioning. Contrary to expectations, neither biological vulnerability (proxied through low birth weight status), maternal sensitivity, nor maternal distress moderated the role of chaos. Rather, maternal psychological distress functioned as a pathway through which environmental chaos was associated with children's functioning.

Chaos and routes to chaos in coupled Duffing oscillators with multiple degrees of freedom

International Nuclear Information System (INIS)

Musielak, D.E.; Musielak, Z.E.; Benner, J.W.

2005-01-01

New results are reported on the routes to chaos in increasingly complex Duffing oscillator systems, which are formed by coupling several oscillators, thereby increasing the number of degrees of freedom. Other forms of increasing system complexity through distributed excitation, different forcing function phasing, different excitation frequency ratios, and higher order coupling are also studied. Changes in the quantitative aspects of the chaotic regions and in the routes to chaos of complex Duffing systems are investigated by performing numerical simulations. It is shown that the number of chaotic regions in these systems is significantly reduced when compared to the original Duffing system, and that crisis replaces period doubling as the dominant route to chaos when the number of degrees of freedom is increased. A new discovered phenomenon is that chaos emerges in the symmetrically and asymmetrically coupled Duffing oscillators only after the quasi-periodic torus breaks down through a 3-periodic and 2-periodic window, respectively

Order in nuclei and transition to chaos

International Nuclear Information System (INIS)

Soloviev, V.G.

1995-01-01

Based on the statement that there is order in the large and chaos in the small components of nuclear wave functions, the order-to-chaos transition is treated as a transition from the large to small components of wave functions. Therefore, experimental investigation of fragmentation of the many-quasiparticle and quasiparticle-phonon states plays a decisive role. The mixing of closely-spaced states having the same K π in the doubly even well-deformed nuclei is investigated. The quasiparticle-phonon interaction is responsible for fragmentation of the quasiparticle and phonon states and therefore for their mixing. Experimental investigation of the strength distribution of the many-quasiparticle and quasiparticle-phonon states should discover a new region of regularity in nuclei at intermediate excitation energies. A chaotic behaviour of nuclear states can be shifted to higher excitation energies. (author). 21 refs., 1 fig., 1 tab

Order in nuclei and transition to chaos

International Nuclear Information System (INIS)

Soloviev, V.G.

1995-01-01

Based on the statement that there is order in the large and chaos in the small components of nuclear wave functions, the order-to-chaos transition is treated as a transition from the large to small components of wave functions. Therefore, experimental investigation of fragmentation of the many-quasiparticle and quasiparticle-phonon states a decisive role. The mixing of closely-spaced states having the same K π in the doubly even well-deformed nuclei is investigated. The quasiparticle-phonon interaction is responsible for fragmentation of the quasiparticle and phonon states and therefore for their mixing. Experimental investigation of the strength distribution of the many-quasiparticle and quasiparticle-phonon states should discover a new region of regularity in nuclei at intermediate excitation energies. A chaotic behaviour of nuclear states can be shifted to higher excitation energies. (author). 21 refs., 1 fig., 1 tab

Fractals and chaos

CERN Document Server

Earnshow, R; Jones, H

1991-01-01

This volume is based upon the presentations made at an international conference in London on the subject of 'Fractals and Chaos'. The objective of the conference was to bring together some of the leading practitioners and exponents in the overlapping fields of fractal geometry and chaos theory, with a view to exploring some of the relationships between the two domains. Based on this initial conference and subsequent exchanges between the editors and the authors, revised and updated papers were produced. These papers are contained in the present volume. We thank all those who contributed to this effort by way of planning and organisation, and also all those who helped in the production of this volume. In particular, we wish to express our appreciation to Gerhard Rossbach, Computer Science Editor, Craig Van Dyck, Production Director, and Nancy A. Rogers, who did the typesetting. A. J. Crilly R. A. Earnshaw H. Jones 1 March 1990 Introduction Fractals and Chaos The word 'fractal' was coined by Benoit Mandelbrot i...

Chaos Control and Synchronization of Cellular Neural Network with Delays Based on OPNCL Control

International Nuclear Information System (INIS)

Qian, Tang; Xing-Yuan, Wang

2010-01-01

The problem of chaos control and complete synchronization of cellular neural network with delays is studied. Based on the open plus nonlinear closed loop (OPNCL) method, the control scheme and synchronization scheme are designed. Both the schemes can achieve the chaos control and complete synchronization of chaotic neural network respectively, and their validity is further verified by numerical simulation experiments. (general)

Sparse grid-based polynomial chaos expansion for aerodynamics of an airfoil with uncertainties

Directory of Open Access Journals (Sweden)

Xiaojing WU

2018-05-01

Full Text Available The uncertainties can generate fluctuations with aerodynamic characteristics. Uncertainty Quantification (UQ is applied to compute its impact on the aerodynamic characteristics. In addition, the contribution of each uncertainty to aerodynamic characteristics should be computed by uncertainty sensitivity analysis. Non-Intrusive Polynomial Chaos (NIPC has been successfully applied to uncertainty quantification and uncertainty sensitivity analysis. However, the non-intrusive polynomial chaos method becomes inefficient as the number of random variables adopted to describe uncertainties increases. This deficiency becomes significant in stochastic aerodynamic analysis considering the geometric uncertainty because the description of geometric uncertainty generally needs many parameters. To solve the deficiency, a Sparse Grid-based Polynomial Chaos (SGPC expansion is used to do uncertainty quantification and sensitivity analysis for stochastic aerodynamic analysis considering geometric and operational uncertainties. It is proved that the method is more efficient than non-intrusive polynomial chaos and Monte Carlo Simulation (MSC method for the stochastic aerodynamic analysis. By uncertainty quantification, it can be learnt that the flow characteristics of shock wave and boundary layer separation are sensitive to the geometric uncertainty in transonic region. The uncertainty sensitivity analysis reveals the individual and coupled effects among the uncertainty parameters. Keywords: Non-intrusive polynomial chaos, Sparse grid, Stochastic aerodynamic analysis, Uncertainty sensitivity analysis, Uncertainty quantification

Chaos and the Double Function of Communication

Science.gov (United States)

Aula, P. S.

Since at least the needle model age, communication researchers have systematically sought means to explain, control and predict communication behavior between people. For many reasons, the accuracy of constructed models and the studies based upon them has not risen very high. It can be claimed that the reasons for the inaccuracy of communication models, and thus the poor predictability of everyday action, originate from the processes' innate chaos, apparent beneath their behavior. This leads to the argument that communication systems, which appear stable and have precisely identical starting points and identical operating environments, can nevertheless behave in an exceptional and completely different manner, despite the fact that their behavior is ruled or directed by the same rules or laws.

Review of Polynomial Chaos-Based Methods for Uncertainty Quantification in Modern Integrated Circuits

Directory of Open Access Journals (Sweden)

Arun Kaintura

2018-02-01

Full Text Available Advances in manufacturing process technology are key ensembles for the production of integrated circuits in the sub-micrometer region. It is of paramount importance to assess the effects of tolerances in the manufacturing process on the performance of modern integrated circuits. The polynomial chaos expansion has emerged as a suitable alternative to standard Monte Carlo-based methods that are accurate, but computationally cumbersome. This paper provides an overview of the most recent developments and challenges in the application of polynomial chaos-based techniques for uncertainty quantification in integrated circuits, with particular focus on high-dimensional problems.

The Capabilities of Chaos and Complexity

Directory of Open Access Journals (Sweden)

David L. Abel

2009-01-01

Full Text Available To what degree could chaos and complexity have organized a Peptide or RNA World of crude yet necessarily integrated protometabolism? How far could such protolife evolve in the absence of a heritable linear digital symbol system that could mutate, instruct, regulate, optimize and maintain metabolic homeostasis? To address these questions, chaos, complexity, self-ordered states, and organization must all be carefully defined and distinguished. In addition their cause-and-effect relationships and mechanisms of action must be delineated. Are there any formal (non physical, abstract, conceptual, algorithmic components to chaos, complexity, self-ordering and organization, or are they entirely physicodynamic (physical, mass/energy interaction alone? Chaos and complexity can produce some fascinating self-ordered phenomena. But can spontaneous chaos and complexity steer events and processes toward pragmatic benefit, select function over non function, optimize algorithms, integrate circuits, produce computational halting, organize processes into formal systems, control and regulate existing systems toward greater efficiency? The question is pursued of whether there might be some yet-to-be discovered new law of biology that will elucidate the derivation of prescriptive information and control. “System” will be rigorously defined. Can a low-informational rapid succession of Prigogine’s dissipative structures self-order into bona fide organization?

Polynomiography and Chaos

Science.gov (United States)

Kalantari, Bahman

Polynomiography is the algorithmic visualization of iterative systems for computing roots of a complex polynomial. It is well known that iterations of a rational function in the complex plane result in chaotic behavior near its Julia set. In one scheme of computing polynomiography for a given polynomial p(z), we select an individual member from the Basic Family, an infinite fundamental family of rational iteration functions that in particular include Newton's. Polynomiography is an excellent means for observing, understanding, and comparing chaotic behavior for variety of iterative systems. Other iterative schemes in polynomiography are possible and result in chaotic behavior of different kinds. In another scheme, the Basic Family is collectively applied to p(z) and the iterates for any seed in the Voronoi cell of a root converge to that root. Polynomiography reveals chaotic behavior of another kind near the boundary of the Voronoi diagram of the roots. We also describe a novel Newton-Ellipsoid iterative system with its own chaos and exhibit images demonstrating polynomiographies of chaotic behavior of different kinds. Finally, we consider chaos for the more general case of polynomiography of complex analytic functions. On the one hand polynomiography is a powerful medium capable of demonstrating chaos in different forms, it is educationally instructive to students and researchers, also it gives rise to numerous research problems. On the other hand, it is a medium resulting in images with enormous aesthetic appeal to general audiences.

Brownian motion properties of optoelectronic random bit generators based on laser chaos.

Science.gov (United States)

Li, Pu; Yi, Xiaogang; Liu, Xianglian; Wang, Yuncai; Wang, Yongge

2016-07-11

The nondeterministic property of the optoelectronic random bit generator (RBG) based on laser chaos are experimentally analyzed from two aspects of the central limit theorem and law of iterated logarithm. The random bits are extracted from an optical feedback chaotic laser diode using a multi-bit extraction technique in the electrical domain. Our experimental results demonstrate that the generated random bits have no statistical distance from the Brownian motion, besides that they can pass the state-of-the-art industry-benchmark statistical test suite (NIST SP800-22). All of them give a mathematically provable evidence that the ultrafast random bit generator based on laser chaos can be used as a nondeterministic random bit source.

Chaos and complexity by design

Energy Technology Data Exchange (ETDEWEB)

Roberts, Daniel A. [Center for Theoretical Physics and Department of Physics,Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 (United States); School of Natural Sciences, Institute for Advanced Study,Princeton, NJ 08540 (United States); Yoshida, Beni [Perimeter Institute for Theoretical Physics,Waterloo, Ontario N2L 2Y5 (Canada)

2017-04-20

We study the relationship between quantum chaos and pseudorandomness by developing probes of unitary design. A natural probe of randomness is the “frame potential,” which is minimized by unitary k-designs and measures the 2-norm distance between the Haar random unitary ensemble and another ensemble. A natural probe of quantum chaos is out-of-time-order (OTO) four-point correlation functions. We show that the norm squared of a generalization of out-of-time-order 2k-point correlators is proportional to the kth frame potential, providing a quantitative connection between chaos and pseudorandomness. Additionally, we prove that these 2k-point correlators for Pauli operators completely determine the k-fold channel of an ensemble of unitary operators. Finally, we use a counting argument to obtain a lower bound on the quantum circuit complexity in terms of the frame potential. This provides a direct link between chaos, complexity, and randomness.

Chaos and complexity by design

International Nuclear Information System (INIS)

Roberts, Daniel A.; Yoshida, Beni

2017-01-01

We study the relationship between quantum chaos and pseudorandomness by developing probes of unitary design. A natural probe of randomness is the “frame potential,” which is minimized by unitary k-designs and measures the 2-norm distance between the Haar random unitary ensemble and another ensemble. A natural probe of quantum chaos is out-of-time-order (OTO) four-point correlation functions. We show that the norm squared of a generalization of out-of-time-order 2k-point correlators is proportional to the kth frame potential, providing a quantitative connection between chaos and pseudorandomness. Additionally, we prove that these 2k-point correlators for Pauli operators completely determine the k-fold channel of an ensemble of unitary operators. Finally, we use a counting argument to obtain a lower bound on the quantum circuit complexity in terms of the frame potential. This provides a direct link between chaos, complexity, and randomness.

MiMC: Efficient encryption and cryptographic hashing with minimal multiplicative complexity

DEFF Research Database (Denmark)

Albrecht, Martin; Grassi, Lorenzo; Rechberger, Christian

2016-01-01

and cryptographic hash functions is to reconsider and simplify the round function of the Knudsen-Nyberg cipher from 1995. The mapping F(x) := x3 is used as the main component there and is also the main component of our family of proposals called “MiMC”. We study various attack vectors for this construction and give...... a new attack vector that outperforms others in relevant settings. Due to its very low number of multiplications, the design lends itself well to a large class of applications, especially when the depth does not matter but the total number of multiplications in the circuit dominates all aspects...

Chaos based video encryption using maps and Ikeda time delay system

Science.gov (United States)

Valli, D.; Ganesan, K.

2017-12-01

Chaos based cryptosystems are an efficient method to deal with improved speed and highly secured multimedia encryption because of its elegant features, such as randomness, mixing, ergodicity, sensitivity to initial conditions and control parameters. In this paper, two chaos based cryptosystems are proposed: one is the higher-dimensional 12D chaotic map and the other is based on the Ikeda delay differential equation (DDE) suitable for designing a real-time secure symmetric video encryption scheme. These encryption schemes employ a substitution box (S-box) to diffuse the relationship between pixels of plain video and cipher video along with the diffusion of current input pixel with the previous cipher pixel, called cipher block chaining (CBC). The proposed method enhances the robustness against statistical, differential and chosen/known plain text attacks. Detailed analysis is carried out in this paper to demonstrate the security and uniqueness of the proposed scheme.

An algorithm for the detection of move repetition without the use of hash-keys

Directory of Open Access Journals (Sweden)

Vučković Vladan

2007-01-01

Full Text Available This paper addresses the theoretical and practical aspects of an important problem in computer chess programming - the problem of draw detection in cases of position repetition. The standard approach used in the majority of computer chess programs is hash-oriented. This method is sufficient in most cases, as the Zobrist keys are already present due to the systemic positional hashing, so that they need not be computed anew for the purpose of draw detection. The new type of the algorithm that we have developed solves the problem of draw detection in cases when Zobrist keys are not used in the program, i.e. in cases when the memory is not hashed.

Chaos-based communications using semiconductor lasers subject to feedback from an integrated double cavity

International Nuclear Information System (INIS)

Tronciu, V Z; Mirasso, Claudio R; Colet, Pere

2008-01-01

We report the results of numerical investigations of the dynamical behaviour of an integrated device composed of a semiconductor laser and a double cavity that provides optical feedback. Due to the influence of the feedback, under the appropriate conditions, the system displays chaotic behaviour appropriate for chaos-based communications. The optimal conditions for chaos generation are identified. It is found that the double cavity feedback requires lower feedback strengths for developing high complexity chaos when compared with a single cavity. The synchronization of two unidirectional coupled (master-slave) systems and the influence of parameters mismatch on the synchronization quality are also studied. Finally, examples of message encoding and decoding are presented and discussed

Computing derivative-based global sensitivity measures using polynomial chaos expansions

International Nuclear Information System (INIS)

Sudret, B.; Mai, C.V.

2015-01-01

In the field of computer experiments sensitivity analysis aims at quantifying the relative importance of each input parameter (or combinations thereof) of a computational model with respect to the model output uncertainty. Variance decomposition methods leading to the well-known Sobol' indices are recognized as accurate techniques, at a rather high computational cost though. The use of polynomial chaos expansions (PCE) to compute Sobol' indices has allowed to alleviate the computational burden though. However, when dealing with large dimensional input vectors, it is good practice to first use screening methods in order to discard unimportant variables. The derivative-based global sensitivity measures (DGSMs) have been developed recently in this respect. In this paper we show how polynomial chaos expansions may be used to compute analytically DGSMs as a mere post-processing. This requires the analytical derivation of derivatives of the orthonormal polynomials which enter PC expansions. Closed-form expressions for Hermite, Legendre and Laguerre polynomial expansions are given. The efficiency of the approach is illustrated on two well-known benchmark problems in sensitivity analysis. - Highlights: • Derivative-based global sensitivity measures (DGSM) have been developed for screening purpose. • Polynomial chaos expansions (PC) are used as a surrogate model of the original computational model. • From a PC expansion the DGSM can be computed analytically. • The paper provides the derivatives of Hermite, Legendre and Laguerre polynomials for this purpose

Corporate Investment Dynamic Control System Based on Chaos Cycle Perturbations

Directory of Open Access Journals (Sweden)

Yanyan Gao

2014-11-01

Full Text Available It exists some issues such as the low predict accuracy and a bad convergence performance to predict business investment with BP neural network algorithm. This paper presents a predictive model of business investment based on improved artificial bee colony and chaos periodic disturbance optimizing BP neural network algorithm. At first, use Boltzmann selection strategy and group behaviour control strategy to optimize the artificial bee colony algorithm, and then use the improved algorithm to transform BP neural network algorithm’s optimized parameters into optimization process of artificial bee colony algorithm to reduce the training error of the original algorithm. Finally, use chaotic optimized Logistic mapping enables BP neural network out of the local minimum point in the training process based on secondary chaotic cycle perturbation strategies. Simulation results show that the proposed predictive model of investment in the enterprise based on improved artificial bee colony and chaos periodic disturbance optimizing BP neural network algorithm shows higher predict accuracy and better convergence than normal BP neural network algorithm.

Early Exposure to Environmental Chaos and Children’s Physical and Mental Health

Science.gov (United States)

Coley, Rebekah Levine; Lynch, Alicia Doyle; Kull, Melissa

2015-01-01

Environmental chaos has been proposed as a central influence impeding children’s health and development, with the potential for particularly pernicious effects during the earliest years when children are most susceptible to environmental insults. This study evaluated a high-risk sample, following 495 low-income children living in poor urban neighborhoods from infancy to age 6. Longitudinal multilevel models tested the main tenets of the ecobiodevelopmental theory, finding that: (1) numerous distinct domains of environmental chaos were associated with children’s physical and mental health outcomes, including housing disorder, neighborhood disorder, and relationship instability, with no significant results for residential instability; (2) different patterns emerged in relation to the timing of exposure to chaos, with more proximal exposure most strongly associated with children’s functioning; and (3) the intensity of chaos also was a robust predictor of child functioning. Contrary to expectations, neither biological vulnerability (proxied through low birth weight status), maternal sensitivity, nor maternal distress moderated the role of chaos. Rather, maternal psychological distress functioned as a pathway through which environmental chaos was associated with children’s functioning. PMID:25844016

Fault detection and isolation in GPS receiver autonomous integrity monitoring based on chaos particle swarm optimization-particle filter algorithm

Science.gov (United States)

Wang, Ershen; Jia, Chaoying; Tong, Gang; Qu, Pingping; Lan, Xiaoyu; Pang, Tao

2018-03-01

The receiver autonomous integrity monitoring (RAIM) is one of the most important parts in an avionic navigation system. Two problems need to be addressed to improve this system, namely, the degeneracy phenomenon and lack of samples for the standard particle filter (PF). However, the number of samples cannot adequately express the real distribution of the probability density function (i.e., sample impoverishment). This study presents a GPS receiver autonomous integrity monitoring (RAIM) method based on a chaos particle swarm optimization particle filter (CPSO-PF) algorithm with a log likelihood ratio. The chaos sequence generates a set of chaotic variables, which are mapped to the interval of optimization variables to improve particle quality. This chaos perturbation overcomes the potential for the search to become trapped in a local optimum in the particle swarm optimization (PSO) algorithm. Test statistics are configured based on a likelihood ratio, and satellite fault detection is then conducted by checking the consistency between the state estimate of the main PF and those of the auxiliary PFs. Based on GPS data, the experimental results demonstrate that the proposed algorithm can effectively detect and isolate satellite faults under conditions of non-Gaussian measurement noise. Moreover, the performance of the proposed novel method is better than that of RAIM based on the PF or PSO-PF algorithm.

Nuclear physics, symmetries, and quantum chaos

International Nuclear Information System (INIS)

Bunakov, V.E.

1999-01-01

The reasons why the problem of chaos is of great topical interest in modern physics are briefly summarized, and it is indicated that ambiguities in the concept of quantum chaos present the greatest difficulties in these realms. The theory of random matrices and strength functions are generalized to demonstrate that chaotization of a system is associated with the violation of its symmetries. A criterion of quantum chaoticity is formulated in terms of the spreading width Γ spr . In the classical limit, this criterion reduces to Lyapunov's stability criteria. It is shown that the proposed criterion is applicable to standard problems of the modern theory of dynamical chaos

Chaos at High School

Directory of Open Access Journals (Sweden)

Tamás Meszéna

2017-04-01

Full Text Available We are faced with chaotic processes in many segments of our life: meteorology, environmental pollution, financial and economic processes, sociology, mechanics, electronics, biology, chemistry. The spreading of high-performance computers and the development of simulation methods made the examination of these processes easily available. Regular, periodic motions (pendulum, harmonic oscillatory motion, bouncing ball, as taught at secondary level, become chaotic even due minor changes. If it is true that the most considerable achievements of twentieth century physics were the theory of relativity, quantum mechanics and chaos theory, then it is presumably time to think about, examine and test how and to what extent chaos can be presented to the students. Here I would like to introduce a 12 lesson long facultative curriculum framework on chaos designed for students aged seventeen. The investigation of chaos phenomenon in this work is based on a freeware, “Dynamics Solver”. This software, with some assistance from the teacher, is suitable for classroom use at secondary level.

Cryptanalysis of a chaos-based cryptosystem with an embedded adaptive arithmetic coder

International Nuclear Information System (INIS)

Wang Xing-Yuan; Xie Yi-Xin

2011-01-01

In this paper, we analyse a new chaos-based cryptosystem with an embedded adaptive arithmetic coder, which was proposed by Li Heng-Jian and Zhang J S (Li H J and Zhang J S 2010 Chin. Phys. B 19 050508). Although this new method has a better compression performance than its original version, it is found that there are some problems with its security and decryption processes. In this paper, it is shown how to obtain a great deal of plain text from the cipher text without prior knowledge of the secret key. After discussing the security and decryption problems of the Li Heng-Jian et al. algorithm, we propose an improved chaos-based cryptosystem with an embedded adaptive arithmetic coder that is more secure. (general)

Cryptography with chaos and shadowing

International Nuclear Information System (INIS)

Smaoui, Nejib; Kanso, Ali

2009-01-01

In this paper, we present a novel approach to encrypt a message (a text composed by some alphabets) using chaos and shadowing. First, we generate a numerical chaotic orbit based on the logistic map, and use the shadowing algorithm of Smaoui and Kostelich [Smaoui N, Kostelich E. Using chaos to shadow the quadratic map for all time. Int J Comput Math 1998;70:117-29] to show that there exists a finite number of true orbits that shadow the numerical orbit. Then, the finite number of maps generated is used in Baptista's algorithm [Baptista MS. Cryptography with chaos. Phys Lett A 1998;240:50-4] to encrypt each character of the message. It is shown that the use of chaos and shadowing in the encryption process enhances the security level.

Cryptography with chaos and shadowing

Energy Technology Data Exchange (ETDEWEB)

Smaoui, Nejib [Department of Mathematics and Computer Science, Kuwait University, P.O. Box 5969, Safat 13060 (Kuwait)], E-mail: nsmaoui64@yahoo.com; Kanso, Ali [Department of Mathematics and Computer Science, Kuwait University, P.O. Box 5969, Safat 13060 (Kuwait)], E-mail: akanso@hotmail.com

2009-11-30

In this paper, we present a novel approach to encrypt a message (a text composed by some alphabets) using chaos and shadowing. First, we generate a numerical chaotic orbit based on the logistic map, and use the shadowing algorithm of Smaoui and Kostelich [Smaoui N, Kostelich E. Using chaos to shadow the quadratic map for all time. Int J Comput Math 1998;70:117-29] to show that there exists a finite number of true orbits that shadow the numerical orbit. Then, the finite number of maps generated is used in Baptista's algorithm [Baptista MS. Cryptography with chaos. Phys Lett A 1998;240:50-4] to encrypt each character of the message. It is shown that the use of chaos and shadowing in the encryption process enhances the security level.

Visual hashing of digital video : applications and techniques

NARCIS (Netherlands)

Oostveen, J.; Kalker, A.A.C.M.; Haitsma, J.A.; Tescher, A.G.

2001-01-01

his paper present the concept of robust video hashing as a tool for video identification. We present considerations and a technique for (i) extracting essential perceptual features from a moving image sequences and (ii) for identifying any sufficiently long unknown video segment by efficiently

Adoption of the Hash algorithm in a conceptual model for the civil registry of Ecuador

Science.gov (United States)

Toapanta, Moisés; Mafla, Enrique; Orizaga, Antonio

2018-04-01

The Hash security algorithm was analyzed in order to mitigate information security in a distributed architecture. The objective of this research is to develop a prototype for the Adoption of the algorithm Hash in a conceptual model for the Civil Registry of Ecuador. The deductive method was used in order to analyze the published articles that have a direct relation with the research project "Algorithms and Security Protocols for the Civil Registry of Ecuador" and articles related to the Hash security algorithm. It resulted from this research: That the SHA-1 security algorithm is appropriate for use in Ecuador's civil registry; we adopted the SHA-1 algorithm used in the flowchart technique and finally we obtained the adoption of the hash algorithm in a conceptual model. It is concluded that from the comparison of the DM5 and SHA-1 algorithm, it is suggested that in the case of an implementation, the SHA-1 algorithm is taken due to the amount of information and data available from the Civil Registry of Ecuador; It is determined that the SHA-1 algorithm that was defined using the flowchart technique can be modified according to the requirements of each institution; the model for adopting the hash algorithm in a conceptual model is a prototype that can be modified according to all the actors that make up each organization.

Markov transitions and the propagation of chaos

International Nuclear Information System (INIS)

Gottlieb, A.

1998-01-01

The propagation of chaos is a central concept of kinetic theory that serves to relate the equations of Boltzmann and Vlasov to the dynamics of many-particle systems. Propagation of chaos means that molecular chaos, i.e., the stochastic independence of two random particles in a many-particle system, persists in time, as the number of particles tends to infinity. We establish a necessary and sufficient condition for a family of general n-particle Markov processes to propagate chaos. This condition is expressed in terms of the Markov transition functions associated to the n-particle processes, and it amounts to saying that chaos of random initial states propagates if it propagates for pure initial states. Our proof of this result relies on the weak convergence approach to the study of chaos due to Sztitman and Tanaka. We assume that the space in which the particles live is homomorphic to a complete and separable metric space so that we may invoke Prohorov's theorem in our proof. We also show that, if the particles can be in only finitely many states, then molecular chaos implies that the specific entropies in the n-particle distributions converge to the entropy of the limiting single-particle distribution

Handwriting: Feature Correlation Analysis for Biometric Hashes

Science.gov (United States)

Vielhauer, Claus; Steinmetz, Ralf

2004-12-01

In the application domain of electronic commerce, biometric authentication can provide one possible solution for the key management problem. Besides server-based approaches, methods of deriving digital keys directly from biometric measures appear to be advantageous. In this paper, we analyze one of our recently published specific algorithms of this category based on behavioral biometrics of handwriting, the biometric hash. Our interest is to investigate to which degree each of the underlying feature parameters contributes to the overall intrapersonal stability and interpersonal value space. We will briefly discuss related work in feature evaluation and introduce a new methodology based on three components: the intrapersonal scatter (deviation), the interpersonal entropy, and the correlation between both measures. Evaluation of the technique is presented based on two data sets of different size. The method presented will allow determination of effects of parameterization of the biometric system, estimation of value space boundaries, and comparison with other feature selection approaches.

Handwriting: Feature Correlation Analysis for Biometric Hashes

Directory of Open Access Journals (Sweden)

Ralf Steinmetz

2004-04-01

Full Text Available In the application domain of electronic commerce, biometric authentication can provide one possible solution for the key management problem. Besides server-based approaches, methods of deriving digital keys directly from biometric measures appear to be advantageous. In this paper, we analyze one of our recently published specific algorithms of this category based on behavioral biometrics of handwriting, the biometric hash. Our interest is to investigate to which degree each of the underlying feature parameters contributes to the overall intrapersonal stability and interpersonal value space. We will briefly discuss related work in feature evaluation and introduce a new methodology based on three components: the intrapersonal scatter (deviation, the interpersonal entropy, and the correlation between both measures. Evaluation of the technique is presented based on two data sets of different size. The method presented will allow determination of effects of parameterization of the biometric system, estimation of value space boundaries, and comparison with other feature selection approaches.

Random multispace quantization as an analytic mechanism for BioHashing of biometric and random identity inputs.

Science.gov (United States)

Teoh, Andrew B J; Goh, Alwyn; Ngo, David C L

2006-12-01

Biometric analysis for identity verification is becoming a widespread reality. Such implementations necessitate large-scale capture and storage of biometric data, which raises serious issues in terms of data privacy and (if such data is compromised) identity theft. These problems stem from the essential permanence of biometric data, which (unlike secret passwords or physical tokens) cannot be refreshed or reissued if compromised. Our previously presented biometric-hash framework prescribes the integration of external (password or token-derived) randomness with user-specific biometrics, resulting in bitstring outputs with security characteristics (i.e., noninvertibility) comparable to cryptographic ciphers or hashes. The resultant BioHashes are hence cancellable, i.e., straightforwardly revoked and reissued (via refreshed password or reissued token) if compromised. BioHashing furthermore enhances recognition effectiveness, which is explained in this paper as arising from the Random Multispace Quantization (RMQ) of biometric and external random inputs.

Controlling DC-DC converters by chaos-based pulse width modulation to reduce EMI

International Nuclear Information System (INIS)

Li Hong; Zhang Bo; Li Zhong; Halang, Wolfgang A.; Chen Guanrong

2009-01-01

In this paper, periodic and chaotic behaviors of DC-DC converters under certain parametric conditions are simulated, experimentally verified, and analyzed. Motivated by the work of J.H.B. Deane and D.C. Hamill in 1996, where chaotic phenomena are useful in suppressing electromagnetic interference (EMI) by adjusting the parameters of the DC-DC converter and making it operate in chaos, a chaos-based pulse width modulation (CPWM) is proposed to distribute the harmonics of the DC-DC converters continuously and evenly over a wide frequency range, thereby reducing the EMI. The output waves and spectral properties of the EMI are simulated and analyzed as the carrier frequency or amplitude changes with regard to different chaotic maps. Simulation and experimental results are given to illustrate the effectiveness of the proposed CPWM, which provides a good example of applying chaos theory in engineering practice.

Dynamics and chaos control of gyrostat satellite

International Nuclear Information System (INIS)

Aslanov, Vladimir; Yudintsev, Vadim

2012-01-01

Highlights: ► Free dual-spin gyrostat with a small rotor asymmetry is considered. ► Equations in Andoyer-Deprit canonical dimensionless variables are obtained. ► Phase space heteroclinic and homoclinic trajectories are written in closed form. ► Modified Melnikov function is used to construct the control that eliminates chaos. - Abstract: We consider the chaotic motion of the free gyrostat consisting of a platform with a triaxial inertia ellipsoid and a rotor with a small asymmetry with respect to the axis of rotation. Dimensionless equations of motion of the system with perturbations caused by small asymmetries of the rotor are written in Andoyer-Deprit variables. These perturbations lead to separatrix chaos. For gyrostats with different ratios of moments of inertia heteroclinic and homoclinic trajectories are written in closed-form. These trajectories are used for constructing modified Melnikov function, which is used for determine the control that eliminates separatrix chaos. Melnikov function and phase space trajectory are built to show the effectiveness of the control.

Rotation invariant deep binary hashing for fast image retrieval

Science.gov (United States)

Dai, Lai; Liu, Jianming; Jiang, Aiwen

2017-07-01

In this paper, we study how to compactly represent image's characteristics for fast image retrieval. We propose supervised rotation invariant compact discriminative binary descriptors through combining convolutional neural network with hashing. In the proposed network, binary codes are learned by employing a hidden layer for representing latent concepts that dominate on class labels. A loss function is proposed to minimize the difference between binary descriptors that describe reference image and the rotated one. Compared with some other supervised methods, the proposed network doesn't have to require pair-wised inputs for binary code learning. Experimental results show that our method is effective and achieves state-of-the-art results on the CIFAR-10 and MNIST datasets.

Advances in chaos theory and intelligent control

CERN Document Server

Vaidyanathan, Sundarapandian

2016-01-01

The book reports on the latest advances in and applications of chaos theory and intelligent control. Written by eminent scientists and active researchers and using a clear, matter-of-fact style, it covers advanced theories, methods, and applications in a variety of research areas, and explains key concepts in modeling, analysis, and control of chaotic and hyperchaotic systems. Topics include fractional chaotic systems, chaos control, chaos synchronization, memristors, jerk circuits, chaotic systems with hidden attractors, mechanical and biological chaos, and circuit realization of chaotic systems. The book further covers fuzzy logic controllers, evolutionary algorithms, swarm intelligence, and petri nets among other topics. Not only does it provide the readers with chaos fundamentals and intelligent control-based algorithms; it also discusses key applications of chaos as well as multidisciplinary solutions developed via intelligent control. The book is a timely and comprehensive reference guide for graduate s...

Replication of chaos in neural networks, economics and physics

CERN Document Server

Akhmet, Marat

2016-01-01

This book presents detailed descriptions of chaos for continuous-time systems. It is the first-ever book to consider chaos as an input for differential and hybrid equations. Chaotic sets and chaotic functions are used as inputs for systems with attractors: equilibrium points, cycles and tori. The findings strongly suggest that chaos theory can proceed from the theory of differential equations to a higher level than previously thought. The approach selected is conducive to the in-depth analysis of different types of chaos. The appearance of deterministic chaos in neural networks, economics and mechanical systems is discussed theoretically and supported by simulations. As such, the book offers a valuable resource for mathematicians, physicists, engineers and economists studying nonlinear chaotic dynamics.

The three versions of distributional chaos

International Nuclear Information System (INIS)

Balibrea, F.; Smital, J.; Stefankova, M.

2005-01-01

The notion of distributional chaos was introduced by Schweizer and Smital [Trans. Amer. Math. Soc. 344 (1994) 737] for continuous maps of the interval. However, it turns out that, for continuous maps of a compact metric space three mutually nonequivalent versions of distributional chaos, DC1-DC3, can be considered. In this paper we consider the weakest one, DC3. We show that DC3 does not imply chaos in the sense of Li and Yorke. We also show that DC3 is not invariant with respect to topological conjugacy. In other words, there are lower and upper distribution functions Φ xy and Φxy* generated by a continuous map f of a compact metric space (M, ρ) such that Φxy*(t)>Φxy(t) for all t in an interval. However, f on the same space M, but with a metric ρ' generating the same topology as ρ is no more DC3.Recall that, contrary to this, either DC1 or DC2 is topological conjugacy invariant and implies Li and Yorke chaos (cf. [Chaos, Solitons and Fractals 21 (2004) 1125])

A modified chaos-based communication scheme using Hamiltonian forms and observer

International Nuclear Information System (INIS)

Lopez-Mancilla, D; Cruz-Hernandez, C; Posadas-Castillo, C

2005-01-01

In this work, a modified chaos-based communication scheme is presented. In particular, we use the modified scheme proposed by Lopez-Mancilla and Cruz-Hernandez (2005), that improves the basic scheme for chaotic masking using a single transmission channel proposed by Cuomo and coworkers (1993). It is extended for a special class of Generalized Hamiltonian systems. Substantial differences that significantly affect the reception quality of the sent message, with or without considering noise effect in the transmission channel are given. We use two Hamiltonian Lorenz systems unidirectionally coupled, the first like a master/transmitter system and the other like a slave/receiver system in order to illustrate with numerical simulations the effectiveness of the modified scheme, using chaos synchronization with Hamiltonian forms and observer

A modified chaos-based communication scheme using Hamiltonian forms and observer

Energy Technology Data Exchange (ETDEWEB)

Lopez-Mancilla, D [Engineering Faculty, Baja California Autonomous University (UABC), Km. 103, Carretera Tijuana-Ensenada, 22860, Ensenada, B.C. (Mexico); Cruz-Hernandez, C [Telematics Direction, Scientific Research and Advanced Studies of Ensenada (CICESE), Km. 107 Carretera Tijuana-Ensenada, 22860 Ensenada, B.C. (Mexico); Posadas-Castillo, C [Engineering Faculty, Baja California Autonomous University (UABC), Km. 103, Carretera Tijuana-Ensenada, 22860, Ensenada, B.C. (Mexico); Faculty of Engineering Mechanic and Electrical (FIME), Nuevo Leon Autonomous University (UANL), Pedro de alba s/n Cd. Universitaria San Nicolas de los Garza N.L. (Mexico)

2005-01-01

In this work, a modified chaos-based communication scheme is presented. In particular, we use the modified scheme proposed by Lopez-Mancilla and Cruz-Hernandez (2005), that improves the basic scheme for chaotic masking using a single transmission channel proposed by Cuomo and coworkers (1993). It is extended for a special class of Generalized Hamiltonian systems. Substantial differences that significantly affect the reception quality of the sent message, with or without considering noise effect in the transmission channel are given. We use two Hamiltonian Lorenz systems unidirectionally coupled, the first like a master/transmitter system and the other like a slave/receiver system in order to illustrate with numerical simulations the effectiveness of the modified scheme, using chaos synchronization with Hamiltonian forms and observer.

Chaos characteristics and least squares support vector machines based online pipeline small leakages detection

International Nuclear Information System (INIS)

Liu, Jinhai; Su, Hanguang; Ma, Yanjuan; Wang, Gang; Wang, Yuan; Zhang, Kun

2016-01-01

Small leakages are severe threats to the long distance pipeline transportation. An online small leakage detection method based on chaos characteristics and Least Squares Support Vector Machines (LS-SVMs) is proposed in this paper. For the first time, the relationship between the chaos characteristics of pipeline inner pressures and the small leakages is investigated and applied in the pipeline detection method. Firstly, chaos in the pipeline inner pressure is found. Relevant chaos characteristics are estimated by the nonlinear time series analysis package (TISEAN). Then LS-SVM with a hybrid kernel is built and named as hybrid kernel LS-SVM (HKLS-SVM). It is applied to analyze the chaos characteristics and distinguish the negative pressure waves (NPWs) caused by small leaks. A new leak location method is also expounded. Finally, data of the chaotic Logistic-Map system is used in the simulation. A comparison between HKLS-SVM and other methods, in terms of the identification accuracy and computing efficiency, is made. The simulation result shows that HKLS-SVM gets the best performance and is effective in error analysis of chaotic systems. When real pipeline data is used in the test, the ultimate identification accuracy of HKLS-SVM reaches 97.38% and the position accuracy is 99.28%, indicating that the method proposed in this paper has good performance in detecting and locating small pipeline leaks.

Quantum chaos

International Nuclear Information System (INIS)

Steiner, F.

1994-01-01

A short historical overview is given on the development of our knowledge of complex dynamical systems with special emphasis on ergodicity and chaos, and on the semiclassical quantization of integrable and chaotic systems. The general trace formular is discussed as a sound mathematical basis for the semiclassical quantization of chaos. Two conjectures are presented on the basis of which it is argued that there are unique fluctuation properties in quantum mechanics which are universal and, in a well defined sense, maximally random if the corresponding classical system is strongly chaotic. These properties constitute the quantum mechanical analogue of the phenomenon of chaos in classical mechanics. Thus quantum chaos has been found. (orig.)

Chaotic dynamics and chaos control in nonlinear laser systems

International Nuclear Information System (INIS)

Fang Jinqing; Yao Weiguang

2001-01-01

Chaotic dynamics and chaos control have become a great challenge in nonlinear laser systems and its advances are reviewed mainly based on the ring cavity laser systems. The principle and stability conditions for time-delay feedback control are analyzed and applied to chaos control in the laser systems. Other advanced methods of chaos control, such as weak spatial perturbation and occasional proportional feedback technique, are discussed. Prospects of chaos control for application (such as improvement of laser power and performance, synchronized chaos secure communication and information processing) are pointed out finally

Chaos control applied to heart rhythm dynamics

Energy Technology Data Exchange (ETDEWEB)

Borem Ferreira, Bianca, E-mail: biaborem@gmail.com [Universidade Federal do Rio de Janeiro, COPPE, Department of Mechanical Engineering, P.O. Box 68.503, 21.941.972 Rio de Janeiro, RJ (Brazil); Souza de Paula, Aline, E-mail: alinedepaula@unb.br [Universidade de Brasi' lia, Department of Mechanical Engineering, 70.910.900 Brasilia, DF (Brazil); Amorim Savi, Marcelo, E-mail: savi@mecanica.ufrj.br [Universidade Federal do Rio de Janeiro, COPPE, Department of Mechanical Engineering, P.O. Box 68.503, 21.941.972 Rio de Janeiro, RJ (Brazil)

2011-08-15

Highlights: > A natural cardiac pacemaker is modeled by a modified Van der Pol oscillator. > Responses related to normal and chaotic, pathological functioning of the heart are investigated. > Chaos control methods are applied to avoid pathological behaviors of heart dynamics. > Different approaches are treated: stabilization of unstable periodic orbits and chaos suppression. - Abstract: The dynamics of cardiovascular rhythms have been widely studied due to the key aspects of the heart in the physiology of living beings. Cardiac rhythms can be either periodic or chaotic, being respectively related to normal and pathological physiological functioning. In this regard, chaos control methods may be useful to promote the stabilization of unstable periodic orbits using small perturbations. In this article, the extended time-delayed feedback control method is applied to a natural cardiac pacemaker described by a mathematical model. The model consists of a modified Van der Pol equation that reproduces the behavior of this pacemaker. Results show the ability of the chaos control strategy to control the system response performing either the stabilization of unstable periodic orbits or the suppression of chaotic response, avoiding behaviors associated with critical cardiac pathologies.

A hybrid cloud read aligner based on MinHash and kmer voting that preserves privacy

Science.gov (United States)

Popic, Victoria; Batzoglou, Serafim

2017-05-01

Low-cost clouds can alleviate the compute and storage burden of the genome sequencing data explosion. However, moving personal genome data analysis to the cloud can raise serious privacy concerns. Here, we devise a method named Balaur, a privacy preserving read mapper for hybrid clouds based on locality sensitive hashing and kmer voting. Balaur can securely outsource a substantial fraction of the computation to the public cloud, while being highly competitive in accuracy and speed with non-private state-of-the-art read aligners on short read data. We also show that the method is significantly faster than the state of the art in long read mapping. Therefore, Balaur can enable institutions handling massive genomic data sets to shift part of their analysis to the cloud without sacrificing accuracy or exposing sensitive information to an untrusted third party.

NHash: Randomized N-Gram Hashing for Distributed Generation of Validatable Unique Study Identifiers in Multicenter Research.

Science.gov (United States)

Zhang, Guo-Qiang; Tao, Shiqiang; Xing, Guangming; Mozes, Jeno; Zonjy, Bilal; Lhatoo, Samden D; Cui, Licong

2015-11-10

A unique study identifier serves as a key for linking research data about a study subject without revealing protected health information in the identifier. While sufficient for single-site and limited-scale studies, the use of common unique study identifiers has several drawbacks for large multicenter studies, where thousands of research participants may be recruited from multiple sites. An important property of study identifiers is error tolerance (or validatable), in that inadvertent editing mistakes during their transmission and use will most likely result in invalid study identifiers. This paper introduces a novel method called "Randomized N-gram Hashing (NHash)," for generating unique study identifiers in a distributed and validatable fashion, in multicenter research. NHash has a unique set of properties: (1) it is a pseudonym serving the purpose of linking research data about a study participant for research purposes; (2) it can be generated automatically in a completely distributed fashion with virtually no risk for identifier collision; (3) it incorporates a set of cryptographic hash functions based on N-grams, with a combination of additional encryption techniques such as a shift cipher; (d) it is validatable (error tolerant) in the sense that inadvertent edit errors will mostly result in invalid identifiers. NHash consists of 2 phases. First, an intermediate string using randomized N-gram hashing is generated. This string consists of a collection of N-gram hashes f1, f2, ..., fk. The input for each function fi has 3 components: a random number r, an integer n, and input data m. The result, fi(r, n, m), is an n-gram of m with a starting position s, which is computed as (r mod |m|), where |m| represents the length of m. The output for Step 1 is the concatenation of the sequence f1(r1, n1, m1), f2(r2, n2, m2), ..., fk(rk, nk, mk). In the second phase, the intermediate string generated in Phase 1 is encrypted using techniques such as shift cipher. The result

[A Method of Synthesizing Tinnitus Rehabilitation Sound Based on Pentatonic Scale and Chaos].

Science.gov (United States)

Chen, Jiemei; He, Peiyu; Pan, Fan

2015-12-01

Tinnitus is a common clinical symptom and its occurrence rate is high. It seriously affects life quality of the patients. Scientific researches show that listening some similar and none-repetitive music can relieve tinnitus to some extent. The overall music accorded with self-similarity character by the direct mapping method based on chaos. However, there were often the same tones continuous repeating a few times and tone mutations. To solve the problem, this paper proposes a new method for tinnitus rehabilitation sound synthesis based on pentatonic scale, chaos and musical instrument digital interface (MIDI). Experimental results showed that the tinnitus rehabilitation sounds were not only self-similar and incompletely reduplicate, but also no sudden changes. Thus, it has a referential significance for tinnitus treatment.

Chaos suppression based on adaptive observer for a P-class of chaotic systems

International Nuclear Information System (INIS)

Rodriguez, Angel; Leon, Jesus de; Femat, Ricardo

2007-01-01

A feedback approach is presented to suppress chaos in a P-class of chaotic system. The approach is based on an adaptive observer; which provides estimated values of both the unmeasured states and the uncertain model parameters. A continuous-time feedback law is taken as suppressing force. The feedback law attains chaos suppression as the observer provides estimated values close to the actual state/parameter values along time. The proposed scheme is robust in the sense that suppression is achieved despite only some states are measured and uncertainties in parameters are compensated. Results are corroborated experimentally by implementation in chaotic circuits

Chaos suppression based on adaptive observer for a P-class of chaotic systems

Energy Technology Data Exchange (ETDEWEB)

Rodriguez, Angel [Universidad Autonoma de Nuevo Leon, Facultad de Ingenieria Mecanica y Electrica, Av. Pedro de Alba s/n Cd. Universitaria, CP 66450 San Nicolas de los Garza, NL (Mexico); Leon, Jesus de [Universidad Autonoma de Nuevo Leon, Facultad de Ingenieria Mecanica y Electrica, Av. Pedro de Alba s/n Cd. Universitaria, CP 66450 San Nicolas de los Garza, NL (Mexico); Femat, Ricardo [Division de Matematicas Aplicadas y Sistemas Computacionales, IPICyT, Camino a la Presa San Jose 2055 Col. Lomas 4a. Secc. CP 78216 San Luis Potosi, SLP (Mexico)]. E-mail: rfemat@ipicyt.edu.mx

2007-05-15

A feedback approach is presented to suppress chaos in a P-class of chaotic system. The approach is based on an adaptive observer; which provides estimated values of both the unmeasured states and the uncertain model parameters. A continuous-time feedback law is taken as suppressing force. The feedback law attains chaos suppression as the observer provides estimated values close to the actual state/parameter values along time. The proposed scheme is robust in the sense that suppression is achieved despite only some states are measured and uncertainties in parameters are compensated. Results are corroborated experimentally by implementation in chaotic circuits.

Exploiting chaos for applications.

Science.gov (United States)

Ditto, William L; Sinha, Sudeshna

2015-09-01

We discuss how understanding the nature of chaotic dynamics allows us to control these systems. A controlled chaotic system can then serve as a versatile pattern generator that can be used for a range of application. Specifically, we will discuss the application of controlled chaos to the design of novel computational paradigms. Thus, we present an illustrative research arc, starting with ideas of control, based on the general understanding of chaos, moving over to applications that influence the course of building better devices.

Exploiting chaos for applications

Energy Technology Data Exchange (ETDEWEB)

Ditto, William L., E-mail: wditto@hawaii.edu [Department of Physics and Astronomy, University of Hawaii at Mānoa, Honolulu, Hawaii 96822 (United States); Sinha, Sudeshna, E-mail: sudeshna@iisermohali.ac.in [Indian Institute of Science Education and Research (IISER), Mohali, Knowledge City, Sector 81, SAS Nagar, PO Manauli 140306, Punjab (India)

2015-09-15

We discuss how understanding the nature of chaotic dynamics allows us to control these systems. A controlled chaotic system can then serve as a versatile pattern generator that can be used for a range of application. Specifically, we will discuss the application of controlled chaos to the design of novel computational paradigms. Thus, we present an illustrative research arc, starting with ideas of control, based on the general understanding of chaos, moving over to applications that influence the course of building better devices.

Soft Measurement Modeling Based on Chaos Theory for Biochemical Oxygen Demand (BOD

Directory of Open Access Journals (Sweden)

Junfei Qiao

2016-12-01

Full Text Available The precision of soft measurement for biochemical oxygen demand (BOD is always restricted due to various factors in the wastewater treatment plant (WWTP. To solve this problem, a new soft measurement modeling method based on chaos theory is proposed and is applied to BOD measurement in this paper. Phase space reconstruction (PSR based on Takens embedding theorem is used to extract more information from the limited datasets of the chaotic system. The WWTP is first testified as a chaotic system by the correlation dimension (D, the largest Lyapunov exponents (λ1, the Kolmogorov entropy (K of the BOD and other water quality parameters time series. Multivariate chaotic time series modeling method with principal component analysis (PCA and artificial neural network (ANN is then adopted to estimate the value of the effluent BOD. Simulation results show that the proposed approach has higher accuracy and better prediction ability than the corresponding modeling approaches not based on chaos theory.

Household chaos and family sleep during infants' first year.

Science.gov (United States)

Whitesell, Corey J; Crosby, Brian; Anders, Thomas F; Teti, Douglas M

2018-05-21

Household chaos has been linked with dysregulated family and individual processes. The present study investigated linkages between household chaos and infant and parent sleep, a self-regulated process impacted by individual, social, and environmental factors. Studies of relations between household chaos and child sleep have focused on older children and teenagers, with little attention given to infants or parent sleep. This study examines these relationships using objective measures of household chaos and sleep while controlling for, respectively, maternal emotional availability at bedtime and martial adjustment, in infant and parent sleep. Multilevel modeling examined mean and variability of sleep duration and fragmentation for infants, mothers, and fathers when infants were 1, 3, 6, 9, and 12 months (N = 167). Results indicated infants in higher chaos homes experienced delays in sleep consolidation patterns, with longer and more variable sleep duration, and greater fragmentation. Parent sleep was also associated with household chaos such that in higher chaos homes, mothers and fathers experienced greater variability in sleep duration, which paralleled infant findings. In lower chaos homes, parents' sleep fragmentation mirrored infants' decreasingly fragmented sleep across the first year and remained lower at all timepoints compared to parents and infants in high chaos homes. Collectively, these findings indicate that after controlling for maternal emotional availability and marital adjustment (respectively) household chaos has a dysregulatory impact on infant and parent sleep. Results are discussed in terms of the potential for chaos-induced poor sleep to dysregulate daytime functioning and, in turn, place parent-infant relationships at risk. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

EFFICIENCY ANALYSIS OF HASHING METHODS FOR FILE SYSTEMS IN USER MODE

Directory of Open Access Journals (Sweden)

E. Y. Ivanov

2013-05-01

Full Text Available The article deals with characteristics and performance of interaction protocols between virtual file system and file system, their influence on processing power of microkernel operating systems. User mode implementation of ext2 file system for MINIX 3 OS is used to show that in microkernel operating systems file object identification time might increase up to 26 times in comparison with monolithic systems. Therefore, we present efficiency analysis of various hashing methods for file systems, running in user mode. Studies have shown that using hashing methods recommended in this paper it is possible to achieve competitive performance of the considered component of I/O stacks in microkernel and monolithic operating systems.

HASH: the Hong Kong/AAO/Strasbourg Hα planetary nebula database

International Nuclear Information System (INIS)

Parker, Quentin A; Bojičić, Ivan S; Frew, David J

2016-01-01

By incorporating our major recent discoveries with re-measured and verified contents of existing catalogues we provide, for the first time, an accessible, reliable, on-line SQL database for essential, up-to date information for all known Galactic planetary nebulae (PNe). We have attempted to: i) reliably remove PN mimics/false ID's that have biased previous studies and ii) provide accurate positions, sizes, morphologies, multi-wavelength imagery and spectroscopy. We also provide a link to CDS/Vizier for the archival history of each object and other valuable links to external data. With the HASH interface, users can sift, select, browse, collate, investigate, download and visualise the entire currently known Galactic PNe diversity. HASH provides the community with the most complete and reliable data with which to undertake new science. (paper)

!CHAOS: A cloud of controls

Science.gov (United States)

Angius, S.; Bisegni, C.; Ciuffetti, P.; Di Pirro, G.; Foggetta, L. G.; Galletti, F.; Gargana, R.; Gioscio, E.; Maselli, D.; Mazzitelli, G.; Michelotti, A.; Orrù, R.; Pistoni, M.; Spagnoli, F.; Spigone, D.; Stecchi, A.; Tonto, T.; Tota, M. A.; Catani, L.; Di Giulio, C.; Salina, G.; Buzzi, P.; Checcucci, B.; Lubrano, P.; Piccini, M.; Fattibene, E.; Michelotto, M.; Cavallaro, S. R.; Diana, B. F.; Enrico, F.; Pulvirenti, S.

2016-01-01

The paper is aimed to present the !CHAOS open source project aimed to develop a prototype of a national private Cloud Computing infrastructure, devoted to accelerator control systems and large experiments of High Energy Physics (HEP). The !CHAOS project has been financed by MIUR (Italian Ministry of Research and Education) and aims to develop a new concept of control system and data acquisition framework by providing, with a high level of aaabstraction, all the services needed for controlling and managing a large scientific, or non-scientific, infrastructure. A beta version of the !CHAOS infrastructure will be released at the end of December 2015 and will run on private Cloud infrastructures based on OpenStack.

!CHAOS: A cloud of controls

International Nuclear Information System (INIS)

Angius, S.; Bisegni, C.; Ciuffetti, P.

2016-01-01

The paper is aimed to present the !CHAOS open source project aimed to develop a prototype of a national private Cloud Computing infrastructure, devoted to accelerator control systems and large experiments of High Energy Physics (HEP). The !CHAOS project has been financed by MIUR (Italian Ministry of Research and Education) and aims to develop a new concept of control system and data acquisition framework by providing, with a high level of abstraction, all the services needed for controlling and managing a large scientific, or non-scientific, infrastructure. A beta version of the !CHAOS infrastructure will be released at the end of December 2015 and will run on private Cloud infrastructures based on OpenStack.

Nuclear spectroscopy and quantum chaos

International Nuclear Information System (INIS)

Sakata, Fumihiko; Marumori, Toshio; Hashimoto, Yukio; Yamamoto, Yoshifumi; Tsukuma, Hidehiko; Iwasawa, Kazuo.

1990-05-01

In this paper, a recent development of INS-TSUKUBA joint research project on large-amplitude collective motion is summerized. The classical theory of nuclear collective dynamics formulated within the time-dependent Hartree-Fock theory is recapitulated and decisive role of the level crossing in the single-particle dynamics on the order-to-chaos transition of collective motion is discussed in detail. Extending the basic idea of the classical theory, we discuss a quantum theory of nuclear collective dynamics which allows us to properly define a concept of quantum chaos for each eigenfunction. By using numerical calculation, we illustrate what the quantum chaos for each eigenfunction means and its relation to usual definition based on the random matrix theory. (author)

Fast Structural Alignment of Biomolecules Using a Hash Table, N-Grams and String Descriptors

Directory of Open Access Journals (Sweden)

Robert Preissner

2009-04-01

Full Text Available This work presents a generalized approach for the fast structural alignment of thousands of macromolecular structures. The method uses string representations of a macromolecular structure and a hash table that stores n-grams of a certain size for searching. To this end, macromolecular structure-to-string translators were implemented for protein and RNA structures. A query against the index is performed in two hierarchical steps to unite speed and precision. In the first step the query structure is translated into n-grams, and all target structures containing these n-grams are retrieved from the hash table. In the second step all corresponding n-grams of the query and each target structure are subsequently aligned, and after each alignment a score is calculated based on the matching n-grams of query and target. The extendable framework enables the user to query and structurally align thousands of protein and RNA structures on a commodity machine and is available as open source from http://lajolla.sf.net.

Embrace the Chaos

Science.gov (United States)

Huwe, Terence K.

2009-01-01

"Embracing the chaos" is an ongoing challenge for librarians. Embracing the chaos means librarians must have a plan for responding to the flood of new products, widgets, web tools, and gizmos that students use daily. In this article, the author argues that library instruction and access services have been grappling with that chaos with…

Network secure communications based on beam halo-chaos

International Nuclear Information System (INIS)

Liu Qiang; Fang Jinqing; Li Yong

2010-01-01

Based on beam halo-chaos synchronization in the beam transport network (line)with small-world effect, using three synchronization methods:the driver-response synchronization, small-world topology coupling synchronization and multi-local small-world topology coupling synchronization, three kinds of secure communication projects were designed respectively, and were studied numerically by the Simulink tool of the Matlab software. Numerical experimental results demonstrate that encryption and decryption of the original signal are realized successfully. It provides effective theoretical foundation and reference for the next engineering design and network experiment. (authors)

A chaos-based evolutionary algorithm for general nonlinear programming problems

International Nuclear Information System (INIS)

El-Shorbagy, M.A.; Mousa, A.A.; Nasr, S.M.

2016-01-01

In this paper we present a chaos-based evolutionary algorithm (EA) for solving nonlinear programming problems named chaotic genetic algorithm (CGA). CGA integrates genetic algorithm (GA) and chaotic local search (CLS) strategy to accelerate the optimum seeking operation and to speed the convergence to the global solution. The integration of global search represented in genetic algorithm and CLS procedures should offer the advantages of both optimization methods while offsetting their disadvantages. By this way, it is intended to enhance the global convergence and to prevent to stick on a local solution. The inherent characteristics of chaos can enhance optimization algorithms by enabling it to escape from local solutions and increase the convergence to reach to the global solution. Twelve chaotic maps have been analyzed in the proposed approach. The simulation results using the set of CEC’2005 show that the application of chaotic mapping may be an effective strategy to improve the performances of EAs.

A Chaos-Based Secure Direct-Sequence/Spread-Spectrum Communication System

Directory of Open Access Journals (Sweden)

Nguyen Xuan Quyen

2013-01-01

Full Text Available This paper proposes a chaos-based secure direct-sequence/spread-spectrum (DS/SS communication system which is based on a novel combination of the conventional DS/SS and chaos techniques. In the proposed system, bit duration is varied according to a chaotic behavior but is always equal to a multiple of the fixed chip duration in the communication process. Data bits with variable duration are spectrum-spread by multiplying directly with a pseudonoise (PN sequence and then modulated onto a sinusoidal carrier by means of binary phase-shift keying (BPSK. To recover exactly the data bits, the receiver needs an identical regeneration of not only the PN sequence but also the chaotic behavior, and hence data security is improved significantly. Structure and operation of the proposed system are analyzed in detail. Theoretical evaluation of bit-error rate (BER performance in presence of additive white Gaussian noise (AWGN is provided. Parameter choice for different cases of simulation is also considered. Simulation and theoretical results are shown to verify the reliability and feasibility of the proposed system. Security of the proposed system is also discussed.

Linear feedback control, adaptive feedback control and their combination for chaos (lag) synchronization of LC chaotic systems

International Nuclear Information System (INIS)

Yan Zhenya; Yu Pei

2007-01-01

In this paper, we study chaos (lag) synchronization of a new LC chaotic system, which can exhibit not only a two-scroll attractor but also two double-scroll attractors for different parameter values, via three types of state feedback controls: (i) linear feedback control; (ii) adaptive feedback control; and (iii) a combination of linear feedback and adaptive feedback controls. As a consequence, ten families of new feedback control laws are designed to obtain global chaos lag synchronization for τ < 0 and global chaos synchronization for τ = 0 of the LC system. Numerical simulations are used to illustrate these theoretical results. Each family of these obtained feedback control laws, including two linear (adaptive) functions or one linear function and one adaptive function, is added to two equations of the LC system. This is simpler than the known synchronization controllers, which apply controllers to all equations of the LC system. Moreover, based on the obtained results of the LC system, we also derive the control laws for chaos (lag) synchronization of another new type of chaotic system

Chaos the science of predictable random motion

CERN Document Server

Kautz, Richard

2011-01-01

Based on only elementary mathematics, this engaging account of chaos theory bridges the gap between introductions for the layman and college-level texts. It develops the science of dynamics in terms of small time steps, describes the phenomenon of chaos through simple examples, and concludes with a close look at a homoclinic tangle, the mathematical monster at the heart of chaos. The presentation is enhanced by many figures, animations of chaotic motion (available on a companion CD), and biographical sketches of the pioneers of dynamics and chaos theory. To ensure accessibility to motivated high school students, care has been taken to explain advanced mathematical concepts simply, including exponentials and logarithms, probability, correlation, frequency analysis, fractals, and transfinite numbers. These tools help to resolve the intriguing paradox of motion that is predictable and yet random, while the final chapter explores the various ways chaos theory has been put to practical use.

VHDL Descriptions for the FPGA Implementation of PWL-Function-Based Multi-Scroll Chaotic Oscillators.

Directory of Open Access Journals (Sweden)

Esteban Tlelo-Cuautle

Full Text Available Nowadays, chaos generators are an attractive field for research and the challenge is their realization for the development of engineering applications. From more than three decades ago, chaotic oscillators have been designed using discrete electronic devices, very few with integrated circuit technology, and in this work we propose the use of field-programmable gate arrays (FPGAs for fast prototyping. FPGA-based applications require that one be expert on programming with very-high-speed integrated circuits hardware description language (VHDL. In this manner, we detail the VHDL descriptions of chaos generators for fast prototyping from high-level programming using Python. The cases of study are three kinds of chaos generators based on piecewise-linear (PWL functions that can be systematically augmented to generate even and odd number of scrolls. We introduce new algorithms for the VHDL description of PWL functions like saturated functions series, negative slopes and sawtooth. The generated VHDL-code is portable, reusable and open source to be synthesized in an FPGA. Finally, we show experimental results for observing 2, 10 and 30-scroll attractors.

VHDL Descriptions for the FPGA Implementation of PWL-Function-Based Multi-Scroll Chaotic Oscillators.

Science.gov (United States)

Tlelo-Cuautle, Esteban; Quintas-Valles, Antonio de Jesus; de la Fraga, Luis Gerardo; Rangel-Magdaleno, Jose de Jesus

2016-01-01

Nowadays, chaos generators are an attractive field for research and the challenge is their realization for the development of engineering applications. From more than three decades ago, chaotic oscillators have been designed using discrete electronic devices, very few with integrated circuit technology, and in this work we propose the use of field-programmable gate arrays (FPGAs) for fast prototyping. FPGA-based applications require that one be expert on programming with very-high-speed integrated circuits hardware description language (VHDL). In this manner, we detail the VHDL descriptions of chaos generators for fast prototyping from high-level programming using Python. The cases of study are three kinds of chaos generators based on piecewise-linear (PWL) functions that can be systematically augmented to generate even and odd number of scrolls. We introduce new algorithms for the VHDL description of PWL functions like saturated functions series, negative slopes and sawtooth. The generated VHDL-code is portable, reusable and open source to be synthesized in an FPGA. Finally, we show experimental results for observing 2, 10 and 30-scroll attractors.

How to test for partially predictable chaos.

Science.gov (United States)

Wernecke, Hendrik; Sándor, Bulcsú; Gros, Claudius

2017-04-24

For a chaotic system pairs of initially close-by trajectories become eventually fully uncorrelated on the attracting set. This process of decorrelation can split into an initial exponential decrease and a subsequent diffusive process on the chaotic attractor causing the final loss of predictability. Both processes can be either of the same or of very different time scales. In the latter case the two trajectories linger within a finite but small distance (with respect to the overall extent of the attractor) for exceedingly long times and remain partially predictable. Standard tests for chaos widely use inter-orbital correlations as an indicator. However, testing partially predictable chaos yields mostly ambiguous results, as this type of chaos is characterized by attractors of fractally broadened braids. For a resolution we introduce a novel 0-1 indicator for chaos based on the cross-distance scaling of pairs of initially close trajectories. This test robustly discriminates chaos, including partially predictable chaos, from laminar flow. Additionally using the finite time cross-correlation of pairs of initially close trajectories, we are able to identify laminar flow as well as strong and partially predictable chaos in a 0-1 manner solely from the properties of pairs of trajectories.

Chaos, decoherence and quantum cosmology

International Nuclear Information System (INIS)

Calzetta, Esteban

2012-01-01

In this topical review we discuss the connections between chaos, decoherence and quantum cosmology. We understand chaos as classical chaos in systems with a finite number of degrees of freedom, decoherence as environment induced decoherence and quantum cosmology as the theory of the Wheeler-DeWitt equation or else the consistent history formulation thereof, first in mini super spaces and later through its extension to midi super spaces. The overall conclusion is that consideration of decoherence is necessary (and probably sufficient) to sustain an interpretation of quantum cosmology based on the wavefunction of the Universe adopting a Wentzel-Kramers-Brillouin form for large Universes, but a definitive account of the semiclassical transition in classically chaotic cosmological models is not available in the literature yet. (topical review)

Chaos control of the micro-electro-mechanical resonator by using adaptive dynamic surface technology with extended state observer

International Nuclear Information System (INIS)

Luo, Shaohua; Sun, Quanping; Cheng, Wei

2016-01-01

This paper addresses chaos control of the micro-electro- mechanical resonator by using adaptive dynamic surface technology with extended state observer. To reveal the mechanism of the micro- electro-mechanical resonator, the phase diagrams and corresponding time histories are given to research the nonlinear dynamics and chaotic behavior, and Homoclinic and heteroclinic chaos which relate closely with the appearance of chaos are presented based on the potential function. To eliminate the effect of chaos, an adaptive dynamic surface control scheme with extended state observer is designed to convert random motion into regular motion without precise system model parameters and measured variables. Putting tracking differentiator into chaos controller solves the ‘explosion of complexity’ of backstepping and poor precision of the first-order filters. Meanwhile, to obtain high performance, a neural network with adaptive law is employed to approximate unknown nonlinear function in the process of controller design. The boundedness of all the signals of the closed-loop system is proved in theoretical analysis. Finally, numerical simulations are executed and extensive results illustrate effectiveness and robustness of the proposed scheme.

XMSS : a practical forward secure signature scheme based on minimal security assumptions

NARCIS (Netherlands)

Buchmann, Johannes; Dahmen, Erik; Hülsing, Andreas; Yang, B.-Y.

2011-01-01

We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a second preimage resistant (hash) function family. Its signature size is reduced to less than 25% compared to the best

Chaos in charged AdS black hole extended phase space

Science.gov (United States)

Chabab, M.; El Moumni, H.; Iraoui, S.; Masmar, K.; Zhizeh, S.

2018-06-01

We present an analytical study of chaos in a charged black hole in the extended phase space in the context of the Poincare-Melnikov theory. Along with some background on dynamical systems, we compute the relevant Melnikov function and find its zeros. Then we analyse these zeros either to identify the temporal chaos in the spinodal region, or to observe spatial chaos in the small/large black hole equilibrium configuration. As a byproduct, we derive a constraint on the Black hole' charge required to produce chaotic behaviour. To the best of our knowledge, this is the first endeavour to understand the correlation between chaos and phase picture in black holes.

Genome chaos: survival strategy during crisis.

Science.gov (United States)

Liu, Guo; Stevens, Joshua B; Horne, Steven D; Abdallah, Batoul Y; Ye, Karen J; Bremer, Steven W; Ye, Christine J; Chen, David J; Heng, Henry H

2014-01-01

Genome chaos, a process of complex, rapid genome re-organization, results in the formation of chaotic genomes, which is followed by the potential to establish stable genomes. It was initially detected through cytogenetic analyses, and recently confirmed by whole-genome sequencing efforts which identified multiple subtypes including "chromothripsis", "chromoplexy", "chromoanasynthesis", and "chromoanagenesis". Although genome chaos occurs commonly in tumors, both the mechanism and detailed aspects of the process are unknown due to the inability of observing its evolution over time in clinical samples. Here, an experimental system to monitor the evolutionary process of genome chaos was developed to elucidate its mechanisms. Genome chaos occurs following exposure to chemotherapeutics with different mechanisms, which act collectively as stressors. Characterization of the karyotype and its dynamic changes prior to, during, and after induction of genome chaos demonstrates that chromosome fragmentation (C-Frag) occurs just prior to chaotic genome formation. Chaotic genomes seem to form by random rejoining of chromosomal fragments, in part through non-homologous end joining (NHEJ). Stress induced genome chaos results in increased karyotypic heterogeneity. Such increased evolutionary potential is demonstrated by the identification of increased transcriptome dynamics associated with high levels of karyotypic variance. In contrast to impacting on a limited number of cancer genes, re-organized genomes lead to new system dynamics essential for cancer evolution. Genome chaos acts as a mechanism of rapid, adaptive, genome-based evolution that plays an essential role in promoting rapid macroevolution of new genome-defined systems during crisis, which may explain some unwanted consequences of cancer treatment.

Individual chaos implies collective chaos for weakly mixing discrete dynamical systems

International Nuclear Information System (INIS)

Liao Gongfu; Ma Xianfeng; Wang Lidong

2007-01-01

Let X be a metric space (X,f) a discrete dynamical system, where f:X->X is a continuous function. Let f-bar denote the natural extension of f to the space of all non-empty compact subsets of X endowed with Hausdorff metric induced by d. In this paper we investigate some dynamical properties of f and f-bar . It is proved that f is weakly mixing (mixing) if and only if f-bar is weakly mixing (mixing, respectively). From this, we deduce that weak-mixing of f implies transitivity of f-bar , further, if f is mixing or weakly mixing, then chaoticity of f (individual chaos) implies chaoticity of f-bar (collective chaos) and if X is a closed interval then f-bar is chaotic (in the sense of Devaney) if and only if f is weakly mixing

Cryptanalysis on an image block encryption algorithm based on spatiotemporal chaos

International Nuclear Information System (INIS)

Wang Xing-Yuan; He Guo-Xiang

2012-01-01

An image block encryption scheme based on spatiotemporal chaos has been proposed recently. In this paper, we analyse the security weakness of the proposal. The main problem of the original scheme is that the generated keystream remains unchanged for encrypting every image. Based on the flaws, we demonstrate a chosen plaintext attack for revealing the equivalent keys with only 6 pairs of plaintext/ciphertext used. Finally, experimental results show the validity of our attack. (general)

Research on the Statistical Characteristics of Crosstalk in Naval Ships Wiring Harness Based on Polynomial Chaos Expansion Method

Directory of Open Access Journals (Sweden)

Chi Yaodan

2017-08-01

Full Text Available Crosstalk in wiring harness has been studied extensively for its importance in the naval ships electromagnetic compatibility field. An effective and high-efficiency method is proposed in this paper for analyzing Statistical Characteristics of crosstalk in wiring harness with random variation of position based on Polynomial Chaos Expansion (PCE. A typical 14-cable wiring harness was simulated as the object of research. Distance among interfering cable, affected cable and GND is synthesized and analyzed in both frequency domain and time domain. The model of naval ships wiring harness distribution parameter was established by utilizing Legendre orthogonal polynomials as basis functions along with prediction model of statistical characters. Detailed mean value, mean square error, probability density function and reasonable varying range of crosstalk in naval ships wiring harness are described in both time domain and frequency domain. Numerical experiment proves that the method proposed in this paper, not only has good consistency with the MC method can be applied in the naval ships EMC research field to provide theoretical support for guaranteeing safety, but also has better time-efficiency than the MC method. Therefore, the Polynomial Chaos Expansion method.

Random number generation based on digital differential chaos

KAUST Repository

Zidan, Mohammed A.

2012-07-29

In this paper, we present a fully digital differential chaos based random number generator. The output of the digital circuit is proved to be chaotic by calculating the output time series maximum Lyapunov exponent. We introduce a new post processing technique to improve the distribution and statistical properties of the generated data. The post-processed output passes the NIST Sp. 800-22 statistical tests. The system is written in Verilog VHDL and realized on Xilinx Virtex® FPGA. The generator can fit into a very small area and have a maximum throughput of 2.1 Gb/s.

Train flow chaos analysis based on an improved cellular automata model

International Nuclear Information System (INIS)

Meng, Xuelei; Xiang, Wanli; Jia, Limin; Xu, Jie

2015-01-01

To control the chaos in the railway traffic flow and offer valuable information for the dispatchers of the railway system, an improved cellular model is presented to detect and analyze the chaos in the traffic flow. We first introduce the working mechanism of moving block system, analyzing the train flow movement characteristics. Then we improve the cellular model on the evolution rules to adjust the train flow movement. We give the train operation steps from three cases: the trains running on a railway section, a train will arrive in a station and a train will departure from a station. We simulate 4 trains to run on a high speed section fixed with moving block system and record the distances between the neighbor trains and draw the Poincare section to analyze the chaos in the train operation. It is concluded that there is not only chaos but order in the train operation system with moving blocking system and they can interconvert to each other. The findings have the potential value in train dispatching system construction and offer supporting information for the daily dispatching work.

Ray and wave chaos in underwater acoustic waveguides

International Nuclear Information System (INIS)

Virovlyansky, Anatolii L; Makarov, Denis V; Prants, Sergei V

2012-01-01

In the 1990s, the study of the chaotic behavior of ray trajectories in inhomogeneous waveguides emerged as a new field in ocean acoustics. It turned out that at ranges on the order of or larger than 1000 km ray chaos is well developed and should be taken into account when describing long-range sound propagation in the ocean. The theoretical analysis of ray chaos and of its finite-wavelength manifestation, wave chaos, is to a large extent based on well-known methods and ideas from the theory of dynamical and quantum chaos. Concrete examples are used to review the results obtained in this field over the last two decades. (reviews of topical problems)

Impact of Chaos Functions on Modern Swarm Optimizers.

Directory of Open Access Journals (Sweden)

E Emary

Full Text Available Exploration and exploitation are two essential components for any optimization algorithm. Much exploration leads to oscillation and premature convergence while too much exploitation slows down the optimization algorithm and the optimizer may be stuck in local minima. Therefore, balancing the rates of exploration and exploitation at the optimization lifetime is a challenge. This study evaluates the impact of using chaos-based control of exploration/exploitation rates against using the systematic native control. Three modern algorithms were used in the study namely grey wolf optimizer (GWO, antlion optimizer (ALO and moth-flame optimizer (MFO in the domain of machine learning for feature selection. Results on a set of standard machine learning data using a set of assessment indicators prove advance in optimization algorithm performance when using variational repeated periods of declined exploration rates over using systematically decreased exploration rates.

A Spatiotemporal-Chaos-Based Encryption Having Overall Properties Considerably Better than Advanced Encryption Standard

Science.gov (United States)

Wang, Shi-Hong; Ye, Wei-Ping; Lü, Hua-Ping; Kuang, Jin-Yu; Li, Jing-Hua; Luo, Yun-Lun; Hu, Gang

2003-07-01

Spatiotemporal chaos of a two-dimensional one-way coupled map lattice is used for chaotic cryptography. The chaotic outputs of many space units are used for encryption simultaneously. This system shows satisfactory cryptographic properties of high security, fast encryption (decryption) speed, and robustness against noise disturbances in communication channel. The overall features of this spatiotemporal-chaos-based cryptosystem are better than chaotic cryptosystems known so far, and also than currently used conventional cryptosystems, such as the Advanced Encryption Standard (AES). The project supported by National Natural Science Foundation of China under Grant No. 10175010 and the Special Funds for Major State Basic Research Projects under Grant No. G2000077304

Chaos Control in a New Three-Dimensional Chaotic T System

International Nuclear Information System (INIS)

Chen Yong; Yan Zhenya

2008-01-01

In this paper, we study chaos control of the new 3D chaotic system. We use three feedback methods (the linear, speed, doubly-periodic function controller) to suppress the chaos to unstable equilibrium. As a result, some controllers are obtained. Moreover, numerical simulations are used to verify the effectiveness of the obtained controllers

HashLearn Now: Mobile Tutoring in India

OpenAIRE

Arun Kumar Agariya; Binay Krishna Shivam; Shashank Murali; Jyoti Tikoria

2016-01-01

Looking at today’s competitive exams scenario, a single mark may lead to a differentiation of rank in multiples of hundreds or even thousands. Looking at this problem from student’s perspective this article discusses the role of anywhere, anytime help for the students in getting answers for their problems on a real-time basis from the application known as HashLearn Now. The smart phones usage by students clearly signifies the importance of this application for getting their queries answered b...

Sleep Quality Estimation based on Chaos Analysis for Heart Rate Variability

Science.gov (United States)

Fukuda, Toshio; Wakuda, Yuki; Hasegawa, Yasuhisa; Arai, Fumihito; Kawaguchi, Mitsuo; Noda, Akiko

In this paper, we propose an algorithm to estimate sleep quality based on a heart rate variability using chaos analysis. Polysomnography(PSG) is a conventional and reliable system to diagnose sleep disorder and to evaluate its severity and therapeatic effect, by estimating sleep quality based on multiple channels. However, a recording process requires a lot of time and a controlled environment for measurement and then an analyzing process of PSG data is hard work because the huge sensed data should be manually evaluated. On the other hand, it is focused that some people make a mistake or cause an accident due to lost of regular sleep and of homeostasis these days. Therefore a simple home system for checking own sleep is required and then the estimation algorithm for the system should be developed. Therefore we propose an algorithm to estimate sleep quality based only on a heart rate variability which can be measured by a simple sensor such as a pressure sensor and an infrared sensor in an uncontrolled environment, by experimentally finding the relationship between chaos indices and sleep quality. The system including the estimation algorithm can inform patterns and quality of own daily sleep to a user, and then the user can previously arranges his life schedule, pays more attention based on sleep results and consult with a doctor.

Li-Yorke chaos and synchronous chaos in a globally nonlocal coupled map lattice

International Nuclear Information System (INIS)

Khellat, Farhad; Ghaderi, Akashe; Vasegh, Nastaran

2011-01-01

Highlights: → A globally nonlocal coupled map lattice is introduced. → A sufficient condition for the existence of Li-Yorke chaos is determined. → A sufficient condition for synchronous behaviors is obtained. - Abstract: This paper investigates a globally nonlocal coupled map lattice. A rigorous proof to the existence of chaos in the scene of Li-Yorke in that system is presented in terms of the Marotto theorem. Analytical sufficient conditions under which the system is chaotic, and has synchronous behaviors are determined, respectively. The wider regions associated with chaos and synchronous behaviors are shown by simulations. Spatiotemporal chaos, synchronous chaos and some other synchronous behaviors such as fixed points, 2-cycles and 2 2 -cycles are also shown by simulations for some values of the parameters.

Quantum chaos

International Nuclear Information System (INIS)

Cejnar, P.

2007-01-01

Chaos is a name given in physics to a branch which, within classical mechanics, studies the consequences of sensitive dependences of the behavior of physical systems on the starting conditions, i.e., the 'butterfly wing effect'. However, how to describe chaotic behavior in the world of quantum particles? It appears that quantum mechanics does not admit the sensitive dependence on the starting conditions, and moreover, predicts a substantial suppression of chaos also at the macroscopic level. Still, the quantum properties of systems that are chaotic in terms of classical mechanics differ basically from the properties of classically arranged systems. This topic is studied by a field of physics referred to as quantum chaos. (author)

Household Chaos and Children’s Cognitive and Socio-Emotional Development in Early Childhood: Does Childcare Play a Buffering Role?

Science.gov (United States)

Berry, Daniel; Blair, Clancy; Willoughby, Michael; Garrett-Peters, Patricia; Vernon-Feagans, Lynne; Mills-Koonce, W. Roger

2018-01-01

Evidence suggests that household chaos is associated with less optimal child outcomes. Yet, there is an increasing indication that children’s experiences in childcare may buffer them against the detrimental effects of such environments. Our study aims were to test: (1) whether children’s experiences in childcare mitigated relations between household chaos and children’s cognitive and social development, and (2) whether these (conditional) chaos effects were mediated by links between chaos and executive functioning. Using data from The Family Life Project (n = 1,235)—a population-based sample of families from low-income, rural contexts—our findings indicated that household disorganization in early childhood was predictive of worse cognitive and social outcomes at approximately age five. However, these relations were substantially attenuated for children attending greater childcare hours. Subsequent models indicated that the conditional associations between household disorganization and less optimal outcomes at age five were mediated by conditional links between disorganization and less optimal executive functioning. PMID:29720785

Synchronization of chaos in non-identical parametrically excited systems

International Nuclear Information System (INIS)

Idowu, B.A.; Vincent, U.E.; Njah, A.N.

2009-01-01

In this paper, we investigate the synchronization of chaotic systems consisting of non-identical parametrically excited oscillators. The active control technique is employed to design control functions based on Lyapunov stability theory and Routh-Hurwitz criteria so as to achieve global chaos synchronization between a parametrically excited gyroscope and each of the parametrically excited pendulum and Duffing oscillator. Numerical simulations are implemented to verify the results.

Chaos-based Pseudo-random Number Generation

KAUST Repository

Barakat, Mohamed L.

2014-04-10

Various methods and systems related to chaos-based pseudo-random number generation are presented. In one example, among others, a system includes a pseudo-random number generator (PRNG) to generate a series of digital outputs and a nonlinear post processing circuit to perform an exclusive OR (XOR) operation on a first portion of a current digital output of the PRNG and a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output. In another example, a method includes receiving at least a first portion of a current output from a PRNG and performing an XOR operation on the first portion of the current PRNG output with a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output.

Chaos-based Pseudo-random Number Generation

KAUST Repository

Barakat, Mohamed L.; Mansingka, Abhinav S.; Radwan, Ahmed Gomaa Ahmed; Salama, Khaled N.

2014-01-01

Various methods and systems related to chaos-based pseudo-random number generation are presented. In one example, among others, a system includes a pseudo-random number generator (PRNG) to generate a series of digital outputs and a nonlinear post processing circuit to perform an exclusive OR (XOR) operation on a first portion of a current digital output of the PRNG and a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output. In another example, a method includes receiving at least a first portion of a current output from a PRNG and performing an XOR operation on the first portion of the current PRNG output with a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output.

Effect of smoothing on robust chaos.

Science.gov (United States)

Deshpande, Amogh; Chen, Qingfei; Wang, Yan; Lai, Ying-Cheng; Do, Younghae

2010-08-01

In piecewise-smooth dynamical systems, situations can arise where the asymptotic attractors of the system in an open parameter interval are all chaotic (e.g., no periodic windows). This is the phenomenon of robust chaos. Previous works have established that robust chaos can occur through the mechanism of border-collision bifurcation, where border is the phase-space region where discontinuities in the derivatives of the dynamical equations occur. We investigate the effect of smoothing on robust chaos and find that periodic windows can arise when a small amount of smoothness is present. We introduce a parameter of smoothing and find that the measure of the periodic windows in the parameter space scales linearly with the parameter, regardless of the details of the smoothing function. Numerical support and a heuristic theory are provided to establish the scaling relation. Experimental evidence of periodic windows in a supposedly piecewise linear dynamical system, which has been implemented as an electronic circuit, is also provided.

Chaos Concepts, Control and Constructive Use

CERN Document Server

Bolotin, Yurii; Yanovsky, Vladimir

2009-01-01

The study of chaotic behaviour in nonlinear, dynamical systems is now a well established research domain with ramifications into all fields of sciences, spanning a vast range of applications, from celestial mechanics, via climate change, to the functioning of brownian motors in cells. A more recent discovery is that chaos can be controlled and, under appropriate conditions, can actually be constructive in the sense of becoming a control parameter itself for the system under investigation, stochastic resonance being a prime example. The present work is putting emphasis on the latter aspects, and after recalling the paradigm changes introduced by the concept of chaos, leads the reader skillfully through the basics of chaos control by detailing relevant algorithms for both Hamiltonian and dissipative systems amongst others. The main part of the book is then devoted to the issue of synchronization in chaotic systems, an introduction to stochastic resonance and a survey of ratchet models. This short and concise pr...

A Symmetric Chaos-Based Image Cipher with an Improved Bit-Level Permutation Strategy

Directory of Open Access Journals (Sweden)

Chong Fu

2014-02-01

Full Text Available Very recently, several chaos-based image ciphers using a bit-level permutation have been suggested and shown promising results. Due to the diffusion effect introduced in the permutation stage, the workload of the time-consuming diffusion stage is reduced, and hence the performance of the cryptosystem is improved. In this paper, a symmetric chaos-based image cipher with a 3D cat map-based spatial bit-level permutation strategy is proposed. Compared with those recently proposed bit-level permutation methods, the diffusion effect of the new method is superior as the bits are shuffled among different bit-planes rather than within the same bit-plane. Moreover, the diffusion key stream extracted from hyperchaotic system is related to both the secret key and the plain image, which enhances the security against known/chosen plaintext attack. Extensive security analysis has been performed on the proposed scheme, including the most important ones like key space analysis, key sensitivity analysis, plaintext sensitivity analysis and various statistical analyses, which has demonstrated the satisfactory security of the proposed scheme

Paths to chaos

International Nuclear Information System (INIS)

Friedrich, H.

1992-01-01

Rapid growth in the study of nonlinear dynamics and chaos in classical mechanics, has led physicists to reappraise their abandonment of this definition of atomic theory in favour of quantum mechanics adopted earlier this century. The concept of chaos in classical mechanics is examined in this paper and manifestations of chaos in quantum mechanics are explored. While quantum mechanics teaches that atomic particles must not be pictured as moving sharply in defined orbits, these precise orbits can be used to describe essential features of the measurable quantum mechanical spectra. (UK)

Riemannian theory of Hamiltonian chaos and Lyapunov exponents

Science.gov (United States)

Casetti, Lapo; Clementi, Cecilia; Pettini, Marco

1996-12-01

A nonvanishing Lyapunov exponent λ1 provides the very definition of deterministic chaos in the solutions of a dynamical system; however, no theoretical mean of predicting its value exists. This paper copes with the problem of analytically computing the largest Lyapunov exponent λ1 for many degrees of freedom Hamiltonian systems as a function of ɛ=E/N, the energy per degree of freedom. The functional dependence λ1(ɛ) is of great interest because, among other reasons, it detects the existence of weakly and strongly chaotic regimes. This aim, the analytic computation of λ1(ɛ), is successfully reached within a theoretical framework that makes use of a geometrization of Newtonian dynamics in the language of Riemannian differential geometry. An alternative point of view about the origin of chaos in these systems is obtained independently of the standard explanation based on homoclinic intersections. Dynamical instability (chaos) is here related to curvature fluctuations of the manifolds whose geodesics are natural motions and is described by means of the Jacobi-Levi-Civita equation (JLCE) for geodesic spread. In this paper it is shown how to derive from the JLCE an effective stability equation. Under general conditions, this effective equation formally describes a stochastic oscillator; an analytic formula for the instability growth rate of its solutions is worked out and applied to the Fermi-Pasta-Ulam β model and to a chain of coupled rotators. Excellent agreement is found between the theoretical prediction and numeric values of λ1(ɛ) for both models.

Chaos in quantum channels

Energy Technology Data Exchange (ETDEWEB)

Hosur, Pavan; Qi, Xiao-Liang [Department of Physics, Stanford University,476 Lomita Mall, Stanford, California 94305 (United States); Roberts, Daniel A. [Center for Theoretical Physics and Department of Physics, Massachusetts Institute of Technology,77 Massachusetts Ave, Cambridge, Massachusetts 02139 (United States); Yoshida, Beni [Perimeter Institute for Theoretical Physics,31 Caroline Street North, Waterloo, Ontario N2L 2Y5 (Canada); Walter Burke Institute for Theoretical Physics, California Institute of Technology,1200 E California Blvd, Pasadena CA 91125 (United States)

2016-02-01

We study chaos and scrambling in unitary channels by considering their entanglement properties as states. Using out-of-time-order correlation functions to diagnose chaos, we characterize the ability of a channel to process quantum information. We show that the generic decay of such correlators implies that any input subsystem must have near vanishing mutual information with almost all partitions of the output. Additionally, we propose the negativity of the tripartite information of the channel as a general diagnostic of scrambling. This measures the delocalization of information and is closely related to the decay of out-of-time-order correlators. We back up our results with numerics in two non-integrable models and analytic results in a perfect tensor network model of chaotic time evolution. These results show that the butterfly effect in quantum systems implies the information-theoretic definition of scrambling.

On the Mechanisms Behind Chaos

DEFF Research Database (Denmark)

Lindberg, Erik

2006-01-01

behind the chaotic behavior, e.g. one group is based on the sudden interrupt of inductive currents, another group is based on the sudden parallel coupling of capacitors with different voltages, and a third group may be based on multiplication of signals. An example of chaos based on disturbance...

Reconstruction of chaotic signals with applications to chaos-based communications

CERN Document Server

Feng, Jiu Chao

2008-01-01

This book provides a systematic review of the fundamental theory of signal reconstruction and the practical techniques used in reconstructing chaotic signals. Specific applications of signal reconstruction methods in chaos-based communications are expounded in full detail, along with examples illustrating the various problems associated with such applications.The book serves as an advanced textbook for undergraduate and graduate courses in electronic and information engineering, automatic control, physics and applied mathematics. It is also highly suited for general nonlinear scientists who wi

Patterns in chaos

International Nuclear Information System (INIS)

Chirikov, B.V.

1990-01-01

Classification of chaotic patterns in classical Hamiltonian systems is given as a series of levels with increasing disorder. Hamiltonian dynamics is presented, including the renormalization chaos, based upon the fairly simple resonant theory. First estimates for the critical structure and related statistical anomalies in arbitrary dimensions are discussed. 49 refs

Model for Shock Wave Chaos

KAUST Repository

Kasimov, Aslan R.; Faria, Luiz; Rosales, Rodolfo R.

2013-01-01

: steady traveling wave solutions, instability of such solutions, and the onset of chaos. Our model is the first (to our knowledge) to describe chaos in shock waves by a scalar first-order partial differential equation. The chaos arises in the equation

Does chaos assist localization or delocalization?

Science.gov (United States)

Tan, Jintao; Lu, Gengbiao; Luo, Yunrong; Hai, Wenhua

2014-12-01

We aim at a long-standing contradiction between chaos-assisted tunneling and chaos-related localization study quantum transport of a single particle held in an amplitude-modulated and tilted optical lattice. We find some near-resonant regions crossing chaotic and regular regions in the parameter space, and demonstrate that chaos can heighten velocity of delocalization in the chaos-resonance overlapping regions, while chaos may aid localization in the other chaotic regions. The degree of localization enhances with increasing the distance between parameter points and near-resonant regions. The results could be useful for experimentally manipulating chaos-assisted transport of single particles in optical or solid-state lattices.

Chaos, complexity, and random matrices

Science.gov (United States)

Cotler, Jordan; Hunter-Jones, Nicholas; Liu, Junyu; Yoshida, Beni

2017-11-01

Chaos and complexity entail an entropic and computational obstruction to describing a system, and thus are intrinsically difficult to characterize. In this paper, we consider time evolution by Gaussian Unitary Ensemble (GUE) Hamiltonians and analytically compute out-of-time-ordered correlation functions (OTOCs) and frame potentials to quantify scrambling, Haar-randomness, and circuit complexity. While our random matrix analysis gives a qualitatively correct prediction of the late-time behavior of chaotic systems, we find unphysical behavior at early times including an O(1) scrambling time and the apparent breakdown of spatial and temporal locality. The salient feature of GUE Hamiltonians which gives us computational traction is the Haar-invariance of the ensemble, meaning that the ensemble-averaged dynamics look the same in any basis. Motivated by this property of the GUE, we introduce k-invariance as a precise definition of what it means for the dynamics of a quantum system to be described by random matrix theory. We envision that the dynamical onset of approximate k-invariance will be a useful tool for capturing the transition from early-time chaos, as seen by OTOCs, to late-time chaos, as seen by random matrix theory.

Hardware Realization of Chaos Based Symmetric Image Encryption

KAUST Repository

Barakat, Mohamed L.

2012-06-01

This thesis presents a novel work on hardware realization of symmetric image encryption utilizing chaos based continuous systems as pseudo random number generators. Digital implementation of chaotic systems results in serious degradations in the dynamics of the system. Such defects are illuminated through a new technique of generalized post proceeding with very low hardware cost. The thesis further discusses two encryption algorithms designed and implemented as a block cipher and a stream cipher. The security of both systems is thoroughly analyzed and the performance is compared with other reported systems showing a superior results. Both systems are realized on Xilinx Vetrix-4 FPGA with a hardware and throughput performance surpassing known encryption systems.

The legal response to illegal "hash clubs" in Denmark

DEFF Research Database (Denmark)

Asmussen, V.; Moesby-Johansen, C.

2004-01-01

Fra midten af 1990'erne er der skudt en række hashklubber op i Danmark. Overordnet er der to slags klubber: salgssteder og væresteder. De første klubber er udelukkende organiseret om salget af hash, mens de andre er klubber, hvor man både kan købe hashen og opholde sig på stedet for at deltage i ...

Dynamical topology and statistical properties of spatiotemporal chaos.

Science.gov (United States)

Zhuang, Quntao; Gao, Xun; Ouyang, Qi; Wang, Hongli

2012-12-01

For spatiotemporal chaos described by partial differential equations, there are generally locations where the dynamical variable achieves its local extremum or where the time partial derivative of the variable vanishes instantaneously. To a large extent, the location and movement of these topologically special points determine the qualitative structure of the disordered states. We analyze numerically statistical properties of the topologically special points in one-dimensional spatiotemporal chaos. The probability distribution functions for the number of point, the lifespan, and the distance covered during their lifetime are obtained from numerical simulations. Mathematically, we establish a probabilistic model to describe the dynamics of these topologically special points. In spite of the different definitions in different spatiotemporal chaos, the dynamics of these special points can be described in a uniform approach.

Harnessing quantum transport by transient chaos.

Science.gov (United States)

Yang, Rui; Huang, Liang; Lai, Ying-Cheng; Grebogi, Celso; Pecora, Louis M

2013-03-01

Chaos has long been recognized to be generally advantageous from the perspective of control. In particular, the infinite number of unstable periodic orbits embedded in a chaotic set and the intrinsically sensitive dependence on initial conditions imply that a chaotic system can be controlled to a desirable state by using small perturbations. Investigation of chaos control, however, was largely limited to nonlinear dynamical systems in the classical realm. In this paper, we show that chaos may be used to modulate or harness quantum mechanical systems. To be concrete, we focus on quantum transport through nanostructures, a problem of considerable interest in nanoscience, where a key feature is conductance fluctuations. We articulate and demonstrate that chaos, more specifically transient chaos, can be effective in modulating the conductance-fluctuation patterns. Experimentally, this can be achieved by applying an external gate voltage in a device of suitable geometry to generate classically inaccessible potential barriers. Adjusting the gate voltage allows the characteristics of the dynamical invariant set responsible for transient chaos to be varied in a desirable manner which, in turn, can induce continuous changes in the statistical characteristics of the quantum conductance-fluctuation pattern. To understand the physical mechanism of our scheme, we develop a theory based on analyzing the spectrum of the generalized non-Hermitian Hamiltonian that includes the effect of leads, or electronic waveguides, as self-energy terms. As the escape rate of the underlying non-attracting chaotic set is increased, the imaginary part of the complex eigenenergy becomes increasingly large so that pointer states are more difficult to form, making smoother the conductance-fluctuation pattern.

Biologically inspired rate control of chaos.

Science.gov (United States)

Olde Scheper, Tjeerd V

2017-10-01

The overall intention of chaotic control is to eliminate chaos and to force the system to become stable in the classical sense. In this paper, I demonstrate a more subtle method that does not eliminate all traces of chaotic behaviour; yet it consistently, and reliably, can provide control as intended. The Rate Control of Chaos (RCC) method is derived from metabolic control processes and has several remarkable properties. RCC can control complex systems continuously, and unsupervised, it can also maintain control across bifurcations, and in the presence of significant systemic noise. Specifically, I show that RCC can control a typical set of chaotic models, including the 3 and 4 dimensional chaotic Lorenz systems, in all modes. Furthermore, it is capable of controlling spatiotemporal chaos without supervision and maintains control of the system across bifurcations. This property of RCC allows a dynamic system to operate in parameter spaces that are difficult to control otherwise. This may be particularly interesting for the control of forced systems or dynamic systems that are chaotically perturbed. These control properties of RCC are applicable to a range of dynamic systems, thereby appearing to have far-reaching effects beyond just controlling chaos. RCC may also point to the existence of a biochemical control function of an enzyme, to stabilise the dynamics of the reaction cascade.

Image Blocking Encryption Algorithm Based on Laser Chaos Synchronization

Directory of Open Access Journals (Sweden)

Shu-Ying Wang

2016-01-01

Full Text Available In view of the digital image transmission security, based on laser chaos synchronization and Arnold cat map, a novel image encryption scheme is proposed. Based on pixel values of plain image a parameter is generated to influence the secret key. Sequences of the drive system and response system are pretreated by the same method and make image blocking encryption scheme for plain image. Finally, pixels position are scrambled by general Arnold transformation. In decryption process, the chaotic synchronization accuracy is fully considered and the relationship between the effect of synchronization and decryption is analyzed, which has characteristics of high precision, higher efficiency, simplicity, flexibility, and better controllability. The experimental results show that the encryption algorithm image has high security and good antijamming performance.

Synchronization of chaos by nonlinear feedback

International Nuclear Information System (INIS)

Cheng Yanxiang

1995-01-01

The authors point out that synchronization of chaos may also be achieved by a nonlinear feedback without decomposing the original system. They apply the idea to the Lorentz system, and discuss several forms of nonlinear feedbacks by Lyapunov function and numerical method

Signatures of chaos in the Brillouin zone.

Science.gov (United States)

Barr, Aaron; Barr, Ariel; Porter, Max D; Reichl, Linda E

2017-10-01

When the classical dynamics of a particle in a finite two-dimensional billiard undergoes a transition to chaos, the quantum dynamics of the particle also shows manifestations of chaos in the form of scarring of wave functions and changes in energy level spacing distributions. If we "tile" an infinite plane with such billiards, we find that the Bloch states on the lattice undergo avoided crossings, energy level spacing statistics change from Poisson-like to Wigner-like, and energy sheets of the Brillouin zone begin to "mix" as the classical dynamics of the billiard changes from regular to chaotic behavior.

[Shedding light on chaos theory].

Science.gov (United States)

Chou, Shieu-Ming

2004-06-01

Gleick (1987) said that only three twentieth century scientific theories would be important enough to continue be of use in the twenty-first century: The Theory of Relativity, Quantum Theory, and Chaos Theory. Chaos Theory has become a craze which is being used to forge a new scientific system. It has also been extensively applied in a variety of professions. The purpose of this article is to introduce chaos theory and its nursing applications. Chaos is a sign of regular order. This is to say that chaos theory emphasizes the intrinsic potential for regular order within disordered phenomena. It is to be hoped that this article will inspire more nursing scientists to apply this concept to clinical, research, or administrative fields in our profession.

Chaos synchronization of a new chaotic system via nonlinear control

International Nuclear Information System (INIS)

Zhang Qunjiao; Lu Junan

2008-01-01

This paper investigates chaos synchronization of a new chaotic system [Lue J, Chen G, Cheng D. A new chaotic system and beyond: the generalized Lorenz-like system. Int J Bifurcat Chaos 2004;14:1507-37]. Two kinds of novel nonlinear controllers are designed based on the Lyapunov stability theory. It can be viewed as an improvement to the existing results of reference [Park JH. Chaos synchronization of a chaotic system via nonlinear control. Chaos, Solitons and Fractals 2005;25:579-84] because we use less controllers but realize a global and exponential asymptotical synchronization. Numerical simulations are provided to show the effectiveness and advantage of this method

Death and revival of chaos.

Science.gov (United States)

Kaszás, Bálint; Feudel, Ulrike; Tél, Tamás

2016-12-01

We investigate the death and revival of chaos under the impact of a monotonous time-dependent forcing that changes its strength with a non-negligible rate. Starting on a chaotic attractor it is found that the complexity of the dynamics remains very pronounced even when the driving amplitude has decayed to rather small values. When after the death of chaos the strength of the forcing is increased again with the same rate of change, chaos is found to revive but with a different history. This leads to the appearance of a hysteresis in the complexity of the dynamics. To characterize these dynamics, the concept of snapshot attractors is used, and the corresponding ensemble approach proves to be superior to a single trajectory description, that turns out to be nonrepresentative. The death (revival) of chaos is manifested in a drop (jump) of the standard deviation of one of the phase-space coordinates of the ensemble; the details of this chaos-nonchaos transition depend on the ratio of the characteristic times of the amplitude change and of the internal dynamics. It is demonstrated that chaos cannot die out as long as underlying transient chaos is present in the parameter space. As a condition for a "quasistatically slow" switch-off, we derive an inequality which cannot be fulfilled in practice over extended parameter ranges where transient chaos is present. These observations need to be taken into account when discussing the implications of "climate change scenarios" in any nonlinear dynamical system.

High-dimensional chaos from self-sustained collisions of solitons

Energy Technology Data Exchange (ETDEWEB)

Yildirim, O. Ozgur, E-mail: donhee@seas.harvard.edu, E-mail: oozgury@gmail.com [Cavium, Inc., 600 Nickerson Rd., Marlborough, Massachusetts 01752 (United States); Ham, Donhee, E-mail: donhee@seas.harvard.edu, E-mail: oozgury@gmail.com [Harvard University, 33 Oxford St., Cambridge, Massachusetts 02138 (United States)

2014-06-16

We experimentally demonstrate chaos generation based on collisions of electrical solitons on a nonlinear transmission line. The nonlinear line creates solitons, and an amplifier connected to it provides gain to these solitons for their self-excitation and self-sustenance. Critically, the amplifier also provides a mechanism to enable and intensify collisions among solitons. These collisional interactions are of intrinsically nonlinear nature, modulating the phase and amplitude of solitons, thus causing chaos. This chaos generated by the exploitation of the nonlinear wave phenomena is inherently high-dimensional, which we also demonstrate.

A chaos wolf optimization algorithm with self-adaptive variable step-size

Science.gov (United States)

Zhu, Yong; Jiang, Wanlu; Kong, Xiangdong; Quan, Lingxiao; Zhang, Yongshun

2017-10-01

To explore the problem of parameter optimization for complex nonlinear function, a chaos wolf optimization algorithm (CWOA) with self-adaptive variable step-size was proposed. The algorithm was based on the swarm intelligence of wolf pack, which fully simulated the predation behavior and prey distribution way of wolves. It possessed three intelligent behaviors such as migration, summons and siege. And the competition rule as "winner-take-all" and the update mechanism as "survival of the fittest" were also the characteristics of the algorithm. Moreover, it combined the strategies of self-adaptive variable step-size search and chaos optimization. The CWOA was utilized in parameter optimization of twelve typical and complex nonlinear functions. And the obtained results were compared with many existing algorithms, including the classical genetic algorithm, the particle swarm optimization algorithm and the leader wolf pack search algorithm. The investigation results indicate that CWOA possess preferable optimization ability. There are advantages in optimization accuracy and convergence rate. Furthermore, it demonstrates high robustness and global searching ability.

Colpitts and Chaos

DEFF Research Database (Denmark)

Lindberg, Erik

1996-01-01

The chaotic behaviour of the Colpitts oscillator reported by M.P. Kennedy is further investigated by means of PSpice simulations. Chaos is also observed with the default Ebers-Moll BJT transistor model with no memory. When the model is extended with memory and losses chaos do not occur and a 3'rd...... order limit cycle is found. If the the forward Early voltage parameter is added chaos is observed again. An examination of the eigenvalues of the oscillator with the simple memoryless Ebers-Moll BJT injection model is presented. By adding bulk resistors to the model stable limit cycles of orders 1, 2, 3...

Magnetic field induced dynamical chaos.

Science.gov (United States)

Ray, Somrita; Baura, Alendu; Bag, Bidhan Chandra

2013-12-01

In this article, we have studied the dynamics of a particle having charge in the presence of a magnetic field. The motion of the particle is confined in the x-y plane under a two dimensional nonlinear potential. We have shown that constant magnetic field induced dynamical chaos is possible even for a force which is derived from a simple potential. For a given strength of the magnetic field, initial position, and velocity of the particle, the dynamics may be regular, but it may become chaotic when the field is time dependent. Chaotic dynamics is very often if the field is time dependent. Origin of chaos has been explored using the Hamiltonian function of the dynamics in terms of action and angle variables. Applicability of the present study has been discussed with a few examples.

Enlightenment philosophers’ ideas about chaos

Directory of Open Access Journals (Sweden)

A. V. Kulik

2014-07-01

 It is grounded that the philosopher and enlightener Johann Gottfried von Herder advanced an idea of objectivity of process of transformation chaos into order. It is shown that idea of «The law of nature» existing as for ordering chaos opened far­reaching prospects for researches of interaction with chaos.

Cracking chaos-based encryption systems ruled by nonlinear time delay differential equations

International Nuclear Information System (INIS)

Udaltsov, Vladimir S.; Goedgebuer, Jean-Pierre; Larger, Laurent; Cuenot, Jean-Baptiste; Levy, Pascal; Rhodes, William T.

2003-01-01

We report that signal encoding with high-dimensional chaos produced by delayed feedback systems with a strong nonlinearity can be broken. We describe the procedure and illustrate the method with chaotic waveforms obtained from a strongly nonlinear optical system that we used previously to demonstrate signal encryption/decryption with chaos in wavelength. The method can be extended to any systems ruled by nonlinear time-delayed differential equations

SEMANTIC SEGMENTATION OF BUILDING ELEMENTS USING POINT CLOUD HASHING

Directory of Open Access Journals (Sweden)

M. Chizhova

2018-05-01

Full Text Available For the interpretation of point clouds, the semantic definition of extracted segments from point clouds or images is a common problem. Usually, the semantic of geometrical pre-segmented point cloud elements are determined using probabilistic networks and scene databases. The proposed semantic segmentation method is based on the psychological human interpretation of geometric objects, especially on fundamental rules of primary comprehension. Starting from these rules the buildings could be quite well and simply classified by a human operator (e.g. architect into different building types and structural elements (dome, nave, transept etc., including particular building parts which are visually detected. The key part of the procedure is a novel method based on hashing where point cloud projections are transformed into binary pixel representations. A segmentation approach released on the example of classical Orthodox churches is suitable for other buildings and objects characterized through a particular typology in its construction (e.g. industrial objects in standardized enviroments with strict component design allowing clear semantic modelling.

Generalized logistic map and its application in chaos based cryptography

Science.gov (United States)

Lawnik, M.

2017-12-01

The logistic map is commonly used in, for example, chaos based cryptography. However, its properties do not render a safe construction of encryption algorithms. Thus, the scope of the paper is a proposal of generalization of the logistic map by means of a wellrecognized family of chaotic maps. In the next step, an analysis of Lyapunov exponent and the distribution of the iterative variable are studied. The obtained results confirm that the analyzed model can safely and effectively replace a classic logistic map for applications involving chaotic cryptography.

Lack of evidence for low-dimensional chaos in heart rate variability

DEFF Research Database (Denmark)

Kanters, J K; Holstein-Rathlou, N H; Agner, E

1994-01-01

INTRODUCTION: The term chaos is used to describe erratic or apparently random time-dependent behavior in deterministic systems. It has been suggested that the variability observed in the normal heart rate may be due to chaos, but this question has not been settled. METHODS AND RESULTS: Heart rate...... in the experimental data, but the prediction error as a function of the prediction length increased at a slower rate than characteristic of a low-dimensional chaotic system. CONCLUSION: There is no evidence for low-dimensional chaos in the time series of RR intervals from healthy human subjects. However, nonlinear...

Wave chaos in quantum systems with point interaction

International Nuclear Information System (INIS)

Albeverio, S.; Seba, P.

1991-01-01

The authors study perturbations H of the quantized version H 0 of integrable Hamiltonian systems by point interactions. They relate the eigenvalues of H to the zeros of a certain meromorphic function ξ. Assuming the eigenvalues of H 0 are Poisson distributed, they get detailed information on the joint distribution of the zeros of ξ and give bounds on the probability density for the spacings of eigenvalues of H. Their results confirm the wave chaos phenomenon, as different from the quantum chaos phenomenon predicted by random matrix theory

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

Chaos theory in politics

CERN Document Server

Erçetin, Şefika; Tekin, Ali

2014-01-01

The present work investigates global politics and political implications of social science and management with the aid of the latest complexity and chaos theories. Until now, deterministic chaos and nonlinear analysis have not been a focal point in this area of research. This book remedies this deficiency by utilizing these methods in the analysis of the subject matter. The authors provide the reader a detailed analysis on politics and its associated applications with the help of chaos theory, in a single edited volume.

Stochastic Estimation via Polynomial Chaos

Science.gov (United States)

2015-10-01

AFRL-RW-EG-TR-2015-108 Stochastic Estimation via Polynomial Chaos Douglas V. Nance Air Force Research...COVERED (From - To) 20-04-2015 – 07-08-2015 4. TITLE AND SUBTITLE 5a. CONTRACT NUMBER Stochastic Estimation via Polynomial Chaos ...This expository report discusses fundamental aspects of the polynomial chaos method for representing the properties of second order stochastic

Chaos synchronization basing on symbolic dynamics with nongenerating partition.

Science.gov (United States)

Wang, Xingyuan; Wang, Mogei; Liu, Zhenzhen

2009-06-01

Using symbolic dynamics and information theory, we study the information transmission needed for synchronizing unidirectionally coupled oscillators. It is found that when sustaining chaos synchronization with nongenerating partition, the synchronization error will be larger than a critical value, although the required coupled channel capacity can be smaller than the case of using a generating partition. Then we show that no matter whether a generating or nongenerating partition is in use, a high-quality detector can guarantee the lead of the response oscillator, while the lag responding can make up the low precision of the detector. A practicable synchronization scheme basing on a nongenerating partition is also proposed in this paper.

Modified projective synchronization with complex scaling factors of uncertain real chaos and complex chaos

International Nuclear Information System (INIS)

Zhang Fang-Fang; Liu Shu-Tang; Yu Wei-Yong

2013-01-01

To increase the variety and security of communication, we present the definitions of modified projective synchronization with complex scaling factors (CMPS) of real chaotic systems and complex chaotic systems, where complex scaling factors establish a link between real chaos and complex chaos. Considering all situations of unknown parameters and pseudo-gradient condition, we design adaptive CMPS schemes based on the speed-gradient method for the real drive chaotic system and complex response chaotic system and for the complex drive chaotic system and the real response chaotic system, respectively. The convergence factors and dynamical control strength are added to regulate the convergence speed and increase robustness. Numerical simulations verify the feasibility and effectiveness of the presented schemes. (general)

Chaos and noise.

Science.gov (United States)

He, Temple; Habib, Salman

2013-09-01

Simple dynamical systems--with a small number of degrees of freedom--can behave in a complex manner due to the presence of chaos. Such systems are most often (idealized) limiting cases of more realistic situations. Isolating a small number of dynamical degrees of freedom in a realistically coupled system generically yields reduced equations with terms that can have a stochastic interpretation. In situations where both noise and chaos can potentially exist, it is not immediately obvious how Lyapunov exponents, key to characterizing chaos, should be properly defined. In this paper, we show how to do this in a class of well-defined noise-driven dynamical systems, derived from an underlying Hamiltonian model.

"Chaos Rules" Revisited

Science.gov (United States)

Murphy, David

2011-01-01

About 20 years ago, while lost in the midst of his PhD research, the author mused over proposed titles for his thesis. He was pretty pleased with himself when he came up with "Chaos Rules" (the implied double meaning was deliberate), or more completely, "Chaos Rules: An Exploration of the Work of Instructional Designers in Distance Education." He…

A chaos-based image encryption algorithm with variable control parameters

International Nuclear Information System (INIS)

Wang Yong; Wong, K.-W.; Liao Xiaofeng; Xiang Tao; Chen Guanrong

2009-01-01

In recent years, a number of image encryption algorithms based on the permutation-diffusion structure have been proposed. However, the control parameters used in the permutation stage are usually fixed in the whole encryption process, which favors attacks. In this paper, a chaos-based image encryption algorithm with variable control parameters is proposed. The control parameters used in the permutation stage and the keystream employed in the diffusion stage are generated from two chaotic maps related to the plain-image. As a result, the algorithm can effectively resist all known attacks against permutation-diffusion architectures. Theoretical analyses and computer simulations both confirm that the new algorithm possesses high security and fast encryption speed for practical image encryption.

Quantum Chaos

International Nuclear Information System (INIS)

Bohigas, Oriol

2005-01-01

Are there quantum signatures, for instance in the spectral properties, of the underlying regular or chaotic nature of the corresponding classical motion? Are there universality classes? Within this framework the merging of two at first sight seemingly disconnected fields, namely random matrix theories (RMT) and quantum chaos (QC), is briefly described. Periodic orbit theory (POT) plays a prominent role. Emphasis is given to compound nucleus resonances and binding energies, whose shell effects are examined from this perspective. Several aspects are illustrated with Riemann's ζ-function, which has become a testing ground for RMT, QC, POT, and their relationship

Quantum Chaos

Energy Technology Data Exchange (ETDEWEB)

Bohigas, Oriol [Laboratoire de Physique Theorique et Modeles Statistiques, Orsay (France)

2005-04-18

Are there quantum signatures, for instance in the spectral properties, of the underlying regular or chaotic nature of the corresponding classical motion? Are there universality classes? Within this framework the merging of two at first sight seemingly disconnected fields, namely random matrix theories (RMT) and quantum chaos (QC), is briefly described. Periodic orbit theory (POT) plays a prominent role. Emphasis is given to compound nucleus resonances and binding energies, whose shell effects are examined from this perspective. Several aspects are illustrated with Riemann's {zeta}-function, which has become a testing ground for RMT, QC, POT, and their relationship.

Chaos-induced resonant effects and its control

International Nuclear Information System (INIS)

Zambrano, Samuel; Casado, Jose M.; Sanjuan, Miguel A.F.

2007-01-01

This Letter shows that a suitable chaotic signal can induce resonant effects analogous to those observed in presence of noise in a bistable system under periodic forcing. By constructing groups of chaotic and random perturbations with similar one-time statistics we show that in some cases chaos and noise induce indistinguishable resonant effects. This reinforces the conjecture by which in some situations where noise is supposed to play a key role maybe chaos is the key ingredient. Here we also show that the presence of a chaotic signal as the perturbation leading to a resonance opens new control perspectives based on our ability to stabilize chaos in different periodic orbits. A discussion of the possible implications of these facts is also presented at the end of the Letter

Implementation of LT codes based on chaos

International Nuclear Information System (INIS)

Zhou Qian; Li Liang; Chen Zengqiang; Zhao Jiaxiang

2008-01-01

Fountain codes provide an efficient way to transfer information over erasure channels like the Internet. LT codes are the first codes fully realizing the digital fountain concept. They are asymptotically optimal rateless erasure codes with highly efficient encoding and decoding algorithms. In theory, for each encoding symbol of LT codes, its degree is randomly chosen according to a predetermined degree distribution, and its neighbours used to generate that encoding symbol are chosen uniformly at random. Practical implementation of LT codes usually realizes the randomness through pseudo-randomness number generator like linear congruential method. This paper applies the pseudo-randomness of chaotic sequence in the implementation of LT codes. Two Kent chaotic maps are used to determine the degree and neighbour(s) of each encoding symbol. It is shown that the implemented LT codes based on chaos perform better than the LT codes implemented by the traditional pseudo-randomness number generator. (general)

Detecting Chaos from Agricultural Product Price Time Series

Directory of Open Access Journals (Sweden)

Xin Su

2014-12-01

Full Text Available Analysis of the characteristics of agricultural product price volatility and trend forecasting are necessary to formulate and implement agricultural price control policies. Taking wholesale cabbage prices as an example, a multiple test methodology has been adopted to identify the nonlinearity, fractality, and chaos of the data. The approaches used include the R/S analysis, the BDS test, the power spectra, the recurrence plot, the largest Lyapunov exponent, the Kolmogorov entropy, and the correlation dimension. The results show that there is chaos in agricultural wholesale price data, which provides a good theoretical basis for selecting reasonable forecasting models as prediction techniques based on chaos theory can be applied to forecasting agricultural prices.

Quantum Instantons and Quantum Chaos

OpenAIRE

Jirari, H.; Kröger, H.; Luo, X. Q.; Moriarty, K. J. M.; Rubin, S. G.

1999-01-01

Based on a closed form expression for the path integral of quantum transition amplitudes, we suggest rigorous definitions of both, quantum instantons and quantum chaos. As an example we compute the quantum instanton of the double well potential.

A new type of cascading synchronization for halo-chaos and its potential for communication applications

International Nuclear Information System (INIS)

Fang Jinqing; Yu Xinghuo

2004-01-01

Study of beam halo-chaos has become a key issue of concern for many future important applications. Control of halo-chaos has been researched intensively. This is the first time that the synchronization of beam halo-chaos has been realized in this field so far. Two nonlinear feedback control methods are proposed for the cascading synchronizing halo-chaos in coupled lattices of a periodic focusing channel. The simulation results show that the methods are effective. The realization of the synchronization of beam halo-chaos is significant not only for halo-chaos control itself but also for halo-chaos-based secure communication which may become an innovative technique

Chaos Suppression of an Electrically Actuated Microresonator Based on Fractional-Order Nonsingular Fast Terminal Sliding Mode Control

Directory of Open Access Journals (Sweden)

Jianxin Han

2017-01-01

Full Text Available This paper focuses on chaos suppression strategy of a microresonator actuated by two symmetrical electrodes. Dynamic behavior of this system under the case where the origin is the only stable equilibrium is investigated first. Numerical simulations reveal that system may exhibit chaotic motion under certain excitation conditions. Then, bifurcation diagrams versus amplitude or frequency of AC excitation are drawn to grasp system dynamics nearby its natural frequency. Results show that the vibration is complex and may exhibit period-doubling bifurcation, chaotic motion, or dynamic pull-in instability. For the suppression of chaos, a novel control algorithm, based on an integer-order nonsingular fast terminal sliding mode and a fractional-order switching law, is proposed. Fractional Lyapunov Stability Theorem is used to guarantee the asymptotic stability of the system. Finally, numerical results with both fractional-order and integer-order control laws show that our proposed control law is effective in controlling chaos with system uncertainties and external disturbances.

Chaos synchronization of the fractional-order Chen's system

International Nuclear Information System (INIS)

Zhu Hao; Zhou Shangbo; He Zhongshi

2009-01-01

In this paper, based on the stability theorem of linear fractional systems, a necessary condition is given to check the chaos synchronization of fractional systems with incommensurate order. Chaos synchronization is studied by utilizing the Pecora-Carroll (PC) method and the coupling method. The necessary condition can also be used as a tool to confirm results of a numerical simulation. Numerical simulation results show the effectiveness of the necessary condition.

Hastily Formed Networks-Chaos to Recovery

Science.gov (United States)

2015-09-01

NETWORKS— CHAOS TO RECOVERY by Mark Arezzi September 2015 Thesis Co-Advisors: Douglas J. MacKinnon Brian Steckler THIS PAGE......systems to self-organize, adapt, and exert control over the chaos . Defining the role of communications requires an understanding of complexity, chaos

Puzzles in studies of quantum chaos

International Nuclear Information System (INIS)

Xu Gongou

1994-01-01

Puzzles in studies of quantum chaos are discussed. From the view of global properties of quantum states, it is clarified that quantum chaos originates from the break-down of invariant properties of quantum canonical transformations. There exist precise correspondences between quantum and classical chaos

Determination of the exact range of the value of the parameter corresponding to chaos based on the Silnikov criterion

International Nuclear Information System (INIS)

Wei-Yi, Li; Qi-Chang, Zhang; Wei, Wang

2010-01-01

Based on the Silnikov criterion, this paper studies a chaotic system of cubic polynomial ordinary differential equations in three dimensions. Using the Cardano formula, it obtains the exact range of the value of the parameter corresponding to chaos by means of the centre manifold theory and the method of multiple scales combined with Floque theory. By calculating the manifold near the equilibrium point, the series expression of the homoclinic orbit is also obtained. The space trajectory and Lyapunov exponent are investigated via numerical simulation, which shows that there is a route to chaos through period-doubling bifurcation and that chaotic attractors exist in the system. The results obtained here mean that chaos occurred in the exact range given in this paper. Numerical simulations also verify the analytical results. (general)

Breaking a chaos-noise-based secure communication scheme

Science.gov (United States)

Li, Shujun; Álvarez, Gonzalo; Chen, Guanrong; Mou, Xuanqin

2005-03-01

This paper studies the security of a secure communication scheme based on two discrete-time intermittently chaotic systems synchronized via a common random driving signal. Some security defects of the scheme are revealed: 1) The key space can be remarkably reduced; 2) the decryption is insensitive to the mismatch of the secret key; 3) the key-generation process is insecure against known/chosen-plaintext attacks. The first two defects mean that the scheme is not secure enough against brute-force attacks, and the third one means that an attacker can easily break the cryptosystem by approximately estimating the secret key once he has a chance to access a fragment of the generated keystream. Yet it remains to be clarified if intermittent chaos could be used for designing secure chaotic cryptosystems.

Chaos Theory as a Planning Tool for Community-Based Educational Experiences for Health Students.

Science.gov (United States)

Velde, Beth P.; Greer, Annette G.; Lynch, Deirdre C.; Escott-Stump, Sylvia

2002-01-01

Chaos theory, which attempts to understand underlying order where none is apparent, was applied to an interdisciplinary rural health training program for health professionals. Similar programs should anticipate systemic flux between order and chaos and pay attention to information flow, degree of diversity, richness of connectivity, contained…

Improved Adaptive LSB Steganography Based on Chaos and Genetic Algorithm

Science.gov (United States)

Yu, Lifang; Zhao, Yao; Ni, Rongrong; Li, Ting

2010-12-01

We propose a novel steganographic method in JPEG images with high performance. Firstly, we propose improved adaptive LSB steganography, which can achieve high capacity while preserving the first-order statistics. Secondly, in order to minimize visual degradation of the stego image, we shuffle bits-order of the message based on chaos whose parameters are selected by the genetic algorithm. Shuffling message's bits-order provides us with a new way to improve the performance of steganography. Experimental results show that our method outperforms classical steganographic methods in image quality, while preserving characteristics of histogram and providing high capacity.

Improved Adaptive LSB Steganography Based on Chaos and Genetic Algorithm

Directory of Open Access Journals (Sweden)

Yu Lifang

2010-01-01

Full Text Available We propose a novel steganographic method in JPEG images with high performance. Firstly, we propose improved adaptive LSB steganography, which can achieve high capacity while preserving the first-order statistics. Secondly, in order to minimize visual degradation of the stego image, we shuffle bits-order of the message based on chaos whose parameters are selected by the genetic algorithm. Shuffling message's bits-order provides us with a new way to improve the performance of steganography. Experimental results show that our method outperforms classical steganographic methods in image quality, while preserving characteristics of histogram and providing high capacity.

3D pulsed chaos lidar system.

Science.gov (United States)

Cheng, Chih-Hao; Chen, Chih-Ying; Chen, Jun-Da; Pan, Da-Kung; Ting, Kai-Ting; Lin, Fan-Yi

2018-04-30

We develop an unprecedented 3D pulsed chaos lidar system for potential intelligent machinery applications. Benefited from the random nature of the chaos, conventional CW chaos lidars already possess excellent anti-jamming and anti-interference capabilities and have no range ambiguity. In our system, we further employ self-homodyning and time gating to generate a pulsed homodyned chaos to boost the energy-utilization efficiency. Compared to the original chaos, we show that the pulsed homodyned chaos improves the detection SNR by more than 20 dB. With a sampling rate of just 1.25 GS/s that has a native sampling spacing of 12 cm, we successfully achieve millimeter-level accuracy and precision in ranging. Compared with two commercial lidars tested side-by-side, namely the pulsed Spectroscan and the random-modulation continuous-wave Lidar-lite, the pulsed chaos lidar that is in compliance with the class-1 eye-safe regulation shows significantly better precision and a much longer detection range up to 100 m. Moreover, by employing a 2-axis MEMS mirror for active laser scanning, we also demonstrate real-time 3D imaging with errors of less than 4 mm in depth.

Many-Body Quantum Chaos and Entanglement in a Quantum Ratchet

Science.gov (United States)

Valdez, Marc Andrew; Shchedrin, Gavriil; Heimsoth, Martin; Creffield, Charles E.; Sols, Fernando; Carr, Lincoln D.

2018-06-01

We uncover signatures of quantum chaos in the many-body dynamics of a Bose-Einstein condensate-based quantum ratchet in a toroidal trap. We propose measures including entanglement, condensate depletion, and spreading over a fixed basis in many-body Hilbert space, which quantitatively identify the region in which quantum chaotic many-body dynamics occurs, where random matrix theory is limited or inaccessible. With these tools, we show that many-body quantum chaos is neither highly entangled nor delocalized in the Hilbert space, contrary to conventionally expected signatures of quantum chaos.

Bayesian inference of earthquake parameters from buoy data using a polynomial chaos-based surrogate

KAUST Repository

Giraldi, Loic

2017-04-07

This work addresses the estimation of the parameters of an earthquake model by the consequent tsunami, with an application to the Chile 2010 event. We are particularly interested in the Bayesian inference of the location, the orientation, and the slip of an Okada-based model of the earthquake ocean floor displacement. The tsunami numerical model is based on the GeoClaw software while the observational data is provided by a single DARTⓇ buoy. We propose in this paper a methodology based on polynomial chaos expansion to construct a surrogate model of the wave height at the buoy location. A correlated noise model is first proposed in order to represent the discrepancy between the computational model and the data. This step is necessary, as a classical independent Gaussian noise is shown to be unsuitable for modeling the error, and to prevent convergence of the Markov Chain Monte Carlo sampler. Second, the polynomial chaos model is subsequently improved to handle the variability of the arrival time of the wave, using a preconditioned non-intrusive spectral method. Finally, the construction of a reduced model dedicated to Bayesian inference is proposed. Numerical results are presented and discussed.

Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization

Science.gov (United States)

Yang, Dixiong; Liu, Zhenjun; Zhou, Jilei

2014-04-01

Chaos optimization algorithms (COAs) usually utilize the chaotic map like Logistic map to generate the pseudo-random numbers mapped as the design variables for global optimization. Many existing researches indicated that COA can more easily escape from the local minima than classical stochastic optimization algorithms. This paper reveals the inherent mechanism of high efficiency and superior performance of COA, from a new perspective of both the probability distribution property and search speed of chaotic sequences generated by different chaotic maps. The statistical property and search speed of chaotic sequences are represented by the probability density function (PDF) and the Lyapunov exponent, respectively. Meanwhile, the computational performances of hybrid chaos-BFGS algorithms based on eight one-dimensional chaotic maps with different PDF and Lyapunov exponents are compared, in which BFGS is a quasi-Newton method for local optimization. Moreover, several multimodal benchmark examples illustrate that, the probability distribution property and search speed of chaotic sequences from different chaotic maps significantly affect the global searching capability and optimization efficiency of COA. To achieve the high efficiency of COA, it is recommended to adopt the appropriate chaotic map generating the desired chaotic sequences with uniform or nearly uniform probability distribution and large Lyapunov exponent.

Complex Modified Hybrid Projective Synchronization of Different Dimensional Fractional-Order Complex Chaos and Real Hyper-Chaos

Directory of Open Access Journals (Sweden)

Jian Liu

2014-11-01

Full Text Available This paper introduces a type of modified hybrid projective synchronization with complex transformationmatrix (CMHPS for different dimensional fractional-order complex chaos and fractional-order real hyper-chaos. The transformationmatrix in this type of chaotic synchronization is a non-square matrix, and its elements are complex numbers. Based on the stability theory of fractional-order systems, by employing the feedback control technique, necessary and sufficient criteria on CMHPS are derived. Furthermore, CMHPS between fractional-order real hyper-chaotic Rössler system and other two different dimensional fractional-order complex Lorenz-like chaotic systems is provided as two examples to discuss reduced order and increased order synchronization, respectively.

Anticontrol of chaos in continuous-time systems via time-delay feedback.

Science.gov (United States)

Wang, Xiao Fan; Chen, Guanrong; Yu, Xinghuo

2000-12-01

In this paper, a systematic design approach based on time-delay feedback is developed for anticontrol of chaos in a continuous-time system. This anticontrol method can drive a finite-dimensional, continuous-time, autonomous system from nonchaotic to chaotic, and can also enhance the existing chaos of an originally chaotic system. Asymptotic analysis is used to establish an approximate relationship between a time-delay differential equation and a discrete map. Anticontrol of chaos is then accomplished based on this relationship and the differential-geometry control theory. Several examples are given to verify the effectiveness of the methodology and to illustrate the systematic design procedure. (c) 2000 American Institute of Physics.

Recent development of chaos theory in topological dynamics

OpenAIRE

Li, Jian; Ye, Xiangdong

2015-01-01

We give a summary on the recent development of chaos theory in topological dynamics, focusing on Li-Yorke chaos, Devaney chaos, distributional chaos, positive topological entropy, weakly mixing sets and so on, and their relationships.

A chaos wolf optimization algorithm with self-adaptive variable step-size

Directory of Open Access Journals (Sweden)

Yong Zhu

2017-10-01

Full Text Available To explore the problem of parameter optimization for complex nonlinear function, a chaos wolf optimization algorithm (CWOA with self-adaptive variable step-size was proposed. The algorithm was based on the swarm intelligence of wolf pack, which fully simulated the predation behavior and prey distribution way of wolves. It possessed three intelligent behaviors such as migration, summons and siege. And the competition rule as “winner-take-all” and the update mechanism as “survival of the fittest” were also the characteristics of the algorithm. Moreover, it combined the strategies of self-adaptive variable step-size search and chaos optimization. The CWOA was utilized in parameter optimization of twelve typical and complex nonlinear functions. And the obtained results were compared with many existing algorithms, including the classical genetic algorithm, the particle swarm optimization algorithm and the leader wolf pack search algorithm. The investigation results indicate that CWOA possess preferable optimization ability. There are advantages in optimization accuracy and convergence rate. Furthermore, it demonstrates high robustness and global searching ability.

A dynamically adaptive wavelet approach to stochastic computations based on polynomial chaos - capturing all scales of random modes on independent grids

International Nuclear Information System (INIS)

Ren Xiaoan; Wu Wenquan; Xanthis, Leonidas S.

2011-01-01

Highlights: → New approach for stochastic computations based on polynomial chaos. → Development of dynamically adaptive wavelet multiscale solver using space refinement. → Accurate capture of steep gradients and multiscale features in stochastic problems. → All scales of each random mode are captured on independent grids. → Numerical examples demonstrate the need for different space resolutions per mode. - Abstract: In stochastic computations, or uncertainty quantification methods, the spectral approach based on the polynomial chaos expansion in random space leads to a coupled system of deterministic equations for the coefficients of the expansion. The size of this system increases drastically when the number of independent random variables and/or order of polynomial chaos expansions increases. This is invariably the case for large scale simulations and/or problems involving steep gradients and other multiscale features; such features are variously reflected on each solution component or random/uncertainty mode requiring the development of adaptive methods for their accurate resolution. In this paper we propose a new approach for treating such problems based on a dynamically adaptive wavelet methodology involving space-refinement on physical space that allows all scales of each solution component to be refined independently of the rest. We exemplify this using the convection-diffusion model with random input data and present three numerical examples demonstrating the salient features of the proposed method. Thus we establish a new, elegant and flexible approach for stochastic problems with steep gradients and multiscale features based on polynomial chaos expansions.

Anti-control of chaos of single time scale brushless dc motors and chaos synchronization of different order systems

International Nuclear Information System (INIS)

Ge Zhengming; Chang Chingming; Chen Yensheng

2006-01-01

Anti-control of chaos of single time scale brushless dc motors (BLDCM) and chaos synchronization of different order systems are studied in this paper. By addition of an external nonlinear term, we can obtain anti-control of chaos. Then, by addition of the coupling terms, by the use of Lyapunov stability theorem and by the linearization of the error dynamics, chaos synchronization between a third-order BLDCM and a second-order Duffing system are presented

The joy of transient chaos

Energy Technology Data Exchange (ETDEWEB)

Tél, Tamás [Institute for Theoretical Physics, Eötvös University, and MTA-ELTE Theoretical Physics Research Group, Pázmány P. s. 1/A, Budapest H-1117 (Hungary)

2015-09-15

We intend to show that transient chaos is a very appealing, but still not widely appreciated, subfield of nonlinear dynamics. Besides flashing its basic properties and giving a brief overview of the many applications, a few recent transient-chaos-related subjects are introduced in some detail. These include the dynamics of decision making, dispersion, and sedimentation of volcanic ash, doubly transient chaos of undriven autonomous mechanical systems, and a dynamical systems approach to energy absorption or explosion.

The joy of transient chaos.

Science.gov (United States)

Tél, Tamás

2015-09-01

We intend to show that transient chaos is a very appealing, but still not widely appreciated, subfield of nonlinear dynamics. Besides flashing its basic properties and giving a brief overview of the many applications, a few recent transient-chaos-related subjects are introduced in some detail. These include the dynamics of decision making, dispersion, and sedimentation of volcanic ash, doubly transient chaos of undriven autonomous mechanical systems, and a dynamical systems approach to energy absorption or explosion.

Further discussion on chaos in duopoly games

International Nuclear Information System (INIS)

Lu, Tianxiu; Zhu, Peiyong

2013-01-01

In this paper, we study Li–Yorke chaos, distributional chaos in a sequence, Li–Yorke sensitivity, sensitivity and distributional chaos of two-dimensional dynamical system of the form Φ(x, y) = (f(y), g(x))

2012 Symposium on Chaos, Complexity and Leadership

CERN Document Server

Erçetin, Şefika

2014-01-01

These proceedings from the 2012 symposium on "Chaos, complexity and leadership"  reflect current research results from all branches of Chaos, Complex Systems and their applications in Management. Included are the diverse results in the fields of applied nonlinear methods, modeling of data and simulations, as well as theoretical achievements of Chaos and Complex Systems. Also highlighted are  Leadership and Management applications of Chaos and Complexity Theory.

The CHAOS-4 Geomagnetic Field Model

DEFF Research Database (Denmark)

Olsen, Nils; Finlay, Chris; Lühr, H.

We present CHAOS-4, a new version in the CHAOS model series, which aims at describing the Earth's magnetic field with high spatial resolution (terms up to spherical degree n=90 for the crustal field, and up to n=16 for the time-varying core field are robustly determined) and high temporal...... between the coordinate systems of the vector magnetometer and of the star sensor providing attitude information). The final CHAOS-4 model is derived by merging two sub-models: its low-degree part has been obtained using similar model parameterization and data sets as used for previous CHAOS models (but...

Nonlinear chaos control and synchronization

NARCIS (Netherlands)

Huijberts, H.J.C.; Nijmeijer, H.; Schöll, E.; Schuster, H.G.

2007-01-01

This chapter contains sections titled: Introduction Nonlinear Geometric Control Some Differential Geometric Concepts Nonlinear Controllability Chaos Control Through Feedback Linearization Chaos Control Through Input-Output Linearization Lyapunov Design Lyapunov Stability and Lyapunov's First Method

A stable-manifold-based method for chaos control and synchronization

International Nuclear Information System (INIS)

Chen Shihua; Zhang Qunjiao; Xie Jin; Wang Changping

2004-01-01

A stable-manifold-based method is proposed for chaos control and synchronization. The novelty of this new and effective method lies in that, once the suitable stable manifold according to the desired dynamic properties is constructed, the goal of control is only to force the system state to lie on the selected stable manifold because once the stable manifold is reached, the chaotic system will be guided towards the desired target. The effectiveness of the approach and idea is tested by stabilizing the Newton-Leipnik chaotic system which possesses more than one strange attractor and by synchronizing the unified chaotic system which unifies both the Lorenz system and the Chen system

Chaos-based CAZAC scheme for secure transmission in OFDM-PON

Science.gov (United States)

Fu, Xiaosong; Bi, Meihua; Zhou, Xuefang; Yang, Guowei; Lu, Yang; Hu, Miao

2018-01-01

To effectively resist malicious eavesdropping and performance deterioration, a novel chaos-based secure transmission scheme is proposed to enhance the physical layer security and reduce peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing passive optical network (OFDM-PON). By the randomly extracting operation of common CAZAC values, the specially-designed constant amplitude zero autocorrelation (CAZAC) is created for system encryption and PAPR reduction enhancing the transmission security. This method is verified in {10-Gb/s encrypted OFDM-PON with 20-km fiber transmission. Results show that, compared to common OFDM-PON, our scheme achieves {3-dB PAPR reduction and {1-dB receiver sensitivity improvement.

Using chaos theory: the implications for nursing.

Science.gov (United States)

Haigh, Carol

2002-03-01

The purpose of this paper is to review chaos theory and to examine the role that it may have in the discipline of nursing. In this paper, the fundamental ingredients of chaotic thinking are outlined. The earlier days of chaos thinking were characterized by an almost exclusively physiological focus. By the 21st century, nurse theorists were applying its principles to the organization and evaluation of care delivery with varying levels of success. Whilst the biological use of chaos has focused on pragmatic approaches to knowledge enhancement, nursing has often focused on the mystical aspects of chaos as a concept. The contention that chaos theory has yet to find a niche within nursing theory and practice is examined. The application of chaotic thinking across nursing practice, nursing research and statistical modelling is reviewed. The use of chaos theory as a way of identifying the attractor state of specific systems is considered and the suggestion is made that it is within statistical modelling of services that chaos theory is most effective.

Hyper-chaos encryption using convolutional masking and model free unmasking

International Nuclear Information System (INIS)

Qi Guo-Yuan; Matondo Sandra Bazebo

2014-01-01

In this paper, during the masking process the encrypted message is convolved and embedded into a Qi hyper-chaotic system characterizing a high disorder degree. The masking scheme was tested using both Qi hyper-chaos and Lorenz chaos and indicated that Qi hyper-chaos based masking can resist attacks of the filtering and power spectrum analysis, while the Lorenz based scheme fails for high amplitude data. To unmask the message at the receiving end, two methods are proposed. In the first method, a model-free synchronizer, i.e. a multivariable higher-order differential feedback controller between the transmitter and receiver is employed to de-convolve the message embedded in the receiving signal. In the second method, no synchronization is required since the message is de-convolved using the information of the estimated derivative. (general)

Quantum chaos: Statistical relaxation in discrete spectrum

International Nuclear Information System (INIS)

Chirikov, B.V.

1991-01-01

The controversial phenomenon of quantum chaos is discussed using the quantized standard map, or the kicked rotator, as a simple model. The relation to the classical dynamical chaos is tracked down on the basis of the correspondence principle. Various mechanisms of the quantum suppression of classical chaos are considered with an application to the excitation and ionization of Rydberg atoms in a microwave field. Several definitions of the quantum chaos are discussed. (author). 27 refs

Chaotic operation and chaos control of travelling wave ultrasonic motor.

Science.gov (United States)

Shi, Jingzhuo; Zhao, Fujie; Shen, Xiaoxi; Wang, Xiaojie

2013-08-01

The travelling wave ultrasonic motor, which is a nonlinear dynamic system, has complex chaotic phenomenon with some certain choices of system parameters and external inputs, and its chaotic characteristics have not been studied until now. In this paper, the preliminary study of the chaos phenomenon in ultrasonic motor driving system has been done. The experiment of speed closed-loop control is designed to obtain several groups of time sampling data sequence of the amplitude of driving voltage, and phase-space reconstruction is used to analyze the chaos characteristics of these time sequences. The largest Lyapunov index is calculated and the result is positive, which shows that the travelling wave ultrasonic motor has chaotic characteristics in a certain working condition Then, the nonlinear characteristics of travelling wave ultrasonic motor are analyzed which includes Lyapunov exponent map, the bifurcation diagram and the locus of voltage relative to speed based on the nonlinear chaos model of a travelling wave ultrasonic motor. After that, two kinds of adaptive delay feedback controllers are designed in this paper to control and suppress chaos in USM speed control system. Simulation results show that the method can control unstable periodic orbits, suppress chaos in USM control system. Proportion-delayed feedback controller was designed following and arithmetic of fuzzy logic was used to adaptively adjust the delay time online. Simulation results show that this method could fast and effectively change the chaos movement into periodic or fixed-point movement and make the system enter into stable state from chaos state. Finally the chaos behavior was controlled. Copyright © 2013 Elsevier B.V. All rights reserved.

Chaos control in delayed chaotic systems via sliding mode based delayed feedback

Energy Technology Data Exchange (ETDEWEB)

Vasegh, Nastaran [Faculty of Electrical Engineering, K.N. Toosi University of Technology, Seyed Khandan Bridge, Shariati St. 16314, P.O. Box 16315-1355, Tehran (Iran, Islamic Republic of)], E-mail: vasegh@eetd.kntu.ac.ir; Sedigh, Ali Khaki [Faculty of Electrical Engineering, K.N. Toosi University of Technology, Seyed Khandan Bridge, Shariati St. 16314, P.O. Box 16315-1355, Tehran (Iran, Islamic Republic of)

2009-04-15

This paper investigates chaos control for scalar delayed chaotic systems using sliding mode control strategy. Sliding surface design is based on delayed feedback controller. It is shown that the proposed controller can achieve stability for an arbitrary unstable fixed point (UPF) or unstable periodic orbit (UPO) with arbitrary period. The chaotic system used in this study to illustrate the theoretical concepts is the well known Mackey-Glass model. Simulation results show the effectiveness of the designed nonlinear sliding mode controller.

Chaos control in delayed chaotic systems via sliding mode based delayed feedback

International Nuclear Information System (INIS)

Vasegh, Nastaran; Sedigh, Ali Khaki

2009-01-01

This paper investigates chaos control for scalar delayed chaotic systems using sliding mode control strategy. Sliding surface design is based on delayed feedback controller. It is shown that the proposed controller can achieve stability for an arbitrary unstable fixed point (UPF) or unstable periodic orbit (UPO) with arbitrary period. The chaotic system used in this study to illustrate the theoretical concepts is the well known Mackey-Glass model. Simulation results show the effectiveness of the designed nonlinear sliding mode controller.

Chaos - a new degree of freedom in nuclear physics

International Nuclear Information System (INIS)

Besliu, Calin.; Jipa, Alexandru; Felea, Daniel

2002-01-01

Before 1985 the chaos representation and its dynamics was known as a mathematical construction generated by the solution instability for the coupled nonlinear differential equations. A number of important needs (the temporal scenarios, a stochastic time scale for nuclear processes, separation between the breakup and statistical processes, nuclear phase transitions at high and very high energies, etc.) determines a focused effort to adapt the chaos theory as a tool for the nuclear physics. In this list, essentially is the distinction between the nonequilibrium and equilibrium states and its general and local balance. The authors report an attempt to introduce the chaos representation in the first stage of the nuclear fragmentation. The trajectories lead to a chaotic behavior at the resonance regime in all cases analyzed. A number of stochastic functions (the Lyapunov exponents, the power functions, the autocorrelation coefficients and the Shannon and Kolmogorov informational entropies) verified the main conclusion. This model, usually called as the 'game of billiards', as studied in the resonance regime, is more realistic than the adiabatic case studied by the Catania-Grenoble group (Burgio, Baldo, Rapisarda, Schuck) which represents the first step for this kind of analysis. A number of properties connected to the chaotic behaviour were related, among them, the influence of the multipolarity of the nuclear barrier on the time required in order to notice the onset of the chaotic behaviour. Also, the connections between the Shannon entropy and chaos suggest the existence of a number of quasi-equilibrium states. (authors)

An Efficient Big Data Anonymization Algorithm Based on Chaos and Perturbation Techniques

Directory of Open Access Journals (Sweden)

Can Eyupoglu

2018-05-01

Full Text Available The topic of big data has attracted increasing interest in recent years. The emergence of big data leads to new difficulties in terms of protection models used for data privacy, which is of necessity for sharing and processing data. Protecting individuals’ sensitive information while maintaining the usability of the data set published is the most important challenge in privacy preserving. In this regard, data anonymization methods are utilized in order to protect data against identity disclosure and linking attacks. In this study, a novel data anonymization algorithm based on chaos and perturbation has been proposed for privacy and utility preserving in big data. The performance of the proposed algorithm is evaluated in terms of Kullback–Leibler divergence, probabilistic anonymity, classification accuracy, F-measure and execution time. The experimental results have shown that the proposed algorithm is efficient and performs better in terms of Kullback–Leibler divergence, classification accuracy and F-measure compared to most of the existing algorithms using the same data set. Resulting from applying chaos to perturb data, such successful algorithm is promising to be used in privacy preserving data mining and data publishing.

Torus Destruction and Chaos-Chaos Intermittency in a Commodity Distribution Chain

DEFF Research Database (Denmark)

Sosnovtseva, O.; Mosekilde, Erik

1997-01-01

The destruction of two-dimensional tori T2 and the transitions to chaos are studied in a high-dimensional model describing the decision-making behavior of human subjects in a simulated managerial environment (the beer production-distribution model). Two different routes from quasiperiodicity...... to chaos can be distinguished. Intermittency transitions between chaotic and hyperchaotic attractors are characterized, and transients in which the system "pursues the ghost" of a vanished hyperchaotic attractor are studied....

Chaos Modelling with Computers

Indian Academy of Sciences (India)

Chaos is one of the major scientific discoveries of our times. In fact many scientists ... But there are other natural phenomena that are not predictable though ... characteristics of chaos. ... The position and velocity are all that are needed to determine the motion of a .... a system of equations that modelled the earth's weather ...

Self-generation and management of spin-electromagnetic wave solitons and chaos

International Nuclear Information System (INIS)

Ustinov, Alexey B.; Kondrashov, Alexandr V.; Nikitin, Andrey A.; Kalinikos, Boris A.

2014-01-01

Self-generation of microwave spin-electromagnetic wave envelope solitons and chaos has been observed and studied. For the investigation, we used a feedback active ring oscillator based on artificial multiferroic, which served as a nonlinear waveguide. We show that by increasing the wave amplification in the feedback ring circuit, a transition from monochromatic auto-generation to soliton train waveform and then to dynamical chaos occurs in accordance with the Ruelle-Takens scenario. Management of spin-electromagnetic-wave solitons and chaos parameters by both dielectric permittivity and magnetic permeability of the multiferroic waveguiding structure is demonstrated.

Comparison of Various Similarity Measures for Average Image Hash in Mobile Phone Application

Science.gov (United States)

Farisa Chaerul Haviana, Sam; Taufik, Muhammad

2017-04-01

One of the main issue in Content Based Image Retrieval (CIBR) is similarity measures for resulting image hashes. The main key challenge is to find the most benefits distance or similarity measures for calculating the similarity in term of speed and computing costs, specially under limited computing capabilities device like mobile phone. This study we utilize twelve most common and popular distance or similarity measures technique implemented in mobile phone application, to be compared and studied. The results show that all similarity measures implemented in this study was perform equally under mobile phone application. This gives more possibilities for method combinations to be implemented for image retrieval.

Quasiperiodic transition to chaos in a plasma

International Nuclear Information System (INIS)

Weixing, D.; Huang Wei; Wang Xiaodong; Yu, C.X.

1993-01-01

The quasiperiodic transition to chaos in an undriven discharge plasma has been investigated. Results from the power spectrum and Lyapunov exponents quantitatively confirm the transition to chaos through quasiperiodicity. A low-dimension strange attractor has been found for this kind of plasma chaos

Towards chaos criterion in quantum field theory

OpenAIRE

Kuvshinov, V. I.; Kuzmin, A. V.

2002-01-01

Chaos criterion for quantum field theory is proposed. Its correspondence with classical chaos criterion in semi-classical regime is shown. It is demonstrated for real scalar field that proposed chaos criterion can be used to investigate stability of classical solutions of field equations.

Semiconductor Lasers Stability, Instability and Chaos

CERN Document Server

Ohtsubo, Junji

2013-01-01

This third edition of “Semiconductor Lasers, Stability, Instability and Chaos” was significantly extended.  In the previous edition, the dynamics and characteristics of chaos in semiconductor lasers after the introduction of the fundamental theory of laser chaos and chaotic dynamics induced by self-optical feedback and optical injection was discussed. Semiconductor lasers with new device structures, such as vertical-cavity surface-emitting lasers and broad-area semiconductor lasers, are interesting devices from the viewpoint of chaotic dynamics since they essentially involve chaotic dynamics even in their free-running oscillations. These topics are also treated with respect to the new developments in the current edition. Also the control of such instabilities and chaos control are critical issues for applications. Another interesting and important issue of semiconductor laser chaos in this third edition is chaos synchronization between two lasers and the application to optical secure communication. One o...

The CHAOS-4 geomagnetic field model

DEFF Research Database (Denmark)

Olsen, Nils; Lühr, H.; Finlay, Chris

2014-01-01

We present CHAOS-4, a new version in the CHAOS model series, which aims to describe the Earth's magnetic field with high spatial and temporal resolution. Terms up to spherical degree of at least n = 85 for the lithospheric field, and up to n = 16 for the time-varying core field are robustly...... to the core field, but the high-degree lithospheric field is regularized for n > 85. CHAOS-4 model is derived by merging two submodels: its low-degree part has been derived using similar model parametrization and data sets as used for previous CHAOS models (but of course including more recent data), while its...

Nonlinear dynamics and quantum chaos an introduction

CERN Document Server

Wimberger, Sandro

2014-01-01

The field of nonlinear dynamics and chaos has grown very much over the last few decades and is becoming more and more relevant in different disciplines. This book presents a clear and concise introduction to the field of nonlinear dynamics and chaos, suitable for graduate students in mathematics, physics, chemistry, engineering, and in natural sciences in general. It provides a thorough and modern introduction to the concepts of Hamiltonian dynamical systems' theory combining in a comprehensive way classical and quantum mechanical description. It covers a wide range of topics usually not found in similar books. Motivations of the respective subjects and a clear presentation eases the understanding. The book is based on lectures on classical and quantum chaos held by the author at Heidelberg University. It contains exercises and worked examples, which makes it ideal for an introductory course for students as well as for researchers starting to work in the field.

Review of Polynomial Chaos-Based Methods for Uncertainty Quantification in Modern Integrated Circuits

OpenAIRE

Arun Kaintura; Tom Dhaene; Domenico Spina

2018-01-01

Advances in manufacturing process technology are key ensembles for the production of integrated circuits in the sub-micrometer region. It is of paramount importance to assess the effects of tolerances in the manufacturing process on the performance of modern integrated circuits. The polynomial chaos expansion has emerged as a suitable alternative to standard Monte Carlo-based methods that are accurate, but computationally cumbersome. This paper provides an overview of the most recent developm...

Staircase functions, spectral regidity and a rule for quantizing chaos

International Nuclear Information System (INIS)

Aurich, R.; Steiner, F.

1991-07-01

Considering the Selberg trace formula as an exact version of Gutzwiller's semiclassical periodic-orbit theory in the case of the free motion on compact Riemann surfaces with constant negative curvature (Hadamard-Gutzwiller model), we study two complementary basic problems in quantum chaology: the computation of the calssical staircase N(l), the number of periodic orbits with length shorter than l, in terms of the quantal energy spectrum {E n }, the computation of the spectral staircase N (E), the number of quantal energies below the energy E, in terms of the length spectrum {l n } of the classical periodic orbits. A formulation of the periodic-orbit theory is presented which is intrinsically unsmoothed, but for which an effective smoothing arises from the limited 'input data', i.e. from the limited knowledge of the periodic orbits in the case of N(E) and the limited knowledge of quantal energies in the case of N(l). Based on the periodic-orbit formula for N(E), we propose a new rule for quantizing chaos, which simply states that the quantal energies are determined by the zeros of the function ξ 1 (E) = cos (πN(E)). The formulas for N(l) and N(E) as well as the new quantization condition are tested numerically. Furthermore, it is shown that the staircase N(E) computed from the length spectrum yields (up to a constant) a good description of the spectral rigidity Δ 3 (L), being the first numerical attempt to compute a statistical property of the quantal energy spectrum of a chaotic system from classical periodic orbits. (orig.)

Refined repetitive sequence searches utilizing a fast hash function and cross species information retrievals

Directory of Open Access Journals (Sweden)

Reneker Jeff

2005-05-01

Full Text Available Abstract Background Searching for small tandem/disperse repetitive DNA sequences streamlines many biomedical research processes. For instance, whole genomic array analysis in yeast has revealed 22 PHO-regulated genes. The promoter regions of all but one of them contain at least one of the two core Pho4p binding sites, CACGTG and CACGTT. In humans, microsatellites play a role in a number of rare neurodegenerative diseases such as spinocerebellar ataxia type 1 (SCA1. SCA1 is a hereditary neurodegenerative disease caused by an expanded CAG repeat in the coding sequence of the gene. In bacterial pathogens, microsatellites are proposed to regulate expression of some virulence factors. For example, bacteria commonly generate intra-strain diversity through phase variation which is strongly associated with virulence determinants. A recent analysis of the complete sequences of the Helicobacter pylori strains 26695 and J99 has identified 46 putative phase-variable genes among the two genomes through their association with homopolymeric tracts and dinucleotide repeats. Life scientists are increasingly interested in studying the function of small sequences of DNA. However, current search algorithms often generate thousands of matches – most of which are irrelevant to the researcher. Results We present our hash function as well as our search algorithm to locate small sequences of DNA within multiple genomes. Our system applies information retrieval algorithms to discover knowledge of cross-species conservation of repeat sequences. We discuss our incorporation of the Gene Ontology (GO database into these algorithms. We conduct an exhaustive time analysis of our system for various repetitive sequence lengths. For instance, a search for eight bases of sequence within 3.224 GBases on 49 different chromosomes takes 1.147 seconds on average. To illustrate the relevance of the search results, we conduct a search with and without added annotation terms for the

Hardware Realization of Chaos-based Symmetric Video Encryption

KAUST Repository

Ibrahim, Mohamad A.

2013-05-01

This thesis reports original work on hardware realization of symmetric video encryption using chaos-based continuous systems as pseudo-random number generators. The thesis also presents some of the serious degradations caused by digitally implementing chaotic systems. Subsequently, some techniques to eliminate such defects, including the ultimately adopted scheme are listed and explained in detail. Moreover, the thesis describes original work on the design of an encryption system to encrypt MPEG-2 video streams. Information about the MPEG-2 standard that fits this design context is presented. Then, the security of the proposed system is exhaustively analyzed and the performance is compared with other reported systems, showing superiority in performance and security. The thesis focuses more on the hardware and the circuit aspect of the system’s design. The system is realized on Xilinx Vetrix-4 FPGA with hardware parameters and throughput performance surpassing conventional encryption systems.

The design and research of anti-color-noise chaos M-ary communication system

Energy Technology Data Exchange (ETDEWEB)

Fu, Yongqing, E-mail: fuyongqing@hrbeu.edu.cn; Li, Xingyuan; Li, Yanan [College of information and Communication Engineering, Harbin Engineering University, Harbin 150001 (China); Zhang, Lin [College of Underwater Acoustic Engineering, Harbin Engineering University, Harbin 150001 (China)

2016-03-15

Previously a novel chaos M-ary digital communication method based on spatiotemporal chaos Hamilton oscillator has been proposed. Without chaos synchronization circumstance, it has performance improvement in bandwidth efficiency, transmission efficiency and anti-white-noise performance compared with traditional communication method. In this paper, the channel noise influence on chaotic modulation signals and the construction problem of anti-color-noise chaotic M-ary communication system are studied. The formula of zone partition demodulator’s boundary in additive white Gaussian noise is derived, besides, the problem about how to determine the boundary of zone partition demodulator in additive color noise is deeply studied; Then an approach on constructing anti-color-noise chaos M-ary communication system is proposed, in which a pre-distortion filter is added after the chaos baseband modulator in the transmitter and whitening filter is added before zone partition demodulator in the receiver. Finally, the chaos M-ary communication system based on Hamilton oscillator is constructed and simulated in different channel noise. The result shows that the proposed method in this paper can improve the anti-color-noise performance of the whole communication system compared with the former system, and it has better anti-fading and resisting disturbance performance than Quadrature Phase Shift Keying system.

The design and research of anti-color-noise chaos M-ary communication system

International Nuclear Information System (INIS)

Fu, Yongqing; Li, Xingyuan; Li, Yanan; Zhang, Lin

2016-01-01

Previously a novel chaos M-ary digital communication method based on spatiotemporal chaos Hamilton oscillator has been proposed. Without chaos synchronization circumstance, it has performance improvement in bandwidth efficiency, transmission efficiency and anti-white-noise performance compared with traditional communication method. In this paper, the channel noise influence on chaotic modulation signals and the construction problem of anti-color-noise chaotic M-ary communication system are studied. The formula of zone partition demodulator’s boundary in additive white Gaussian noise is derived, besides, the problem about how to determine the boundary of zone partition demodulator in additive color noise is deeply studied; Then an approach on constructing anti-color-noise chaos M-ary communication system is proposed, in which a pre-distortion filter is added after the chaos baseband modulator in the transmitter and whitening filter is added before zone partition demodulator in the receiver. Finally, the chaos M-ary communication system based on Hamilton oscillator is constructed and simulated in different channel noise. The result shows that the proposed method in this paper can improve the anti-color-noise performance of the whole communication system compared with the former system, and it has better anti-fading and resisting disturbance performance than Quadrature Phase Shift Keying system.

Chaos synchronization in vertical-cavity surface-emitting laser based on rotated polarization-preserved optical feedback.

Science.gov (United States)

Nazhan, Salam; Ghassemlooy, Zabih; Busawon, Krishna

2016-01-01

In this paper, the influence of the rotating polarization-preserved optical feedback on the chaos synchronization of a vertical-cavity surface-emitting laser (VCSEL) is investigated experimentally. Two VCSELs' polarization modes (XP) and (YP) are gradually rotated and re-injected back into the VCSEL. The anti-phase dynamics synchronization of the two polarization modes is evaluated using the cross-correlation function. For a fixed optical feedback, a clear relationship is found between the cross-correlation coefficient and the polarization angle θp. It is shown that high-quality anti-phase polarization-resolved chaos synchronization is achieved at higher values of θp. The maximum value of the cross-correlation coefficient achieved is -0.99 with a zero time delay over a wide range of θp beyond 65° with a poor synchronization dynamic at θp less than 65°. Furthermore, it is observed that the antiphase irregular oscillation of the XP and YP modes changes with θp. VCSEL under the rotating polarization optical feedback can be a good candidate as a chaotic synchronization source for a secure communication system.

A model of quantum communication device for quantum hashing

International Nuclear Information System (INIS)

Vasiliev, A

2016-01-01

In this paper we consider a model of quantum communications between classical computers aided with quantum processors, connected by a classical and a quantum channel. This type of communications implying both classical and quantum messages with moderate use of quantum processing is implicitly used in many quantum protocols, such as quantum key distribution or quantum digital signature. We show that using the model of a quantum processor on multiatomic ensembles in the common QED cavity we can speed up quantum hashing, which can be the basis of quantum digital signature and other communication protocols. (paper)

Chaos Time Series Prediction Based on Membrane Optimization Algorithms

Directory of Open Access Journals (Sweden)

Meng Li

2015-01-01

Full Text Available This paper puts forward a prediction model based on membrane computing optimization algorithm for chaos time series; the model optimizes simultaneously the parameters of phase space reconstruction (τ,m and least squares support vector machine (LS-SVM (γ,σ by using membrane computing optimization algorithm. It is an important basis for spectrum management to predict accurately the change trend of parameters in the electromagnetic environment, which can help decision makers to adopt an optimal action. Then, the model presented in this paper is used to forecast band occupancy rate of frequency modulation (FM broadcasting band and interphone band. To show the applicability and superiority of the proposed model, this paper will compare the forecast model presented in it with conventional similar models. The experimental results show that whether single-step prediction or multistep prediction, the proposed model performs best based on three error measures, namely, normalized mean square error (NMSE, root mean square error (RMSE, and mean absolute percentage error (MAPE.

Fourier analysis of nonself-averaging quasiperiodic oscillations in the excitation functions of dissipative heavy-ion collisions: quantum chaos in dissipative heavy-ion collisions?

International Nuclear Information System (INIS)

Kun, S.Yu.; Australian Nat. Univ., Canberra; Australian National Univ., Canberra, ACT

1997-01-01

We employ stochastic modelling of statistical reactions with memory to study quasiperiodic oscillations in the excitation functions of dissipative heavy-ion collisions. The Fourier analysis of excitation function oscillations is presented. It suggests that S-matrix spin and parity decoherence, damping of the coherent nuclear rotation and quantum chaos are sufficient conditions to explain the nonself-averaging of quasiperiodic oscillations in the excitation functions of dissipative heavy-ion collisions. (orig.)

4th international interdisciplinary chaos symposium

CERN Document Server

Banerjee, Santo; Caglar, Suleyman; Ozer, Mehmet; Chaos and complex systems

2013-01-01

Complexity Science and Chaos Theory are fascinating areas of scientific research with wide-ranging applications.  The interdisciplinary nature and ubiquity of complexity and chaos are features that provides scientists with a motivation to pursue general theoretical tools and frameworks. Complex systems give rise to emergent behaviors, which in turn produce novel and interesting phenomena in science, engineering, as well as in the socio-economic sciences. The aim of all Symposia on Chaos and Complex Systems (CCS) is to bring together scientists, engineers, economists and social scientists, and to discuss the latest insights and results obtained in the area of corresponding nonlinear-system complex (chaotic) behavior. Especially for the “4th International Interdisciplinary Chaos Symposium on Chaos and Complex Systems,” which took place April 29th to May 2nd, 2012 in Antalya, Turkey, the scope of the symposium had been further enlarged so as to encompass the presentation of work from circuits to econophysic...

Chaos to periodicity and periodicity to chaos by periodic perturbations in the Belousov-Zhabotinsky reaction

International Nuclear Information System (INIS)

Li Qianshu; Zhu Rui

2004-01-01

A three-variable model of the Belousov-Zhabotinsky reaction system subject to external sinusoidal perturbations is investigated by means of frequency spectrum analysis. In the period-1 window of the model, the transitions from periodicity to chaos are observed; in the chaotic window, the transitions from chaos to periodicity are found. The former might be understood by the circle map of two coupled oscillators, and the latter is partly explained by the resonance between the main frequency of the chaos and the frequency of the external periodic perturbations

Parrondo’s paradox for chaos control and anticontrol of fractional-order systems

International Nuclear Information System (INIS)

Danca, Marius-F; Tang, Wallace K S

2016-01-01

We present the generalized forms of Parrondo’s paradox existing in fractional-order nonlinear systems. The generalization is implemented by applying a parameter switching (PS) algorithm to the corresponding initial value problems associated with the fractional-order nonlinear systems. The PS algorithm switches a system parameter within a specific set of N ≥ 2 values when solving the system with some numerical integration method. It is proven that any attractor of the concerned system can be approximated numerically. By replacing the words “winning” and “loosing” in the classical Parrondo’s paradox with “order” and “chaos', respectively, the PS algorithm leads to the generalized Parrondo’s paradox: chaos 1 + chaos 2 + ··· + chaos N = order and order 1 + order 2 + ··· + order N = chaos. Finally, the concept is well demonstrated with the results based on the fractional-order Chen system. (paper)

Global chaos synchronization of three coupled nonlinear autonomous systems and a novel method of chaos encryption

International Nuclear Information System (INIS)

An Xinlei; Yu Jianning; Chu Yandong; Zhang Jiangang; Zhang Li

2009-01-01

In this paper, we discussed the fixed points and their linear stability of a new nonlinear autonomous system that introduced by J.C. Sprott. Based on Lyapunov stabilization theorem, a global chaos synchronization scheme of three coupled identical systems is investigated. By choosing proper coupling parameters, the states of all the three systems can be synchronized. Then this method was applied to secure communication through chaotic masking, used three coupled identical systems, propose a novel method of chaos encryption, after encrypting in the previous two transmitters, information signal can be recovered exactly at the receiver end. Simulation results show that the method can realize monotonous synchronization. Further more, the information signal can be recovered undistorted when applying this method to secure communication.

Quantum chaos: statistical relaxation in discrete spectrum

International Nuclear Information System (INIS)

Chirikov, B.V.

1990-01-01

The controversial phenomenon of quantum chaos is discussed using the quantized standard map, or the kicked rotator, as a simple model. The relation to the classical dynamical chaos is tracked down on the basis of the correspondence principle. Several definitions of the quantum chaos are discussed. 27 refs

Scaling of chaos in strongly nonlinear lattices.

Science.gov (United States)

Mulansky, Mario

2014-06-01

Although it is now understood that chaos in complex classical systems is the foundation of thermodynamic behavior, the detailed relations between the microscopic properties of the chaotic dynamics and the macroscopic thermodynamic observations still remain mostly in the dark. In this work, we numerically analyze the probability of chaos in strongly nonlinear Hamiltonian systems and find different scaling properties depending on the nonlinear structure of the model. We argue that these different scaling laws of chaos have definite consequences for the macroscopic diffusive behavior, as chaos is the microscopic mechanism of diffusion. This is compared with previous results on chaotic diffusion [M. Mulansky and A. Pikovsky, New J. Phys. 15, 053015 (2013)], and a relation between microscopic chaos and macroscopic diffusion is established.

Ancient and Current Chaos Theories

Directory of Open Access Journals (Sweden)

Güngör Gündüz

2006-07-01

Full Text Available Chaos theories developed in the last three decades have made very important contributions to our understanding of dynamical systems and natural phenomena. The meaning of chaos in the current theories and in the past is somewhat different from each other. In this work, the properties of dynamical systems and the evolution of chaotic systems were discussed in terms of the views of ancient philosophers. The meaning of chaos in Anaximenes’ philosophy and its role in the Ancient natural philosophy has been discussed in relation to other natural philosophers such as of Anaximander, Parmenides, Heraclitus, Empedocles, Leucippus (i.e. atomists and Aristotle. In addition, the fundamental concepts of statistical mechanics and the current chaos theories were discussed in relation to the views in Ancient natural philosophy. The roots of the scientific concepts such as randomness, autocatalysis, nonlinear growth, information, pattern, etc. in the Ancient natural philosophy were investigated.

A Heuristic Approach to Intra-Brain Communications Using Chaos in a Recurrent Neural Network Model

Science.gov (United States)

Soma, Ken-ichiro; Mori, Ryota; Sato, Ryuichi; Nara, Shigetoshi

2011-09-01

To approach functional roles of chaos in brain, a heuristic model to consider mechanisms of intra-brain communications is proposed. The key idea is to use chaos in firing pattern dynamics of a recurrent neural network consisting of birary state neurons, as propagation medium of pulse signals. Computer experiments and numerical methods are introduced to evaluate signal transport characteristics by calculating correlation functions between sending neurons and receiving neurons of pulse signals.

Public-channel cryptography based on mutual chaos pass filters.

Science.gov (United States)

Klein, Einat; Gross, Noam; Kopelowitz, Evi; Rosenbluh, Michael; Khaykovich, Lev; Kinzel, Wolfgang; Kanter, Ido

2006-10-01

We study the mutual coupling of chaotic lasers and observe both experimentally and in numeric simulations that there exists a regime of parameters for which two mutually coupled chaotic lasers establish isochronal synchronization, while a third laser coupled unidirectionally to one of the pair does not synchronize. We then propose a cryptographic scheme, based on the advantage of mutual coupling over unidirectional coupling, where all the parameters of the system are public knowledge. We numerically demonstrate that in such a scheme the two communicating lasers can add a message signal (compressed binary message) to the transmitted coupling signal and recover the message in both directions with high fidelity by using a mutual chaos pass filter procedure. An attacker, however, fails to recover an errorless message even if he amplifies the coupling signal.

Efficient image or video encryption based on spatiotemporal chaos system

International Nuclear Information System (INIS)

Lian Shiguo

2009-01-01

In this paper, an efficient image/video encryption scheme is constructed based on spatiotemporal chaos system. The chaotic lattices are used to generate pseudorandom sequences and then encrypt image blocks one by one. By iterating chaotic maps for certain times, the generated pseudorandom sequences obtain high initial-value sensitivity and good randomness. The pseudorandom-bits in each lattice are used to encrypt the Direct Current coefficient (DC) and the signs of the Alternating Current coefficients (ACs). Theoretical analysis and experimental results show that the scheme has good cryptographic security and perceptual security, and it does not affect the compression efficiency apparently. These properties make the scheme a suitable choice for practical applications.

Many-body quantum chaos: Recent developments and applications to nuclei

International Nuclear Information System (INIS)

Gomez, J.M.G.; Kar, K.; Kota, V.K.B.; Molina, R.A.; Relano, A.; Retamosa, J.

2011-01-01

In the last decade, there has been an increasing interest in the analysis of energy level spectra and wave functions of nuclei, particles, atoms and other quantum many-body systems by means of statistical methods and random matrix ensembles. The concept of quantum chaos plays a central role for understanding the universal properties of the energy spectrum of quantum systems. Since these properties concern the whole spectrum, statistical methods become an essential tool. Besides random matrix theory, new theoretical developments making use of information theory, time series analysis, and the merging of thermodynamics and the semiclassical approximation are emphasized. Applications of these methods to quantum systems, especially to atomic nuclei, are reviewed. We focus on recent developments like the study of 'imperfect spectra' to estimate the degree of symmetry breaking or the fraction of missing levels, the existence of chaos remnants in nuclear masses, the onset of chaos in nuclei, and advances in the comprehension of the Hamiltonian structure in many-body systems. Finally, some applications of statistical spectroscopy methods generated by many-body chaos and two-body random matrix ensembles are described, with emphasis on Gamow-Teller strength sums and beta decay rates for stellar evolution and supernovae.

Colored chaos

International Nuclear Information System (INIS)

Mueller, B.

1997-01-01

The report contains viewgraphs on the following: ergodicity and chaos; Hamiltonian dynamics; metric properties; Lyapunov exponents; KS entropy; dynamical realization; lattice formulation; and numerical results

Colored chaos

Energy Technology Data Exchange (ETDEWEB)

Mueller, B.

1997-09-22

The report contains viewgraphs on the following: ergodicity and chaos; Hamiltonian dynamics; metric properties; Lyapunov exponents; KS entropy; dynamical realization; lattice formulation; and numerical results.

Chaos synchronization of a chaotic system via nonlinear control

International Nuclear Information System (INIS)

Park, Ju H.

2005-01-01

In this letter, the problem of chaos synchronization of a chaotic system which is proposed by Lue et al. [Int J Bifurcat Chaos 2004;14:1507] is considered. A novel nonlinear controller is designed based on the Lyapunov stability theory. The proposed controller ensures that the states of the controlled chaotic slave system asymptotically synchronizes the states of the master system. A numerical example is given to illuminate the design procedure and advantage of the result derived

Chaos in body-vortex interactions

DEFF Research Database (Denmark)

Pedersen, Johan Rønby; Aref, Hassan

2010-01-01

of a circle is integrable. As the body is made slightly elliptic, a chaotic region grows from an unstable relative equilibrium of the circle-vortex case. The case of a cylindrical body of any shape moving in fluid otherwise at rest is also integrable. A second transition to chaos arises from the limit between...... rocking and tumbling motion of the body known in this case. In both instances, the chaos may be detected both in the body motion and in the vortex motion. The effect of increasing body mass at a fixed body shape is to damp the chaos....

PHASE CHAOS IN THE DISCRETE KURAMOTO MODEL

DEFF Research Database (Denmark)

Maistrenko, V.; Vasylenko, A.; Maistrenko, Y.

2010-01-01

The paper describes the appearance of a novel, high-dimensional chaotic regime, called phase chaos, in a time-discrete Kuramoto model of globally coupled phase oscillators. This type of chaos is observed at small and intermediate values of the coupling strength. It arises from the nonlinear...... interaction among the oscillators, while the individual oscillators behave periodically when left uncoupled. For the four-dimensional time-discrete Kuramoto model, we outline the region of phase chaos in the parameter plane and determine the regions where phase chaos coexists with different periodic...

A quantum harmonic oscillator and strong chaos

International Nuclear Information System (INIS)

Oprocha, Piotr

2006-01-01

It is known that many physical systems which do not exhibit deterministic chaos when treated classically may exhibit such behaviour if treated from the quantum mechanics point of view. In this paper, we will show that an annihilation operator of the unforced quantum harmonic oscillator exhibits distributional chaos as introduced in B Schweizer and J SmItal (1994 Trans. Am. Math. Soc. 344 737-54). Our approach strengthens previous results on chaos in this model and provides a very powerful tool to measure chaos in other (quantum or classical) models

Channeling and dynamic chaos

Energy Technology Data Exchange (ETDEWEB)

Bolotin, IU L; Gonchar, V IU; Truten, V I; Shulga, N F

1986-01-01

It is shown that axial channeling of relativistic electrons can give rise to the effect of dynamic chaos which involves essentially chaotic motion of a particle in the channel. The conditions leading to the effect of dynamic chaos and the manifestations of this effect in physical processes associated with the passage of particles through a crystal are examined using a silicon crystal as an example. 7 references.

Geometric and dynamic perspectives on phase-coherent and noncoherent chaos.

Science.gov (United States)

Zou, Yong; Donner, Reik V; Kurths, Jürgen

2012-03-01

Statistically distinguishing between phase-coherent and noncoherent chaotic dynamics from time series is a contemporary problem in nonlinear sciences. In this work, we propose different measures based on recurrence properties of recorded trajectories, which characterize the underlying systems from both geometric and dynamic viewpoints. The potentials of the individual measures for discriminating phase-coherent and noncoherent chaotic oscillations are discussed. A detailed numerical analysis is performed for the chaotic Rössler system, which displays both types of chaos as one control parameter is varied, and the Mackey-Glass system as an example of a time-delay system with noncoherent chaos. Our results demonstrate that especially geometric measures from recurrence network analysis are well suited for tracing transitions between spiral- and screw-type chaos, a common route from phase-coherent to noncoherent chaos also found in other nonlinear oscillators. A detailed explanation of the observed behavior in terms of attractor geometry is given.

Homoclinic tubes and chaos in perturbed sine-Gordon equation

International Nuclear Information System (INIS)

Li, Y. Charles

2004-01-01

Sine-Gordon equation under a quasi-periodic perturbation or a chaotic perturbation is studied. Existence of a homoclinic tube is proved. Established are chaos associated with the homoclinic tube, and 'chaos cascade' referring to the embeddings of smaller scale chaos in larger scale chaos

Matching Real and Synthetic Panoramic Images Using a Variant of Geometric Hashing

Science.gov (United States)

Li-Chee-Ming, J.; Armenakis, C.

2017-05-01

This work demonstrates an approach to automatically initialize a visual model-based tracker, and recover from lost tracking, without prior camera pose information. These approaches are commonly referred to as tracking-by-detection. Previous tracking-by-detection techniques used either fiducials (i.e. landmarks or markers) or the object's texture. The main contribution of this work is the development of a tracking-by-detection algorithm that is based solely on natural geometric features. A variant of geometric hashing, a model-to-image registration algorithm, is proposed that searches for a matching panoramic image from a database of synthetic panoramic images captured in a 3D virtual environment. The approach identifies corresponding features between the matched panoramic images. The corresponding features are to be used in a photogrammetric space resection to estimate the camera pose. The experiments apply this algorithm to initialize a model-based tracker in an indoor environment using the 3D CAD model of the building.

Chaos suppression via observer based active control scheme: Application to Duffing's oscillator

International Nuclear Information System (INIS)

Aguilar-Lopez, Ricardo; Martinez-Guerra, Rafael

2007-01-01

The aim of this paper is the synthesis of a robust control law for chaos suppression of a class of non-linear oscillator with affine control input. A robust state observer based active controller, which provides robustness against model uncertainties and noisy output measurements is proposed. The closed-loop stability for the underlying closed-loop system is done via the regulation and estimation errors dynamics. The performance of the proposed control law is illustrated with numerical simulations. The method is general and can be applied to various non-linear systems which satisfy the conditions required

Hybrid Approach To Steganography System Based On Quantum Encryption And Chaos Algorithms

Directory of Open Access Journals (Sweden)

ZAID A. ABOD

2018-01-01

Full Text Available A hybrid scheme for secretly embedding image into a dithered multilevel image is presented. This work inputs both a cover image and secret image, which are scrambling and divided into groups to embedded together based on multiple chaos algorithms (Lorenz map, Henon map and Logistic map respectively. Finally, encrypt the embedded images by using one of the quantum cryptography mechanisms, which is quantum one time pad. The experimental results show that the proposed hybrid system successfully embedded images and combine with the quantum cryptography algorithms and gives high efficiency for secure communication.

Mesoscopic chaos mediated by Drude electron-hole plasma in silicon optomechanical oscillators

Science.gov (United States)

Wu, Jiagui; Huang, Shu-Wei; Huang, Yongjun; Zhou, Hao; Yang, Jinghui; Liu, Jia-Ming; Yu, Mingbin; Lo, Guoqiang; Kwong, Dim-Lee; Duan, Shukai; Wei Wong, Chee

2017-01-01

Chaos has revolutionized the field of nonlinear science and stimulated foundational studies from neural networks, extreme event statistics, to physics of electron transport. Recent studies in cavity optomechanics provide a new platform to uncover quintessential architectures of chaos generation and the underlying physics. Here, we report the generation of dynamical chaos in silicon-based monolithic optomechanical oscillators, enabled by the strong and coupled nonlinearities of two-photon absorption induced Drude electron–hole plasma. Deterministic chaotic oscillation is achieved, and statistical and entropic characterization quantifies the chaos complexity at 60 fJ intracavity energies. The correlation dimension D2 is determined at 1.67 for the chaotic attractor, along with a maximal Lyapunov exponent rate of about 2.94 times the fundamental optomechanical oscillation for fast adjacent trajectory divergence. Nonlinear dynamical maps demonstrate the subharmonics, bifurcations and stable regimes, along with distinct transitional routes into chaos. This provides a CMOS-compatible and scalable architecture for understanding complex dynamics on the mesoscopic scale. PMID:28598426

GSHR-Tree: a spatial index tree based on dynamic spatial slot and hash table in grid environments

Science.gov (United States)

Chen, Zhanlong; Wu, Xin-cai; Wu, Liang

2008-12-01

Computation Grids enable the coordinated sharing of large-scale distributed heterogeneous computing resources that can be used to solve computationally intensive problems in science, engineering, and commerce. Grid spatial applications are made possible by high-speed networks and a new generation of Grid middleware that resides between networks and traditional GIS applications. The integration of the multi-sources and heterogeneous spatial information and the management of the distributed spatial resources and the sharing and cooperative of the spatial data and Grid services are the key problems to resolve in the development of the Grid GIS. The performance of the spatial index mechanism is the key technology of the Grid GIS and spatial database affects the holistic performance of the GIS in Grid Environments. In order to improve the efficiency of parallel processing of a spatial mass data under the distributed parallel computing grid environment, this paper presents a new grid slot hash parallel spatial index GSHR-Tree structure established in the parallel spatial indexing mechanism. Based on the hash table and dynamic spatial slot, this paper has improved the structure of the classical parallel R tree index. The GSHR-Tree index makes full use of the good qualities of R-Tree and hash data structure. This paper has constructed a new parallel spatial index that can meet the needs of parallel grid computing about the magnanimous spatial data in the distributed network. This arithmetic splits space in to multi-slots by multiplying and reverting and maps these slots to sites in distributed and parallel system. Each sites constructs the spatial objects in its spatial slot into an R tree. On the basis of this tree structure, the index data was distributed among multiple nodes in the grid networks by using large node R-tree method. The unbalance during process can be quickly adjusted by means of a dynamical adjusting algorithm. This tree structure has considered the

Origin of chaos in 3-d Bohmian trajectories

International Nuclear Information System (INIS)

Tzemos, Athanasios C.; Contopoulos, George; Efthymiopoulos, Christos

2016-01-01

We study the 3-d Bohmian trajectories of a quantum system of three harmonic oscillators. We focus on the mechanism responsible for the generation of chaotic trajectories. We demonstrate the existence of a 3-d analogue of the mechanism found in earlier studies of 2-d systems [1,2], based on moving 2-d ‘nodal point–X-point complexes’. In the 3-d case, we observe a foliation of nodal point–X-point complexes, forming a ‘3-d structure of nodal and X-points’. Chaos is generated when the Bohmian trajectories are scattered at one or more close encounters with such a structure. - Highlights: • A mechanism for the emergence of 3-d Bohmian chaos is proposed. • We demonstrate the existence of a 3-d structure of nodal and X-points. • Chaos is generated when the trajectories are scattered by the X-points.

Origin of chaos in 3-d Bohmian trajectories

Energy Technology Data Exchange (ETDEWEB)

Tzemos, Athanasios C., E-mail: thanasistzemos@gmail.com; Contopoulos, George, E-mail: gcontop@academyofathens.gr; Efthymiopoulos, Christos, E-mail: cefthim@academyofathens.gr

2016-11-25

We study the 3-d Bohmian trajectories of a quantum system of three harmonic oscillators. We focus on the mechanism responsible for the generation of chaotic trajectories. We demonstrate the existence of a 3-d analogue of the mechanism found in earlier studies of 2-d systems [1,2], based on moving 2-d ‘nodal point–X-point complexes’. In the 3-d case, we observe a foliation of nodal point–X-point complexes, forming a ‘3-d structure of nodal and X-points’. Chaos is generated when the Bohmian trajectories are scattered at one or more close encounters with such a structure. - Highlights: • A mechanism for the emergence of 3-d Bohmian chaos is proposed. • We demonstrate the existence of a 3-d structure of nodal and X-points. • Chaos is generated when the trajectories are scattered by the X-points.

Synchronising chaotic Chua's circuit using switching feedback control based on piecewise quadratic Lyapunov functions

International Nuclear Information System (INIS)

Hong-Bin, Zhang; Jian-Wei, Xia; Yong-Bin, Yu; Chuang-Yin, Dang

2010-01-01

This paper investigates the chaos synchronisation between two coupled chaotic Chua's circuits. The sufficient condition presented by linear matrix inequalities (LMIs) of global asymptotic synchronisation is attained based on piecewise quadratic Lyapunov functions. First, we obtain the piecewise linear differential inclusions (pwLDIs) model of synchronisation error dynamics, then we design a switching (piecewise-linear) feedback control law to stabilise it based on the piecewise quadratic Laypunov functions. Then we give some numerical simulations to demonstrate the effectiveness of our theoretical results

Chaos in the atomic and subatomic world

International Nuclear Information System (INIS)

Nussenzveig, H.M.

1992-01-01

This work discusses the possibility of the existence of chaos in the quantum level. In the macroscopic scale, chaos can be explained by the use of classical mechanics. The problem is to know whether there is any manifestation of chaos in the evolution of a system following the quantum mechanical laws. (A.C.A.S.)

Quantum chaos: diffusion photoeffect in hydrogen

Energy Technology Data Exchange (ETDEWEB)

Shepelyanskij, D L

1987-05-01

Ionization process in highly excited hydrogen atom in electromagnetic field is presented in the form of an extraordinary photoeffect, in which ionization at the frequency, being much lower than ionization energy, occurs much quicker than single-photon one. Such a quick ionization is explained by dynamic chaos occurence. Question, related to quantum effect influence on chaotic movement of the electron (quantum chaos) is considered. Electron excitation in the chaos area is described by a diffusional equation.

Meaning Finds a Way: Chaos (Theory) and Composition

Science.gov (United States)

Kyburz, Bonnie Lenore

2004-01-01

The explanatory power provided by the chaos theory is explored. A dynamic and reciprocal relationship between culture and chaos theory indicates that the progressive cultural work may be formed by the cross-disciplinary resonance of chaos theory.

Chaos theory in geophysics: past, present and future

International Nuclear Information System (INIS)

Sivakumar, B.

2004-01-01

The past two decades of research on chaos theory in geophysics has brought about a significant shift in the way we view geophysical phenomena. Research on chaos theory in geophysics continues to grow at a much faster pace, with applications to a wide variety of geophysical phenomena and geophysical problems. In spite of our success in understanding geophysical phenomena also from a different (i.e. chaotic) perspective, there still seems to be lingering suspicions on the scope of chaos theory in geophysics. The goal of this paper is to present a comprehensive account of the achievements and status of chaos theory in geophysics, and to disseminate the hope and scope for the future. A systematic review of chaos theory in geophysics, covering a wide spectrum of geophysical phenomena studied (e.g. rainfall, river flow, sediment transport, temperature, pressure, tree ring series, etc.), is presented to narrate our past achievements not only in understanding and predicting geophysical phenomena but also in improving the chaos identification and prediction techniques. The present state of chaos research in geophysics (in terms of geophysical phenomena, problems, and chaos methods) and potential for future improvements (in terms of where, why and possibly how) are also highlighted. Our popular views of nature (i.e. stochastic and deterministic), and of geophysical phenomena in particular, are discussed, and the usefulness of chaos theory as a bridge between such views is also put forth

Chaos control of chaotic dynamical systems using backstepping design

International Nuclear Information System (INIS)

Yassen, M.T.

2006-01-01

This work presents chaos control of chaotic dynamical systems by using backstepping design method. This technique is applied to achieve chaos control for each of the dynamical systems Lorenz, Chen and Lue systems. Based on Lyapunov stability theory, control laws are derived. We used the same technique to enable stabilization of chaotic motion to a steady state as well as tracking of any desired trajectory to be achieved in a systematic way. Numerical simulations are shown to verify the results

Chaos in World Politics: A Reflection

Science.gov (United States)

Ferreira, Manuel Alberto Martins; Filipe, José António Candeias Bonito; Coelho, Manuel F. P.; Pedro, Isabel C.

Chaos theory results from natural scientists' findings in the area of non-linear dynamics. The importance of related models has increased in the last decades, by studying the temporal evolution of non-linear systems. In consequence, chaos is one of the concepts that most rapidly have been expanded in what research topics respects. Considering that relationships in non-linear systems are unstable, chaos theory aims to understand and to explain this kind of unpredictable aspects of nature, social life, the uncertainties, the nonlinearities, the disorders and confusion, scientifically it represents a disarray connection, but basically it involves much more than that. The existing close relationship between change and time seems essential to understand what happens in the basics of chaos theory. In fact, this theory got a crucial role in the explanation of many phenomena. The relevance of this kind of theories has been well recognized to explain social phenomena and has permitted new advances in the study of social systems. Chaos theory has also been applied, particularly in the context of politics, in this area. The goal of this chapter is to make a reflection on chaos theory - and dynamical systems such as the theories of complexity - in terms of the interpretation of political issues, considering some kind of events in the political context and also considering the macro-strategic ideas of states positioning in the international stage.

Controllable chaos in hybrid electro-optomechanical systems

Science.gov (United States)

Wang, Mei; Lü, Xin-You; Ma, Jin-Yong; Xiong, Hao; Si, Liu-Gang; Wu, Ying

2016-01-01

We investigate the nonlinear dynamics of a hybrid electro-optomechanical system (EOMS) that allows us to realize the controllable opto-mechanical nonlinearity by driving the microwave LC resonator with a tunable electric field. A controllable optical chaos is realized even without changing the optical pumping. The threshold and lifetime of the chaos could be optimized by adjusting the strength, frequency, or phase of the electric field. This study provides a method of manipulating optical chaos with an electric field. It may offer the prospect of exploring the controllable chaos in on-chip optoelectronic devices and its applications in secret communication. PMID:26948505