• Title/Summary/Keyword: Programming Error

Search Result 273, Processing Time 0.026 seconds

A Message Transfer Scheme for Efficient Message Passing in the Highly Parallel Computer SPAX (고속병렬컴퓨터(SPAX)에서의 효율적인 메시지 전달을 위한 메시지 전송 기법)

  • 모상만;신상석;윤석한;임기욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.9
    • /
    • pp.1162-1170
    • /
    • 1995
  • In this paper, we present a message transfer scheme for efficient message passing in the hierarchically structured multiprocessor computer SPAX(Scalable Parallel Architecture computer based on X-bar network). The message transfer scheme provides interface not only with operating system but also with end users. In order to transfer two types of control message and data message efficiently, it supports both of memory-mapped transfer and DMA-based transfer. Dual-port RAMs are used as message buffers, and control and status registers provide efficient programming interface. Interlaced parity scheme is adopted for error control. If any error is detected at receiving node, errored packet is resent by sender according to retry mechanism. In conjunction with retry mechanism, watchdog timers are used to protect infinite waiting and repeated retry. The proposed message transfer scheme can be applied to input/output nodes and communication connection nodes as well as processing nodes in the SPAX.

  • PDF

COLLISION-FREE TRAJECTRY PLANNING FOR DUAL ROBOT ARMS USING ITERATIVE LEARNING CONCEPT

  • Suh, Il-Hong;Chong, Nak-Young;Choi, Donghun;Shin, Kang-G.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1989.10a
    • /
    • pp.627-634
    • /
    • 1989
  • A collision-free trajectory planning algorithm using the iterative learning concept is proposed for dual robot arms in a 3-D workspace to accurately follow their specified paths with constant velocities. Specifically, a collision-free trajectory minimizing the trajectory error is obtained first by employing the linear programming technique. Then the total operating time is iteratively adjusted based on the maximum trajectory error of the previous iteration so that the collision-free trajectory has no deviation from the specified path and also the operating time is near-minimal.

  • PDF

