• 제어로봇시스템학회논문지
• /
• 제12권10호
• /
• pp.968-974
• /
• 2006

We are moving into the era of ubiquitous computing. Ubiquitous Sensor Network (USN) is a base of such computing paradigm, where recognizing the identification and the position of objects is important. For the object identification, RFID tags are commonly used. For the object positioning, use of sensors such as laser and ultrasonic scanners is popular. Recently, there have been a few attempts to apply RFID technology in robot localization by replacing the sensors with RFID readers to achieve simpler and unified USN settings. However, RFID does not provide enough sensing accuracy for some USN applications such as robot navigation, mainly because of its inaccuracy in distance measurements. In this paper, we describe our approach on achieving accurate navigation using RFID. We solely rely on RFID mechanism for the localization by providing coordinate information through RFID tag installed floors. With the accurate positional information stored in the RFID tag, we complement coordinate errors accumulated during the wheel based robot navigation. We especially focus on how to distribute RFID tags (tag pattern) and how many to place (tag granularity) on the RFID tag-floor. To determine efficient tag granularities and tag patterns, we developed a simulation program. We define the error in navigation and use it to compare the effectiveness of the navigation. We analyze the simulation results to determine the efficient granularities and tag arrangement patterns that can improve the effectiveness of RFID navigation in general.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권5호
• /
• pp.1829-1846
• /
• 2021

Transient faults occur in computation units of a processor, which can cause control flow errors (CFEs) and compromise system reliability. The software-based methods perform illegal control flow detection by inserting redundant instructions and monitoring signature. However, the existing methods not only have drawbacks in terms of performance overhead, but also lack of configurability. We propose a configurable approach CCFCA for detecting CFEs. The configurability of CCFCA is implemented by analyzing the criticality of each region and tuning the detecting granularity. For critical regions, program blocks are divided according to space-time overhead and reliability constraints, so that protection intensity can be configured flexibly. For other regions, signature detection algorithms are only used in the first basic block and last basic block. This helps to improve the fault-tolerant efficiency of the CCFCA. At the same time, CCFCA also has the function of solving confusion and instruction self-detection. Our experimental results show that CCFCA incurs only 10.61% performance overhead on average for several C benchmark program and the average undetected error rate is only 9.29%. CCFCA has high error coverage and low overhead compared with similar algorithms. This helps to meet different cost requirements and reliability requirements.

• 정보처리학회논문지B
• /
• 제18B권5호
• /
• pp.249-254
• /
• 2011

MPEG-4 파트 2에서 화질 확장성을 지원하는 FGS (fine granularity scalability) 코딩 기법은 가변적인 네트워크 대역폭에서 최적의 화질을 구현할 수 있는 스케일러블 비디오 코딩 기법이다. 본 논문에서는 기본 FGS 코딩 구조의 향상 계층에서, 영상의 잔여 신호를 다시 한 번 더 비트 평면 (bit-plane) 코딩을 해주는 FGS 코딩 구조를 제안하였다. 실험에서는 제안된 FGS 코딩 구조와 MPEG-4 VM (verification model) FGS 코딩 구조를 비교하여 제안된 FGS 코딩 구조의 화질 확장성을 평가하였다. 비교는 테스트된 3개의 비디오의 PSNR의 분석으로 이루어졌다. 결과는 제안된 구조가 비트율 제어 기법 VM5+를 이용했을 때, VM-FGS 코딩 구조보다 Y, U, V PSNR이 평균적으로 각각 0.4 dB, 9.4dB, 9 dB 더 높게 나타났고, QP (quantization parameter) 값을 17로 고정시킨 경우는, 제안된 구조가 4.61 dB, 20.21 dB, 16.56 dB 더 높게 나타났다. 결과에 의해, 제안된 구조가 VM-FGS 코딩 구조보다 최저부터 최대의 화질을 얻을 수 있는 화질 확장성이 더 높은 구조임을 알 수 있었다.

• 전자공학회논문지CI
• /
• 제46권3호
• /
• pp.42-49
• /
• 2009

본 논문에서는 블로그 공간에 존재하는 블로거와 포스트들을 클러스터링하고자 한다. 먼저 블로그 공간의 블로거와 포스트들을 각각 하나의 타입으로, 블로거와 포스트 사이의 액션을 링크로 사상한다. 다음으로, 블로그 공간의 클러스터링을 위하여 블로그 환경에 가장 적합하고 효율적인 링크 기반 클러스터링 방법인 LinkClus를 선택한다. 정확한 클러스터링을 위하여 두 가지 방법을 제시한다. 첫 번째는 클러스터의 대상을 여러 주제에 관심을 가지는 블로거 대신 하나의 주제만을 나타내는 폴더로 한다. 두 번째는 노이즈의 발생 가능성을 높이는 링크가 아주 적은 블로거와 포스트를 클러스터링 과정에서 제외시킨다. 실험을 통하여 제안하는 방안을 이용한 클러스터링 결과가 내용적으로도 유사한지 검증한다.

• 인터넷정보학회논문지
• /
• 제17권5호
• /
• pp.51-58
• /
• 2016

