• Journal of the Korean Society for Railway
• /
• v.9 no.3 s.34
• /
• pp.257-263
• /
• 2006

This paper presents an optimization approach to the configuration of train radio communication network for CBTC. The target specifications of CBTC communication systems are derived from technical requirements for CBTC. The proposed communication system has a ring-topology backbone communication network between stations and a radio network based on IEEE 802.11b wireless tan between trains and wayside devices. The proposed method has been applied to the standardization of the signalling system of urban transits.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.8
• /
• pp.753-759
• /
• 2009

Feed-forward neural networks have been widely used as function approximation tools in the context of global approximate optimization. In the present study, a wavelet neural network (WNN) which is based on wavelet transform theory is suggested as an alternative to a traditional back-propagation neural network (BPN). The basic theory of wavelet neural network is briefly described, and approximation performance is tested using a nonlinear multimodal function and a composite rotor blade analysis problem. Laplacian of Gaussian function, Mexican function, and Morlet function are considered during the construction of WNN architectures. In addition, approximation results from WNN are compared with those from BPN.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.8 no.4 s.23
• /
• pp.68-76
• /
• 2005

In this paper, Ad-hoc network is a collection of mobile nodes without any wired infrastructure. Design of efficient routing protocols in ad-hoc network is a challenging issue. An AODV routing protocol for wireless ad hoc networks one that searches for and attempts to discover a route to some destination node. We propose a technique that reduce the number of Routing packet. Our technique use variable values reflecting the condition of network. This also contributes to improve throughput.

• Journal of Mechanical Science and Technology
• /
• v.20 no.11
• /
• pp.1873-1880
• /
• 2006

The results of this study suggest the use of a Back Propagation Network (BPN) algorithm for the detection of esophageal erosions or abnormalities - which are the important signs of esophagitis - in the analysis of the color and textural aspects of clinical images obtained by endoscopy. The authors have investigated the optimization of the learning condition by the number of neurons in the hidden layer within the structure of the neural network. By optimizing learning parameters, we learned and have validated esophageal erosion images and/or ulcers functioning as the critical diagnostic criteria for esophagitis and associated abnormalities. Validation was established by using twenty clinical images. The success rates for detection of esophagitis during calibration and during validation were 97.91% and 96.83%, respectively.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.17-26
• /
• 1998

Shortest path problem in road network with turn penalties and prohibitions frequently arises from various transportation optimization models. In this paper, we propose a new algorithm for the shortest Path problem with turn prohibitions and delays. The proposed algorithm maintains distance labels of arcs, which is similar to labels of nodes of Dijkstra's algorithm. Fibonacci heap implementation of the proposed algorithm solves the problem in O(mn ＋ mlogm). We provide a new insight in transforming network with turn penalties and prohibitions into another network in which turn penalties and prohibitions are implicitly considered. The proposed algorithm is implemented using new data structure and compared with Ziliaskopoulos' algorithm. Computational results show that the proposed algorithm is very efficient.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.1
• /
• pp.1-13
• /
• 2006

In this paper we consider a design problem of a cyclic queueing network with two stages, each with a local buffer of limited capacity. Based on the theory of reversibility and product-form solution, we derive the throughput function of the network as a key performance measure to maximize. Two cases are considered. In case each stage consists of a single server, an optimal allocation policy of a given buffer capacity and work load between stages as well as the optimal number of customers is identified by exploiting the properties of the throughput function. In case each stage consists of multiple servers, the optimal policy developed for the single server case doesn't hold any more and an algorithm is developed to allocate with a small number of computations a given number of servers, buffer capacity as well as total work load and the total number of customers. The differences of the optimal policies between two cases and the implications of the results are also discussed. The results can be applied to support the design of certain manufacturing and computer/communication systems.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.493-496
• /
• 2000

We study the problem of designing at minimum cost a two-connected network topology such that the shortest cycle to which each edge belongs does not exceed a given maximum number of hops. This problem is considered as part of network planning and arises in the design of backbone networks. We propose a genetic algorithm approach that uses a solution representation, in which the connectivity and ring constraints can be easily encoded. We also propose a crossover operator that ensures a generated solution is feasible. By doing so, the checking of constraints is avoided and no repair mechanism is required. We carry out experimental evaluations to investigate the solution representation issues and GA operators for the network design problem.

• Journal of Information Processing Systems
• /
• v.8 no.1
• /
• pp.1-20
• /
• 2012

The most important criterion for achieving the maximum performance in a wireless mesh network (WMN) is to limit the interference within the network. For this purpose, especially in a multi-radio network, the best option is to use non-overlapping channels among different radios within the same interference range. Previous works that have considered non-overlapping channels in IEEE 802.11a as the basis for performance optimization, have considered the link quality across all channels to be uniform. In this paper, we present a measurement-based study of link quality across all channels in an IEEE 802.11a-based indoor WMN test bed. Our results show that the generalized assumption of uniform performance across all channels does not hold good in practice for an indoor environment and signal quality depends on the geometry around the mesh routers.

• ETRI Journal
• /
• v.36 no.6
• /
• pp.960-967
• /
• 2014

In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.11a
• /
• pp.148-150
• /
• 2016

영상 신호에 대해 인공지능적인 프로세스를 수행하는 방법들 중에 우수한 성능을 나타내면서 주목을 끌고 있는 방법으로 Convolution Neural Network(CNN)이 있다. 이를 구성할 때 전반부는 convolution network로 구현되고, 후반부는 Neural Network(NN)로 구현된다. 이때, 전반부에서 convolution 과정을 수행하기 위해 다양한 필터가 사용되는데, 이 필터들의 초기값에 따라 CNN의 성능이 달라지게 된다. 본 논문에서는 CNN의 성능을 향상시키기 위해 convolution network의 초기값을 설정하는 방법에 대해 제안하며, 이를 컴퓨터 실험을 통해 증명하기 위해 필기체 인식이라는 응용 알고리즘을 구현하였다.