• Journal of Mechanical Science and Technology
• /
• v.18 no.11
• /
• pp.1923-1931
• /
• 2004

Manufacturing of complex surface plates in stern and stem is a major factor in cost of a preliminary ship design by computing process. If these hull plate parts are effectively classified, it helps to compute the processing cost and find the way to cut-down the processing cost. This paper presents a new method to classify surface plates effectively in the preliminary ship design using neural network. A neural-network-based ship hull plate classification program was developed and tested for the automatic classification of ship design. The input variables are regarded as Gaussian curvature distributions on the plate. Various applicable rules of network topology are applied in the ship design. In automation of hull plate classification, two different numbers of input variables are used. By observing the results of the proposed method, the effectiveness of the proposed method is discussed. As a result, high prediction rate was achieved in the ship design. Accordingly, to the initial design stage, the ship hull plate classification program can be used to predict the ship production cost. And the proposed method will contribute to reduce the production cost of ship.

• Journal of Korea Water Resources Association
• /
• v.35 no.2
• /
• pp.187-194
• /
• 2002

To improve the accuracy of the areal rainfall estimates over a river basin, the optimal design method of rainfall network was studied using the stochastic characteristics of measured rainfall data. The objective function was constructed with the estimation error of areal rainfall and observation cost of point rainfall and the observation sites with minimum objective function value were selected as the optimal network. As a stochastic variance estimator, kriging model was selected to minimize the error terms. The annual operation cost including the installation cost was considered as the cost terms and an accuracy equivalent parameter was used to combine the error and cost terms. The optimal design method of rainfall network was studied in the Yongdam dam basin whose raingauge numbers need to be enlarged for the optimal rainfall networks of the basin.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.11-16
• /
• 1998

The classical algorithm for solving liner network flow problems are primal cost improvement method, including simplex method, which iteratively improve the primal cost by moving flow around simple cycles, which iteratively improve the dual cost by changing the prices of a subset of nodes by equal amounts. Typical iteration/shortest path algorithm is used to improve flow problem of liner network structure. In this paper we stdudied about the implemental method of shortest path which is a practical computational aspects. This method can minimize the best neighbor node and also implement the typical iteration which is $\varepsilon$-CS satisfaction using the auction algorithm of linear network flow problem

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.467-470
• /
• 1998

In this paper, we propose a matrix star graph which improves the network cost of the well-known star grah as an interconnection network. We analyze its characteristics in terms of the network parameters, such as degree, scalability, routing, and diameter. The proposed matrix star graph MS2,n has the half degrees of a star graph S2n with the same number of nodes and is an interconnection network with the properties of node symmetry, maximum fault tolerance, and recursive structure. In network cost, a matrix star graph MS2,n and a star graph S2n are about 3.5n2 and 6n2 respectively which means that the former has a better value by a certain constant than the latter has.

• Proceedings of the KIEE Conference
• /
• 2000.11a
• /
• pp.223-225
• /
• 2000

Network congestion is important problem that must be managed for active power contracts in deregulated power industry. Existing network partition technique is based on statistical method don't suggest clear network partition criterion. So in this paper we proposed a new network partition technique using the marginal cost sensitivity to fairly allocate congestion cost to network user.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.1
• /
• pp.82-88
• /
• 2007

This paper considers a topological optimization of a computer network design with a cost constraint. The objective is to find the topological layout of links, at maximal reliability, under the constraint that the network cost is less or equal than a given level of budget. This problem is known to be NP-hard. To efficiently solve the problem, a genetic approach is proposed. Two illustrative examples are used to explain and test the proposed approach. Experimental results show evidence that the proposed approach performs more efficiently for finding a good solution or near optimal solution in comparison with a simulated annealing method.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.210-218
• /
• 2021

CNN (Convolutional Neural Network), a type of deep learning algorithm, is a type of artificial neural network used to analyze visual images. In deep learning, it is classified as a deep neural network and is most commonly used for visual image analysis. Accordingly, an AI autonomous driving model was constructed through real-time image processing, and a crosswalk image of a road was used as an obstacle. In this paper, we proposed a low-cost model that can actually implement autonomous driving based on the CNN model. The most well-known deep neural network technique for autonomous driving is investigated and an end-to-end model is applied. In particular, it was shown that training and self-driving on a simulated road is possible through a practical approach to realizing lane detection and keeping.

• Convergence Security Journal
• /
• v.13 no.1
• /
• pp.11-17
• /
• 2013

In this paper, the information security requirements in the mobile ad-hoc network(MANET) are presented, and the algorithm to establish the protection node(gateway) is proposed to prevent the distributed denial of service(DDoS). The information security technology and security threats in the MANET are presented, and protection node is decided to minimize the total cost through the sending nodes and receiving nodes by way of protection node. To set up the protection node, the minimization algorithms of maximum cost and the average cost between the protection node and receiving nodes are compared with the optimal solutions, in which optimal solution is found out by all enumeration method. From the results, the total cost between the sending and receiving nodes is minimized under the average cost minimization algorithm rather than the using of the maximum cost.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.59-64
• /
• 2016

This paper suggests heuristic algorithm with O(mn) polynomial time complexity using Excel for partially survivable networks optimization problem of cellular telecommunication systems with m cells and n hubs. This problem only can be get the solution using linear programming or LINGO software package. The proposed algorithm connects the cell to hubs in ring network with minimum cost as the connection diversity of each cell. If the traffic of ring network (T) is T>2K for ring capacity (K), we adjust the maximum cost hub to MTSO that has a ascending order of (D/DC)/${\Delta}^+$ cell with each cell traffic demand (D) and ${\Delta}^+$=(MTSO cost-maximum cost hub) than we get the $T{\leq}2K$. Finally, we adjust MTSO to the removed maximum cost hub for the cell with 2K-$T{\geq}$(D/DC) and $_{max}{\Delta}^-$. While we using like this simple method, the proposed algorithm can be get the same optimal solution for experimental data as linear programing and LINGO software package.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.3
• /
• pp.81-89
• /
• 2000

The real-time multicast problem is to construct a multicast tree starting from a source node and including multiple destination nodes and that has minimum network cost with delay constraints. It is known that to find a tree of the minimum network cost is the Steiner Tree problem which is NP-complete. In this paper, we propose a genetic algorithm to solve the multicast tree with minimum network cost and the delay constraints. The computational results obtained by comparing an existing algorithm. Kompella algorithm, and the proposed algorithm show that our algorithm tends to find lower network cost on the average than Kompella algorithm does.