A THIRD-ORDER VARIANT OF NEWTON-SECANT METHOD FINDING A MULTIPLE ZERO

  • Kim, Young Ik;Lee, Sang Deok
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.23 no.4
    • /
    • pp.845-852
    • /
    • 2010
  • A nonlinear algebraic equation f(x) = 0 is considered to find a root with integer multiplicity $m{\geq}1$. A variant of Newton-secant method for a multiple root is proposed below: for n = 0, 1, $2{\cdots}$ $$x_{n+1}=x_n-\frac{f(x_n)^2}{f^{\prime}(x_n)\{f(x_n)-{\lambda}f(x_n-\frac{f(x_n)}{f^{\prime}(x_n)})\}$$, $$\lambda=\{_{1,\;if\;m=1.}^{(\frac{m}{m-1})^{m-1},\;if\;m{\geq}2$$ It is shown that the method has third-order convergence and its asymptotic error constant is expressed in terms of m. Numerical examples successfully verified the proposed scheme with high-precision Mathematica programming.

Design of Model Predictive Controllers with Velocity and Acceleration Constraints (속도 및 가속도 제한조건을 갖는 모델예측제어기 설계)

  • Park, Jin-Hyun;Choi, Young-Kiu
    • Journal of the Korean Society of Mechanical Technology
    • /
    • v.20 no.6
    • /
    • pp.809-817
    • /
    • 2018
  • The model predictive controller performance of the mobile robot is set to an arbitrary value because it is difficult to select an accurate value with respect to the controller parameter. The general model predictive control uses a quadratic cost function to minimize the difference between the reference tracking error and the predicted trajectory error of the actual robot. In this study, we construct a predictive controller by transforming it into a quadratic programming problem considering velocity and acceleration constraints. The control parameters of the predictive controller, which determines the control performance of the mobile robot, are used a simple weighting matrix Q, R without the reference model matrix $A_r$ by applying a quadratic cost function from which the reference tracking error vector is removed. Therefore, we designed the predictive controller 1 and 2 of the mobile robot considering the constraints, and optimized the controller parameters of the predictive controller using a genetic algorithm with excellent optimization capability.

A Voltage Programming AMOLED Pixel Circuit Compensating Threshold Voltage Variation of n-channel Poly-Si TFTs (n-채널 다결정 실리콘 박막 트랜지스터의 문턱전압 변동 보상을 위한 전압 기입 AMOLED 화소회로)

  • Chung, Hoon-Ju
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.2
    • /
    • pp.207-212
    • /
    • 2013
  • A novel pixel circuit that uses only n-type low-temperature polycrystalline silicon (poly-Si) thin-film transistors (LTPS-TFTs) to compensate the threshold voltage variation of a OLED driving TFT is proposed. The proposed 6T1C pixel circuit consists of 5 switching TFTs, 1 OLED driving TFT and 1 capacitor. When the threshold voltage of driving TFT varies by ${\pm}0.33$ V, Smartspice simulation results show that the maximum error rate of OLED current is 7.05 % and the error rate of anode voltage of OLED is 0.07 % at Vdata = 5.75 V. Thus, the proposed 6T1C pixel circuit can realize uniform output current with high immunity to the threshold voltage variation of poly-Si TFT.

A Two-Step Vertex Selection Method for Minimizing Polygonal Approximation Error (다각형 근사 오차를 최소화하기 위한 2단계 정점 선택 기법)

  • 윤병주;이훈철;고윤호;이시웅;김성대
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.6
    • /
    • pp.114-123
    • /
    • 2003
  • The current paper proposes a new vertex selection scheme for polygon-based contour coding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of "two-step procedure." At first, contour pixels of high curvature value are selected as key vortices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vortices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{max}$$^{*}$). Furthermore, the obtained vortices are adjusted using the dynamic programming (DP) technique to optimal positions in the error area sense. Experimental results are presented to compare the approximation performances of the proposed and conventional methods.imation performances of the proposed and conventional methods.

Contents Scheduling Method for Push-VOD over Terrestrial DTV using Markov-Chain Modeling and Dynamic Programming Approach (마르코프 연쇄 모델링과 동적 계획 기법을 이용한 지상파 DTV 채널에서의 Push-VOD의 콘텐츠 스케줄링 방법)

  • Kim, Yun-Hyoung;Lee, Dong-Jun;Kang, Dae-Kap
    • Journal of Broadcast Engineering
    • /
    • v.15 no.4
    • /
    • pp.555-562
    • /
    • 2010
  • After starting digital terrestrial broadcasting, there have been a number oftrials to provide new services like data broadcasting on a spare bandwidth of a DTV channel. Recently, the Push-VOD service, which provides A/V contents on that bandwidth, gets more attention and is being standardized as NRT(Non-Real-Time) by ATSC. However, it is highly probable that the contents transmitted in this way contain many errors due to the DTV receiving environment. Thus, in order to improve the reliability of transmission, the contents should be transmitted repeatedly several times, considering the unidirectional property of DTV terrestrial network. In this paper, we propose a method to calculate the optimal number of repetitions to transmit each contents in a way that minimizes the number of errors occured, when trying to transmit several contents to the receiver in a restricted time, using Markov-chain modeling and dynamic programming approach.

Analysis on Types of Errors in Learning about Control Structures of Programming using Flowchart (순서도를 활용한 프로그래밍 제어 구조 학습에 나타난 오류 유형 분석)

  • Choe, Hyunjong
    • The Journal of Korean Association of Computer Education
    • /
    • v.19 no.1
    • /
    • pp.101-109
    • /
    • 2016
  • Designing algorithms is a very important learning process in computational thinking education because it requires learner's logical and procedural thinking. But the case studies that have topics of algorithms learning and students' types of errors in learning algorithms are not enough. So the purpose of this study is to analyze students' errors that discovered in the process of learning three control structures of programming using flowchart and provide types of errors in designing algorithms. Results about tests of three types of control structures in university student's algorithms learning class showed different cases of types of errors; types of sequential control error are not presented in the class, types of conditional control error are presented in the case of setting the conditions of nested conditional control, and types of iterative control are showed in the many cases of iterative conditions, statements of single and nested iterative control structure. The results of study will be a good case study about teaching designing algorithms of computational thinking education in elementary, secondary school and university.

Stereo Matching by Dynamic Programming with Edges Emphasized (에지 정보를 강조한 동적계획법에 의한 스테레오 정합)

  • Joo, Jae-Heum;Oh, Jong-kyu;Seol, Sung-Wook;Lee, Chul-Hun;Nam, Ki-Gon
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.10
    • /
    • pp.123-131
    • /
    • 1999
  • In this paper, we proposed stereo matching algorithm by dynamic programming with edges emphasized. Existing algorithms show blur generally at depth discontinuities owing to smoothness constraint and non-existence of matching pixel in occlusion regions. Also it accompanies matching error by lackness of matching information in the untextured regions. This paper defines new cost function to make up for the problems occurred to existing algorithms. It is possible through deriving matching of edges in left and right images to be carried out between edge regions anf deriving that in the other regions to be peformed between the other regions. In case of the possibility that edges can be Produced in a large amount, matching between edge information adds weight to cost function in proportion to Path distance. Proposed algorithm was applied to various images obtained by convergent camera model as well as parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion regions compared to existing algorithms. Also it could improve blur especially in discontinuity regions.

  • PDF

A new formulation for strength characteristics of steel slag aggregate concrete using an artificial intelligence-based approach

  • Awoyera, Paul O.;Mansouri, Iman;Abraham, Ajith;Viloria, Amelec
    • Computers and Concrete
    • /
    • v.27 no.4
    • /
    • pp.333-341
    • /
    • 2021
  • Steel slag, an industrial reject from the steel rolling process, has been identified as one of the suitable, environmentally friendly materials for concrete production. Given that the coarse aggregate portion represents about 70% of concrete constituents, other economic approaches have been found in the use of alternative materials such as steel slag in concrete. Unfortunately, a standard framework for its application is still lacking. Therefore, this study proposed functional model equations for the determination of strength properties (compression and splitting tensile) of steel slag aggregate concrete (SSAC), using gene expression programming (GEP). The study, in the experimental phase, utilized steel slag as a partial replacement of crushed rock, in steps 20%, 40%, 60%, 80%, and 100%, respectively. The predictor variables included in the analysis were cement, sand, granite, steel slag, water/cement ratio, and curing regime (age). For the model development, 60-75% of the dataset was used as the training set, while the remaining data was used for testing the model. Empirical results illustrate that steel aggregate could be used up to 100% replacement of conventional aggregate, while also yielding comparable results as the latter. The GEP-based functional relations were tested statistically. The minimum absolute percentage error (MAPE), and root mean square error (RMSE) for compressive strength are 6.9 and 1.4, and 12.52 and 0.91 for the train and test datasets, respectively. With the consistency of both the training and testing datasets, the model has shown a strong capacity to predict the strength properties of SSAC. The results showed that the proposed model equations are reliably suitable for estimating SSAC strength properties. The GEP-based formula is relatively simple and useful for pre-design applications.