• Title/Summary/Keyword: File-referring

Search Result 13, Processing Time 0.027 seconds

Implementation of File-referring Octree for Huge 3D Point Clouds (대용량 3차원 포인트 클라우드를 위한 파일참조 옥트리의 구현)

  • Han, Soohee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.2
    • /
    • pp.109-115
    • /
    • 2014
  • The aim of the study is to present a method to build an octree and to query from it for huge 3D point clouds of which volumes correspond or surpass the main memory, based on the memory-efficient octree developed by Han(2013). To the end, the method directly refers to 3D point cloud stored in a file on a hard disk drive instead of referring to that duplicated in the main memory. In addition, the method can save time to rebuild octree by storing and restoring it from a file. The memory-referring method and the present file-referring one are analyzed using a dataset composed of 18 million points surveyed in a tunnel. In results, the memory-referring method enormously exceeded the speed of the file-referring one when generating octree and querying points. Meanwhile, it is remarkable that a still bigger dataset composed of over 300 million points could be queried by the file-referring method, which would not be possible by the memory-referring one, though an optimal octree destination level could not be reached. Furthermore, the octree rebuilding method proved itself to be very efficient by diminishing the restoration time to about 3% of the generation time.

Improving Performance of File-referring Octree Based on Point Reallocation of Point Cloud File (포인트 클라우드 파일의 측점 재배치를 통한 파일 참조 옥트리의 성능 향상)

  • Han, Soohee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.33 no.5
    • /
    • pp.437-442
    • /
    • 2015
  • Recently, the size of point cloud is increasing rapidly with the high advancement of 3D terrestrial laser scanners. The study aimed for improving a file-referring octree, introduced in the preceding study, which had been intended to generate an octree and to query points from a large point cloud, gathered by 3D terrestrial laser scanners. To the end, every leaf node of the octree was designed to store only one file-pointer of its first point. Also, the point cloud file was re-constructed to store points sequentially, which belongs to a same leaf node. An octree was generated from a point cloud, composed of about 300 million points, while time was measured during querying proximate points within a given distance with series of points. Consequently, the present method performed better than the preceding one from every aspect of generating, storing and restoring octree, so as querying points and memorizing usage. In fact, the query speed increased by 2 times, and the memory efficiency by 4 times. Therefore, this method has explicitly improved from the preceding one. It also can be concluded in that an octree can be generated, as points can be queried from a huge point cloud, of which larger than the main memory.

Design and Implementation of the Java Card API for Efficient File Management (효율적 파일 관리를 위한 자바카드 API 설계 및 구현)

  • Song Young-Sang;Shin In-Chul
    • The KIPS Transactions:PartC
    • /
    • v.13C no.3 s.106
    • /
    • pp.275-282
    • /
    • 2006
  • There are several independent applets to support various applications in a Java Card. Each applet in a Java Card processes and manages its own data without concern to other applets and their data. In this paper we proposed file system API to support efficient file management based on Java Card. Also we designed and implemented Java Card based file system API using basic API and referring to the file system standard defined in ISO 7816-4 Smart Card standard. By using proposed file system API, we can replace duplications of same code in each applet with short method call. So the used memory space and processing time is reduced and also the reduction of development time and cost will be expected.

Block based Smart Carving System for Forgery Analysis and Fragmented File Identification

  • Lee, Hanseong;Lee, Hyung-Woo
    • Journal of Internet Computing and Services
    • /
    • v.21 no.3
    • /
    • pp.93-102
    • /
    • 2020
  • In order for data obtained through all stages of digital crime investigation to be recognized as evidence capability, it must satisfy legal / technical requirements. In this paper, we propose a mechanism and implement software to provide digital forensic evidence by automatically recovering files by scanning / inspecting the unallocated area inside the storage disk block without relying on information provided by the file system. The proposed technique checks / analyzes the RAW disk data of the system under analysis in 512-byte block units based on information on the storage format / file structure of various files stored on the disk without referring to the file system-related information provided by the operating system. The file carving process was implemented, and a smart carving mechanism was proposed to intelligently restore deleted or damaged files in the storage device. As a result, we have provided a block based smart carving method to intelligently identify fragmented and damaged files in storage efficiently for forgery analysis on digital forensic investigation.

Incentive Mechanism Based on the Behavior of Peer for Service Differentiation in File Sharing System (파일 공유 시스템에서 서비스 차별화를 위한 피어 행동 기반의 인센티브 메커니즘)

  • Shin, Jung-Hwa;Kim, Tae-Hoon;Tak, Sung-Woo
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.5
    • /
    • pp.717-727
    • /
    • 2009
  • P2P (Peer-to-Peer) network depends on cooperation of peers considerably. However, some peers do not share files at all and only download files. Peers also share low quality files or unpopular files. These selfish behavior of peers is referred to 'free riding'. The free riding of peer may decrease participation of other peers or the system performance. In this paper, we propose an incentive mechanism, called IcMFS (Incentive Mechanism for File Sharing System), which provides the correct use of incentive mechanism using trust peer, computes contribution values referring behavior of peers and rewards peers. The proposed mechanism assigns bandwidth and TTL(Time-To-Live) to a peer and differentiates the use of service. A case study on simulations shows the service differentiation according to the contribution value of peer, the correct use of incentive mechanism using trust peer and the advantage by use of trust peer. To prove the stability of proposed mechanism, we also show the disadvantage that a peer receives from the incorrect use of incentive mechanism.

  • PDF

