Despite the importance of segmentation to a variety of software applications, almost nothing is known about the characteristics or distribution of ambiguous partitions (eg. to Pend vs. top_end) in Thai text. By using special-purpose code to investigate a large (-400K word) text corpus, we were able to extract 36,267 such sequences, involving 9,253 distinct examples. Of these, a little more than...

This paper copes with the issue of adaptive partitioning in the context of Iterated Functions Systems (IFS) image coding. The main concern is to provide some insights on the optimum degree of partition adaptivity. The key point is to point out the proper balance of information between the partition representation and the transformation parameters of the system. Several systems involving diieren...

This paper presents Centre-based hard clustering approaches for clustering Y-STR data. Two classical partitioning techniques: Centroid-based partitioning technique and Representative object-based partitioning technique are evaluated. The k-Means and the k-Modes algorithms are the fundamental algorithms for the centroid-based partitioning technique, whereas the k-Medoids is a representative obje...

Data partitioning can significantly improve query performance in distributed database systems. Most proposed data partitioning techniques choose the partitioning based on a particular expected query workload or use a simple upfront scheme, such as uniform range partitioning or hash partitioning on a key. However, these techniques do not adequately address the case where the query workload is ad...

The microstructure and mechanical properties of one-step quenching partitioning (Q&P) steel with different time were analyzed. results shows that the elongation rate rises, tensile strength decreases, yield first declines then increases increasing (PT). An optimal combination ductility is obtained when samples are partitioned at 2000 s, corresponding strength, elongation, product 1022 MPa, ...

Vertical partitioning is a process of generating the fragments, each of which is composed of attributes with high affinity. The concept of vertical partitioning has been applied to many research areas, especially databases and distributed systems, in order to improve the performance of query execution and system throughput. However, most previous approaches have focused their attention on gener...

Ratios Running head: Berry-Esseen Theorem for Character Ratios Submitted 3/9/05; Revised 8/6/06 By Jason Fulman Department of Mathematics, University of Southern California Los Angeles, CA 90089, USA [email protected] Abstract: Bolthausen used a variation of Stein’s method to give an inductive proof of the Berry-Esseen theorem for sums of independent, identically distributed random variables. We m...

A graph G = (V , E) is arbitrarily partitionable if for any sequence τ of positive integers adding up to |V |, there is a sequence of vertex-disjoint subsets of V whose orders are given by τ , and which induce connected subgraphs. Such a graph models, e.g., a computer network which may be arbitrarily partitioned into connected subnetworks. In this paper we study the structure of such graphs and...

It might be easier to find feasible timetables if a room has movable partitions; so that it can be used either as multiple rooms or as a large single room. We propose methods to evaluate the potential benefits for timetabling and space planning of having such rooms.