• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.459-462
• /
• 2000

In this paper, we propose the initial optimized structure of the Radial Basis Function Network which is more simple in the part of the structure and converges more faster than Neural Network with the analysis method using Time-Frequency Localization. When we construct the hidden node with the Radial Basis Function whose localization is similar with an approximation target function in the plane of the Time and Frequency, we make a good decision of the initial structure having an ability of approximation.

• Journal of the Korea Convergence Society
• /
• v.5 no.4
• /
• pp.163-169
• /
• 2014

A stable neural network control scheme for unknown non-linear systems is developed in this paper. While the control variable is optimised to minimize the performance index, convergence of the index is guaranteed asymptotically stable by a Lyapnov control law. The optimization is achieved using a gradient descent searching algorithm and is consequently slow. A fast convergence algorithm using an adaptive learning rate is employed to speed up the convergence. Application of the stable control to a single input single output (SISO) non-linear system is simulated. The satisfactory control performance is obtained.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.460-463
• /
• 1999

In this paper, we proposed an block-based evolvable neural network(BENN). The BENN can optimize it＇s structure and weights simultaneously. It can be easily implemented by FPGA whose connection and internal functionality can be reconfigured. To solve the local minima problem that is caused gradient descent learning algorithm, genetic algorithms are applied for optimizing the proposed evolvable neural network model.

• Korean Management Science Review
• /
• v.26 no.1
• /
• pp.161-169
• /
• 2009

A traffic analysis on the Internet has an advantage for obtaining the characteristics of transferred packets. There were many studies to understand the characteristics of the Internet traffic with mathematical statistical approach. The approach of this study is different from previous studies. We first introduced a virtual network concept to present the Internet as a simplified mathematical model. It also represents each traffic flowing on the Internet as a parallel Gaussian channel on the virtual network. We suggest the optimal capacity of each parallel Gaussian channel using some related studies on the Gaussian channel model.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.03a
• /
• pp.49-52
• /
• 1998

Neural Network has good performance in pattern classification, control and many other fields by learning ability. However, there is effective rule or systematic approach to determine optimal structure. In this paper, we propose a new method to find optimal structure of feed-forward multi-layer neural network as a kind of pruning method. That eliminating redundant elements of neural network. To find redundant elements we analysis error and weight changing with Rough Set Theory, in condition of executing back-propagation leaning algorithm.

• Proceedings of the KIEE Conference
• /
• 2005.07b
• /
• pp.1568-1569
• /
• 2005

This paper presents a method to optimize train radio communication network for train control(CBTC) or multimedia services. To determine the optimized distance between wayside radio stations in a radio communication network constructed along railway, radio frequency allocation and hand-over capability is studied in terms of radio communication cell coverage and roaming feasibility.

• International conference on construction engineering and project management
• /
• 2024.07a
• /
• pp.1285-1285
• /
• 2024

In process plant construction, the implementation of design automation technologies is pivotal in reducing the timeframes associated with the design phase and in enabling the generation and evaluation of a variety of design alternatives, thereby facilitating the identification of optimal solutions. These technologies can play a crucial role in ensuring the successful delivery of projects. Previous research in the domain of design automation has primarily focused on parametric design in architectural contexts and on the automation of equipment layout and pipe routing within plant engineering, predominantly employing rule-based algorithms. Nevertheless, these studies are constrained by the limited flexibility of their models, which narrows the scope for generating alternative solutions and complicates the process of exploring comprehensive solutions using nonlinear optimization techniques as the number of design and engineering parameters increases. This research introduces a framework for automating plant design through the use of generative neural network models to overcome these challenges. The framework is applicable to the layout problems of process plants, covering the equipment necessary for production processes and the facilities for essential resources and their interconnections. The development of the proposed Neural-network (NN) based Generative Design Model unfolds in four stages: (a) Rule-based Model Development: This initial phase involves the development of rule-based models for layout generation and evaluation, where the generation model produces layouts based on predefined parameters, and the evaluation model assesses these layouts using various performance metrics. (b) Neural Network Model Development: This phase transitions towards neural network models, establishing a NN-based layout generation model utilizing Generative Adversarial Network (GAN)-based methods and a NN-based layout evaluation model. (c) Model Optimization: The third phase is dedicated to optimizing the models through Bayesian Optimization, aiming to extend the exploration space beyond the limitations of rule-based models. (d) Inverse Design Model Development: The concluding phase employs an inverse design method to merge the generative and evaluative networks, resulting in a model that outputs layout designs to meet specific performance objectives. This study aims to augment the efficiency and effectiveness of the design process in process plant construction, transcending the limitations of conventional rule-based approaches and contributing to the achievement of successful project outcomes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.216-233
• /
• 2013

Conventional optimization designs of wireless networks mainly focus on spectral efficiency (SE) as a performance metric. However, as diverse media services are emerging, a green wireless network, which not only meets the quality of experience (QoE) requirements for users and also improves energy efficiency (EE), is the most appropriate solution. In this paper, we firstly propose the unit QoE per Watt, which is termed QoE efficiency (QEE), as a user-oriented metric to evaluate EE for wireless networks. We then analyze which is the kind of wireless resource given priority to use under different scenarios to obtain an acceptable QEE. Particularly, power, delay and data-rate related to QoE are separately addressed for several typical services, such as file download, video stream and web browsing services. Next, the fundamental tradeoffs are investigated between QEE and SE for wireless networks. Our analytical results are helpful for network design and optimization to strike a good balance between the users perceived QoE and energy consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.3093-3115
• /
• 2020

Network anomaly detection system plays an essential role in detecting network anomaly and ensuring network security. Anomaly detection system based machine learning has become an increasingly popular solution. However, due to the unbalance and high-dimension characteristics of network traffic, the existing methods unable to achieve the excellent performance of high accuracy and low false alarm rate. To address this problem, a new network anomaly detection method based on data balancing and recursive feature addition is proposed. Firstly, data balancing algorithm based on improved KNN outlier detection is designed to select part respective data on each category. Combination optimization about parameters of improved KNN outlier detection is implemented by genetic algorithm. Next, recursive feature addition algorithm based on correlation analysis is proposed to select effective features, in which a cross contingency test is utilized to analyze correlation and obtain a features subset with a strong correlation. Then, random forests model is as the classification model to detection anomaly. Finally, the proposed algorithm is evaluated on benchmark datasets KDD Cup 1999 and UNSW_NB15. The result illustrates the proposed strategies enhance accuracy and recall, and decrease the false alarm rate. Compared with other algorithms, this algorithm still achieves significant effects, especially recall in the small category.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.8
• /
• pp.1196-1204
• /
• 2022

In this paper, we propose an optimization algorithm that maximizes the network lifetime in wireless ad-hoc networks using the broadcast transmission method. The optimization algorithm proposed in this paper applies tabu search algorithm, a metaheuristic method that improves the local search method using the memory structure. The proposed tabu search algorithm proposes efficient encoding and neighborhood search method to the network lifetime maximization problem. By applying the proposed method to design efficient broadcast routing, we maximize the lifetime of the entire network. The proposed tabu search algorithm was evaluated in terms of the energy consumption of all nodes in the broadcast transmission occurring in the network, the time of the first lost node, and the algorithm execution time. From the performance evaluation results under various conditions, it was confirmed that the proposed tabu search algorithm was superior to the previously proposed metaheuristic algorithm.