• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.272-285
• /
• 2008

In this paper, we concentrate on data allocation methods for multiple broadcast channels. When the server broadcasts data, the important issue is to let mobile clients access requested data rapidly. Previous works first sorted data by their access probabilities and allocate the sorted data to the multiple channels by partitioning them into multiple channels. However, they do not reflect the difference of access probabilities among data allocated in the same channel. This paper proposes ZGMD allocation method. ZGMD allocates data item on multiple channels so that the difference of access probability in the same channel is maximized. ZGMD allocates sorted data to each channels and applies Broadcast Disk in each channel. ZGMD requires a proper indexing scheme for the performance improvement. This is because in ZGMD method each channel got allocated both hot and cold data. As a result, the sequential search heuristic does not allow the mobile client to access hot data items quickly. The proposed index scheme is based on using dedicated index channels in order to search the data channel where the requested data is. We show that our method achieve the near-optimal performance in terms of the average access time and significantly outperforms the existing methods.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2000.11a
• /
• pp.81-87
• /
• 2000

Beat-to-beat changes in heart period (heart period variability, HPV) are mediated by fluctuations in autonomic activity. Spectral analysis is used to quantify such fluctuations in the range of 0.15-0.40 Hz (high frequency, HF), which are influenced primarily by parasympathetic factors. These fluctuations are often referred to as RSA (respiratory sinus arrhythmia), the physiological phenomenon extracted by spectral analysis and other methods including histograms of heart rate ( HR), deviations of HR etc. Respiratory sinus arrhythmia indexing with peak-to-valley method suggested by Grossman et at., (1981) yields a simple range statistic and is quantified on breath-by-breath basis, thus being quite sensitive and less dependent on recording time as compared to spectral analysis. It is strongly recommended to use at least 1 min epoch to asses HF component of HPV and at least 2 min fer low frequency (LF) of HPV and even 5 min far valid clinical assessment. Peak-to-valley statistic is limited to RSA index only, but has its pragmatic advantages. Most important is possibility of its application far relatively small epoch analysis. We used short periods (20,30, 40 sec only) and off-line analysis of RSA using ECG and respiration curve this method of assessment and proved that this method is more practically effective. The RSA index was not so far dependent on respiration pattern differences and reflected actual vagal control of HR and were accompanied by low HR under some high stress conditions and in an aversive affective visual stimulation experiments. Another factor that might modulate cardiac chronotropic response is the interaction of sympathetic and parasympathetic inputs on sino-atrial (SA) node level, because responses to vagal influences are known to be proportional to ongoing sympathetic activity, that is so called accentuated antagonism. Since sympathetic outflow (increment of influences on SA) under negative emotions or stress was high in almost all physiological responses, vagal effects on HR could be therefore potentiated, leading to masking of output cardiac response seen in HPV, In the case of moderate sympathetic activation, on the other hand, autonomic interactions in cardiac control appear to be minimal. Thus RSA index appears to be an effective alternative method to assess and measure spectral HPV.

• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.67-76
• /
• 2018

This paper addresses the problem of efficient processing of region monitoring queries. The centralized methods used for existing region monitoring query processing assumes that the mobile object periodically sends location-updates to the server and the server continues to update the query results. However, a large amount of location updates seriously degrade the system performance. Recently, some distributed methods have been proposed for region monitoring query processing. In the distributed methods, the server allocates to all objects i) a resident domain that is a subspace of the workspace, and ii) a number of nearby query regions. All moving objects send location updates to the server only when they leave the resident domain or cross the boundary of the query region. In order to allocate the resident domain to the moving object along with the nearby query region, we use a query index structure that is constructed by splitting the workspace recursively into equal halves. However, However, the above index structure causes unnecessary division, resulting in deterioration of system performance. In this paper, we propose an adaptive split method to reduce unnecessary splitting. The workspace splitting is dynamically allocated i) considering the spatial relationship between the query region and the resultant subspace, and ii) the distribution of the query region. We proposed an enhanced QR-tree with a new splitting method. Through a set of simulations, we verify the efficiency of the proposed split methods.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.194-207
• /
• 2003

This paper presents an optimal design methodology for the multidimensional nested attribute index (MD-NAI) that uses a multidimensional index structure for indexing the nested attributes in object databases. The MD-NAI efficiently supports complex queries involving both nested attributes and class hierarchies, which are not supported by the nested attribute index using one-dimensional index structure such as $B^+$-tree. However, the performance of the MD-NAI is very degraded in some cases of user's query types. In this paper, for the performance enhancement of the MD-NAI, we first determine the optimal shape of index page region by using the query information about the nested predicates, and then construct an optimal MD NAI by applying a region splitting strategy that makes the shape of the page regions of the MD-NAI as close as possible to the predetermined optimal one. For performance evaluation, we perform extensive experiments with the MD-NAI using various types of nested predicates and object distribution. The results indicate that our proposed method builds optimal MD-NAI regardless of the query types and object distributions. When the interval ratio of a three-dimensional query region is 1:16:236, the performance of the proposed method is enhanced by as much as 5.5 times over that of the conventional method employing the cyclic splitting strategy.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.66-77
• /
• 2011

