• 한국소음진동공학회논문집
• /
• 제26권3호
• /
• pp.323-330
• /
• 2016

This paper describes real-time unbalance moment compensation method for line of sight(LOS) stabilization control systems. The factors of system inertia, frictions and unbalance moment affect the control accuracy of drive systems that are equipped to on the move(OTM) platforms requiring LOS stabilization function. In case of the unbalance moment among those factors is continuously changed as variation of relative angle between gravity vector and drive torque vector. Then, consideration of the effect in real-time is very complicate. Therefore, its effect should be designed to be minimized, however, designing it almost zero is impossible in real condition. In other words, it is hard to achieve target performance overcoming stability issue of highly unbalanced systems. To solve these problems, this paper proposes calculation method of unbalance moment by using measured sensor data for LOS stabilization control and its use for control compensation. Also, kinematical converting process and control structure for compensation are explained. The effectiveness of the proposed method as variation of unbalance moment is verified under simulation circumstance modeled by assuming LOS control system with 2-axis gimbal structure.

• 반도체디스플레이기술학회지
• /
• 제21권4호
• /
• pp.53-58
• /
• 2022

Shape changes of hard mask play a key role in the aspect ratio dependent etch (ARDE). For etch process using high density and energy ions, deformation of hard mask shape becomes more severe, and high aspect ratio (HAR) etch profile is distorted. In this study, polygonal geometric model for shape-deformation of amorphous carbon layered hard mask is suggested to control etch profile during the process. Mask shape is modeled with polygonal geometry consisting of trapezoids and rectangles, and it provides dynamic information about angles of facets and etched width and height of remained mask shape, providing important features for real-time HAR etch profiling.

• 제어로봇시스템학회논문지
• /
• 제15권9호
• /
• pp.946-951
• /
• 2009

The small multi-jointed robots for most education are developed with the way of firmware. But the firmware may be very difficult to develop as gradually increasing throughputs and control routines. Due to limit of firmware we try to use on RTOS, but hard to adapt on the small multi-jointed robots. It would be hard to install RTOS into the small multi-jointed robots because of the size capacity of RTOS, and lack of libraries for control of the particular hardware. Moreover, even its RTOS with many functions causes its to make overheads scheduling, TCB (Task Control Block), and task states. Also to keep maintenance of RTOS, it is composed of components for the whole structure of my proposed RTOS. Additionally, We provided with libraries of servo motor and sensor control and developed RMS (Rate Montonic scheduler) to handle tasks on real time and reduce overheads. Therefore, It is possible to work the fixed priority and task preemptive way. We show one example of the multi-jointed robot installed with my proposed RTOS, which shows to obstacle avoidance and climbing up the slope.

• 대한임베디드공학회논문지
• /
• 제12권4호
• /
• pp.231-238
• /
• 2017

Detecting small infrared targets from the low-SCR images at a long distance is very hard. The previous Local Contrast Method (LCM) algorithm based on the human visual system shows a superior performance of detecting small targets by a background suppression technique through local contrast measure. However, its slow processing speed due to the heavy multi-scale processing overhead is not suitable to a variety of real-time applications. This paper presents a lightweight real-time small target detection algorithm, called by the Improved Selective Local Contrast Method (ISLCM), to reduce the scale-invariant computational overhead. The proposed ISLCM applies the improved local contrast measure to the predicted selective region so that it may have a comparable detection performance as the previous LCM while guaranteeing low scale-invariant computational load by exploiting both adaptive scale estimation and small target feature feasibility. Experimental results show that the proposed algorithm can reduce its computational overhead considerably while maintaining its detection performance compared with the previous LCM.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권7호
• /
• pp.363-369
• /
• 2000

To flexibly evaluate performance and reliability of an electric power system in the aspect of the real-time system which is intrinsically characterized by stringent timing constraints fails catastrophically if its control input is not updated by its digital controller computer within a certain time limit called the hard deadline, we propose fuzzy-random variables and build a discrete event model embedded with fuzzy-random variables. Also, we adapt fuzzy-variables to a path-space approach, which derives the upper and lower bounds of reliability by using a semi-Markov model that explicitly contains the deadline information. Consequently, we propose certain formulas of state automata properly transformed by fuzzy-random variables, and present numerical examples applying the formulas as well.

• Journal of Information Processing Systems
• /
• 제15권6호
• /
• pp.1335-1349
• /
• 2019

