• Title/Summary/Keyword: implementation algorithm

Search Result 4,233, Processing Time 0.03 seconds

High-Speed Implementation and Efficient Memory Usage of Min-Entropy Estimation Algorithms in NIST SP 800-90B (NIST SP 800-90B의 최소 엔트로피 추정 알고리즘에 대한 고속 구현 및 효율적인 메모리 사용 기법)

  • Kim, Wontae;Yeom, Yongjin;Kang, Ju-Sung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.1
    • /
    • pp.25-39
    • /
    • 2018
  • NIST(National Institute of Standards and Technology) has recently published SP 800-90B second draft which is the document for evaluating security of entropy source, a key element of a cryptographic random number generator(RNG), and provided a tool implemented on Python code. In SP 800-90B, the security evaluation of the entropy sources is a process of estimating min-entropy by several estimators. The process of estimating min-entropy is divided into IID track and non-IID track. In IID track, the entropy sources are estimated only from MCV estimator. In non-IID Track, the entropy sources are estimated from 10 estimators including MCV estimator. The running time of the NIST's tool in non-IID track is approximately 20 minutes and the memory usage is over 5.5 GB. For evaluation agencies that have to perform repeatedly evaluations on various samples, and developers or researchers who have to perform experiments in various environments, it may be inconvenient to estimate entropy using the tool and depending on the environment, it may be impossible to execute. In this paper, we propose high-speed implementations and an efficient memory usage technique for min-entropy estimation algorithm of SP 800-90B. Our major achievements are the three improved speed and efficient memory usage reduction methods which are the method applying advantages of C++ code for improving speed of MultiMCW estimator, the method effectively reducing the memory and improving speed of MultiMMC by rebuilding the data storage structure, and the method improving the speed of LZ78Y by rebuilding the data structure. The tool applied our proposed methods is 14 times faster and saves 13 times more memory usage than NIST's tool.

A Comparison between Multiple Satellite AOD Products Using AERONET Sun Photometer Observations in South Korea: Case Study of MODIS,VIIRS, Himawari-8, and Sentinel-3 (우리나라에서 AERONET 태양광도계 자료를 이용한 다종위성 AOD 산출물 비교평가: MODIS, VIIRS, Himawari-8, Sentinel-3의 사례연구)

  • Kim, Seoyeon;Jeong, Yemin;Youn, Youjeong;Cho, Subin;Kang, Jonggu;Kim, Geunah;Lee, Yangwon
    • Korean Journal of Remote Sensing
    • /
    • v.37 no.3
    • /
    • pp.543-557
    • /
    • 2021
  • Because aerosols have different spectral characteristics according to the size and composition of the particle and to the satellite sensors, a comparative analysis of aerosol products from various satellite sensors is required. In South Korea, however, a comprehensive study for the comparison of various official satellite AOD (Aerosol Optical Depth) products for a long period is not easily found. In this paper, we aimed to assess the performance of the AOD products from MODIS (Moderate Resolution Imaging Spectroradiometer), VIIRS (Visible Infrared Imaging Radiometer Suite), Himawari-8, and Sentinel-3 by referring to the AERONET (Aerosol Robotic Network) sun photometer observations for the period between January 2015 and December 2019. Seasonal and geographical characteristics of the accuracy of satellite AOD were also analyzed. The MODIS products, which were accumulated for a long time and optimized by the new MAIAC (Multiangle Implementation of Atmospheric Correction) algorithm, showed the best accuracy (CC=0.836) and were followed by the products from VIIRS and Himawari-8. On the other hand, Sentinel-3 AOD did not appear to have a good quality because it was recently launched and not sufficiently optimized yet, according to ESA (European Space Agency). The AOD of MODIS, VIIRS, and Himawari-8 did not show a significant difference in accuracy according to season and to urban vs. non-urban regions, but the mixed pixel problem was partly found in a few coastal regions. Because AOD is an essential component for atmospheric correction, the result of this study can be a reference to the future work for the atmospheric correction for the Korean CAS (Compact Advanced Satellite) series.

