• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.600-619
• /
• 2006

According to recent technical advances on sensors and mobile devices, processing of data streams generated by the devices is becoming an important research issue. The data stream of real values obtained at continuous time points is called streaming time-series. Due to the unique features of streaming time-series that are different from those of traditional time-series, similarity matching problem on the streaming time-series should be solved in a new way. In this paper, we propose an efficient algorithm for streaming time- series matching problem that supports normalization transform. While the existing algorithms compare streaming time-series without any transform, the algorithm proposed in the paper compares them after they are normalization-transformed. The normalization transform is useful for finding time-series that have similar fluctuation trends even though they consist of distant element values. The major contributions of this paper are as follows. (1) By using a theorem presented in the context of subsequence matching that supports normalization transform[4], we propose a simple algorithm for solving the problem. (2) For improving search performance, we extend the simple algorithm to use $k\;({\geq}\;1)$ indexes. (3) For a given k, for achieving optimal search performance of the extended algorithm, we present an approximation method for choosing k window sizes to construct k indexes. (4) Based on the notion of continuity[8] on streaming time-series, we further extend our algorithm so that it can simultaneously obtain the search results for $m\;({\geq}\;1)$ time points from present $t_0$ to a time point $(t_0+m-1)$ in the near future by retrieving the index only once. (5) Through a series of experiments, we compare search performances of the algorithms proposed in this paper, and show their performance trends according to k and m values. To the best of our knowledge, since there has been no algorithm that solves the same problem presented in this paper, we compare search performances of our algorithms with the sequential scan algorithm. The experiment result showed that our algorithms outperformed the sequential scan algorithm by up to 13.2 times. The performances of our algorithms should be more improved, as k is increased.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.8
• /
• pp.701-713
• /
• 2009

This paper studies a method for reducing performance degradation due to losing sub-carrier orthogonality caused by power transient between physical channels in LTE uplink transmission. The pattern of inter-carrier interference(ICI) caused by power transient is different from what has been studied for doppler shift, in that its pattern occurs at front and rear sides of channels in each period of power transient. The reason of ICI's occurrence results from power difference between channels, power transient duration, multi-path channel delay spread, and numbers of sub-carrier. New criterion is proposed to find out number of taps of multi-tap equalizer enough to improve the ICI. The scheme is to determine the number of taps of multi-tap equalizer when a normalized interference or a normalized ICI is greater than a normalized noise. Simulation results show that the number of taps is flexibly adjusted according to SNR(Signal to Noise Ratio) of a received signal to improve Bit Error Rate(BER), while the complexity of the proposed scheme is reduced down to 88 percentage of the classical method.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.259-267
• /
• 2003

Though naive Bayes text classifiers are widely used because of its simplicity, the techniques for improving performances of these classifiers have been rarely studied. In this paper, we propose and evaluate some general and effective techniques for improving performance of the naive Bayes text classifier. We suggest document model based parameter estimation and document length normalization to alleviate the Problems in the traditional multinomial approach for text classification. In addition, Mutual-Information-weighted naive Bayes text classifier is proposed to increase the effect of highly informative words. Our techniques are evaluated on the Reuters21578 and 20 Newsgroups collections, and significant improvements are obtained over the existing multinomial naive Bayes approach.

• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.95-103
• /
• 2007

Many techniques have been proposed for mapping from XML to relations, but most techniques did not negotiate the semantics of XML data. The semantics is important to validate storage, query optimization, modification anomaly in process of schema design. Specially, functional dependencies are an important part of database theory, also it is basis of normalization for relational table in BCNF. This paper propose a new technique that reflect functional dependencies to store relation mapped from XML based on XML Schema. The technique can reduce storage redundancy and can keep up content and structure with constraint described by functional dependencies.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.501-512
• /
• 2003

This paper proposes an indexing technique for fast retrieval of similar image subsequences using the multi-dimensional time warping distance. The time warping distance is a more suitable similarity measure than Lp distance in many applications where sequences may be of different lengths and/or different sampling rates. Our indexing scheme employs a disk-based suffix tree as an index structure and uses a lower-bound distance function to filter out dissimilar subsequences without false dismissals. It applies the normaliration for an easier control of relative weighting of feature dimensions and the discretization to compress the index tree. Experiments on medical and synthetic image sequences verify that the proposed method significantly outperforms the naive method and scales well in a large volume of image sequence databases.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.12-31
• /
• 2006

