• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.7
• /
• pp.666-673
• /
• 2008

To construct the accurate radio satellite navigation system, the efficient communication each satellite with the ground station is very important. Throughout the communication, the orbit of each satellite can be corrected, and those information will be used to analyze the satellite satus by the operator. Since there are limited resources of ground station, the schedule of antenna's azimuth and elevation angle should be optimized. On the other hand, the satellite in the medium earth orbit does not pass the same point of the earth surface due to the rotation of the earth. Therefore, the antenna pass schedule must be updated at the proper moment. In this study, Q learning approach which is a form of model-free reinforcement learning and genetic algorithm are considered to find the optimal antenna schedule. To verify the optimality of the solution, numerical simulations are conducted.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.111-118
• /
• 2014

In mobile sensor networks, a large number of sensor nodes with battery powered are deployed randomly in a region. They monitor the environmental states and transmit data to its neighboring nodes. For mobile sensor networks, It is needed to maintain the connectivity autonomously among nodes as the sensor node moves. However, the existing works have focused on the energy savings in the fixed sensor networks. A specific algorithm considering node mobility is required in the mobile sensor networks. Along with energy efficiency, the transmission delay should be considered. In this paper, we propose an autonomous configuration scheme and a node scheduling algorithm when a moving node joins into the existing network. Through simulations, we show a superior performance of the proposed algorithm to the existing protocol.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1900-1906
• /
• 1997

In this paper, the efficient BILBO(named EBILBO) is designed for BIST that is able to batch the testing when circuit is designed on FPGA. The proposed algorithm of batch testing is able to test the normal operation speed with one-pin-count that can control all part of large and complex circuit. PRTPG is used for the test pattern and MISR is used for PSA. The proposed algorithm of batch testing is VHDL coding on behavioral description, so it is easily modified the model of test pattern generation, signature analysis and compression. The EBILBO's area and the performance of designed BIST are evaluated with ISCAS89 benchmark circuit on FPGA. In circuit with above 600 cells, it is shown that area is reduced below 30%, test pattern is flexibly generated about 500K and the fault coverage is from 88.3% to 100%. EBILBO for the proposed batch testing BIST is able to execute concurrently normal and test mode operation in real time to the number of $s+n+(2^s/2^p-1)$ clock(where, in CUT, # of PI;n, # of register, p is order # of polynomial). The proposed algorithm coded with VHDL is made of library, then it well be widely applied to DFT that satisfy the design and test field on sme time.

• Journal of Korean Society of Transportation
• /
• v.19 no.6
• /
• pp.143-160
• /
• 2001

Micro-simulation models have been recognized as an efficient assessment tool in developing traffic signal control technologies. In this paper a prototype of a microscopic simulation model which can be applied to evaluate the performance of traffic-adaptive signal control strategies was developed. In the simulation process, space-based arrays were appled to estimate parameters of car following and lane changing models. Two levels of link types, a micro-type and macro-type links, were also embodied in the simulation process. The proposed model was tested on a test network consists of 9 intersections. The performance of the proposed model was evaluated in link by link comparisons with the results of NETSIM. The results show that the proposed model could appropriately simulate traffic flows of the test network. The model also produces traffic adaptive signal timings, cycle lengths and green times for turning movements, based on the detector data. It implies that the optimization process of the model produces reasonable signal timings for the test network on the cycle basis.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.133-140
• /
• 2007

Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2008.05a
• /
• pp.254-258
• /
• 2008

본 연구는 격자기반 운동파 강우유출모형 KIMSTORM(grid-based KIneMatic wave STOrm Runoff Model)의 기능을 개선하고 적용성을 평가하는 것이다. KIMSTORM은 김성준(1998)이 개발한 분포형 강우유출모형으로 포화상태의 지표흐름 및 토양수분상태의 시공간적인 분포를 파악할 수 있다. UNIX C++ 언어로 개발되었으며, GRASS 형태의 ASCII Grid를 입출력하도록 구성되어 있는 모형으로 UNIX 운영체제에서 구동이 가능하다. 그러나 UNIX와 GRASS는 최근에 많이 이용되지 않는 추세로 KIMSTORM 모형을 이용한 홍수유출해석이 적극적으로 활용되는데 주요 제약사항이 되어 왔다. 본 연구에서는 KIMSTORM을 윈도우즈 환경에서 운영될 수 있도록 FORTRAN 90을 이용하여 재개발하였으며 주요개선 사항으로, ESRI ASCII Grid 형태의 GIS(geographic information system) 자료 입력, 물리적 침투모의 방법인 GAML (Green-Ampt and Mein- Larson) 적용, 공간강우 입력가능, 정렬 알고리즘을 이용한 계산속도의 개선, 모형 자료입력 등 전처리 기능개선, 계산결과의 자동평가 및 분포도출력 등 후처리 방식개선으로 요약할 수 있다. 개선된 모형 GAML에 의한 침투방법을 적용하여, 남강댐유역($2,293\;km^2$)의 6개 강우사상을 대상으로 결정계수, Nash & Sutcliffe 모형효율계수, 용적편차, 첨두유량의 상대오차, 첨두시간의 절대오차를 이용하여 적용성을 평가하였으며, 민감도분석결과 초기토양수분조건과 하천조도계수가 가장 큰 민감도를 나타내었다.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.6 no.3
• /
• pp.29-36
• /
• 2002

