• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3732-3838
• /
• 2000

As the Internet sites and users have rapidly been increased, the development for search engines has also been accelerated to satisfy users' expectations. As the result, not only the action of collecting documents through many search engines gave hosts workload, but also regular updating all the information is needed since information is newly added. With the circumstances, the necessity of the technology to collect massive information in hosts has been increased for the speed which is a basic requisite of search systems, and for more accurate collection of documents. Also, the role of search engines grows bigger for Internet users' various demands and flexible process through World Wide Web. In this paper, we design and implement a robot agent and a remote control system which doesn't give an excessive workload on a target server and makes the collection of documents done in a short period by considering an average workload rate on the target server and the rate of the workload that a robot experience in collection time, after we compare and analyze the existing Robot Agent Systems and supplement their weak points.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.6
• /
• pp.1067-1078
• /
• 2020

With the development of internet technology, a lot of content is produced, and the demand for it is increasing. Accordingly, the number of contents in circulation is increasing, while the number of distributing illegal copies that infringe on copyright is also increasing. The Korea Copyright Protection Agency operates a illegal content obstruction program based on substring matching, and it is difficult to accurately search because a large number of noises are inserted to bypass this. Recently, researches using natural language processing and AI deep learning technologies to remove noise and various blockchain technologies for copyright protection are being studied, but there are limitations. In this paper, noise is removed from data collected online, and keyword-based illegal copies are searched. In addition, the same heavy uploader is estimated through profiling analysis for heavy uploaders. In the future, it is expected that copyright damage will be minimized if the illegal copy search technology and blocking and response technology are combined based on the results of profiling analysis for heavy uploaders.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.3
• /
• pp.50-57
• /
• 2009

We propose a network node search scheme to address the network fragmentation due to high node mobility in the VANET. VANET is very similar to MANET in that a multi-hop ad-hoc network is configured by wireless communication between vehicles without any network infrastructure. However, high speed mobility, high node density, and frequent topology change induce frequent network fragmentation so that overall network traffic can be increased. In this paper, new broadcasting protocol called an adaptive relay node search protocol is proposed to decrease the network fragmentation. It reduces the network fragmentation and network traffic by researching nodes outside the dangerous area only in case of network fragmentation. Simulation results show that the proposed protocol decreases network fragmentation by up to 39.9% and increase informed rate by up to 41.9% compared to the existing broadcasting protocol.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.4
• /
• pp.270-275
• /
• 2016

We present an approach for acceleration actor-critic algorithm for reinforcement learning with continuous action space. Actor-critic algorithm has already proved its robustness to the infinitely large action spaces in various high dimensional environments. Despite that success, the main problem of the actor-critic algorithm remains the same-speed of convergence to the optimal policy. In high dimensional state and action space, a searching for the correct action in each state takes enormously long time. Therefore, in this paper we suggest a search accelerating function that allows to leverage speed of algorithm convergence and reach optimal policy faster. In our method, we assume that actions may have their own distribution of preference, that independent on the state. Since in the beginning of learning agent act randomly in the environment, it would be more efficient if actions were taken according to the some heuristic function. We demonstrate that heuristically-accelerated actor-critic algorithm learns optimal policy faster, using Educational Process Mining dataset with records of students' course learning process and their grades.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.660-663
• /
• 2004

The vehicle routing problem with time-varying speed(VRPTVS) is difficult to handle with regular problem solving approaches. An approach by partitioning the service zone into three sub-zones to reduce computing time and vehicle traveling distance is suggested in this paper. To develop a partitioning algorithm for VRPTVS, all customer locations are divided into two sections such as morning zone and evening zone, excluding daytime zone. And then each service zone is calculated to find a possible number of delivery points and chosen by time window having more number of possible delivery points by considering customer location and varying speeds. A temporary complete route that can serve all target points is developed by this procedure and a pairwise exchange method is applied to reduce the traveling time.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.13-16
• /
• 2005

It would be desirable to have methods for specific problems, which have low communication costs compared to the computation costs, and in specific applications, algorithms need to be developed and mapped onto parallel computer architectures. Main memory access for shared memory system or global communication in message passing system deteriorate the computation speed. In this paper, it is found that the m-step generalization of the block Lanczos method enhances parallel properties by forming m simultaneous search direction vector blocks. QR factorization, which lowers the speed on parallel computers, is not necessary in the m-step block Lanczos method. The m-step method has the minimized synchronization points, which resulted in the minimized global communications compared to the standard methods.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3367-3378
• /
• 1999

ATM technology, which acts as a representative high-speed bandwidth technology, plays an important role in Internet environment. ATM network, supporting QoS(Quality of Service) and various traffic characters in high speed, configures many VPC(Virtual Path Connection)/VCC(Virtual Channel Connection). It is important to guarantee the QoS of each connection and it is necessary for the network manager to search element affecting the QoS of VPC/VCC and to control ATM network correctly. In the paper, the management information of VPC/VCC, that ATM network manager Using the fault notification for ATM switch, we can manage the configuration, fault and performance of ATM network. Thus, we extracted the configuration, fault and performance monitoring item from the ATM-MIB and SNMP M4 Network Element View MIB. And we designed the ATM network configuration, fault and performance management system based on the extracted item.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.4
• /
• pp.515-520
• /
• 2009

According to the operating characteristics of pump applications, they should exhibit high efficiency and energy saving capabilities throughout the whole operating process. A novel efficiency optimization control strategy is presented here to meet the high efficiency demand of a variable speed Permanent Magnet Synchronous Motor (PMSM). The core of this strategy is the excellent integration of mended maximum torque to the current control algorithm, based on the losses model during the dynamic and the grade search method with changed step by fuzzy logic during the steady. The performance experiments for the control system of a variable speed high efficiency PMSM have been completed. The test results verified that the system can reliably operate with a different control strategy during dynamic and steady operation, and the system exhibits better performance when using the efficiency-optimization control.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.672-675
• /
• 1997

This paper presents the identification of rotor dynamic parameters. The solution of the system equation can be obtained using least square method. The sensitivity analysis is performed to extract optimized solution, which is considered to be insensitive to inherent measurement errors. The cosine and sine term of orbit shapes can be obtained by experiment the orbit analysis at a different speed after doing orbit analysis at an arbitrary selected speed. This values measured time domain used to search the stiffness and damping coefficients of rotor bearing.

• Journal of Mechanical Science and Technology
• /
• v.17 no.12
• /
• pp.1938-1948
• /
• 2003

This paper represents that an enhanced genetic algorithm (EGA) is applied to optimal design of a squeeze film damper (SFD) to minimize the maximum transmitted load between the bearing and foundation in the operational speed range. A general genetic algorithm (GA) is well known as a useful global optimization technique for complex and nonlinear optimization problems. The EGA consists of the GA to optimize multi-modal functions and the simplex method to search intensively the candidate solutions by the GA for optimal solutions. The performance of the EGA with a benchmark function is compared to them by the IGA (Immune-Genetic Algorithm) and SQP (Sequential Quadratic Programming). The radius, length and radial clearance of the SFD are defined as the design parameters. The objective function is the minimization of a maximum transmitted load of a flexible rotor system with the nonlinear SFDs in the operating speed range. The effectiveness of the EGA for the optimal design of the SFD is discussed from a numerical example.