• Title/Summary/Keyword: 양자컴퓨팅

Search Result 90, Processing Time 0.026 seconds

Semiconductor Technology Trends and Implications of AMD (AMD의 반도체 기술 동향 및 시사점)

  • Chun, H.S.;Kim, H.T.;Roh, T.M.
    • Electronics and Telecommunications Trends
    • /
    • v.37 no.2
    • /
    • pp.62-72
    • /
    • 2022
  • AMD is an American fabless semiconductor company that designs CPUs, GPUs, FPGAs, and APUs. AMD is competing with Intel with its Ryzen CPUs and Nvidia with its Radeon GPUs. Since 2008, production has been consigned to TSMC, concentrating on semiconductor design. AMD is releasing various new products through continuous R&D which is the basis for its growth. AMD stock have recorded the highest rise among global semiconductor companies as sales and operating profit soared due to the strong sales of new products.

Color Similarity for Clothes using Non-Parametric Clustering (비모수적 클러스터링을 이용한 의상 색상 유사도)

  • Ju, Hyungdon;Hong, Min;Cho, We-Duke;Choi, Yoo-Joo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.11a
    • /
    • pp.193-196
    • /
    • 2007
  • 본 논문은 비모수적 클러스터링 기법을 이용하여 다양한 조명에 노출된 의상들의 색상 유사성을 안정적으로 판단하는 방법을 제안한다. 색상 유사성 판별을 위하여 기존에 대표적으로 사용되어왔던 히스토그램 인터섹션이나 누적 히스토그램 방법은 조명 변화에 민감하게 반응하여, 동일한 의상 색상이라 할지라도 서로 다른 조명환경에서는 서로 상이한 색상 판별 결과를 나타낸다. 본 논문에서는 조명에 의한 영향을 줄이고, 색상 자체의 분포 특성을 분석하기 위하여 조명조건의 변화에도 일관된 특성을 유지하는 색도와 채도 컬러 성분에 대한 분포 특성을 비모수적 클러스터링 기법을 적용하여 분석한다. 실험 결과 제안기법은 동일한 의상 쌍과 상이한 의상 쌍에 대하여 구분을 지을 수 있는 양자화의 특성이 뚜렷하게 표현되었다.

Analyzing Cryptographic Agility with Service Mesh on Cloud-Native Environment (클라우드 네이티브 환경에서 서비스 메시를 활용한 암호화 민첩성 분석)

  • Hohyeon Cha;Jaehyun Nam
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2024.05a
    • /
    • pp.116-117
    • /
    • 2024
  • 최근 마이크로서비스 아키텍처가 널리 채택되면서 다양한 애플리케이션들이 클라우드 네이티브 환경에서 운영되기 시작하였다. 그리고 이러한 서비스의 보안을 강화하기 위해 서비스 메시를 활용하여 클라우드 서비스 간의 암호화 통신을 구현하였다. 하지만, 양자 컴퓨팅의 등장과 함께 기존 암호화 방식이 취약해질 수 있다는 가능성이 제시되었다. 이에, 클라우드 네이티브 환경에서도 암호화 기술이 빠르게 변화할 수 있는 유연성, 즉 암호화 민첩성(Cryptography Agility)의 중요성이 강조되고 시작하였다. 본 연구에서는 서비스 메시 환경에서 암호화 민첩성을 실현하는데 있어 현 서비스 메시 솔루션들이 직면한 구조적 한계를 분석하고 이에 대한 해결 방안을 제시하고자 한다. 특히, 대표적인 서비스 메시 솔루션인 Istio 에 초점을 맞추어 암호화 민첩성을 향상시키기 위한 개선 방향을 제안하고자 한다.

  • PDF

An Effective Control of Network Traffic using RTCP for Transmitting Video Streaming Data (비디오 스트리밍 데이타 전송시 RTCP를 이용한 효율적인 네트워크 트래픽 제어)

  • Park, Dae-Hoon;Hur, Hye-Sun;Hong, Youn-Sik
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.3
    • /
    • pp.328-335
    • /
    • 2002
  • When we want to transfer video streaming data through computer networks, we will have to be allocated a larger bandwidth compared to a general application. In general, it causes a serious network overload inevitably due to the limited bandwidth. In this paper, in order to resolve the problem, we haute taken a method for transmitting video streaming data using RTP and RTCP. With RR(Receiver Report) packet in RTCP we will test it to check whether the traffic in a network has occurred or not. If it happened, we haute tried to reduce the overall network traffic by dynamically changing the quantization factor of the Motion JPEG that is one of the encoding styles in JMF. When the ratio of the average of transmission for each session to the average of overall transmission is greater than 7%, we should adjust the amount of data to be transmitted for each session to reach the session mean values. The experimental results show that the proposed method taken here reduces the overload effectively and therefore improves the efficiency for transmitting video streaming data.

Implementation of FPGA-based Accelerator for GRU Inference with Structured Compression (구조적 압축을 통한 FPGA 기반 GRU 추론 가속기 설계)

  • Chae, Byeong-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.6
    • /
    • pp.850-858
    • /
    • 2022
  • To deploy Gate Recurrent Units (GRU) on resource-constrained embedded devices, this paper presents a reconfigurable FPGA-based GRU accelerator that enables structured compression. Firstly, a dense GRU model is significantly reduced in size by hybrid quantization and structured top-k pruning. Secondly, the energy consumption on external memory access is greatly reduced by the proposed reuse computing pattern. Finally, the accelerator can handle a structured sparse model that benefits from the algorithm-hardware co-design workflows. Moreover, inference tasks can be flexibly performed using all functional dimensions, sequence length, and number of layers. Implemented on the Intel DE1-SoC FPGA, the proposed accelerator achieves 45.01 GOPs in a structured sparse GRU network without batching. Compared to the implementation of CPU and GPU, low-cost FPGA accelerator achieves 57 and 30x improvements in latency, 300 and 23.44x improvements in energy efficiency, respectively. Thus, the proposed accelerator is utilized as an early study of real-time embedded applications, demonstrating the potential for further development in the future.

