• Journal of the Korean Society of Clothing and Textiles
• /
• v.30 no.1 s.149
• /
• pp.157-166
• /
• 2006

The human body, which is composed of concave and convex curvatures, makes it difficult to transfer into 2D patterns directly from 3D data. In previous studies. Jeong, et al.(2004) suggested the block method was fester and easier when dealing with the triangular patches of male's upper dress form. Although the block method is useful to make a pattern, the information(area, length, etc.) from a 2D pattern would be different depending on the direction of the block method. As a result horizontal and diagonal block methods were suggested as optimal methods for 2D tight-fitting patterns. These block methods were closer to the original area of the 3D scan data than the vertical block method. The total area of the 2D pattern obtained by the horizontal and diagonal block methods showed little differences. In case of the horizontal and diagonal block methods, the total error of the 2D pattern area ranged from $0.01\%\~0.25\%$. In comparing the length of the 2D pattern with that of the 3D scan data, the obtained 2D pattern was $0.1\~0.2cm$ shorter than the 3D scan data, which was within the acceptable range of errors in making clothes. 3D space distribution images between the body surface and the experimental clothing were also measured and $3\%$ enlargement of the original pattern was verified as the adequate adjustment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.50-60
• /
• 2015

A Block-Time-Bounded Time Division Multiple Access (BTB-TDMA) medium access control protocol, which estimates the propagation delay of nodes according to their location and moving velocity information, has been proposed for underwater acoustic networks. BTB-TDMA provides nodes with their transmission schedules by a time block that is a time unit, newly designed for BTB-TDMA. In this paper, we investigate how the receiver collision, that is induced by the asymmetry between node's uplink and downlink propagation delay due to its mobility, affects the performance of BTB-TDMA. To do this, we analytically obtain the collision rate, the channel access delay, and the channel utilization by considering the asymmetry of propagation delay. Then, simulations are extensively performed with respect to the length of a time block by varying the number of nodes, the network range, and the node's velocity. Thus, the simulation results can suggest performance criteria to determine the optimal length of a time block which minimizes the collision rate and concurrently maximizes the channel access delay and the channel utilization.

• Journal of Korean Institute of Industrial Engineers
• /
• v.15 no.1
• /
• pp.105-116
• /
• 1989

This study presents an algorithm that determines the optimal configuration of the FMSs with limited local buffers. The algorithm finds the lowest cost configuration, i.e. the number of tools, the number of pallets as well as the number of buffers to be installed in front of each machine in the system. Thus it assures a given production ratio with a minimum cost. In the algorithm, FMSs are considered as the closed queueing network with limited queue length. System performance evaluation is performed using the Block-&-Recirculation model developed by Yao and Buzacott. The algorithm is composed with three steps. The steps are namely i) determination of a lower configuration, ii) derivation of an heuristic solution, and iii) obtaining the optimal solution. The computational efforts required in the algorithm usually lies within the capability of personal computers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1156-1162
• /
• 1999

In this paper, the problem of decoding transmitted data sequence with diversity reception in the presence of nondelective fading is studied. The expection maximizaton (EM) algorithm is employed to derive an interactive algorithm. The algorithm performs block-by-block coherent decoding with the aid of pilot symbols. It is shown that the complexity of the algorithm grows linearly as a function of sequence length. The performance of the algorithm is shown to better than that of the conventional pilot symbol aided (PSI) algorithm. Simulation results are presented to assess the performance of the algorithm and the results are compared with that of the conventional PSI alforithm.

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

Reed-Solomon(RS) code is the most powerful burst error correcting code. In Ois paper, the architecture for the adaptive RS encoder adaptable for multi QoS requirements or time-varying channel environments has been designed. In the adaptive RS code, the message length k and the error correction capability t are allowed to be variable so that the block length n is also variable. We proposed the architecture of the adaptive RS encoder by designing the optimal structure of Galois fields multiplier with comparison of fixed multiplier and variable multiplier. The proposed architecture is implemented in VHDL and verified with the simulation tool

• IE interfaces
• /
• v.10 no.2
• /
• pp.109-114
• /
• 1997

The tread pattern of tire is represented by a great number of design factors, such as groove breadth of circumference direction, breadth direction, rib breadth, block length, kerfs, tread breadth and tread radius, etc. It is not efficient in time and cost to analyze the rolling resistance for a great number of real tread pattern, because It requires lots of pattern forming handwork. In order to optimize tread pattern for rolling resistance, the experiment is planed and analyzed by Taguchi's robust design methods. We identified the important design factors for Rolling Resistance, determined the optimal condition and calculated prediction value which is related. Using the experiment data and the analyzed data, we developed the program which could predict Rolling Resistance. It is expected that time and cost may be reduced in designing and developing new tire tread pattern.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.880-894
• /
• 1997

