• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.241-252
• /
• 2006

In cluster file systems, the availability of files has been supported by replicating entire files or generating parities on parity servers. However, those methods require very large temporal and spatial cost, and cannot handle massive failures situation on the file system. So we propose HA-PVFS, a cluster file system supporting high data availability adaptive to temporal locality. HA-PVFS restricts replication or parity generation to some important files, for that it employs an efficient algorithm to estimate file access patterns from limited information. Moreover, in order to minimize the performance degradation of the file system, it uses delayed update method and relay replication.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.678-681
• /
• 2007

분산형 데스크탑 그리드 시스템에서 안정적인 연산 수행을 위한 노드 구성 기법과 동적인 환경에 적응적인 스케줄링 기법은 필수 요소이다. 그러나 기존 연구에서는 자원 제공자의 휘발성에 적응적으로 대처하지 못하는 연산 수행 모델을 사용하였기 때문에 데드라인 내에 전체 작업을 완료해야하는 응용에 대처하지 못하는 문제점이 발생한다. 이에 본 논문에서는 자원제공자의 성능과 논리적인 위치기반으로 자가 조직적 연산 오버레이 네트워크(Computation Overlay Network) 구성 기법과 자원제공자의 작업 완료 확률과 신용도 값을 이용하여 응용 QoS 보장을 위한 휴리스틱기반 복제 (Heuristic based Replication) 기법을 제안한다. 성능평가에서는 기존 스케줄링 기법과 자원제공자의 작업 완료 확률과 신용도에 따른 분포를 이용한 복제기반 스케줄링 기법을 비교평가 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.937-940
• /
• 2004

프로세서 자원, 데이터 저장장치 자원을 제공하면서 가상기관(Virtual Organization)을 구성하는 각 사이트는 사용할 수 있는 네트윅 자원이 한정된 상황에서 애플리케이션 처리량을 극대화하는 최적화된 데이터그리드 시스템을 기대한다. 본 논문에서는 크기가 제한적이며 지리적으로 분산된 데이터 저장공간에서 적응적 데이터 복제 기법을 제안하고 Replica의 지리적 분배를 위한 평가 모델을 제안한다. 이를 위해 논리 시간 데이터 접근 기록 및 통계를 적용하여 복제할 파일들을 구분 하는 이산적 결정 모델을 제안하고 삭제할 Replica 결정에 논리 시간 접근 기록을 적용한다.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.1-10
• /
• 2006

For efficient searching in unstructured peer-to-peer systems, random walk was proposed and several replication methods have been studied to compensate for the random walk's low query success rate. This paper proposes an efficient replication scheme that improves the accuracy and speed of queries and reduces the cost by minimizing the number of replicas and by utilizing caches. In this scheme, hub nodes store only content's caches, and one of their neighbors stores the replica. By determining hubs with only limited and local information, we can adaptively generate caches and replicas in dynamic peer-to-peer networks.

• The Journal of Korean Association of Computer Education
• /
• v.12 no.4
• /
• pp.65-75
• /
• 2009

The result verification is necessary to support a guarantee for the correctness of the task results be executed by any unspecified resources in desktop grid environments. Typically, voting-based and trust-based result verification schemes have been used in the environments. However, these suffer from two potential problems: waste of resources due to redundant replicas of each task and increase in turnaround time due to the inability to deal with a dynamic changeable execution environment. To overcome these problems, we propose a fuzzy inference-based replication scheme which can adaptively determine the number of replicas per task by using both trusty degree and result return probability of resources. Therefore our proposal can reduce waste of resources by determining the number of replicas meeting with a dynamic execution environment of desktop grids, not to mention an enhancement of turnaround time for entire asks. Simulation results show that our scheme is superior to other ones in terms of turnaround time, the waste of resources, and the number of re-replications per task.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.1
• /
• pp.51-59
• /
• 2003

It is effective to be located in the double nodes in the distributed object replication systems, then object which nodes share is the same contents. The nodes store an access information on their local cache as it access to the system. and then the nodes fetch and use it, when it needed. But with time the coherence Problems will happen because a data carl be updated by other nodes. So keeping the coherence of the system we need a mechanism that we managed the to improve to improve the performance and availability of the system effectively. In this paper to keep coherence in the shared memory condition, we can set the limited parallel performance without the additional cost except the coherence cost using it to keep the object at the proposed adaptive duplication object(ADO) algorithms. Also to minimize the coherence maintenance cost which is the bi99est overhead in the duplication method, we must manage the object effectively for the number of replication and location of the object replica which is the most important points, and then it determines the cos. And that we must study the adaptive duplication object management mechanism which will improve the entire run time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.59-263
• /
• 2003

