• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.946-952
• /
• 2014

Mobility prediction is one of hot topics using location history information. It is useful for not only user-level applications such as people finder and recommendation sharing service but also for system-level applications such as hand-off management, resource allocation, and quality of service of wireless services. Most of current prediction techniques often use a set of significant locations without taking into account possible location information changes for prediction. Markov-based, LZ-based and Prediction by Pattern Matching techniques consider interesting locations to enhance the prediction accuracy, but they do not consider interesting location changes. In our paper, we propose an algorithm which integrates the changing or emerging new location information. This approach is based on Active LeZi algorithm, but both of new location and all possible location contexts will be updated in the tree with the fixed depth. Furthermore, the tree will also be updated even when there is no new location detected but the expected route is changed. We find that our algorithm is adaptive to predict next location. We evaluate our proposed system on a part of Dartmouth dataset consisting of 1026 users. An accuracy rate of more than 84% is achieved.

• Journal of Korean Public Health Nursing
• /
• v.16 no.1
• /
• pp.201-212
• /
• 2002

This study was designed to identify the risk factors of unplanned readmission in a university hospital. The six-month discharge information from January to June, 2000 in a tertiary university hospital was used as a source of data through the medical record and hospital information system. To increase the effect of comparison. the data were collected by sampling 192 couples (384 patients) of unplanned readmission group through the matching by its disease groups, sex, and age. The accuracy of prediction for unplanned readmission was analyzed by constructing the predicted model of unplanned readmission through the logistic regression. The study results are as follows. The conditional logistic regression analysis was performed with nine variables at the significance level 0.05 through univariate analysis including residence, days after discharge, initial admission route, previous admission, transfer to special care unite, hospital stay days, medical care expenses, special cares, and laboratory and imaging services. As a result, the closer the patients live in Seoul and Gyeong-in area (Odds ratio=2.529, p=0.003), the shorter the days after discharge was (Odds ratio=0.600, p=0.000), and the more frequent admission rate was (Odds ratio=2.317, p=0.004), the more unplanned readmission was resulted. Also, the accuracy of prediction for data classification of this regression model showed $70.3\%$(032+83/306).

• Coupled systems mechanics
• /
• v.12 no.6
• /
• pp.503-517
• /
• 2023

Standard Digital Volume Correlation (DVC) approaches are based on pattern matching between two reconstructed volumes acquired at different stages. Such frameworks are limited by the number of scans (due to acquisition duration), and time-dependent phenomena can generally not be captured. Projection-based Digital Volume Correlation (P-DVC) measures displacement fields from series of 2D radiographs acquired at different angles and loadings, thus resulting in richer temporal sampling (compared to standard DVC). The sought displacement field is decomposed over a basis of separated variables, namely, temporal and spatial modes. This study utilizes an alternative route in which spatial modes are con-structed via scan-wise DVC, and thus only the temporal amplitudes are sought via P-DVC. This meth-od is applied to a glass fiber mat reinforced polymer specimen containing a machined notch, subjected to in-situ cyclic tension, and imaged via X-Ray Computed Tomography. Different temporal interpolations are exploited. It is shown that utilizing only one DVC displacement field (as spatial mode) was sufficient to properly capture the complex kinematics up to specimen failure.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.103-110
• /
• 2009

We propose a novel routing protocol selection scheme based on the application feature in wireless mesh network. Each application has its own feature such as its packet size. For example, text messenger generates short size packets and file transfer application generates long size packets. Routing protocols in wireless mesh network discover the route with different features. Some find shortest hop routes; others find the routes consisting of high bandwidth though they have more hops. The proposed scheme selects the routing protocol by matching the feature of routing protocol and that of application. This paper shows the system that we have developed for supporting mesh routing as well as the proposed scheme and experimental results.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.5
• /
• pp.873-882
• /
• 2017

Smart cards are currently used in about 150 locales, including the metropolitan ares, and are utilized as a policy base for various public areas, including public transportation, bus fares, and public transportation requirements. However, excluding the metropolitan area and some metropolitan areas, there are many areas where the existing BIS data was unable to match station information on the data and Smart cards itself are not available on the bus stop information by the line. The purpose of this research was to produce bus stop information generated by the bus stop based on the bus route, and the actual stop information generated by the model presented in the study was derived by matching the actual station information.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.4
• /
• pp.304-310
• /
• 2017

In this paper, we propose the architecture of an IPM based lane detector for autonomous vehicles to detect and control the driving route along the curved lane. In the IPM image, we divide the area into two fields, Far/Near Field, and the lane candidate region is detected using the Hough transform to perform the matching for the curved lane. In autonomous vehicles, various algorithms must be embedded in the system. To reduce the system resources, we proposed a method to minimize the number of memory accesses to the image and various parameters on the external memory. The proposed circuit has 96% lane recognition rate and occupies 16% LUT, 5.9% FF and 29% BRAM in Xilinx XC7Z020. It processes Full-HD image at a rate of 42 fps at a 100 MHz operating clock.

