• Title/Summary/Keyword: 연산 효율

Search Result 2,622, Processing Time 0.03 seconds

Adaptive Foveated Ray Tracing Based on Time-Constrained Rendering for Head-Mounted Display (헤드 마운티드 디스플레이를 위한 시간 제약 렌더링을 이용한 적응적 포비티드 광선 추적법)

  • Kim, Youngwook;Ihm, Insung
    • Journal of the Korea Computer Graphics Society
    • /
    • v.28 no.3
    • /
    • pp.113-123
    • /
    • 2022
  • Ray tracing-based rendering creates by far more realistic images than the traditional rasterization-based rendering. However, it is still burdensome when implemented for a Head-Mounted Display (HMD) system that demands a wide field of view and a high display refresh rate. Furthermore, for presenting high-quality images on the HMD screen, a sufficient number of ray sampling should be carried out per pixel to alleviate visually annoying spatial and temporal aliases. In this paper, we extend the recent selective foveated ray tracing technique by Kim et al. [1], and propose an improved real-time rendering technique that realizes the rendering effect of the classic Whitted-style ray tracing on the HMD system. In particular, by combining the ray tracing hardware-based acceleration technique and time-constrained rendering scheme, we show that fast HMD ray tracing is possible that is well suited to human visual systems.

Approximate Multiplier with High Density, Low Power and High Speed using Efficient Partial Product Reduction (효율적인 부분 곱 감소를 이용한 고집적·저전력·고속 근사 곱셈기)

  • Seo, Ho-Sung;Kim, Dae-Ik
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.4
    • /
    • pp.671-678
    • /
    • 2022
  • Approximate computing is an computational technique that is acceptable degree of inaccurate results of accurate results. Approximate multiplication is one of the approximate computing methods for high-performance and low-power computing. In this paper, we propose a high-density, low-power, and high-speed approximate multiplier using approximate 4-2 compressor and improved full adder. The approximate multiplier with approximate 4-2 compressor consists of three regions of the exact, approximate and constant correction regions, and we compared them by adjusting the size of region by applying an efficient partial product reduction. The proposed approximate multiplier was designed with Verilog HDL and was analyzed for area, power and delay time using Synopsys Design Compiler (DC) on a 25nm CMOS process. As a result of the experiment, the proposed multiplier reduced area by 10.47%, power by 26.11%, and delay time by 13% compared to the conventional approximate multiplier.

Storm sewer network simplification technique for improving efficiency of urban flood forecasting (도시침수예측 효율 향상을 위한 관망간소화 기법 제시)

  • Sang Bo Sim;Hyung-Jun Kim
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2023.05a
    • /
    • pp.269-269
    • /
    • 2023
  • 기후 변화로 인한 강우 패턴의 변화는 도심지 방재성능 목표를 상회하는 홍수로 이어져 침수피해를 가중시키고 있다. 이로 인한 도시침수 피해를 저감하기 위하여 도시침수 예측모형 개발이 활발히 이루어지고 있으나, 대규모 관망으로 이루어진 복잡한 도심지 우수관망을 모의하기 때문에 분석속도가 느려 실시간 예측 적용에 한계점이 있다. 도시침수 분석에 가장 많이 활용되는 대표적인 모형인 SWMM(Storm Water Management Model)은 복잡한 관망을 비교적 빠르고 정확히 해석할 수 있어 유용하지만, 이 또한 대도심의 우수관망 모의 시 많은 시간이 소요되며, 관망 정밀도 기준이 정의되어 있지 않아 분석에 어려움이 있다. 이러한 문제점을 해결하기 위하여 본 연구에서는 관망 간소화 기법(유역면적의 밀도, 관거 직경, 관로의 길이 등)을 적용하고, 이에 따른 주요 지선과 간선의 수위 변화와 침수흔적도를 비교하여 분석결과의 정확성을 담보하는 관망 간소화 수준을 파악하고 도시침수 분석 시 적정 간소화 기준과 자동 간소화 방안을 제시하고자 한다. 도시침수 분석 시 우수관망 자동 간소화를 위하여 Python을 활용한 코드를 작성하였으며, SWMM의 .inp 파일을 읽어들여 Dataframe형태로 저장한 후 분석을 위한 데이터 가공, 간소화 기준에 따른 분류, 간소화 대상 수리·수문인자 연산, 인접 간선에 연결, 간소화된 .inp파일 저장의 총 6단계로 구성하였다. 연구 대상지역은 도림천 유역으로 설정하였으며, 초기자료는 맨홀 30,469, 관거 32,443, 소유역 30,586개로 이루어져 있으며, 모의 시간은 약 2시간 30분이 소요되었다. 유역면적 100x100 미만을 대상으로 수행 시 맨홀 9,965, 관거 10,464, 소유역 9,240개로 관거의 복잡도가 약 1/3 감소하였으며, 모의 시간은 약 43분으로 기존대비 약 72% 단축되는 것으로 나타났다. 실제 침수가 발생한 주요지점들을 비교한 결과 R2 0.85 ~ 0.92로 예측모형의 정확도에 큰 영향을 끼치지 않는 것으로 나타났다. 도시침수모형 최적 간소화를 통해 모형의 복잡성을 줄이고, 계산량을 줄여 모형의 수행시간을 단축시킬 수 있으며, 불필요한 우수관망을 제거하거나 병합함으로써, 모형의 예측력 향상과 분석과 해석에 효율적으로 사용될 수 있을 것으로 기대한다.

  • PDF

