• Title/Summary/Keyword: Amount of Information

Search Result 7,015, Processing Time 0.032 seconds

Improved Decoding Algorithm on Reed-Solomon Codes using Division Method (제산방법에 의한 Reed-Solomon 부호의 개선된 복호알고리듬)

  • 정제홍;박진수
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.11
    • /
    • pp.21-28
    • /
    • 1993
  • Decoding algorithm of noncyclic Reed-Solomon codes consists of four steps which are to compute syndromes, to find error-location polynomial, to decide error-location, and to solve error-values. There is a decoding method by which the computation of both error-location polynomial and error-evaluator polynimial can be avoided in conventional decoding methods using Euclid algorithm. The disadvantage of this method is that the same amount of computation is needed that is equivalent to solve the avoided polynomial. This paper considers the division method on polynomial on GF(2$^{m}$) systematically. And proposes a novel method to find error correcting polynomial by simple mathematical expression without the same amount of computation to find the two avoided polynomial. Especially. proposes the method which the amount of computation to find F (x) from the division M(x) by x, (x-1),....(x--${\alpha}^{n-2}$) respectively can be avoided. By applying the simple expression to decoding procedure on RS codes, propses a new decoding algorithm, and to show the validity of presented method, computer simulation is performed.

  • PDF

A Study on Trail Deteriorations and Management in University Forest of Chungnam National University (충남대학교 학술림 산책로 훼손실태 및 관리방안에 관한 연구)

  • Lee, Joon-Woo;Kim, Myeong-Jun;Choi, Yeon-Ho;Jeon, Yong-Jun;Oh, Do-Kyo;Kim, Min-Ho;Lee, So-Yeon;Lee, Kyoung-Hyoung
    • Korean Journal of Agricultural Science
    • /
    • v.31 no.2
    • /
    • pp.87-96
    • /
    • 2004
  • This study concentrates on the trail of the CNU(Chungnam National University) forest. The amount of use and the pattern of damage are considered, as well as the extent of environmental damage. Finally, some managerial strategies are proposed in connection with sustainable maintenance. The trail of the university forest is composed of three sections; one is the neighborhood park and the Institute of Information Technology/Communications, the second is the Institute of Information Technology/Communications and the Dormitory, and the third section is the Dormitory and the Foreign prof's Apt. The total length of the trail is 2.6km. The daily amount of use is 1,269 visitors per day. The amount of using increased three times the amount of that in 1998. This study shows the pattern of damage of the trail in the order of root-exposure, widening, rock-exposure, deepening and the divergence in the frequency of occurrence of all these factors. Environmental damage is also graded thus: grade 3 is 27.4m, grade 4 is 0.8m, grade 5 is 1.5m, and grade 6 is 0.2m. Accordingly, some managerial strategies were proposed in connection with the sustainable trail maintenance.

  • PDF

HRSF: Single Disk Failure Recovery for Liberation Code Based Storage Systems

  • Li, Jun;Hou, Mengshu
    • Journal of Information Processing Systems
    • /
    • v.15 no.1
    • /
    • pp.55-66
    • /
    • 2019
  • Storage system often applies erasure codes to protect against disk failure and ensure system reliability and availability. Liberation code that is a type of coding scheme has been widely used in many storage systems because its encoding and modifying operations are efficient. However, it cannot effectively achieve fast recovery from single disk failure in storage systems, and has great influence on recovery performance as well as response time of client requests. To solve this problem, in this paper, we present HRSF, a Hybrid Recovery method for solving Single disk Failure. We present the optimal algorithm to accelerate failure recovery process. Theoretical analysis proves that our scheme consumes approximately 25% less amount of data read than the conventional method. In the evaluation, we perform extensive experiments by setting different number of disks and chunk sizes. The results show that HRSF outperforms conventional method in terms of the amount of data read and failure recovery time.

Estimation of the Waste Generation in Building Demolition Work using Drone (드론-BIM 기반 건축물 해체공사의 폐기물 발생량 평가)

  • Ryu, Jung Rim;Park, Won-Jun
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2021.05a
    • /
    • pp.309-310
    • /
    • 2021
  • In order to respond to environmental problems and to efficiently recycle resources, it is important to evaluate the amount of construction waste generated. In particular, the estimation of the amount of waste generated in the demolition work was performed based on the basic unit of waste generated per floor area. This study proposes a method using drones as a method for evaluating the amount of demolition waste in a wide area. In the simulated application, the field measurement results and the proposed method were compared, and the effectiveness of the building volume calculation using drones was confirmed. It was confirmed that the building volume can be calculated quickly in the additional pilot application.

  • PDF