A numerical analysis based on two-dimensional and three-dimensional incompressible Wavier-Stokes equations has been carried out for double-circular-arc compressor cascades and the results are compared with available experimental data at various incidence angles. The 2-D and 3-D computational codes based on SIMPLE algorithm adopt pressure weighted interpolation method for non-staggered grid and hybrid scheme for the convective terms. Turbulence modeling is very important for prediction of cascade flows, which are extremely complex with separation and reattachment by adverse pressure gradient. Considering computation times, $\kappa$-$\varepsilon$ turbulence model with wall function is used.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.770-771
• /
• 2015

In this paper, we proposed and implemented the automation of cable drum scheduling which is required a considerable construction cost for electrical equipment in power plant. Implemented cable drum scheduling can be reduced the calculation time of cable drum scheduling, and it is possible to minimize the consuming time of cable drum scheduling than conventional methods. Some experiments are conducted to verify the proposed method, and as a result, the automation of cable drum scheduling is well performed, enabling cables can be optimized and scheduled to fit the drum capacity with productivity enhancement of electrical installations.

• Journal of KIISE:Software and Applications
• /
• v.28 no.8
• /
• pp.570-581
• /
• 2001

본 논문에서는 윤곽선(edge) 기반의 형태 정보와 웨이브렛 변환(wavelet transform)에 의한 방향(direction) 정보를 사요하는데 2단계 상표 영상 검색 시스템을 제안한다. 1 단계에서는 후보 상표 영상을 추출하기 위해 영상의 전반적인 정보로 원 상표 영상(original trademark image)을 웨이브렛 변환하여 얻은 X, Y 방향 고주파(high frequency) 성분으로부터 구한 방향 정보와 영상의 윤곽선에 대해 모멘트를 구하는 향상된 불변 모멘트(improved invariant moment)를 이용한다. 2단계에서는 후부 영상들에 대해 영상의 세부 정보인 윤곽선 각도(edge angle)와 윤곽선 반지름(edge radius) 정보를 추출하여 유사도 측정 알고리즘을 통해 결과 영상을 산출하게 된다. 본 상표 영상 검색 시스템은 문자 색인으로는 색인이 용이 하지 않은 기하학적도형 상표 영상만을 사용하였다. 본 시스템에서는 색상과는 상관없는 특징인 형태 정보와 방향 정보만을 이용하므로 같은 색상 구성을 가진 유사 영상뿐만 아니라, 유사하지만 바탕이 반전된 영상이나 색상이 다른 유사 영상에 대해서도 바르게 검색할 수 있으며, 각 특징을 일반화해줌으로 이동.회전.크기 변화에도 불변하는 견고성을 가진다. 또한 효율적인 검색을 위해 2단계의 구조를 사용하였으며, 각 단계마다 계산량을 줄여 검색 시간을 감소시키도록 설계되었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.78-87
• /
• 2015

Content-Centric Networking(CCN) is a new networking paradigm to search for the routing information needed to find a data from the content name, unlike conventional IP networks. In CCN, the mobility management, one of the CCN challenges, is consists of consumer mobility and content provider mobility. Among both, in the case of the content provider mobility, it requires too much overhead and time to update routing information on the corresponding routers. In this paper, we propose Popularity-based Pushing CCN(PoPCoN) which considers the content popularity to support effective mobility of content provider in CCN. Our proposed algorithm shortens content download time for the consumer and reduces the network overhead during mobility as compared to the existing approaches.