• Title/Summary/Keyword: 연속 질의 처리

Search Result 265, Processing Time 0.026 seconds

A Use of Expectation Maximization Clustering for Constructing a Markov Chain of Human Mobility Model (기대치 최대화 기반의 군집화를 통한 인간 이동 패턴의 마르코프 연쇄모델 도출)

  • Kim, Hyunuk;Song, Ha Yoon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.04a
    • /
    • pp.864-867
    • /
    • 2012
  • 사람들이 휴대용 위치정보 수집 장비나 혹은 스마트폰을 사용하면서 사람의 이동 정보인 위치정보들을 모으는 일이 가능해 졌다. 이러한 위치정보들을 가지고 본 논문에서는 사람의 이동 모델을 나타내고자 하였다. 이동 정보들은 머물러 있는(Stay)상태와 이동하는(Moving) 상태로 나눌 수 있는데 이러한 상태 중 머물러 있는 상태가 군집화가 되어 연쇄 모델속의 하나의 상태(State)로 나타나 질 수 있다. 물론 이동 정보들을 통해 연쇄모델 속 각 상태간의 전이 확률 또한 계산 할 수 있다. 이러한 일련의 과정을 본 논문에서는 기대치 최대화 기반 군집화 과정을 통해 연속시간 연쇄 모델의 형태로 인간의 이동성을 표현하였다. 또한 이러한 모델에서 대표 군집(macro)과 그 부속 군집(micro)을 표현할 수 있었고 이러한 모습은 대표적인 큰 군집 속의 작은 군집의 형태로 나타나게 된다.

Analysis of the Proteins Accumulated During Cold Treatment in Intermolecular Space of Barley (저온에서 세포밖 공간에 축적되는 보리 단백질)

  • 황철호
    • Korean Journal of Plant Tissue Culture
    • /
    • v.22 no.1
    • /
    • pp.15-28
    • /
    • 1995
  • In order to identify an antifreeze proteins responsible for freeze-tolerance in barley the proteins accumulated in extracellular space during cold acclimination were extracted and analyzed. After 42 days cold treatment there were several proteins sized of 70, 21, 16, 14 KDa increased in their amount accumulated in extracellular space. In addition, continuously sized polypeptides smaller than 10 KDa were found to be increased in their amount as cold treatment prolongs. Since these proteins were not detectable in total leaf protein extract it appears that the procedure used to isolate extracellular extract was valid. A similarity in profile of the extracellular proteins isolated from barley and rye may indicate a possibility for these proteins to be an antifreeze proteins since the same extract from rye was reported to show an antifreezing activity.

  • PDF

An Efficient Video Clip Matching Algorithm Using the Cauchy Function (커쉬함수를 이용한 효율적인 비디오 클립 정합 알고리즘)

  • Kim Sang-Hyul
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.5 no.4
    • /
    • pp.294-300
    • /
    • 2004
  • According to the development of digital media technologies various algorithms for video clip matching have been proposed to match the video sequences efficiently. A large number of video search methods have focused on frame-wise query, whereas a relatively few algorithms have been presented for video clip matching or video shot matching. In this paper, we propose an efficient algorithm to index the video sequences and to retrieve the sequences for video clip query. To improve the accuracy and performance of video sequence matching, we employ the Cauchy function as a similarity measure between histograms of consecutive frames, which yields a high performance compared with conventional measures. The key frames extracted from segmented video shots can be used not only for video shot clustering but also for video sequence matching or browsing, where the key frame is defined by the frame that is significantly different from the previous frames. Experimental results with color video sequences show that the proposed method yields the high matching performance and accuracy with a low computational load compared with conventional algorithms.

  • PDF

WT-Heuristics: An Efficient Filter Operator Ordering Technology in Stream Data Environments (WT-Heuristics: 스트림 데이터 환경에서의 효율적인 필터 연산자 순서화 기법)

  • Min, Jun-Ki
    • The KIPS Transactions:PartD
    • /
    • v.15D no.2
    • /
    • pp.163-170
    • /
    • 2008
  • Due to the proliferation of the Internet and intranet, a new application domain called stream data processing has emerged. Stream data is real-timely and continuously generated. In this paper, we focus on the processing of stream data whose characteristics vary unpredictably by over time. Particularly, we suggest a method which generates an efficient operator execution order called WT-Heuristics. WT-Heuristics efficiently determines the operator execution order since it considers only two adjacent operators in the operator execution order. Also, our method changes the execution order with respect to the change of data characteristics with minimum overheads.