정보통신의 비약적인 발전에 힘입어 멀티미디어 데이터는 언제 어디서든 전송 받거나 공유할 수 있게 되었다. 아날로그 형태에서 디지털의 아날로그를 형태로 빠르게 대체되고 있으며, 디지털로 신호를 표현하는 방법은 기존 사용하여 표현하는 방법에 비해 많은 장점을 가지고 있다. 하지만 디지털로 된 데이터는 언제 어디서든 대단위 복제가 가능하다. 즉, 저작권 침해, 불법 복제 및 배포, 손쉽게 위조할 수 있다는 점이 그것이다. 디지털 컨텐츠의 불법 복제와 유통은 저작자의 창작 의욕과 수입원을 차단하는 매우 중요한 문제이며, 이를 방지하기 위해서 멀티미디어 데이터의 저작권을 가진 소유자가 원하는 정보를 삽입함으로써 데이터의 저작권 보호와 복사 방지 및 불법적인 유통을 막고자 하는 기술이 개발되고 있다. 디지털 영상 정보의 보호를 위해 디지털 영상의 불법적인 내용 조작을 막고, 영상의 소유권을 보장할 수 있는 방법으로 디지털 워터마크(Digital Watermark)가 있다. 디지털 워터마크는 공개키 알고리즘이나 방화벽 등으로 해독된 영상에 대하여 부가적인 보호를 제공한다. 디지털 영상에 대한 저작권 정보, 배포자 정보 그리고 사용자 정보를 영상에 삽입함으로써 훗날 법적인 문제가 발생하였을 때 해결책을 제시할 수 있다. 본 논문에서는 디지털 영상 데이터의 정보 보호를 위해 주파수 영역에서의 웨이브릿 변환(Wavelet Transform)을 이용한 이미지 적응 디지털 워터마킹(Image-Adaptive Digital Watermarking) 방법을 제안한다. 이미지 적응 웨이브릿(Image-Adaptive Wavelet)은 영상을 주파수적으로 분해하면서 각 대역들의 공간 영역에서의 정보를 함께 지니고 JND(Just noticeable difference)을 포함한다. 이미지 적응 웨이브릿의 이러한 특성을 이용하여 다해상도 분해하고, 손실 압축(toss Compression) 이나 필터링(Filtering), 잡음(Noise) 등에 크게 영향받는 저주파 성분과 인간의 시각적으로 큰 의미를 갖는 고주파 성분의 특성을 이용하여 워터마크를 삽입한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.187-195
• /
• 2008

In MANET, it is important to efficiently manage data objects and traffic to improve network throughput and response time. This paper proposes a connection-degree based data object search and replication scheme in mobile ad-hoc networks. In this method, information about the path data object providers is stored at the cache of a cluster header at which lots of queries arrive, so that, to reduce the load of the cluster header, replicas can be created at its neighboring nodes. The method proposes an algorithm that picks up a cluster header among mobile nodes and makes it possible to search for and utilize adaptive and up-to-date information in MANET. The method is expected to be effective since it enables access to data objects in spite of broken links among mobile nodes with an enhancement in network response time of searching and a decrease in communication costs. The efficiency of this system was verified via simulation.

• The Journal of Korean Academy of Prosthodontics
• /
• v.57 no.4
• /
• pp.397-404
• /
• 2019

Bone and soft tissue conditions are important for successful implant treatment. But, the placement itself is also very important. Implants which is installed in the wrong position result in the biological, esthetical and mechanical problems. In order to place an implant in the correct position, the final restoration and diagnostic wax-up should be considered prior to the surgery. If the artificial teeth for the interim denture are directly transferred from the diagnostic wax-up, the operator can try the form of diagnostic wax-up in the mouth. If the surgical template is produced by duplicating the interim denture, the implant can be placed in the planned position. In this case, the polymethyl methacrylate (PMMA) artificial tooth was precisely milled by the digital duplication of diagnostic wax-up. And interim denture was fabricated by using these milled teeth. After the patient adapted for a sufficient period, the implant was placed at the planned position with surgical template produced by duplicating the interim denture. After confirming sufficient osseointegration, the final prostheses were made to reflect the shape of diagnostic wax-up. Through this procedure, the satisfactory functional and esthetic outcome could be acquired.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1224-1228
• /
• 2003

The use of digital imaging technique and digital contents based on internet has grown rapidly for last several years, and the needs of digital image protection become more important. For the purpose of copyright protection on digital image, the verification of authentication techniques like content authentication, ownership authentication, illegal copy and etc are needs. Digital watermarking, the invisible encryption technique to insert digital watermarking into image, the sophisticated perceptual information should be used for providing transparency and robustness of images on watermarking process. In this paper, we implement the algorithm for preventing forged attack. ownership protection and authentication by transforming the wavelet algorithms in frequency domain in terms of human visual system.