A Knowledge Model for Automatic Configuration of Traffic Messages

This paper describes a knowledge model for a configuration problem in the do-main of traffic control. The goal of this model is to help traffic engineers in the dynamic selection of a set of messages to be presented to drivers on variable message signals. This selection is done in a real-time context using data recorded by traffic detectors on motorways. The system follows an advanced knowledge-based solution that implements two abstract problem solving methods according to a model-based approach recently proposed in the knowledge engineering field. Finally, the paper presents a discussion about the advantages and drawbacks found for this problem as a consequence of the applied knowledge modeling ap-proach.

Planta satélite de GNL adaptada a “El Hierro 100% renovable”.

El gas natural es el combustible más adecuado para la integración con las energías renovables, tanto por la limpieza de las instalaciones, como la práctica ausencia de contaminación del aire con los productos de su combustión, la posibilidad de su almacenamiento en forma líquida o comprimida, y la tendencia de disminución de precios que se observa en los últimos años en las previsiones de BP, AIE e IEA. El presente proyecto muestra como una pequeña instalación es capaz de solventar las deficiencias de las renovables mediante el uso del gas natural como combustible de automoción, de barcos, y para dar servicio a una planta térmica de apoyo a las indisponibilidades de la eólica e hidráulica instalada en la isla de El Hierro

Watching subgraphs to improve efficiency in maximum clique search

This paper describes a new technique referred to as watched subgraphs which improves the performance of BBMC, a leading state of the art exact maximum clique solver (MCP). It is based on watched literals employed by modern SAT solvers for boolean constraint propagation. In efficient SAT algorithms, a list of clauses is kept for each literal (it is said that the clauses watch the literal) so that only those in the list are checked for constraint propagation when a (watched) literal is assigned during search. BBMC encodes vertex sets as bit strings, a bit block representing a subset of vertices (and the corresponding induced subgraph) the size of the CPU register word. The paper proposes to watch two subgraphs of critical sets during MCP search to efficiently compute a number of basic operations. Reported results validate the approach as the size and density of problem instances rise, while achieving comparable performance in the general case.