Design and Implementation of a Hybrid Equipment Data Acquisition System(HEDAS) for Equipment Engineering System(EES) Framework (EES 프레임워크를 위한 하이브리드 생산설비 데이터 습득 시스템(HEDAS)의 설계 및 구현)

  • Kim, Gyoung-Bae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.2
    • /
    • pp.167-176
    • /
    • 2012
  • In this paper we design and implement a new Hybrid Equipment Data Acquisition System (HEDAS) for data collection of semiconductor and optoelectronic manufacturing equipments in the equipment engineering system(EES) framework. The amount of the data collected from equipments have increased rapidly in equipment engineering system. The proposed HEDAS efficiently handles a large amount of real-time equipment data generated from EES framework. It also can support the real-time ESS applications as well as non real-time ESS applications. For the real-time EES applications, it performs high-speed real-time processing that uses continuous query and filtering techniques based on memory buffers. The HEDAS can optionally store non real-time equipment data using a HEDAS-based database or a traditional DBMS-based database. In particular, The proposed HEDAS offers the compression indexing based on the timestamp of data and query processing technique saving the cost of disks storage against extremely increasing equipment data. The HEDAS is efficient system to collect huge real-time and non real-time equipment data and transmit the collected equipment data to several EES applications in EES framework.

A Method for Managing Positions of Moving Objects (이동 객체의 위치 처리 기법)

  • 김진덕;진교홍
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.05a
    • /
    • pp.460-464
    • /
    • 2003
  • The objects which continuously change their locations in the real world are called moving objects. The works on the existing spatial indices have been proposed the retrieval methods. However, keeping track of the terminal location of moving objects is more important than the efficiency of the query processing in the moving object database. Therefore, many pure spatial indices are not applicable to the moving objects database which should maintain the object's current location as precise as possible. This parer proposes a method for reducing the construction time of indexing moving objects. We analyze the characteristics of the method to re-index all the objects after each time period and the method to update immediately the locations on reporting their locations. We also newly propose a selective immediate update method using the properties of moving objects in order to minimize the number of database updates.

  • PDF

An Efficient Method of the Index Reorganization using Partial Index Transfer in Spatial Data Warehouses (공간 데이터 웨어하우스에서 부분 색인 전송을 이용한 효율적인 색인 재구성 기법)

  • Jeong, Young-Cheol;You, Byeong-Seob;Park, Soon-Young;Lee, Jae-Dong;Bae, Hae-Young
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.05a
    • /
    • pp.39-42
    • /
    • 2005
  • 공간 데이터 웨어하우스 구축기는 소스 데이터의 변경 사항을 일괄처리의 형태로 공간 데이터 웨어하우스에 적재한다. 또한, 공간 데이터 웨어하우스 서버는 사용자의 질의에 빠른 응답을 하기위해 적재된 데이터로 색인을 구축한다. 색인을 구성하는 기존 기법으로는 벌크 삽입 기법 및 색인 전송 기법이 있다. 벌크 삽입 기법은 색인을 구성하기 위한 클러스터링 비용이 필요하며 검색 성능도 떨어진다. 또한, 색인 전송 기법은 주기적인 소스 데이터의 변경을 지원하지 않는다는 문제점이 있다. 본 논문에서는 이와 같은 문제점을 해결하기 위해 공간 데이터 웨어하우스에서 부분 색인 전송을 이용한 효율적인 색인 재구성 기법을 제안한다. 제안 기법은 구축기에서 색인의 구조에 맞게 클러스터링된 클러스터들을 부분 색인으로 구성하여 페이지 단위로 전송한다. 공간 데이터 웨어하우스 서버에서는 전송된 부분 색인의 물리적 사상 문제를 해결하기 위해 물리적으로 연속된 공간을 예약하고 예약된 공간에 부분 색인을 기록한다. 기록된 부분 색인은 공간 데이터 웨어하우스 서버에 있던 기존 색인에 삽입된다. 부분 색인이 기존 색인에 직접 삽입됨으로써 색인 재구성을 위한 검색, 분할, 재조정 비용은 최소가 된다.

  • PDF

