• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.555-568
• /
• 2000

The World Wide Web has become the largest virtual system that is almost universal in scope. In recent research, it has become effective to utilize idle hosts existing in the World Wide Web for running applications that require a substantial amount of computation. This novel computing paradigm has been referred to as the advent of global computing. In this paper, we implement and propose a mobile object-based global computing framework called Tiger, whose primary goal is to present novel object-oriented programming libraries that support distribution, dispatching, migration of objects and concurrency among computational activities. The programming libraries provide programmers with access, location and migration transparency for distributed and mobile objects. Tiger's second goal is to provide a system supporting requisites for a global computing environment - scalability, resource and location management. The Tiger system and the programming libraries provided allow a programmer to easily develop an objectoriented parallel and distributed application using globally extended computing resources. We also present the improvement in performance gained by conducting the experiment with highly intensive computations such as parallel fractal image processing and genetic-neuro-fuzzy algorithms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.3 no.1
• /
• pp.1-4
• /
• 2002

A short shot is a molded part that is incomplete because insufficient material was injected into the mold. Any factors that increase the resistance of polymer melt to flow or prohibit delivery of sufficient material into the cavity can cause a short shot. Inappropriate injection pressure is one of the most common factors which cause a short shot. Conventionally, domain experts in injection molding decide and modify the pressure based on their experience. It is difficult for a non-expert to decide the pressure properly with the considerations such as a part dimension, shape, and other processing variables. In this study, fuzzy algorithm is proposed to standardize the empirical determination of the pressure so that not only the experts but also non-experts can find the appropriate injection pressure easily. To acquire the more accurate results. domain experts should be interviewed and then technical documents which are collected from the experts should be restored in the fuzzy rule base. But in this study, simulations have been done by using C-MOLD to settle the rule base because it takes much time and also it's difficult to meet and interview the experts.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.430-448
• /
• 2001

In navigation system, a primary task is to compute the minimum cost route from the current location to the destination. One of major problems for navigation systems is that a significant amount of computation time is required when the digital road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. In this paper, we have developed a HiTi(Hierarchical MulTi) graph model for hierarchically structuring large digital road maps to speedup the minimum cost path computation. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a digital road map for its computation. We prove that the shortest path computed by SPAH is the optimal. Our performance analysis of SPAH also showed that it significantly reduces the computation time over exiting methods. We present an in-depth experimental analysis of HiTi graph method by comparing it with other similar works.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.1
• /
• pp.646-653
• /
• 2016

This study performed a microbiological hazard analysis, which is required for the application of HACCP (Hazard Analysis Critical Control Point) system to Pteridium aquilinum and Platycodon grandiflorum. The manufacturing process was made by referring to the typical manufacturing process. Based on microbiological hazard analysis, grandiflorum root contained $6.2{\times}10^3CFU/g$ of bacteria, which has the largest amount of bacteria among the agricultural materials. On the other hand, microbiological hazard analysis of the raw materials and after the disinfecting process of confectionery showed a safe result. A microorganism test of the manufacturing environment and workers suggests that the microbiological hazard should be reduced through systematic cleaning, disinfection and accompanied by personal hygiene based on hygiene education for workers.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.1
• /
• pp.453-458
• /
• 2016

One of the most common applications of machine vision is quality inspections in automated production. In this study, a welding inspection system that is controlled by a PC and a PLC equipped with a multi-camera setup was developed. The system was designed to measure the primary dimensions, such as the length and width of the welding areas. The TCP/IP protocols and multi-threading techniques were used for parallel control of the optical components and physical distribution. A coaxial light was used to maintain uniform lighting conditions and enhance the image quality of the weld areas. The core image processing system was established through a combination of various algorithms from the OpenCV library. The proposed vision inspection system was fully validated for an actual weld production line and was shown to satisfy the functional and performance requirements.

• Journal of KIISE:Software and Applications
• /
• v.33 no.11
• /
• pp.936-941
• /
• 2006

