In this paper, we present a novel triangulation heuristic and a new genetic algorithm to solve the problem of optimal tree decomposition of Bayesian networks. The heuristic, named MinFillWeight, aims to select variables minimizing the multiplication of the weights on nodes of fill-in edges. The genetic algorithm, named IDHGA, employs a new order-reserving crossover operator and a mutation opera...

This paper proposes two constructive heuristics, i.e. HPF1 and HPF2, for the blocking flow shop problem in order to minimize the total flow time. They differ mainly in the criterion used to select the first job in the sequence since, as it is shown, its contribution to the total flow time is not negligible. Both procedures were combined with the insertion phase of NEH to improve the sequence. H...

In this paper I detail the implementation of an extractionbased summarization system that uses sentence clustering and named entity identification as main features for the 2006 Multilingual Summarization Evaluation. I discuss some of the failings of my system, and what can be done to improve it.

We have studied several techniques for creating and comparing content representations of textual documents in the field of event detection. We define a document as a collection of aspects, i.e. disjoint components that reveal (latent) topics and/or extracted information such as named entities. As underlying models we consider the vector space model and probabilistic topic models based on Latent...

A three-center phenomenological model able to explain, at least from a qualitative point of view, the difference in the observed yield of a particle-accompanied fission and that of binary fission was developed. It is derived from the liquid drop model under the assumption that the aligned configuration, with the emitted particle between the light and heavy fragment is obtained by increasing con...

In this work, we propose RATS, a middleware to enhance and extend the Terracotta framework for Java with the ability to transparently execute multi-threaded Java applications to provide a singlesystem image. It supports efficient scheduling of threads, according to available resources, across several nodes in a Terracotta cluster, taking advantage of the extra computational and memory resources...

In a distributed system which consists of unknown number of machines, many task clustering heuristics have been proposed in order to satisfy requirements such as determining the number of machines and minimizing response time for scheduling Directed Acyclic Graph(DAG). However, those heuristics are not aware of the actual number of existing machines, because their objective is only to minimize ...

Data clustering is the process of identifying natural groupings or clusters within multidimensional data based on some similarity measure. Clustering is a fundamental process in many different disciplines. Hence, researchers from different fields are actively working on the clustering problem. This paper provides an overview of the different representative clustering methods. In addition, sever...