• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
• /
• pp.162-165
• /
• 1997

본 연구에서는 off-line 스케쥴링과 on-line 스케쥴링을 함께 고려하는 스케쥴링 메카니즘에 대해 설명하였다. 일반적으로 스케쥴링은 off-line 문제를 주로 다룬다. 그러나, off-line으로 생성된 스케쥴은 실시간으로 발생하는 여러 문제들(기계 고장, 긴급 주문등) 때문에 현실과 맞지 않게 되어 유용성이 떨어지는 경우가 자주 발생한다. 따라서 off-line 스케쥴링의 결과를 수행할때 위와 같은 문제가 발생할 경우, 스케쥴의 변화를 흡수하면서 off-line 스케쥴링의 결과를 최대한 유지할수 있는 on-line 스케쥴링에서 이 같은 스케쥴 실행시의 문제를 해결할 수 있도록 bidding 알고리즘을 사용하는 방법을 제시하였다.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1741-1751
• /
• 2007

The imprecise computation technique ensures that all time-critical tasks produce their results before their deadlines by trading off the quality of the results for the computation time requirements of the tasks. In the imprecise computation, most scheduling problems of satisfying both 0/1 constraints and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. In the previous studies, the reasonable strategies of scheduling tasks with the 0/1 constraints on uniprocessors and multiprocessors for minimizing the total error are proposed. But, these algorithms are all off-line algorithms. Then, in the on-line scheduling, NORA(No Off-line tasks and on-line tasks Ready upon Arrival) algorithm can find a schedule with the minimum total error. In NORA algorithm, EDF(Earliest Deadline First) strategy is adopted in the scheduling of optional tasks. On the other hand, for the task system with 0/1 constraints, NORA algorithm may not suitable any more for minimizing total error of the imprecise tasks. Therefore, in this paper, an on-line algorithm is proposed to minimize total error for the imprecise real-time task system with 0/1 constraints. This algorithm is suitable for the imprecise on-line system with 0/1 constraints. Next, to evaluate performance of this algorithm, a series of experiments are done. As a consequence of the performance comparison, it has been concluded that IOSMTE(Imprecise On-line Scheduling to Minimize Total Error) algorithm proposed in this paper outperforms LOF(Longest Optional First) strategy and SOF(Shortest Optional First) strategy for the most cases.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.503-506
• /
• 1996

An integrated Robot control system for SCARA robot is developed. The system consists of an off-line programming(OLP), software and a robot controller using four digital signal processor(TMS32OC50). The OLP has functions of teaching task, dynamic simulator, three dimensional animation, and trajectory planning. To develop robust dynamic control algorithm, a new sliding mode control algorithm for the robot is proposed. The trajectory tracking performance of these algorithm is evaluated by implementing to SCARA robot(SM5 type) using DSP controller which has conventional PI-FF control algorithm. To make SCARA robot operate according to off-line teaching, an interface between OLP and robot controller in the integrated system is designed. To demonstrate performance of the integrated system, the proposed control algorithm is applied to the system.

• Journal of information and communication convergence engineering
• /
• 제8권6호
• /
• pp.721-724
• /
• 2010

In a network router, packet loss may occur when it overflows due to sudden burst traffic. This paper studies how much large buffers are required to eliminate the packet losses. There are buffers on which packet arrive and one output port to which a packet is transmitted at a time. The buffer management algorithm should determine one of the buffers whose packet is transmitted to the output port at each time. The front packet belonging to the buffer determined by the algorithm is transmitted. The goal is to minimize the sum of the lengths of buffers to transmit all the packets. We provide an optimal off-line algorithm and also we show the lower bounds of on-line algorithms. The on-line algorithm has no prior information of the packets having arrived in the future. Its performance is compared to that of the optimal off-line algorithm.

• 정보처리학회논문지A
• /
• 제9A권2호
• /
• pp.225-230
• /
• 2002

제한된 경쟁삭제 문제는 집합연산 문제의 간단한 형태의 하나로서, 경쟁삭제 문제에서 삽입연산을 제외한 것이다. 현재 경쟁삭제 문제에 대해서는 최적의 순차 알고리즘이 개발되어 있으며, 병렬 알고리즘의 경우 O(n/loglogn)개의 처리기를 사용하여 $O(log^2nloglogn)$에 수행되는 알고리즘이 개발되어 있다. 본 논문에서는 제한된 경우의 경쟁삭제 문제를 해결하기 위한 재구성 가능 메쉬 알고리즘을 제시한다. 제안된 알고리즘은 $n{\times}n$ 재구성 가능 메쉬에서 상수시간에 수행되며, 이 결과는 $AT^2$ 퇴적이다.

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제23권2호
• /
• pp.110-115
• /
• 2017

