• Title/Summary/Keyword: 스탬프

Search Result 217, Processing Time 0.027 seconds

Survey of Electronic Notary (전자 공증에 대한 고찰)

  • Yu, SeokHwan;Jeong, Jong-Il;Cha, Moo-Hong;Shin, Dongil;Shin, DongKyoo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.435-438
    • /
    • 2004
  • 전자 상거래에서 보안과 신뢰성을 보장하는 것은 매우 중요하다. 공개키 기반 구조에서는 인증서를 사용 함으로서 암호 및 인증기능을 제공하나, 신뢰성 있는 부인 방지 기능을 제공하기 위해서는 상위 기관의 인증기관이나 타임 스탬프 기능과 공증 기능을 위한 제 3의 신뢰성 있는 공증 기관이 필요하다. 본 논문에서는 전자공증의 기능과 필요성 및 동향에 대하여 소개한다.

  • PDF

Implementation of camera synchronization for multi-view capturing system (다시점 촬영 시스템을 위한 카메라 동기화 구현)

  • Park, Jung Tak;Park, Byung Seo;Seo, Young-Ho
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • fall
    • /
    • pp.268-269
    • /
    • 2021
  • 본 논문에서는 RGB이미지와 Depth 이미지를 촬영할 수 있는 촬영 장비인 Azure Kinect를 사용해 다시점 촬영 시스템 구성을 위한 카메라 동기화 시스템을 제안한다. 제안한 시스템에는 8대의 Azure Kinect 카메라를 사용하고 있으며 각 카메라는 3.5-mm 오디오 케이블로 연결되어 외부동기화 신호를 전달한다. 그리고 이미지를 저장할 때 발생하는 메모리에서의 병목현상을 최소화하기 위해 촬영 시스템의 동작을 16개의 버퍼로 나누어 병렬 컴퓨팅으로 진행한다. 이후 동기화 여부에 따른 차리를 디바이스 타임스탬프를 기준으로 하여 비교한다.

  • PDF

Polymeric Arrayed Waveguide Grating Based on Nanoimprint Technique Using a PDMS Stamp (나노임프린트 방법을 이용한 폴리머 광도파로 열 격자)

  • Lim, Jung-Gyu;Lee, Sang-Shin;Lee, Ki-Dong
    • Korean Journal of Optics and Photonics
    • /
    • v.17 no.4
    • /
    • pp.317-322
    • /
    • 2006
  • A polymeric arrayed waveguide grating (AWG) has been proposed and demonstrated by exploiting the nanoimprint method. A PDMS(polydimethylsiloxane) stamp with device patterns engraved was developed out of a master mold made of quartz glass. The device was fabricated by transferring the pattern in the PDMS stamp to a spin-coated polymer film without using any etching process. The device had 8 output channels, while the center wavelengths of each output channel were positioned from 1543.7 nm to 1548.3 nm with the spacing of 0.8 nm. The achieved average channel crosstalk and the 3-dB bandwidth were about 10 dB and 0.8 nm respectively.

Mini-Bin Based Implementation Complexity Improvement in Fair Packet Schedulers (공정 패킷 스케줄러에서 미니빈 기반 구현 복잡도 개선)

  • Kim, Tae-Joon;Kim, Hwang-Rae
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.8
    • /
    • pp.1020-1029
    • /
    • 2006
  • Realization of high-capacity quality-of-service router needs fair packet schedulers with a lower complexity. Timestamp based fair packet schedulers have the ideal complexity of O(log V), where V is the maximum number of admitted flows, but it has been recently reduced to O(1) using bin concept. However, the latency property was deteriorated and the bandwidth utilization was also declined. In addition, traffic flows requiring strong delay bound may not be admitted. To overcome these problems, this paper proposes a Mini-Bin based Start-Time (MBST) scheduler with variable complexity and evaluates its performance. The MBST scheduler uses the timestamp calculation scheme of start-time based schedulers to enhance the bandwidth utilization and also introduces mini-bin concept to improve the latency, The performance evaluation shows that the proposed scheduler can reduce the complexity of the legacy start-tine based schedulers by $1.8{\sim}5$ times without deteriorating the bandwidth utilization property.

  • PDF

The Consistency Management Using Trees of Replicated Data Items in Partially Replicated Database (부분 중복 데이터베이스에서 중복 데이터의 트리를 이용한 일관성 유지)

  • Bae, Mi-Sook;Hwang, Bu-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.10D no.4
    • /
    • pp.647-654
    • /
    • 2003
  • The replication of data is used to increase its availability and to improve the performance of a system. The distributed database system has to maintain both the database consistency and the replica consistency. This paper proposes an algorithm which resolves the conflict of the operations by using the mechanism based on the structure that the replicas of each data item are hierarchically organized. Each update is propagated along the tree based on the fact that the root of each data item is the primary replica in partially replicated databases. The use of a hierarchy of data may eliminate useless propagation since the propagation can be done only to sites having the replicas. In consequence, the propagation delay of updates may be reduced. By using the timestamp and a compensating transaction, our algorithm resolves the non-serializability problem caused by the conflict of operations that can happen on the way of the update propagation due to the lazy propagation. This resolution also guarantees the data consistency.

