• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.11a
• /
• pp.954-957
• /
• 2004

Based on the authors' previous work, where a geometric constraint handling technique for stiffener layout optimization problem using geometry algorithms was proposed, stiffener layout optimization to maximize natural frequencies of a curved three-dimensional shell structure was performed with a projection method. The original geometry of the shell structure was first projected on a two-dimensional plane, and then the whole optimization process was performed with the projected geometry of the shell except that the original shell structure was used for the eigenproblem solving. The projection method can be applied to baseline structures with a one-to-one correspondence between original and projected geometries such as automobile hoods and roofs.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.6 s.177
• /
• pp.1379-1389
• /
• 2000

In this study, a design process of robotic cell is presented. This paper focuses only on the automation of workpiece handling with robot. The presented design process enables us to analyze effectiv ely the original production system and to redesign it as an optimum production system with robots. An original production system is analyzed with respect to its economical and technological requirements for automation. If automation of the given production system is feasible, the conceptual design for automation is firstly derived. Next, the detail design is derived for the optimum conceptual design. Finally, an optimum system solution is determined after the economical and technical evaluation of all the derived detail designs. The all specifications of each element of the redesigned production system and its layout are determined at the detail design phase. This paper shows a low cost supporting tool for layout design of robotic cell with SCARA type robots.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.54-60
• /
• 2001

In this paper, a shape-based block layout (SBL) approach is presented to solve the facility layout problem with unequal-area and fixed shapes. The SBL approach employs hybrid genetic algorithm (Hybrid-GA) to find a good solution and the concept of bay structure is used. In the typical facility layout problem with unequal area and fixed shapes, the given geometric constraints of unequal-area and fixed shapes are mostly approximated to original shape by aspect ratio. Thus, the layout results require extensive manual revision to create practical layouts and it produces irregular building shapes and too much unusable spaces. Experimental results show that a SBL model is able to produce better solution and to create more practical layouts than those of existing approaches.

• Bioinformatics and Biosystems
• /
• v.1 no.1
• /
• pp.61-66
• /
• 2006

We propose a new fragment assembly program MLP (mate-based layout with PHRAP). MLP consists of PHRAP, repeat masking, and a new layout algorithm that uses the mate pair information. Our experimental results show that by using MLP instead of PHRAP, we can significantly reduce the difference between the assembled sequence and the original genome sequence.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.113-116
• /
• 2001

In this paper we present a new hierarchical layout object extraction algorithm, which is based on rectangles rather than edges. The original layout data is modeled as instances connected by wires. Each polygon shape is divided into a set of rectangles and the instances and wires are extracted and recognized from those rectangles together with their connection and size information. We have applied the algorithm to actual layouts. Experiments on several standard cell library demonstrate the effectiveness of the algorithm.

• Archives of design research
• /
• v.14 no.1
• /
• pp.47-52
• /
• 2001

A goal of this study is to explore the relationship between original shape and human emotion. To this end, a 3-way layout experiment is conducted, whose goal is to find the effect of polishness on the image of cubics. The analysis of the experiment result reveals some differences among the involved factors. This study may contribute to the development of a design system at design-related workplace.

• Transactions of The Korea Fluid Power Systems Society
• /
• v.6 no.3
• /
• pp.23-31
• /
• 2009

Counter shaft transmission is a popular automatic transmission power train in construction vehicles such as wheel loader and forklift. The gear train layout of counter shaft transmission is a very basic and important development stage because it affects the most of components design including hydraulic system and shift control algorithm, etc. This paper presents a design methodology for the gear train layout from the analysis of power flow path and clutch hook-up of the existing counter shaft transmission that is adopted in commercialized construction vehicles. Also, independent constraints for the meshed gear ratios are derived in order to realize forward 4-speed and reverse 3-speed gear ratio. The layout design principle proposed here was applied to the new original counter shaft transmission that is underdevelopment.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.30 no.1
• /
• pp.71-81
• /
• 2012

A research framework and hypothesis were established for analysing layout-factors of bus wrapping which influence on brand attitude. 130 questionnaire were distributed and 123 copies were retreated at metropolitan area. SPSS 12.0 was used for frequency analysis, factor analysis, and reliability analysis. For testing hypothesis multi-regression analysis were utilized. Attention, readability, explicitness, formativeness, creativity are partially significant to establish brand attitude. Attention and readability are insignificant, while explicitness, formativeness, creativity are significant to establish brand attitude. The most effective independent variables are creativity, and explicitness and formativeness are followed. In particular sensual, original, fresh layout of bus wrapping are highly significant.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.3
• /
• pp.58-66
• /
• 2003

The cut tree approach of Montreuil and Ratliff [16] and eigenvector approach [10] are used to automatically draw a feasible facility layout with aisle structure. The department arrangement can minimize an aisle distance criterion considering door locations and dimension constraints. The aisle distance is measured by the door to door distance between departments. An eigenvector and cut tree approaches [1] are implemented based on the branch and bound technique in Kim et al. [2] in order to obtain feasible layouts. Then, the algorithm to fix the door location of each department is developed. After the door locations are determined, the factory layout is evaluated in terms of aisle distance. The aisle structure is obtained by expanding the original layout. The solution is kept until we will find better factory layout. The proposed approach based on the branch and bound technique, in theory, will provide the optimal solution. If the runs are time and/or node limited, the proposed method is a strong heuristic. The technique is made further practical by the fact that the solution is constrained such that the rectangular shape dimensions length(l) and width(w) are fixed and a perfect fit is generated if a fit is possible.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.2
• /
• pp.338-346
• /
• 1987

This paper describes a method for verifying whether a given geometrical layout correcdtly reflects the original logic level description. The logic description extracted from layout data was directly compadred with the original logic diagram generated at logic level design stage where the logic diagram is represented as a weighted multi-place graph. The comparison is based on graph isomorphism and error messages(error categories and locations)are invoked if any difference is found between the two logic descriptions. An efficient partitioning algorithm which consists of two steps, candidate selection and equal weight partitioning procedure, enables the entire verification process to occur in O(n log n) time.