• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.618-622
• /
• 2008

In this paper, we suggest new music composition algorithm based on fractal theory. User can define and control fractal shape by setting an initial state and production rules in L-System. We generate an asymmetric fractal tree based on L-System and probability. Then a music is generated by the fractal tree image using sonification techniques. We introduce two composition algorithm using the fractal tree. First, monophonic music can be generated by mapping x and y axis to velocity and pitch, respectively Second, harmonic music also can be generated by mapping x and y axis to time and pitch, respectively Using our composition algorithm, user can easily generate a music which has repeated pattern created by recursive feature of fractal, and a music which has structure similar to fractal tree image.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.41-47
• /
• 2008

This paper presents a new digit level LSB-first multiplier for computing a modular multiplication and a modular squaring simultaneously over finite field GF($2^m$). To derive $L{\times}L$ digit level architecture when digit size is set to L, the previous algorithm is used and index transformation and merging the cell of the architecture are proposed. The proposed architecture can be utilized for the basic architecture for the crypto-processor and it is well suited to VLSI implementation because of its simplicity, regularity, and concurrency.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.36 no.11
• /
• pp.1463-1471
• /
• 2012

In this study, a 3-axis camera system design is proposed for application to an existing 2-axis surveillance robot. A camera-image-based target-tracking algorithm for this robot has also been proposed. The algorithm has been validated using a virtual simulation. In the algorithm, the heading direction vector of the camera system in the mobile surveillance robot is obtained by the position error between the center of the view finder and the center of the object in the camera image. By using the heading direction vector of the camera system, the desired pan and tilt angles for target-tracking and the desired roll angle for the stabilization of the camera image are obtained through inverse kinematics. The algorithm has been validated using a virtual simulation model based on MATLAB and ADAMS by checking the corresponding movement of the robot to the target motion and the virtual image error of the view finder.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.9
• /
• pp.1153-1160
• /
• 2010

The detection algorithm for loss of balance had three main parts: one for processing data, another for constructing an internal model, and a third for detecting the loss of balance. The part related to the internal model is the most important part of the algorithm. The purpose of this study is to evaluate the effect of variables associated with the internal model on the success rate of the algorithm. The internal model depends on the type of linearization adopted and the operating period of the algorithm. The design variables were evaluated by performing sensitivity analysis of the variables of the internal model in order to obtain the success rate of the algorithm. The results showed that the most sensitive variable was the period and the period of 0.3 s yielded the highest success rate of 97.1%. Further, the ranges of the design variables that can facilitate a success rate of over 95% are presented.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.754-760
• /
• 2012

This paper describes peak shaving algorithms as long-term cycle scheduling in the power management system (PMS) for MW-scale battery energy storage systems (BESS). The purpose of PMS is basically to manage the input and output power from battery modules placed in the systems. Assuming that an one-day ahead load curve is provided, off-line peak shaving algorithms can be employed, but applying the results of the off-line algorithm may result in the difference in the real-time performance because there is uncertainty in the provided load curve. This paper adopts fuzzy based LP (linear programming) algorithms for describing the peak shaving algorithm in PMS and discusses a solution technique and real-time operation strategies using the solution.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.10
• /
• pp.712-720
• /
• 2001

Algorithms from the research of the layout migration were proposed in the paper. These are automatic recognition algorithm for the VLSI devices from it, graph based construction algorithm to maintain the constraints, dependencies, and design rule between the devices, and high speed compaction algorithm to reduce size of the VLSI area and reuse the design with compacted size for the new technology. Also, this paper describes that why proposed algorithms are essential for the era of the SoC (System on a Chip), design reuse, and IP DB, which are the big concerns in these days. In addition to introduce our algorithms, the benchmark showed that our performance is superior by 27 times faster than that of the commercial one, and has better efficiency by 3 times in disk usage.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.8
• /
• pp.971-980
• /
• 2010

In this paper, we present a navigation control algorithm for mobile robots that move in environments having static and moving obstacles. The algorithm includes a global and a local path-planning algorithm that uses $D^*$ search algorithm, a fuzzy logic for determining the immediate level of danger due to collision, and a fuzzy logic for evaluating the required wheel velocities of the mobile robot. To apply the $D^*$ search algorithm, the two-dimensional space that the robot moves in is decomposed into small rectangular cells. The algorithm is verified by performing simulations using the Python programming language as well as by using the dynamic equations for a two-wheeled mobile robot. The simulation results show that the algorithm can be used to move the robot successfully to reach the goal position, while avoiding moving and unknown static obstacles.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.9
• /
• pp.156-163
• /
• 2013

In this paper, we propose an algorithm for estimating media characteristics of sea water and subbottom multi-layers. The proposed algorithm for estimating reflection coefficients, uses a transmitted signal and reflected signal obtained from multiple layers of various shape and structure, and the algorithm is called Schur algorithm. The algorithm is efficient in estimating the reflection coefficients since it finds solution by converting the given inverse scattering problem into matrix factorization. To verify the proposed algorithm, we generate a transmit signal and reflected signal obtained from lattice filter model for sea water and subbottom of multi-level non-homogeneous layers, and then find that the proposed algorithm can estimate reflection coefficients efficiently.

• Journal of The Korean Association of Information Education
• /
• v.15 no.1
• /
• pp.147-154
• /
• 2011

In this Paper, we suggest the effective pre-correction algorithm on sensor values and the classification algorithm for gesture recognition that use values for each axis of the accelerometer to send data(a number or specific input data) to device. we know that creation of reliable preprocessed data in experimental results through the error rate of X-Axis and Y-Axis for pre-correction and post-correction. we can show high recognition rate through recognizer using the normalization and classification algorithm for the preprocessed data.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10c
• /
• pp.33-38
• /
• 2006

히스토그램은 원본 데이타를 효과적으로 요약하는 기법중의 하나 이며, 선택도 측정과 근사 질의 처리 등에 널리 사용되고 있다. 기존의 히스토그램 구축 알고리즘들은 하나의 값으로 표현되는 점 데이타에 대하여 적용 가능한 알고리즘 이었다. 그러나 일상생활에서는 하루 동안의 온도, 주식 가격과 같은 구간 데이타들도 점 데이타만큼 흔하게 접할 수 있다. 본 논문에서는 기존의 Max 에러에 대한 히스토그램 구축 알고리을 구간 데이터에 대하여 확장한다. 합성 데이타를 사용한 실험을 통하여 기존의 점 데이타에 대한 히스토그램을 초보적으로 확장하는 방법보다 본 논문에서 제시된 알고리즘의 성능이 좋다는 것을 보였다.