• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.200-214
• /
• 2000

In general, it is difficult to transmit a VBR video like MPEG efficiently since MPEG fames are construct with various size. To solve this problem, some bandwidth smoothing techniques are proposed which is based on the prefetching video data into the client buffer with low bandwidth allocation. However these techniques do not provide efficient bandwidth smoothing technology and transmission technique for interactive video services like VCR-like functionality. In this paper, we propose and evaluated a new bandwidth allocation mechanism for interactive video services which has VBR traffic characteristics such a MPEG. This technique provides VCR-like functionality which is not supported on previous techniques and also maximizes the bandwidth utilization when interactive video services are provided. Through our experimental, we prove that the proposed technique dramatically decreases a traffic and guarantee the continuous playback simulaneously.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.821-830
• /
• 2006

As internet worms are spread out worldwide, the detection and filtering of worms becomes one of hot issues in the internet security. As one of implementation methods to detect worms, the Linux Netfilter kernel module can be used. Its basic operation for worm detection is a string matching where coming packet(s) on the network is/are compared with predefined worm signatures(patterns). A worm can appear in a packet or in two (or more) succeeding packets where some part of worm is in the first packet and its remaining part is in its succeeding packet(s). Assuming that the maximum length of a worm pattern is less than 1024 bytes, we need to perform a string matching up to two succeeding packets of 2048 bytes. To do so, Linux Netfilter keeps the previous packet in buffer and performs matching with a combined 2048 byte string of the buffered packet and current packet. As the number of concurrent connections to be handled in the worm detection system increases, the total size of buffer (memory) increases and string matching speed becomes low In this paper, to reduce the memory buffer size and get higher speed of string matching, we propose a string matching scheme without using buffer. The proposed scheme keeps the partial matching result of the previous packet with signatures and has no buffering for previous packet. The partial matching information is used to detect a worm in the two succeeding packets. We implemented the proposed scheme by modifying the Linux Netfilter. Then we compared the modified Linux Netfilter module with the original Linux Netfilter module. Experimental results show that the proposed scheme has 25% lower memory usage and 54% higher speed compared to the original scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.4
• /
• pp.531-540
• /
• 1994

Spline curve scheme is the most valuable tool for the CAD of industrial products. Hence, the development of a new, effective curve scheme can have immediate impact on the current design industries. This paper develops and implements a new methodology for the implementation of the visually continuous class of splines which can produce a more flexible and diverse curve shapes. This class of splines has advantaged over existing splines in that it can accommodate wider range of shapes while maintaining the interpolators property of the ordinary cardinal splines. Most importantly, we avoid using the previous method of implementing G$^1$ curves, where users must specify scalar values for the control of curve shapes. We derive and implement an easy-to -use transformation between the user-specified graphical tangent vectors and the actual parameters for the resulting curve. Since the resulting curve shape reflects original tangential direction faithfully, CAD users can simply represent approximate curve shapes with proper tangents. Consequently, a simple user interface device such as a mouse can effectively produce a various spline curves using the proposed spline tool.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.11a
• /
• pp.131-134
• /
• 2020

최근 '코로나 19 (COVID-19)'와 '최저임금 이슈' 등 다양한 외적 요인들이 아르바이트를 포함한 고용시장을 변화시키고 있다. 생계와 학자금을 위해 아르바이트에 뛰어드는 청년들에게는 악재의 연속이다. 이처럼 외부 환경은 점점 구직자에게 불리하게 작용하는데 반해, 이들을 사용자로 둔 구인구직 플랫폼은 수년 째 변화의 모습을 보이지 않는다. 기존 플랫폼은 구인자에게 지나치게 유리한 소통구조를 지니고 있으며, 최근 고용시장의 변화에 따른 단기 및 대타 고용의 수요를 충족시키지 못한다. 따라서 본 논문에서는 기존 구인구직 플랫폼의 문제점을 지적함과 동시에 플랫폼이 사용자의 편의를 충족시키기 위해 지녀야 할 고용의 역방향성과 데이터베이스 기반 필터링 및 추천과 같은 핵심 기능들에 대해 자세히 밝히고자 한다. 이를 통해, 사회적 트렌드인 긱 경제를 활성화시킬 뿐만 아니라 구직자 다수를 차지하는 청년들의 구직부담을 완화시킬 수 있을 것이라 기대한다.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.89-98
• /
• 2009

