• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.631-636
• /
• 2001

The technologies relevant to e-business have rapidly developed during very short period of time and recently it is expanding to the area of B2B. Keeping pace with this development in e-business, the information of comparison or analysis on commodities of a lot of sites is also required. Though the information on price comparison among internal shopping malls are now being offered, its not efficient for its renewing intervals are long and, due to some indiscreet collection of information for the purpose of fast renewal, much loads are being generated on the pertinent shopping malls. In this article, the retrieval engine on demand is designed and realized using a dynamci robot agent changing kinetically on the status of the pertinent shopping malls that can offer the customized service and presents the shopping malls with the lowest price for each commodity under e-business after the shortest time of collection and analysis while not giving loads to the pertinent shopping malls.

• Journal of Digital Contents Society
• /
• v.2 no.1
• /
• pp.9-19
• /
• 2001

Web robot is an important Internet software technology used in a variety of Internet application software which includes search engines. As Internet continues to grow, implementations of high performance Web robots are urgently demanded. For this, researches specially geared toward performance scalability of Web robots are required. Hoover, because researches are focused mostly on addressing issues related to commercial implementations, scientific researches and studies are not still made on the performance scalability. In this research, Ive choose a Web robot model implemented by fork-join based. multiprocesses. With respect to the model, we evaluate the effect on the collection efficiency that the timeout values set to requests from Web robots to Web servers have. Also, we analysed the behaviors of Web robots by comparing the execution time between the URL extraction and the uniqueness checking for the extracted URLs. as well as by comparing between the computation time and the network time. Based on the analysis result, we suggest the direction for the design of high performance Web robots.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.542-558
• /
• 2023

A digital focus index (DFI) is a value used to determine image focus in scientific apparatus and smart devices. Automatic focus (AF) is an iterative and time-consuming procedure; however, its processing time can be reduced using a general processing unit (GPU) and a multi-core processor (MCP). In this study, parallel architectures of a minimax search algorithm (MSA) are applied to two DFIs: range algorithm (RA) and image contrast (CT). The DFIs are based on a histogram; however, the parallel computation of the histogram is conventionally inefficient because of the bank conflict in shared memory. The parallel architectures of RA and CT are constructed using parallel reduction for MSA, which is performed through parallel relative rating of the image pixel pairs and halved the rating in every step. The array size is then decreased to one, and the minimax is determined at the final reduction. Kernels for the architectures are constructed using open source software to make it relatively platform independent. The kernels are tested in a hexa-core PC and an embedded device using Lenna images of various sizes based on the resolutions of industrial cameras. The performance of the kernels for the DFIs was investigated in terms of processing speed and computational acceleration; the maximum acceleration was 32.6× in the best case and the MCP exhibited a higher performance.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.113-121
• /
• 2009

The increasing interest in leisure activities of a five-day work per week has been recently prevailed. Additionally, as internet and mobile infrastructures have been becoming widespread, the user can get specific information using a search engine. However, it is difficult for the user to get accurate information they really want as shared information has been rapidly increased and the information has been searched. For example, users can retrieve required travel information, but they also must see a huge number of travel advertisements. In this paper, we design and implement a retrieval system using travel information collecting agent. The information gathering agent regularly visits travel-related category pages of the portal sites and major media travel-article pages to collect information related to travel, and the agent stores the gathered information to a database. Then, users can search the travel information conveniently without the need to view advertisements.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1624-1627
• /
• 1997

The 6-DOF parallel manipulator is a closed-kindmatic chain robot manipulator that is capable of providing high structural rigidity and positional accuracy. Because of its advantage, the parallel manipulator have been widely used in many engineering applications such as vehicle/flight driving simulators, rogot maniplators, attachment tool of machining centers, etc. However, the kinematic analysis for the implementation of a real-time controller has some problem because of the lack of an efficient lagorithm for solving its highly nonliner forward kinematic equation, which provides the translational and orientational attitudes of the moveable upper platform from the lenght of manipulator linkages. Generally, Newton-Raphson method has been widely sued to solve the forward kinematic problem but the effectiveness of this methodology depend on how to set initial values. This paper proposes a hybrid method using genetic algorithm(GA) and Newton-Raphson method to solve forward kinematics. That is, the initial values of forward kinematics solution are determined by adopting genetic algorithm which can search grobally optimal solutions. Since determining this values, the determined values are used in Newton-Raphson method for real time calcuation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.237-240
• /
• 2003

