• Title/Summary/Keyword: Data Fragment

Search Result 259, Processing Time 0.024 seconds

Techniques of XML Fragment Stream Organization for Efficient XML Query Processing in Mobile Clients (이동 클라이언트에서 효율적인 XML 질의 처리를 위한 XML 조각 스트림 구성 기법)

  • Ryu, Jeong-Hoon;Kang, Hyun-Chul
    • The Journal of Society for e-Business Studies
    • /
    • v.14 no.4
    • /
    • pp.75-94
    • /
    • 2009
  • Since XML emerged as a standard for data exchange on the web, it has been established as a core component in e-Commerce and efficient query processing over XML data in ubiquitous computing environment has been also receiving much attention. Recently, the techniques were proposed whereby an XML document is fragmented into XML fragments to be streamed and the mobile clients receive the stream while processing queries over it. In processing queries over an XML fragment stream, the average access time significantly depends on the order of fragments in the stream. As such, for query performance, an efficient organization of XML fragment stream is required as well as the indexing for energy-efficient query processing due to the reduction of tuning time. In this paper, a technique of XML fragment stream organization based on query frequencies, fragment size, fragment access frequencies, and an active XML-based indexing scheme are proposed. Through implementation and performance experiments, our techniques were shown to be efficient compared with the conventional XML fragment stream organizations.

  • PDF

Determinant Whether the Data Fragment in Unallocated Space is Compressed or Not and Decompressing of Compressed Data Fragment (비할당 영역 데이터 파편의 압축 여부 판단과 압축 해제)

  • Park, Bo-Ra;Lee, Sang-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.4
    • /
    • pp.175-185
    • /
    • 2008
  • It is meaningful to investigate data in unallocated space because we can investigate the deleted data. However the data in unallocated space is formed to fragmented and it cannot be read by application in most cases. Especially in case of being compressed or encrypted, the data is more difficult to be read. If the fragmented data is encrypted and damaged, it is almost impossible to be read. If the fragmented data is compressed and damaged, it is very difficult to be read but we can read and interpret it sometimes. Therefore if the computer forensic investigator wants to investigate data in unallocated space, formal work of determining the data is encrypted of compressed and decompressing the damaged compressed data. In this paper, I suggest the method of analyzing data in unallocated space from a viewpoint of computer forensics.

A Study on Extracting the Document Text for Unallocated Areas of Data Fragments (비할당 영역 데이터 파편의 문서 텍스트 추출 방안에 관한 연구)

  • Yoo, Byeong-Yeong;Park, Jung-Heum;Bang, Je-Wan;Lee, Sang-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.6
    • /
    • pp.43-51
    • /
    • 2010
  • It is meaningful to investigate data in unallocated space because we can investigate the deleted data. Consecutively complete file recovery using the File Carving is possible in unallocated area, but noncontiguous or incomplete data recovery is impossible. Typically, the analysis of the data fragments are needed because they should contain large amounts of information. Microsoft Word, Excel, PowerPoint and PDF document file's text are stored using compression or specific document format. If the part of aforementioned document file was stored in unallocated data fragment, text extraction is possible using specific document format. In this paper, we suggest the method of extracting a particular document file text in unallocated data fragment.

Research on Scene Features of Mixed Reality Game Based on Spatial Perception-Focused on "The Fragment" Case Study

  • Li, Wei;Cho, Dong-Min
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.4
    • /
    • pp.601-609
    • /
    • 2021
  • This article combines literature and empirical research based on space perception theory and the case study of mixed reality game "The Fragment." It is concluded that the mixed reality scene under space perception has a three-level visual definition. This definition carries out a corresponding level analysis of the scenes of the "The Fragment" game and draws up the constituent factors of the mixed reality game scene characteristics. Finally, through questionnaire data investigation and analysis, it is verified that the three factors of virtual reality coexistence, human-computer interaction, and local serviceability can better explain the characteristics of mixed reality game scenes. At the end of the study, it is concluded that the definition of three levels of visual hierarchy and the constituent factors of mixed reality game scenes can provide reference and help for other mixed-reality game designs and a brief description of future research plans.

Design and Implementation of Transfer Buffer Sharing Technique for Efficient Massive Data Transfer

  • Cho, Dae-Soo
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.3
    • /
    • pp.327-330
    • /
    • 2008
  • It is required that a server which communicates with various client simultaneously should have an efficient data transfer model. In Windows$^{(R)}$ environment, the server was generally developed based on IOCP model. Developing the IOCP model, the server generally has one data transfer buffer per client. If the server divides a larger data than the transfer buffer into several fragments, there used to be a problem in sending it to a client, because there is a conflict in a data transfer buffer. That is, CPU requests one data-fragment transfer, then it will request the next data-fragment transfer successively before completing the previous request, owing to the property of overlapped IO model. In this paper, we proposed the transfer buffer sharing technique to solve the conflicting problem. The experimental result shows that the performance of data transfer was enhanced by 39% maximally.