Multi-layer Structure Based QCA Half Adder Design Using XOR Gate (XOR 게이트를 이용한 다층구조의 QCA 반가산기 설계)

  • Nam, Ji-hyun;Jeon, Jun-Cheol
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.3
    • /
    • pp.291-300
    • /
    • 2017
  • Quantum-dot cellular automata(QCA) is a computing model designed to be similar to cellular automata, and an alternative technology for next generation using high performance and low power consumption. QCA is undergoing various studies with recent experimental results, and it is one of the paradigms of transistors that can solve device density and interconnection problems as nano-unit materials. An XOR gate is a gate that operates so that the result is true when either one of the logic is true. The proposed XOR gate consists of five layers. The first layer consists of OR gates, the third and fifth layers consist of AND gates, and the second and fourth layers are designed as passages in the middle. The half adder consists of an XOR gate and an AND gate. The proposed half adder is designed by adding two cells to the proposed XOR gate. The proposed half adder consists of fewer cells, total area, and clock than the conventional half adder.

Analysis on Lightweight Methods of On-Device AI Vision Model for Intelligent Edge Computing Devices (지능형 엣지 컴퓨팅 기기를 위한 온디바이스 AI 비전 모델의 경량화 방식 분석)

  • Hye-Hyeon Ju;Namhi Kang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.1
    • /
    • pp.1-8
    • /
    • 2024
  • On-device AI technology, which can operate AI models at the edge devices to support real-time processing and privacy enhancement, is attracting attention. As intelligent IoT is applied to various industries, services utilizing the on-device AI technology are increasing significantly. However, general deep learning models require a lot of computational resources for inference and learning. Therefore, various lightweighting methods such as quantization and pruning have been suggested to operate deep learning models in embedded edge devices. Among the lightweighting methods, we analyze how to lightweight and apply deep learning models to edge computing devices, focusing on pruning technology in this paper. In particular, we utilize dynamic and static pruning techniques to evaluate the inference speed, accuracy, and memory usage of a lightweight AI vision model. The content analyzed in this paper can be used for intelligent video control systems or video security systems in autonomous vehicles, where real-time processing are highly required. In addition, it is expected that the content can be used more effectively in various IoT services and industries.

Human Action Recognition by Inference of Stochastic Regular Grammars (확률적 정규 문법 추론법에 의한 사람 몸동작 인식)

  • Cho, Kyung-Eun;Cho, Hyung-Je
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.3
    • /
    • pp.248-259
    • /
    • 2001
  • This paper proposes a human action recognition scheme to recognize nonverbal human communications automatically. Based on the principle that a human body action can be defined as a combination of multiple articulation movements, we use the method of inferencing stochastic grammars to understand each human actions. We measure and quantize each human action in 3D world-coordinate, and make two sets of 4-chain-code for xy and zy projection plane. Based on the fact that the neighboring information among articulations is an essential element to distinguish actions, we designed a new stochastic inference procedure to apply the neighboring information of hands. Our proposed scheme shows better recognition rate than that of other general stochastic inference procedures. ures.

  • PDF

Secure NTRU-based Authentication and Key Distribution Protocol in Quantum Computing Environments (양자 컴퓨팅 환경에 안전한 NTRU 기반 인증 및 키 분배 프로토콜)

  • Jeong, SeongHa;Lee, KyungKeun;Park, YoungHo
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.8
    • /
    • pp.1321-1329
    • /
    • 2017
  • A quantum computer, based on quantum mechanics, is a paradigm of information processing that can show remarkable possibilities of exponentially improved information processing. This paradigm can be solved in a short time by calculating factoring problem and discrete logarithm problem that are typically used in public key cryptosystems such as RSA(Rivest-Shamir-Adleman) and ECC(Elliptic Curve Cryptography). In 2013, Lei et al. proposed a secure NTRU-based key distribution protocol for quantum computing. However, Lei et al. protocol was vulnerable to man-in-the-middle attacks. In this paper, we propose a NTRU(N-the truncated polynomial ring) key distribution protocol with mutual authentication only using NTRU convolution multiplication operation in order to maintain the security for quantum computing. The proposed protocol is resistant to quantum computing attacks. It is also provided a secure key distribution from various attacks such as man-in-the middle attack and replay attack.

An enhanced method using NP-complete problem in Public Key Cryptography System (NP-complete 문제를 이용한 공개키 암호 시스템 개선)

  • Baek, Jaejong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.12
    • /
    • pp.2865-2870
    • /
    • 2015
  • Recently, due to the hardware computing enhancement such as quantum computers, the amount of information that can be processed in a short period of time is growing exponentially. The cryptography system proposed by Koblitz and Fellows has a problem that it can not be guaranteed that the problem finding perfect dominating set is NP-complete in specific 3-regular graphs because the number of invariant polynomial can not be generated enough. In this paper, we propose an enhanced method to improve the vulnerability in 3-regular graph by generating plenty of invariant polynomials.