In this paper,we propose a new algorithm to perform DCT(Discrete Cosine Transform) withn the area reduced by prdeicting position of quantization coefficients to be zero.This proposed algorithm not only decreases the enoding time and the decoding time by reducing computation amount of FDCT(Forward DCT)and IDCT(Inverse DCT) but also increases comprossion ratio by performing each diffirent horizontal- vereical zig-zag scan assording to the calssified block size for each block on the huffiman coeing.Traditional image coding method performs the samd DCT computation and zig-zag scan over all blocks,however this proposed algorthm reduces FDCT computation time by setting to zero insted of computing DCT for quantization codfficients outside classfified block size on the encoding.Also,the algorithm reduces IDCT computation the by performing IDCT for only dequantization coefficients within calssified block size on the decoding.In addition, the algorithm reduces Run-Length by carrying out horizontal-vertical zig-zag scan approriate to the slassified block chraateristics,thus providing the improverment of the compression ratio,On the on ther hand,this proposed algorithm can be applied to 16*16 block processing in which the compression ratio and the image resolution are optimal but the encoding time and the decoding time take long.Also,the algorithm can be extended to motion image coding requirng real time processing.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.5
• /
• pp.294-302
• /
• 2020

In a genetic algorithm, computer simulations are performed based on the natural evolution process of life, such as selection, crossover, and mutation. The genetic algorithm searches the approximate optimal solution by the parallel arrangement of Schema, which has a short definition length, low order, and high adaptability. This study examined the possibility of improving the efficiency of the optimal solution by considering the characteristics of the building block hypothesis, which are one of the key operating principles of a genetic algorithm. This study evaluated the efficiency of the optimization results according to the gene sequence for the implementation in solving problems. The optimal design problem of the water pipe was selected, and the genetic arrangement order reflected the engineering specificity by dividing into the existing, the network topology-based, and the flowrate-based arrangement. The optimization results with a flowrate-based arrangement were, on average, approximately 2-3% better than the other batches. This means that to increase the efficiency of the actual engineering optimization problem, a methodology that utilizes clear prior knowledge (such as hydraulic properties) to prevent such excellent solution characteristics from disappearing is essential. The proposed method will be considered as a tool to improve the efficiency of large-scale water supply network optimization in the future.

• Journal of the korean academy of Pediatric Dentistry
• /
• v.47 no.3
• /
• pp.235-247
• /
• 2020

The purpose of this study was to evaluate the skeletal and dentoalveolar effects and optimal timing for treatment of class II malocclusion with functional appliances in children and adolescents. A group of 30 patients with class II malocclusion were divided into 3 groups according to their use of functional appliance: Twin block, Activator, Fränkel appliance. The group was also divided into 2 groups according to the cervical vertebrae maturation method. Lateral cephalometric radiographs were analyzed pretreatment (T0) and posttreatment (T1). Among the functional appliances, treatment with Twin block and Activator showed significant increase in the length of the mandible (Co-Gn) and the lower anterior facial height (ANS to Me), whereas the overjet and overbite were significantly reduced. Treatment with Fränkel appliance showed significant improvement in the relationship of maxilla and mandible. In addition, if the functional appliance was used during the period of pubertal growth peak, there was a significant increase in mandibular length, improvement in the relationship of maxilla and mandible, labial inclination of lower incisors and decrease in overjet compared to the treatment before pubertal growth peak. Therefore, this study indicates that using functional appliances for patients with class II malocclusion is effective and the optimal timing for using functional appliances is during pubertal growth peak.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2000.11a
• /
• pp.131-142
• /
• 2000

Facility layout is the early stage of system design that requires a mid-term or long-term plan. Since improper facility layout might incur substantial logistics cost including material handling and re-installment costs, due consideration must be given to decisions on facility layout. Facility layout is concerned with low to arrange equipment necessary for production in a given space. Its objective is to minimize the sum of all the products of each equipment's amount of flow multiplied by distance. Facility layout also is related to the issue of NP-complete, i.e., calculated amounts exponentially increase with the increase of the number of equipment. This study discusses Hybrid GA developed, as an algorithm for facility layout, to solve the above-mentioned problems. The algorithm, which is designed to efficiently place equipment, automatically produces a horizontal passageway by the block, if a designer provides the width and length of the space to be handled. In addition, this study demonstrates the validity of the Algorithm by comparing with existing algorithms that have been developed. We present a Hybrid GA approach to the facility layout problem that improves on existing work in terms of solution quality and method. Experimental results show that the proposed algorithm is able to produce better solution quality and more practical layouts than the ones obtained by applying existing algorithms.