• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1367-1383
• /
• 2007

A sensor network consists of a network of sensors that can perform computation and also communicate with each other through wireless communication. Some important characteristics of sensor networks are that the network should be self administered and the power efficiency should be greatly considered due to the fact that it uses battery power. In sensor networks, when large amounts of various stream data is produced and multiple queries need to be processed simultaneously, the power efficiency should be maximized. This work proposes a technique to create an index on multiple monitoring queries so that the multi-query processing performance could be increased and the memory and power could be efficiently used. The proposed SMILE tree modifies and combines the ideas of spatial indexing techniques such as k-d trees and R+-trees. The k-d tree can divide the dimensions at each level, while the R+-tree improves the R-tree by dividing the space into a hierarchical manner and reduces the overlapping areas. By applying the SMILE tree on multiple queries and using it on stream data in sensor networks, the response time for finding an indexed query takes in some cases 50% of the time taken for a linear search to find the query.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2007.08a
• /
• pp.802-805
• /
• 2007

A hardware architecture is presented of a wavelet based multiple line addressing driving scheme for passive matrix displays using the FPGA (Field Programmable Gate Arrays), which will be integrated in the scalable video coding $architecture^{[1]}$. The incoming compressed video data stream will then directly be transformed to the required column voltages by the hardware architecture without the need of employing the video decompression.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.459-468
• /
• 2008

A data stream which is a massive unbounded sequence of data elements continuously generated at a rapid rate. Many recent research activities for emerging applications often need to deal with the data stream. Such applications can be web click monitoring, sensor data processing, network traffic analysis. telephone records and multi-media data. For this. data processing over a data stream are not performed on the stored data but performed the newly updated data with pre-registered queries, and then return a result immediately or periodically. Recently, many studies are focused on dealing with a data stream more than a stored data set. Especially. there are many researches to optimize continuous queries in order to perform them efficiently. This paper proposes a query optimization algorithm to manage continuous query which has multiple join operators(Multi-way join) over data streams. It is called by an Extended Greedy query optimization based on a greedy algorithm. It defines a join cost by a required operation to compute a join and an operation to process a result and then stores all information for computing join cost and join cost in the statistics catalog. To overcome a weak point of greedy algorithm which has poor performance, the algorithm selects the set of operators with a small lay, instead of operator with the smallest cost. The set is influenced the accuracy and execution time of the algorithm and can be controlled adaptively by two user-defined values. Experiment results illustrate the performance of the EGA algorithm in various stream environments.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.5B
• /
• pp.479-486
• /
• 2010

Reliable hydrologic data acquisition is the basic and essential requirement for efficient water management. Especially the acquisition of various stream data in a certain location is very important to construct on alarm system to response an urban flood which occurs frequently due to the effect of climate change. Although the frequency of stream inundation flood occurrence becomes low owing to the consistent stream improvement, the urban flood due to the drainage system problems such as deterioration and bad management occurs continuously. The consistent management and current status understanding of the urban drainage system is essential to reduce the urban flood. The purpose of this study is to develop the urban runoff network flow velocity monitoring system which has the capability of collecting stream data whenever, wherever and to whomever without expert knowledge using Code Division Multiple Access technique and Bluetooth near-distance wireless communication technique. The urban runoff network flow velocity monitoring system consists of three stages. In the first stage, the stream information obtained by using ubiquitous floater is transferred to the server computer. In the second stage, the current state of the urban drainage system is assessed through the server computer. In the last stage, the information is provided to the user through a GUI. As a result of applying, the developed urban runoff network flow velocity monitoring system to Woncheon-Stream in Suwon, the information necessary for urban drainage management can be managed in real time.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.3
• /
• pp.515-520
• /
• 2022

In context awareness using multiple sensors, when using sensor data detected and sent by each sensor, it is necessary to give different weights for each sensor. Even if the same type of sensor is configured for the same situation, sometimes it is necessary to assign different weights due to other secondary factors. It is inevitable to assign weights to events in the real world, and it can be said that a weighting method that can be used in a context awareness system using multiple sensors is necessary. In this study, we propose a weighting method for each sensor that reports to the host while the sensors continue to detect over time. In most IoT environments, the sensor continues the detection activity, and when the detected value shows a change pattern beyond a predetermined range, it is basically reported to the host. This can be called a kind of data stream environment. A weighting method was proposed for sensing data from multiple sensors in a data stream environment, and the new weighting method was to select and assign weights to data that indicates a context change in the stream.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.10
• /
• pp.377-382
• /
• 2014