Privacy-Preserving Cryptographic API Misuse Detection Framework Using Homomorphic Encryption (동형 암호를 활용한 프라이버시 보장 암호화 API 오용 탐지 프레임워크)

  • Seungho Kim;Hyoungshick Kim
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.34 no.5
    • /
    • pp.865-873
    • /
    • 2024
  • In this study, we propose a privacy-preserving cryptographic API misuse detection framework utilizing homomorphic encryption. The proposed framework is designed to effectively detect cryptographic API misuse while maintaining data confidentiality. We employ a Convolutional Neural Network (CNN)-based detection model and optimize its structure to ensure high accuracy even in an encrypted environment. Specifically, to enable efficient homomorphic operations, we leverage depth-wise convolutional layers and a cubic activation function to secure non-linearity, enabling effective misuse detection on encrypted data. Experimental results show that the proposed model achieved a high F1-score of 0.978, and the total execution time for the homomorphically encrypted model was 11.20 seconds, demonstrating near real-time processing efficiency. These findings confirm that the model offers excellent security and accuracy even when operating in a homomorphic encryption environment.

Construction of an Efficient Overlay Multicast for Multi-layer (다중 계층을 위한 효율적 오버레이 멀티 캐스트)

  • Lee, Bum-Jae;Kim, Young-Sam;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.521-524
    • /
    • 2008
  • MANET이 유연성 있고, 자유로운 네트워크로서 주목 받아감에 따라 MANET에서의 Routing 알고리즘이 중요한 논점이 되고 있다. 특히 MANET에서 각 Node에 대한 관리 방법은 향후 차세대 네트워크의 중요한 부분으로 인식되고 있다. 본 논문에서 제안하는 오버레이 멀티캐스트 Routing 알고리즘은 각 Node의 오버레이 ID 생성과 유지 및 전송에 관한 알고리즘으로 MANET의 여러 가지 제한 조건 및 환경에 따라 유연성 있게 작용하므로, 현재 많은 연구가 이루어지고 있다. 그러나 기존의 오버레이 멀티캐스트는 일반적인 단일 레이어로 이루어진 Cluster에 한하여 그 알고리즘을 적용하고 있으며, Cluster의 구성 및 유지 또한 Node의 속성 구분에 따른 에너지 등을 고려하지 않고 있다. 본 논문에서 제안하는 EOMM(Efficient Overlay Multicast for Multi-layer)은 오버레이 멀티캐스트를 다중 계층 구조 기반 Cluster에서 적용하였다. 또한 Node의 속성 정보를 고려하여 Clustering 알고리즘인 TICC을 지원하여, Masking 연산을 통하여, 처리속도를 향상시켰다. 그 결과 Routing delay와 packet 증가률을 감소시켜 성능을 향상시켰다.

  • PDF

