• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2475-2478
• /
• 2002

This paper consider's the problem of exploring an unfamiliar environment in search of recognizable objects of visual landmarks. In order to extract and recognize them automatically, a feature map is constructed which records the set of features continually during a learning phase. The map contains photometric geometric, and metric information of each feature. Meanwhile, the localization algorithm can determine the position of the robot by extracting features and matching in the map. These procedures are implemented and tested using an AMR, and preliminary results are presented in this paper.

• Proceedings of the KOR-KST Conference
• /
• 2000.02a
• /
• pp.89-115
• /
• 2000

Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperform the iterative search and (2) in the large network, vice versa.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.387-396
• /
• 2004

One of the main problems associated with MANETs is that mobility and the associated route discovery and maintenance procedures of reactive routing protocols cause severe interruptions on real-time video streams. Some of these interruptions are too large to be concealed using any sort of video technology, resulting in communications breaks unpleasant for the final end user. We present a solution for enhanced video transmission that increases route stability by using an improved route discovery process based on the DSR routing protocol, along with traffic splitting algorithms and a preventive route discovery mechanism. We also present some video adaptative mechanisms that improve the overall performance of multipath routing in terms of video data replication and video packet splitting strategies. Combining our proposals, we achieve up to 97% less interruptions on communication with high mobility and over 1.2 dB of improvements in terms of video distortion.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.35 no.4
• /
• pp.435-447
• /
• 1999

It is main objective of this approach to present a method to analyse stochastic design sensitivity for problems of structural dynamics with randomness in design parameters. A combination of the adjoint variable approach and the second order perturbation method is used in the finite element approach. An alternative form of the constant functional that holds for all times is introduced to consider the time response of dynamic sensitivity. The terminal problem of the adjoint system is solved using equivalent homogeneous equations excited by initial velocities. The numerical procedures are shown to be much more efficient when based on the fold superposition method: the generalized co-ordinates are normalized and the correlated random variables are transformed to uncorrelated variables, whereas the secularities are eliminated by the fast Fourier transform of complex valued sequences. Numerical algorithms have been worked out and proved to be accurate and efficient : they can be readily adapted to fit into the existing finite element codes whose element derivative matrices can be explicitly generated. The numerical results of two cases -2 dimensional portal frame for the comparison with reference and 3-dimensional frame structure - for the deterministic sensitivity analysis are presented.

• Communications for Statistical Applications and Methods
• /
• v.18 no.2
• /
• pp.257-266
• /
• 2011

The rapid development of airlines, has made airports busier and more complicated. The assignment of scheduled to available gates is a major issue for daily airline operations. We consider the over-constrained airport gate assignment problem(AGAP) where the number of flights exceeds the number of available gates, and where the objectives are to minimize the number of ungated flights and the total walking distance or connection times. The procedures used in this project are to create a mathematical model formulation to identify decision variables to identify, constraints and objective functions. In addition, we will consider in the AGAP the size of each gate in the terminal and also the towing process for the aircraft. We will use a greedy algorithm to solve the problem. The greedy algorithm minimizes ungated flights while providing initial feasible solutions that allow flexibility in seeking good solutions, especially in case when flight schedules are dense in time. Experiments conducts give good results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.1009-1017
• /
• 2010

Offering of different attractive opportunities by different wireless technologies trends the convergence of heterogeneous networks for the future wireless communication system. To make a seamless handover among the heterogeneous networks, the optimization of the power consumption, and optimal selection of interface are the challenging issues. The access of multi interfaces simultaneously reduces the handover latency and data loss in heterogeneous handover. The mobile node (MN) maintains one interface connection while other interface is used for handover process. However, it causes much battery power consumption. In this paper we propose an efficient interface selection scheme including interface selection algorithms, interface selection procedures considering battery power consumption and user mobility with other existing parameters for overlaying networks. We also propose a priority based network selection scheme according to the service types. MN‘s battery power level, provision of QoS/QoE and our proposed priority parameters are considered as more important parameters for our interface selection algorithm. The performances of the proposed scheme are verified using numerical analysis.

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• pp.405-410
• /
• 1999

Topographic maps can be made and updated with satellite images, but it requires many human interactions that are inefficient and costly. Therefore, the automatizing of the road extraction procedures could increase efficiency in terms of time and cost. Although methods of extracting roads, railroads and rivers from satellite images have been developed in many studies, studies on the road extraction from satellite images of urbanized area are still not relevant, because many artificial components In the city makes the delineation of the roads difficult. So, to extract roads from high resolution satellite images of urbanized area, this study has proposed the combined use of wavelet transform and multi-resolution analysis. In consequence, this study verifies that it is possible to automatize the road extraction from satellite images of urbanized area. And to realize the automatization more completely, various algorithms need to be developed.

• IE interfaces
• /
• v.10 no.1
• /
• pp.15-22
• /
• 1997

In semiconductor manufacturing, the probe process between fabrication and assembly process is constrained mostly by the equipment capacity because most products pass through the similar procedures. The probe process is usually performed in a batch mode with relatively short cycle times. The capability of the probe process can be determined by the optimal combination of the equipments and the products. A probe line usually has several types of equipment with different capacity. In this study, the probe line is modeled in terms of capacity to give the efficient planning and control procedure. For the practical usage, the hierarchical capacity planning procedure is used. First, a monthly capacity plan is made to meet the monthly production plan of each product. Secondly, the daily capacity planning is performed by considering the monthly capacity plan and the daily fabrication output. Simple heuristic algorithms for daily capacity planning are developed and some experimental results are shown.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.05
• /
• pp.68-71
• /
• 1997

The early detection of brest cancer is clearly a key ingredient for any strategy designed to reduce breast cancer mortality. Microcalcification(MCC) is one of the primary signatures to discriminate between normal and cancerous tissue. The detection and locating procedures can be automated by digital image processing, however, MCCs have various sizes, shapes, and intensity levels in film images, so it is difficult to find accurate locations and sizes. Firstly, we made quantitative analysis for many characteristic features of mammograms that can be used to segment MCCs from normal tissues. Secondly, we developed algorithms proper to segmentation like pattern matching. The performance was evaluated with TP and FP rates.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.1
• /
• pp.108-114
• /
• 1988

We have developed a program that minimizes the chip area with effective code assignment of microinstructions when the control part of VLSI system is implemented in the PLA. While conventional algorithms are composed of one pass, the algorithm proposed in this paper is composed of two passes and it consists of three principal procedures: a procedure for the determination of the code assignment order, a procedure for the code assignment and a procedure for the reduction of the code length. especially, we have proposed a new method of folding back for the reduction of the code length. We have obtained the result of 4 bit code length and 9 product terms when 11 micro-instructions and 6 microoperations were given as a inputs. Therefore, we have certified that it could be used efficiently for the control part of the processors.