• Title/Summary/Keyword: 삽입 검색

Search Result 206, Processing Time 0.02 seconds

Trajectory Indexing for Efficient Processing of Range Queries (영역 질의의 효과적인 처리를 위한 궤적 인덱싱)

  • Cha, Chang-Il;Kim, Sang-Wook;Won, Jung-Im
    • The KIPS Transactions:PartD
    • /
    • v.16D no.4
    • /
    • pp.487-496
    • /
    • 2009
  • This paper addresses an indexing scheme capable of efficiently processing range queries in a large-scale trajectory database. After discussing the drawbacks of previous indexing schemes, we propose a new scheme that divides the temporal dimension into multiple time intervals and then, by this interval, builds an index for the line segments. Additionally, a supplementary index is built for the line segments within each time interval. This scheme can make a dramatic improvement in the performance of insert and search operations using a main memory index, particularly for the time interval consisting of the segments taken by those objects which are currently moving or have just completed their movements, as contrast to the previous schemes that store the index totally on the disk. Each time interval index is built as follows: First, the extent of the spatial dimension is divided onto multiple spatial cells to which the line segments are assigned evenly. We use a 2D-tree to maintain information on those cells. Then, for each cell, an additional 3D $R^*$-tree is created on the spatio-temporal space (x, y, t). Such a multi-level indexing strategy can cure the shortcomings of the legacy schemes. Performance results obtained from intensive experiments show that our scheme enhances the performance of retrieve operations by 3$\sim$10 times, with much less storage space.

Applet Control using Java Bytecode Modification on the Internet Communication (인터넷 통신상에서 자바 바이트 코드 수정을 이용한 애플릿 제어)

  • 김광준;나상동;배용근
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.1
    • /
    • pp.90-99
    • /
    • 2003
  • Java applets are downloaded from web server through internet and executed in Java Virtual Machine of clients' browser. Before execution of java applets, JVM checks bytecode program with bytecode verifier and performs runtime tests with interpreter. However, these tests will not protect against undesirable runtime behavior of java applets, such as denial of service attack, email forging attack, URL spoofing attack, and annoying sound attack. In order to protect malicious applets, a technique used in this paper is java bytecode modification. This technique is used to restrict applet behavior or insert code appropriate to profiling or other monitoring efforts. Java byte modification is divided into two general forms, class-level modification involving subclassing non-final classes and method-level modification used when control over objects from final classes or interface. This paper showed that malicious applets are controlled by java bytecode modification using proxy server. This implementation does not require any changes in the web sever, JVM or web browser.

Efficient Browsing Method based on Metadata of Video Contents (동영상 컨텐츠의 메타데이타에 기반한 효율적인 브라우징 기법)

  • Chun, Soo-Duck;Shin, Jung-Hoon;Lee, Sang-Jun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.5
    • /
    • pp.513-518
    • /
    • 2010
  • The advancement of information technology along with the proliferation of communication and multimedia has increased the demand of digital contents. Video data of digital contents such as VOD, NOD, Digital Library, IPTV, and UCC are getting more permeated in various application fields. Video data have sequential characteristic besides providing the spatial and temporal information in its 3D format, making searching or browsing ineffective due to long turnaround time. In this paper, we suggest ATVC(Authoring Tool for Video Contents) for solving this issue. ATVC is a video editing tool that detects key frames using visual rhythm and insert metadata such as keywords into key frames via XML tagging. Visual rhythm is applied to map 3D spatial and temporal information to 2D information. Its processing speed is fast because it can get pixel information without IDCT, and it can classify edit-effects such as cut, wipe, and dissolve. Since XML data save key frame information via XML tag and keyword information, it can furnish efficient browsing.

Design and Development of Hybrid Documents Authoring Tool (하이브리드 문서 저작도구의 설계 및 개발)

  • Hong Kwang-Jin;Jung Kee-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.4
    • /
    • pp.377-387
    • /
    • 2006
  • Digital documents takes place of paper (off-line) documents, because of the advantages of digital (on-line) documents: supply of information using dynamic contents and good to communize. However, users prefer paper documents to digital documents with the advantages of paper documents: inexpensive, handy to carry, and good to read. Therefore, for providing advantages of digital documents to users who prefer paper documents, many laboratories study about methods which augment digital documents to paper documents. In this paper, we propose the Hybrid Documents Authoring Tool (HDAT), which can insert, delete, and modify on-line information to the off-line. The proposed system is a unified authoring tool for reading and writing of on-line information. And we provide the most natural environment to users using computer vision technology without additional devices such as markers or patterns to retrieve documents. As shown by experimental results, we make sure that our proposed system has high usability and good efficiency on various environments through we measure the low-level of system requirement.

  • PDF

Digital Watermarking of Medical Image Based on Public Key Encryption Algorithm Considering ROI (ROI를 고려한 공개키 암호화 알고리즘 기반 의료영상 디지털 워터마킹)

  • Lee Hyung-Kyo;Kim Hee-Jung;Seong Tack-Young;Kwon Ki-Ryong;Lee Jong-Keuk
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.11
    • /
    • pp.1462-1471
    • /
    • 2005
  • Recently, the medical image has been digitized by the development of computer science and digitization of the medical devices. There are needs for database service of the medical image and long term storage because of the construction of PACS(picture archiving and communication system) following DICOM(digital imaging communications in medicine) standards, telemedicine, and et al. However, it also caused some kinds of problems, such as illegal reproduction of medical image, proprietary rights and data authentication. In this paper, we propose the new digital watermarking technique for medical image based on public key encryption algorithm for integrity verification. It prevents illegal forgery that can be caused after transmitting medical image data remotely. The watermark is the value of bit-plane in wavelet transform of the original image for certification method of integrity verification. We proposed the embedding regions are randomly chosen considering ROI, and a digital signature is made using hash function of MD5 which input is a secret key. The experimental results show that the watermark embedded by the proposed algorithm can survive successfully in image processing operations and that the watermark's invisibility is good.

  • PDF

