• Title/Summary/Keyword: Error Recovery System

Search Result 179, Processing Time 0.028 seconds

CHART PARSER FOR ILL-FORMED INPUT SENTENCES (잘못 형성된 입력문장에 대한 CHART PARSER)

  • KyonghoMin
    • Korean Journal of Cognitive Science
    • /
    • v.4 no.1
    • /
    • pp.177-212
    • /
    • 1993
  • My research is based on the parser for ill-formed input by Mellish in a paper in ACL 27th meeting Proceedings. 1989. My system is composed of two parsers:WFCP and IFCP. When WFCP fails to give the parse tree for the input sentence, the sentence is identified as ill-formed and is parsed by IFCP for error detection and recovery at the syntactic level. My system is indendent of grammatical rules. It does not take into account semantic ill-formedness. My system uses a grammar composed of 25 context-free rules. My system consistes of two major parsing strategies:top-down expection and bottem-up satisfaction. With top-down expectation. rules are retrieved under the inference condition and expaned by inactive arcs. When doing bottom-up parsing. my parser used two modes:Left-Right parsing and Right-to-Left parsing. My system repairs errors sucessfully when the input contains an omitted word or an unknown word substitued for a valid word. Left- corner and right-corner errors are more easily detected and repaired than ill-formed senteces where the error is in teh middle. The deviance note. with repair details, is kept in new inactive arcs which are generated by the error correction procedure. The implementation of my system is quite different from Mellish's. When rules are invoked. my system invokes all rules with minimal inference. My bottom up parsing strategy uses Left-to-Right mode and Right-to-Left mode. My system is bottom-up-parsing-oriented like the chart parser. Errors are repaired in two ways:using top-down hypothesis, and using Need-Chart which keeps the information of expectation and complection of expanded goals by rules. To reduce the number of top-down cycles. all rules are invoked simultaneously and this invocation information is kept in Need-Chart. This idea will be extended for the implementation of multiple error recovery system.

Design of the Kernel Hardening Function for Stability the Linux Operating System (리눅스 운영체제 안정화를 위한 커널 하드닝 기능 설계)

  • Jang Seung-Ju
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.6
    • /
    • pp.1333-1340
    • /
    • 2005
  • This paper is based on the study to reduce a system panic state. A panic state could be caused by a programmer or an administrator's careless mistake. The proposed hardening Operating System of this paper stops the process which is running in the kernel with an error. The error process for the value type and the address type of a certain variable have to be restored. Installed with kernel hardening, Operating System checks the recovery possibility of the process first and then restores the process which can be recovered. When it is possible to recover the kernel code with an error, it is to be recovered in ASSERT() function.

Design and Characterization of a 10 Gb/s Clock and Data Recovery Circuit Implemented with Phase-Locked Loop

  • Song, Jae-Ho;Yoo, Tae-Whan;Ko, Jeong-Hoon;Park, Chang-Soo;Kim, Jae-Keun
    • ETRI Journal
    • /
    • v.21 no.3
    • /
    • pp.1-5
    • /
    • 1999
  • A clock and data recovery circuit with a phase-locked loop for 10 Gb/s optical transmission system was realized in a hybrid IC form. The quadri-correlation architecture is used for frequency-and phase-locked loop. A NRZ-to-PRZ converter and a 360 degree analogue phase shifter are included in the circuit. The jitter characteristics satisfy the recommendations of ITU-T. The capture range of 150 MHz and input voltage sensitivity of 100 mVp-p were showed. The temperature compensation characteristics were tested for the operating temperature from -10 to $60^{\circ}C$ and showed no increase of error. This circuit was adopted for the 10 Gb/s transmission system through a normal single-mode fiber with the length of 400 km and operated successfully.

  • PDF

Synthesis of Deadlock-Free Ladder Diagrams for PLCs Based on Deadlock Detection and.Recovery (DDR) Algorithm (DDR 알고리즘에 기반한 교착상태배제 래더 다이어그램 설계)

  • Cha, Jong-Ho;Cho, Kwang-Hyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.8
    • /
    • pp.706-712
    • /
    • 2002
  • In general, a deadlock in flexible manufacturing systems (FMSs) is caused by a resource limitation and the diversity of routings. However, the deadlock of industrial controllers such as programmable logic controllers (PLCs) can occur from different causes compared with those in general FMSs. The deadlock of PLCs is usually caused by an error signal between PLCs and manufacturing systems. In this paper, we propose a deadlock detection and recovery (DDR) algorithm to resolve the deadlock problem of PLCs at design stage. This paper employs the MAPN (modified automation Petri net), MTPL (modified token passing logic), and ECC (efficient code conversion) algorithm to model manufacturing systems and to convert a Petri net model into a desired LD (ladder diagram). Finally, an example of manufacturing systems is provided to illustrate the proposed DDR algorithm.

