• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.793-805
• /
• 2001

In the recent priority system, high-priority packet will be served first and low-priority packet will be served when there isn\`t any high-priority packet in the system. By the way, even high-priority packet can be blocked by HOL (Head of Line) contention in the input queueing System. Therefore, the whole switching performance can be improved by serving low-priority packet even though high-priority packet is blocked. In this paper, we study the performance of preemptive priority in an input queueing switch for high speed switch system. The analysis of this switching system is taken into account of the influence of priority scheduling and the window scheme for head-of-line contention. We derive queue length distribution, delay and maximum throughput for the switching system based on these control schemes. Because of the service dependencies between inputs, an exact analysis of this switching system is intractable. Consequently, we provide an approximate analysis based on some independence assumption and the flow conservation rule. We use an equivalent queueing system to estimate the service capability seen by each input. In case of the preemptive priority policy without considering a window scheme, we extend the approximation technique used by Chen and Guerin [1] to obtain more accurate results. Moreover, we also propose newly a window scheme that is appropriate for the preemptive priority switching system in view of implementation and operation. It can improve the total system throughput and delay performance of low priority packets. We also analyze this window scheme using an equivalent queueing system and compare the performance results with that without the window scheme. Numerical results are compared with simulations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.409-412
• /
• 2002

In this paper, We present a designe method for the PC User Interface. Also, the system implementation for T33521 is a interface controller of MMC and SSFCD card which operated with limit speed 12Mbit/s in USB Ver.1.1 and under circumstances windows 95, 98 and Mac Os 8.1. Using this controller, we implemented functional design such as automatic reading, memory block read/write, and file property of 8M/16M flash memory and 32M SMC.

• Journal of Digital Convergence
• /
• v.13 no.8
• /
• pp.245-251
• /
• 2015

If a digital signage system is operated in PC mounted in the Window OS then the implementing price is very high. For resolving this problem, we used the Smartphone mounted in ARM Cortex family of multi-core processor-based mobile platform. We developed a low-power low-cost digital signage system and a remote convergence content management program based on web server. This convergence system manages advertising content to a remote control device anywhere using remote control technology. This system is one integrated system with display and is a low-power consumed and is developed in very efficient hardware interface. And condition sensors(intensity of illumination, temperature, weather, GPS etc) is equipped in the developed system. Automatic contents builder and Context-aware SMIL module is also implemented in the convergence system. We achieved over 50% power savings comparing with conventional Window OS system and 16 points multi-touch in our system.

• Journal of the Korea Convergence Society
• /
• v.9 no.8
• /
• pp.171-177
• /
• 2018

In 3D printing technologies, many parameters should be optimized for obtaining a part with higher quality. FDM (fused deposition modeling) printer has also diverse parameters to be optimized. Among them, it can be said that nozzle temperature and moving speed of nozzle are fundamental parameters. Thus, it should be preceded to know the optimal combination of the two parameters in the use of FDM 3D printer. In this paper, a new method is proposed to estimate the range of the stable combinations of the two parameters, based on the single line quality. The proposed method was verified by comparing the results between single line printing and multi-layered single line printing. Based on the comparison, it can be said that the proposed method is very meaningful in that it has a simple test approach and can be easily implemented. In addition, it is very helpful to provide the basic data for the optimization of process parameters.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.782-790
• /
• 2017

The service, 'Hot Search Keywords', provides a list of the most hot search terms of different web services such as Naver or Daum. The service, bases the changes in rank of a specific search keyword on changes in its users' interest. This paper introduces a temporal modelling framework for predicting the rank change of hot search keywords using past rank data and machine learning. Past rank data shows that more than 70% of hot search keywords tend to disappear and reappear later. The authors processed missing rank value, using deletion, dummy variables, mean substitution, and expectation maximization. It is however crucial to calculate the optimal window size of the past rank data. We proposed an optimal window size selection approach based on the minimum amount of time a topic within the same or a differing context disappeared. The experiments were conducted with four different machine-learning techniques using the Naver, Daum, and Nate 'Hot Search Keywords' datasets, which were collected for 2 years.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.123-128
• /
• 2012

In order to overcome the hardware complexity and performance limit problems, recently the multi-core architecture has been prevalent. For hardware simplicity, usually RISC processor is adopted as the unit core processor. However, if the performance of unit core processor is enhanced, the overall performance of the multi-core processor architecture can be further enhanced. In this paper, in-order superscalar processor is utilized as the core for the multi-core processor architecture. Using SPEC 2000 benchmarks as input, the trace-driven simulation has been performed for the number of superscalar cores between 2 and 16 and the window size of 4 to 16 extensively. As a result, the 16-core superscalar processor for the window size of 16 results in 8.4 times speed up over the single core superscalar processor. When compared with the same number of cores, the multi-core superscalar processor performance doubles that of the multi-core RISC processor.

• Journal of Korea Multimedia Society
• /
• v.14 no.8
• /
• pp.1041-1049
• /
• 2011

According to the development of society and infrastructure, effective underground facility management is growing more important them ever. In the process various monitoring systems are studied and developed for water works pipe-network. Especially, RTD-1000 system with the based on Pc. Reflector-monitoring device is constructed and steered by several local governments. But, this system have to be improved result from based on PC system structure at the point of resource management, heat, power consumption and size. In this paper, RTD-2000 is proposed are a substitution of improved RTD-1000 with many respect and portable one. This system is designed and implemented with ARM-9 development kit based on WinCE and LCD eliminate TDR(Time Domain Reflector-Meter). Various surveillance programs based on windows are mounted on RTD-1000 are replaced with dedicated embedded application softwares. Simulation and evaluation for performance comparison are performed for the prove of effectiveness of RTD-2000.

• Journal of KIISE
• /
• v.43 no.8
• /
• pp.919-926
• /
• 2016

In a wireless network, TCP causes the performance degradation because of mistaking packet loss, which is caused by characteristics of wireless link and throughput oscillation due to change of devices connected on a limited bandwidth. Delay based TCP is not affected by packet loss because it controls window size by using the RTT. Therefore, it can solve the problem of unnecessary degradation of the rate caused by misunderstanding reason of packet loss. In this paper, we propose an algorithm for improving the remaining problems by using delay based TCP. The proposed scheme can change throughput adaptively by adding the RTT, which rapidly reflects the network conditions to BaseRTT. It changes the weight of RTT and the increases and decreases window size based on the remaining amount of the buffer. The simulation indicated that proposed scheme can alleviate the throughput oscillation problem, as compared to the legacy TCP Vegas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11C
• /
• pp.940-947
• /
• 2010

Motion Compensated Frame Interpolation(MCFI) has been used to reduce motion jerkiness for dynamic scenes and motion blurriness for LCD-panel display as post processing for high quality display. However, MCFI that directly uses the motion information often suffers from annoying artifacts such as blockiness, ghost effects, and deformed structures. So in this paper, we propose a novel edge-based adaptively weighted vector median filter as post-processing. At first, the proposed method generates an edge direction map through a sobel mask and a weighted maximum frequent filter. And then, outlier MVs are removed by average of angle difference and replaced by a median MV of $3{\times}3$ window. Finally, weighted vector median filter adjusts the weighting values based on edge direction derived from spatial coherence between the edge direction continuity and motion vector. The results show that the performance of PSNR and SSIM are higher up to 0.5 ~ 1 dB and 0.4 ~ 0.8 %, respectively.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.513-524
• /
• 2006

Normalization transform is very useful for finding the overall trend of the time-series data since it enables finding sequences with similar fluctuation patterns. The previous subsequence matching method with normalization transform, however, would incur index overhead both in storage space and in update maintenance since it should build multiple indexes for supporting arbitrary length of query sequences. To solve this problem, we propose a single index approach for the normalization transformed subsequence matching that supports arbitrary length of query sequences. For the single index approach, we first provide the notion of inclusion-normalization transform by generalizing the original definition of normalization transform. The inclusion-normalization transform normalizes a window by using the mean and the standard deviation of a subsequence that includes the window. Next, we formally prove correctness of the proposed method that uses the inclusion-normalization transform for the normalization transformed subsequence matching. We then propose subsequence matching and index building algorithms to implement the proposed method. Experimental results for real stock data show that our method improves performance by up to $2.5{\sim}2.8$ times over the previous method. Our approach has an additional advantage of being generalized to support many sorts of other transforms as well as normalization transform. Therefore, we believe our work will be widely used in many sorts of transform-based subsequence matching methods.