• Title/Summary/Keyword: copy-move

Search Result 28, Processing Time 0.023 seconds

Cache-Filter: A Cache Permission Policy for Information-Centric Networking

  • Feng, Bohao;Zhou, Huachun;Zhang, Mingchuan;Zhang, Hongke
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.4912-4933
    • /
    • 2015
  • Information Centric Networking (ICN) has recently attracted great attention. It names the content decoupling from the location and introduces network caching, making the content to be cached anywhere within the network. The benefits of such design are obvious, however, many challenges still need to be solved. Among them, the local caching policy is widely discussed and it can be further divided into two parts, namely the cache permission policy and the cache replacement policy. The former is used to decide whether an incoming content should be cached while the latter is used to evict a cached content if required. The Internet is a user-oriented network and popular contents always have much more requests than unpopular ones. Caching such popular contents closer to the user's location can improve the network performance, and consequently, the local caching policy is required to identify popular contents. However, considering the line speed requirement of ICN routers, the local caching policy whose complexity is larger than O(1) cannot be applied. In terms of the replacement policy, Least Recently Used (LRU) is selected as the default one for ICN because of its low complexity, although its ability to identify the popular content is poor. Hence, the identification of popular contents should be completed by the cache permission policy. In this paper, a cache permission policy called Cache-Filter, whose complexity is O(1), is proposed, aiming to store popular contents closer to users. Cache-Filter takes the content popularity into account and achieves the goal through the collaboration of on-path nodes. Extensive simulations are conducted to evaluate the performance of Cache-Filter. Leave Copy Down (LCD), Move Copy Down (MCD), Betw, ProbCache, ProbCache+, Prob(p) and Probabilistic Caching with Secondary List (PCSL) are also implemented for comparison. The results show that Cache-Filter performs well. For example, in terms of the distance to access to contents, compared with Leave Copy Everywhere (LCE) used by Named Data Networking (NDN) as the permission policy, Cache-Filter saves over 17% number of hops.

An Algorithm Generating Edit Scripts for XML Documents (XML 문서에 대한 편집스크립트 생성 알고리즘)

  • Lee, Suk-Kyoon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.1
    • /
    • pp.80-89
    • /
    • 2011
  • While detecting changes in XML documents has emerged as a major research area, the level of research on edit scripts, which are the result of the change detection, is not far from satisfactory. In this paper, we present X-treeESgen, the algorithm generating edit scripts used in X-treeDiff+, a change detection algorithm for XML documents. X-treeESgen shows the time complexity of O(n), and support move and copy operations in addition to the basic set that is update, insert, and delete operations. Note that no other change detection algorithm provide all the operations. Also, since the process of generating edit scripts in X-treeESgen is designed independent of the process of matching, various tuning techniques may be applied.

Change Detection of Structured Documents using Path-Matching Algorithm (경로 매칭 알고리즘을 이용한 구조화된 문서의 변화 탐지)

  • Lee, Kyong-Ho;Byun, Chang-Won;Choy, Yoon-Chul;Koh, Kyun
    • Journal of KIISE:Databases
    • /
    • v.28 no.4
    • /
    • pp.606-619
    • /
    • 2001
  • This paper presents an efficient algorithm to compute difference between old and new versions of an SGML/XML document. The difference between the two versions can be considered to be an edit script that transforms some document tree into another The proposed algorithm is based on hybridization of bottom-up and top-down methods: matching relationships between nodes in the two versions are producted in a bottom-up manner and top-down breadth -first search computes an edit script. Because the algorithm does not need to investigate possible existence of matchings for all nodes, faster matching can be achieved . Furthermore, it can detect more structurally meaningful changes such as subtree move and copy as well as simple changes to the node itself like insert, delete, and update.

  • PDF

A USB DLP Scheme for Preventing Loss of Internal Confidential Files (내부 기밀파일 유출 방지를 위한 USB DLP 기법)

  • Shin, Gyu Jin;Jung, Gu Hyun;Yang, Dong Min;Lee, Bong Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.12
    • /
    • pp.2333-2340
    • /
    • 2017
  • Recently industry is suffering severe losses of important internal information, and most of the leaks result from the insiders. Thus, various technological counter measures are being studied in order to protect private organization information. In this paper, among various internal information leakage path protection mechanisms, we propose a technique for preventing files which are defined as confidential from being copied or moved through USB. The implemented confidential file loss prevention system is composed of both signature insert manager and confidential file detect manager. The signature insert manager allows a system administrator to insert a special pattern specifying a classified confidential file, while the confidential file detect manager protects confidential file leakage when a user attempts to move or copy a confidential file to the USB memory. This results would be contributed to reducing the damage caused by leakage of confidential files outside of the company via USB.

