• Journal of the Korean Association of Geographic Information Studies
• /
• 제11권2호
• /
• pp.93-107
• /
• 2008

Recently, there have been many projects regarding restoration of streams to recover their environmental and ecological functions. For the restoration of streams, it is valuable academically and economically to evaluate the ecological condition of streams and build a plan and an object for restoring streams based on that. On the other hand, one of the methods to figure out the ecological condition of streams is to evaluate the hydromorphological structure of stream. In this study we have developed a field survey system using the stream assessment methode of LAWA (Laenderarbeitsgemeinschaft Wasser in Germany) that can assess the hydromorphological structure of small and medium streams. In addition, we constructed a GIS-based stream assesment system which can support auto mapping system and report writing, using the survey results. These systems are aimed to help people in the area of restoring streams perceive the natural and ecological condition of streams in the process of making plans and managing the projects, and they also try to help in collecting raw data to determine an ideal potential model to which an existing stream should be turned.

• Journal of Korea Multimedia Society
• /
• 제5권5호
• /
• pp.488-493
• /
• 2002

MPEG-4 movies are composed of several media objects, organized in a hierarchical fashion. Those media objects are served to the clients as elementary streams. To play the movie, client players compose the elementary streams according to the meta- information called the scene graph. The meta-information streams are delivered as BIFS and OD elementary stream. Using dynamically generated BIFS and OD streams, we can provide a service something differs from traditional file services. For example, we can insert weather or stock information into the bottom of the screen while an existing movie was played in the screen. In this paper, we propose a dynamic service framework and dynamic server. Dynamic service framework is an object-oriented framework dynamically generating BIFS and OD streams based on the external DB information. Dynamic server provides a GUI for the server management and interface for registering dynamic services. In this framework, the dynamic service has the same interface as a file service. So, a dynamic service is considered as a file service by clients and other services.

• Journal of Korean Society on Water Environment
• /
• 제25권2호
• /
• pp.235-244
• /
• 2009

The purpose of this study is to offer information about the current river conditions and basic data of streams in Busan city, by selecting 20 underground streams and evaluating their multilateral stream assessment. Concerning the evaluation of streams, 4 sections including the general index, the bank index, the river characteristic index, and the ecological environment characteristic index were evaluated. Ahead of the evaluation, the study divided Busan city into 4 zone for a systematic river investigation. Then, the study allocated code names to each river, and conducted literature research and a field survey of streams. Based on this, the study applied the evaluation of multilateral stream assessment. As a result, out of 4 entire grades, there was no grade 1 or grade 2. Instead, 35% were grade 3, 60% were grade 4, and 5% were grade 5. When looking into the evaluation results by Zone, the Dongbusan Zone showed the highest index, and the Suyeonggang Zone, the Jungbusan Zone, and the Nakdonggang Zone followed, in order.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제12권2호
• /
• pp.9-17
• /
• 2012

Because best-effort Internet provides no guarantees on packet delay and loss, transient network congestion may cause negative effects on H.264/SVC streaming. Thus, the congestion control is required to adjust bit rate by dropping enhancement layers of H.264/SVC streams. This paper differentiates the video streams according to different levels of importance and proposes weighted-based congestion control algorithms to use the rate-distortion characteristics of streams. To maximize the weighted sum of PSNR values of all streams on a bandwidth-constrained node, this paper proposes WNS(Weighted Near-Sighted) and WFS(Weighted Far-Sighted) algorithms to control the number of enhancement layers of streams. Through simulation, this paper shows that weighted-based congestion control algorithm can efficiently adapt streams to network conditions and analyzes the characteristics of congestion control algorithms.

• The KIPS Transactions:PartB
• /
• 제10B권6호
• /
• pp.695-704
• /
• 2003

This paper proposes a new scheduling technique to play multimedia data streams in mobile terminals. The paper explores the characteristics of multimedia data streams , firstly. On basis of these characteristics, selection of specific data stream can be possible as well as transcoding protest. Our approach aims at reducing the early-stage delay time more effectively since it makes possible to select and transcodes some specific streams by employing a selection policy rather than transcoding all streams in the playing process Thus, this paper suggests a stream selection policy for the transcoding based on EPOB (End Point of Over Bandwidth). It aims to lower the required bandwidth of multimedia streams than the network bandwidth level and also to minimize early-stage delay time for multimedia streams, which is to be played in mobile terminals.

• Journal of KIISE:Databases
• /
• 제37권5호
• /
• pp.221-227
• /
• 2010

Web access sequence mining can discover the frequently accessed web pages pursued by users. Utility-based web access sequence mining handles non-binary occurrences of web pages and extracts more useful knowledge from web logs. However, the existing utility-based web access sequence mining approach considers web access sequences from the very beginning of web logs and therefore it is not suitable for mining data streams where the volume of data is huge and unbounded. At the same time, it cannot find the recent change of knowledge in data streams adaptively. The existing approach has many other limitations such as considering only forward references of web access sequences, suffers in the level-wise candidate generation-and-test methodology, needs several database scans, etc. In this paper, we propose a new approach for high utility web access sequence mining over data streams with a sliding window method. Our approach can not only handle large-scale data but also efficiently discover the recently generated information from data streams. Moreover, it can solve the other limitations of the existing algorithm over data streams. Extensive performance analyses show that our approach is very efficient and outperforms the existing algorithm.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• 제16권1호
• /
• pp.207-225
• /
• 2013

