• International Journal of Precision Engineering and Manufacturing
• /
• 제8권3호
• /
• pp.64-70
• /
• 2007

Of all the rapid tooling (RT) methods currently available, thick-layer laminated tooling is the most suitable for large-scale, low-cost dies and molds. Currently, the determination of a lamina's contour or profile and the associated slicing algorithms are based on existing rapid prototyping (RP) data manipulation technology. This paper presents a new adaptive slicing algorithm developed exclusively for profiled edge laminae (PEL) tooling PEL tooling is a thick-layer RT technique that involves the assembly of an array of laminae, whose top edges are simultaneously profiled and beveled using a line-of-sight cutting method based on a CAD model of the intended tool surface. The cutting profiles are based on the intersection curve obtained directly from the CAD model to ensure geometrical accuracy. The slicing algorithm determines the lamina thicknesses that minimize the dimensional error using a new tool shape error index. At the same time, the algorithm considers the available lamination thicknesses and desired lamina interface locations. We demonstrate the new slicing algorithm by developing a simple industrial PEL tool based on a CAD part shape.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
• /
• pp.92-97
• /
• 2000

An AMR(Adaptive Multi-Rate) speech coding algorithm has been adopted as a standard speech codec for IMT-2000. It is based on the algebraic CELP, and consists of eight speech coding modes having the bit rate from 4.75 kbit/s to 12.2 kbit/s. It also contains the VAD(Voice Activity Detector), SCR (Source Controlled Rate) operation, and error concealment scheme for robustness in a radio channel. The bit rate of AMR is changed on a frame basis depending on the channel condition. In this paper, we introduced AMR speech coding algorithm and performed the real-time implementation using TMS320C6201, i.e., a Texas Instrument's fixed-point DSP. With the ANSI C source code released from ETSI and 3GPP, we convert and optimize the program to make it run in real time using the C compiler and assembly language. It is verified that the decoded result of the implemented speech codec on the DSP is identical with the PC simulation result using ANSI C code for test sequences. Also, actual sound input/output test using microphone and speaker demonstrates its proper real-time operation without distortions or delays.

• 한국자동차공학회논문집
• /
• 제4권6호
• /
• pp.196-204
• /
• 1996

The simplified dynamic models of the timer assembly in the diesel engine fuel injection system were developed. The first order system with time delay was assumed and the various parameters in this model were obtained by experimental data. These simplified dynamic models were used for the development of control algorithm of the injection timing control system. The PI control algorithm was modified to include the anti-windup property and disturbance compensation. This modified PI control algorithm was used for the control of the injection timing. Improved control accuracy and reduced control efforts were observed.

• Journal of Electrical Engineering and Technology
• /
• 제10권4호
• /
• pp.1830-1835
• /
• 2015

In this paper, we propose an algorithm for the automatic registration of two rigid parts using multiple 3D sensor systems on a robot. Four sets of structured laser stripe system consisted of a camera and a visible laser stripe is used for the acquisition of 3D information. Detailed procedures including extrinsic calibration among four 3D sensor systems and hand/eye calibration of 3D sensing system on robot arm are presented. We find a best pose using search-based pose estimation algorithm where cost function is proposed by reflecting geometric constraints between sensor systems and target objects. A pose with minimum gap and height difference is found by greedy search. Experimental result using demo system shows the robustness and feasibility of the proposed algorithm.

• 한국CDE학회논문집
• /
• 제16권3호
• /
• pp.207-215
• /
• 2011

Due to its large size, a ship is first divided into scores of blocks and then each block is constructed through various shops, such as the assembly shop, the painting shop, and the outfitting shop. However, each block may not be directly moved to the next shop and may be temporarily laid on a block stockyard because the working time in each shop is different. If blocks are laid on the block stockyard without any planning, the rearrangement of the blocks by a transporter are required because the blocks have the different in and out time. In this study, an optimal layout method based on the genetic algorithm was proposed in order to minimize the rearrangement of the blocks in the block stockyard. To evaluate the applicability of the proposed method, it was applied to a simple layout problem of the block stockyard.

