• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12A
• /
• pp.1002-1008
• /
• 2003

In terrestrial data broadcasting, we are just on the beginning stage in all aspects including implementation and design techniques and only asynchronous data processing has been receiving a little study. In this paper, we therefore propose an efficient processing algorithm for synchronization of asynchronous data by using trigger information to make more diverse service possible with a variety of contents. In the proposed algorithm, trigger data is encapsulated in DSM-CC section and transmitted in a form of MPEG-2 TS. The data is then separated in PC type set-top box and detached asynchronous data and trigger data are stored by the proposed algorithm. Pre-loaded asynchronous data is displayed when STC(system time clock) has the same value as PTS(presentation time stamp). Proper operation of the proposed algorithm was verified by using a content of asynchronous data with extensible markup language(XML) and a declarative application(DA) browser.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.9
• /
• pp.223-228
• /
• 2016

Nowadays users of Virtual Environment are want to play with thousands of players in an evolving virtual world at the same time over the internet. So, the load of this kind of Virtual Environments is heavier than that of any other precedents. One of load balancing methods is map-partition to divide the load of entire system which is vulnerable to delay message between clients and servers. In this paper, we propose a Migration Agent application server architecture using to help migration of player character between field servers and to reduce response time between clients and field servers. Migration Agent is reduce Player Character's responds time as Cache Server, if Player Character move to another Field Server, Player Character need the synchronization process in the DBMS approach, to minimize response time by reducing the period for cross - Player Character Field Server to perform the role. Field Server by placing them in form of a stack existing form of grid, for load concentrated on a specific server.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.133-138
• /
• 2009

This paper introduces a pilot CDMA network-based wireless lap time measurement system set up on a ski slope of Yongpyong Ski Resort. The wireless lap time measurement system is one output of U-Sports Project of Gangwon Province, which is intendended for promoting local strategic business and preparation for hosting 2018 Winter Olympic Games at Pyeongchang. A pair of laser sensors is installed at the entry and exit points of a section requiring lap time measurement on a ski slope. Each laser sensor is connected to a sensor node via wire so that the sensor node can detect the time when a skier enters or exits the section. Also each sensor node is connected to a CDMA network via a modem and receives a standard time from a NTP server. Each node executes the NTP algorithm to synchronize its local time to the received server time. As a result of the time synchronization, the sensor nodes maintain its local time within a resolution of at least 10 miliseconds and transmit the time of detection to a central control center. While the wireless lap time measurement system introduced in the paper does not need expensive measurement equipment, the system allows the central control center to provide lap time records in a more convenient manner compared to conventional manual lap time measuremnt methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.84-94
• /
• 2006

In this paper, we propose the algorithm to reduce guard time of UWB MAC time slot for throughput gain. In the proposed draft by multiband ofdm alliance (MBOA), Guard time of each medium access slot (MAS) is composed of shortest inter-frame space (SIFS) and MaxDrift which is the time caused by maximum frequency offset among devices. In this paper, to reduceguard time means that we nearly eliminate MaxDrift term from guard time. Each device of a piconet computes relative frequency offset from the device initiating piconet using periodically consecutive transferred beacon frames. Each device add or subtract the calculated relative frequency offset to the estimated each MAS starting point in order to synchronize with calculated MAS starting point of the device initiating piconet. According to verification of simulations, if the frequency offset estimator is implemented with 8 decimal bit, the ratio of the wasted time to Superframe is always less than 0.0001.

• KEPCO Journal on Electric Power and Energy
• /
• v.8 no.2
• /
• pp.159-179
• /
• 2022

Often a network becomes complex, and multiple entities would get in charge of managing part of the whole network. An example is a utility grid. While the entire grid would go under a single utility company's responsibility, the network is often split into multiple subsections. Subsequently, each subsection would be given as the responsibility area to the corresponding sub-organization in the utility company. The issue of how to make subsystems of adequate size and minimum number of interconnections between subsystems becomes more critical, especially in real-time simulations. Because the computation capability limit of a single computation unit, regardless of whether it is a high-speed conventional CPU core or an FPGA computational engine, it comes with a maximum limit that can be completed within a given amount of execution time. The issue becomes worsened in real time simulation, in which the computation needs to be in precise synchronization with the real-world clock. When the subject of the computation allows for a longer execution time, i.e., a larger time step size, a larger portion of the network can be put on a computation unit. This translates into a larger margin of the difference between the worst and the best. In other words, even though the worst (or the largest) computational burden is orders of magnitude larger than the best (or the smallest) computational burden, all the necessary computation can still be completed within the given amount of time. However, the requirement of real-time makes the margin much smaller. In other words, the difference between the worst and the best should be as small as possible in order to ensure the even distribution of the computational load. Besides, data exchange/communication is essential in parallel computation, affecting the overall performance. However, the exchange of data takes time. Therefore, the corresponding consideration needs to be with the computational load distribution among multiple calculation units. If it turns out in a satisfactory way, such distribution will raise the possibility of completing the necessary computation in a given amount of time, which might come down in the level of microsecond order. This paper presents an effective way to split a given electrical network, according to multiple criteria, for the purpose of distributing the entire computational load into a set of even (or close to even) sized computational loads. Based on the proposed system splitting method, heavy computation burdens of large-scale electrical networks can be distributed to multiple calculation units, such as an RTDS real time simulator, achieving either more efficient usage of the calculation units, a reduction of the necessary size of the simulation time step, or both.