• Journal of Convergence for Information Technology
• /
• v.7 no.5
• /
• pp.137-148
• /
• 2017

Recently, researchers are actively addressed to utilize Unmanned Aerial Vehicles(UAV) for military and industry applications. One of these applications is to trace the preceding flight when it is necessary to track the route of the suspicious reconnaissance aircraft in secret, and it is necessary to estimate the attitude of the target flight such as Roll, Yaw, and Pitch angles in each instant. In this paper, we propose a method for estimating in real time the attitude of a target aircraft using the video information that is provide by an external camera of a following aircraft. Various image processing methods such as color space division, template matching, and statistical methods such as linear regression were applied to detect and estimate key points and Euler angles. As a result of comparing the X-plane flight data with the estimated flight data through the simulation experiment, it is shown that the proposed method can be an effective method to estimate the flight attitude information of the previous flight.

• Journal of Korean Society of Transportation
• /
• v.23 no.2
• /
• pp.107-116
• /
• 2005

The information on travel time in providing the information of traffic to drivers is one of the most important data to control a traffic congestion efficiently. Especially, this information is the major element of route choice of drivers, and based on the premise that it has the high degree of confidence in real situation. This study developed a vehicle arrival time prediction algorithm called as "VAT-DV" for 6 corridors in total 6.1Km of "Nam-san area trffic information system" in order to give an information of congestion to drivers using VMS, ARS, and WEB. The spatial scope of this study is 2.5km~3km sections of each corridor, but there are various situations of traffic flow in a short period because they have signalized intersections in a departure point and an arrival point of each corridor, so they have almost characteristics of interrupted and uninterrupted traffic flow. The algorithm uses the information on a demand volume and a queue length. The demand volume is estimated from density of each points based on the Greenburg model, and the queue length is from the density and speed of each point. In order to settle the variation of the unit time, the result of this algorithm is strategically regulated by importing the AVI(Automatic Vehicle Identification), one of the number plate matching methods. In this study, the AVI travel time information is composed by Hybrid Model in order to use it as the basic parameter to make one travel time in a day using ILD to classify the characteristics of the traffic flow along the queue length. According to the result of this study, in congestion situation, this algorithm has about more than 84% degree of accuracy. Specially, the result of providing the information of "Nam-san area traffic information system" shows that 72.6% of drivers are available.

• Journal of the Korean Academy of Child and Adolescent Psychiatry
• /
• v.14 no.1
• /
• pp.81-94
• /
• 2003

Objectives：Developmental reading disorder is a condition which manifests significant developmenttal delay in reading ability or persistent errors. About 3-7% of school-age children have this condition. The purpose of the present study was to validate the diagnostic values of Word/Nonword Reading Test and Letter-Symbol Discrimination Task for the purpose of overcoming the caveats of Basic Learning Skills Test. Methods：Sixty-three reading-disordered patients(mean age 10.48 years old) and sex, age-matched 77 normal children(mean age 10.33 years old) were selected by clinical evaluation and DSM-IV criteria. Reading I and II of Basic Learning Skills Test, Word/Nonword Reading Test, and Letter-Symbol Discrimination Task were carried out to them. Word/Nonword Reading Test：One hundred usual highfrequency words and one hundred meaningless nonwords were presented to the subjects within 1.2 and 2.4 seconds, respectively. Through these results, automatized phonological processing ability and conscious letter-sound matching ability were estimated. Letter-Symbol Discrimination Task：mirror image letters which reading-disordered patients are apt to confuse were used. Reliability, concurrent validity, construct validity, and discriminant validity tests were conducted. Results：Word/Nonword Reading Test：the reliability(alpha) was 0.96, and concurrent validity with Basic Learning Skills test was 0.94. The patients with developmental reading disorders differed significantly from normal children in Word/Nonword Reading Test performances. Through discriminant analysis, 83.0% of original cases were correctly classified by this test. Letter-Symbol Discrimination Task：the reliability(alpha) was 0.86, and concurrent validity with Basic Learning Skills test was 0.86. There were significant differences in scores between the patients and normal children. Factor analysis revealed that this test were composed of saccadic mirror image processing, global accuracy, mirror image processing deficit, static image processing, global vigilance deficit, and inattention-impulsivity factors. By discriminant analysis, 87.3% of the patients and normal children were correctly classified. Conclusion：The patients with developmental reading disorders had deficits in automatized visuallexical route, morpheme-phoneme conversion mechanism, and visual information processing. These deficits were reliably and validly evaluated by Word/Nonword Reading Test and Letter-Symbol Discrimination Task.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.691-700
• /
• 2006

Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.