• Title/Summary/Keyword: 갱신 성능

Search Result 785, Processing Time 0.025 seconds

Prediction of Transient Ischemia Using ECG Signals (심전도 신호를 이용한 일시적 허혈 예측)

  • Han-Go Choi;Roger G. Mark
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.5 no.3
    • /
    • pp.190-197
    • /
    • 2004
  • This paper presents automated prediction of transient ischemic episodes using neural networks(NN) based pattern matching method. The learning algorithm used to train the multilayer networks is a modified backpropagation algorithm. The algorithm updates parameters of nonlinear function in a neuron as well as connecting weights between neurons to improve learning speed. The performance of the method was evaluated using ECG signals of the MIT/BIH long-term database. Experimental results for 15 records(237 ischemic episodes) show that the average sensitivity and specificity of ischemic episode prediction are 85.71% and 71.11%, respectively. It is also found that the proposed method predicts an average of 45.53[sec] ahead real ischemia. These results indicate that the NN approach as the pattern matching classifier can be a useful tool for the prediction of transient ischemic episodes.

  • PDF

Analysis on Update Performance of XML Data by the Labeling Method (Labeling 방식에 따른 XML 데이터의 갱신 성능 분석)

  • Jung Min-Ok;Nam Dong-Sun;Han Jung-Yeob;Park Jong-Hyen;Kang Ji-Hoon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.106-108
    • /
    • 2005
  • XML is situating a standard fur data exchange in the Web. Most applications use database to manage XML documents of high-capacity efficiently. Therefore, most applications create label that expresses structure information of XML data and stores with information of XML document. A number of labeling schemes have been designed to label the element nodes such that the relationships between nodes can be easily determined by comparing their labels. With the increased popularity of XML data on the web, finding a labeling scheme that is able to support order-sensitive queries in the presence of dynamic updates becomes urgent. XML documents that most applications use have many properties as their application. So, in the thesis, we present the most efficient updating methods dependent on properties of XML documents in practical application by choosing a representative labeling method and applying these properties. The result of our test is based on XML data management system, so it expect not only used directly in practical application, but a standard to select the most proper methods for environment of application to develop a new exclusive XML database or use XML.

  • PDF

An Efficient AMC Schemes for Mobile Satellite Communication Systems based on LTE (LTE 기반 이동 위성통신 시스템에서의 효율적인 AMC 방식)

  • Yeo, Sung-Moon;Hong, Tae-Chul;Kim, Soo-Young;Ku, Bon-Jun
    • Journal of Satellite, Information and Communications
    • /
    • v.5 no.1
    • /
    • pp.43-47
    • /
    • 2010
  • In future mobile networks, hybrid/integrated satellite and terrestrial systems will play an important role. Most of the mobile communication systems are focused on the terrestrial systems, in this case, compatibilities between the satellite and terrestrial systems are very important for efficiency of the systems. Terrestrial systems of all the 4G mobile communication adopted the adaptive modulation and coding (AMC) schemes for efficient usage of resources, and the updating interval of resource allocation in an order of msec. However, because of the long round trip delay of satellite systems, we cannot employ the same AMC scheme specified for the terrestrial system, and thus it cannot effectively counteract to short term fadings. In the paper, we propose the method to apply AMC to mobile satellite systems. In addition, in order to effectively counteract to short term fadings, we present the simulation results of the AMC combined with an interleaver.

THE DESIGN OF DGPS/INS INTEGRATION FOR IMPLEMENTATION OF 4S-Van (4S-Van 구현을 위한 DGPS/INS 통합 알고리즘 설계)

  • 김성백;이승용;김민수;이종훈
    • Journal of Astronomy and Space Sciences
    • /
    • v.19 no.4
    • /
    • pp.351-366
    • /
    • 2002
  • In this study, we developed low cost INS and (D)GPS integration for continuous attitude and position and utilized it for the determination of exterior orientation parameters of image sensors which are equipped in 4S-Van. During initial alignment process, the heading information was extracted from twin GPS and fine alignment with Kalman filter was performed for the determination of roll and pitch. Simulation and van test were performed for the performance analysis. Based on simulation result, roll and pitch error is around 0.01-0.03 degrees and yaw error around 0.1 degrees. Based on van test, position error in linear road is around 10 cm and curve around 1 m. Using direct georeferencing method, the image sensor's orientation and position information can be acquired directly from (D)GPS/INS integration. 4S-Van achieved 3D spatial data using (D)GPS/INS and image data can be applied to the spatial data integration and application such as contemporary digital map update, road facility management and Video GIS DB.

A Cluster-Based Top-k Query Processing Algorithm in Wireless Sensor Networks (무선 센서 네트워크에서 클러스터 기반의 Top-k 질의 처리)

  • Yeo, Myung-Ho;Seong, Dong-Ook;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.36 no.4
    • /
    • pp.306-313
    • /
    • 2009
  • Top-k queries are issued to find out the highest (or lowest) readings in many sensor applications. Many top-k query processing algorithms are proposed to reduce energy consumption; FILA installs a filter at each sensor node and suppress unnecessary sensor updates; PRIM allots priorities to sensor nodes and collects the minimal number of sensor reading according to the priorities. However, if many sensor reading converge into the same range of sensor values, it leads to a problem that many false positives are occurred. In this paper, we propose a cluster-based approach to reduce them effectively. Our proposed algorithm operates in two phases: top-k query processing in the cluster level and top-k query processing in the tree level. False positives are effectively filtered out in each level. Performance evaluations show that our proposed algorithm reduces about 70% false positives and achieves about 105% better performance than the existing top-k algorithms in terms of the network lifetime.