Extraction and Comprehension of Objects for Class Components Reuse (클래스 부품의 재사용을 위한 객체의 추출과 이해)

  • Han, Jeong-Su;Song, Yeong-Jae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.941-951
    • /
    • 1999
  • Class components in a repository require exact information representation by reason of insufficiency of various visual information through search and extraction. In this paper, we have described syntax-analysis method and viewer facilities about class components. In the components analysis, we extracted class information which consists of class_names, methods, attributes, class inheritance relationship, and graphic information. viewer represents extracted class information and creates a new class. Also, it provides facilities of reuse, insertion, and deletion. Not only Viewer represents class hierarchy diagram, and shows detail information about each class, but also it creates new classes. In this paper, we implemented a Viewer using the components, inheritance, diagram information and process. And we enhanced understanding of programs through viewer, and supported prototype for class creation.

  • PDF

Characterization of growth hormone-like sequence of loach, Misgurnus mizolepis (미꾸라지 성장 호르몬 염기 서열의 특성에 대하여)

  • Kim, Jin-Kyung;Song, Young-Hwan
    • Journal of fish pathology
    • /
    • v.7 no.2
    • /
    • pp.95-103
    • /
    • 1994
  • We have prepared cDNA libray of loach. M. mizolepis in order to isolate cDNA clone of growth hormone gene. Total RNA was isolated from pituitary of loach, and then mRNA was further purified from total RNA by oligo (dT)-coupled magnetic beads. The purified mRNA was used as substrates to prepare cDNA. The resulting cDNA was ligated into the EcoRV/Smal site of pBlueKS+. The ligation mixture have transformed E. coli JM109 strain with electroporator to obtain high yield of transformation efficiency. All the transformants was screened with DIG-labeled Tilapia growth hormone gene by high density colony hybridization. After isolating 10 putative colonies showing the positive signals, secondary colony hybridization and southern hybridization could confirm it as true clones. The nucleotide sequence of one candidate, pCGHI, was compared with 312 bp DNA fragment used as DNA probe and show 52% relative homology to Tilapia growth hormone gene.

  • PDF

Performance Enhancement Architecture including Location Information Secrecy for HLR System (위치 정보의 보안성이 고려된 가입자 위치등록기 시스템의 새로운 구조)

  • 김자환
    • Proceedings of the Korea Information Assurance Society Conference
    • /
    • 2004.05a
    • /
    • pp.103-108
    • /
    • 2004
  • A Home Location Register(HLR) database system manages each subscriber's location information, which continuously changes in a cellular network. For this purpose, the HLR database system provides table management, index management, and backup management facilities. In this thesis, I propose using a two-level index method for the mobile directory number(MDN) as a suitable method and a chained bucket hashing method for the electronic serial number(ESN). Both the MDN and the ESN are used as keys in the HLR database system. I also propose an efficient backup method that takes into account the characteristics of HLR database transactions. The retrieval speed and the memory usage of the two-level index method are better than those of the T-tree index method. The insertion and deletion overhead of the chained bucket hashing method is less than that of the modified linear hashing method. In the proposed backup method, I use two kinds of dirty flags in order to solvethe performance degradation problem caused by frequent registration-location operations. I also propose using additional attributes in the HLR database scheme for location information secrecy as a suitable security method.

  • PDF

Design of the Node Decision Scheme for Processing Queries on Sensor Network Environments (센서 네트워크 환경에서 질의 처리를 위한 노드 선정 기법의 설계)

  • Kim, Dong Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.10
    • /
    • pp.2224-2229
    • /
    • 2012
  • Since sensor data are inserted into a data set continuously, continuous queries should be evaluated for searching data. To processing the continuous queries, it is required to build a query index on each sensor node and to transmit result data appropriate for query predicates. However, if query predicates are transferred to all sensor nodes, massive messages are required. In this paper, we propose the node decision scheme using the sensor node decision tree in order to diminish messages. The entry of a leaf node in the node decision tree represents a sensor node and defines the data region of the sensor node. When a user query is issued, sensor nodes are decided by intersecting between data regions of the tree with the query predicates of the user query, and then the query predicates are transmitted to the selected sensor nodes. We also implement the proposed sensor node decision tree and evaluate the experiments for the tree.

Development of a Spatio-Temporal Query Processing System for Mobile Devices (모바일 장치용 시공간 질의 처리 시스템의 개발)

  • Shin, In-Su;Yang, Hyeong-Sik;Kim, Joung-Joon;Han, Ki-Joon
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.20 no.2
    • /
    • pp.81-91
    • /
    • 2012
  • As the recent development of the ubiquitous computing environment, u-GIS is being highlighted as the core technology of the ubiquitous computing environment, and thereby, studies on spatio-temporal data are being actively conducted. In this u-GIS environment, it is still difficult for existing mobile devices to efficiently manage the massive spatio-temporal data of u-GIS that are increasing day by day. Therefore, this paper develops a spatio-temporal query processing system for mobile devices in order to solve the problem. The system provides various spatio-temporal operators to insert/delete/update/search spatio-temporal data and supports a query optimization function that uses a spatio-temporal index for the flash memory and a spatio-temporal histogram for guaranteeing query execution speed. Lastly, by applying the spatio-temporal query processing system developed in this paper to the virtual scenario, this paper has proved that the system can be utilized in various application fields necessary to process spatio-temporal data in the mobile environment.