• 한국정보처리학회논문지
• /
• 제6권2호
• /
• pp.543-551
• /
• 1999

본 논문의 목적은 필기 숫자 인식에서 특징의 부류 분별력을 분석하고, 이를 특징 선택에 활용하는 것이다. 부류 분별력을 측정하기 위하여 Parzen 윈도우를 이용하여 부류 분포를 추정하였고, 서로 다른 부류의 부류 분포간의 거리를 부류 분별로 정의하였다. 이렇게 계산된 부류 분별을 이용하여, 특징 벡터에서 쓸모 없거나 중복성을 갖는 특징을 제거하여 특징 벡터의 차원을 줄인다. 실험은 CENPARMI 필기 숫자에 대해 수행하였으며 10개 부류 전체 뿐 아니라 2개 부류에 대해서도 수행하였다. 실험 결과 10-부류 필기 숫자 인식에서 256-차원 원래 특징 벡터를 인식률 손실 없이 22% 줄일 수 있어, 부류 분별이 특징 선택을 위한 유용한 도구임을 보였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2012년도 추계학술발표대회
• /
• pp.87-90
• /
• 2012

원자력발전소에 사용되는 모든 시스템은 IEEE에서 최고 수준의 안전도인 CLASS 1E로 분류된다. 그중에서 안전계통은 원자력발전소 안전에 관련한 모든 분야를 관리하는 계통이다. 산업이 발전함에 따라 안전계통 또한 그 규모와 복잡성이 높아지고 있고, 이에 적용되는 요구사항 또한 엄격해지고 있다. 따라서 발전소에 적용되는 안전 동작에 대한 기준을 결정하기 위해서 철저한 오류 예측분석이 수행 되어야 한다. 그 중에서도 NUREG-0492로 규정되어 있는 결함수목분석(Fault Tree Analysis)은 연역적 오류 예측 분석방법으로 원자력 발전소, 우주 산업 등에 관련된 분야는 본 방법을 통하여 오류 예측 분석이 이루어 져야한다. 본 논문에서 원전안전계통을 관리하는 구현 모델인 원전안전등급제어기기(Safety Programmable Logic Controller)에 대하여 결함수목분석을 통한 오류 예측 분석을 하였다. 또한, 위의 구조에 대하여 MSC(Message Sequence Chart)를 통한 모델링을 수행하여, 결함수목분석을 적용하는 과정에서 신뢰도 향상을 더하였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2012년도 춘계학술발표대회
• /
• pp.586-589
• /
• 2012

Web Services have been utilized in a wide variety of applications and have turned into a key technology in developing business operations on the Web. Originally, Web Services can be exploited in an isolated form, however when no single Web Service can satisfy the functionality required by a user, there should be a possibility to compose existing services together in order to fulfill the user requirement. However, since the same service may be offered by different providers with different non-functional Quality of Service (QoS), the task of service selection for Web Service composition is becoming complicated. Also, as Web Services are inherently unreliable, how to deliver reliable Web Services composition over unreliable Web Services should be considered while composing Web Services. In this paper, we propose an approach on a QoS-aware Web Service selection for reliable Web Service composition. In our approach, we select and classify Web Services using Decision Tree based on QoS attributes provided by the client. Service classifier will improve selection of relevant Web Services early in the composition process and also provide flexibility to replace a failed Web Services with a redundant alternative Web Services, resulting in high availability and reliability of Web Service composition. We will provide an implementation of our proposed approach along with efficiency measurements through performance evaluation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권4호
• /
• pp.1342-1359
• /
• 2021

The data deduplication technique identifies the duplicates and minimizes the redundant storage data in the backup server. The chunk level deduplication plays a significant role in detecting the appropriate chunk boundaries, which solves the challenges such as minimum throughput and maximum chunk size variance in the data stream. To provide the solution, we propose a new chunking algorithm called Dynamic Prime Chunking (DPC). The main goal of DPC is to dynamically change the window size within the prime value based on the minimum and maximum chunk size. According to the result, DPC provides high throughput and avoid significant chunk variance in the deduplication system. The implementation and experimental evaluation have been performed on the multimedia and operating system datasets. DPC has been compared with existing algorithms such as Rabin, TTTD, MAXP, and AE. Chunk Count, Chunking time, throughput, processing time, Bytes Saved per Second (BSPS) and Deduplication Elimination Ratio (DER) are the performance metrics analyzed in our work. Based on the analysis of the results, it is found that throughput and BSPS have improved. Firstly, DPC quantitatively improves throughput performance by more than 21% than AE. Secondly, BSPS increases a maximum of 11% than the existing AE algorithm. Due to the above reason, our algorithm minimizes the total processing time and achieves higher deduplication efficiency compared with the existing Content Defined Chunking (CDC) algorithms.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2008년도 추계학술발표대회
• /
• pp.332-335
• /
• 2008

