• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.11-22
• /
• 1997

The aim of this paper is to develop the B & B type algorithms for globally minimizing concave function under 0-1 knapsack constraint. The linear convex envelope underestimating the concave object function is introduced for the bounding operations which locate the vertices of the solution set. And the simplex containing the solution set is sequentially partitioned into the subsimplices over which the convex envelopes are calculated in the candidate problems. The adoption of cutting plane method enhances the efficiency of the algorithm. These mean valid inequalities with respect to the integer solution which eliminate the nonintegral points before the bounding operation. The implementations are effectively concretized in connection with the branching stategys.

• Structural Engineering and Mechanics
• /
• v.61 no.6
• /
• pp.807-816
• /
• 2017

In this paper, we introduce an efficient new model reduction method, named the automated static condensation method, which is developed for the local analysis of large finite element models. The algebraic multilevel substructuring procedure is modified appropriately, and then applied to the original static condensation method. The retained substructure, which is the local finite element model to be analyzed, is defined, and then the remaining part of the global model is automatically partitioned into many omitted substructures in an algebraic perspective. For an efficient condensation procedure, a substructural tree diagram and substructural sets are established. Using these, the omitted substructures are sequentially condensed into the retained substructure to construct the reduced model. Using several large practical engineering problems, the performance of the proposed method is demonstrated in terms of its solution accuracy and computational efficiency, compared to the original static condensation method and the superelement technique.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.14 no.2
• /
• pp.324-330
• /
• 1990

In this study, in order to perform dynamic design of machine tools reasonably and effectively, a method was formulated to be applicable to the damped structures connected by joints having elasticity and damping by using substructure synthesis method. And a nonlinear solution method was proposed and it formulates the nonlinear parts by describing functions and uses the reducing transformation matrix by the substructure synthesis method. The results of frequency response analysis of a machine tool, where an NC lathe was partitioned by three parts of spindle, housing and bed-base part and the nonlinearity of bearing parts between spindle and housing was modelled, showed force dependency of the response.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.27 no.6
• /
• pp.753-765
• /
• 2003

A finite element code for the numerical solution of the Navier-Stokes equation is parallelized by vertex-oriented domain decomposition. To accelerate the convergence of iterative solvers like conjugate gradient method, parallel block ILU, iterative block ILU, and distributed ILU methods are tested as parallel preconditioners. The effectiveness of the algorithms has been investigated when P1P1 finite element discretization is used for the parallel solution of the Navier-Stokes equation. Two-dimensional and three-dimensional Laplace equations are calculated to estimate the speedup of the preconditioners. Calculation domain is partitioned by one- and multi-dimensional partitioning methods in structured grid and by METIS library in unstructured grid. For the domain-decomposed parallel computation of the Navier-Stokes equation, we have solved three-dimensional lid-driven cavity and natural convection problems in a cube as benchmark problems using a parallelized fractional 4-step finite element method. The speedup for each parallel preconditioning method is to be compared using upto 64 processors.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.46
• /
• pp.33-49
• /
• 1998

In order to improve the performance of relational databases, one has to reduce the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to reduce the number of disk I/O accesses by vertically partitioning relation into fragments and allowing attribute replication to fragments if necessary. When zero-one integer programming model is solved by the branch-and-bound method, it requires much computing time to solve a large sized problem. Therefore, heuristic solutions using genetic algorithm(GA) are presented. GA in this paper adapts a few ideas which are different from traditional genetic algorithms, for examples, a rank-based sharing fitness function, elitism and so on. In order to improve performance of GA, a set of optimal parameter levels is determined by the experiment and makes use of it. As relations are vertically partitioned allowing attribute replications and saved in disk, an attribute replicating vertical partition method by GA can attain less access cost than non-attribute-replication one and require less computing time than the branch-and-bound method in large-sized problems. Also, it can acquire a good solution similar to the optimum solution in small-sized problem.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2008.04a
• /
• pp.356-361
• /
• 2008

Eigenvalue reduction schemes approximate the lower eigenmodes that represent the global behavior of the structures. In the previous study, we proposed a two-level condensation scheme (TLCS) for the construction of a reduced system. And we have improved previous TLCS with combination of the iterated improved reduced system method (IIRS) to increase accuracy of the higher modes intermediate range. In this study, we apply previous improved TLCS to multi-level sub-structuring scheme. In the first step, the global system is recursively partitioned into a hierarchy of sub-domain. In second step, each uncoupled sub-domain is condensed by the improved TLCS. After assembly process of each reduced sub-eigenvalue problem, eigen-solution is calculated by Lanczos method (ARPACK). Finally, Numerical examples demonstrate performance of proposed method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.306-315
• /
• 1995

This paper presents a bin picking method using a slit beam laser in which a robot recognizes all of the unoccluded objects from the top of jumbled objects, and picks them up one by one. Once those unoccluded objects are removed, newly developed unoccluded objects underneath are recognized and the same process is continued until the bin gets empty. To recognize unoccluded objects, a new algorithm to link edges on slices which are generated by the orthogonally mounted laser on the xy table is proposed. The edges on slices are partitioned and classified using convex and concave function with a distance parameter. The edge types on the neighborhood slices are compared, then the hamming distances among identical kinds of edges are extracted as the features of fuzzy membership function. The sugeno fuzzy integration about features is used to determine linked edges. Finally, the pick-up sequence based on MaxMin theory is determined to cause minimal disturbance to the pile. This proposed method may provide a solution to the automation of part handling in manufacturing environments such as in punch press operation or part assembly.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1021-1030
• /
• 2004

When any data-centric XML documents are stored and managed in RDBMS, schema extracting from XML Schema is an imminent problem. Furthermore, when they are stored in partitioned way on created table, lots of null values will be produced and/or be increased cost for join, so we need a solution to solve these problems. This paper proposes a Schema Hybrid Inlining technique to generate relational schema of XML documents. The suggested technique creates a relational schema based on the XML Schema graph. Also, the technique expands the legacy Inlining method by manual and heuristic processing table generation method of cardinality and in-degree. Then, an ancestor node, terminal node, and creating a new table on the derived relation in this technique. DTD-dependent storage method uses partitioned storing and relation path element information reformed structured-searching method to reduce joining operation cost that is a weak point of it.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.14 no.1
• /
• pp.28-35
• /
• 2006

Substructure coupling or component mode synthesis may be employed in the solution of dynamic problems for large, flexible structures. The model is partitioned into several subdomains, and a generalized Craig-Bampton representation is derived. In this paper the mode sets (normal modes, constraint modes) is employed for model reduction. A generalized model reduction procedure is described. Vaious reduction methods that use constraint modes is described in detail. As examples, a flexible structure and a 10 DOF damped system are analyzed. Comparison with a conventional reduction method based on a complete model is made via eigenpair and dynamic responses.

• Proceedings of the KIEE Conference
• /
• 1993.07b
• /
• pp.683-685
• /
• 1993

Semiconductor switches are modelled as binary inductors, as a very low value of inductance during conduction, and infinite value of inductance otherwise. The system matrix is partitioned in such a manner as to permit efficient handling of switch status. The backward Euler method of integration is used for the solution of equation to ensure convergence. The application of thristor switching to induction motor speed control has resulted in a number of unconventional supply systems. In this paper, an analytic method for predicting the steady-state of performance of system is presented.