실내위치를 찾는 방법으로 각 비콘으로부터 수신된 여러 신호들의 최대값의 상대적인 순위에 따라 비교대상 비콘과 참조위치를 동시에 일차적으로 솎아낸 후 살아남은 비콘과 참조위치 만으로 기존의 핑거프린트 방식을 적용하는 Cut-off 알고리즘을 제안한다. 이 방식은 두 단계로 이루어져 있다. 오프라인 단계에서는 비콘을 실내 여러 참조위치에 설치하고 그로부터 발생되는 신호세기와 UUID를 미리 파악하여 핑거프린트 지도를 만든다. 온라인 단계에서는 우선 사용자의 이동장치에서 수신된 비콘들의 신호세기 데이터에 의거하여 앞서 만든 지도를 줄인다. 줄어든 지도를 활용하여 가장 유력한 K개의 참조위치를 파악하고 그 위치를 이용하여 사용자의 위치를 추정한다. 특이한 점은, 핑거프린트 지도에 기록하거나 위치를 추정하는 과정에서 고려되는 사항은 각 비콘으로부터 수신된 신호들의 최대값들의 상대적인 순위라는 점이다. 수시로 변화하는 신호세기 자체의 불안정성을 최소화하는 효과를 내기 때문에 추정위치의 정확성이 기존 방식과 차별화 되었다.

• 전기학회논문지
• /
• 제59권6호
• /
• pp.1070-1074
• /
• 2010

In this study we deal with a simple computer simulation algorithm to decide the PRT station capacity. PRT system is different from the conventional rail traffic system in such point that the station is off-line so as to guarantee a very short headway. This characteristic has correlation with the accurate prediction of the line capacity and with the scale of the off-line station. In this paper physical factors and vehicles per hour that are necessary to decide the off-line station scale and the off-line station capacity, respectively, are shown through a simple compter simulations.

• 한국정밀공학회지
• /
• 제19권10호
• /
• pp.66-76
• /
• 2002

Automated welding and soldering are an important manufacturing issue in order to lower the cost, increase the quality, and avoid labor problems. An off-line programming, OLP, is one of the powerful methods to solve this kind of diversity problem. Unless an OLP system is ready for the path optimization in welding and soldering, the waste of time and cost is unavoidable due to inefficient paths in welding and soldering processes. Therefore, this study attempts to obtain path optimization using a genetic algorithm based on artificial intelligences. The problem of welding path optimization is defined as a conventional TSP (traveling salesman problem), but still paths have to go through welding lines. An improved genetic algorithm was suggested and the problem was formulated as a TSP problem considering the both end points of each welding line read from database files, and then the transit problem of welding line was solved using the improved suggested genetic algorithm.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 추계학술대회 논문집
• /
• pp.283-287
• /
• 1996

The exhaust noise reduction of automobile with the active muffler is experimentally investigated. The control algorithm is the filtered-x LMS algorithm and the inverse algorithm with the adaptive line enhancer. Also, the control efficiency is increased with synthesized second harmonic engine frequency. In the experiment, the active muffler is applied to the end of exhaust system in automobile and the control with on-line secondary path modeling method(inverse algorithm) is compared the control of off-line secondary path modeling method. As secondary path transfer functions are changed, the experimental results show that the control performance with on-line method is more efficient than that with off-line method in the exhaust noise reduction of automobile.

• Journal of Electrical Engineering and Technology
• /
• 제10권6호
• /
• pp.2262-2270
• /
• 2015

Generally, internal parameters of the motors and generators can be divided to the resistance and inductance components. They can become a cause of the changing internal parameters because they have sensitive characteristics due to external conditions. The changed parameters can generate the outputs which include error values from the speed and current controllers. Also, it can bring the temperature increase and mechanical damage to the system. Therefore, internal parameters of the motors and generators need to obtain their values according to the external conditions because it can prevent the mechanical damage caused by the changed parameters. In this paper, the off-line parameter identification method is verified using the Goertzel algorithm. The motor used in the simulation and experiments is an interior permanent magnet synchronous motor (IPMSM), and the proposed algorithm is verified by the simulation and experimental results.