Gas turbines are extensively used in flight propulsion, electrical power generation, and other industrial applications. During its life span, a turbine blade is taken out periodically for repair and maintenance. This includes re-coating the blade surface and re-drilling the cooling holes/channels. A successful laser re-drilling requires the measurement of a hole within the accuracy of ${\pm}0.15mm$ in position and ${\pm}3^{\circ}$ in orientation. Detection of gas turbine blade/vane cooling hole position and orientation thus becomes a very important step for the vane/blade repair process. The industry is in urgent need of an automated system to fulfill the above task. This paper proposes approaches and algorithms to detect the cooling hole position and orientation by using a vision system mounted on a robot arm. The channel orientation is determined based on the alignment of the vision system with the channel axis. The opening position of the channel is the intersection between the channel axis and the surface around the channel opening. Experimental results have indicated that the concept of cooling hole identification is feasible. It has been shown that the reproducible detection of cooling channel position is with +/- 0.15mm accuracy and cooling channel orientation is with +/$-\;3^{\circ}$ with the current test conditions. Average processing time to search and identify channel position and orientation is less than 1 minute.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.11
• /
• pp.1074-1081
• /
• 2007

This paper presents a method for real-time face detection and tracking which combined Adaboost and Camshift algorithm. Adaboost algorithm is a method which selects an important feature called weak classifier among many possible image features by tuning weight of each feature from learning candidates. Even though excellent performance extracting the object, computing time of the algorithm is very high with window size of multi-scale to search image region. So direct application of the method is not easy for real-time tasks such as multi-task OS, robot, and mobile environment. But CAMshift method is an improvement of Mean-shift algorithm for the video streaming environment and track the interesting object at high speed based on hue value of the target region. The detection efficiency of the method is not good for environment of dynamic illumination. We propose a combined method of Adaboost and CAMshift to improve the computing speed with good face detection performance. The method was proved for real image sequences including single and more faces.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.483-488
• /
• 2004

Comparison of prices and specifications is a very important informations for the decision of buying selected goods. It is hard to get informations of comparison of prices and specifications at the spot on off-line shopping. In this paper, we propose a system that provides optimized information of goods by PDA mobile phones and other mobile devices. The proposed system consists of a server that include a search robot and clients that can read barcode. When a client send the barcode information scanned by a camera attached his/her mobile device, the server sends the information of the goods to the client.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.4
• /
• pp.405-413
• /
• 2006

A novel approach based on genetic algorithms (GA) is developed to find a global minimum-jerk trajectory of a space robotic manipulator in joint space. The jerk, the third derivative of position of desired joint trajectory, adversely affects the efficiency of the control algorithms and stabilization of whole space robot system and therefore should be minimized. On the other hand, the importance of minimizing the jerk is to reduce the vibrations of manipulator. In this formulation, a global genetic-approach determines the trajectory by minimizing the maximum jerk in joint space. The planning procedure is performed with respect to all constraints, such as joint angle constraints, joint velocity constraints, joint angular acceleration and torque constraints, and so on. We use an genetic algorithm to search the optimal joint inter-knot parameters in order to realize the minimum jerk. These joint inter-knot parameters mainly include joint angle and joint angular velocities. The simulation result shows that GA-based minimum-jerk trajectory planning method has satisfactory performance and real significance in engineering.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.111-114
• /
• 1997

Usually, Evolutionary Algorithms are considered more efficient for optimal system design, However, the performance of the system is determined by fitness function and system environment. In this paper, in order to overcome the limitation of the performance by this factor, we propose a co-evolutionary method that two populations constantly interact and coevolve. In this paper, we apply coevolution to neural network's evolving. So, one population is composed of the structure of neural networks and other population is composed of training patterns. The structure of neural networks evolve to optimal structure and, at the same time, training patterns coevolve to feature patterns. This method prevent the system from the limitation of the performance by random design of neural network structure and inadequate selection of training patterns. In this time neural networks are trained by evolution strategies that are able to apply to the unsupervised learning. And in the coding of neural networks, we propose the method to maintain nonredundancy and character preservingness that are essential factor of genetic coding. We show the validity and the effectiveness of the proposed scheme by applying it to the visual servoing of RV-M2 robot manipulators.