Dependency Relation Analysis using Case Frame for Encyclopedia Question-Answering System (백과사전 질의응답을 위한 격틀 기반 의존관계 분석)

  • Lim, Soo-Jong;Jung, Eui-Suk;Jang, Myoung-Gil
    • Annual Conference on Human and Language Technology
    • /
    • 2004.10d
    • /
    • pp.167-172
    • /
    • 2004
  • 백과사전에서 정답을 찾기 위한 정보 중의 하나로 구조분석 정보를 이용하기 위하여 의존 관계 분석을 통해 정확한 구조분석에 대한 연구를 하였다. 정답을 찾기 위한 대상이 되는 용언과 논항의 관계를 파악하기 위해 먼저 의존관계 분석의 모호성 정도를 줄이기 위해 문장을 구묶음으로 나누었고 나눠진 구묶음에서 중심어와 중심어에 해당하는 의미코드를 추출하였다. 이렇게 구분된 구묶음 간의 의존관계를 파악하기 위하여 주로 격틀과 의미코드에 의존하는 의미자질, 거리 자질, 격관계 자질, 절형태 자질을 이용하여 의존관계 모호성을 해소하였다. 백과사전의 특성상 생략되는 성분과 연속 동사 처리를 하여 보다 정확하게 백과사전 QA시스템에서 정답을 찾을 수 있는 정보를 제공하도록 하였다. 실험결과 동사구와 명사구의 의존관계는 89.43의 성능을 보였고 의존관계에 격을 부여한 경우는 78.40%의 정확율, 백과사전 후처리에 해당하는 복원은 68.23의 성능을 보인다.

  • PDF

The Proximity Scheme of the Perceptual Space for Indexing The Trajectories of Tags (태그 궤적 색인을 위한 인식공간 근접성 기법)

  • Kim, Dong-Hyun;Ahn, Swng-Woo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.10
    • /
    • pp.2140-2146
    • /
    • 2009
  • Since tags do not have location informations, the identifiers of tags which are symbolic data are used as the location informations. Therefore, it is difficult to define the proxmity between two trajectories of tags and inefficient to process the user queries for tags. In this paper, we define the perceptual space to model the location of a tag and propose the proximity of the perceptual spaces. The proximity of the perceptual spaces is composed of the static proximity and dynamic proximity. Using the proximity of the perceptual spaces, it is possible to measure the proximity between two trajectories of tags and build the efficient indexes for tag trajectories. We evaluated the performance of the proposed proximity function for tag trajectories on the IR-tree and the $R^*$-tree.

공유결합으로 고정화된 urokinase 칼럼의 스케일업과 solid-phase refolding에 의한 반복 사용

  • Seo, Chang-U;An, Sang-Jeom;Lee, Eun-Gyu
    • 한국생물공학회:학술대회논문집
    • /
    • 2001.11a
    • /
    • pp.85-88
    • /
    • 2001
  • We scaled up a covalent immobilization system of urokinase to the activated Sepharose and used it repeatedly to cleave a fusion protein consisting of human growth hormone and GST fragment. After scale up from 6 ml to 250 ml, the column system still demonstrated basically the same performance in terms of urokinase immobilization and fusion protein cleavage. When the column was washed with 6M guanidine HCl after the cleavage reaction. the immobilized urokinase showed no activity probably because it was fully unfolded. However. as the denaturant was gradually removed from the column the immobilized urokinase fully regained its bioactivity. which indicated it was properly refolded into its native conformation as covalently attached to the solid matrix. After 20 cycles of this 'solid-phase unfolding/refolding', the immobilized urokinase maintained approx. 80% of the initial bioactivity. This method provides an efficient protocol to apply the solid-phase refolding technique to improve the longevity of immobilized enzyme columns.

  • PDF