• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.33 no.4
• /
• pp.63-70
• /
• 2005

LINK16 is a system which is designed to maximize performance in a particular tactical environment with high levels of jamming. In this paper, transmission performance of synchronization pattern for cipher communication in aerial tactical communication link is presented. Transmission architecture of operating mode (standard DP, P2SP, P2DP, P4mode) in LINK16 network is discussed, and an effect of synchronization pattern, a quality of degraded effect of transmission communication for collision probability between hopping frequencies and fading channel in crypto communication is analyzed.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.17 no.6
• /
• pp.136-143
• /
• 2018

Recently, with the rapid development of virtual reality technology, there have been more and more applications of virtual reality technology in various fields. In order to realize a virtual reality, a method of implementing a visualization environment through an HMD (Head Mounted Display) is widely used. However, in the current visualization environment through the HMD, the user feels dizziness when worn, It has the disadvantage of imposing restrictions on. In this study, it is aimed to realize virtual reality visualization environment through multi-screen environment which improves the experience effect of virtual environment by using existing screen instead of visualization through HMD, and compensates for shortcomings of HMD method. In order to realize a multi-screen environment as a highly visualized environment, a technique for matching the spatial position of the multi-screen with the spatial position of the virtual environment is required. To do this, we need an efficient method to precisely measure the position of the space, and we propose a spatial position compensation methodology that can efficiently and precisely measure the position of the real space and reflect it in the virtual environment.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3420-3433
• /
• 1999

Since most of CSCW(Computer-Supported Cooperative Work) systems have been developed for particular computing platforms, they are usable only within the specific organizations supporting those particular platforms. Recently, according to the rapid growth and continuing success of the World-Wide Web(WWW or Web) which offers a globally accessible platform-independent infrastructure, many CSCW systems has been constructed and is being developed on the basis of the Web. As one of such CSCW systems, in this paper, we describe the design and implementation of the CoSpace system. The CoSpace system provides shared workspaces, which enable members of a work group easily share information for collaborative work through their Web Browsers. The shared workspaces support information sharing and management between users, and also support event monitoring and synchronization between collaborative works.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1004-1009
• /
• 2004

Precise time synchronization is a main technology in high-speed communications, parallel and distributed processing systems, Internet information industry and electronic commerce. Synchronized clocks are useful for many leasers. Often a distributed system is designed to realize some synchronized behavior, especially in real-time processing in factories, aircraft, space vehicles, and military applications. Nowadays, time synchronization has been compulsory thing as distributed processing and network operations are generalized. A network time server obtains, keeps accurate and precise time by synchronizing its local clock to standard reference time source and distributes time information through standard time synchronization protocol. This paper describes design issues and implementation of a network time server for time synchronization especially based on a clock model. The system uses GPS (Global Positioning System) as a standard reference time source and offers UTC (universal Time coordinated) through NTP (Network Time protocol). Implementation result and performance analysis are also presented.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.901-908
• /
• 2006

With the development of wireless communication techniques and mobile environment we are able to transmit data between mobile systems without restriction of time and space. Recently, researches on the data communication between mobile systems have focused on a small amount of sending out or receiving data and data synchronization at a fixed server and mobile clients in mobile environment. However, two more servers should be able to move mutual independently, information is shared with other systems, and data is synchronized in the special environment like a battlefield situation. Therefore, we propose a data synchronization method between systems moving mutual independently in mobile environment. The proposed method is an optimization solution to data propagation path between servers that considers limited bandwidth and process of data for disconnection communication. In addition, we propose a data reduction method that considers importance and sharing of information in order to reduce data transmission between huge servers. We verified the accuracy of data after accomplishing our data synchronization method by applying it in the real world environment. Additionally, we showed that our method could accomplish data synchronization normally within an allowance tolerance when we considered data propagating delay time by server extension.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.51-56
• /
• 2009

Time synchronization algorithm in wireless sensor networks is essential to various applications such as object tracking, data encryption, duplicate detection, and precise TDMA scheduling. This paper describes CDRS that is a time synchronization algorithm using the Clock Drift rate and Reference Signals between two sensor nodes. CDRS is composed of two steps. At first step, the time correction is calculated using offset and the clock drift rate between the two nodes based on the LTS method. Two nodes become a synchronized state and the time variance can be compensated by the clock drift rate. At second step, the synchronization node transmits reference signals periodically. This reference signals are used to calculate the time difference between nodes. When this value exceeds the maximum error tolerance, the first step is performed again for resynchronization. The simulation results on the performance analysis show that the time accuracy of the proposed algorithm is improved, and the energy consumption is reduced 2.5 times compared to the time synchronization algorithm with only LTS, because CDRS reduces the number of message about 50% compared to LTS and reference signals do not use the data space for timestamp.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.622-629
• /
• 2004