The n-gram inverted index has two major advantages: language-neutral and error-tolerant. Due to these advantages, it has been widely used in information retrieval or in similar sequence matching for DNA and Protein databases. Nevertheless, the n-gram inverted index also has drawbacks: the size tends to be very large, and the performance of queries tends to be bad. In this paper, we propose the two-level n-gram inverted index (simply, the n-gram/2L index) that significantly reduces the size and improves the query performance while preserving the advantages of the n-gram inverted index. The proposed index eliminates the redundancy of the position information that exists in the n-gram inverted index. The proposed index is constructed in two steps: 1) extracting subsequences of length m from documents and 2) extracting n-grams from those subsequences. We formally prove that this two-step construction is identical to the relational normalization process that removes the redundancy caused by a non-trivial multivalued dependency. The n-gram/2L index has excellent properties: 1) it significantly reduces the size and improves the Performance compared with the n-gram inverted index with these improvements becoming more marked as the database size gets larger; 2) the query processing time increases only very slightly as the query length gets longer. Experimental results using databases of 1 GBytes show that the size of the n-gram/2L index is reduced by up to 1.9${\~}$2.7 times and, at the same time, the query performance is improved by up to 13.1 times compared with those of the n-gram inverted index.

• Tunnel and Underground Space
• /
• v.11 no.3
• /
• pp.217-224
• /
• 2001

Rock masses are usually discontinuous in nature due to various geological processes and contain rock joints and bridges. Crack propagation and coalescence processes in rock bridge mainly cause rock failures in slopes, foundations, and tunnels. In this study, we focused on the crack initiation, propagation and coalescence process of rock materials containing two pre-existing open cracks arranged in different geometries. Specimens of 120${\times}$60${\times}$25 mm in size, which were made of Yeoman Marble, were prepared. In the specimens, two artificial cracks were cut with pre-existing crack angle ${\alpha}$, bridge angle ${\beta}$, pre-existing crack length 2c and bridge length 2b. Wing crack initiation stress, wing crack propagation angle, and crack coalescence stress were measured and crack initiation, propagation and coalescence processes were observed during uniaxial compression. Crack coalescence types were classified and analytical study using Ashby and Hallam model (1986) was performed to be compared with the experimental results.

• Geotechnical Engineering
• /
• v.14 no.5
• /
• pp.39-52
• /
• 1998

The pupose of the present paper is to estimate the effects of constraint condition of pile head, ground condition(dry unit weight. $\gamma_4$) and embedded pile lengths on the behavior of single pile which is embedded in normally consolidated clay. BBperiment functions can be quantified to these effects obtained from the results of model teats. The ground of model tests is normally consolidated( NC ) clay under three kinds of effective vertical stress. The results of the model tests using the steel pile of two different embedded pile length and of free-head and fired-head show that the lateral load-deflection relationship is to be elasto plastic behavior below $\gamma_d/\gamma_{dmax}$: 0.84 and that the reduction of lateral load of beyond maximum lateral load($Q_{max}$) at each model test is significantly time-dependent. In this study, it is shown that the displacement relationship can be fitted to exponential function of time by model best results. The effect of ground conditions on the ultimate and yield lateral load is fitted to exponential function including the ratio of dry unit weight to maximum dry unit weight. When tests by results are compared with those from Broms and Budhu et at., the predicted results are over-estimated about 27-87 ayo. In effectivity of constraint condition of pile head on the lateral load-deflection response, the $Q_{fixed}/Q_{gree}-y/D$ relationship is highly non-linear and fitted to parabolic function.

• Journal of the Korea Concrete Institute
• /
• v.26 no.2
• /
• pp.181-188
• /
• 2014

In this study, an interactive analysis considering column-pile interaction is performed on the basis of an equivalent base spring model for supplementing virtual fixed point design of bent pile structures. Through this analytical method, the application of the minimum steel reinforcement ratio of the pile (0.4%) is analyzed by taking into account the major influencing parameters. Furthermore, the limit depth for steel reinforcement ratio is proposed through the relationships between column and pile conditions. To obtain the detailed information, it is found that an interactive analysis is intermediate in theoretical accuracy between the virtual fixed point model analysis and full-modeling analysis. Base on this study, it is also found that the maximum bending moment is located within cracking moment of the pile when material nonlinearity is considered. Therefore, the minimum steel reinforcement ratio is appropriately applicable for the optimal design of bent pile structures. Finally, the limit depth for steel reinforcement ratio ($L_{As=x%}$) is proposed by considering the field measured results. It is shown that the normalized limit depth ratio for steel reinforcement ratio ($L_{As=x%}/L_P$) decreases linearly as the length-diameter ratio of pile ($L_P/D_P$) increases, and then converges at a constant value.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.547-558
• /
• 2003

From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user's query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.