A Study on Temporal Data Models and Aggregate Functions (시간지원 데이터 모델 및 집계함수에 관한 연구)

  • Lee, In-Hong;Moon, Hong-Jin;Cho, Dong-Young;Lee, Wan-Kwon;Cho, Hyun-Joon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.12
    • /
    • pp.2947-2959
    • /
    • 1997
  • Temporal data model is able to handle the time varying information, which is to add temporal attributes to conventional data model. The temporal data model is classified into three models depending upon supporting time dimension, that are the valid time model to support valid time, the transaction time model to support transaction model, and the bitemporal data model to support valid time and transaction time. Most temporal data models are designed to process the temporal data by extending the relational model. There are two types or temporal data model, which are the tuple timestamping and the attribute timestamping depending on time dimension. In this research, a concepts of temporal data model, the time dimension, types of thc data model, and a consideration for the data model design are discussed Also, temporal data models in terms of the time dimension are compared. And the aggregate function model of valid time model is proposed, and then logical analysis for its computing consts has been done.

  • PDF

Performance Comparison of Timestamp based Fair Packet Schedulers inServer Resource Utilization (서버자원 이용도 측면에서 타임스탬프 기반 공평 패킷 스케줄러의 성능 비교 분석)

  • Kim Tae-Joon;Ahn Hyo-Beom
    • The KIPS Transactions:PartC
    • /
    • v.13C no.2 s.105
    • /
    • pp.203-210
    • /
    • 2006
  • Fair packet scheduling algorithms supporting quality-of-services of real-time multimedia applications can be classified into the following two design schemes in terms of the reference time used in calculating the timestamp of arriving packet: Finish-time Design (FD) and Start-time Design (SD) schemes. Since the former can adjust the latency of a flow with raising the flow's reserved rate, it has been applied to a router for the guaranteed service of the IETF (Internet Engineering Task Force) IntServ model. However, the FD scheme may incur severe bandwidth loss for traffic flows requiring low-rate but strong delay bound such as internet phone. In order to verify the usefulness of the SD scheme based router for the IETF guaranteed service, this paper analyzes and compares two design schemes in terms of bandwidth and payload utilizations. It is analytically proved that the SD scheme is better bandwidth utilization than the FD one, and the simulation result shows that the SD scheme gives better payload utilization by up to 20%.

Synchronization Method of Stereoscopic Video in 3D Mobile Broadcasting through Heterogeneous Network (이종망을 통한 3D 모바일 방송에서의 스테레오스코픽 비디오 전송을 위한 동기화 방법)

  • Kwon, Ki-Deok;Yoo, Young-Hwan;Jeong, Hyeon-Jun;Lee, Gwang-Soon;Cheong, Won-Sik;Hur, Nam-Ho
    • Journal of Broadcast Engineering
    • /
    • v.17 no.4
    • /
    • pp.596-610
    • /
    • 2012
  • This paper proposes a method to provide the high quality 3D broadcasting service in a mobile broadcasting system. In this method, audio and video data are delivered through a heterogeneous network, consisting of a mobile network as well as a broadcasting network, due to the limited bandwidth of the broadcasting system. However, it is more difficult to synchronize the left and right video frames of a 3D stereoscopic service, which come through different types of networks. The proposed method suggests the use of the offset from the initial timestamp of RTP (Real Time Protocol) to determine the order of frames and to find the pair of a left and a right frame that must be played at the same time. Additionally, a new signaling method is introduced for a mobile device to request a 3D service and to get the initial RTP timestamp.

Analysis of Cell Stream Scheme and Service Transmission using Time-Stamp Method in the Wireless ATM (무선 ATM에서 타임스탬프 방식을 이용한 셀 스트림 구조와 서비스전송 해석)

  • Kim, Jeong-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2179-2187
    • /
    • 1999
  • To privide multimedia mobile communication services for the users in scattered locations, the application ATM cells efficiently in wireless communications, it is effective to the use TDMA method. However, it is necessary to have methods to compensate the CDV(cell delay variation) caused by the difference between TDMA-ATM and cell stream multiplexing of the users. This paper optimizes the cell control time(Tc) when VBR traffic inputs have MMPP by applying CDV characteristics of time stamp method, which has the most advantages among compensation methods of CDV. This paper suggests a cell stream multiplex method employing time stamp techniques to reduce CDV for wireless suggest method shows that CDV distribution and cell stream multiples rangd can be controlled to 1.2${\times}$Tc which reduced over the VBR service in the TDMA-WATM transmission. This paper also presents evaluation of the suggested architecture obtained simulation.

  • PDF

A Tile-Image Merging Algorithm of Tiled-Display Recorder using Time-stamp (타임 스탬프를 이용한 타일드 디스플레이 기록기의 타일 영상 병합 알고리즘)

  • Choe, Gi-Seok;Nang, Jong-Ho
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.5
    • /
    • pp.327-334
    • /
    • 2009
  • The tiled-display system provides a high resolution display which can be used in different applications in co-working area. The systems used in the co-working field usually save the user logs, and these log information not only makes the maintenance of the tiled-display system easier, but also can be used to check the progress of the co-working. There are three main steps in the proposed tiled display log recorder. The first step is to capture the screen shots of the tiles and send them for merging. The second step is to merge the captured tile images to form a single screen shot of the tiled-display. The final step is to encode the merged tile images to make a compressed video stream. This video stream could be stored for the logs of co-working or be streamed to remote users. Since there could be differences in capturing time of tile images, the quality of merged tiled-display could be degraded. This paper proposes a time stamp-based metric to evaluate the quality of the video stream, and a merging algorithm that could upgrade the quality of the video stream with respect to the proposed quality metrics.