Consecutive and nested partitions have been extensively studied in the set-partition problem as tools with which to search efficiently for an optimal partition. We extend the study of consecutive and nested partitions on a set of integers to the vertex-set of a graph. A subset of vertices is considered consecutive if the subgraph induced by the subset is connected. In this sense the partition p...

This paper describes a clustering methodology for temporal data using hidden Markov model(HMM) representation. The proposed method improves upon existing HMM based clustering methods in two ways: (i) it enables HMMs to dynamically change its model structure to obtain a better t model for data during clustering process, and (ii) it provides objective criterion function to automatically select th...

A series expansion approach to risk analysis of an inventory system with sourcing. Efficient algorithm for computing the ergodic projector of Markov multi-chains. A critical account of perturbation analysis of Markovian systems. Robust analysis of single server networks with infinite supply and unreliable nodes. Other publications: J. Berkhout. Onzekerheid die ertoe doet: een aanzet tot integra...

We exhibit an identity of abstract simplicial complexes between the wellstudied complex of trees Tn and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be obtained from the complex of trees by a sequence of stellar subdivisions. We provide an explicit cohomology basis for the complex of trees that emerges naturally...

This papers presents an approach to statement-level independent partitioning of uniform recurrences, i.e., loops with constant dependence distance vectors. Uniform recurrences may be partitioned into independent subsets—of the set of all statement instances— that require no communication or synchronization on a multiprocessor. Therefore, independent partitioning is highly efficient and desirabl...

Previous works on automatic query clustering most generate a flat, un-nested partition of query terms. In this work, we are pursuing to organize query terms into a hierarchical structure and construct a query taxonomy in an automatic way. The proposed approach is designed based on a hierarchical agglomerative clustering algorithm to hierarchically group similar queries and generate the cluster ...

The recently introduced nested sampling algorithm allows the direct and efficient calculation of the partition function of atomistic systems. We demonstrate its applicability to condensed phase systems with periodic boundary conditions by studying the three-dimensional hard-sphere model. Having obtained the partition function, we show how easy it is to calculate the compressibility and the free...