• Title/Summary/Keyword: conditional code

Search Result 35, Processing Time 0.025 seconds

Recognition of Passports using CDM Masking and ART2-based Hybrid Network

  • Kim, Kwang-Baek;Cho, Jae-Hyun;Woo, Young-Woon
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.213-217
    • /
    • 2008
  • This paper proposes a novel method for the recognition of passports based on the CDM(Conditional Dilation Morphology) masking and the ART2-based RBF neural networks. For the extraction of individual codes for recognizing, this paper targets code sequence blocks including individual codes by applying Sobel masking, horizontal smearing and a contour tracking algorithm on the passport image. Individual codes are recovered and extracted from the binarized areas by applying CDM masking and vertical smearing. This paper also proposes an ART2-based hybrid network that adapts the ART2 network for the middle layer. This network is applied to the recognition of individual codes. The experiment results showed that the proposed method has superior in performance in the recognition of passport.

ECM and GLR Based Multiuser Detection with I-CSI

  • Maio Antonio De;Episcopo Roberto;Lops Marco
    • Journal of Communications and Networks
    • /
    • v.7 no.1
    • /
    • pp.29-35
    • /
    • 2005
  • This paper deals with the problem of multiuser detection over a direct-sequence code-division multiple access (DS-CDMA) channel with incomplete channel state informations (I-CSI). We devise and assess two novel recursive detectors based on the expectation conditional maximization (ECM) algorithm and the generalized likelihood ratio (GLR) principle, respectively. Both receivers entail an affordable computational complexity. Moreover, the performance assessment, conducted via Monte Carlo techniques, shows that they achieve satisfactory performance levels and outperform linear detectors.

CCDP Evaluation of the Eire Area of NPPs Using Eire Model CEAST (화재모델 CFAST를 이용한 원전 화재구역의 CCDP평가)

  • Lee Yoon-Hwan;Yang Joon-Eon;Kim Jong-Hoon;Noh Sam-Kyu
    • Fire Science and Engineering
    • /
    • v.18 no.4
    • /
    • pp.64-71
    • /
    • 2004
  • This paper describes the result of the pump room fire analysis of the nuclear power plant using CFAST fire modeling code developed by NIST. The sensitivity studies are performed over the input parameters of CFAST: the constrained or unconstrained fire, Lower Oxygen Limit (LOL), Radiative Fraction (RF), and the opening ratio of the fire doors. According to the results, a pump room fire is the ventilation-controlled fire, so it is adequate that the value of LOL is 10% which is also the default value. It is anlayzed that the Radiative Fraction does not affect the temperature of the upper gas layer. It is appeared that the integrity of the cable located at the upper layer is maintained except for the safety pump at the fire area and the Conditional Core Damage Probability (CCDP) is 9.25E-07. It seems that CCDP result is more realistic and less uncertain than that of Fire Hazard Analysis (FHA).

Branch Prediction in Multiprogramming Environment (멀티프로그래밍 환경에서의 분기 예측)

  • Lee, Mun-Sang;Gang, Yeong-Jae;Maeng, Seung-Ryeol
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.9
    • /
    • pp.1158-1165
    • /
    • 1999
  • 조건부 분기 명령어(conditional branch instruction)의 잘못된 분기 예측(branch misprediction)은 프로세서의 성능 향상에 심각한 장애 요인이 되고 있다. 특히 시분할(time-sharing) 시스템과 같이 문맥 교환(context switch)이 발생하는 멀티프로그래밍 환경(multiprogramming environment)에서는 더욱 낮은 분기 예측 정확성(branch prediction accuracy)을 보인다. 본 논문에서는 문맥 교환이 발생하는 멀티프로그래밍 환경에서 높은 분기 예측 정확성을 보이는 중첩 분기 예측표 교환(Overlapped Predictor Table Switch, OPTS) 기법을 소개한다. 분기 예측표(predictor table)를 분할하여 각각의 프로세스(process)에 할당하는 OPTS 기법은 문맥 교환의 영향을 최소화함으로써 높은 분기 예측 정확성을 유지하는 분기 예측 방법이다.Abstract There is wide agreement that one of the most important impediments to the performance of current and future pipelined superscalar processors is the presence of conditional branches in the instruction stream. Accurate branch prediction is required to overcome this performance limitation. Many branch predictors have been proposed to help to alleviate this problem, including the two-level adaptive branch predictor, and more recently, hybrid branch predictor. In a less idealized environment, such as a time-sharing system, code of interest involves context switches. Context switches, even at fairly large intervals, can seriously degrade the performance of many of the most accurate branch prediction schemes. In this study, we measure the effect of context switch on the branch prediction accuracy in various situation and show the feasibility of our new mechanism, OPTS(Overlapped Predictor Table Switch), which save and restore branch history table at every context switch.