• 대한기계학회논문집A
• /
• 제27권2호
• /
• pp.285-293
• /
• 2003

This paper explores an optimal design methodology for an auto lever using a genetic algorithm. Components of the auto lever have been designed sequentially in the industry, but this study presents a novel design method to determine the design parameters of components simultaneously. The genetic algorithm approach is described to decide a set of design parameters for auto lever. The authors have attempted to model the design problem with the objective of minimizing the angle variation of detent spring subject to constraints such as modulus of elasticity of steel, geometry of shift pipe, and stiffness of spring. This method gives the promising design alternative.

• 품질경영학회지
• /
• 제41권3호
• /
• pp.413-421
• /
• 2013

Purpose: System availability and life cycle cost are often used to evaluate the system performance and is influenced by the operation and maintenance characteristic. In this paper, we propose the method to improve life cycle cost and satisfy the target availability through redundancy allocation. Methods: We consider the redundancy is available at all items in multi level system. Thus, we assume that sub-assembly, module, components can be duplicated. Simulation and genetic algorithm are employed to optimize redundancy allocation. Results: Target availability is higher, the life cycle cost is increased. In addition, the items for redundancy are selected at higher level in multi level system if target availability is higher. Conclusion: We could know that target availability affects the duplication number of items and the selection of redundancy items. For further study, we will consider new optimization algorithms to compare with the proposed GA algorithm and improve optimization performance.

• 대한산업공학회지
• /
• 제13권2호
• /
• pp.35-46
• /
• 1987

To minimize makespan for preemptive sequence dependent job scheduling with parallel identical processors, fundamental results, as the basis of new algorithm to be presented, such as McNauton's algorithm for independent jobs, Hu's characterization for dependent jobs, and Muntz-Coffman's algorithm, were first introduced. Then a huristic procedure was presented applying those concepts of zoning of assembly line balancing and of resource leveling on CPM network scheduling with two or more of parallel machines in general. New procedure has eliminated presumative machine assignment using ${\rho}$, rate of resource capability (${\rho}$ < 1), for practical scheduling.

• 산업경영시스템학회지
• /
• 제32권4호
• /
• pp.192-202
• /
• 2009

Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling or remanufacturing, since most products should be disassembled before being recycled or remanufactured as secondary parts or materials. In disassembly sequence planning of EOL products, considered are the uncertainty issues, i.e., defective parts or joints in an incoming product, disassembly damage, and imprecise net profits and costs. The paper deals with the problem of determining the disassembly level and corresponding sequence, with the objective of maximizing the overall profit under uncertainties in disassembly cost and/or revenue. The solution is represented as the longest path on a directed acyclic graph where parameter (arc length) uncertainties are modeled in the form of intervals. And, a heuristic algorithm is developed to find a path with the minimum worst case regret, since the problem is NP-hard. Computational experiments are carried out to show the performance of the proposed algorithm compared with the mixed integer programming model and Conde's heuristic algorithm.

• Ocean Systems Engineering
• /
• 제2권4호
• /
• pp.271-287
• /
• 2012

Due to its large size, a ship is first divided into scores of blocks and then each block is constructed through various shops, such as the assembly shop, the painting shop, and the outfitting shop. However, each block may not be directly moved to the next shop and may be temporarily laid at a block stockyard because the working time in each shop is different from each other. If blocks are laid at the block stockyard without any planning, the rearrangement of the blocks by a transporter is required because the blocks have the different in and out time. In this study, a block layout method based on the genetic algorithm was proposed in order to minimize the rearrangement of the blocks in the block stockyard. To evaluate the applicability of the proposed method, it was applied to simple layout problems of the block stockyard. The result shows that the proposed method can yield a block layout that minimizes the total relocation cost of moving obstacle blocks in the block stockyard.