Development of A Recovery-algorithm of False-Positive Mail based on the Property of the Privacy (Privacy 속성 기반의 오인된 메일 복구 알고리즘 개발)

  • Seo, Sang-Jjin;Park, Noh-Kyung;Jin, Hyun-Joon
    • Journal of IKEEE
    • /
    • v.9 no.2 s.17
    • /
    • pp.108-114
    • /
    • 2005
  • While E-mail has become an important way of communications in IT societies, it creates various social problems due to increase of spam mails. Even though many organizations and corperations have been doing researches to develop spam mail blocking technologies, more cost and system complexities are required because of varieties of blocking technologies. In case of adopting spam blocking technologies, system reliability largely relies on the False-positive error rate with the order of employing spam blocking filters. In this paper, a False-positive mail recovery technique based on privacy information is proposed and implemented in order to improve the reliability of spam locking filters. Through the implemented prototype, recovery procedure for False-positive mails is verified and the results are summarized and analyzed.

  • PDF

TRV analysis by using multi - port equivalent (다 단자망 축약 이론을 이용한 TRV 해석)

  • Yoon, Jae-Young;Moon, Young-Hyun;Park, Dong-Wook
    • Proceedings of the KIEE Conference
    • /
    • 1988.11a
    • /
    • pp.236-240
    • /
    • 1988
  • The simplified equivalent by using the short circuit impedance has been used for analyzing the prospective transient recovery voltage of the large power system. But it sometimes generates untorelable error in the rate-of-rise of TRV when using the Thevenin equivalent source. This paper provides the new equivalent by using the multi-port theory. The application of the new method to the sample system gives satisfactory accuracy compared with the short-circuit equivalent.

  • PDF

Performance Analysis of Symbol Timing Recovery for 16QAM System in Rayleigh Fading (레일리 페이딩 환경에서 16QAM 시스템에서 심볼 타이밍 복원의 성능분석)

  • 문재경;김영수;김창주
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.7 no.3
    • /
    • pp.201-210
    • /
    • 1996
  • In this paper, we analyzed performance of a symbol timing recovery scheme for 16QAM Radio system. As a symbol timing recovery scheme, both maximum amplitude method(MAM) and wave difference method(WDM) are analyzed employing a pulse shaping filter, such as raised cosine filter(RCF) and nonlinear filter(NLF). Simulation result shows that the jitter performance of MAM or WDM using NLF is better than that using square root RCF. In order to estimate and compensate for the Rayleigh fading PSAM(Pilot Symbol Assisted Modulation) and space diversity are also employed. Consequently, BER performance of about $10^{-4}$ is obtained for $E_b/N_o$= 20 dB.

  • PDF

Multiple Description Coding using Unequal MDSQ in Wavelet Domain

  • Yoon, Eung-Sik;Park, Kwang-Pyo;Lee, Keun-Young
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.281-284
    • /
    • 2002
  • Error resilience for image coding is an important component of multimedia communication system. Error resilience schemes address loss recovery from the compression perspective. Multiple description coding (MDC) is one of the error resilience techniques promising for robust video transmission. It is the way to achieve tradeoff description such as scalar quantization, correlating transform and the quantized frame expansion. In this paper, we consider Multiple Description Scalar Quantization (MDSQ) to wavelet domain. Conventional MDSQ schemes considered description with equal weights in each sub-bands. But, we can see that the each sub-bands is unequal contribution to whole image quality. Therefore, we experiment the multiple design MDSQ table to make probability of zero index high, which gives high efficiency in arithmetic symbol coder. We also compare our proposed method with the conventional methods and show improved performance in terms of redundancy-rate-distortion.

  • PDF

Efficient and Secure Routing Protocol forWireless Sensor Networks through SNR Based Dynamic Clustering Mechanisms

  • Ganesh, Subramanian;Amutha, Ramachandran
    • Journal of Communications and Networks
    • /
    • v.15 no.4
    • /
    • pp.422-429
    • /
    • 2013
  • Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

Fast Structure Recovery and Integration using Improved Scaled Orthographic Factorization (개선된 직교분해기법을 사용한 빠른 구조 복원 및 융합)

  • Park, Jong-Seung;Yoon, Jong-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.3
    • /
    • pp.303-315
    • /
    • 2007
  • This paper proposes a 3D structure recovery and registration method that uses four or more common points. For each frame of a given video, a partial structure is recovered using tracked points. The 3D coordinates, camera positions and camera directions are computed at once by our improved scaled orthographic factorization method. The partially recovered point sets are parts of a whole model. A registration of point sets makes the complete shape. The recovered subsets are integrated by transforming each coordinate system of the local point subset into a common basis coordinate system. The process of shape recovery and integration is performed uniformly and linearly without any nonlinear iterative process and without loss of accuracy. The execution time for the integration is significantly reduced relative to the conventional ICP method. Due to the fast recovery and registration framework, our shape recovery scheme is applicable to various interactive video applications. The processing time per frame is under 0.01 seconds in most cases and the integration error is under 0.1mm on average.

  • PDF