• Journal of Construction Engineering and Project Management
• /
• v.2 no.3
• /
• pp.48-57
• /
• 2012

With increasing number of serious construction disasters such as death, a safety management in real-time is more required recently. One of the ways to support the needs, a convergence with Information Technology (IT) has been noticed. Although number of inefficiencies including a limitation of IT equipment (weight, control inconveniences) has been concerned, data exchanging and processing fields have been improved at a wide range with an advance of mobile communication and an introduction of smart mobiles that are simple and convenient. In this research, a framework is realized in connection with smart mobile to find the problems of current safety management and derive demands in order to support effective safety management. Two smart mobile applications, Safety Management application and Safety Guideline application, enable a real-time safety management and less re-work by provided safety information.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.549-549
• /
• 2000

In the previous work, we dealt with a traffic analysis of network-based control system and its architecture using the CAN protocol. It is difficult to determine an optimal network architecture for a specific system. In this paper, we propose the architecture of network-based control system applicable to a specific AGV system with manipulator arms. We define the fixed number of periodic messages to be occurred in this system. In the proposed system architecture, we analyse its traffic for the real-time communication of all messages, determine the optimal sampling period of an analog sensor to be satisfied with the required specification and the number of possible sensors to be added through simulation.

• The Pure and Applied Mathematics
• /
• v.23 no.3
• /
• pp.247-263
• /
• 2016

Let $M_{1}f(x,y):=\frac{3}{4}f(x+y)-\frac{1}{4}f(-x-y)+\frac{1}{4}f(x-y)+\frac{1}{4}f(y-x)-f(x)-f(y)$, $M_{2}f(x,y):=2f(\frac{x+y}{2})+f(\frac{x-y}{2})+f(\frac{y-x}{2})-f(x)-f(y)$. Using the direct method, we prove the Hyers-Ulam stability of the additive-quadratic ρ-functional inequalities (0.1) $N(M_{1}f(x,y),t){\geq}N({\rho}M_{2}f(x,y),t)$ where ρ is a fixed real number with |ρ| < 1, and (0.2) $N(M_{2}f(x,y),t){\geq}N({\rho}M_{1}f(x,y),t)$ where ρ is a fixed real number with |ρ| < $\frac{1}{2}$.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.986-988
• /
• 1995

The ART(Adaptive Resonance Theory) model is self- organized with nonstationary input patterns in real time. But there is a multirun problem caused by fault clustering, or pertubated clustering and confines the advantage of the stationary real-time processing in ART model. In this paper, we propose the incremental vigilance threshold approach to decrease the number of multiruns. The incremental vigilance threshold approach is to learn with incremental vigilance threshold and competition with clusters.

• Wind and Structures
• /
• v.16 no.5
• /
• pp.457-476
• /
• 2013

This paper presents theoretical background for a semi-empirical, mathematical model of critical vortex excitation of slender structures of compact cross-sections. The model can be applied to slender tower-like structures (chimneys, towers), and to slender elements of structures (masts, pylons, cables). Many empirical formulas describing across-wind load at vortex excitation depending on several flow parameters, Reynolds number range, structure geometry and lock-in phenomenon can be found in literature. The aim of this paper is to demonstrate mathematical background of the vortex excitation model for a theoretical case of the structure section. Extrapolation of the mathematical model for the application to real structures is also presented. Considerations are devoted to various cases of wind flow (steady and unsteady), ranges of Reynolds number and lateral vibrations of structures or their absence. Numerical implementation of the model with application to real structures is also proposed.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.11a
• /
• pp.336-339
• /
• 2006

모델 예측 제어 시스템은 이동 제어 구간에서 원하는 출력과 예측된 출력의 차이를 최소화하는 현재의 제어 입력을 적용하는 방식을 사용한다. 제약조건이 있는 경우이거나 비선형 시스템 문제의 경우는 주어진 함수를 최소화하는 최적화 문제를 풀기가 힘들다. 본 논문에서는 모델 예측 제어 시스템의 최적화 문제를 실수 코딩 유전 알고리즘을 이용하여 효율적으로 구할 수 있음을 보인다. 또한 실수코딩 유전알고리즘이 여러 가지 면에서 디지털코딩 유전알고리즘보다 더 자연스럽고 유리함을 모의실험을 통해 보인다.

• Journal of Multimedia Information System
• /
• v.6 no.1
• /
• pp.37-42
• /
• 2019

Skyline queries are used in a variety of fields to make optimal decisions. However, as the volume of data and the dimension of the data increase, the number of skyline points increases with the amount of time it takes to discover them. Mainly, because the number of skylines is essential in many real-life applications, various studies have been proposed. However, previous researches have used the k-parameter methods such as top-k and k-means to discover representative skyline points (RSPs) from entire skyline point set, resulting in high query response time and reduced representativeness due to k dependency. To solve this problem, we propose a new Connected Component Clustering based Representative Skyline Query (3CRS) that can discover RSP quickly even in high-dimensional data through connected component clustering. 3CRS performs fast discovery and clustering of skylines through hash indexes and connected components and selects RSPs from each cluster. This paper proves the superiority of the proposed method by comparing it with representative skyline queries using k-means and DBSCAN with the real-world dataset.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.6
• /
• pp.1122-1129
• /
• 2007

For a system with multiple real-time tasks of different deadlines, it is very difficult to find the optimal checkpoint interval because of the complexity in considering the scheduling of tasks. In this paper, we determine the optimal checkpoint interval for multiple real-time tasks that are scheduled by RM(Rate Monotonic) algorithm. Faults are assumed to occur with Poisson distribution. Checkpoints are inserted in the execution of task with equal distance in the same task, but different distances in other tasks. When faults occur, rollback to the latest checkpoint and re-execute task after the checkpoint. We derive the equation of maximum slack time for each task, and determine the number of re-executable checkpoint intervals for fault recovery. The equation to check the schedulibility of tasks is also derived. Based on these equations, we find the probability of all tasks executed within their deadlines successfully. Checkpoint intervals which make the probability maximum is the optimal.

• Journal of Information Technology Services
• /
• v.4 no.1
• /
• pp.107-115
• /
• 2005

As Real Time Enterprise (RTE) has been spotlighted since the year of 2002, some advanced companies have been implementing the paradigm of RTE to its legacy systems and the number of the companies has been growing. However, the network infrastructures mainly based on fixed telecommunications network make the results of the RTE implementations fall short of their expectations. In this paper, we propose to construct the fixed-mobile convergence (FMC) environment to achieve RTE. The convergence infrastructure will improve user accessibility to all kinds of data and will encourage the users to interact with the systems.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.1
• /
• pp.6-11
• /
• 2009

This paper presents a new dynamically adaptable polling scheme for efficient support of real-time traffic over an IEEE 802.11 wireless LAN network. The poll scheduling plays an important role in IEEE 802.11 PCF. However, the current version of the polling list management scheme proposed in the IEEE 802.11 standard is inefficient when a variable number of mobile stations have variable packets to transmit. If Point Coordinator has an exact information on the station status, it is possible to efficiently perform polling. In this paper, we suggest an adaptable polling scheme to meet requirements of the stations. In our scheme, each station transmits packets including a piggyback information to inform that it wants to receive a poll in the next polling duration. Simulation results indicate that our scheme may reduces the packet discard ratio and real-time packet transfer delay.