• Proceedings of the KSR Conference
• /
• 1999.11a
• /
• pp.46-53
• /
• 1999

As of July 1999, i,185 lomocotives(excluding metropolitan area electric locomotives) are in Korean National Railroad(KNR). With this limited number of resources assigning locomotives to each trains of timetable is very important in the entire railway management point of view because schedule can be regarded as goods in transportation industry. On a simple rail network, it is rather easier to assign proper locomotives to trains with the experience of operating experts and get optimal assignment solution. However, as the network is getting bigger and complicated, the number of trains and corresponding locomotives will be dramatically increased to rover all the demands required to service all of the trains in timetable. There will be also numerous operational constraints to be considered. Assigning proper locomotives to trains and building optimal cyclic rotations of locomotive routings will result in increasing efficiency of schedule and giving a guarantee of more profit. The purpose of this study is two fold: (1) we consider a planning-level locomotive scheduling problem with the objective of minimizing the wasting cost under various practical constraints and (2) development of implementation prototype program of its assigning result. Not like other countries, i.e. Canada, Sweden, Korean railroad operates on n daily schedule basis. The objective is to find optimal assignment of locomotives of different types to each trains, which minimize the wasting cost. This problem is defined on a planning stage and therefore, does not consider operational constraints such as maintenance and emergency cases. Due to the large scale of the problem size and complexity, we approach with heuristic methods and column generation to find optimal solution. The locomotive scheduling prototype consists of several modules including database, optimization engine and diagram generator. The optimization engine solves MIP model and provides an optimal locomotive schedule using specified optimization algorithms. A cyclic locomotive route diagram can be generated using this optimal schedule through the diagram generator.

• International Journal of Computer Science & Network Security
• /
• v.24 no.6
• /
• pp.8-16
• /
• 2024

Communication with the deaf has always been crucial. Deaf and hard-of-hearing persons can now express their thoughts and opinions to teachers through sign language, which has become a universal language and a very effective tool. This helps to improve their education. This facilitates and simplifies the referral procedure between them and the teachers. There are various bodily movements used in sign language, including those of arms, legs, and face. Pure expressiveness, proximity, and shared interests are examples of nonverbal physical communication that is distinct from gestures that convey a particular message. The meanings of gestures vary depending on your social or cultural background and are quite unique. Sign language prediction recognition is a highly popular and Research is ongoing in this area, and the SVM has shown value. Research in a number of fields where SVMs struggle has encouraged the development of numerous applications, such as SVM for enormous data sets, SVM for multi-classification, and SVM for unbalanced data sets.Without a precise diagnosis of the signs, right control measures cannot be applied when they are needed. One of the methods that is frequently utilized for the identification and categorization of sign languages is image processing. African Buffalo Optimization using Support Vector Machine (ABO+SVM) classification technology is used in this work to help identify and categorize peoples' sign languages. Segmentation by K-means clustering is used to first identify the sign region, after which color and texture features are extracted. The accuracy, sensitivity, Precision, specificity, and F1-score of the proposed system African Buffalo Optimization using Support Vector Machine (ABOSVM) are validated against the existing classifiers SVM, CNN, and PSO+ANN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3701-3727
• /
• 2016

Recently Service Function Chaining (SFC) is promising to innovate the network service mode in modern networks. However, a feasible implementation of SFC is still difficult due to the need to achieve functional equivalence with traditional modes without sacrificing performance or increasing network complexity. In this paper, we present a configurable network service chaining (CNSC) mechanism to provide services for network traffics in a flexible and optimal way. Firstly, we formulate the problem of network service chaining and design an effective service chain construction framework based on integrating software-defined networking (SDN) with network functions virtualization (NFV). Then, we model the service path computation problem as an integer liner optimization problem and propose an algorithm named SPCM to cooperatively combine service function instances with a network utility maximum policy. In the procedure of SPCM, we achieve the service node mapping by defining a service capacity matrix for substrate nodes, and work out the optimal link mapping policies with segment routing. Finally, the simulation results indicate that the average request acceptance ratio and resources utilization ratio can reach above 85% and 75% by our SPCM algorithm, respectively. Upon the prototype system, it is demonstrated that CNSC outperforms other approaches and can provide flexible and scalable network services.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.1
• /
• pp.9-15
• /
• 2021

Recently, it is increasingly necessary to run high-end neural network applications with huge computation overhead on top of resource-constrained embedded systems, such as wearable devices. While the huge computational overhead can be alleviated by distributed neural networks running on multiple separate devices, existing distributed neural network techniques suffer from a large traffic between the devices; thus are very vulnerable to communication failures. These drawbacks make the distributed neural network techniques inapplicable to wearable devices, which are connected with each other through unstable and low data rate communication medium like human body communication. Therefore, in this paper, we propose a distributed neural network partitioning technique that is resilient to communication failures. Furthermore, we show that the proposed technique also improves the inference accuracy even in case of no communication failure, thanks to the improved network partitioning. We verify through comparative experiments with a real-life neural network application that the proposed technique outperforms the existing state-of-the-art distributed neural network technique in terms of accuracy and resiliency to communication failures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2372-2380
• /
• 2015