The unprecedented power of cloud computing (CC) that enables free sharing of confidential data records for further analysis and mining has prompted various security threats. Thus, supreme cyberspace security and mitigation against adversaries attack during data mining became inevitable. So, privacy preserving data mining is emerged as a precise and efficient solution, where various algorithms are developed to anonymize the data to be mined. Despite the wide use of generalized K-anonymizing approach its protection and truthfulness potency remains limited to tiny output space with unacceptable utility loss. By combining L-diversity and (${\alpha}$,k)-anonymity, we proposed a hybrid K-anonymity data relocation algorithm to surmount such limitation. The data relocation being a tradeoff between trustfulness and utility acted as a control input parameter. The performance of each K-anonymity's iteration is measured for data relocation. Data rows are changed into small groups of indistinguishable tuples to create anonymizations of finer granularity with assured privacy standard. Experimental results demonstrated considerable utility enhancement for relatively small number of group relocations.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제15권1호
• /
• pp.68-76
• /
• 2015

Phase-change memory (PCM) is a promising technology that is anticipated to be used in the memory hierarchy of future computer systems. However, its access time is relatively slower than DRAM and it has limited endurance cycle. Due to this reason, PCM is being considered as a high-speed storage medium (like swap device) or long-latency memory. In this paper, we adopt PCM as a virtual memory swap device and present a new page replacement policy that considers the characteristics of PCM. Specifically, we aim to reduce the write traffic to PCM by considering the dirtiness of pages when making a replacement decision. The proposed replacement policy tracks the dirtiness of a page at the granularity of a sub-page and replaces the least dirty page among pages not recently used. Experimental results with various workloads show that the proposed policy reduces the amount of data written to PCM by 22.9% on average and up to 73.7% compared to CLOCK. It also extends the lifespan of PCM by 49.0% and reduces the energy consumption of PCM by 3.0% on average.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제14권8호
• /
• pp.808-812
• /
• 2008

최근 시스템의 복잡도가 증가함에 따라 보안 취약점 문제가 더욱 많이 발생하고 있다. 이를 해결하기 위해 보안 패치가 배포되고 있지만, 시스템 서비스의 중단이 필요하고 패치 자체의 안정성이 검증되지 못해 패치의 적용이 늦어지는 문제가 발생한다. 우리는 이러한 문제를 해결하기 위해 업데이트성이 없는 커널을 위한 함수 단위 동적 업데이트 시스템인 DUNK를 설계하였다. DUNK는 서비스 중단 없는 업데이트를 가능케 하고, 보안 기법인 MAFIA를 통해 안전한 업데이트를 수행한다 MAFIA는 바이너리 패치 코드의 접근 행위를 분석함으로써 패치된 함수가 기존 함수의 접근 권한을 상속받도록 하고, 이를 검증하는 기술을 제공한다. 본 논문에서는 DUNK의 설계와 MAFIA의 알고리즘 및 수행에 대해 기술한다.

• 대한치과기공학회지
• /
• 제23권2호
• /
• pp.95-103
• /
• 2002

For this study, self curing resin and heat curing resin used for existing usual resin denture base in the denture industry were chosen by manufacturer. Curing tests for 30-minute, I-hour, 2-hour and 3-hour were conducted to know the strength of the resins and conduct analysis to get other necessary information. The results obtained are as follows: 1. Heat curing resins show a little differences among the manufacturers. However 30-minute curing resin shows great difference as shown in the fracture strength test. 2. The effect from the granularity of the resins on the fracture strength was found insignificant which means there is no difference between coherence and strength. 3. To summarize the results from each time level, the longer the time is, the more the minute cracks on the surface, which is the cause of reduced strength. From this test, it was identified that in making the denture base for patients in dental clinics, 30-minute curing is most efficient and effective in reducing discoloration and monomers, although long-time curing has been considered to be the principal.

• 전자공학회논문지CI
• /
• 제38권3호
• /
• pp.41-54
• /
• 2001

본 논문은 시간 데이터베이스에 능동 규칙 시스템을 결합한 능동적 시간 데이터베이스의 능동 규칙 및 실행 모델을 제안한다. 기존의 시간 데이터베이스 능동 규칙 연구들이 시간 릴레이션에 대한 조건-조치 형태의 규칙 지원에 머물렀던데 비하여 제안하는 능동 규칙 모델은 유효 시간 및 트랜잭션 시간을 지원하는 이원 시간 릴레이션에 대해 SQL3 트리거의 기능 모두를 시간 데이터베이스 상에서 지원한다. 즉, 전이 릴레이션 및 전이 변수, 조건-조치의 튜플 및 문 단위 수행을 포함한다. 또한, 능동 규칙의 유효 시간 정의 및 유효시간 사건 등의 새로운 개념을 제시한다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제15권6호
• /
• pp.634-646
• /
• 2015

Coarse-Grained Reconfigurable Architecture (CGRA) is a very promising platform that provides fast turn-around-time as well as very high energy efficiency for multimedia applications. One of the problems with CGRAs, however, is application mapping, which currently does not scale well with geometrically increasing numbers of cores. To mitigate the scalability problem, this paper discusses how to use the SIMD (Single Instruction Multiple Data) paradigm for CGRAs. While the idea of SIMD is not new, SIMD can complicate the mapping problem by adding an additional dimension of iteration mapping to the already complex problem of operation and data mapping, which are all interdependent, and can thus significantly affect performance through memory bank conflicts. In this paper, based on a new architecture called SIMD reconfigurable architecture, which allows SIMD execution at multiple levels of granularity, we present how to minimize bank conflicts considering all three related sub-problems, for various RA organizations. We also present data tiling and evaluate a conflict-free scheduling algorithm as a way to eliminate bank conflicts for a certain class of mapping problem.