• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.743-747
• /
• 1997

Polishing work for a curved surface die demands simple and repetitive operations and requires much time while it also demands high precision. Therefore it is operated by skilled worker in handiwork. Howener workers avoid polishing work gradually because of the poor environments such as dust and noise. In order to reduce the polishing time and to alleviate the problem of shortage of skilled workers, researches for automation of polishing have been pursued in the developed countries. In the research, a polishing robot with 2 degrees of freedom motion attached to machining center with 3 degrees of freedom and pneumatic system forms an automatic polishing system which keeps the polishing tool vertically on the surface of die and maintains constant pneumatic pressure. A synchronization between machining center and polishing robot is accomplished by using M code of machining center. A rulled surface and shadow mask are polished by the developed polishing robot.

• Journal of Korean Institute of Industrial Engineers
• /
• v.3 no.1
• /
• pp.49-53
• /
• 1977

The coordinated control of the traffic signals of adjacent intersections can reduce delays, relative number of stops and congestions in the coordinated traffic area. The road capacity can be increased to a certain extend because the stopping and starting of vehicles facing red traffic lights can be avoided in many instances due to the progression established along an artery. However, if traffic centers or leaves the main flow in irregular volumes on the intermediate road section, a coordination of traffic signals is unnecessary and may even be harmful. Therefore, a computer simulation model to simulate and predict the effectiveness of a synchronized traffic signal system in the CBD of Seoul was developed and alternative policy variables, such as cycle time, offsets, phase splits, to be fed into the simulation model had to be generated. This is a report of (1) the development of a heuristic algorithm for the determination of phase splits when there are amber periods specifically reserved for left turns and (2) the computerization of time-space diagramming.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.543-545
• /
• 1999

컴퓨터 시스템은 주파수를 제공하는 수정발진자의 환경적 요인에 의한 오차 등으로 인해 정확한 시각을 유지하지 못한다. 정확한 시각 유지를 통해 외부 시각원으로부터 시각신호를 받아 로컬 시스템의 시각오류를 보정하는 시각동기 클라이언트를 이용하는 방법을 연구하였다. 정밀도 향상을 위해 다중서버 선택기능을 보강하였고, 지연시간에 따른 시각원의 가중치를 적용하였다. 특히 시각변화에 민감한 프로세스가 많은 시스템에서 시각 오류 보정시 시각의 급변은 시스템에 무리를 일으키므로 점근적 보정을 통한 안정적 방법이 필요하다. 이를 위해 축적결과기반 시각오류 보정방법을 적용하여 네트워크 지연의 급작스런 변화에도 분산을 통한 충격을 완화하여 안정적인 시각보정을 할 수 있도록 하였다. 시각오류 요인과 시각동기방법, 클라이언트 구현과 실험결과를 제시한다.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.2
• /
• pp.101-108
• /
• 2008

In this paper, we develop system to backup automatically personal data by real time based on ECA model. This system backups data that is changed in user PC using CDP technology based on ECA model. Proposed ECA model defines file's change such as file creation, update, remove etc. in user PC to event for synchronization between server and user PC. If event is detected about file, proposed system examines condition that is defined and backup the file to server. Backup data that is stored to server can recovery on point of time that user wants. The proposed system can be applied to data management system for business, personal data management system, high-capacity contents management system etc.

• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.321-328
• /
• 2013

In this paper, we present a technique for obtaining conflict-free schedules for real-time automation protocol for industrial Ethernet (RAPIEnet) switches. Mathematical model of the switch is obtained using graph theory. Initially network traffic entry and exit parts in a single RAPIEnet switch are identified, so that a bipartite conflict graph can be constructed. The obtained conflict graph is transformed to three kinds of matrices to be used as inputs for our simulation model, and selection of any of the matrix forms is application-specific. A greedy edge-coloring algorithm is used to schedule the network traffic and to solve the minimum coloring problem. After scheduling, empty slots are identified for forwarding the non real-time traffic of asynchronous devices. Finally, an algorithm for synchronizing the schedules of adjacent switches is proposed using edge-contraction and minors. All simulations were carried out using Matlab.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.439-441
• /
• 2002

