• Review of KIISC
• /
• v.33 no.2
• /
• pp.5-11
• /
• 2023

양자는 물리학에서 더 이상 나눌 수 없는 물리량의 최소 단위이다. 양자에는 일반적인 물리법칙이 적용되지 않는 대신, 양자역학이라는 법칙이 적용된다. 이를 활용한 알고리즘으로 양자암호통신과 양자난수발생기가 존재한다. 양자암호통신은 기존 암호통신과는 다른 차원의 보안성을 제공하는 통신기술이다. 이는 양자를 관측하면 양자상태가 붕괴된다는 특징을 활용하여 도청자를 손쉽게 발견할 수 있게 한다. 양자난수발생기는 의사난수를 대체할 수 있는 알고리즘으로, 가장 완벽한 난수 장치로 여겨진다. 의사난수는 결정론적 알고리즘이기 때문에 값을 예측할 수 있는 반면, 양자난수는 자연 현상에서 뽑아내는 난수이기 때문에 예측할 수 없다. 다만 수학적 연산을 통해 계산하는 의사난수와는 다르게 양자난수는 난수를 추출할 장치가 필요하다. 본 고에서는 양자암호통신과 양자난수발생기의 최신 동향에 대해 확인해 보도록 한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.07a
• /
• pp.652-655
• /
• 2020

최근 딥 러닝을 이용해 기계로 인간을 대체하는 스마트 팩토리에 대한 연구 및 개발이 활발히 진행되고 있다. 그러나 FPCB를 Placing하는 방법에 기계를 도입하는 과정은 발전이 더딘 상태이다. 현재 로봇 팔을 이용해 Placing하는 방법은 사람이 직접 로봇 팔을 튜닝해 사용하고 있다. 이에 본 논문은 딥 러닝을 이용한 영상처리 기법을 활용해 FPCB를 사람의 개입 없이 트레이에 삽입하는 기법을 개발하였다. 이를 위해 여러 알고리즘을 비교한 후 각각의 장단점을 고려해 적합한 알고리즘을 제시하였다. 본 논문에서 제시하는 기법은 FPCB에 아무 행동을 가하지 않으며, 힘 센서, 깊이 센서 등 기타 센서들의 도움 없이 RGB 센서(카메라)를 통해 획득한 이미지만을 이용해 자동화가 가능하다. 또한, 개발 단계에서 실제 기계를 이용해 이미지 촬영, 이동 등을 진행했기 때문에 조명, 로봇 팔 위치 등 알고리즘 외 조건들에 영향을 받지 않고 실제 사용이 가능하다.

• Journal of KIISE:Software and Applications
• /
• v.36 no.7
• /
• pp.560-570
• /
• 2009

RFID, Radio Frequency Identification, is a technology of automated identification replacing bar-code. RFID technology has advantages that it recognizes fast and it is strong to contamination using wireless communication. However, there are difficult problems that should be solved for popularization of RFID. Among of these, tag anti-collision problem is dealed in this paper. It affected the performance of RFID system directly. This paper analyzes conventional algorithms and proposes new algorithms of tag anti-collision. The algorithm proposed was composed of appropriate properties to each phase of distribution and recognition as hybrid between ALOHA-based algorithm and QT-based algorithm. At phase of distribution, the number of tags recognizing at a frame was reduced using ALOHA-based algorithm. It addressed the delay problem because of deep depth of tree. At phase of recognition, it solved ALOHA-based chronic problem that couldn't recognize all the tags sometimes. Moreover, QTR algorithm that recognize by reversed tag IDs was adopted for the performance. The FQTR algorithm proposed in this paper showed brilliant performance as compared with convention algorithms by simulation.

• Journal of IKEEE
• /
• v.19 no.2
• /
• pp.193-200
• /
• 2015

In this paper, we propose the radiation measuring algorithm and the device composition using CMOS image sensor. The radiation measuring algorithm using CMOS image sensor is based on the radiation particle distinguishing algorithm projected to the CMOS image sensor and accumulated and average number of pixels of the radiation particles projected to dozens of images per second with CMOS image sensor. The radiation particle distinguishing algorithm projected to the CMOS image sensor measures the radiation particle images by dividing them into R, G and B and adjusting the threshold value that distinguishes light intensity and background from the particle of each image. The radiation measuring algorithm measures radiation with accumulated and average number of radiation particles projected to dozens of images per second with CMOS image sensor according to the preset cycle. The hardware devices to verify the suggested algorithm consists of CMOS image sensor and image signal processor part, control part, power circuit part and display part. The test result of radiation measurement using the suggested CMOS image sensor is as follows. First, using the low-cost CMOS image sensor to measure radiation particles generated similar characteristics to that from measurement with expensive GM Tube. Second, using the low-cost CMOS image sensor to measure radiation presented largely similar characteristics to the linear characteristics of expensive GM Tube.

• Journal of Digital Contents Society
• /
• v.13 no.1
• /
• pp.75-81
• /
• 2012

