• 한국측량학회지
• /
• 제27권4호
• /
• pp.505-513
• /
• 2009

최근 첨단도시 건설을 위한 건설정보화 연구가 활발히 진행 중이다. 건설현장의 건설요소인 인력, 자재 및 장비의 동적인 위치정보를 취득하기 위한 RTLS(Real-Time location system) 개발이 그 중 하나이며, 특히 자재, 장비, 인력과 같은 건설요소의 동적 위치정보를 획득하여 그 요소들을 효율적으로 관리하여, 안전 및 공사비용을 절감 효과를 꾀하고 있다. RTLS 시스템의 건설현장에 도입하기 위해서는 RTLS Reader, 즉 AP(Access Point) 전파가 도달하는 거리를 고려한 3차원 분석을 통해 사전에 AP의 설치 위치를 모의해야 할 필요가 있다. 본 연구에서는 지상라이다를 사용하여 구축된 공간정보를 기반으로 한 3차원 전파세기 모의 소프트웨어를 제작하였다. 또한 4곳의 실험지역을 선정하여 모의 실험결과와 실제 실험을 통해 측정된 전파세기를 비교하였다. 그 실험 결과로 4곳의 실험지역 중 가시 확보가 좋은 곳에서 측정된 전파세기가 전파모델식을 통하여 모의된 전파세기와 가장 흡사한 결과를 나타냈다.

• 한국재료학회:학술대회논문집
• /
• 한국재료학회 2011년도 추계학술발표대회
• /
• pp.24.2-24.2
• /
• 2011

Ru is used as a bottom electrode capacitor in dynamic random access memories (DRAMs) and ferroelectric random access memories (FRAMs). The surface of the Ru needs to be planarized which is usually done by chemical mechanical polishing (CMP). Ru CMP process requires chemical slurry consisting of abrasive particles and oxidizer. A slurry containing NaIO4 and alumina particles is already proposed for Ru CMP process. However, the stability of the slurry is critical in the CMP process since if the particles in the slurry get agglomerated it would leave scratches on the surface being planarized. Thus, in the present work, the stability behavior of the slurry using a suitable anionic polyelectrolyte is investigated. The parameters such as slurry pH, polyelectrolyte concentration, adsorption time and the sequence of addition of chemicals are optimized. The results show that the slurry is stable for longer time at an optimized condition. The polishing behavior of the Ru using the optimized slurry is also investigated.

• 정보처리학회논문지A
• /
• 제12A권3호
• /
• pp.215-222
• /
• 2005

대규모 신호처리 변환을 신속하게 처리하기 위해서는 캐시 메모리를 효과적으로 이용하는 것이 중요하다. 대규모 DFT 계산에서는 stride 액세스로 인한 캐시 충돌 적중 실패로 인하여 캐시 성능이 상당히 떨어지게 되고 이로 인해 전체적인 성능이 저하하게 된다. 본 논문에서는 메모리 계층 구조를 고려한 동적 데이터 재배열(Dynamic Data Layout) 방법을 개발하였다. 제시된 방법은 stride를 가지는 계산 단계(computation stage) 사이에 데이터를 동적으로 재구성을 하여 캐시 적중 실패를 줄이는 것이다. 또한 트리 구조 FFT 계산 방법에서 FFT 크기와 데이터 stride 액세스를 기초로 하여 가능한 모든 인수분해 트리 중에서 최소 실행시간을 가지는 최적의 인수 분해트리를 찾아내는 탐색 알고리즘을 개발하였다. 성능 향상을 확인하기 위하여 제시된 방법을 기존의 FFT 알고리즘에 적용하여 Pentium 4, Alpha 21264, $Athlon^{TM}$ 64, UltraSPARC III에서 실험하였다. 실험 결과에 따르면 기존의 FFT 패키지들과 비교하여 제시된 방법을 적용한 FFT가 최대 3.37배의 성능 향상을 얻을 수 있었다.

• 한국통신학회논문지
• /
• 제33권7A호
• /
• pp.693-701
• /
• 2008