Real-time Travel Time Estimation Model Using Point-based and Link-based Data (지점과 구간기반 자료를 활용한 실시간 통행시간 추정 모형)

  • Yu, Jeong-Whon
    • International Journal of Highway Engineering
    • /
    • v.10 no.1
    • /
    • pp.155-164
    • /
    • 2008
  • It is critical to develop a core ITS technology such as real-time travel time estimation in order that the efficient use of the ITS implementation can be achieved as the ITS infrastructure and relevant facilities are broadly installed in recent years. The provision of travel time information in real-time allows travellers to make informed decisions and hence not only the traveller's travel utilities but also the road utilization can be maximized. In this paper, a hybrid model is proposed to combine VDS and AVI which have different characteristics in terms of space and time dimensions. The proposed model can incorporate the immediacy of VDS data and the reality of AVI data into one single framework simultaneously. In addition, the solution algorithm is made to have no significant computational burden so that the model can be deployable in real world. A set of real field data is used to analyze the reliability and applicability of the proposed model. The analysis results suggest that the proposed model is very efficient computationally and improves the accuracy of the information provided, which demonstrates the real-time applicability of the proposed model. In particular, the data fusion methodology developed in this paper is expected to be used more widely when a new type of traffic data becomes available.

  • PDF

Design and Implementation of Web Interworking Learning System Using VoiceXML (VoiceXML을 이용한 Web 연동 학습 시스템 설계 및 구현)

  • Kim Dong-Hyun;Cho Chang-Su;Shin Jeong-Hoon;Hong Kwang-Seok
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.2 s.302
    • /
    • pp.21-30
    • /
    • 2005
  • Development of both multimedia technology and communication network technology has accomplished many changes through the field of learning system. For the construction of a more efficient and clever learning system there is a research being done by the use of the Web and the telephone network. But until now, the case of current implemented teaming system is single system and so it has each merits and demerits. That is to say, when we use the learning system through the Web, the demerit is only possible by the static states using computer. For those who do not use the computer, the demerit is that the user must learn the use of the new system. Also, the case of using telephone network has merits that one can use the system anyplace, anytime by the telephone. But it has the problem of not being able to transmit information very efficiently. From these, this paper proposes the learning system that can be used efficiently and conveniently anyplace, anytime by connecting both telephone network and web. Also, we propose a new algorithm of user ID, password and name registration function using teaming system using VoiceXML and individual learning progress save function using VoiceXML and web.

Design of a Bit-Level Super-Systolic Array (비트 수준 슈퍼 시스톨릭 어레이의 설계)

  • Lee Jae-Jin;Song Gi-Yong
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.12
    • /
    • pp.45-52
    • /
    • 2005
  • A systolic array formed by interconnecting a set of identical data-processing cells in a uniform manner is a combination of an algorithm and a circuit that implements it, and is closely related conceptually to arithmetic pipeline. High-performance computation on a large array of cells has been an important feature of systolic array. To achieve even higher degree of concurrency, it is desirable to make cells of systolic array themselves systolic array as well. The structure of systolic array with its cells consisting of another systolic array is to be called super-systolic array. This paper proposes a scalable bit-level super-systolic amy which can be adopted in the VLSI design including regular interconnection and functional primitives that are typical for a systolic architecture. This architecture is focused on highly regular computational structures that avoids the need for a large number of global interconnection required in general VLSI implementation. A bit-level super-systolic FIR filter is selected as an example of bit-level super-systolic array. The derived bit-level super-systolic FIR filter has been modeled and simulated in RT level using VHDL, then synthesized using Synopsys Design Compiler based on Hynix $0.35{\mu}m$ cell library. Compared conventional word-level systolic array, the newly proposed bit-level super-systolic arrays are efficient when it comes to area and throughput.