As data stream is entered into system continuously and the memory space is limited, the data exceeding the memory size cannot be processed. In order to solve the problem, load shedding methods which drop a part of data to prevent exceeding the storage space have been researched. Generally, a traditional load shedding method uses random sampling with optimized rate according to data deviation. The method samples data not to distinguish those used in spatial query because the method uses only a random sampling with optimized rate according to data deviation. Therefore, the accuracy of query was reduced in u-GIS environment including spatial query. In this paper, we researched a new load shedding method improving accuracy of the query in u-GIS environment which runs spatial query and aspatial query simultaneously. The method uses a new sampling method that samples data having low probability used in query. Therefore proposed method improves spatial query accuracy and query processing speed as applying spatial filtering operation to sampling operator.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1337-1345
• /
• 1996

Edge detection is the first step and very important step in image nalyisi. In this paper, proposed edge detection algorithm based on informations of edge structures and it is different from other classical edge detection operators such asgradient and surface fitting algorithm. The firs, we defined characteristics of edge structures such as continuity, thinness, localization, length. The second, we defined valid edge structures and ideal edge pixel positions in $3\times3$ window based on edge characteristics of edge structures. And we proposed twelve windows for enhance dissimilarity regions based on valid edge structures and ideal edge pixel positions. In specially, proposed algorithm was shown better performance of edge detection than other operators such as gradient operator and the LoG(Laplacian of gradient) operator of zero crossings in noisy test image with $\sigma=30$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1956-1969
• /
• 1993

The tilted Huffman trees are used in JPEG and MPEG image compression standards for Huffman coding. In this paper we propose a new decoding technique for Huffman code, symbols are decoded by repeatedly obtaining the predefined number of consecutive bits and accessing symbol tables based on the obtaining bits. We show that the size of the symbol table can be small if the Huffman tree is tilted. Specifically, we show an upper bound on the size in this paper. Since the proposed method processes multiple bits at each clock, it can be used for real time processing. We show such evaluation results.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.10
• /
• pp.293-302
• /
• 2016

Since the electricity is produced and consumed simultaneously, predicting the electric load and securing affordable electric power are necessary for reliable electric power supply. In particular, a university campus is one of the highest power consuming institutions and tends to have a wide variation of electric load depending on time and environment. For these reasons, an accurate electric load forecasting method that can predict power consumption in real-time is required for efficient power supply and management. Even though various influencing factors of power consumption have been discovered for the educational institutions by analyzing power consumption patterns and usage cases, further studies are required for the quantitative prediction of electric load. In this paper, we build an electric load forecasting model by implementing and evaluating various machine learning algorithms. To do that, we consider three building clusters in a campus and collect their power consumption every 15 minutes for more than one year. In the preprocessing, features are represented by considering periodic characteristic of the data and principal component analysis is performed for the features. In order to train the electric load forecasting model, we employ both artificial neural network and support vector machine. We evaluate the prediction performance of each forecasting model by 5-fold cross-validation and compare the prediction result to real electric load.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.54-62
• /
• 2010

Inverted index structures have become the most efficient data structure for high performance indexing of large text collections, especially online index maintenance, In-Place and merge-based index structures are the two main competing strategies for index construction in dynamic search environments. In the above-mentioned two strategies, a contiguity of posting information is the mainstay of design for online index maintenance and query time. Whereas with the emergence of new storage device(SSD, SCRAM), those do not consider a contiguity of posting information in the design of index structures because of its superiority such as low access latency and I/O throughput speeds. However, SSD(Solid State Drive) is not well suited for traditional inverted structures due to the poor random write throughput in practical systems. In this paper, we propose the new efficient online index structure(SPM) for SSD that significantly reduces the query time and improves the index maintenance performance.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.709-718
• /
• 2002

Cluster based VOD systems require elaborate load balancing and buffer management techniques in order to ensure real-time display for multiuser concurrently. In this paper, we propose a new load balancing technique based on the dynamic buffer partitioning in cluster based VOD servers. The proposed technique evenly distribute the user requests into each service node according to its available buffer capacity and disk access rate. In each node, the dynamic buffer partitioning technique dynamically partitions the buffer to minimize the average waiting time for the requests that access the same continuous media. The simulation results show that our proposed technique decreases the average waiting time by evenly distributing the user requests compared with the exiting techniques and then increases the throughput in each node. Particularly under the overloaded condition in the cluster server, the simulation probes that the performance of the proposed technique is better two times than the Generalized Interval Caching based technique.