• Corrosion Science and Technology
• /
• v.16 no.2
• /
• pp.64-68
• /
• 2017

The interactions between corrosion pits on stainless steel under loading conditions are studied by using a cellular automata model coupled with finite element method at a mesoscopic scale. The cellular automata model focuses on a metal/film/electrolyte system, including anodic dissolution, passivation, diffusion of hydrogen ions and salt film hydrolysis. The Chopard block algorithm is used to improve the diffusion simulation efficiency. The finite element method is used to calculate the stress concentration on the pit surface during pit growth, and the effect of local stress and strain on anodic current is obtained by using the Gutman model, which is used as the boundary conditions of the cellular automata model. The transient current characteristics of the interactions between corrosion pits under different simulation factors including the breakdown of the passive film at the pit mouth and the diffusion of hydrogen ions are analyzed. The analysis of the pit stability product shows that the simulation results are close to the experimental conclusions.

• The KIPS Transactions:PartA
• /
• v.19A no.1
• /
• pp.23-34
• /
• 2012

This paper suggests that implementation of the Simulink execution module controls Simulink simulation and shows simulation results by applying Automata theory. This module is composed of three independent systems that the main program to accept user commands, the thread to control a simulation of Simulink model and the Simulink model to execute simulation. This paper designs each module and entire system by applying Automata theory, and implements it with C# and MATLAB language. And the Simulink execution module implemented will be verified through the experiment.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.5
• /
• pp.187-192
• /
• 2019

Majority problem and synchronization problem on cellular automata(CA) are hard to solve, since they are global problems while CA operate on local information. This paper proposes a way to find state transition rules of these problems. The rules of CA are represented as CMR(conditionally matching rules) and evolutionary algorithms are applied to find rules. We find many solution rules to these problems, compared the results with the previous studies, and demonstrated the effectiveness of CMR on one-dimensional cellular automata.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.953-955
• /
• 2009

In this paper, we propose an image encryption method using two linear MLCA(Maximum Length Cellular Automata). The encryption method first sets arbitrary 8 bit initial values. Next, we create high quality PN(pseudo noise) sequences by converting rows and columns with the set initial values. Then we generate a basis image using the set PN sequences. Lastly, the final image with high encryption level is produced by XOR operating the basis image and the original image. In order to verify that the proposed method has the high encryption level, we performed histogram and stability analysis.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.6
• /
• pp.111-123
• /
• 2004

A hash function is a function that takes bit strings of arbitrary length to bit string of fixed length. A cellular automata is a finite state machine and has the property of generating pseudorandom numbers efficiently by combinational logics of neighbour cells. In [1] and [7], hash functions based on cellular automata which can be implemented efficiently in hardware were proposed. In this paper, we show that we can find collisions of these hash functions with probability 0.46875 and 0.5 respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1565-1572
• /
• 2006

Recently with the ever increasing growth of data communication, the need for security and privacy has become a necessity. The advent of wireless communication and other handheld devices like Personal Digital Assistants and smart cards have made the implementation of cryptosystems a major issue. The Cellular Automata(CA) can be programmed to implement hardware sharing between the encryption and decryption. In this paper, we give conditions for a linear hybrid cellular automata with 60, 102 or 204 to be a linear hybrid group cellular automata C. And we present the conditions which the complemented hybrid group cellular automata C' with complement vectors derived from C has maximum equal lengths in the state transition diagram of C' Also we analyze the relationship among cycles of C' These results generalize Mukhopadhyay's results.

• The Journal of the Petrological Society of Korea
• /
• v.26 no.1
• /
• pp.93-98
• /
• 2017

In this paper, we propose a lava flow simulation program to predict the range of lava flows area and thickness of lava flows during volcanic eruptions. The map information is represented as a 'cell' with observed values per fixed area such as DEM and a lava flow prediction algorithm using a cellular automata model is performed to predict the flow of lava flows. To obtain quantitative data of lava flows, fluid properties of lava flows are defined as Bingham plastic fluid and derived equation is applied to the rules of cellular automata. To verify the program, we use a 30m resolution DEM provided by USGS. We compared simulation results with real lava flows for the Pu'u'O'o crater area in Hawaii, which has erupted since May 24, 2016.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.69-76
• /
• 2013

In the recent years, cyber attacks by malicious codes called malware has become a social problem. With the explosive appearance and increase of new malware, innumerable disasters caused by metaphoric malware using the existing malicious codes have been reported. To secure more effective detection of malicious codes, in other words, to make a more accurate judgment as to whether suspicious files are malicious or not, this study introduces the malware analysis system, which is based on a profiling technique using the Finite Automata. This new analysis system enables realtime automatic detection of malware with its optimized partial execution method. In this paper, the functions used within a file are expressed by finite automata to find their correlation, and a realtime malware analysis system enabling us to give an immediate judgment as to whether a file is contaminated by malware is suggested.

• Journal of Korean Society of Transportation
• /
• v.19 no.6
• /
• pp.219-227
• /
• 2001

In this study, the simulation was constructed using CA(Cellular Automata) rule to analyze the effect of incidents, which was verified using real-time VDS data and data collected on the field. The study analyzed the effect of incidents on highways by the simulation. The result appears to be statistically available with 5% of significance level. In order to analyze the effect of incident, the study classified time period of incidents and types of incidents in relation with traffic volume. Also, the effect of each type of incidents was analyzed in terms of time difference in sectional travel and delay time. In conclusion, little effect of incidents on traffic flow is noticed with light traffic volume but it becomes serious as the traffic volume increases. In addition, the delay happens to appear without incidents as the traffic volume increases over 2000 veh/hour. Also, when incidents happened during 45 minutes, the delay was about 425-722 veh·hour.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.779-786
• /
• 2005

In this paper we shall discuss some properties derived from the characteristic S-automaton $_x(S)_M$, using the fact that ${\mu}_S$ is an equivalence relation on M. When $L_{m}:S{\rightarrow}M$ is a left translation and $L_{M}$ is a collection of $L_{m}'s$, we shall show $_x(S)_{M}{\cong}L_{M}$. If S is commutative, we have $_x(S)_{M{\times}N{\cong}L_{M{\times}N}$. Moreover when M and N are perfect, we have $L_{M{\times}N}{\cong}L_{M}{\times}L_{N}$ and $_x(S)_{M{\times}N}{\cong}_x(S)_{M}{\times}_x(S)_N$.