A Modeling of Forensics for Mobile IP Spoofing Prevention (모바일 IP 스푸핑 방지를 위한 포렌식 설계)

  • Park, Sun-Hee;Yang, Dong-Il;Jin, Kwang-Youn;Choi, Hyung-Jin
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.2
    • /
    • pp.307-317
    • /
    • 2012
  • Rapid development of the IT technology and mobile communications has increasingly improved many kinds of digital devices arise, as well as the mobile technology. However, the attacks (virus, hacking and Ip spoofing etc) have also increasingly grown dogged on any region including the society security. As the visual data is prone to copy, delete and move etc, it is necessary that attesting to the integrity of forensics evidence is crucial, as well as data transmission security. This paper presents a framework model using digital forensics method and the results of its performance evaluation for mobile security. The results show that the integrity of the visual data can be obtain with high security and make a proposal refer to prevention of Mobile IP Spoofing attack using our hashing data.

Adjusting Edit Scripts on Tree-structured Documents (트리구조의 문서에 대한 편집스크립트 조정)

  • Lee, SukKyoon;Um, HyunMin
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.24 no.2
    • /
    • pp.1-14
    • /
    • 2019
  • Since most documents used in web, XML, office applications are tree-structured, diff, merge, and version control for tree-structured documents in multi-user environments are crucial tasks. However research on edit scripts which is a basis for them is in primitive stage. In this paper, we present a document model for understanding the change of tree-structured documents as edit scripts are executed, and propose a method of switching adjacent edit operations on tree-structured documents based on the analysis of the effects of edit operations. Mostly, edit scripts which are produced as the results of diff on tree-structured documents only consist of basic operations such as update, insert, delete. However, when move and copy are included in edit scripts, because of the characteristics of their complex operation, it is often that edit scripts are generated to execute in two passes. In this paper, using the proposed method of switching edit operations, we present an algorithm of transforming the edit scripts of X-treeESgen, which are designed to execute in two passes, into the ones that can be executed in one pass.

Comparison of Pattern Design Functions in YUKA and CLO for CAD Education: Focusing on Skirt Patterns (캐드 교육을 위한 YUKA와 CLO의 패턴 제도 기능 비교: 스커트패턴을 중심으로)

  • Younglim Choi
    • Fashion & Textile Research Journal
    • /
    • v.26 no.1
    • /
    • pp.65-77
    • /
    • 2024
  • This study aimed to propose effective ways to integrate CLO into educational settings by conducting a comparative analysis of pattern functions in YUKA and CLO, specifically focusing on skirt prototypes and variations. CLO, being a 3D virtual sample CAD tool, is mainly used in education to facilitate the creation of 3D virtual clothing. In order to explore the applicability of CLO's pattern functions in pattern education, CAD education experts were asked to produce two types of skirt prototypes and two skirt variations. Subsequently, in-depth interviews were conducted. In addition, the skirt pattern creation process was recorded on video and used for comparative analysis of YUKA and CLO pattern functions. The comparison revealed that CLO provides the pattern tools necessary for drafting skirt prototypes. The learning curve for acquiring the skills necessary for drafting and transforming skirt prototypes was found to be relatively shorter for CLO compared to YUKA. In addition, due to CLO's surface-based pattern drawing method, it is difficult to move or copy only specific parts of the outline, and there are some limitations in drawing right angle lines. In the pattern transformation process, CLO's preview function proved to be advantageous, and it was highly rated on user convenience due to the intuitive UI. Thus, CLO shows promise for pattern drafting education and is deemed to have high scalability as it is directly linked to 3D virtual clothing.

A Study on the Gaze Flow of Internet Portal Sites Utilizing Eye Tracking (아이트래킹을 활용한 인터넷 포털사이트의 시선 흐름에 관한 연구)

  • Hwang, Mi-Kyung;Kwon, Mahn-Woo;Lee, Sang-Ho;Kim, Chee-Yong
    • Journal of the Korea Convergence Society
    • /
    • v.13 no.2
    • /
    • pp.177-183
    • /
    • 2022
  • This study investigated through eye tracking what gaze path the audience searches through portal sites (Naver, Daum, Zoom, and Nate). As a result of the layout analysis according to the gaze path of the search engine, the four main pages, which can be called to be the gateway to information search, appeared in the form of a Z-shaped layout. The news and search pages of each site use an F-shape, which means that when people's eyes move from top to right in an F-shape, they read while moving their eyes from left to right(LTR), which sequentially moves to the bottom. As a result of analyzing through the heat map, gaze plot, and cluster, which are the visual analysis indicators of eye tracking, the concentration of eyes on the photo and head copy was found the most in the heat map, and it can be said to be of high interest in the information. The flow of gaze flows downward from the top left to the right, and it can be seen that the cluster is most concentrated at the top of the portal site. The website designer should focus on improving the accessibility and readability of the information desired by the user in the layout design, and periodic interface changes are required by investigating and analyzing the tendencies and behavioral patterns of the main users.