• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.4
• /
• pp.545-551
• /
• 2015

We investigate periodicities of characteristic matrices of cellular automata configured with rule 60 and intermediate boundary condition.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.4
• /
• pp.543-551
• /
• 2014

We investigate periodicities of some hybrid cellular automata configured with rule 102 and 60 and null boundary condition.

• Journal of the Chungcheong Mathematical Society
• /
• v.31 no.4
• /
• pp.511-518
• /
• 2018

We investigate periodicities of some hybrid cellular automata configured with rule 60 and 102 and periodic boundary condition.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.785-791
• /
• 2010

In this note, we give a characterization of cycle lengths of uniform cellular automata configured with rules 60 or 102.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.5
• /
• pp.121-133
• /
• 2004

In [15,16], Okeya and Sakurai showed that the randomized addition-subtraction chains countermeasures [18] are vulnerable to SPA attack. In this paper, we show that Okeya and Sakurai's attack algorithm [15,16] has two latent problems which need to be considered. We further propose new powerful concrete attack algorithms which are different from [15,16,19]. From our implementation results for standard 163-bit keys, the success probability for the simple version with 20 AD sequences is about 94% and with 30 AD sequences is about 99%. Also, the success probability for the complex version with 40 AD sequences is about 94% and with 70 AD sequences is about 99%.

• Journal of the Chungcheong Mathematical Society
• /
• v.30 no.3
• /
• pp.305-311
• /
• 2017

We investigate periodicities of characteristic matrices of some hybrid cellular automata configured with rules 60 and 102 and an intermediate boundary condition.

• Journal of Computing Science and Engineering
• /
• v.4 no.4
• /
• pp.313-349
• /
• 2010

In this paper, we study the data interoperability problem of web services in terms of XML schema compatibility. When Web Service A sends XML messages to Web Service B, A is interoperable with B if B can accept all messages from A. That is, the XML schema R for B to receive XML instances must be compatible with the XML schema S for A to send XML instances, Le., A is a subschema of B. We propose a formal model called Schema Automaton (SA) to model W3C XML Schema (XSD) and develop several algorithms to perform different XML schema computations. The computations include schema minimization, schema equivalence testing, subschema testing, and subschema extraction. We have conducted experiments on an e-commerce standard XSD called xCBL to demonstrate the practicality of our algorithms. One experiment has refuted the claim that the xCBL 3.5 XSD is backward compatible with the xCBL 3.0 XSD. Another experiment has shown that the xCBL XSDs can be effectively trimmed into small subschemas for specific applications, which has significantly reduced the schema processing time.

• Journal of information and communication convergence engineering
• /
• v.11 no.1
• /
• pp.30-44
• /
• 2013

Traffic congestion has become a serious problem with the recent exponential increase in the number of vehicles. In urban areas, almost all traffic congestion occurs at intersections. One of the ways to solve this problem is road expansion, but it is difficult to realize in urban areas because of the high cost and long construction period. In such cases, traffic signal control is a reasonable method for reducing traffic jams. In an actual situation, the traffic flow changes randomly and its randomness makes the control of traffic signals difficult. A prediction of traffic jams is, therefore, necessary and effective for reducing traffic jams. In addition, an autonomous distributed (stand-alone) point control of each traffic light individually is better than the wide and/or line control of traffic lights from the perspective of real-time control. This paper describes a stochastic optimum control of crossroads and multi-way traffic signals. First, a stochastic model of traffic flows and traffic jams is constructed by using a Bayesian network. Secondly, the probabilistic distributions of the traffic flows are estimated by using a cellular automaton, and then the probabilistic distributions of traffic jams are predicted. Thirdly, optimum traffic signals of crossroads and multi-way intersection are searched by using a modified particle swarm optimization algorithm to realize real-time traffic control. Finally, simulations are carried out to confirm the effectiveness of the real-time stochastic optimum control of traffic signals.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.87-89
• /
• 2014

Aho-Corasick (AC) algorithm is a multiple patterns string matching algorithm commonly used in many applications with real-time performance requirements. In this paper, we parallelize the AC algorithm on the Intel's Many Integrated Core (MIC) Architecture, Xeon Phi Coprocessor. We propose a new technique to compress the Deterministic Finite Automaton structure which represents the set of pattern strings again which the input data is inspected for possible matches. The new technique reduces the cache misses and leads to significantly improved performance on Xeon Phi.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.883-894
• /
• 2002

Classical deterministic testing controls the execution of concurrent programs based on the equivalence between specifications and programs. However, it is not directly applicable to a situation in which synchronization sequences, being valid but infeasible, are taken into account. To resolve this problem, we had proposed automata-based deterministic testing in our previous works, where a concurrent program is executed according to one of the sequences accepted by the automaton recognizing all sequences semantically equivalent to a given sequence. In this paper, we present the automata-based testing environment for Java multi-thread programs, and we design and implement "Deterministic Executor" in the testing environment. "Deterministic Executor" transforms a Java multi-thread program by applying automata-based deterministic testing, the transformed program presents testing results. "Deterministic Executor" uses "Automata Generator", which generates an equivalent automaton of a test sequence, and "Replay Controller", which controls the execution of programs according to the sequence accepted by the automaton. By illustrating automata-based testing procedures with a gas station example, we show how the proposed approach does works in a Java multi-threaded program.roach does works in a Java multi-threaded program.