• 한국멀티미디어학회논문지
• /
• 제8권12호
• /
• pp.1589-1596
• /
• 2005

The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. On the other hand, in the case of on line scheduling, Shih and Liu proposed the NORA algorithm which can find a schedule with the minimum total error for a task system consisting solely of on-line tasks that are ready upon arrival. But, for the task system with 0/1 constraint, it has not been known whether the NORA algorithm can be optimal or not in the sense that it guarantees all mandatory tasks are completed by their deadlines and the total error is minimized. So, this paper suggests an optimal algorithm to search minimum total error for the imprecise on-line real-time task system with 0/1 constraint. Furthermore, the proposed algorithm has the same complexity, O(N log N), as the NORA algorithm, where N is the number of tasks.

• 한국경영과학회지
• /
• 제18권1호
• /
• pp.97-117
• /
• 1993

This paper considers inspection station location problem for a flexible assembly line that consists of multiple stages. By considering the trade-off between locating an station at an "early" stage and at a "late" stage, we have developed some dominance relations on a graph. Based on the dominance relations, we then present an algorithm that finds an optimal inspection plan and a heuristic approach that finds a near-optimal inspection plan. The effectiveness of these two algorithms is demonstrated by two numerical examples. numerical examples.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제14권8호
• /
• pp.763-767
• /
• 2008

본 논문에서는 모바일 환경에서의 3D 그래픽 처리에 효과적인 고성능/저전력의 CORDIC 구조를 구성하기 위하여 각도 기반 검색(ABS)과 스케일링 효과를 고려한 검색(SCS)과 같은 두 가지 오프라인 벡터링 방법을 제안하고 이를 통해 연산의 반복횟수를 줄이는 알고리즘을 개발한다. ABS 알고리즘은 3차원 벡터를 두 각으로 표현하고 이를 검색의 기준으로 삼았고, SCS 알고리즘은 단위 벡터를 기준으로 하여 벡터 회전 시에 최소의 반복 연산만으로도 원하는 회전을 수행할 수 있는 최적의 기본각 회전 시퀀스를 오프라인으로 미리 검색하여 적용한다 본 논문에서 제안하는 ABS, SCS 알고리즘을 통해 지연을 각각 50% 감소시킬 수 있었으며, 이와 함께 voltage scaling 기술을 적용하여 전력 소모를 크게 감소시킬 수 있음을 논의한다.

• 물과 미래
• /
• 제27권1호
• /
• pp.89-99
• /
• 1994

현재까지 국내의 홍수예측업무는 과거에 수집된 자료집단을 이용한 변수추정에 의하여 시행되고 있으나, 최근 여러 가지 순환추정 알고리즘을 적용한 홍수예측 또는 변수추정에 관한 많은 연구가 이루어지고 있다. 본 논문은 실시간 홍수예측 및 변수추정에 관한 연구로서, 특히 강우-유출모형의 상태 및 매개변수의 동시추정에 관한 추계학적 현상을 고려하였다. 홍수예측에 관한 시스템은 $\phi$ 지수에 의한 유효강우의 산정과 지체효과를 고려한 n개의 비선형 저수지모형에 의한 홍수축적으로 구성하였다. 그리고 변수추정모형과 홍수추적 모형을 상호연계하여 변수를 포함하는 확대 상태-공간모형으로 상태 및 매개변수의 동시추정에 관한 시스템을 구성하였다. 상태-공간모형에 대한 상태 및 변수추정기법으로 GLS 추정과 MAP 추정에 대하여 비교 검토하였다. 모형의 식별을 위한 민감도 분석은 추정변수의 공분산 행렬을 사용하였다.

• 대한기계학회논문집
• /
• 제19권2호
• /
• pp.568-579
• /
• 1995

An off-line programming (OLP) system was proposed and developed in order to save cost and time in adjusting a robot to new workcells or applying new algorithms to actual trajectory planning. The developed OLP system was especially designed to be operated in a PC level host computer. A SCARA robot with four axes was selected as an objective robot. The OLP system developed in this study consisted of such modules as data base, three-dimensional graphics, kinematics, trajectory planning, dynamics, control, and commands. Each module was constructed to form an independent unit so that it can be easily modified or improved. The OLP system was programmed for a graphic user interface in Borland $C^{++}$ language. Some of system operating commands and an interpreter were devised and used for more convenient programming of robot simulations.s.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• 전기학회논문지P
• /
• 제65권3호
• /
• pp.171-177
• /
• 2016