Effects of the crucible shape on the temperature of sapphire crystal and the shape of melt/crystal interface in heat exchanger method (열교환법에서 도가니 형상 변화가 사파이어 결정 온도와 고/액 계면 형태에 미치는 영향)

  • 임수진;왕종회;임종인
    • Journal of the Korean Crystal Growth and Crystal Technology
    • /
    • v.14 no.4
    • /
    • pp.155-159
    • /
    • 2004
  • Numerical analysis which is based on finite element techniques, implicit Euler method and frontal solving algorithm was performed to study the effects of the crucible shape on the temperature of sapphire crystal and the shape of the melt/crystal interface in heat exchanger method. The computer simulation described here and effective to solving the heat transport phenomena with the transition of the interface shape from hemispherical to planar. In the work, various crucibles with differently shaped corners at their bottom are considered to improve the deflection of the melt/crystal interface. The shape of the crucible should be considered as one of the variables for the process optimization.

An Efficient Architecture Exploration Method for Optimal ASIP Design (Application에 최적의 ASIP 설계를 위한 효율적인 Architecture Exploration 방법)

  • Lee, Sung-Rae;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.913-921
    • /
    • 2007
  • Retargetable compiler which generates executable code for a target processor and performance profiler are required to design a processor optimized for a specific application. This paper presents an architecture exploration methodology based on ADL (Architecture Description Language). We synthesized instruction set and optimized processor structure using information extracted from application program. The information of operation sequences executed frequently and register usage are used for processor optimization. Architecture exploration has been performed for JPEG encoder to show the effectiveness of the system. The ASIP designed using the proposed method shows 1.97 times better performance.

Optical System Implementation of OFB Block Encryption Algorithm (OFB 블록 암호화 알고리즘의 광학적 시스템 구현)

  • Gil, Sang-Keun
    • Journal of IKEEE
    • /
    • v.18 no.3
    • /
    • pp.328-334
    • /
    • 2014
  • This paper proposes an optical encryption and decryption system for OFB(Output Feedback Block) encryption algorithm. The proposed scheme uses a dual-encoding technique in order to implement optical XOR logic operation. Also, the proposed method provides more enhanced security strength than the conventional electronic OFB method due to the huge security key with 2-dimensional array. Finally, computer simulation results of encryption and decryption are shown to verify the proposed method, and hence the proposed method makes it possible to implement more effective and stronger optical block encryption system with high-speed performance and the benefits of parallelism.

Timestamp based Key Exchange Protocol for Satellite Access Network (위성환경에서의 Timestamp 기반 키 교환 프로토콜)

  • Song, In-A;Lee, Young-seok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.2
    • /
    • pp.162-170
    • /
    • 2016
  • The key exchange protocols are very important to provide the secure communication in broadband satellite access network. However key exchange protocol of ETSI(European Telecommunications Standards Institute) is vulnerable to man-in-the-middle-attack by using Diffie-Hellman algorithm. And the key exchange protocol using certification is not useful in satellite environment. We propose the key exchange protocol using Timestamp which have the resistant to man-in-the-middle-attack. Proposed protocol is able to prevent the man-in-the-middle-attack by calculated time value. Also showing experiment results, we prove that proposed protocol improve memory usage, communication amount and calculation amount than other protocols.

Shadow Region Detection Using Color Properties (컬러 특성을 이용한 그림자 영역 검출)

  • Hwang Dong-Kuk;Choi Dong-Jin;Lee Woo-Ram;Park Hee-Jung;Jun Byung-Min;Lee Sang-Ju
    • The Journal of the Korea Contents Association
    • /
    • v.5 no.4
    • /
    • pp.103-110
    • /
    • 2005
  • In this paper, we present a shadow detection algorithm using the shadow features which appear in color images. Shadow regions have lower luminance and saturation than those of nearby regions, and is generally shown as dark colors. The regions are detected by means of analysing and applying their properties to images represented as the HSI color model. The proposed algorithm is consisted of two steps: at the first step, the candidate regions of shadow are found with using shadow features, and then, real shadow regions are detected only in candidate regions by using their information to reduce real objects and dark marks. The experimental results show that the algorithm is effective.

  • PDF