• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1463-1478
• /
• 2012

Based on the theory of local-world network, the composition self-similarity (CSS) of network traffic is presented for the first time in this paper for the study of DoS detection. We propose the concept of composition distribution graph and design the relative operations. The $(R/S)^d$ algorithm is designed for calculating the Hurst parameter. Based on composition distribution graph and Kullback Leibler (KL) divergence, we propose the composition self-similarity anomaly detection (CSSD) method for the detection of DoS attacks. We evaluate the effectiveness of the proposed method. Compared to other entropy based anomaly detection methods, our method is more accurate and with higher sensitivity in the detection of DoS attacks.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.2
• /
• pp.265-272
• /
• 1996

In this paper, attitude computation algorithm for a strap down ARS(Attitude Reference System)of an underwater vehicle has been studied. Attitude errors o the ARS using low-level gyroscopes tend to increase with time due to gyroscope errors. To cope with this problem, a mixing algorithm of accelerometer aided attitude computation has been developed. The algorithm can successfully bound the error increase for cruising motion, but it gives instantaneously large errors when a vehicle maneuvers. To improve the performance in case of vehicle's maneuver, a new attitude computation mixing algorithm complying state of vehicle and to manage the adjustment of the gains which are invariant in the existing algorithm. In addition, a gain scheduling method is applied to fuzzy inference composition process for real-time computation. Monte Carlo simulation results show that the proposed algorithm provides better performance than the existing algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.10
• /
• pp.3355-3372
• /
• 2022

Composing music is an inspired yet challenging task, in that the process involves many considerations such as assigning pitches, determining rhythm, and arranging accompaniment. Algorithmic composition aims to develop algorithms for music composition. Recently, algorithmic composition using artificial intelligence technologies received considerable attention. In particular, computational intelligence is widely used and achieves promising results in the creation of music. This paper attempts to provide a survey on the music generation based on the Monte Carlo (MC) algorithm. First, transform the MIDI music format files to digital data. Among these data, use the logistic fitting method to fit the time series, obtain the time distribution regular pattern. Except for time series, the converted data also includes duration, pitch, and velocity. Second, using MC simulation to deal with them summed up their distribution law respectively. The two main control parameters are the value of discrete sampling and standard deviation. Processing the above parameters and converting the data to MIDI file, then compared with the output generated by LSTM neural network, evaluate the music comprehensively.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1496-1499
• /
• 2004

In this paper, we deal with a novel path planning algorithm to find collision-free path for a moving robot to find an appropriate path from initial position to goal position. The robot should make progress by avoiding obstacles located at unknown position. Such problem is called the path planning. We propose so called the subgoal generation algorithm to find an effective collision-free path. The generation and selection of the subgoal are the key point of this algorithm. Several subgoals, if necessary, are generated by analyzing the map information. The subgoal is the candidate for the final path to be pass through. Then selection algorithm is executed to choose appropriate subgoal to construct a correct path. Deep and through explanations are given for the proposed algorithm. Simulation example is given to show the effectiveness of the proposed algorithm.

• IE interfaces
• /
• v.20 no.4
• /
• pp.504-514
• /
• 2007

The multicast routing problem lies in the composition of a multicast routing tree including a source node and multiple destinations. There is a trade-off relationship between cost and delay, and the multicast routing problem of optimizing these two conditions at the same time is a difficult problem to solve and it belongs to a multi-objective optimization problem (MOOP). A multi-objective genetic algorithm (MOGA) is efficient to solve MOOP. A micro-genetic algorithm(${\mu}GA$) is a genetic algorithm with a very small population and a reinitialization process, and it is faster than a simple genetic algorithm (SGA). We propose a multi-objective micro-genetic algorithm (MO${\mu}GA$) that combines a MOGA and a ${\mu}GA$ to find optimal solutions (Pareto optimal solutions) of multicast routing problems. Computational results of a MO${\mu}GA$ show fast convergence and give better solutions for the same amount of computation than a MOGA.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.13-20
• /
• 2013

In this paper, we propose a multi-scale crack detection method. This method uses decomposition, composition, and shape properties. It is based on morphology algorithm, crack features. We use a morphology operator which extracts patterns of crack. It segments cracks and background using opening and closing operations. Morphology based segmentation is better than existing integration methods using subtraction in detecting a crack it has small width. However, morphology methods using only one structure element could detect only fixed width crack. Thus, we use decomposition and composition methods. We use a decimation method for decomposition. After decomposition and morphology operation, we get edge images given by binary values. Our method calculates values of properties such as the number of pixels and the maximum length of the segmented region. We decide whether the segmented region belongs to cracks according to those data. Experimental results show that our proposed multi-scale crack detection method has better results than those of existing detection methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.863-870
• /
• 1993

A new methodology of multimedia data composition generated SRT(Synchronization Relation Tree) dynamically after user composing multimedia date by using high level user interface, and processes message passing protocols to adjust multimedia data temporal composition. In this paperl we propose SRT generating algorithm which transfer user defined timeline diagram to SRT dynamically. SRT generating algorithm is to use divide and conquer methodology and recurvise programming. And prove that it generates and type of multimedia date compositon to SRT.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.171-174
• /
• 2003

In this paper, we propose the method of stereo images composition using adaptive dense disparity estimation. For the correct composition of stereo image and 3D virtual object, we need correct marker position and depth information. The existing algorithms use position information of markers in stereo images for calculating depth of calibration object. But this depth information may be wrong in case of inaccurate marker tracking. Moreover in occlusion region, we can't know depth of 3D object, so we can't composite stereo images and 3D virtual object. In these reasons, the proposed algorithm uses adaptive dense disparity estimation for calculation of depth. The adaptive dense disparity estimation is the algorithm that use pixel-based disparity estimation and the search range is limited around calibration object.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.9 no.2
• /
• pp.75-79
• /
• 2009

A system-on-a-chip communication architecture has a significant impact on the performance and power consumption of modern multi-processors system-on-chips (MPSoCs). However, customization of such architecture for a specific application requires the exploration of a large design space. Thus, system designers need tools to rapidly explore and evaluate communication architectures. In this paper we present the method for application-specific low-power bus architecture synthesis at system-level. Our paper has two contributions. First, we build a bus power model of AMBA AXI bus communication architecture. Second, we incorporate this power model into a low-power architecture exploration algorithm that enables system designers to rapidly explore the target bus architecture. The proposed exploration algorithm reduces power consumption by 20.1% compared to a maximally connected reduced matrix, and the area is also reduced by 20.2% compared to the maximally connected reduced matrix.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.6
• /
• pp.1091-1098
• /
• 2010

Victory and defeat of the war depends on follow-on logistics support. The spending time of follow-on logistics support at combat area is greatly influenced by the degree of combat intensity. The main purpose of this study is to compose a optimal supply route for operational sustainability of combat unit at combat area using transport vehicles. This study suggests a composition of optimal supply route for follow-on logistics support which considers the degree of combat intensity. A mathematical programming model and a genetic algorithm suggest to minimize the total spending time of follow-on logistics support. The suggested mathematical programming model is verified by using CPLEX 11.1. This study computes supply route, total spending time, total travel distance, and the number of transport vehicle.