Two novel evolutionary formulations of the graph coloring problem

We introduce two novel evolutionary formulations of the problem of coloring the nodes of a graph. The first formulation is based on the relationship that exists between a graph's chromatic number and its acyclic orientations. It views such orientations as individuals and evolves them with the aid of evolutionary operators that are very heavily based on the structure of the graph and its acyclic orientations. The second formulation, unlike the first one, does not tackle one graph at a time, but rather aims at evolving a `program' to color all graphs belonging to a class whose members all have the same number of nodes and other common attributes. The heuristics that result from these formulations have been tested on some of the Second DIMACS Implementation Challenge benchmark graphs, and have been found to be competitive when compared to the several other heuristics that have also been tested on those graphs.Comment: To appear in Journal of Combinatorial Optimizatio

Modeling the input history of programs for improved instruction-memory performance

When a program is loaded into memory for execution, the relative position of its basic blocks is crucial, since loading basic blocks that are unlikely to be executed first places them high in the instruction-memory hierarchy only to be dislodged as the execution goes on. In this paper we study the use of Bayesian networks as models of the input history of a program. The main point is the creation of a probabilistic model that persists as the program is run on different inputs and at each new input refines its own parameters in order to reflect the program's input history more accurately. As the model is thus tuned, it causes basic blocks to be reordered so that, upon arrival of the next input for execution, loading the basic blocks into memory automatically takes into account the input history of the program. We report on extensive experiments, whose results demonstrate the efficacy of the overall approach in progressively lowering the execution times of a program on identical inputs placed randomly in a sequence of varied inputs. We provide results on selected SPEC CINT2000 programs and also evaluate our approach as compared to the gcc level-3 optimization and to Pettis-Hansen reordering

The solar siblings in the Gaia era

We perform realistic simulations of the Sun's birth cluster in order to predict the current distribution of solar siblings in the Galaxy. We study the possibility of finding the solar siblings in the Gaia catalogue by using only positional and kinematic information. We find that the number of solar siblings predicted to be observed by Gaia will be around 100 in the most optimistic case, and that a phase space only search in the Gaia catalogue will be extremely difficult. It is therefore mandatory to combine the chemical tagging technique with phase space selection criteria in order to have any hope of finding the solar siblings.Comment: To be published in the proceedings of the GREAT-ITN conference "The Milky Way Unravelled by Gaia: GREAT Science from the Gaia Data Releases", 1-5 December 2014, University of Barcelona, Spain, EAS Publications Series, eds Nicholas Walton, Francesca Figueras, and Caroline Soubira

On the phase transitions of graph coloring and independent sets

We study combinatorial indicators related to the characteristic phase transitions associated with coloring a graph optimally and finding a maximum independent set. In particular, we investigate the role of the acyclic orientations of the graph in the hardness of finding the graph's chromatic number and independence number. We provide empirical evidence that, along a sequence of increasingly denser random graphs, the fraction of acyclic orientations that are `shortest' peaks when the chromatic number increases, and that such maxima tend to coincide with locally easiest instances of the problem. Similar evidence is provided concerning the `widest' acyclic orientations and the independence number

Mass Generation from Lie Algebra Extensions

Applied to the electroweak interactions, the theory of Lie algebra extensions suggests a mechanism by which the boson masses are generated without resource to spontaneous symmetry breaking. It starts from a gauge theory without any additional scalar field. All the couplings predicted by the Weinberg-Salam theory are present, and a few others which are nevertheless consistent within the model.Comment: 11 pages; revtex; title and PACS have been changed; comments included in the manuscrip

Crystallization, data collection and data processing of maltose-binding protein (MalE) from the phytopathogen Xanthomonas axonopodis pv. citri

Maltose-binding protein is the periplasmic component of the ABC transporter responsible for the uptake of maltose/maltodextrins. The Xanthomonas axonopodis pv. citri maltose-binding protein MalE has been crystallized at 293 Kusing the hanging-drop vapour-diffusion method. The crystal belonged to the primitive hexagonal space group P6_122, with unit-cell parameters a = 123.59, b = 123.59, c = 304.20 Å, and contained two molecules in the asymetric unit. It diffracted to 2.24 Å resolution