Crowdsensing technologies can improve the efficiency of smart parking system in comparison with present sensor based smart parking system because of low install price and no restriction caused by sensor installation. A lot of sensing data is necessary to predict parking lot saturation in real-time. However in real world, it is hard to reach the required number of sensing data. In this paper, we model a saturation predication combining a time-based prediction model and a sensing data-based prediction model. The time-based model predicts saturation in aspects of parking lot location and time. The sensing data-based model predicts the degree of saturation of the parking lot with high accuracy based on the degree of saturation predicted from the first model, the saturation information in the sensing data, and the number of parking spaces in the sensing data. We perform prediction model learning with real sensing data gathered from a specific parking lot. We also evaluate the performance of the predictive model and show its efficiency and feasibility.

• Journal of Computing Science and Engineering
• /
• 제1권1호
• /
• pp.56-73
• /
• 2007

Demands have been growing in safety-critical application fields for producing networked real-time embedded computing (NREC) systems together with acceptable assurances of tight service time bounds (STBs). Here a service time can be defined as the amount of time that the NREC system could take in accepting a request, executing an appropriate service method, and returning a valid result. Enabling systematic composition of large-scale NREC systems with STB certifications has been recognized as a highly desirable goal by the research community for many years. An appealing approach for pursuing such a goal is to establish a hard-real-time (HRT) component model that contains its own STB as an integral part. The TMO (Time-Triggered Message-Triggered Object) programming scheme is one HRT distributed computing (DC) component model established by the first co-author and his collaborators over the past 15 years. The TMO programming scheme has been intended to be an advanced high-level RT DC programming scheme that enables development of NREC systems and validation of tight STBs of such systems with efforts far smaller than those required when any existing lower-level RT DC programming scheme is used. An additional goal is to enable maximum exploitation of concurrency without damaging any major structuring and execution approaches adopted for meeting the first two goals. A number of previously untried program structuring approaches and execution rules were adopted from the early development stage of the TMO scheme. This paper presents new concrete justifications for those approaches and rules, and also discusses new extensions of the TMO scheme intended to enable further exploitation of concurrency in NREC system design and programming.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 1998년도 가을 학술발표논문집 Vol.25 No.2 (1)
• /
• pp.573-575
• /
• 1998

실시간 내장형 시스템(real-time embedded system)의 반응 동작(reactive behavior)을 정확하게 분석하기 위해서 상태차트(statechart)에 바탕을 둔 객체 지향 모델링 방법론들이 많이 사용되고 있다. 하지만 이들 방법론들은 경성 실시간 시스템(hard real-time system)이라면 반드시 고려해야할 스케줄링 가능성분석(scheduability analysis)에 필요한 시간에 대한 정보와 시간 제약을 정확히 나타내지 못하는 문제점이 있다. 본 논문에서는 최근 OMG(Object Management Group)에서 객체 지향개발의 기준으로 채택된 UML(Unifies Modeling Language) ver1.1을 사용하여 실시간 내장형 시스템의 반응 동작과 시스템의 시제 동작(temporal behavior)을 모델링하여, 모델링된 시스템이 스케줄링 가능성 분석이 효과적으로 이루어지는 방안을 제안한다.

• 국제초고층학회논문집
• /
• 제2권4호
• /
• pp.331-340
• /
• 2013

The main topic of this paper is to show a possibility of indoor air quality enhancement and the fan energy savings in underground parking facilities by applying the demand-controlled ventilation (DCV) strategy based on the real-time variation of the traffic load. The established ventilation rate is estimated by considering the passing distance, CO emission rate, idling time of a vehicle, and the floor area of the parking facility. However, they are hard to be integrated into the real-time DCV control. As a solution to this problem, the minimum ventilation rate per a single vehicle is derived in this research based on the actual ventilation data acquired from several existing underground parking facilities. And then its applicability to the DCV based on the real-time variation of the traffic load is verified by simulating the real-time carbon monoxide concentration variation. The energy saving potentials of the proposed DCV strategy is also checked by comparing it with those for the current underground parking facility ventilation systems found in the open literature.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.430-433
• /
• 1999

Woo[8]proposed dual-token based fault-tolerant scheduling algorithm in multiprocessor environment for resolving the problem of old systems that have a central dispatcher processor. However, this algorithm does not present token allocation algorithm in detail when central dispatcher processor has failed. In this paper, we propose a fault detection algorithm and processor selection algorithm for token allocation when central dispatcher processor has failed.