On Maximum Weight Clique Algorithms, and How They Are Evaluated

Maximum weight clique and maximum weight independent set solvers are often benchmarked using maximum clique problem instances, with weights allocated to vertices by taking the vertex number mod 200 plus 1. For constraint programming approaches, this rule has clear implications, favouring weight-based rather than degree-based heuristics. We show that similar implications hold for dedicated algorithms, and that additionally, weight distributions affect whether certain inference rules are cost-effective. We look at other families of benchmark instances for the maximum weight clique problem, coming from winner determination problems, graph colouring, and error-correcting codes, and introduce two new families of instances, based upon kidney exchange and the Research Excellence Framework. In each case the weights carry much more interesting structure, and do not in any way resemble the 200 rule. We make these instances available in the hopes of improving the quality of future experiments

Natural computing for vehicular networks

La presente tesis aborda el diseño inteligente de soluciones para el despliegue de redes vehiculares ad-hoc (vehicular ad hoc networks, VANETs). Estas son redes de comunicación inalámbrica formada principalmente por vehículos y elementos de infraestructura vial. Las VANETs ofrecen la oportunidad para desarrollar aplicaciones revolucionarias en el ámbito de la seguridad y eficiencia vial. Al ser un dominio tan novedoso, existe una serie de cuestiones abiertas, como el diseño de la infraestructura de estaciones base necesaria y el encaminamiento (routing) y difusión (broadcasting) de paquetes de datos, que todavía no han podido resolverse empleando estrategias clásicas. Es por tanto necesario crear y estudiar nuevas técnicas que permitan de forma eficiente, eficaz, robusta y flexible resolver dichos problemas. Este trabajo de tesis doctoral propone el uso de computación inspirada en la naturaleza o Computación Natural (CN) para tratar algunos de los problemas más importantes en el ámbito de las VANETs, porque representan una serie de algoritmos versátiles, flexibles y eficientes para resolver problemas complejos. Además de resolver los problemas VANET en los que nos enfocamos, se han realizado avances en el uso de estas técnicas para que traten estos problemas de forma más eficiente y eficaz. Por último, se han llevado a cabo pruebas reales de concepto empleando vehículos y dispositivos de comunicación reales en la ciudad de Málaga (España). La tesis se ha estructurado en cuatro grandes fases. En la primera fase, se han estudiado los principales fundamentos en los que se basa esta tesis. Para ello se hizo un estudio exhaustivo sobre las tecnologías que emplean las redes vehiculares, para así, identificar sus principales debilidades. A su vez, se ha profundizado en el análisis de la CN como herramienta eficiente para resolver problemas de optimización complejos, y de cómo utilizarla en la resolución de los problemas en VANETs. En la segunda fase, se han abordado cuatro problemas de optimización en redes vehiculares: la transferencia de archivos, el encaminamiento (routing) de paquetes, la difusión (broadcasting) de mensajes y el diseño de la infraestructura de estaciones base necesaria para desplegar redes vehiculares. Para la resolución de dichos problemas se han propuesto diferentes algoritmos CN que se clasifican en algoritmos evolutivos (evolutionary algorithms, EAs), métodos de inteligencia de enjambre (swarm intelligence, SI) y enfriamiento simulado (simulated annealing, SA). Los resultados obtenidos han proporcionado protocolos de han mejorado de forma significativa las comunicaciones en VANETs. En la tercera y última fase, se han realizado experimentos empleando vehículos reales circulando por las carreteras de Málaga y que se comunicaban entre sí. El principal objetivo de estas pruebas ha sido el validar las mejoras que presentan los protocolos que se han optimizado empleando CN. Los resultados obtenidos de las fases segunda y tercera confirman la hipótesis de trabajo, que la CN es una herramienta eficiente para tratar el diseño inteligente en redes vehiculares

Modélisation graphique probabiliste pour la maîtrise des risques, la fiabilité et la synthèse de lois de commande des systèmes complexes