A Study on the Rejection Capability Based on Anti-phone Modeling (반음소 모델링을 이용한 거절기능에 대한 연구)

  • 김우성;구명완
    • The Journal of the Acoustical Society of Korea
    • /
    • v.18 no.3
    • /
    • pp.3-9
    • /
    • 1999
  • This paper presents the study on the rejection capability based on anti-phone modeling for vocabulary independent speech recognition system. The rejection system detects and rejects out-of-vocabulary words which were not included in candidate words which are defined while the speech recognizer is made. The rejection system can be classified into two categories by their implementation methods, keyword spotting method and utterance verification method. The keyword spotting method uses an extra filler model as a candidate word as well as keyword models. The utterance verification method uses the anti-models for each phoneme for the calculation of confidence score after it has constructed the anti-models for all phonemes. We implemented an utterance verification algorithm which can be used for vocabulary independent speech recognizer. We also compared three kinds of means for the calculation of confidence score, and found out that the geometric mean had shown the best result. For the normalization of confidence score, usually Sigmoid function is used. On using it, we compared the effect of the weight constant for Sigmoid function and determined the optimal value. And we compared the effects of the size of cohort set, the results showed that the larger set gave the better results. And finally we found out optimal confidence score threshold value. In case of using the threshold value, the overall recognition rate including rejection errors was about 76%. This results are going to be adapted for stock information system based on speech recognizer which is currently provided as an experimental service by Korea Telecom.

  • PDF

Edge Grouping and Contour Detection by Delaunary Triangulation (Delaunary 삼각화에 의한 그룹화 및 외형 탐지)

  • Lee, Sang-Hyun;Jung, Byeong-Soo;Jeong, Je-Pyong;Kim, Jung-Rok;Moon, Kyung-li
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.135-142
    • /
    • 2013
  • Contour detection is important for many computer vision applications, such as shape discrimination and object recognition. In many cases, local luminance changes turn out to be stronger in textured areas than on object contours. Therefore, local edge features, which only look at a small neighborhood of each pixel, cannot be reliable indicators of the presence of a contour, and some global analysis is needed. The novelty of this operator is that dilation is limited to Deluanary triangular. An efficient implementation is presented. The grouping algorithm is then embedded in a multi-threshold contour detector. At each threshold level, small groups of edges are removed, and contours are completed by means of a generalized reconstruction from markers. Both qualitative and quantitative comparison with existing approaches prove the superiority of the proposed contour detector in terms of larger amount of suppressed texture and more effective detection of low-contrast contour.

Implementation of Agricultural Multi-UAV System with Distributed Swarm Control Algorithm into a Simulator (분산군집제어 알고리즘 기반 농업용 멀티 UAV 시스템의 시뮬레이터 구현)

  • Ju, Chanyoung;Park, Sungjun;Son, Hyoung Il
    • Proceedings of the Korean Society for Agricultural Machinery Conference
    • /
    • 2017.04a
    • /
    • pp.37-38
    • /
    • 2017
  • 최근 방제 및 예찰과 같은 농작업에 단일 UAV(Unmanned Aerial Vehicle)시스템이 적용되고 있지만, 가반하중과 체공시간 등 기존시스템의 문제가 점차 대두되면서 작업 시간을 보다 단축시키고 작업 효율을 극대화 할 수 있는 농업용 멀티 UAV시스템의 필요성이 증대되고 있다. 본 논문에서는 작업자가 다수의 농업용 UAV를 효과적으로 제어할 수 있는 분산군집제어 알고리즘을 제안하며 알고리즘 검증 및 평가를 위한 시뮬레이터를 소개한다. 분산군집제어는 UAV 제어 계층, VP(Virtual Point) 제어 계층, 원격제어 계층으로 이루어진 3계층 제어구조를 가진다. UAV 제어 계층에서 각 UAV는 point mass로 모델링 되는 VP의 이상적인 경로를 추종하도록 제어한다. VP 제어 계층에서 각 VP는 입력 $p_i(t)=u^c_i+u^o_i+u^{co}_i+u^h_i$-(1)을 받아 제어되는데 여기서, $u^c_i{\in}{\mathbb{R}}^3$는 VP 사이의 충돌방지제어, $u^o_i{\in}{\mathbb{R}}^3$는 장애물과의 충돌방지제어, $u^{co}_i{\in}{\mathbb{R}}^3$는 UAV 상호간의 협조제어, $u^h_i{\in}{\mathbb{R}}^3$는 작업자로부터의 원격제어명령이다. (1)의 제어입력에서 충돌방지제어는 각 $u^i_c:=-{\sum\limits_{j{\in}{\eta}_i}}{\frac {{\partial}{\phi}_{ij}^c({\parallel}p_i-p_j{\parallel})^T}{{\partial}p_i}}$-(2), $u^o_c:=-{\sum\limits_{r{\in}O_i}}{\frac {{\partial}{\phi}_{ir}^o({\parallel}p_i-p^o_r{\parallel})^T}{{\partial}p_i}}$-(3)로 정의되면 ${\phi}^c_{ij}$${\phi}^o_{ir}$는 포텐셜 함수를 나타낸다. 원격제어 계층에서 작업자는 햅틱 인터페이스를 통해 VP의 속도를 제어하게 된다. 이때 스케일변수 ${\lambda}$에 대하여 VP의 원격제어명령은 $u^t_i(t)={\lambda}q(t)$로 정의한다. UAV 시뮬레이터는 리눅스 환경에서 ROS(Robot Operating Systems)를 기반한 3차원 시뮬레이터인 Gazebo상에 구축하였으며, 마스터와 슬레이브 간의 제어 명령은 TCPROS를 통해 서로 주고받는다. UAV는 PX4 기반의 3DR Solo 모델을 사용하였으며 MAVROS를 통해 MAVLink 통신 프로토콜에 접속하여 UAV의 고도, 속도 및 가속도 등의 상태정보를 받을 수 있다. 현재 멀티 드론 시스템을 Gazebo 환경에 구축하였으며, 추후 시뮬레이터 상에 분산군집제어 알고리즘을 구현하여 검증 및 평가를 진행하고자 한다.

  • PDF