In this paper, based on H-tree, which is proposed as the basic data cube structure for multi-dimensional data stream analysis, we have done some analysis. We find there are a lot of redundant nodes in H-tree, and the tree-build method can be improved for saving not only memory, but also time used for inserting tuples. Also, to facilitate more fast and large amount of data stream analysis, which is very important for stream research, H^*-tree is designed and developed. Our performance study compare the proposed H^*-tree and H-tree, identify that H^*-tree can save more memory and time during inserting data stream tuples.

• 한국CDE학회논문집
• /
• 제15권2호
• /
• pp.115-123
• /
• 2010

We present an efficient algorithm for computing the Hausdorff distance between two planar curves. The algorithm is based on an efficient trimming technique that eliminates the curve domains that make no contribution to the final Hausdorff distance. The input curves are first approximated with biarcs within a given error bound in a pre-processing step. Using the biarc approximation, the distance map of an input curve is then approximated and stored into the graphics hardware depth-buffer by rendering the distance maps (represented as circular cones) of the biarcs. We repeat the same procedure for the other input curve. By sampling points on each input curve and reading the distance from the other curve (stored in the hardware depth-buffer), we can easily estimate a lower bound of the Hausdorff distance. Based on the lower bound, the algorithm eliminates redundant curve segments where the exact Hausdorff distance can never be obtained. Finally, we employ a multivariate equation solver to compute the Hausdorff distance efficiently using the remaining curve segments only.

• 한국정보통신학회논문지
• /
• 제7권1호
• /
• pp.158-163
• /
• 2003

다중 디스크 드라이브가 포함된 디스크 배열 시스템에서 디스크의 수가 증가 될 때 시스템 성능은 컨트롤러의 집중화 또는 버스로 사용되는 전송 경로의 병목현상에 의해 제한되어진다. 이러한 단점을 보완하기 위해 고성능 대용량의 RAID가 등장하였으며 RAID 시스템에서 컨트롤러 기능은 모든 디스크 드라이브에 분산되고 각 디스크는 그들의 임무를 수행하는 자율성을 가진 자율적 네트웍이 일반적 계층 시스템 보다 확장성이 좋고 시스템 자원을 보다 효율적으로 이용할 수 있어 디스크 수의 증가율에 따라 높은 읽기/쓰기 처리율의 성능을 제공한다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제4권1호
• /
• pp.51-58
• /
• 2015

This paper proposes a 10-b SAR ADC. To increase the conversion speed and reduce the power consumption and area, redundant cycles were implemented digitally in a capacitor DAC. The capacitor DAC algorithm was straightforward switching, which included digital error correction steps. A prototype ADC was implemented in CMOS $0.18-{\mu}m$ technology. This structure consumed $140{\mu}W$ and achieved 59.4-dB SNDR at 1.25MS/s under a 1.8-V supply. The figure of merit (FOM) was 140fJ/conversion-step.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1817-1822
• /
• 1991

A method of reducing overhead caused by the processor synchronization process and common memory accesses in finely grained tasks is described. We propose a scheduler which considers the preparation time during searching to minimize the redundant accesses to shared memory. Since the suggested hardware (synchronizer) determines the access order of processors and bus arbitration simultaneously by including the synchronization process into the bus arbitration process, the synchronization time vanishes. Therefore this synchronizer has no overhead caused by the processor synchronization[l]. The proposed scheduler algorithm is processed in parallel. The processes share the upper bound derived by each searching and the lower bound function is built considering the preparation time in order to eliminate as many searches as possible. An application of the proposed method to a multi-DSP system to calculate inverse dynamics for robot arms, showed that the sampling time can be twice shorter than that of the conventional one.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2005년도 춘계학술대회 논문집
• /
• pp.1660-1663
• /
• 2005

Unwanted vibrations are inevitably induced in other directions when pure unidirectional vibration motion is desired for the vertical scratching mechanism. Pure vertical vibration motion of the scratching machine can be obtained by driving identical two motors with symmetrically positioned eccentric unbalance masses. The desired optimal condition for driving pure vertical vibration for the scratching machine is assumed to be the resonance condition in that direction. Imposing the flexibility of the scratching machine in the horizontal direction, we can find out the amount of horizontal vibration component while maintaining the resonance in vertical direction. The desired stiffness in horizontal direction which produces the minimum vibration in horizontal direction are defined which can be used as a guide line to design the supporting structure of the scratching machine.