• International Journal of Control, Automation, and Systems
• /
• 제6권2호
• /
• pp.194-203
• /
• 2008

Iterative learning control (ILC) is a simple and effective method for the control of systems that perform the same task repetitively. ILC algorithm uses the repetitiveness of the task to track the desired trajectory. In this paper, we propose a PID (proportional plus integral and derivative) type ILC update law for control discrete-time single input single-output (SISO) linear time-invariant (LTI) systems, performing repetitive tasks. In this approach, the input of controlled system in current cycle is modified by applying the PID strategy on the error achieved between the system output and the desired trajectory in a last previous iteration. The convergence of the presented scheme is analyzed and its convergence condition is obtained in terms of the PID coefficients. An optimal design method is proposed to determine the PID coefficients. It is also shown that under some given conditions, this optimal iterative learning controller can guarantee the monotonic convergence. An illustrative example is given to demonstrate the effectiveness of the proposed technique.

• 전기학회논문지
• /
• 제60권1호
• /
• pp.193-200
• /
• 2011

This paper presents an optimal checkpoint strategy for fault-tolerance in real-time systems. In our environment, multiple real-time tasks with arbitrary periods are scheduled in the system by Rate Monotonic (RM) algorithm, and checkpoints are inserted at a constant interval in each task while the width of interval is different with respect to the task. We propose a method to determine the optimal checkpoint interval for each task so that the probability of completing all the tasks is maximized. Whenever a fault occurs to a checkpoint interval of a task, the execution time of the task would be prolonged by rollback and re-execution of checkpoints. Our scheme includes the schedulability test to examine whether a task can be completed with an extended execution time. A numerical experiment is conducted to demonstrate the applicability of the proposed scheme.

• 한국컴퓨터산업학회논문지
• /
• 제3권12호
• /
• pp.1725-1736
• /
• 2002

에지 시그널의 세기가 갖는 특징적인 성질로서, 에지를 가로질러 엄격하게 단조적인 세기 변화가 나타남을 설명하고 이를 바탕으로 하는 새로운 에지 검출 알고리듬을 제안한다. 스케일링에 무관하고 비국소적인 확장된 방향미분을 픽셀 공간에서 도입하여, 본 알고리듬이 에지 폭의 다양한 변화에 적응성을 가지며 최적의 에지 검출 알고리듬으로서 적절함을 설명한다. 본 알고리듬의 산업적 응용으로서, 시각적 검사에 대한 간단한 컴퓨터 비전 프로시저의 한 예를 살펴본다.

• Computers and Concrete
• /
• 제23권1호
• /
• pp.25-36
• /
• 2019

In this paper, an algorithm is presented to simulate numerically the reinforced concrete (RC) columns having any geometric form of section, loaded eccentrically along one or two axes. To apply the algorithm, the columns are discretized into two macro-elements (MEs) globally and the critical sections of columns are discretized into fixed rectangular finite elements locally. A proposed triple simultaneous dichotomy convergence method is applied to find the equilibrium state in the critical section of the column considering the three strains at three corners of the critical section as the main characteristic variables. Based on the proposed algorithm a computer program has been developed for simulation of the nonlinear behavior of the eccentrically-loaded columns. A good agreement has been witnessed between the results obtained applying the proposed algorithm and the experimental test results. The simulated results indicate that the ultimate strength and stiffness of the RC columns increase with the increase in axial force value, but large axial loads reduce the ductility of the column, make it brittle, impose great loss of material, and cause early failure.

• 한국정보과학회논문지:시스템및이론
• /
• 제30권9호
• /
• pp.504-511
• /
• 2003

논리회로 합성에서 함수의 대칭성을 이용하여 면적이나 시간 지연을 최소화하는 문제는 많은 시간동안 연구되어 왔다. 본 논문은 최근 들어 면적이나 시간지연 보다도 더 중요하게 여겨지는 전력 소모를 최소화하는데, 회로 대칭성이 어떻게 이용되는 지에 대한 연구를 소개한다. 이 논문에서 회로의 대칭성에 대한 폭넓은 정의를 소개하고, 각 대칭성간의 관계에 대해 논의하며, 각 회로의 대칭성이 어떻게 전력을 줄이는데 유용할 수 있는지에 대해 논의한다. 또한, 회로에 존재하는 주 입력(primary input)과 내부 노드사이에 존재하는 대칭성을 찾아내는 알고리즘을 소개한다. 이 논문에서 소개하는 알고리즘의 특징은 첫째, 면적이나 속도지연의 증가가 거의 없이, 전력 소모를 줄여주는 효과적인 재합성 기법이란 것이다. 둘째, 대부분의 다른 휴리스틱(heuristic) 알고리즘과는 달리, 회로의 스위칭 (switching) 양에 있어 단조 향상(monotonic improvement)을 보장한다. 이미 잘 알려진 바와 같이 CMOS 회로에서는 스위칭 양이 전력소모에 대부분을 차지하므로, 알고리즘의 적용 후에 회로가 전력 소모 면에서 계속적인 향상을 이룰 수 있게 한다는 점에서 매우 효과적이라 하겠다. 알고리즘의 효과를 검증하기 위해서, MCNC 벤치마크 회로를 이용하여 실험을 시행하였고, 실험 결과, 속도나 면적에 대한 오버헤드가 거의 없으면서 평균 12%의 전력 소모를 줄일 수 있었다.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.15-25
• /
• 2000