Analysis techniques of the data over time from the mobile environment and IoT, is mainly used for extracting patterns from the collected data, to find meaningful information. However, analytical methods existing, is based to be analyzed in a state where the data collection is complete, to reflect changes in time series data associated with the passage of time is difficult. In this paper, we introduce a method for analyzing multi-block streaming data(AM-MBSD: Analysis Method for Multi-Block Stream Data) for the analysis of the data stream with multiple properties, such as variability of pattern and large capacitive and continuity of data. The multi-block streaming data, define a plurality of blocks of data to be continuously generated, each block, by using the analysis method of the proposed method of analysis to extract meaningful patterns. The patterns that are extracted, generation time, frequency, were collected and consideration of such errors. Through analysis experiments using time series data.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.529-546
• /
• 2002

A VOD server, which is the central component for constructing VOD systems, requires to provide high bandwidth and continuous real-time delivery. It is also necessary to the sophisticated disk scheduling and data placement schemes in VOD sewers. One of the most common problem facing in such a system is the high initial latency time to service multiple users concurrently. In this paper, we propose a dynamic stream merging scheme for reducing the initial latency time in VOD servers. The proposed scheme allows clients to merge streams on a request as long as their requests fall within the reasonable time interval. The basic idea behind the dynamic stream merging is to merge multiple streams into one by increasing the frame rate of each stream. In the performance study, the proposed scheme can reduce the initial latency time under the minimum buffer use and also can enhance the performance of the VOD server with respect to the capacity of user admission.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.1
• /
• pp.280-294
• /
• 2023

Unmanned aerial vehicles (UAVs) and millimeter-wave frequencies play key roles in supporting 5G wireless communication systems. They expand the field of wireless communication by increasing the data capacities of communication systems and supporting high data rates. However, short wavelengths, owing to the high millimeter-wave frequencies can cause problems, such as signal attenuation and path loss. To address these limitations, research on high directional beamforming technologies continue to garner interest. Furthermore, owing to the mobility of the UAVs, it is essential to track the beam angle accurately to obtain full beamforming gain. This study presents a beam tracking method based on the unscented Kalman filter using hybrid beamforming. The simulation results reveal that the proposed beam tracking scheme improves the overall performance in terms of the mean-squared error and spectral efficiency. In addition, by expanding analog beamforming to hybrid beamforming, the proposed algorithm can be used even in multi-user and multi-stream environments to increase data capacity, thereby increasing utilization in new-radio multiple-input multiple-output orthogonal frequency-division multiplexing systems.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.563-577
• /
• 2006

A stream processor uses resource sharing method for efficient of limited resource in multiple continuous queries. The previous methods process aggregate queries to consist the level structure. So insert operation needs to reconstruct cost of the level structure. Also a search operation needs to search cost of aggregation information in each size of sliding windows. Therefore this paper uses linear structure for optimization of sliding window aggregations. The method comprises of making decision, generation and deletion of panes in sequence. The decision phase determines optimum pane size for holding accurate aggregate information. The generation phase stores aggregate information of data per pane from stream buffer. At the deletion phase, panes are deleted that are no longer used. The proposed method uses resources less than the method where level structures were used as data structures as it uses linear data format. The input cost of aggregate information is saved by calculating only pane size of data though numerous stream data is arrived, and the search cost of aggregate information is also saved by linear searching though those sliding window size is different each other. In experiment, the proposed method has low usage of memory and the speed of query processing is increased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7A
• /
• pp.515-522
• /
• 2009

In this paper, a novel transmission scheme with spatial modulation is proposed for coded orthogonal frequency division multiplexing (OFDM). The multiple-input multiple-output (MIMO) technique, so-called spatial modulation (SM), divides input data into antenna index and data signals, transmitting data signals through the specific antenna chosen by the antenna index. In order to retrieve data stream at the receiver, SM needs to detect the antenna index which means that data signals are transmitted via a certain antenna. For this reason, it should be guaranteed that channel matrix is orthogonal. For the real environment, a MIMO channel has difficulty in maintaining orthogonality due to spatial correlation. Moreover, the receiver of the conventional SM is operated by hard decision, so that this scheme has a limit to be adopted for practical systems. Therefore, soft-output demappers for the conventional and proposed schemes are derived to detect antenna index and data stream by soft decision, and a novel transmission scheme combined with spatial modulation is proposed to improve the bit error rate (BER) performance of the conventional scheme.