Noise problem that occurs in living environment is a big trouble in the economic, social and environmental aspects. In this paper, the filtered-X LMS algorithms, the adjoint LMS algorithms, and the robust adjoint LMS algorithms will be introduced for applications in active noise control(ANC). The filtered-X LMS algorithms is currently the most popular method for adapting a filter when the filter exits a transfer function in the error path. The adjoint LMS algorithms, that prefilter the error signals instead of divided reference signals in frequency band, is also used for adaptive filter algorithms to reduce the computational burden of multi-channel ANC systems such as the 3D space. To improve performance of the adjoint LMS ANC system, an off-line measured transfer function is connected parallel to the LMS filter. This parallel-fixed filter acts as a noise controller only when the LMS filter is abnormal condition. The superior performance of the proposed system was compared through simulation with the adjoint LMS ANC system when the adaptive filter is in normal and abnormal condition.

• 한국정보통신학회논문지
• /
• 제12권10호
• /
• pp.1787-1793
• /
• 2008

지문 인식 시스템은 지문인식 장치(fingerprint acquisition device)를 통하여 아날로그(analog) 지문으로부터 변환된 디지털(digital) 지문에서 특이점을 추출하고 추출한 특이점 들에 대한 정보를 데이터 베이스에 등록하는 오프라인(off-line) 처리와 사용자가 시스템에 접근 할 때 입력한 지문으로부터 특이점을 추출한 후 데이터베이스에 저장되어 있는 특이점들과 정합(matching)하여 사용자의 시스템 접근 여부를 결정하는 온라인(on-line) 처리로 이루어져 있다. 본 논문에서는 이진화된 지문 이미지를 효율적으로 처리하기 위한 자료 구조인 Union and Division을 제안하고, Union and Division을 이용하여 이진화와 잡음 제거, 그리고 특이점 추출 단계로 이루어진 특이점 추출 알고리즘을 제안한다.

• 한국지능시스템학회논문지
• /
• 제22권6호
• /
• pp.754-760
• /
• 2012

본 논문은 MW 스케일의 배터리 에너지 저장 시스템 (BESS)을 위한 PMS (power management systems)의 장기간 스케쥴링 알고리즘의 하나로서 peak shaving 알고리즘에 대하여 설명한다. PMS의 목적은 기본적으로 배터리 모듈의 AC 입출력을 제어하는 데 있다. 1일전 부하 곡선이 제공된다는 가정 하에서, 오프라인 peak shaving 알고리즘이 적용될 수 있으나, 이 오프라인 알고리즘의 결과를 적용할 경우 부하 곡선에 존재하는 불확실성에 의하여 그 적용 결과가 실시간 운전에서는 다르게 나타날 수 있다. 본 논문에서는 PMS의 peak shaving 문제에서 부하 곡선의 불확실성을 고려하기 위하여 퍼지 LP 문제 형태로 정식화하고 그 해법과 실시간 운전 시 적용 방안에 대하여 논한다.

• 한국CDE학회논문집
• /
• 제8권4호
• /
• pp.212-221
• /
• 2003

In order to reduce the lead-time and cost, the technology of rapid prototyping (RP) has been widely used. A new rapid prototyping process, transfer-type variable lamination manufacturing process by using expandable polystyrene foam (VLM-ST), has been developed to reduce building time, apparatus cost and additional post-processing. At the same time, VLM Slicer, the CAD/CAM software for VLM-ST has been developed. In this study, algorithms for accuracy improvement of VLM-ST, which include offset and overrun of a cutting path and generation of a reference shape are developed. Offset algorithm improves cutting accuracy, overrun algorithm enables the VLM-ST process to make a shape of sharp edge and reference shape generation algorithm adds additional shape which makes off-line lamination easier. In addition, proposed algorithms are applied to practical CAD models for verification.