Mes travaux de recherche sont menés au Centre de Recherche en Automatique de Nancy (CRAN), dans le département Ingénierie des Systèmes Eco-Techniques (ISET) sous la responsabilité de B. Iung et de A. Thomas et le département Contrôle - Identification - Diagnostic (CID) sous la responsabilité de D. Maquin et de G. Millerioux.L’objectif principal de mes recherches est de formaliser des méthodes de construction de modèles probabilistes représentant les bons fonctionnements et les dysfonctionnements d’un système industriel. Ces modèles ont pour but de permettre l’évaluation des objectifs de fonctionnement du système (exigences opérationnelles, performances) et les conséquences en termes de fiabilité et de maîtrise des risques (exigences de sûreté). Ceci nécessite de modéliser les impacts de l’environnement sur le système et sur ses performances, mais aussi l’impact des stratégies de commande et des stratégies de maintenance sur l’état de santé du système.Pour plus de détails.A travers les différents travaux de thèses et collaborations, j’ai exploité différents formalismes de modélisation probabilistes. Les apports majeurs de nos contributions se déclinent en 3 points :• La modélisation des conséquences fonctionnelles des défaillances, structurée à partir des connaissances métiers. Nous avons développés les principes de modélisation par Réseau Bayésien (RB) permettant de relier la fiabilité et les effets des états de dégradation des composants à l’architecture fonctionnelle du système. Les composants et les modes de défaillances sont alors décrits naturellement par des variables multi-états ce qui est difficile à modéliser par les méthodes classiques de sûreté de fonctionnement. Nous proposons de représenter le modèle selon différents niveaux d'abstraction en relation avec l’analyse fonctionnelle. La modélisation par un modèle probabiliste relationnel (PRM) permet de capitaliser la connaissance par la création des classes génériques instanciées sur un système avec le principe des composants pris sur étagère.• Une modélisation dynamique de la fiabilité des systèmes pris dans leur environnement. Nous avons contribué lors de notre collaboration avec Bayesia à la modélisation de la fiabilité des systèmes par Réseau Bayésien Dynamique (RBD). Un RBD permet, grâce à la factorisation de la loi jointe, une complexité inférieure à une Chaîne de Markov ainsi qu’un paramétrage plus facile. La collaboration avec Bayesia a permis l’intégration dans Bayesialab (outil de modélisation) de ces extensions et notamment l’utilisation de paramètres variables dans le temps élargissant la modélisation des RBD à des processus Markoviens non homogènes.• La synthèse de la loi de commande pour l’optimisation de la fiabilité du système. Nous travaillons sur l’intégration de la fiabilité dans les objectifs de commande des systèmes sous contrainte de défaillances ou de défauts. Nous posons aujourd’hui le problème dans un contexte général de commande. Nous proposons une structuration du système de commande intégrant des fonctions d’optimisation et des fonctions d’évaluation de grandeurs probabilistes liées à la fiabilité du système. Nos travaux récents sont focalisés sur l’intégration, dans la boucle d’optimisation de la commande, des facteurs issues d’une analyse de sensibilité de la fiabilité du système par rapport aux composants

WiFi-Based Human Activity Recognition Using Attention-Based BiLSTM

Recently, significant efforts have been made to explore human activity recognition (HAR) techniques that use information gathered by existing indoor wireless infrastructures through WiFi signals without demanding the monitored subject to carry a dedicated device. The key intuition is that different activities introduce different multi-paths in WiFi signals and generate different patterns in the time series of channel state information (CSI). In this paper, we propose and evaluate a full pipeline for a CSI-based human activity recognition framework for 12 activities in three different spatial environments using two deep learning models: ABiLSTM and CNN-ABiLSTM. Evaluation experiments have demonstrated that the proposed models outperform state-of-the-art models. Also, the experiments show that the proposed models can be applied to other environments with different configurations, albeit with some caveats. The proposed ABiLSTM model achieves an overall accuracy of 94.03%, 91.96%, and 92.59% across the 3 target environments. While the proposed CNN-ABiLSTM model reaches an accuracy of 98.54%, 94.25% and 95.09% across those same environments

Modeling and Simulation of Metallurgical Processes in Ironmaking and Steelmaking

In recent years, improving the sustainability of the steel industry and reducing its CO2 emissions has become a global focus. To achieve this goal, further process optimization in terms of energy and resource efficiency and the development of new processes and process routes are necessary. Modeling and simulation have established themselves as invaluable sources of information for otherwise unknown process parameters and as an alternative to plant trials that involves lower costs, risks, and time. Models also open up new possibilities for model-based control of metallurgical processes. This Special Issue focuses on recent advances in the modeling and simulation of unit processes in iron and steelmaking. It includes reviews on the fundamentals of modeling and simulation of metallurgical processes, as well as contributions from the areas of iron reduction/ironmaking, steelmaking via the primary and secondary route, and continuous casting

Distributed Control for Collective Behaviour in Micro-unmanned Aerial Vehicles