In this paper, we propose frequency allocation and path selection scheme in underlay cognitive radio (CR) networks using network coding. In the proposed scheme, we choose the path with consideration of network coding and interference temperature in underlay CR networks and propose an optimization problem to maximize the system throughput of secondary users (SUs). Then, we represent the proposed optimization problem as the multi-dimensional multiple-choice knapsack problem and give the theoretical upper bound for the system throughput of SUs by using linear programming. Finally, we compute the system throughput of SUs by using brute-force search (BFS) and link quality first (LQF) scheme in underlay CR networks. Simulation results show that the system throughput of SUs with BFS is higher than that with LQF in underlay CR networks with and without application of network coding, respectively.

• Journal of Korea Water Resources Association
• /
• v.32 no.5
• /
• pp.557-564
• /
• 1999

Monitoring of groundwater Quality is essential for the preservation of groundwater resources. In practice. however, groundwater monitoring network is designed based on the experience and intuition of experts or on the convenience. This study proposes a simulation-optimization approach for the optimal design of monitoring networks. In it, the predicted three-dimensional concentration data are used as the input of an optimization problem. Various design objectives and constraints are considered and the problem is formulatcu as the 0-1 integer programming. The methodology was applied to a sanitary landfill site. The results show that the monitoring network configuration changes as the monitoring goal, operation time and constraints vary. The proposed method turns out to be an efficient tool for the wide range of groundwater Quality monitoring network design problems.oblems.

• Journal of Korean Society of Transportation
• /
• v.26 no.5
• /
• pp.175-184
• /
• 2008

Uncertainties are unavoidable in engineering applications. In this paper we propose an alpha reliable multi-variable network design problem under demand uncertainty. In order to decide the optimal capacity enhancement, three performance measures based on 3E(Efficiency, Equity, and Environmental) are considered. The objective is to minimize the total budget required to satisfy alpha reliability constraint of total travel time, equity ratio, and total emission, while considering the route choice behavior of network users. The problem is formulated as the chance-constrained model for application of alpha confidence level and solved as a lexicographic optimization problem to consider the multi-variable. A simulation-based genetic algorithm procedure is developed to solve this complex network design problem(NDP). A simple numerical example ispresented to illustrate the features of the proposed NDP model.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.4
• /
• pp.463-468
• /
• 2007

Some network equipments made in Korea were exposed to severe earthquake in Japan several years ago. More than a hundred slim base transfer network stations had been seized with the severe earthquake at Nigata and it was reported that less than fifteen sets showed blackout by interruption of electricity, not by the structural failure. The purpose of this paper is to check the structural safety of the network equipments by performing table test, and the static and dynamic finite element analysis. For the dynamic test, the station weighing 200 kg was subjected to the Zone 3 earthquake loading of GR-63-CORE on the shaking table to obtain the dynamic responses to compare with the analysis results. It is shown that the FE analysis results are a little bit larger than that of the experimental values. And the sensitivity analysis and optimization for the natural frequency is performed and it is found that the first natural frequency is sensitive to small design change as shown in the results. And the dynamic response of optimized design is less than the original design.

• Journal of Digital Convergence
• /
• v.11 no.10
• /
• pp.419-429
• /
• 2013

The Wireless sensor network(WSN) consisting of a large number of sensors aims to gather data in a variety of environments. The sensor nodes operate on battery of limited power. so, To extend network life time is major goals of research in the WSN. In this paper, we state the key point of a energy consumption with minimum&load balancing. The proposed protocol guarantee balance of number of cluster member nodes using the node memory threshold and optimization of distribution of cluster head using the optimized clustering method. The results show that the proposed protocol could support the load balancing and high energy efficiency by distributing the clusters with a reasonable number of member nodes. The simulation results show that our schme ensure longer life time in WSN as compare with existing schemes such as LEACH and CBLM.

• Journal of IKEEE
• /
• v.16 no.2
• /
• pp.102-108
• /
• 2012

3-dimensional integrated circuits (3D-ICs) have some problems for power delivery network design due to larger supply currents and larger power delivery paths compared to 2D-IC. The power delivery network consists of power bumps & through-silicon-vias (TSVs), and IR-drop at each node varies with the number and location of power bumps & TSVs. It is important to optimize the power bumps & TSVs while IR-drop constraint is satisfied in order to operate chip ordinarily. In this paper, the power bumps & TSVs optimization with optimized power mesh structure for power delivery network in 3D-ICs is proposed.