• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.2
• /
• pp.13-22
• /
• 2005

To improve the anomaly IDS using system calls, this study focuses on Neural Networks Learning using the Soundex algorithm which is designed to change feature selection and variable length data into a fixed length learning pattern. That is, by changing variable length sequential system call data into a fixed length behavior pattern using the Soundex algorithm, this study conducted neural networks learning by using a backpropagation algorithm with fuzzy membership function. The back-propagation neural networks and Neuro-Fuzzy technique are applied for anomaly intrusion detection of system calls using Sendmail Data of UNM to demonstrate its aspect of he complexity of time, space and MDL performance.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.7
• /
• pp.17-24
• /
• 2009

Increasing use of information system has led to larger amount of developing expenses and demands on software. Until recent days, the model using regression analysis based on statistical algorithm has been used. However, Machine learning is more investigated now. This paper estimates the software cost using SVR(Support Vector Regression). a sort of machine learning technique. Also, it finds the best set of parameters applying immune algorithm. In this paper, software cost estimation is performed by SVR based on immune algorithm while changing populations, memory cells, and number of allele. Finally, this paper analyzes and compares the result with existing other machine learning methods.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.2
• /
• pp.66-73
• /
• 1997

In many optimal methods for the structural design, the structural analysis is performed with the given design parameters. Then the design sensitivity is calculated based on its structural anaysis results. There-after, the design parameters are changed iteratively. But genetic algorithm is a optimal searching technique which is not depend on design sensitivity. This method uses for many design para- meter groups which are generated by a designer. The generated design parameter groups are become initial population, and then the fitness of the all design parameters are calculated. According to the fitness of each parameter, the design parameters are optimized through the calculation of reproduction process, degradation and interchange, and mutation. Those are the basic operation of the genetic algorithm. The changing process of population is called a generation. The basic calculation process of genetic algorithm is repeatly accepted to every generation. Then the fitness value of the element of a generation becomes maximum. Therefore, the design parameters converge to the optimal. In this study, the optimal design pro- cess of a machine tool structure for static loading is presented to determine the optimal base supporting points and structure thickness using a genetic algorithm.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.667-668
• /
• 2015

While the plant projects grow bigger and global attention to the plant is increasing, efficient space arrangement is not working in plant project because of the complex structure in installing the equipment unlike the construction project. In addition to this, presently, problem in installation process caused by the disagreement between floor plan and real spot is rising. Therefore the target of this research is to solve the problems and reaction differences, caused by changing the space arrangement in installing the equipment of plant construction. And this research suggests the equipment arrangement method for construction and related processes. To solve the problem, 3D cloud point data of space and equipment is collected by 3D laser scanning and the space matching is operated. In processing the space matching, data is simplified by applying the octree algorithm. This research simplifies the 3D configuration data acquired by 3D scanner equipment through the octree algorithm, and by comparing this data, identifies the space for target equipment, and finally suggests the algorithm that makes the auto space arrangement of equipment possible in construction site and also suggests the process to actualize this algorithm.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.3
• /
• pp.360-369
• /
• 2001

This paper proposes the groupwise serial cross interference cancellation(GSCIC) algorithm for coherent detection and analyzes the groupwise serial block interference cancellation(GSBIC) and GSCIC algorithm for an asynchronous wideband DS-CDMA system in a single cell over multipath fading channels. In general, the GSIC algorithm can be grouped into two classes: i.e., GSBIC and GSCIC algorithm. In this paper, the proposed GSCIC algorithm is to improve the performance of the GSBIC algorithm. We compare the performance of the GSCIC and existing GSBIC algorithm in a multipath fading channel to that of the existing SIC algorithm. As a result, the performance of GSCIC algorithm is somewhat better compared with the GSBIC algorithm according to reduction factor $R_{f}$ and is similar to that of the SIC algorithm. And also, the GSBIC and GSCIC algorithms have the advantage that it can be analyzed system performance easily, changing the number of users within a user group according to system capacity.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.3
• /
• pp.1-8
• /
• 2015

In transportation networks, searching speed and result accuracy are becoming more critical on searching minimum path algorithm. Current $A^*$ algorithm has a big advantage of high searching speed. However, it has disadvantage of complicated searching network and low accuracy rate of finding the minimum path algorithm. Therefore, this study developed $A^*$ algorithm's heuristic function and focused on improving it's disadvantages. Newly developed function in this study contains the area concept, not the line concept. During the progress, this study adopts the idea of a heavier node that remains lighter to the target node is better that the lighter node that becomes heavier when it is connected to the other. Lastly, newly developed algorithm has the feedback function, which allows the larger accuracy value of heuristic than before. This developed algorithm tested on real network, and proved that developed algorithm is useful.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.7-9
• /
• 2000

This paper deals with optimal power flow, which is optimal problem with equality constraints and inequality constraints. An a1gorithm of changing inequality constraints problem to equality constraints problem is applied to real systems.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.5
• /
• pp.767-774
• /
• 1990

Successive images can be reconstructed without great degradation by using one codebook in vector quantization, because statistics of successive images are sinilar. In this paper, we propose a method to update vector centroids in one slot of an image sequence and reconstruct images with the codebook replenished with the updated vector centroids. To remove the overhead required to transmit the updated vector centroids, we catagorize image blocks into changing blocks and nonchanging blocks, and then transmit only the labels of the changing blocks. Therefore, we can assign the remaining bits to the replenishment of a codebook. By the proposed method, almost the same image as the same image as the one reconstructed by LBG algorithm can be obtained and the bit rate can be reduced to below 0.5 bit/pixel.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.368-371
• /
• 1999

In this paper, we propose a neural network processor architecture with on-chip learning and with reconfigurability according to the data dependencies of the algorithm applied. For the neural network model applied, the proposed architecture can be configured into either SIMD or SRA(Systolic Ring Array) without my changing of on-chip configuration so as to obtain a high throughput. However, changing of system configuration can be controlled by user program. To process activation function, which needs amount of cycles to get its value, we design it by using PWL(Piece-Wise Linear) function approximation method. This unit has only single latency and the processing ability of non-linear function such as sigmoid gaussian function etc. And we verified the processing mechanism with EBP(Error Back-Propagation) model.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.415-419
• /
• 1997

The left ventricular relaxation rate is used as a golden standard which describes the left ventricular diastolic unction. So far, to get the rate of relaxation one should calculate the data after full recording, that is, off-line method. Therefore one cannot get the rate of relaxation in real-time while changing loading condition or infusing drug. But real time monitoring of the relaxation rate is necessary while changing loading condition or infusing drug to control the mechanics of heart and to get more information. We propose a new criterion to get the left ventricular relaxation rate and a real time algorithm. By comparison, it was turned out that our criterion outperforms others criterion.