Design and Implementation of a Metadata Structure for Large-Scale Shared-Disk File System (대용량 공유디스크 파일 시스템에 적합한 메타 데이타 구조의 설계 및 구현)

  • 이용주;김경배;신범주
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.1
    • /
    • pp.33-49
    • /
    • 2003
  • Recently, there have been large storage demands for manipulating multimedia data. To solve the tremendous storage demands, one of the major researches is the SAN(Storage Area Network) that provides the local file requests directly from shared-disk storage and also eliminates the server bottlenecks to performance and availability. SAN also improve the network latency and bandwidth through new channel interface like FC(Fibre Channel). But to manipulate the efficient storage network like SAN, traditional local file system and distributed file system are not adaptable and also are lack of researches in terms of a metadata structure for large-scale inode object such as file and directory. In this paper, we describe the architecture and design issues of our shared-disk file system and provide the efficient bitmap for providing the well-formed block allocation in each host, extent-based semi flat structure for storing large-scale file data, and two-phase directory structure of using Extendible Hashing. Also we describe a detailed algorithm for implementing the file system's device driver in Linux Kernel and compare our file system with the general file system like EXT2 and shard disk file system like GFS in terms of file creation, directory creation and I/O rate.

Application of OGC WPS 2.0 to Geo-Spatial Web Services (공간정보 웹 서비스에서 OGC WPS 2.0 적용)

  • YOON, Goo-Seon;LEE, Ki-Won
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.19 no.3
    • /
    • pp.16-28
    • /
    • 2016
  • Advancing geo-spatial web technologies and their applications require compatible and interoperable heterogeneous browsers and platforms. Reduction of common or supporting components for web-based system development is also necessary. If properly understood and applied, OGC-based standards can be utilized as effective solutions for these problems. Thus, OGC standards are central to the design and development of web-based geo-spatial systems, and are particularly applicable to web services, which contain data processing modules. However, the application for OGC WPS 2.0 is at an early stage as compared with other OGC standards; thus, this study describes a test implementation of a web-based geo-spatial processing system with OGC WPS 2.0 focused on asynchronous processing functionality. While a binary thresholding algorithm was tested in this system, further experiments with other processing modules can be performed on requests for many types of processing from multiple users. The client system of the implemented product was based on open sources such as jQuery and OpenLayers, and server-side running on Spring framework also used various types of open sources such as ZOO project, and GeoServer. The results of geo-spatial image processing by this system implies further applicability and extensibility of OGC WPS 2.0 on user interfaces for practical applications.