• Journal of Electrical Engineering and Technology
• /
• v.7 no.2
• /
• pp.151-156
• /
• 2012

The current study presents a zero-one integer programming approach to determine the minimum break point set for the coordination of directional relays. First, the network is reduced if there are any parallel lines or three-end nodes. Second, all the directed loops are enumerated to reduce the iteration. Finally, the problem is formulated as a set-covering problem, and the break point set is determined using the zero-one integer programming technique. Arbitrary starting relay locations and the arbitrary consideration of relay sequence to set and coordinate relays result in navigating the loops many times and futile attempts to achieve system-wide relay coordination. These algorithms are compared with the existing methods, and the results are presented. The problem is formulated as a setcovering problem solved by the zero-one integer programming approach using LINGO 12, an optimization modeling software.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.6 no.1
• /
• pp.49-58
• /
• 2003

Compared with generic GPS receiver, post-processing software GPS receiver has many advantages for high dynamic vehicle tracking. It has the advantage of the application of various tracking algorithms and aiding schemes. The post-processing system observes the carrier phase measurement data from the recorded GPS signals, detects and isolates the cycle slip. The observed carrier phase data and the raw data of the reference station are processed by carrier phase DGPS scheme. And the integer ambiguity resolution algorithm is used for resolving single frequency carrier phase ambiguity. The results of static and real flight test are presented and show that the proposed GPS translator processing system satisfies submeter accuracy.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.33-40
• /
• 2000

Computer Aided Process Planning (CAPP) plays a key role by linking CAD and CAM. Given CAD data of a part, CAPP has to recognize manufacturing features of the part. Despite the long history of research on feature recognition, its research results have rarely been transferred into industry. One of the reasons lies in the separation of feature recognition and process planning. This paper proposes to integrate the two activities through AI techniques, and presents efforts for manufacturable feature recognition, setup minimization, feature dependency construction, and generation of an optimal machining sequence.

• Annual Conference of KIPS
• /
• 2014.11a
• /
• pp.894-897
• /
• 2014

The speed of processes and the extremely large amount of data to be used in Intelligence Transportations System (ITS) cannot be handling by humans without considerable automation. However, it is difficult to develop software with conventional fixed algorithms (hard-wired logic on decision making level) for effectively manipulate dynamically evolving real time transportation environment. This situation can be resolved by applying methods of artificial intelligence and data mining that provide flexibility and learning capability. This paper presents a brief introduction of data mining and artificial intelligence (AI) applications in Intelligence Transportation System (ITS), analyzing the prospects of enhancing the capabilities by means of knowledge discovery and accumulating intelligence to support in decision making.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1316-1318
• /
• 2003

The Bernstein polynomial is one of the classic algorithms of panoramic images mosaic for shading into process applying in Virtual Reality modeling. Nevertheless, it is proven that the algorithm has its own limitation and weakness in applications. This paper was given the improved algorithm using Sinusoidal function for image mosaic. In order to put the new algorithm into image processing software as a flexible and general tool, it was further developed an extension for graduation image fusion and multi-images mosaic.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1998.06a
• /
• pp.171-182
• /
• 1998

An automated surface-strain measuring system using the image processing technique is developed in the present study, which consists of the hardware to capture and to display digital images, and the software to calculate the 3D informations of grid points from two views. New or improved algorithms the mapping and establishing correspondence of grid points and elements, the camera calibration, and the subpixel measurement of grid points, are implemented. As an application of the present system the surface-strains of deformed blanks in the limitting dome height test, the square cup deep-drawing and punch stretching to obtain the forming limit diagram are measured. The results are compared with those obtained by conventional manual methods.

• Transactions of Materials Processing
• /
• v.7 no.6
• /
• pp.575-585
• /
• 1998

An automated surface-strain measuring system using the image processing technique is developed in the present study which consists of the hardware to capture and to display digital images. and the software to calculate the 3-D informations of grid points from two views. New or improved algorithms for the mapping and establishing correspondence of grid points and elements the camera calibration and the subpixel measurement of grid points are implemented. As an application of the present system the surface-strains of deformed blanks in the limitting dome height test the square cup deep-drawing and punch stretching to obtain the forming limit diagram are measured. The results are com-pared with those obtained by conventional manual methods.

• Korean Journal of Remote Sensing
• /
• v.16 no.2
• /
• pp.145-156
• /
• 2000

Clustering is the process of partitioning a data set into meaningful clusters. As the data to process increase, a laster algorithm is required than ever. In this paper, we propose a clustering algorithm to partition a multispectral remotely sensed image data set into several clusters using a hash search algorithm. The processing time of our algorithm is compared with that of clusters algorithm using other speed-up concepts. The experiment results are compared with respect to the number of bands, the number of clusters and the size of data. It is also showed that the processing time of our algorithm is shorter than that of cluster algorithms using other speed-up concepts when the size of data is relatively large.

• Proceedings of the KSR Conference
• /
• 1998.11a
• /
• pp.255-261
• /
• 1998

The train automatic operation control system is an on-board train control system that is widely adopted in modern rapid transit systems. The control system consists of TCMS(Train Control and Monitoring System), ATC(Automatic Train Control), ATO(Automatic Train Operation) and TWC(Train to wayside communication) in the train and wayside facilities. The functions of the system is to regulate train riding comfort, to service limited speed and smoothness during start, acceleration, constant speed travel, and fixed point parking under the corresponding commands. The paper describes the simulation model of the train automatic operation control of subway system, configuration of simulator hardware and software and operational algorithms.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.297-305
• /
• 2021

Large amount of data is being generated in gaming servers due to the increase in the number of users and the variety of game services being provided. In particular, load balancing schemes for gaming servers are crucial consideration. The existing literature proposes algorithms that distribute loads in servers by mostly concentrating on load balancing and cooperative offloading. However, many proposed schemes impose heavy restrictions and assumptions, and such a limited service classification method is not enough to satisfy the wide range of service requirements. We propose a load balancing agent that combines the dynamic allocation programming method, a type of greedy algorithm, and proximal policy optimization, a reinforcement learning. Also, we compare performances of our proposed scheme and those of a scheme from previous literature, ProGreGA, by running a simulation.