Current ecological stream restoration is focusing on recovery of physical characteristic and ecological functions of individual stream. For effective stream restoration, the relationship between stream environment and riparian flora should be investigated. The purpose of this study is to analyze the relationship between disturbance of hydromorphological structures and naturalized plants ratio in small to mid-sized streams. For the study sites, Gwanpyeong stream, Dongdal stream, and Yongchoo streams were chosen as 'reference stream' while, Gunnam stream, Anchang stream, and Hwa stream were chosen as 'damaged stream'. The hydromorphological structures of streams were evaluated with LAWA and flora of the streams were completely enumerated to calculate naturalized plants ratio. The result showed that there was a significant correlation between the outcome of LAWA and naturalized plants ratio(r=0.675, p<0.01). The result of factor analysis of LAWA identified three factors, 'River front and land use', 'River bed materials and structures', and 'Crossing structure and bar'. Among the factors of hydromorphological structures given by the result of factor analysis, 'river front and land use' and 'bed materials and structures' have statistically significant relationship with naturalized plants ratio($R^2$=0.470, p<0.01). Given this results, quantitative analysis on the relationship between disturbance of hydromorphological structures of streams and naturalized plants ratio could provide some essential information for stream restoration. Also, as this study figured out major factors of hydromorphological structures that affect naturalized plants ratio, it might help monitor ecological states and current problems of small and mid-sized streams.

• Journal of Intelligence and Information Systems
• /
• 제16권3호
• /
• pp.55-75
• /
• 2010

Sequential pattern mining aims to discover interesting sequential patterns in a sequence database, and it is one of the essential data mining tasks widely used in various application fields such as Web access pattern analysis, customer purchase pattern analysis, and DNA sequence analysis. In general sequential pattern mining, only the generation order of data element in a sequence is considered, so that it can easily find simple sequential patterns, but has a limit to find more interesting sequential patterns being widely used in real world applications. One of the essential research topics to compensate the limit is a topic of weighted sequential pattern mining. In weighted sequential pattern mining, not only the generation order of data element but also its weight is considered to get more interesting sequential patterns. In recent, data has been increasingly taking the form of continuous data streams rather than finite stored data sets in various application fields, the database research community has begun focusing its attention on processing over data streams. The data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. In data stream processing, each data element should be examined at most once to analyze the data stream, and the memory usage for data stream analysis should be restricted finitely although new data elements are continuously generated in a data stream. Moreover, newly generated data elements should be processed as fast as possible to produce the up-to-date analysis result of a data stream, so that it can be instantly utilized upon request. To satisfy these requirements, data stream processing sacrifices the correctness of its analysis result by allowing some error. Considering the changes in the form of data generated in real world application fields, many researches have been actively performed to find various kinds of knowledge embedded in data streams. They mainly focus on efficient mining of frequent itemsets and sequential patterns over data streams, which have been proven to be useful in conventional data mining for a finite data set. In addition, mining algorithms have also been proposed to efficiently reflect the changes of data streams over time into their mining results. However, they have been targeting on finding naively interesting patterns such as frequent patterns and simple sequential patterns, which are found intuitively, taking no interest in mining novel interesting patterns that express the characteristics of target data streams better. Therefore, it can be a valuable research topic in the field of mining data streams to define novel interesting patterns and develop a mining method finding the novel patterns, which will be effectively used to analyze recent data streams. This paper proposes a gap-based weighting approach for a sequential pattern and amining method of weighted sequential patterns over sequence data streams via the weighting approach. A gap-based weight of a sequential pattern can be computed from the gaps of data elements in the sequential pattern without any pre-defined weight information. That is, in the approach, the gaps of data elements in each sequential pattern as well as their generation orders are used to get the weight of the sequential pattern, therefore it can help to get more interesting and useful sequential patterns. Recently most of computer application fields generate data as a form of data streams rather than a finite data set. Considering the change of data, the proposed method is mainly focus on sequence data streams.

• International Journal of Advanced Culture Technology
• /
• 제2권1호
• /
• pp.14-19
• /
• 2014

In this paper, we propose a stream based patching technique in order to reduce demands of network output bandwidth required to provide the true video-on-demand (VoD) service in a Multimedia server. The proposed scheme calculates required streams to clients accurately by analyzing temporal relationships between already arrived requests in a multimedia server and still progressing streams, and then transmits streams freshly. Since our stream based patching technique induces new linking stream which is playing a link role between long and short patching streams, it reduces demand of network output bandwidth required to provide the true VoD service in a multimedia server. Accordingly, we know that the proposed scheme improves service latency and defection rate than those of existing patching technique by a simulation study.

• Journal of information and communication convergence engineering
• /
• 제12권2호
• /
• pp.109-115
• /
• 2014

This paper presents a concurrent channel time allocation scheme used in the reservation period for concurrent transmissions in 60-GHz wireless personal area networks (WPANs). To this end, the proposed resource allocation scheme includes an efficient method for creating a concurrent transmission group by using a table that indicates whether individual streams experience interference from other streams or not. The coordinator device calculates the number of streams that can be concurrently transmitted with each stream and groups them together on the basis of the calculation result. Then, the coordinator device allocates resources to each group such that the streams belonging to the same group can transmit data concurrently. Therefore, when the piconet coordinator (PNC) allocates the channel time to the individual groups, it should allow for maximizing the overall capacity. The performance evaluation result demonstrates that the proposed scheme outperforms the random grouping scheme in terms of the overall capacity when the beamwidth is $30^{\circ}C$ and the radiation efficiency is 0.9.