• Journal of Korean Library and Information Science Society
• /
• v.20
• /
• pp.155-186
• /
• 1993

This study aims at defining the concept of OPAC, tracing of research trends and development of it, and clarifying various methods of subject access and patterns of bibliographic searching in OPAC as well as strategies for improving to implement online catalogs. Although OPAC is so far the most user-friendly bibliographic searching method, there are still a lot of issues including online subject access in particular. Therefore a more effective and useful method for computer end-users have to be developed, for instance, improvement of an indexing system, a n.0, pplication of the classification system as a searching tool, a new design and construction of standardized thesaurus, betterment of user interface, introducing of expert system into bibliographic searching, establishment of subject authority file. Those would raise the success-rate of users seeking bibliographic information in the library catalogs. Korean libraries are in very early stage of OPAC implementation so that every efforts and concerns to improve strategies and techniques for subject access to OPAC have been strongly asked.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.6
• /
• pp.5-13
• /
• 2008

A smart submunition drops through the expected trajectory to have a appropriate target searching footprint for the armored ground vehicles. Parachutes can be used as a tool to decelerate and spin the submunition. Usually submunition's descent velocity, spin rate, submunition inclination angle against vertical and dynamic stability affect to its target searching footprint. Therefore it is important to design optimal parachute and load configuration for the overall system performance. In this paper we described the dynamic motion of submunition by the mathematical model of parachute and load. Through the computer simulation we can analyze the submunition footprint affected by parachute and load design.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.822-829
• /
• 2005

In this paper, a processing time and trafnc capacity analysis algorithm for RFID system using LBT-Random Searching scheme is proposed. Service time, carrier sensing time, additional delay time required for contiguous frequency channel occupancy, and additional delay time required for the contiguous using the same frequency channel are considered and the processing delay and frequency channel capacity are analyzed for the steady state operation of the system. The simulation results showing maximum capacity of the system and explaining the accuracy of the algorithm are provided.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2438-2446
• /
• 1999

Most of block based stereo pair compression schemes utilize the constant block size and searching area size for all the stereo pairs to find the best matching block. However, it is not efficient to use the same block size and size of searching area to all the stereo pairs, since each stereo pair has different disparity. In this Paper, we propose a method to calculate the total disparity of stereo pairs, and show how to determine the size of the block and searching area which are applied for the block based compression of the stereo pairs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.930-937
• /
• 2005

In this paper, a processing time and traffic capacity analysis algorithm for RFID system using LBT-serial searching scheme is proposed. Service time, carrier sensing time, additional delay time required for contiguous frequency channel occupancy, and additional delay time required for the contiguous using the same frequency channel are considered and the processing delay and frequency channel capacity are analyzed for the steady state operation of the system. The simulation results showing maximum capacity of the system and explaining the accuracy of the algorithm are provided.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.785-786
• /
• 2008

In this paper, we propose a fast Motion Estimation (ME) algorithm for low computational complexity based on spatial correlations. The proposed algorithm uses the motion vector of neighboring blocks, to decide the location of initial searching point. The number of searching point decreases by changing the location of initial searching point. Experimental results show that the proposed algorithm reduces searching points about $7{\sim}13%$ and increases PSNR about $0.1{\sim}0.5$(dB) compared with conventional algorithm.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.31-34
• /
• 1999

In this paper, the improved initial cell searching algorithm is proposed for 3GPP W-CDMA system. The key objective of the proposed algorithm is to utilize the reliability of the first stage of cell searching algorithm in order to accomplish the second stage. So the proposed algorithm makes the mobile station transfers to the second stage from the first stage, just after the slot synchronization is declared successively at the same time-offset. In order to compare the proposed algorithm with the conventional one, the simulations are accomplished for cell search algorithm for 3GPP W-CDMA systems in the multipath Rayleigh fading channel. Some parameters are also presented for the better performance in the initial cell searching algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.137-143
• /
• 2017

In this paper, we propose optimal route searching algorithm using ANN(Artificial Neural Network) and implement route searching system. Our proposed scheme shows that the route using artificial neural network is almost same as the route using Dijkstra's algorithm but the time in our propose algorithm is shorter than that of existing Dijkstra's algorithm. Proposed route searching method using artificial neural network has better performance than exiting route searching method because it use several weight value in making different routes. Through simulation, we show that our proposed routing system improves the performance and reduces time to make route irrespective of the number of hidden layers.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1995.10a
• /
• pp.30-36
• /
• 1995

Conventionally design for multi-stage cold forging depends on the designer's experience and decision-making. Due to such non-deterministic nature of the process sequence design, a flexible inference engine is needed for process design expert system. In this study, A* searching algorithm was introduced to arrive at the vetter process sequence design considering the number of forming stages and levels of effective strain, effective stress, and forming load during the porcess. In order to optimize the process sequence in producing the final part, cost function was defined and minimized using the proposed A* searching algorithm. For verification of the designed forming sequences, forming experiments and finite element analyses were carried out in the present investigation. The developed expert system using A* searching algorithm can produce a flexible design system based on changes in the number of forming stages and weights.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1999.03b
• /
• pp.22-25
• /
• 1999

A dynamic explicit finite element code for simulating sheet forming processes has been developed The code utilises the discrete Kirchhoff shell element and contact force is treated by a conventional penalty method. In order to reduce the computational cost a new and robust contact searching algorithm has been developed and implemented into the code. in the method a hierarchical structure of tool segments called a tree structure is built for each tool at the initial stage of the analysis Tree is built in a way to divide a trunk to 8 sub-trunk 2 in each direction until the lowest level of the tree(leaf) contains exactly one segment of the tool. In order to have a well-balanced tree each box on each sub level contains one eighth of the segments. Then at each time step contact line from a node comes out of the surface of the tool. Simulation of various sheet forming processes were performed to verify the validity of the developed code with main focus on he usefulness of the developed contact searching algorithm.