• Journal of Aerospace System Engineering
• /
• v.9 no.1
• /
• pp.1-6
• /
• 2015

A critical speed analysis of oxidizer pump was peformed for a 7 ton class liquid rocket engine as the third stage engine of the Korea Space Launch Vehicle II. Based on the previously developed experimental 30 ton class turbopump and presently developing 75 ton class turbopump for the first and second stage rocket engine of Korea Space Launch Vehicle II, a layout and configuration of the 7 ton class turbopump rotor assembly are determined. A ball bearing stiffness analysis and rotordynamic analysis are performed for both of the bearing unloaded condition and loaded condition. Structural flexibility of the oxidizer pump casing is also included to predict critical speeds. From the numerical analysis, it is confirmed that the rotor system acquires sufficient separate margin of critical speed as a sub-critical rotor even though decrease of critical speed due to the casing structural flexibility.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.1
• /
• pp.101-107
• /
• 2008

This paper considers a topological optimization of a computer network design with a reliability constraint. The objective is to find the topological layout of links, at minimal cost, under the constraint that the network reliability is more than a given reliability. To efficiently solve the problem, a scatter search 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 genetic algorithm approach.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2005.05a
• /
• pp.239-242
• /
• 2005

The purpose of this research was focused on substantiating an effects of tendon-layouts and compressed stress($=f_{pc}$) induced by post-tensioning on seismic performance of post-tensioned flat plate slab-column connection designed as non-participating system. To accomplish this purpose, an experimental research of flat plate exterior slab-column connections subjected to gravity load and reversed lateral displacement history are presented. As a result, tendon-layout is a main variable to influence failure mechanism, dissipated energy and lateral deformation capacity. Furthermore, compressed stress ($=f_{pc}$) induced by post-tensioning enhanced the seismic performance of flat plate slab.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.375-378
• /
• 2000

This paper discusses on application of meta-heuristic algorithms such as the genetic algorithm (GA) and the simulated annealing (SA) to the LSI module placement. We propose useful crossover method for improving of searching capability in genetic algorithm. By using our proposed crossover method, we have been able to keep good schemata in the chromosome and the variety of the solution. From the experimental results, we have obtained better result than the simulated annealing method by starting from the initial placement of the min-cut method.

• 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.

• Journal of the Korea Safety Management & Science
• /
• v.13 no.1
• /
• pp.133-142
• /
• 2011

Overhead facility design problem(OFDP) is one of the shortest rectilinear flow network problem(SRFNP)[4]. Genetic algorithm(GA), artificial immune system(AIS), population management genetic algorithm (PM) and greedy randomized adaptive search procedures (GRASP) were introduced to solve OFDP. A path matrix formed individual was designed to represent rectilinear path between each facility. An exchange crossover operator and an exchange mutation operator were introduced for OFDP. Computer programs for each algorithm were constructed to evaluate the performance of algorithms. Computation experiments were performed on the quality of solution and calculations time by using randomly generated test problems. The average object value of PM was the best of among four algorithms. The quality of solutions of AIS for the big sized problem were better than those of GA and GRASP. The solution quality of GRASP was the worst among four algorithms. Experimental results showed that the calculations time of GRASP was faster than any other algorithm. GA and PM had shown similar performance on calculation time and the calculation time of AIS was the worst.

• Computers and Concrete
• /
• v.13 no.2
• /
• pp.235-253
• /
• 2014

The theoretical basis and the main results of a design procedure, which attempts to provide the optimal layout of ordinary reinforcement in prestressed concrete beams, subjected to bending moment and shear force are presented. The difficulties encountered in simulating the actual behaviour of prestressed concrete beam in presence of coupled forces bending moment - shear force are discussed; particular emphasis is put on plastic models and stress fields approaches. A unified model for reinforced and prestressed concrete beams under axial force - bending moment - shear force interaction is provided. This analytical model is validated against both experimental results collected in literature and nonlinear numerical analyses. Finally, for illustrating the applicability of the proposed procedure, an example of design for a full-scale prestressed concrete beam is shown.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.410-422
• /
• 1997

In this paper, we descried a bottom-up document structure analysis method in bilingual Korean-English document. We proposed a character segmentation method based on the layout information of connected component of each character. In many researches, a document has been analyzed into text blocks and graphics. We analyzed a document into four parts: text, table, graphic, and separator. A text is recursively subdivided into text blocks, text lines, words, and characters. To extract the character in bilingual text, we proposed a new method of word of word separation of Korean or English. Futhermore, we used a character merging and segmentation method in accordance with the properties of Hangul on the Korean word blocks. Experimental results on the various documents show that the proposed method is very effectively operated on the document structure analysis and the character segmentation.

• Smart Structures and Systems
• /
• v.5 no.6
• /
• pp.645-662
• /
• 2009

Adaptive wings are capable of properly modifying their shape depending on the current aerodynamic conditions, in order to improve the overall performance of a flying vehicle. In this paper is presented the concept design of a small-scale compliant wing rib whose outline may be distorted in order to switch from an aerodynamic profile to another. The distortion loads are induced by shape memory alloy actuators placed within the frame of a wing section whose elastic response is predicted by the matrix method with beam formulation. Genetic optimization is used to find a wing rib structure (corresponding to the first airfoil) able to properly deforms itself when loaded by the SMA-induced forces, becoming as close as possible to the desired target shape (second airfoil). An experimental validation of the design procedure is also carried out with reference to a simplified structure layout.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.4
• /
• pp.557-564
• /
• 1986

This paper describes a standard cell placement strategy which consists of three kconsecutive steps` initial placement, iterative placement improvement, and string placement. In the initial placement step, cell placement was done by solving the linear ordering problem for a one-dimensional layout of standard cells and then zigzaging the resultant linear order width in the chip plane. The iterative placement improvement step is based on the iterative pairwise interchange using the estimated total routing length as a figure-or -merit. The string placement is used to reorder cells and terminals in each etandard cell row such that channel routing in the adjacent channels is not blocked by cyclic constraints and needs fewer routing tracks. The placement program is coded in PASCAL and kimplemented on a VAX-11/750 computer. Experimental results for several examples are included.