A Design of Programmable Fragment Shader with Reduction of Memory Transfer Time (메모리 전송 효율을 개선한 programmable Fragment 쉐이더 설계)

  • Park, Tae-Ryoung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.12
    • /
    • pp.2675-2680
    • /
    • 2010
  • Computation steps for 3D graphic processing consist of two stages - fixed operation stage and programming required stage. Using this characteristic of 3D pipeline, a hybrid structure between graphics hardware designed by fixed structure and programmable hardware based on instructions, can handle graphic processing more efficiently. In this paper, fragment Shader is designed under this hybrid structure. It also supports OpenGL ES 2.0. Interior interface is optimized to reduce the delay of entire pipeline, which may be occurred by data I/O between the fixed hardware and the Shader. Interior register group of the Shader is designed by an interleaved structure to improve the register space and processing speed.

Effective Query Processing on Streamed XML Fragments (스트림된 XML 조각들의 효율적인 질의 처리)

  • Ko, Hye-Kyeong
    • Journal of Information Technology Services
    • /
    • v.12 no.2
    • /
    • pp.257-268
    • /
    • 2013
  • Query processing on streamed XML fragments is one of key issues in XML databases. In this paper, XFSeed (XML Fragment Processor with Seed label) is proposed to provide effective query processing by removing many redundant path evaluations and minimizing the number of fragments processed. The conducted experimental results reveal that the proposed scheme efficiently handles query processing and reduces memory usage.

Molecular Cloning and Sequencing of Cell Wall Hydrolase Gene of an Alkalophilic Bacillus subtilis BL-29

  • Kim, Tae-Ho;Hong, Soon-Duck
    • Journal of Microbiology and Biotechnology
    • /
    • v.7 no.4
    • /
    • pp.223-228
    • /
    • 1997
  • A DNA fragment containing the gene for cell wall hydrolase of alkalophilic Bacillus subtilis BL-29 was cloned into E. coli JM109 using pUC18 as a vector. A recombinant plasmid, designated pCWL45B, was contained in the fragment originating from the alkalophilic B. subtilis BL-29 chromosomal DNA by Southern hybridization analysis. The nucleotide sequence of a 1.6-kb HindIII fragment containing a cell wall hydrolase-encoding gene was determined. The nucleotide sequence revealed an open reading frame (ORF) of 900 bp with a concensus ribosome-binding site located 6 nucleotide upstream from the ATG start codon. The primary amino acid sequence deduced from the nucleotide sequence revealed a putative protein of 299 amino acid residues with an M.W. of 33, 206. Based on comparison of the amino acid sequence of the ORF with amino acid sequences in the GenBank data, it showed significant homology to the sequence of cell wall amidase of the PBSX bacteriophage of B. subtilis.

  • PDF

Performance Evaluation of Distributed MAC Protocol Algorithm for Efficient Multimedia Transmission (효율적인 멀티미디어 전송을 위한 분산방식 MAC 프로토콜 성능분석)

  • Kim, Jin Woo;Lee, Seong Ro
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.5
    • /
    • pp.573-581
    • /
    • 2014
  • The salient features of UWB(Ultra WideBand) networks such as high-rate communications, low interference with other radio systems, and low power consumption bring many benefits to users, thus enabling several new applications such as wireless universal serial bus (WUSB) for connecting personal computers (PCs) to their peripherals and the consumer-electronics (CE) in people's living rooms. Because the size of multimedia data frame, WiMedia device must transmit the fragment of MSDU. However, when the fragment of MSDU is lost, WiMedia device maintains active mode for the time to complete the transmission MSDU, and there is a problem that unnecessary power consumption occurs. Therefore we propose new power management scheme to reduce unnecessary power consumption of WiMedia devices in the case that the fragment is lost.

Genetic DNA Marker for A2 mating type in Phytophthora infestans

  • Kim, Kwon-Jong;Lee, Youn-Su
    • Journal of Microbiology
    • /
    • v.40 no.4
    • /
    • pp.254-259
    • /
    • 2002
  • The Phytophthora infestans requires two mating types for sexual reproduction. Amplified fragment length polymorphism (AFLP) was used to specifically detect different mating types of P. infestans. The AFLP primers E+AA (5'-GACTGCGTACCAATTCAA-3') and M+CAA (5'-GATGAGTCCTGAG-TAAC AA-3') detected a fragment that is specific in the A2 mating type of P. infestans. This fragment was cloned and sequenced. Based on the sequence data, PHYB-1 and PHYB-2 primer were designed to detect the A2 mating type of P. infestans. A single 347 bp segment was observed in the A2 mating type of P. infestans, but not in the A1 mating type of P. infestans or other Phytophthora spp. Identification of mating type was performed with phenotype (sexual reproduction) and genotype (CAPs marker) methods. Two factors, the annealing temperature and template DNA quantity, were investigated to determine the optimal conditions. Using mating type-specific primers, a unique band was obtained within annealing temperatures of 57$^{\circ}C$-62$^{\circ}C$ and DNA levels of 10pg-100 ng (data not shown).