Recently, as digital broadcasting and internet are spreaded out of the world, we can easily use informations with less restrictions of time and space. According to the current trends, concerns for the ways of representing multimedia data has been rapidly increased, and users demand the services with integrated document that takes not only simple text and image but also time varying audio-visual data. Therefore, in 1998, W3C presented an international standard, SMIL in order to solve multimedia object representation and synchronization problems. By using SMIL, various multimedia elements can be integrated as a multimedia document with proper view in a space and time. Using this SMIL document, we can create new internet radio broadcasting service that delivers not only audio data but also various text, image and video. In this paper, we describe on a SMIL document editor for the common users to be able to represent time varying multimedia data with special layout and synchronization of time and space.

• Journal of Astronomy and Space Sciences
• /
• v.34 no.1
• /
• pp.19-30
• /
• 2017

The optical wide-field patrol network (OWL-Net) is a Korean optical surveillance system that tracks and monitors domestic satellites. In this study, a batch least squares algorithm was developed for optical measurements and verified by Monte Carlo simulation and covariance analysis. Potential error sources of OWL-Net, such as noise, bias, and clock errors, were analyzed. There is a linear relation between the estimation accuracy and the noise level, and the accuracy significantly depends on the declination bias. In addition, the time-tagging error significantly degrades the observation accuracy, while the time-synchronization offset corresponds to the orbital motion. The Cartesian state vector and measurement bias were determined using the OWL-Net tracking data of the KOMPSAT-1 and Cryosat-2 satellites. The comparison with known orbital information based on two-line elements (TLE) and the consolidated prediction format (CPF) shows that the orbit determination accuracy is similar to that of TLE. Furthermore, the precision and accuracy of OWL-Net observation data were determined to be tens of arcsec and sub-degree level, respectively.

• Publications of The Korean Astronomical Society
• /
• v.23 no.2
• /
• pp.91-107
• /
• 2008

In this paper, we introduce the performance evaluation and development of Raw VLBI Data Buffer(RVDB) system for the synchronized playback processing of observed data in Korea-Japan Joint VLBI Correlator(KJJVC). The high-speed correlation processing system is under development so that the radio data obtained with 8192 channels and 8 Gbps speed from 16 stations will be able to be processed. When the recorded data of each station are played to correlator, the time synchronization of each station is very important because the correlator should process the data obtained with same time and condition. There are many types of recorder systems in the East Asia VLBI Network (EAVN). Therefore it is required to prepare the special time synchronized playback processing system to synchronize the time tag of observed data. The developed RVDB system consists of Data Input Output(DIO), 10GbE switch, and Disk Data Buffer(DDB). It can record the data with maximum 2 Gbps speed, and can play back the data to correlator with nominal 2 Gbps speed. To enable to play back the data of different playback system to the correlator, we developed the high-speed time synchronized playback processing system. We carried out the experiments of playing back and correlation for gigabit correlator and VCS trial product so as to confirm the performance of developed time synchronized playback processing system. In case of online and offline playing back experiment for gigabit correlator, we confirmed that the online and offline correlation results were the same. In case of playing back experiment for VCS trial product, we verified that the wide band and narrow band correlation results were also the same. Through the playing back experiments of RVDB system, the effectiveness of developed RVDB system was verified. In this paper, the system design, construction and experimental results are shown briefly.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.301-305
• /
• 2008

Races must be detected for debugging OpenMP programs with directives, because they may cause unintended nondeterministic results of programs. Intel Thread Checker, an existing tool that can detects races, can not verify the existence of races and is often time-consuming and tends to require large space. To solve these problems, we developed a tool that verifies the existence of races using user requirements and analyzed model of programs. However, the tool does not have optimal performance in programs which have no synchronization for interthread coordination. This paper presents an optimal tool that applies the optimum labeling and protocol for program models without interthread coordination. For synthetic programs without interthread synchronization, the tool verifies races over 250 times faster than the previous tool on the average, even if the maximum parallelism increases in every case of which the number of total accesses are identical.