Design and Implementation of On-Board Control System (위성 운용을 위한 On-Board Control System 설계 및 구현)

  • Shin, Hyun-Kyu
    • Aerospace Engineering and Technology
    • /
    • v.13 no.1
    • /
    • pp.86-95
    • /
    • 2014
  • For the accomplishment of satellite's own missions, complicated control procedures and commands are required. Although absolute-Time Command and Command Sequences have been applied for controlling satellite and its operation historically, these command system only has a capability to manage sequential control process and has a limitation that cannot deal with decision and branch for corresponding to the condition of the time. To resolve above limitation, KARI has designed RTCSC which is mainly based on the existing RTCS but adopts a one-byte Op Code for supporting decision making and conditional branch. This paper introduces the design and implementation of RTCSC as On-Board Control System like OBCP, VML and IP.

Real-time BCC Volume Isosurface Ray Casting on the GPU (GPU를 이용한 실시간 BCC 볼륨 등가면 레이 캐스팅)

  • Kim, Minho;Lee, Young-Joon
    • Journal of the Korea Computer Graphics Society
    • /
    • v.18 no.4
    • /
    • pp.25-34
    • /
    • 2012
  • This paper presents a real-time GPU (graphics processing unit) ray casting scheme for rendering isosurfaces of BCC (body-centered cubic) volume datasets. A quartic spline field is built using the 7-direction box-spline filter accompanied with a quasi-interpolation prefilter. To obtain an interactive rendering speed on the graphics hardware, the shader code was optimized to avoid lookup table and conditional branches and to minimize data fetch overhead. Compared to previous implementations, our work outperforms the comparable one by more than 20% and the rendering quality is superior than others.

Efficient Correlation Channel Modeling for Transform Domain Wyner-Ziv Video Coding (Transform Domain Wyner-Ziv 비디오 부호를 위한 효과적인 상관 채널 모델링)

  • Oh, Ji-Eun;Jung, Chun-Sung;Kim, Dong-Yoon;Park, Hyun-Wook;Ha, Jeong-Seok
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.3
    • /
    • pp.23-31
    • /
    • 2010
  • The increasing demands on low-power, and low-complexity video encoder have been motivating extensive research activities on distributed video coding (DVC) in which the encoder compresses frames without utilizing inter-frame statistical correlation. In DVC encoder, contrary to the conventional video encoder, an error control code compresses the video frames by representing the frames in the form of syndrome bits. In the meantime, the DVC decoder generates side information which is modeled as a noisy version of the original video frames, and a decoder of the error-control code corrects the errors in the side information with the syndrome bits. The noisy observation, i.e., the side information can be understood as the output of a virtual channel corresponding to the orignal video frames, and the conditional probability of the virtual channel model is assumed to follow a Laplacian distribution. Thus, performance improvement of DVC systems depends on performances of the error-control code and the optimal reconstruction step in the DVC decoder. In turn, the performances of two constituent blocks are directly related to a better estimation of the parameter of the correlation channel. In this paper, we propose an algorithm to estimate the parameter of the correlation channel and also a low-complexity version of the proposed algorithm. In particular, the proposed algorithm minimizes squared-error of the Laplacian probability distribution and the empirical observations. Finally, we show that the conventional algorithm can be improved by adopting a confidential window. The proposed algorithm results in PSNR gain up to 1.8 dB and 1.1 dB on Mother and Foreman video sequences, respectively.