Study on a Waypoint Tracking Algorithm for Unmanned Surface Vehicle (USV) (무인수상선을 위한 경유점 추적 제어 알고리즘에 관한 연구)

  • Son, Nam-Sun;Yoon, Hyeon-Kyu
    • Journal of Navigation and Port Research
    • /
    • v.33 no.1
    • /
    • pp.35-41
    • /
    • 2009
  • A waypoint tracking algorithm(WTA) is designed for Unmanned Surface Vehicle(USV) in which water-jet system is installed for propulsion To control the heading of USV for waypoint tracking, the steering nozzle of water-jet need, to be controlled. Firstly, target heading is calculated by using the position information of waypoints input from the land control center. Secondly, the command for the steering nozzle of water-jet is calculated in real time by using the heading and the rate-of-turn( ROT) from magnetic compass, In this study, in order to consider the drift angle due to external disturbance such as wind and wave, the course of ground( COG) can be used instead of heading at higher speed than a certain value, To test the performance of newly-designed WTA, the tests were carried out in actual sea area near Gwang-an bridge of Busan. In this paper, the sea trial test results from WTA are analyzed and compared with those from manual control and those from commercial controller.

Container-Based Record Management in Flash Memory Environment (플래시 메모리 환경을 위한 컨테이너 기반 레코드 관리 방법)

  • Bae, Duck-Ho;Kim, Sang-Wook;Chang, Ji-Woong
    • Journal of KIISE:Databases
    • /
    • v.36 no.1
    • /
    • pp.1-7
    • /
    • 2009
  • Flash memory has its unique characteristics: i.e., (1) the write operation is much more costly than the read operation. (2) In-place updating is not allowed. In this paper, we first analyze how these characteristics affect the performance of record management in flash memory, and discuss the problems with previous methods for record management when they are applied to flash memory environment. Next, we propose a new record management method to be suitable for flash memory environment. The proposed method employs a new concept of a container that makes it possible to overwrite data on flash memory several times when performing insertions, deletions, and modifications of records. As a result, this method reduces the number of overwrite operations, and consequently does the number of erase operations. The results of experiments show that our method improves the performance by up to 34%, compared with the previous one.

A Consistency Control of Method for Spatial Data Cached in Mobile Clients (모바일 클라이언트에 캐쉬된 공간 데이터의 일관성 제어 기법)

  • 안경환;차지태;홍봉희
    • Journal of KIISE:Databases
    • /
    • v.31 no.3
    • /
    • pp.274-286
    • /
    • 2004
  • In mobile client-server environments, mobile clients usually are disconnected with their server because of high cost of wireless communication and keep their own local copies to provide efficient updating the cached map. The update of the server database leads to invalidation of the cached map in the client side. To solve the issues of invalidation of the cached map, it is not efficient to resend part of the updated server database to clients whenever the updating of the server database occurs. This paper proposes a log-based update propagation method to propagate the server's update into its relevant clients by using only update logs. Too many logs increasingly accumulate as the sever database is updated several times. The sequential search of the relevant log data for a specific client is time-consuming. Sending of unnecessary logs should be avoided for reducing the overhead of communication.'re solve these problems, we first define unnecessary logs and then suggest log reduction methods to avoid or cancel creating unnecessary logs. The update log index is used for quickly retrieving relevant logs.

Retrieval Model using Subject Classification Table, User Profile, and LSI (전공분류표, 사용자 프로파일, LSI를 이용한 검색 모델)

  • Woo Seon-Mi
    • The KIPS Transactions:PartD
    • /
    • v.12D no.5 s.101
    • /
    • pp.789-796
    • /
    • 2005
  • Because existing information retrieval systems, in particular library retrieval systems, use 'exact keyword matching' with user's query, they present user with massive results including irrelevant information. So, a user spends extra effort and time to get the relevant information from the results. Thus, this paper will propose SULRM a Retrieval Model using Subject Classification Table, User profile, and LSI(Latent Semantic Indexing), to provide more relevant results. SULRM uses document filtering technique for classified data and document ranking technique for non-classified data in the results of keyword-based retrieval. Filtering technique uses Subject Classification Table, and ranking technique uses user profile and LSI. And, we have performed experiments on the performance of filtering technique, user profile updating method, and document ranking technique using the results of information retrieval system of our university' digital library system. In case that many documents are retrieved proposed techniques are able to provide user with filtered data and ranked data according to user's subject and preference.

Selectivity Estimation Using Compressed Spatial Histogram (압축된 공간 히스토그램을 이용한 선택율 추정 기법)

  • Chi, Jeong-Hee;Lee, Jin-Yul;Kim, Sang-Ho;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.11D no.2
    • /
    • pp.281-292
    • /
    • 2004
  • Selectivity estimation for spatial query is very important process used in finding the most efficient execution plan. Many works have been performed to estimate accurate selectivity. Although they deal with some problems such as false-count, multi-count, they can not get such effects in little memory space. Therefore, we propose a new technique called MW Histogram which is able to compress summary data and get reasonable results and has a flexible structure to react dynamic update. Our method is based on two techniques : (a) MinSkew partitioning algorithm which deal with skewed spatial datasets efficiently (b) Wavelet transformation which compression effect is proven. The experimental results showed that the MW Histogram which the buckets and wavelet coefficients ratio is 0.3 is lower relative error than MinSkew Histogram about 5%-20% queries, demonstrates that MW histogram gets a good selectivity in little memory.