• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.375-378
• /
• 2001

본 논문에서는 선형 MACA의 0-트리의 한 경로를 기본 경로로 하여 나머지 다른 트리를 구성하고 여원벡터를 선형 MACA의 하나의 상태로 해석하였을 때 상태전이그래프에서 놓이는 위치에 따라 선형 MACA로부터 유도된 여원을 갖는 CA의 모든 트리를 구성하는 알고리즘을 제안한다. 주어진 전이행렬과 여원벡터를 가지는 additive CA의 트리를 구성함에 있어 보다 빠르게 구성할 수 있는 알고리즘을 제시한다.

• Journal of the Korea Computer Industry Society
• /
• v.10 no.4
• /
• pp.167-176
• /
• 2009

In this paper, we propose an improved SHACAL-1 of the same encryption and decryption with a simple symmetric layer. SHACAL-1 has 4 rounds, and each round has 20 steps. Decryption is becoming inverse function of encryption, In this paper, we proposed SHACAL-1 are composed of the first half, symmetry layer and the last half. The first half with SHACAL-1 encryption algorithm 1 round does with 10 steps and composes of 4 round. The last half identically with SHACAL-1 decryption algorithm, has a structure. On the center inserts a symmetry layer, encryption and decryption algorithm identically, composes. In the experiments, the proposed SHACAL-1 algorithm showed similar execution time to that of the SHACAL-1. Thanks to the symmetric layer, the proposed algorithm makes it difficult for the attacks which take advantages of high probability path such as the linear cryptanalysis, differential cryptanalysis. The proposed algorithm can be applicable to the other block cipher algorithms which have different encryption and decryption and useful for designing a new block cipher algorithm.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.289-294
• /
• 2015

The consensus problem is finding a representative string, called a consensus, of a given set S of k strings. Circular strings are different from linear strings in that the last symbol precedes the first symbol. Given a set S of circular strings of length n over an alphabet ${\Sigma}$, we first present an $O({\mid}{\Sigma}{\mid}nlogn)$ time parallel algorithm for finding a consensus of S minimizing both radius and distance sum when k=3 using O(n) threads. Then we present an $O({\mid}{\Sigma}{\mid}n^2logn)$ time parallel algorithm for finding a consensus of S minimizing distance sum when k=4 using O(n) threads. Finally, we compare execution times of our algorithms implemented using CUDA with corresponding sequential algorithms.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.451-456
• /
• 2004

Signature based intrusion detection system (IDS), having stored rules for detecting intrusions at the library, judges whether new inputs are intrusion or not by matching them with the new inputs. However their policy has two restrictions generally. First, when they couldn't make rules against new intrusions, false negative (FN) errors may are taken place. Second, when they made a lot of rules for maintaining diversification, the amount of resources grows larger proportional to their amount. In this paper, we propose the learning algorithm which can evolve the competent of anomaly detectors having the ability to detect anomalous attacks by genetic algorithm. The anomaly detectors are the population be composed of by following the negative selection procedure of the biological immune system. To show the effectiveness of proposed system, we apply the learning algorithm to the artificial network environment, which is a computer security system.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.4
• /
• pp.359-371
• /
• 2001

Project scheduling under resource constraint conditions have contained to many uncertain factors and it is perfonned by human experts. The expert identifies the activities of the project, decides the precedent relationships between these activities, and then construct the schedule using expected activity's duration. At this time, most of the scheduling methods concentrate on one of scheduling factor between activity duration and cost. And the activity duration, which is the most important factor in scheduling, is decided by heuristic of expert. Therefore it may cause uncertainty of activity duration decision and the use of this activity duration may increase the uncertainty of constructed schedule. This paper proposes Fuzzy-MOEH scheduling algorithm, which is the aggregation of the fuzzy number for deciding activity duration and applies the cost function for solving the problems of previous scheduling methods. This paper also analyze the utility and property of Fuzzy-MEOH algorithm through the comparison between Fuzzy-MEOH algorithm and existing MEOH algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2343-2348
• /
• 2008

Ant algorithm is new meta heuristic for hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem. In this paper, we propose the improved $AS_{rank}$ algorithms. The original $AS_{rank}$ algorithm accomplishes a pheromone updating about only the paths which will be composed of the optimal path is higher, but, the paths which will be composed the optimal path is lower does not considered. In this paper, The proposed method evaporate the pheromone of the paths which will be composed of the optimal path is lowest(worst tour path), it is reducing the probability of the edges selection during next search cycle. Simulation results of proposed method show lower average search time and average iteration than original ACS.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.4
• /
• pp.363-369
• /
• 2002

In this paper, it could improved on the arbitrary nonlinear function learning approximation which have the wavelet neural network based on Adaptive Neuro-Fuzzy Inference System(ANFIS) and the multi-resolution Analysis(MRA) of the wavelet transform. ANFIS structure is composed of a bell type fuzzy membership function, and the wavelet neural network structure become composed of the forward algorithm and the backpropagation neural network algorithm. This wavelet composition has a single size, and it is used the backpropagation algorithm for learning of the wavelet neural network based on ANFIS. It is confirmed to be improved the wavelet base number decrease and the convergence speed performances of the wavelet neural network based on ANFIS Model which is using the wavelet translation parameter learning and bell type membership function of ANFIS than the conventional algorithm from 1 dimension and 2 dimension functions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.139-147
• /
• 2006

This paper presents an overlay video multicast system over the Internet. The proposed system consists of two parts, i.e. overlay multicast tree suitable for the real-time video delivery and H.263+ rate control adaptive to overlay multicast tree. Overlay multicast tree is constructed to minimize the average time delay of members, and H.263+ rate control pursues a tradeoff between spatial and temporal qualities to enhance the human visual perceptual quality. Two systems are integrated and tested over the real Internet. And experimental results are provided to show the performance of the proposed system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.429-436
• /
• 2009

Odd network was introduced as one model of graph theory. In [1], it was introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties such as simple routing algorithms, maximal fault tolerance, node axsjoint path, etc. In this paper, we sauw a construction algorithm of edge-axsjoint spanning trees in Odd network $O_d$. Also, we prove that edge-disjoint spanning tree generated by our algorithm is optimal edge-disjoint spanning tree.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.1126-1129
• /
• 2014

사회관계망 분석에 있어서 매개중심도는 네트워크를 구성하는 노드들의 상대적인 중요도를 파악하기 위한 척도로서 오랫동안 사용되어 왔다. 그러나 이러한 매개중심도를 계산하기 위한 계산 복잡도가 높기 때문에 대규모 사회관계망에서는 매개중심도를 계산하기란 쉽지 않은 문제이다. 본 논문에서는 네트워크를 구성하는 각각의 노드들마다 자신의 지역정보를 활용하여 구성한 네트워크에서 매개중심도를 산출함으로써 시간복잡도를 줄이는 한편 지역정보 기반의 네트워크의 특징을 분석함으로써 매개중심도를 더 빠르게 산출할 수 있는 알고리즘을 제안한다. 그리고 실제 소셜 네트워크에서의 실험을 통하여 제안 알고리즘이 기존 알고리즘에 비해 매개중심도를 더 빠르게 산출함을 보인다.