• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1122-1125
• /
• 2015

자연언어 분석에 있어서 형태소 분석은 핵심적인 기술로 요구되고 있다. 한글 형태소 분석기는 한글을 분석하기 위한 알고리즘을 활용하여 형태소 단위로 분석한다. 하지만 한글과 문장부호가 혼용된 특수어절은 한글을 분석하는 알고리즘을 통하여 정확한 결과를 도출할 수가 없으므로 별도의 알고리즘이 필요하다. 본 논문에서는 이러한 문제점을 특수어절에 공백을 삽입하여 다시 어절로 분리해 내는 알고리즘을 적용하여 해결하고자 한다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.23 no.2
• /
• pp.59-67
• /
• 2015

When planning for streams, adequate and definite flood control should be in the primary consideration of the planner; likewise, flood control is the basic prerequisite for the recent river restoration taking place nationwide. Planning 'safe' streams and rivers that are predictable and controllable begins from accurate survey data. In this research, we will create streams in 3D terrain models and apply them through hydraulic analysis and restoration using smart geospatial information. This process allows the extraction of more accurate data regarding streams and rivers, which makes possible precise hydraulic analysis that is superior in details to the conventional methods. The study also proposes optimal vertical section interval for efficient data processing on hydraulic analysis, applicable when LiDAR data is utilized on hydraulic analysis of urban streams. The study proposes 3D design plan and various applications for spatially planning and restoring rivers and streams.

• The Journal of Society for e-Business Studies
• /
• v.15 no.4
• /
• pp.165-179
• /
• 2010

Recently, the processing of data streams such as stock quotes, buy-sell orders, and billing records becomes more important in e-Business environments. Especially, the use of skyline queries over data streams is rapidly increasing to support multiple criteria decision making. Given a set of multi-dimensional tuples, a skyline query retrieves a set of tuples which are not dominated by other tuples. Although there has been much work on processing skyline queries over static datasets, there has been relatively less work on processing multiple skyline queries over data streams. In this paper, we propose an efficient method for processing multiple continuous skyline queries over data streams. The proposed method efficiently identifies which tuple is a skyline tuple of which query, resulting in a lower cost of processing multiple skyline queries. Through performance evaluation, we show the performance advantage of the proposed method.

• Journal of Information Processing Systems
• /
• v.7 no.4
• /
• pp.717-732
• /
• 2011

Classification in biomedical applications is an important task that predicts or classifies an outcome based on a given set of input variables such as diagnostic tests or the symptoms of a patient. Traditionally the classification algorithms would have to digest a stationary set of historical data in order to train up a decision-tree model and the learned model could then be used for testing new samples. However, a new breed of classification called stream-based classification can handle continuous data streams, which are ever evolving, unbound, and unstructured, for instance--biosignal live feeds. These emerging algorithms can potentially be used for real-time classification over biosignal data streams like EEG and ECG, etc. This paper presents a pioneer effort that studies the feasibility of classification algorithms for analyzing biosignals in the forms of infinite data streams. First, a performance comparison is made between traditional and stream-based classification. The results show that accuracy declines intermittently for traditional classification due to the requirement of model re-learning as new data arrives. Second, we show by a simulation that biosignal data streams can be processed with a satisfactory level of performance in terms of accuracy, memory requirement, and speed, by using a collection of stream-mining algorithms called Optimized Very Fast Decision Trees. The algorithms can effectively serve as a corner-stone technology for real-time classification in future biomedical applications.

• Journal of Information Processing Systems
• /
• v.6 no.1
• /
• pp.79-90
• /
• 2010

A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. The continuous characteristic of streaming data necessitates the use of algorithms that require only one scan over the stream for knowledge discovery. Data mining over data streams should support the flexible trade-off between processing time and mining accuracy. In many application areas, mining frequent itemsets has been suggested to find important frequent itemsets by considering the weight of itemsets. In this paper, we present an efficient algorithm WSFI (Weighted Support Frequent Itemsets)-Mine with normalized weight over data streams. Moreover, we propose a novel tree structure, called the Weighted Support FP-Tree (WSFP-Tree), that stores compressed crucial information about frequent itemsets. Empirical results show that our algorithm outperforms comparative algorithms under the windowed streaming model.