Full version unavailable due to 3rd party copyright restrictions.The work presented herein focuses on the design of distributed autonomous controllers for collective behaviour of Micro-unmanned Aerial Vehicles (MAVs). Two alternative approaches to this topic are introduced: one based upon the Evolutionary Robotics (ER) paradigm, the other one upon flocking principles. Three computer simulators have been developed in order to carry out the required experiments, all of them having their focus on the modelling of fixed-wing aircraft flight dynamics. The employment of fixed-wing aircraft rather than the omni-directional robots typically employed in collective robotics significantly increases the complexity of the challenges that an autonomous controller has to face. This is mostly due to the strict motion constraints associated with fixed-wing platforms, that require a high degree of accuracy by the controller. Concerning the ER approach, the experimental setups elaborated have resulted in controllers that have been evolved in simulation with the following capabilities: (1) navigation across unknown environments, (2) obstacle avoidance, (3) tracking of a moving target, and (4) execution of cooperative and coordinated behaviours based on implicit communication strategies. The design methodology based upon flocking principles has involved tests on computer simulations and subsequent experimentation on real-world robotic platforms. A customised implementation of Reynolds’ flocking algorithm has been developed and successfully validated through flight tests performed with the swinglet MAV. It has been notably demonstrated how the Evolutionary Robotics approach could be successfully extended to the domain of fixed-wing aerial robotics, which has never received a great deal of attention in the past. The investigations performed have also shown that complex and real physics-based computer simulators are not a compulsory requirement when approaching the domain of aerial robotics, as long as proper autopilot systems (taking care of the ”reality gap” issue) are used on the real robots.EOARD (European Office of Aerospace Research & Development), euCognitio

Biomass for Energy Country Specific Show Case Studies

In many domestic and industrial processes, vast percentages of primary energy are produced by the combustion of fossil fuels. Apart from diminishing the source of fossil fuels and the increasing risk of higher costs and energy security, the impact on the environment is worsening continually. Renewables are becoming very popular, but are, at present, more expensive than fossil fuels, especially photovoltaics and hydropower. Biomass is one of the most established and common sources of fuel known to mankind, and has been in continuous use for domestic heating and cooking over the years, especially in poorer communities. The use of biomass to produce electricity is interesting and is gaining ground. There are several ways to produce electricity from biomass. Steam and gas turbine technology is well established but requires temperatures in excess of 250 °C to work effectively. The organic Rankine cycle (ORC), where low-boiling-point organic solutions can be used to tailor the appropriate solution, is particularly successful for relatively low temperature heat sources, such as waste heat from coal, gas and biomass burners. Other relatively recent technologies have become more visible, such as the Stirling engine and thermo-electric generators are particularly useful for small power production. However, the uptake of renewables in general, and biomass in particular, is still considered somewhat risky due to the lack of best practice examples to demonstrate how efficient the technology is today. Hence, the call for this Special Issue, focusing on country files, so that different nations’ experiences can be shared and best practices can be published, is warranted. This is realistic, as it seems that some nations have different attitudes to biomass, perhaps due to resource availability, or the technology needed to utilize biomass. Therefore, I suggest that we go forward with this theme, and encourage scientists and engineers who are researching in this field to present case studies related to different countries. I certainly have one case study for the UK to present

New fish product ideas generated by European consumers

Food lifestyles are changing; people have less time to spend on food purchase and preparation, therefore leading to increasing demand for new food products. However, around 76% of new food products launched in the market fail within the first year (Nielsen, 2014). One of the most effective ways to enhance new products’ success in the market is by incorporating consumers’ opinions and needs during the New Product Development (NPD) process (Moon et al., 2018). This study aimed to explore the usefulness of a qualitative technique, focus groups, to generate new aquaculture fish product ideas as well as to identify the most relevant product dimensions affecting consumers’ potential acceptance.Peer ReviewedPostprint (published version

Partitioning algorithms for induced subgraph problems

This dissertation introduces the MCSPLIT family of algorithms for two closely-related NP-hard problems that involve finding a large induced subgraph contained by each of two input graphs: the induced subgraph isomorphism problem and the maximum common induced subgraph problem. The MCSPLIT algorithms resemble forward-checking constrant programming algorithms, but use problem-specific data structures that allow multiple, identical domains to be stored without duplication. These data structures enable fast, simple constraint propagation algorithms and very fast calculation of upper bounds. Versions of these algorithms for both sparse and dense graphs are described and implemented. The resulting algorithms are over an order of magnitude faster than the best existing algorithm for maximum common induced subgraph on unlabelled graphs, and outperform the state of the art on several classes of induced subgraph isomorphism instances. A further advantage of the MCSPLIT data structures is that variables and values are treated identically; this allows us to choose to branch on variables representing vertices of either input graph with no overhead. An extensive set of experiments shows that such two-sided branching can be particularly beneficial if the two input graphs have very different orders or densities. Finally, we turn from subgraphs to supergraphs, tackling the problem of finding a small graph that contains every member of a given family of graphs as an induced subgraph. Exact and heuristic techniques are developed for this problem, in each case using a MCSPLIT algorithm as a subroutine. These algorithms allow us to add new terms to two entries of the On-Line Encyclopedia of Integer Sequences