• Journal of Digital Convergence
• /
• v.11 no.7
• /
• pp.173-184
• /
• 2013

Quantum Information Processing and Communication, based on the physical laws of Quantum mechanics, exploits fundamentally new modes of computation and communication and holds the promise of immense computing power beyond the capabilities of any classical computer. In Quantum Information Processing, replacing bits with qubits, one makes two-state quantum systems that do not possess in general the definite values of 0 or 1 of classical bits, but rather are in a so-called. "coherent superposition", of the two. Full exploitation of this additional freedom implies that new processing devices need to be designed and implemented, and that a large scale quantum computer can in principle be built. New discoveries will enable a range of exciting new possibilities including: greatly improved sensors with potential impact for mineral exploration and improved medical imaging and a revolutionary new computational paradigm that will likely lead to the creation of computing devices capable of efficiently solving problems that cannot be solved on a classical computer. In short, Quantum computing is an economy game changer, with a potential of disrupting entire industries and creating new ones.

• Journal of Digital Convergence
• /
• v.12 no.9
• /
• pp.139-151
• /
• 2014

Quantum information and communication technology(QICT) holds out tremendous promise for efficiently solving some of the most difficult problems that are intractable on any present or future conventional computer. QICT is one of the most active research areas of modern science, attracting substantial funding that supports research groups at internationally leading academic institutions. To facilitate the progress of QICT research towards the commercialization, a roadmap needs to be formulated, providing some direction for the field with specific technical goals and elucidating interrelationships between approaches for synergistic solutions to obstacles within any one approach. In this paper, we suggest a brief version of roadmap for QICT research and give a discussion about the potential contribution of QICT in Korea industry.

• The Proceedings of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.11 no.4
• /
• pp.100-108
• /
• 1997

A combined buck and boost push-pull quantum series resonant rectifier(PPQSRR) is newly proposed to achieve a power factor correction without start-up inrush current. Based on the developed dynamic modeling of the proposed rectifier, an inrush current elimination control technique is proposed and the usefullness of the proposed rectifier and control method are verified by computer simulation and experimental results. With the proposed control method, a high power factor and wide range of output voltage can be obtained.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.232-235
• /
• 2023

ICT 기술과 IoT 기술의 급속한 발전으로 인해 인간은 네트워크와 밀접한 관계를 형성하며 이를 통해 다양한 서비스를 경험하고 있다. 그러나 ICT 기술의 발전과 함께 사이버 공격의 급증으로 인해 네트워크 보안에 대한 필요성이 대두되고 있다. 또한 양자 컴퓨팅을 활용한 다양한 공격은 기존 암호화 체계를 무너뜨려 빠른 대응 및 솔루션이 필요하다. 양자 기반 공격으로부터 안전한 네트워크 환경을 구축하기 위해 양자 키 분배 시스템 및 양자 내성 암호가 활발히 연구되고 있으며 NIST 에서 발표한 양자 내성 암호화 기법의 성능, 취약점, 실제 네트워크 상의 구현 가능성, 향후 발전 방향 등 다각적 관점에서 연구 및 분석이 진행되고 있다. 본 논문에서는 양자 기반 공격에 대해 설명하고 양자 내성 암호화 기법의 연구 동향에 대해 분석한다. 또한, 양자 중첩, 양자 불확실성 등 양자의 물리적 성질을 활용함으로써 양자 공격으로 부터 안정성을 제공할 수 있는 양자 키 분배 기법에 대해 설명한다.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.1
• /
• pp.21-27
• /
• 2020

In this paper, a hybrid scheduling algorithm is proposed for CMS(Combat Management System) to improve QoS(Quality of Service) based on DWDRR(Dynamic Weighted Deficit Round Robin) and priority-based scheduling method. The main proposed scheme, DWDRR is method of packet transmission through giving weight by traffic of queue and priority. To demonstrate an usefulness of proposed algorithm through simulation, efficiency in special section of the proposed algorithm is proved. Therefore, We propose hybrid algorithm between existing algorithm and proposed algorithm. Also, to prevent frequent scheme conversion, a hysteresis method is applied. The proposed algorithm shows lower packet loss rate and delay in the same traffic than existing algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.367-379
• /
• 1994

This paper describes scheduling algorithms of the UNIX operating system and shows an analytical approach to approximate the average conditional response time for a process in the UNIX operating system. The average conditional response time is the average time between the submittal of a process requiring a certain amount of the CPU time and the completion of the process. The process scheduling algorithms in thr UNIX system are based on the priority service disciplines. That is, the behavior of a process is governed by the UNIX process schuduling algorithms that (ⅰ) the time-shared computer usage is obtained by allotting each request a quantum until it completes its required CPU time, (ⅱ) the nonpreemptive switching in system mode and the preemptive switching in user mode are applied to determine the quantum, (ⅲ) the first-come-first-serve discipline is applied within the same priority level, and (ⅳ) after completing an allotted quantum the process is placed at the end of either the runnable queue corresponding to its priority or the disk queue where it sleeps. These process scheduling algorithms create the round-robin effect in user mode. Using the round-robin effect and the preemptive switching, we approximate a process delay in user mode. Using the nonpreemptive switching, we approximate a process delay in system mode. We also consider a process delay due to the disk input and output operations. The average conditional response time is then obtained by approximating the total process delay. The results show an excellent response time for the processes requiring system time at the expense of the processes requiring user time.