• Journal of Broadcast Engineering
• /
• v.9 no.2
• /
• pp.119-130
• /
• 2004

We have developed a prototype super-high-definition (SHD) digital cinema distribution system that can store, transmit, and display eight-million-pixel motion pictures that have the image quality of a 35-mm film movie. The system contains a movie server, a real-time decoder, and an SHB projector. Using a Gigabit Ethernet link and TCP/IP, the server transmits JPEG2000 compressed motion picture data streams to the decoder at transmission speeds as high as 300 Mbps. The received data streams are decompressed by the decoder, and then projected onto a screen via the projector. By using an enlarged TCP window, multiple TCP streams, and a shaping function to control the data transmission quantity, we achieved real-time streaming of SHD movie data at about 300 Mbps between Chicago and Los Angeles, a distance of more than 3000 km. We also improved the decoder performance to show movies with Image qualities of 450 Mbps or higher. Since UDP is more suitable than TCP for fast long-distance streaming, we have developed an SHD digital cinema UDP relay system, in which UDP is used for transmission over a fast long-distance network. By using four pairs of server-side-proxy and decoder-side-proxy, 450-Mbps movie data streams could be transmitted.

• Journal of Information Processing Systems
• /
• v.11 no.1
• /
• pp.39-56
• /
• 2015

Continuous multi-interval prediction (CMIP) is used to continuously predict the trend of a data stream based on various intervals simultaneously. The continuous integrated hierarchical temporal memory (CIHTM) network performs well in CMIP. However, it is not suitable for CMIP in real-time mode, especially when the number of prediction intervals is increased. In this paper, we propose a real-time integrated hierarchical temporal memory (RIHTM) network by introducing a new type of node, which is called a Zeta1FirstSpecializedQueueNode (ZFSQNode), for the real-time continuous multi-interval prediction (RCMIP) of data streams. The ZFSQNode is constructed by using a specialized circular queue (sQUEUE) together with the modules of original hierarchical temporal memory (HTM) nodes. By using a simple structure and the easy operation characteristics of the sQUEUE, entire prediction operations are integrated in the ZFSQNode. In particular, we employed only one ZFSQNode in each level of the RIHTM network during the prediction stage to generate different intervals of prediction results. The RIHTM network efficiently reduces the response time. Our performance evaluation showed that the RIHTM was satisfied to continuously predict the trend of data streams with multi-intervals in the real-time mode.

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• pp.310-315
• /
• 1999

We extracted narrow open water streams from JERS-1 SAR images of the Amazon rain forest. The extracted range of these streams were almost comparable to a high level extraction of the same streams from near-IR images of JERS-1 VNIR data notwithstanding that these features in SAR images show the strong dependence of the observation angle. Large water bodies are relatively easy to extract from JERS-1 SAR images, as they tend to appear as very dark areas; but streams whose width is nearly equal to or less than the spatial resolution no longer appear as very dark features. By using strong scatterers distributed sparsely along the radar facing sides of the streams, we can successfully estimate approximate ranges of waterways and then extract relatively dark line-like features within these ranges.

• Journal of Computing Science and Engineering
• /
• v.7 no.4
• /
• pp.220-230
• /
• 2013

In recent years, progress in hardware technology has resulted in the possibility of monitoring many events in real time. The volume of incoming data may be so large, that monitoring all individual data might be intractable. Revisiting any particular record can also be impossible in this environment. Therefore, many database schemes, such as aggregation, join, frequent pattern mining, and indexing, become more challenging in this context. This paper surveys the previous efforts to resolve these issues in processing data streams. The emphasis is on specifying and processing sliding window queries, which are supported in many stream processing engines. We also review the related work on stream query processing, including synopsis structures, plan sharing, operator scheduling, load shedding, and disorder control.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.71-74
• /
• 2009

The data-flow paradigm has been employed in various application areas. It is particularly useful where large data-streams must be processed, for example in video and audio processing, or for scientific visualization. A video-based 3D reconstruction system should process multiple synchronized video streams. The system exhibits many properties that can be targeted using a data-flow approach that is naturally divided into a sequence of processing tasks. In this paper we introduce our concept to apply the data-flow approach to a multi-video 3D reconstruction system.