• Journal of the Korean Data and Information Science Society
• /
• v.17 no.4
• /
• pp.1279-1287
• /
• 2006

The purpose of this paper is to present a new algorithm for extracting the consensus pattern, or motif from sequence belonging to the same family. Two methods are considered for feature interval partitioning based on equal probability and equal width interval partitioning. C2H2 zinc finger protein and epidermal growth factor protein sequences are used to demonstrate the effectiveness of the proposed algorithm for motif extraction. For two protein families, the equal width interval partitioning method performs better than the equal probability interval partitioning method.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.1
• /
• pp.9-16
• /
• 2002

Join operation exert a great effect on the performance of system in temporal database as in the relational database. Especially, as for the temporal join, the optimization of interval partition decides the performance of query processing. In this paper, to improve the efficiency of parallel join query in temporal database. I proposed Minimum Interval Partition(MIP) scheme that time interval partitioning. The validity of this MIP algorithm that decides minimum breakpoint of the partition is proved by example scenario and I confirmed improved efficiency as compared with existing partition algorithm.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.9
• /
• pp.164-171
• /
• 2013

XRF spectrum data of a material include a lot of background signals which are not related to its components. Since an XRF analyzer analyzes components and concentrations of an analyte using the locations and magnitudes of gaussian-shaped peaks extracted from a spectrum, its background signals need to be removed completely from the spectrum for the accurate analysis. Morphology-based method, SNIP-based method and thresholding-based method have been used to remove background signals. In the paper, a background removal method, an improved version of an interval-thresholding-based method, is proposed. The proposed method consists of interval partitioning, interval classifying, and background estimation. Experimental results show that the proposed method has better performance on background removal from the spectrum than the existing methods, morphology-based method and SNIP-based method.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.40 no.1
• /
• pp.26-32
• /
• 1995

Weak persistence of white clover （Trifolium repens L.） under continuous grazing has been limited its availability in the mixture with grasses. The experiment was done to determine the effect of defoliation interval on $N_2$ fixation. nitrogen and carbohydrate partitioning of contrasting white clover cultivars. Individual plants of Osceola（large leaf）, Grasslands Huia （me-dium leaf）, and Aberystwyth S184 （small leaf） were grown in 15cm plastic pot containing a 1：2：1 soil：sand：Promix mixture for 55 days, and then clipped to remove all fully expanded leaves every 7, 14 or 28 days. To measure the cultivar response, plants were sampled immediately before final harvest （0） and on 1, 3, 7, 14, and 28 days after the final harvest, and then seperated leaves and petioles, stolons and roots for chemical analysis. Total nonstructural carbohydrate （TNC） concentrations of stolons and roots, and nitrogen con-centration of all the fractions inclined with increased defoliation interval. Those of Osceola, large leaved, were greater than the other cultivars showing different partitioning patterns between stolons and roots. Concentration of TNC was less in roots than in the other fractions while that of nitrogen declined in the order of leaves and petioles, roots and stolons. $N_2$ fixation rate of larger leaved cultivar, Osceola, was higher than that of smaller leaved cultivar. TNC and nitrogen concentrations of all the fractions and $N_2$ fixation rate were reduced as defoliation was imposed, defoliation interval declined or regrowing period become shorter. The partitioning patterns of TNC and nitrogen among the fractions were modified by defoliation interval and cultivars.

• Journal of the Korean Statistical Society
• /
• v.36 no.2
• /
• pp.321-333
• /
• 2007

In the proportional hazard model with the beta process prior, the posterior computation with the discrete approximation is considered. The time period of interest is partitioned by small intervals. On each partitioning interval, the likelihood is approximated by that of a binomial experiment and the beta process prior is by a beta distribution. Consequently, the posterior is approximated by that of many independent binomial model with beta priors. The analysis of the leukemia remission data is given as an example. It is illustrated that the length of the partitioning interval affects the posterior and one needs to be careful in choosing it.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.709-718
• /
• 2002

Cluster based VOD systems require elaborate load balancing and buffer management techniques in order to ensure real-time display for multiuser concurrently. In this paper, we propose a new load balancing technique based on the dynamic buffer partitioning in cluster based VOD servers. The proposed technique evenly distribute the user requests into each service node according to its available buffer capacity and disk access rate. In each node, the dynamic buffer partitioning technique dynamically partitions the buffer to minimize the average waiting time for the requests that access the same continuous media. The simulation results show that our proposed technique decreases the average waiting time by evenly distributing the user requests compared with the exiting techniques and then increases the throughput in each node. Particularly under the overloaded condition in the cluster server, the simulation probes that the performance of the proposed technique is better two times than the Generalized Interval Caching based technique.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.6
• /
• pp.1542-1550
• /
• 2013

This paper presents new results on delay-dependent global exponential stability for uncertain linear systems with interval time-varying delay. Based on Lyapunov-Krasovskii functional approach, some novel delay-dependent stability criteria are derived in terms of linear matrix inequalities (LMIs) involving the minimum and maximum delay bounds. By using delay-partitioning method and the lower bound lemma, less conservative results are obtained with fewer decision variables than the existing ones. Numerical examples are given to illustrate the usefulness and effectiveness of the proposed method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.4
• /
• pp.394-405
• /
• 2001

Since most real-world application data involve continuous-valued attributes, properly addressing the discretization process for constructing a decision tree is an important problem. A continuous-valued attribute is typically discretized during decision tree generation by partitioning its range into two intervals recursively. In this paper, by removing the restriction to the binary discretization, we present a hybrid multi-interval discretization algorithm for discretizing the range of continuous-valued attribute into multiple intervals. On the basis of experiment using semiconductor etching machine, it has been verified that our discretization algorithm constructs a more efficient incremental decision tree compared to previously proposed discretization algorithms.

• Journal of Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.465-475
• /
• 2001

Recent1y, there is growing attention on the researches of inducing association rules from large volume of database. One of them is the method that can be applied to quantitative attribute data. This paper presents a new method for generating large-interval itemsets, which uses locality for partitioning the range of data. This method can minimize the loss of data-inherent characteristics by generating denser large-interval items than other methods. Performance evaluation results show that our new approach is more efficient than previously proposed techniques.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.48-54
• /
• 2008

MMORPGs may involve a great number of concurrent players, and those servers usually have to manage hundred, or even thousands of avatars co-existing in the same virtual world. So if failing to send a command or an event message, or sending it too late may cause damages to the avatar evolution(death, injury, loss of resources), and may result in unjustified penalties for the player. Many policies could be defined to realize a ranking evaluation of available servers. Unfortunately, due to the highly dynamic characteristics of server loads and network performances, any optimal allocation would soon become sub-optimal. In order to solve those problems we propose the "time-interval based fairness partitioning method"(TIP). TIP will distribute the avatar to the game server equally with time-interval in order to avoid the problems form the unfairness of game servers load.