We propose a framework for grouping photographic advertising images that employs a hierarchical indexing scheme based on efficient feature combinations. The study provides one specific application of effective tools for monitoring photographic advertising information through online and offline channels. Specifically, it develops a preprocessor for advertising image information tracking. We consider both global features that contain general information on the overall image and local features that are based on local image characteristics. The developed local features are invariant under image rotation and scale, the addition of noise, and change in illumination. Thus, they successfully achieve reliable matching between different views of a scene across affine transformations and exhibit high accuracy in the search for matched pairs of identical images. The method works with global features in advance to organize coarse clusters that consist of several image groups among the image data and then executes fine matching with local features within each cluster to construct elaborate clusters that are separated by identical image groups. In order to decrease the computational time, we apply a conventional clustering method to group images together that are similar in their global characteristics in order to overcome the drawback of excessive time for fine matching time by using local features between identical images.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.299-309
• /
• 2006

Due to the rapid development in mobile communication technologies, the usage of mobile devices such as cell phone or PDA becomes increasingly popular. As different devices require different applications, various new services are being developed to satisfy the needs. One of the popular services under heavy demand is the Location-based Service (LBS) that exploits the spatial information of moving objects per temporal changes. In order to support LBS efficiently, it is necessary to be able to index and query well a large amount of spatio-temporal information of moving objects. Therefore, in this paper, we investigate how such location information of moving objects can be efficiently stored and indexed. In particular, we propose a novel location encoding method based on hierarchical administrative district information. Our proposal is different from conventional approaches where moving objects are often expressed as geometric points in two dimensional space, (x,y). Instead, in ours, moving objects are encoded as one dimensional points by both administrative district as well as road information. Our method is especially useful for monitoring traffic situation or tracing location of moving objects through approximate spatial queries.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.7
• /
• pp.1923-1932
• /
• 1998

This paper deals with a 2-D objects recognition algorithm. And in this paper, we present an algorithm which can reduce the computation time in model retrieval by means of hashing technique instead of using the binary~tree method. In this paper, we treat an object boundary as a string of structural units and use an attributed string matching algorithm to compute similarity measure between two strings. We select from the privileged strings a privileged string wIth mmimal eccentricity. This privileged string is treated as the reference string. And thell we wllstructed hash table using the distance between privileged string and the reference string as a key value. Once the database of all model strings is built, the recognition proceeds by segmenting the scene into a polygonal approximation. The distance between privileged string extracted from the scene and the reference string is used for model hypothesis rerieval from the table. As a result of the computer simulation, the proposed method can recognize objects only computing, the distance 2-3tiems, while previous method should compute the distance 8-10 times for model retrieval.

• Journal of Broadcast Engineering
• /
• v.13 no.2
• /
• pp.222-235
• /
• 2008

Recently, as growing of high definition media services like HDTV and IPTV, fast moving picture manipulation techniques need to meet what those services require. Especially, a fast reduced-size image extracting method is required in the areas of video indexing and video summary Conventional DC image extracting methods, however, can't be applied to H.264/AVC streams since a spatial domain prediction scheme is adopted in H.264/AVC intra mode. In this paper, we propose a theoretical method for extracting a thumbnail image from an H.264/AVC intra frame in the frequency domain. Furthermore, the proposed scheme can extract the thumbnail very fast since all operations are applied to transform coefficients directly, after a general equation for the thumbnail extraction in nine H.264/AVC intra prediction modes is introduced, an LUT(Look Up Table) for each mode is designed. Through the implementation and performance evaluation, while the subject quality difference between the output of our scheme and a conventional output is negligible, the former can extract the thumbnail faster then the latter by up to 63%.

• Journal of KIISE:Databases
• /
• v.34 no.3
• /
• pp.179-192
• /
• 2007

This paper addresses an approach that recommends investment types for stock investors by discovering useful rules from past changing patterns of stock prices in databases. First, we define a new rule model for recommending stock investment types. For a frequent pattern of stock prices, if its subsequent stock prices are matched to a condition of an investor, the model recommends a corresponding investment type for this stock. The frequent pattern is regarded as a rule head, and the subsequent part a rule body. We observed that the conditions on rule bodies are quite different depending on dispositions of investors while rule heads are independent of characteristics of investors in most cases. With this observation, we propose a new method that discovers and stores only the rule heads rather than the whole rules in a rule discovery process. This allows investors to define various conditions on rule bodies flexibly, and also improves the performance of a rule discovery process by reducing the number of rules. For efficient discovery and matching of rules, we propose methods for discovering frequent patterns, constructing a frequent pattern base, and indexing them. We also suggest a method that finds the rules matched to a query issued by an investor from a frequent pattern base, and a method that recommends an investment type using the rules. Finally, we verify the superiority of our approach via various experiments using real-life stock data.

• Korean journal of communication and information
• /
• v.35
• /
• pp.211-249
• /
• 2006

This study investigated how many and which articles readers read in daily newspapers. Distinguished from previous research that measured readers' perception of their reading habits, this study picked up readers who read the newspaper in the morning, showed them every article in the newspaper, and asked them whether they read each article. This method enhanced the accuracy of measuring subjects‘ reading behavior. According to the results, 6.2% of the readers read at least half of the articles of the general section in the newspaper. Fewer readers went over the economic section of the newspaper. It was 4.1% of the readers. There were only 1.1% of readers who did not read any article of the general section, but the rate soared to 26.5% for the economic section. Many newspaper readers did not skip the first five pages of the newspaper, however the highest readership pages were found in the national coverage located in the middle of the general section. On the other hand, few readers read the articles on pages covering culture, international issues, and people. Readership of the top stories showed some unexpected results. The top stories of national coverage located in the middle of the general section were read by more readers than the top stories of the front pages. This study also investigated the difference between young and old readers. The readers of twenties and thirties did not read as many top stories on major pages and editorials as the readers of forties and older.