Design and Implementation of the Ensemble-based Classification Model by Using k-means Clustering

  • Song, Sung-Yeol;Khil, A-Ra
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.10
    • /
    • pp.31-38
    • /
    • 2015
  • In this paper, we propose the ensemble-based classification model which extracts just new data patterns from the streaming-data by using clustering and generates new classification models to be added to the ensemble in order to reduce the number of data labeling while it keeps the accuracy of the existing system. The proposed technique performs clustering of similar patterned data from streaming data. It performs the data labeling to each cluster at the point when a certain amount of data has been gathered. The proposed technique applies the K-NN technique to the classification model unit in order to keep the accuracy of the existing system while it uses a small amount of data. The proposed technique is efficient as using about 3% less data comparing with the existing technique as shown the simulation results for benchmarks, thereby using clustering.

Cognitive Model-based Evaluation in Dynamic Traffic System (동적 교통 시스템의 인지공학적 평가에 관한 연구)

  • Kang, Myong-Ho;Cha, Woo-Chang
    • Journal of the Ergonomics Society of Korea
    • /
    • v.21 no.3
    • /
    • pp.25-34
    • /
    • 2002
  • The road sign in dynamic traffic system is an important element which affects on human cognitive performance on driving. Web-based vision system simulator was developed to examine the cognition time of the road sign in dynamic environment. This experiment the cognition time of the road sign in dynamic environment. This experiment was designed in with-subject design with two factors: vehicle speed and the amount of information of the traffic sign. It measured the cognition time of the road sign through two evaluation methods: the subjective test with vision system simulator and computational cognitive model. In these two evaluations of human cognitive performance under the dynamic traffic environment, it demonstrated that subject's cognition time was affected by both the amount of information of traffic sign and driving speed.

An Implementation of Single Stack Multi-threading for Small Embedded Systems

  • Kim, Yong-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.4
    • /
    • pp.1-8
    • /
    • 2016
  • In small embedded systems including IoT devices, memory size is very small and it is important to reduce memory amount for execution of application programs. For multi-threaded applications, stack may consume a large amount of memory because each thread has its own stack of sufficiently large size for worst case. This paper presents an implementation of single stack multi-threading, called SSThread (Single Stack Thread), by sharing a stack for all threads to reduce stack memory size. By using SSThread, multi-threaded applications can be programmed based on normal C language environment and there is no requirement of transporting multi-threading operating systems. It consists of several library functions and various C macro definitions. Even though some functional restrictions in comparison to operating systems supporting complete multi-thread functionalities, it is very useful for small embedded systems with tiny memory size and it is simple to setup programming environment for multi-thread applications.

A Corner Matching Algorithm with Uncertainty Handling Capability

  • Lee, Kil-jae;Zeungnam Bien
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.11a
    • /
    • pp.228-233
    • /
    • 1997
  • An efficient corner matching algorithm is developed to minimize the amount of calculation. To reduce the amount of calculation, all available information from a corner detector is used to make model. This information has uncertainties due to discretization noise and geometric distortion, and this is represented by fuzzy rule base which can represent and handle the uncertainties. Form fuzzy inference procedure, a matched segment list is extracted, and resulted segment list is used to calculate the transformation between object of model and scene. To reduce the false hypotheses, a vote and re-vote method is developed. Also an auto tuning scheme of the fuzzy rule base is developed to find out the uncertainties of features from recognized results automatically. To show the effectiveness of the developed algorithm, experiments are conducted for images of real electronic components.

  • PDF

Moments of the ruin time and the total amount of claims until ruin in a diffusion risk process

  • Kim, Jihoon;Ahn, Soohan
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.1
    • /
    • pp.265-274
    • /
    • 2016
  • In this paper, we consider a diffusion risk process, in which, its surplus process behaves like a Brownian motion in-between adjacent epochs of claims. We assume that the claims occur following a Poisson process and their sizes are independent and exponentially distributed with the same intensity. Our main goal is to derive the exact formula of the joint moment generating function of the ruin time and the total amount of aggregated claim sizes until ruin in the diffusion risk process. We also provide a method for computing the related first and second moments using the joint moment generating function and the augmented matrix exponential function.

Design of an Intelligent Controller for Waste Water Heat Pump Recycled Energy Systems

  • Choo, Yeon-Gyu
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.4
    • /
    • pp.375-378
    • /
    • 2011
  • This study is intended to realize an intelligent controller using fuzzy control algorithms in order to recycle energy by recycling the waste water heat discharged by waste water heat collection boilers. Using waste water inflow temperature changes and waste water inflow amount changes as parameters, we present characteristic curves of the number of compressors being operated at fixed speeds and the temperature of hot water being discharged. We propose an intelligent controller that determines the optimum number of compressors being operated at fixed speeds in real time by measuring changes in the temperature and amount of waste water inflows in order to minimize the number of compressors being operated at fixed speeds relative to the waste water load flowing into the waste water heat collection boiler.