내장명 실시간 시스템을 위한 프로그래밍의 방법으로. 플랫폼에 의존적이며 실시간성이 고려되어야 하는 태스크는 실시간 쓰레드를 이용하고, GUI나 인터넷통신과 같은 실시간성이 고려되지 않는 태스크는 자바 쓰레드를 이용해서 프로그래밍하는 것이 편리하다. 이런 경우, 서로 다른 이들 쓰레드간에 동기화를 위한 방법이 필요하게 된다. 따라서, 본 논문에서는 실시간 쓰레드와 자바 쓰레드간의 동기화를 위만 방법을 제시하고 이를 위한 API(Application Programming Interface)를 설계 및 구현한다 즉, 실시간 운영체제인 RT-Linux상에서 수행되는 실시간 쓰레드들이 RT-FIFO와 네이티브 IPC(Inter-process communication) 메커니즘을 사용해 자바 쓰레드들과 동기화 되어질 수 있게 구현한 것이다. 구현된 이 네이티브 IPC API들은 재사용 가능한 공유 라이브러리와 클래스파일로 제작되어 활용될 수도 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.862-864
• /
• 2004

다수 사용자용 인터넷 게임은 그 특성상 게임 클라이언트간 또는 게임 클라이언트와 게임 서버간에 네트워크 지연은 피할 수 없고 이로 인해서 사용자가 느끼는 실감은 상당히 줄어 든다. 본 논문에서는 클라이언트-서버형태의 게임구조 하에서 이런 네트워크 지연에 따른 문제점을 해결하는 사용자들간의 상태 동기화 방법을 제안한다. 이 방법은 게임상 가상공간을 여러 영역으로 나눈 후, 각 클라이언트에 도착하는 메시지들의 발생 영역에 따라서 배치처리 시간간격 (time interval)을 달리하는 동기화 방법이다. 이 동기화 방법은 기존 방법에 비해서 롤백 (roll back) 수의 큰 증가 없이 사용자 반응시간을 현저히 줄이는 효과를 보인다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.722-723
• /
• 2017

In this study, we take into account in improving traffic flow in real-time problem. In order to solve the problem, we propose a new approach to manage traffic flow at the intersection in real-time via controlling by traffic light scheduling. In particular, the proposed method is based on process synchronization theory and connected vehicle technology where each vehicle is able to communicate with others. The traffic deadlock is also taken into consideration in case of high traffic volume. The simulation shows the potential results comparing with the existing traffic management system.

• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.161-166
• /
• 2002

The existing method in PN code acquisition process have a problem in PN code acquisition time because PN code searching is accomplished in one epoch. In this paper, we propose algorithm that can reduce PN code acquisition time because PN code searching is accomplished in each other two epoches. The designed ASIC chip using proposed algorithm confirmed that the area (the number of gates) increase more than existing method in PN code acquisition, but the performance of PN code acquisition is better than existing method.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.545-553
• /
• 2014

This paper proposes an algorithm to sense orthogonal frequency-division multiplexing (OFDM) signals in cognitive radio (CR) systems. The basic idea behind this study is when a primary user is occupying a wireless channel, the covariance matrix is non-diagonal because of the time domain cross-correlation of the cyclic prefix (CP). In light of this property, a new decision metric that measures the power of the data found on two minor diagonals in the covariance matrix related to the CP is introduced. The impact of synchronization errors on the signal detection is analyzed. Besides this, a likelihood-ratio test is proposed according to the Neyman-Pearson criterion after deriving probability distribution functions of the decision metric under hypotheses of signal presence and absence. A threshold, subject to the requirement of probability of false alarm, is derived; also the probabilities of detection and false alarm are computed accordingly. Finally, numerical simulations are conducted to demonstrate the effectiveness of the proposed algorithm.