• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6B
• /
• pp.450-455
• /
• 2008

We analyze the tag identification procedure of conventional EPC Class 1 RFID system and propose the fast anti-collision algorithm for the performance improvement of the system. In the proposed algorithm, the reader uses information of tag collisions and reduces unnecessary procedures of the conventional algorithm. We evaluate the performance of the proposed anti-collision algorithm and the conventional algorithm using mathematical analysis and simulation. According to the results, the fast anti-collision algorithm shows greatly better performance than conventional algorithm.

• Journal of the Korea Safety Management & Science
• /
• v.9 no.5
• /
• pp.1-5
• /
• 2007

We construct the procedure to predict safety accidents following Bayesian approach. We make a model that can utilize the data to predict other levels of accidents. An event tree model which is a frequently used graphical tool in describing accident initiation and escalation to more severe accident is transformed into an influence diagram model. Prior distributions for accident occurrence rate and probabilities to escalating to more severe accidents are assumed and likelihood of number of accidents in a given period of time is assessed. And then posterior distributions are obtained based on observed data. We also points out the advantages of the bayesian approach that estimates the whole distribution of accident rate over the classical point estimation.

• Spatial Information Research
• /
• v.3 no.1
• /
• pp.19-27
• /
• 1995

In this paper, a semi-automated mapping system, which can produ¬ce digital maps by using information acquired from pre-processing procedure, was introduced. To get a binary edge image, which is very important in vectori¬zation process, we applied adaptive smoothing and connection preserving thresho¬Iding algorithm. In mapper program, binary images are converted to vectors and for in-core data structure, extended PR quad tree was used. These procedures are dispatched to personal computers and workstations and through network resource sharing, the whole process was unified and simplified.

• Journal of Intelligence and Information Systems
• /
• v.2 no.1
• /
• pp.45-58
• /
• 1996

This paper describes an a, pp.oach to recognizing composite features of prismatic parts. AAG (Attribute Adjacency Graph) is adopted as the basis of describing basic feature, but it is extended to enhance the expressive power of AAG by adding face type, angles between faces and normal vectors. Our a, pp.oach is called Extended AAG (EAAG). To simplify the recognition procedure, feature classification tree is built using the graph types of EEA and the number of EAD's. Algorithms to find open faces and dimensions of features are exemplified and used in decomposing composite feature. The processing sequence of recognized features is automatically determined during the decomposition process of composite features.

• Journal of Information Processing Systems
• /
• v.6 no.4
• /
• pp.453-480
• /
• 2010

Cryptographic hash functions reduce inputs of arbitrary or very large length to a short string of fixed length. All hash function designs start from a compression function with fixed length inputs. The compression function itself is designed from scratch, or derived from a block cipher or a permutation. The most common procedure to extend the domain of a compression function in order to obtain a hash function is a simple linear iteration; however, some variants use multiple iterations or a tree structure that allows for parallelism. This paper presents a survey of 17 extenders in the literature. It considers the natural question whether these preserve the security properties of the compression function, and more in particular collision resistance, second preimage resistance, preimage resistance and the pseudo-random oracle property.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.417-429
• /
• 1998

This paper considers two-sided (left and right side) assembly lines which are often used, especially in assembling large-sized products such as trucks and buses. A large number of exact algorithms and heuristics have been proposed to balance one-sided lines. However, little attention has been paid to balancing two-sided assembly lines. We present an efficient algorithm based on a branch and bound for balancing two-sided assembly lines. The algorithm involves a procedure for generating an enumeration tree. To efficiently search for the near optimal solutions to the problem, assignment rules are used in the method. New and existing bound strategies and dominance rules are else employed. The proposed algorithm can find a near optimal solution by enumerating feasible solutions partially. Extensive computational experiments are carried out to make the performance comparison between the proposed algorithm and existing ones. The computational results show that our algorithm is promising and robust in solution quality.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.8
• /
• pp.1457-1465
• /
• 2016

A RCM approach to maintenance of the catenary system of electric railway is proposed. The proposed RCM approach provides a maintenance-oriented FMECA procedure to derive critical failure modes by analyzing failure effects and a RCM decision logic tree to suggest optimal maintenance works for the derived failure modes. By applying the proposed RCM procedures to the catenary system of high speed railway, it is suggested that strand breaks of dropper and voltage equalizing wire, and trolly wire wear-out are the critical failure modes for whom maintenance works based on condition monitoring should be applied instead of conventional time-based preventive maintenance. It is also proposed by reliability analysis that replacement time of dropper can be reduced from 18 years to 10 years. These results show that the proposed RCM approach can optimize the maintenance procedures of catenary system.

• Journal of the Korean Society of Laryngology, Phoniatrics and Logopedics
• /
• v.33 no.1
• /
• pp.37-41
• /
• 2022

Airway foreign body aspiration in children can lead to accidental death, due to the foreign body itself or the removal procedure. Depending on its location, removal of the foreign body can be challenging. Here, we present a case of successful removal of a foreign body from the left upper lobar bronchus via ventilating bronchoscopy with a rigid bronchoscope and Fogarty arterial embolectomy catheter. Tracheobronchial foreign bodies in locations that are difficult to reach with forceps, due to an acute angle or the small diameter of the pediatric bronchial tree, can be effectively removed with a Fogarty arterial embolectomy catheter.

• International Journal of Computer Science & Network Security
• /
• v.23 no.4
• /
• pp.39-47
• /
• 2023

This study compares various transformation techniques for multifocus image fusion. Multi-focus image fusion is a procedure of merging multiple images captured at unalike focus distances to produce a single composite image with improved sharpness and clarity. In this research, the purpose is to compare different popular frequency domain approaches for multi-focus image fusion, such as Discrete Wavelet Transforms (DWT), Stationary Wavelet Transforms (SWT), DCT-based Laplacian Pyramid (DCT-LP), Discrete Cosine Harmonic Wavelet Transform (DC-HWT), and Dual-Tree Complex Wavelet Transform (DT-CWT). The objective is to increase the understanding of these transformation techniques and how they can be utilized in conjunction with one another. The analysis will evaluate the 10 most crucial parameters and highlight the unique features of each method. The results will help determine which transformation technique is the best for multi-focus image fusion applications. Based on the visual and statistical analysis, it is suggested that the DCT-LP is the most appropriate technique, but the results also provide valuable insights into choosing the right approach.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.33 no.6
• /
• pp.980-989
• /
• 2009

Amur cork tree was extracted in methanol with the purpose of investigating the most effective extraction procedure for detecting the chromophore using the GC-MS analysis. Different procedures of waterbath and hotplate extractions were carried out and five different GC-MS instrument parameters including the operating temperatures in the GC capillary column and the MSD scan range were tested for their efficiencies. Berberine was determined by the detection of dihydroberberine at 15.0 min r.t. Hotplate was a better device for extracting amur cork tree than waterbath shaker either with or without presoaking in the room temperature. Water was not an adequate extraction medium for the berberine detection. The most effective GC-MS parameter was Method 4; the initial temperature at $50^{\circ}C$ followed by the temperature increase of $23^{\circ}C$/min until $210^{\circ}C$, then increase of $30^{\circ}C$/min until the final temperature reach at $305^{\circ}C$, then hold for 14 minutes to maintain the total run time 24.12 minutes. The MSD scan range for Method 4 was $35\sim400$m/z.