주파수 재 사용률이 1인 OFDMA(Orthogonal Frequency Division Multiple Access) 시스템에서는 인접한 셀에서 동일채널을 사용하는 것은 셀 간 간섭(Inter-cell-Interference)이 발생하므로 셀 간 간섭을 최소로 하는 채널할당이 이루어져야 한다. 본 논문에서는 OFDMA환경에서 새로운 최대 CNIR(Carrier to Noise and Interference Ratio) 기반의 분산형 Inter-cell DCA (Dynamic Channel Allocation) 알고리즘을 제안한다. 제안된 Inter-cell DCA 알고리즘은 자신의 셀에서 채널할당 요구 시 자신의 셀 내에서 채널이 포화상태이거나 할당 가능한 채널이 남아 있지만 주변 셀 간섭으로 인해 기준 CNIR 문턱치 값을 만족하지 못할 경우에도 인접한 셀의 할당 가능한 채널들의 CNIR을 검색하여 최대 값을 갖는 채널을 할당하는 방법이다. 제안된 방법은 채널 할당 확률을 높여 신규호 블록율과 신규호 생성에 의한 기존채널의 강제 종료율을 동시에 감소시켜 시스템 수율을 향상시킬 수 있음을 시뮬레이션을 통해 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권4호
• /
• pp.491-508
• /
• 2010

In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. Therefore, the key challenge is how to keep the initial part of a video in a peer's buffer for as long as possible, and thus maximize the availability of a video for stream relay. In addition, to address the issues of delivering data on lossy network and providing scalable quality of services for clients, the adoption of multiple description coding (MDC) has been proven as a feasible resolution by much research work. In this paper, we propose a novel caching scheme for P2P on-demand streaming, called Dynamic Buffering. The proposed Dynamic Buffering relies on the feature of MDC to gradually reduce the number of cached descriptions held in a client's buffers, once the buffer is full. Preserving as many initial parts of descriptions in the buffer as possible, instead of losing them all at one time, effectively extends peers’ service time. In addition, this study proposes a description distribution balancing scheme to further improve the use of resources. Simulation experiments show that Dynamic Buffering can make efficient use of cache space, reduce server bandwidth consumption, and increase the number of peers being served.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.81-98
• /
• 1997

Given a rooted tree T with profits and node demands, the capacitated subtree of a tree problem (GSTP) consists of finding a rooted subtree of maximum profit, subject to having total demand no larger than the given capacity H. We first define the so-called critical item for CSTP and find an upper bound on the optimal value of CSTP in O(n$^{2}$) time, where n is the number of nodes in T. We then present our branch and bound algorithm for solving CSTP and illustrate the algiruthm by using an example. Finally, we implement our branch-and-bound algorithm and compare the computational results with those for both CPLEX and a dynamic programming algorithm. The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, where n and H are the range of [50, 500] and [5000, 10000], respectively.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2012년도 춘계학술논문집 2부
• /
• pp.817-819
• /
• 2012

This paper propose an interested digital rights protection scheme to address problems facing contemporary DRM approached : static digital rights management, and limited application to on-line environment. We introduce a dynamic mission control technology to realize dynamic digital rights management. And we incorporate license agent to on- and off-line monitoring and tracking. The proposed system prevent illegal access and use by using PKI security method, real time action monitoring for user, data security for itself.

• Journal of Communications and Networks
• /
• 제7권4호
• /
• pp.478-488
• /
• 2005

To conserve the usage of energy, indexing techniques have been developed in a wireless mobile environment. However, the use of interleaved index segments in a broadcast cycle increases the average access latency for the clients. In this paper, we present the broadcast-based location dependent data delivery scheme (BBS) for dynamic range queries. In the BBS, broadcasted data objects are sorted sequentially based on their locations, and the server broadcasts the location dependent data along with an index segment. Then, we present a data prefetching and caching scheme, designed to reduce the query response time. The performance of this scheme is investigated in relation to various environmental variables, such as the distributions of the data objects, the average speed of the clients, and the size of the service area.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2011년도 춘계학술논문집 1부
• /
• pp.366-370
• /
• 2011

This paper propose an interested digital rights protection scheme using license agent to address problems facing contemporary DRM approached : static digital rights management, and limited application to on-line environment. We introduce a dynamic mission control technology to realize dynamic digital rights management. And we incorporate license agent to on- and off-line monitoring and tracking. The proposed system prevent illegal access and use by using PKI security method, real time action monitoring for user, data security for itself.

• 한국디지털건축인테리어학회논문집
• /
• 제3권1호
• /
• pp.1-8
• /
• 2003

Perceiving the depth of space in the spatial organization of architecture is perceiving spaces as well three dimensions as the fourth dimensions -perceive the time-. Physical depth in architectural space differs from perceptional depth in aspects of not only dimension but also perceptional effects. In this study, the perceptional depth is defined as visual depth and physical depth is depth of space. These purposes of this study are classifying the perceptional effects of visual depth -visual access, sense of variety, dynamic and cubic effect... - and the methods of spatial composition which causes visual depth in architectural space.