• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.793-806
• /
• 2002

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the highspeed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps (SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. The mapping preserves the topology of the feature vectors. The map is called topological feature map. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data. and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. In topological feature map, there are empty nodes in which no image is classified. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• Korean Management Science Review
• /
• v.27 no.3
• /
• pp.1-14
• /
• 2010

In this paper we study the access network design problem in Universal Mobile Telecommunication Systems (UMTS) networks. Given the location of radio base stations (node-Bs), their traffic demands, and the candidate facility centers for locating radio network controllers (RNCs), the problem is to determine the configuration of access network, including the number and location of facility centers, the number of RNCs in each facility center, and the links between RNCs and node-Bs, with the objective being to design such a network at the minimum cost. We provide a mathematical formulation of the problem with constraints on RNC and node-B capacities, along with a lower bounding method. We develop a heuristic algorithm with two different initial solution methods designed to strengthen the solution quality. The computational efficacy of their procedures is then demonstrated on a number of test problems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.69-83
• /
• 1994

This paper deals with a capacitated ring-star network design problem (CRSNDP) with node capacity constraints. The CRSNDP is formulated as a mixed 0-1 integer problem, and a 2-phase heuristic solution procedure, ADD & VAM and RING, is developed, in which the CRSNDP is decomposed into two subproblems : the capacitated facility location problem (CFLP) and the traveling sales man problem (TSP). To solve the CFLP in phase I the ADD & VAM procedure selects hub nodes and their appropriate capacity from a candidate set and then assigns them user nodes under node capacity constraints. In phase II the RING procedure solves the TSP to interconnect the selected hubs to form a ring. Finally a solution of the CRSNDP can be achieved through combining two solution of phase I & II, thus a final design of the capacitated ring-star network is determined. The analysis of computational results on various random problems has shown that the 2-phase heuristic procedure produces a solution very fast even with large-scale problems.

• Structural Engineering and Mechanics
• /
• v.5 no.1
• /
• pp.69-83
• /
• 1997

A new efficient hybrid/mixed thin~moderately thick plate bending element with 6-node (HM6-14) is formulated based on the Reissner-Mindlin plate bending theory. The convergence of this element is proved by error estimate theories and verified by patch test respectively. Numerical studies on such an element as HM6-14 demonstrate that it has remarkable convergence, invariability to geometric distorted mesh situations, to axial rotations, and to node positions, and no "locking" phenomenon in thin plate limit. The present element is suitable to many kinds of shape and thin~moderately thick plate bending problems. Further, in comparison with original hybrid/mixed plate bending element HP4, the present element yields an improvement of solutions. Therefore, it is an efficient element and suitable for the development of adaptive multi-field finite element method (FEM).

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.189-197
• /
• 1999

Assembly line balancing problem is known as one of difficult combinatorial optimization problems. This problem has been solved with linear programming, dynamic programming approaches. but unfortunately these approaches do not lead to efficient algorithms. Recently, genetic algorithm has been recognized as an efficient procedure for solving hard combinatorial optimization problems, but has a defect that requires long-run time and computational complexties to find the solution. For this reason, we adapt a new method called the Critical Node Method that is intuitive, easy to understand, simple for implementation. Fuzzy set theory is frequently used to represent uncertainty of information. In this paper, to treat the data of real world problems we use a fuzzy number to represent the duration and Critical Node Method based heuristic procedure is developed for solving fuzzy assembly line balancing problem.

• Structural Engineering and Mechanics
• /
• v.40 no.1
• /
• pp.121-148
• /
• 2011

Closed form solutions for equilibrium and flexibility matrices of the Mindlin-Reissner theory based eight-node rectangular plate bending element (MRP8) using Integrated Force Method (IFM) are presented in this paper. Though these closed form solutions of equilibrium and flexibility matrices are applicable to plate bending problems with square/rectangular boundaries, they reduce the computational time significantly and give more exact solutions. Presented closed form solutions are validated by solving large number of standard square/rectangular plate bending benchmark problems for deflections and moments and the results are compared with those of similar displacement-based eight-node quadrilateral plate bending elements available in the literature. The results are also compared with the exact solutions.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.2
• /
• pp.199-214
• /
• 2020

This paper describes the development of a parallel computational algorithm based on the finite element tearing and interconnecting (FETI) method that uses a local Lagrange multiplier. In this approach, structural computational domain is decomposed into non-overlapping sub-domains using local Lagrange multiplier. The local Lagrange multipliers are imposed at interconnecting nodes. 8-node solid element using extra shape function is adopted by using the representative volume element (RVE). The parallel computational algorithm is further established based on message passing interface (MPI). Finally, the present FETI-local approach is implemented on parallel hardware and shows improved performance.

• The korean journal of orthodontics
• /
• v.47 no.6
• /
• pp.353-364
• /
• 2017

Objective: The objective of this study was to investigate the effects of miniscrew-assisted rapid palatal expansion (MARPE) on changes in airflow in the upper airway (UA) of an adult patient with obstructive sleep apnea syndrome (OSAS) using computational fluid-structure interaction analysis. Methods: Three-dimensional UA models fabricated from cone beam computed tomography images obtained before (T0) and after (T1) MARPE in an adult patient with OSAS were used for computational fluid dynamics with fluid-structure interaction analysis. Seven and nine cross-sectional planes (interplane distance of 10 mm) in the nasal cavity (NC) and pharynx, respectively, were set along UA. Changes in the cross-sectional area and changes in airflow velocity and pressure, node displacement, and total resistance at maximum inspiration (MI), rest, and maximum expiration (ME) were investigated at each plane after MARPE. Results: The cross-sectional areas at most planes in NC and the upper half of the pharynx were significantly increased at T1. Moreover, airflow velocity decreased in the anterior NC at MI and ME and in the nasopharynx and oropharynx at MI. The decrease in velocity was greater in NC than in the pharynx. The airflow pressure in the anterior NC and entire pharynx exhibited a decrease at T1. The amount of node displacement in NC and the pharynx was insignificant at both T0 and T1. Absolute values for the total resistance at MI, rest, and ME were lower at T1 than at T0. Conclusions: MARPE improves airflow and decreases resistance in UA; therefore, it may be an effective treatment modality for adult patients with moderate OSAS.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.6
• /
• pp.527-532
• /
• 2009

In this paper simulations for the impact into ceramics and/or metal materials have been discussed. To model discrete nature for fracture and damage of brittle materials, we implemented cohesive-law fracture model with a node separation algorithm for the tensile failure and Mohr-Coulomb model for the compressive loading. The drawback of this scheme is that it requires a heavy computational time. This is because new nodes are generated continuously whenever a new crack surface is created. In order to reduce the amount of calculation, parallelization with MPI library has been implemented. For the high-speed impact problems, the mesh configuration and contact calculation changes continuously as time step advances and it causes unbalance of computational load of each processor. Dynamic load balancing technique which re-allocates the loading dynamically is used to achieve good parallel performance. Some impact problems have been simulated and the parallel performance and accuracy of the solutions are discussed.

• Annual Conference of KIPS
• /
• 2011.04a
• /
• pp.564-567
• /
• 2011

Preserving energy of sensor node in wireless sensor network is an effort to prolong the lifetime of network. Energy of sensor node is very crucial because battery powered and irreplaceable. Energy conservation of sensor node is an effort to reduce energy consumption in order to preserve resource for network lifetime. It can be achieved through efficient energy usage by reducing consumption of energy or decrease energy usage while achieving a similar outcome. In this paper, we propose optimization of energy efficient base station assisted hierarchical routing protocol in wireless sensor network, named BSAH, which use base station to controlled overhead of sensor node and create clustering to distribute energy dissipation and increase energy efficiency of all sensor node. Main idea of BSAH is based on the concept of BeamStar, which divide sensor node into group by base station uses directional antenna and maximize the computation energy in base station to reduce computational energy in sensor node for conservation of network lifetime. The performance of BSAH compared to PEGASIS and CHIRON based of hierarchical routing protocol. The simulation results show that BSAH achieve 25% and 30% of improvement on network lifetime.