• Journal of Embryo Transfer
• /
• v.19 no.3
• /
• pp.191-199
• /
• 2004

This study was conducted to examine in vitro development of porcine embryos constructed by the microinjection of cultured fetal fibroblast cells into porcine oocytes matured in vitro. Single fetal donor cells were deposited into the perivitelline space of enucleated oocytes, followed by electrical fusion and activation. Activated embryos were cultured in NCSU-23 medium supplemented with 5％ FBS, at 38.5$^{\circ}C$ for 6 to 8 days in 5％ $CO_2$ and air. In experiment 1, fusion rates of nuclear transfer embryos did not differ for fetal fibroblast cells incubated in 5％ FBS + NCSU-23 or 5％ FBS + TL Heaps medium, nor did fusion rates of donor cells differ between 1-8 hr incubation durations. Fusion rates for the four treatment subclasses ranged from 72.1％ to 78.0％. In experiment 2, Pre-synchronization in medium containing 0.1 $\mu\textrm{g}$/m Hoechst 33342 an increase from 0 and 8 versus 15 h culture an increased percentage of porcine fibroblast cells in G2/M at the end of the synchronization period (12.4％, 17.5％ and 47.6％). Neither an increase in the concentration of H 33342 (0.2-1.6 $\mu\textrm{g}$/$m\ell$) nor a longer exposure time (12h, 18h and 24h) increased the proportion of porcine G2/M fibroblasts. In experiment 3, fusion rates did not differ significantly far nuclear transfer embryos constructed using donor cells cultured in 5％ FBS + NCSU-23 medium for 1-2, 6-8 or 12-14 days (60.0％, 73.3％ and 62.5％), respectively. The cleavage rate for nuclear transplant embryos using fetal fibroblast cells cultured for 1-2 days was 44.0％, significantly less than 56.7％ and 50.0％. for 6-8 or 12-14 days duration of culture, respectively. In experiment 4, the proportions of nuclear transfer embryos that developed to the $\geq$2 cell and to the blastocyst stage were not affected significantly by culture medium (5％ FBS + NCSU-23 or 5％ FBS + TL-Heaps) or by $O_2$ concentration of the culture (5％ vs 10％). Rates of development to the $\geq$2 cell stage ranged from 65.9％ to 70.1％, and development rates to the blastocyst stage ranged from 9.8％ to 12.5％ for the four treatment subclasses. Developmental rate was highest for embryos cultured in 5％ FBS + NCSU-23 under a gas atmosphere of 5％ $O_2$ in air.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.337-343
• /
• 2006

The Stack Resource Policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is early blocking; the execution of a job is delayed instead of being blocked when requesting shared resources. If SRP is used with dynamic priority scheduling such as Earliest Deadline First (EDF), the early blocking requires that a scheduler should select the highest-priority job among the jobs that will not be blocked, incurring runtime overhead. In this paper, we analyze the runtime overhead of EDF scheduling when SRP is used. We find out that the overhead of job search using the conventional implementations of ready queue and job search algorithms becomes serious as the number of jobs increases. To solve this problem, we propose an alternative data structure for the ready queue and an efficient job-search algorithm with O([log$_2n$]) time complexity.

• Journal of Korean Society of Steel Construction
• /
• v.24 no.1
• /
• pp.1-11
• /
• 2012

To overcome the limitations of current evaluation procedures for floor vibration under crowd loading, two kinds of uncertainties associated with individual time lag differences and the complex behavior of crowd should be taken into account. The complex behavior of crowds has yet to be fully described, even though individual differences can be dealt with statistically. This paper proposes time lag considered (TLC) crowd model based on a probabilistic approach. The load reduction factor, which reflects the effect of a general degree of synchronization among crowd, is proposed. Extensive Monte Carlo simulations were carried out to determine various crowd behaviors by using the TLC crowd model proposed. The TLC crowd model can rationally treat the energy loss of various crowd patterns. This indicates that it may be used as a theoretical basis in refining dynamic load factor of crowd loading.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1868-1879
• /
• 1996

There are limitations to process high bandwidth traffic in B-ISDN with mesh- topology single bus architecture of current mobile communication system. And, it is impossible to import ATM switch using fixed length packet rather than variable length packet. Some implementations are able to process variable length packet, but there are some problems such as pre-processing for synchronization and bit delay. In this paper, we design a concentrator that can manipulate variable length packet without additional pre-process. There is on bit delay for packet starting signal in input interface, So it is more efficient to process packets, such that the concentrator can reduce he processing time as $\ulcornerlog2N\lrcorne＋1$ bit-time rather than N bit-time delay in ordinary concentrator. It is expected that the mobile communication system with partial mesh topology bus adopting the knockout switch architecture can process high bandwidth traffic in B-ISDN.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.30 no.8
• /
• pp.133-140
• /
• 2002

In this paper, the structure of integrated navigation computer for experiment is proposed. It is designed for considering the real time processing and data storage capacity. It will be used in missile, aircraft, submarine system and experimental vehicle. The I/O device supports IMU, GPS, odometer, altimeter, depth sensor, inclinometer etc. And the main storage device uses the tape device. That can improve the system stability. Therefore it can be used in a high dynamic or shock environment. The embedded linux is used as an Operating System. For the real time capability, sensor data processing and algorithm processing units are seperated. The time synchronization is referenced by IMU data.