7 resultados para LYAPUNOV FUNCTIONS
em Cochin University of Science
Resumo:
Department of Biotechnology, Cochin University of Science and Technology
Resumo:
The brain with its highly complex structure made up of simple units,imterconnected information pathways and specialized functions has always been an object of mystery and sceintific fascination for physiologists,neuroscientists and lately to mathematicians and physicists. The stream of biophysicists are engaged in building the bridge between the biological and physical sciences guided by a conviction that natural scenarios that appear extraordinarily complex may be tackled by application of principles from the realm of physical sciences. In a similar vein, this report aims to describe how nerve cells execute transmission of signals ,how these are put together and how out of this integration higher functions emerge and get reflected in the electrical signals that are produced in the brain.Viewing the E E G Signal through the looking glass of nonlinear theory, the dynamics of the underlying complex system-the brain ,is inferred and significant implications of the findings are explored.
Resumo:
We establish numerically the validity of Huberman-Rudnick scaling relation for Lyapunov exponents during the period doubling route to chaos in one dimensional maps. We extend our studies to the context of a combination map. where the scaling index is found to be different.
Resumo:
We have studied the bifurcation structure of the logistic map with a time dependant control parameter. By introducing a specific nonlinear variation for the parameter, we show that the bifurcation structure is modified qualitatively as well as quantitatively from the first bifurcation onwards. We have also computed the two Lyapunov exponents of the system and find that the modulated logistic map is less chaotic compared to the logistic map.
Resumo:
Department of Statistics, Cochin University of Science and Technology
Resumo:
This paper describes JERIM-320, a new 320-bit hash function used for ensuring message integrity and details a comparison with popular hash functions of similar design. JERIM-320 and FORK -256 operate on four parallel lines of message processing while RIPEMD-320 operates on two parallel lines. Popular hash functions like MD5 and SHA-1 use serial successive iteration for designing compression functions and hence are less secure. The parallel branches help JERIM-320 to achieve higher level of security using multiple iterations and processing on the message blocks. The focus of this work is to prove the ability of JERIM 320 in ensuring the integrity of messages to a higher degree to suit the fast growing internet applications