To apply object recognition techniques to real environment, illumination compensation method should be developed. As effective illumination compensation model, we focused our attention on Retinex model and illumination-Reflectance model, implemented them, and experimented on their performance. We implemented Retinex model with Single Scale Retinex, Multi-Scale Retinex, and Retinex Neural Network and Multi-Scale Retinex Neural Network, neural network model of Retinex model. Also, we implemented illumination-Reflectance model with reflectance image calculation by calculating an illumination image by low frequency filtering in frequency domain of Discrete Cosine Transform and Wavelet Transform, and Gaussian blurring. We compare their illumination compensation performance to facial images under nine illumination directions. We also compare their performance after post processing using Principal Component Analysis(PCA). As a result, illumination Reflectance model showed better performance and their overall performance was improved when illumination compensated images were post processed by PCA.

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.387-393
• /
• 2004

DNA computing is technology that applies immense parallel castle of living body molecules into information processing technology, and has used to solve NP-complete problems. However, there are problems which do not look for solutions and take much time when only DNA computing technology solves NP-complete problems. In this paper we proposed an algorithm called ACO(Algorithm for Code Optimization) that can efficiently express DNA sequence and create good codes through composition and separation processes as many as the numbers of reaction by DNA coding method. Also, we applied ACO to Hamiltonian path problem of NP-complete problems. As a result, ACO could express DNA codes of variable lengths more efficiently than Adleman's DNA computing algorithm could. In addition, compared to Adleman's DNA computing algorithm, ACO could reduce search time and biological error rate by 50% and could search for accurate paths in a short time.

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.439-446
• /
• 2004

To design a user-adaptive web surfing system, we nay take the approach to divide the whole process into three phases; collecting user data, processing the data to construct and improve the user profile, and adapting to the user by applying the user profile. We have designed three software agents. Each privately works in each phase and they collaboratively support adaptive web surfing. They are IIA(Interactive Interface Agent), UPA(User Profile Agent), and ANA(Autonomous Navigation Agent). IIA provides the user interface, which collects data and performs mechanical navigation support. UPA processes the collected user data to build and update the user profile while user is web-surfing. ANA provides an autonomous navigation mode in which it automatically recommends web pages that are selected based on the user profile. The proposed approach and design method, through extensions and refinements, may be used to build a practical adaptive web surfing system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.188-195
• /
• 2002

The M-algorithm for decoding convolutional codes can significantly reduce the complexity of the Viterbi algorithm by tracking a fixed number of survivor paths in each level of the decoding trellis. It is an easily-implementable algorithm suited for real-time processing of high-speed data. The algorithm, however, generates a sequence of catastrophic errors when the correct path is not included in the set of survivor paths. In this paper, the performance of the M-algorithm obtained from using various decoding complexity levels, frame lengths, and code constraint lengths is presented. The performance gain is quantified when the algorithm is used in conjunction with codes of increased constraint length. In particular, it is demonstrated the gain from the increased code free distance overcompensates the loss from the correct path being excluded from the survivors, when the frame length is short to moderate. Using 64 survivor paths, the signal-to-noise ratio gain obtained by increasing the constraint length from K=7 to K=9, 11, 15 is respectively 0.6, 0.75, and 08dB, when the frame of length L=100 has the frame error rate of 0.01%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.268-275
• /
• 2002

This paper proposes a region-based segmentation algorithm fur extracting a video object by using the cost of potential of frame-difference energies. In the first step of a region-based segmentation using spatial intensity, each frame is segmented into a partition of homogeneous regions finely so that each region does not contain the contour of a video object. The fine partition is used as an initial partition for the second step of spatio-temporal segmentation. In spatio-temporal segmentation, the homogeneity cost for each pair of adjacent regions is computed which reflects the potential between the frame-difference energy on the common contour and the frame-difference energy of the lower potential region of the two. The pair of adjacent regions whose cost is minimal then is searched. The two regions of minimum cost ale merged, which result in updating the partition. The merging is recursively performed until only the contours remain which have Same difference energies of high potential. In the fecal step of post-processing, the video object is extracted removing the contours inside the object.