SSDs(Solid State Drives) have many attractive features such as high performance, low power consumption, shock resistance, and low weight, so they replace HDDs to a certain extent. An SSD has FTL(Flash Translation Layer) which emulate block storage devices like HDDs. A garbage collection, one of major functions of FTL, effects highly on the performance and the lifetime of SSDs. However, there is no de facto standard for new garbage collection algorithms. To solve this problem, we propose trace driven offline optimal algorithms for garbage collection of FTL. The proposed algorithm always guarantees minimal number of erase operation. In addition, we verify our proposed algorithm using TPC trace.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.2.1-2
• /
• 2003

WLAN의 매체 특성상 AP beacon영역 내의 모든 STA들은 다른 STA의 송수신 데이터 내용에 접근할 수 있다. 따라서 상호 또는 그룹 간의 데이터프라이버시와 상호인증 서비스는 무선 랜의 중요한 이슈중의 하나이다. 무선랜을 통한 네트워크 접속 보안으로는 사용자와 AP 사이의 무선 접속구간 보안과 AP와 AS사이의 유선 구간 보안으로 정의되며, 상대적으로 취약한 무선 구간 보안이 초점이 된다. 현재 무선 구간 보안에는 WEP이 사용된다. 그러나 WEP 방식은 WEP 키와 IV 크기가 작고, 노출된 공유키를 사용하며, 암호 알고리즘(RC4)와 무결성 알고리즘(CRC-32)이 근본적으로 취약하다. 이러한 문제에 대한 해결 방법으로 IEEE 802.11i는 두 가지 접근 방식을 채택하였다. 하나는 WEP의 보안 문제점을 소프트웨어적으로 개선한 TKIP이고 다른 하나는 기존의 WEP과는 하드웨어적으로 상이한 AES을 기반으로 한 CCMP이다. 이 논문에서는 각 알고리즘에 대한 키의 흐름 및 그 안전성을 분석하였다. 이러한 방법을 통해 WEP 구조의 보안상의 취약점을 확인하고, TKIP이 WEP을 대체할 수 있을 만큼의 안전성을 갖는지를 검증한다. 또한 고려될 수 있는 공격 모델을 제시하고, 이에 대하여 알고리즘에 부가적으로 요구되는 보완점에 대해 논한다.

• The Journal of the Acoustical Society of Korea
• /
• v.8 no.4
• /
• pp.65-73
• /
• 1989

In this paper, we propose a text-independent speaker identification algorithm based on VQ(vector quantization) and vowel classification, and its performance is studied and compared with that of a conventional speaker identification algorithm using VQ. The proposed speaker identification algorithm is composed of three processes: vowel segmentation, vowel recognition and average distortion calculation. The vowel segmentation is performed automatlcally using RMS energy, BTR(Back-to-Total cavity volume Ratio)and SFBR(Signed Front-to-Back maximum area Ratio) extracted from input speech signal. If the Input speech signal Is noisy, particularity when the SNR is around 20dB, the proposed speaker identification algorithm performs better than the reference speaker identification algorithm when the correct vowel segmentation is done. The same result is obtained when we use the noisy telephone speech signal as an input, too.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.9
• /
• pp.96-105
• /
• 2015

This paper proposes a DSP optimization solution of rain detection and removal algorithm. We propose rain detection and removal algorithms considering camera motion, and also presents optimization results in algorithm level and DSP level. At algorithm level, this paper utilizes a block level binary pattern analysis, and reduces the operation time by using the fast motion estimation algorithm. Also, the algorithm is optimized at DSP level through inter memory optimization, EDMA, and software pipelining for real-time operation. Experiment results show that the proposed algorithm is superior to the other algorithms in terms of visual quality as well as processing speed.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1116-1120
• /
• 2010

In this paper we present two refined neighbor selection algorithms for recommender systems and also show how the attributes of the items can be used for higher prediction quality. The refined neighbor selection algorithms adopt the transitivity-based neighbor selection method using virtual neighbors and alternate neighbors, respectively. The experimental results show that the recommender systems with the proposed algorithms outperform other systems and they can overcome the large scale dataset problem as well as the first rater problem without deteriorating prediction quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.205-214
• /
• 1997

In this paper, we suggest a cache mechanism to improve the speed fo query processing in distributed directory environment. For this, request and result and result about objects in remote site are store in the cache of local site. A cache mechanism developed through six phases; 1) Cached information which stored in distributed directory system is classified as application data, system data and meta data. 2) Cache system architecture is designed according to classified information. 3) Cache schema are designed for each cache information. 4) Least-TTL algorithms which use the weighted value of geograpical information and access frquency for replacements are developed for datacaches(application cache, system cache). 5) Operational algorithms are developed for meta data cache which has meta data tree. This tree is based on the information of past queries and improves the speed ofquery processing by reducing the scope of search space. 6) Finally, performance evaluations are performed by comparing with proposed cache mechanism and other mechanisms.