In this paper, we introduce a point-to-multipoint minimum cost flow problem with convex and demand splitting. A source node transmits the traffic along the tree that includes members of the point-to-multipoint connection. The traffic is replicated by the nodes only at branch points of the tree. In order to minimize the sum of arc costs, we assume that the traffic demand can be splitted and transmitted to destination nodes along different trees. If arc cost is linear, the problem would be a Steiner tree problem in networks eve though demand splitting is permitted. The problem would be applied in transmitting large volume of traffic from a serve to clients in Internet environments. Optimality conditions of the problem are presented in terms of fair tree routing. The proposed algorithm is a finite terminating algorithm for $\varepsilon$-optimal solution. convergence of the algorithm is obtained under monotonic condition and strict convexity of the cost function. Computational experiences are included.

• 전기학회논문지P
• /
• 제65권4호
• /
• pp.292-297
• /
• 2016

The first-order plus dead time(FOPDT) and second-order plus dead time(SOPDT), which describes a linear monotonic process quite well in most chemical and industrial processes and is often sufficient for PID and IMC controller tuning. This paper presents an application of heuristic harmony search(HS) optimization algorithm to the identification of linear continuous time-delay systems from step response. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the proposed identification method has been demonstrated through a number of simulation examples.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.981-1000
• /
• 2009

This paper considers asset liability management problems when their deterministic equivalent formulations are general nonlinear optimization problems. The presented approach uses a nonmonotone trust region strategy for solving a sequence of unconstrained subproblems parameterized by a scalar parameter. The objective function of each unconstrained subproblem is an augmented penalty-barrier function that involves both primal and dual variables. Each subproblem is solved approximately. The algorithm does not restrict a monotonic decrease of the objective function value at each iteration. If a trial step is not accepted, the algorithm performs a non monotone line search to find a new acceptable point instead of resolving the subproblem. We prove that the algorithm globally converges to a point satisfying the second-order necessary optimality conditions.

• International journal of advanced smart convergence
• /
• 제8권2호
• /
• pp.94-101
• /
• 2019

Building a stable knowledge base is an important issue in the application of knowledge engineering. In this paper, we present an algorithm for detecting and locating discrepancies in the line of the reasoning process especially when discrepancies occur on belief values. This includes backtracking the rule firing from a goal node of the rule network. Retracting a belief function allows the current belief state to move back to another belief state without the rule firing. It also gives an estimate, called contribution measure, of how much the rule has an impact on the current belief state. Examining the measure leads the expert to locate the possible cause of problem in the rule. For non-monotonic reasoning, the belief retraction method moves the belief state back to the previous state. A tracing algorithm is presented to identify and locate the cause of problem. This also gives repair suggestions for rule refinement.

• Structural Engineering and Mechanics
• /
• 제12권2호
• /
• pp.201-214
• /
• 2001

Four finite element (FE) models are examined to find the one that best estimates moment-rotation characteristics of top- and seat-angle with double web-angle connections. To efficiently simulate the real behavior of connections, finite element analyses are performed with following considerations: 1) all components of connection (beam, column, angles and bolts) are discretized by eight-node solid elements; 2) shapes of bolt shank, head, and nut are precisely taken into account in modeling; and 3) contact surface algorithm is applied as boundary condition. To improve accuracy in predicting moment-rotation behavior of a connection, bolt pretension is introduced before the corresponding connection moment being surcharged. The experimental results are used to investigate the applicability of FE method and to check the performance of three-parameter power model by making comparison among their moment-rotation behaviors and by assessment of deformation and stress distribution patterns at the final stage of loading. This research exposes two important features: (1) the FE method has tremendous potential for connection modeling for both monotonic and cyclic loading; and (2) the power model is able to predict moment-rotation characteristics of semi-rigid connections with acceptable accuracy.