CAD system development for design of limit gauges (限界 게이지의 自動 設計에 관한 硏究)

  • Lee, Dong-Ju;Lee, Kwang-Gil
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.13 no.1
    • /
    • pp.38-44
    • /
    • 1996
  • The CAD system for design and drawing of limit gauges was constructed and developed. This system was made by Visual Basic program. Using this system, drawings together with concerned data for the manufacturing of limit gauges are generated on the screen, file and printer. The data base was constructed by referring handbooks, textbooks, relevant standards and regulations. This system was proved a powerful tool for design and drawing of limit gauges by actual applications. The output drawings from this system are in good agreement with the drawings and data of the concerned standards and regulations.

  • PDF

Enhancing Query Efficiency for Huge 3D Point Clouds Based on Isometric Spatial Partitioning and Independent Octree Generation (등축형 공간 분할과 독립적 옥트리 생성을 통한 대용량 3차원 포인트 클라우드의 탐색 효율 향상)

  • Han, Soohee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.5
    • /
    • pp.481-486
    • /
    • 2014
  • This study aims at enhancing the performance of file-referring octree, suggested by Han(2014), for efficiently querying huge 3D point clouds, acquired by the 3D terrestrial laser scanning. Han's method(2014) has revealed a problem of heavy declining in query speed, when if it was applied on a very long tunnel, which is the lengthy and narrow shaped anisometric structure. Hereupon, the shape of octree has been analyzed of its influence on the query efficiency with the testing method of generating an independent octree in each isometric subdivision of 3D object boundary. This method tested query speed and main memory usage against the conventional single octree method by capturing about 300 million points in a very long tunnel. Finally, the testing method resulted in which twice faster query speed is taking similar size of memory. It is also approved that the conclusive factor influencing the query speed is the destination level, but the query speed can still increase with more proximity to isometric bounding shape of octree. While an excessive unbalance of octree shape along each axis can heavily degrade the query speed, the improvement of octree shape can be more effectively enhancing the query speed than increasement of destination level.

Neutral Data Generation Algorithm for EPC-based Manufacturing Process Collaboration (EPC 기반의 제조 공정 협업을 위한 중립 데이터 생성 알고리즘)

  • Kim, Dong-Gi;Kim, Seung-Hee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.1
    • /
    • pp.1-9
    • /
    • 2020
  • In highly complex EPC(engineering, procurement, construction)-based manufacturing processes such as shipbuilding and marine plants, it is essential to prepare a way to enable organic working at the site referring to each other's detailed working data for collaboration between partner companies. However, companies cannot share the progress of the sites including working information in real-time due to the use of SW unique to each company and the complex site management system. As a result, the construction process is delayed, and resources are used inefficiently. This study developed a neutral data generation algorithm that can apply the working information in various file formats to a collaborative manufacturing process. In addition, this study verified the accuracy of the algorithm by applying the developed algorithm to the manufacturing process of piping in shipbuilding and marine plants, developing the SW for visualization of working information using the generated neutral data, and comparing the coordinate, shape & dimension and the kind, number, and spec. of BOM. The result confirmed that the accuracy of the coordinate of the neutral data was 99%, and that of the shape & dimension of the neutral data and BOM Spec. was both 100%. It is thought that this study can be used for overcoming the restrictions in information sharing due to the development of informatization at companies and maximizing the share of working file information in a complex manufacturing process.

Design and Implementation of an HTML Converter Supporting Frame for the Wireless Internet (무선 인터넷을 위한 프레임 지원 HTML 변환기의 설계 및 구현)

  • Han, Jin-Seop;Park, Byung-Joon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.6
    • /
    • pp.1-10
    • /
    • 2005
  • This paper describes the implementation of HTML converter for wireless internet access in wireless application protocol environment. The implemented HTML converter consists of the contents conversion module, the conversion rule set, the WML file generation module, and the frame contents reformatting module. Plain text contents are converted to WML contents through one by one mapping, referring to the converting rule set in the contents converting module. For frame contents, the first frameset sources are parsed and the request messages are reconstructed with all the file names, reconnecting to web server as much as the number of files to receive each documents and append to the first document. Finally, after the process of reformatting in the frame contents reformatting module, frame contents are converted to WML's table contents. For image map contents, the image map related tags are parsed and the names of html documents which are linked to any sites are extracted to be replaced with WML contents data and linked to those contents. The proposed conversion method for frame contents provides a better interface for the users convenience and interactions compared to the existing converters. Conversion of image maps in our converter is one of the features not currently supported by other converters.

A Plagiarism Detection Technique for Java Program Using Bytecode Analysis (바이트코드 분석을 이용한 자바 프로그램 표절검사기법)

  • Ji, Jeong-Hoon;Woo, Gyun;Cho, Hwan-Gue
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.7
    • /
    • pp.442-451
    • /
    • 2008
  • Most plagiarism detection systems evaluate the similarity of source codes and detect plagiarized program pairs. If we use the source codes in plagiarism detection, the source code security can be a significant problem. Plagiarism detection based on target code can be used for protecting the security of source codes. In this paper, we propose a new plagiarism detection technique for Java programs using bytecodes without referring their source codes. The plagiarism detection procedure using bytecode consists of two major steps. First, we generate the token sequences from the Java class file by analyzing the code area of methods. Then, we evaluate the similarity between token sequences using the adaptive local alignment. According to the experimental results, we can find the distributions of similarities of the source codes and that of bytecodes are very similar. Also, the correlation between the similarities of source code pairs and those of bytecode pairs is high enough for typical test data. The plagiarism detection system using bytecode can be used as a preliminary verifying tool before detecting the plagiarism by source code comparison.