Compiler Analysis Framework Using SVM-Based Genetic Algorithm : Feature and Model Selection Sensitivity (SVM 기반 유전 알고리즘을 이용한 컴파일러 분석 프레임워크 : 특징 및 모델 선택 민감성)

  • Hwang, Cheol-Hun;Shin, Gun-Yoon;Kim, Dong-Wook;Han, Myung-Mook
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.4
    • /
    • pp.537-544
    • /
    • 2020
  • Advances in detection techniques, such as mutation and obfuscation, are being advanced with the development of malware technology. In the malware detection technology, unknown malware detection technology is important, and a method for Malware Authorship Attribution that detects an unknown malicious code by identifying the author through distributed malware is being studied. In this paper, we try to extract the compiler information affecting the binary-based author identification method and to investigate the sensitivity of feature selection, probability and non-probability models, and optimization to classification efficiency between studies. In the experiment, the feature selection method through information gain and the support vector machine, which is a non-probability model, showed high efficiency. Among the optimization studies, high classification accuracy was obtained through feature selection and model optimization through the proposed framework, and resulted in 48% feature reduction and 53 faster execution speed. Through this study, we can confirm the sensitivity of feature selection, model, and optimization methods to classification efficiency.

Algorithm for Functional and Declarative Language in Parallel Machine (Parallel Machine에 있어서의 Functional, Declarative 언어의 Algorithm)

  • Kim, Jin-Su
    • The Journal of Natural Sciences
    • /
    • v.5 no.2
    • /
    • pp.39-43
    • /
    • 1992
  • Detection of parallelism by a compiler is very desirable from a user's point of view. However, even the most sophisticated techniques to detect parallelism trip on trivial impediments, such as conditionals, function calls, and input/output statements, fail to detect most of the parallelism present in a program. Some parallelizing compilers provide feedback to the user when they have difficulty in deciding about parallel execution. Under these circumstances, a programmer has to restructure the source code to aid the detection of parallelism. But, functional and declarative languages can be said to offer many advantages in this context. Functional programs are easier to reason about because their output is determinate, that is, independent of the order of evaluation. However, functional languages traditionally have lacked good facilities for manipulating arrays and matrices. In this paper, a declarative language called Id has been proposed as a solution to some of these problems.

  • PDF

The fGARCH(1, 1) as a functional volatility measure of ultra high frequency time series (함수적 변동성 fGARCH(1, 1)모형을 통한 초고빈도 시계열 변동성)

  • Yoon, J.E.;Kim, Jong-Min;Hwang, S.Y.
    • The Korean Journal of Applied Statistics
    • /
    • v.31 no.5
    • /
    • pp.667-675
    • /
    • 2018
  • When a financial time series consists of daily (closing) returns, traditional volatility models such as autoregressive conditional heteroskedasticity (ARCH) and generalized ARCH (GARCH) are useful to figure out daily volatilities. With high frequency returns in a day, one may adopt various multivariate GARCH techniques (MGARCH) (Tsay, Multivariate Time Series Analysis With R and Financial Application, John Wiley, 2014) to obtain intraday volatilities as long as the high frequency is moderate. When it comes to the ultra high frequency (UHF) case (e.g., one minute prices are available everyday), a new model needs to be developed to suit UHF time series in order to figure out continuous time intraday-volatilities. Aue et al. (Journal of Time Series Analysis, 38, 3-21; 2017) proposed functional GARCH (fGARCH) to analyze functional volatilities based on UHF data. This article introduces fGARCH to the readers and illustrates how to estimate fGARCH equations using UHF data of KOSPI and Hyundai motor company.