Glabralysins, potential New β-pore-forming toxin family members from the schistosomiasis vector snail biomphalaria glabrata

Biomphalaria glabrata is a freshwater Planorbidae snail. In its environment, this mollusk faces numerous microorganisms or pathogens, and has developed sophisticated innate immune mechanisms to survive. The mechanisms of recognition are quite well understood in Biomphalaria glabrata, but immune effectors have been seldom described. In this study, we analyzed a new family of potential immune effectors and characterized five new genes that were named Glabralysins. The five Glabralysin genes showed different genomic structures and the high degree of amino acid identity between the Glabralysins, and the presence of the conserved ETX/MTX2 domain, support the hypothesis that they are pore-forming toxins. In addition, tertiary structure prediction confirms that they are structurally related to a subset of Cry toxins from Bacillus thuringiensis, including Cry23, Cry45, and Cry51. Finally, we investigated their gene expression profiles in snail tissues and demonstrated a mosaic transcription. We highlight the specificity in Glabralysin expression following immune stimulation with bacteria, yeast or trematode parasites. Interestingly, one Glabralysin was found to be expressed in immune-specialized hemocytes, and two others were induced following parasite exposure

A General Approach for Constraint Solving by Local Search

International audienc

A Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring

The Artificial Bee Colony (ABC) is the name of an optimization algorithm that was inspired by the intelligent behavior of a honey bee swarm. It is widely recognized as a quick, reliable, and efficient methods for solving optimization problems. This paper proposes a hybrid ABC (HABC) algorithm for graph 3-coloring, which is a well-known discrete optimization problem. The results of HABC are compared with results of the well-known graph coloring algorithms of today, i.e. the Tabucol and Hybrid Evolutionary algorithm (HEA) and results of the traditional evolutionary algorithm with SAW method (EA-SAW). Extensive experimentations has shown that the HABC matched the competitive results of the best graph coloring algorithms, and did better than the traditional heuristics EA-SAW when solving equi-partite, flat, and random generated medium-sized graphs

A tabu search heuristic for the Equitable Coloring Problem

The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem, current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic methods. In this paper we present a tabu search heuristic for the Equitable Coloring Problem. This algorithm is an adaptation of the dynamic TabuCol version of Galinier and Hao. In order to satisfy equity constraints, new local search criteria are given. Computational experiments are carried out in order to find the best combination of parameters involved in the dynamic tenure of the heuristic. Finally, we show the good performance of our heuristic over known benchmark instances

Tabu Search for Frequency Assignment in Mobile Radio Networks

International audienc

Les espèces actives de l’oxygène : le yin et le yang de la mitochondrie

Il existe de nombreuses sources d’espèces actives de l’oxygène (EAO) dans la cellule ; malgré l’importance de chacune d’entre elles, la mitochondrie a été choisie comme sujet central de cet article en raison de son rôle primordial dans la bio-énergétique et du fait qu’elle constitue le site majeur de la production cellulaire d’EAO, 80 % de l’anion superoxyde provenant de la chaîne respiratoire. Cette production est indissociable du processus respiratoire et fortement modulée par les conditions environnementales : elle varie notamment selon l’intensité du métabolisme énergétique ou de la pression en oxygène, permettant aux cellules de s’adapter à ces changements environnementaux en activant des voies spécifiques de signalisation. Lorsque cette production d’EAO devient chronique, elle induit des effets délétères, le stress oxydant mitochondrial étant impliqué aussi bien en physiopathologie qu’au cours du vieillissement.Literature on reactive oxygen species (ROS) effects on cell biology and physiopathology is huge and appears to be controversial. This could be explained by the fact that very few studies take into account the real subcellular source of ROS production, their chemical nature and the intensity of their production. In spite of the importance of the other sites of ROS production in the cell, we decided to focus on mitochondrial ROS. Besides their key role in bioenergetics and ATP synthesis, mitochondria are one of the main sites of ROS generation within the cell. 80 % of intracellular superoxide anion is provided by the mitochondrial respiratory chain. Mitochondrial ROS production is closely associated with activity of the respiratory chain and is modulated by environmental factors which can induce constraints on respiratory chain components. Nutrient availability as well as oxygen pressure can both modulate mitochondrial ROS production. When moderately produced, ROS specifically regulate intracellular signalling pathways by reversible oxidation of proteins such as transcription factors or proteins kinases. In this way, they can trigger cell adaptation to environmental changes as modifications of energetic metabolism or hypoxia. Indeed, we demonstrated that mitochondrial ROS act as key elements in the control of white adipose tissue development by specific up-regulation of the anti-adipogenic transcription factor CHOP-10/GADD153. However, when they are produced at high level and in a chronic manner, mitochondrial ROS can also have deleterious effects by massive and irreversible oxidation of their principals targets i.e. lipids, DNA and proteins. In these conditions, mitochondrial ROS are involved in aging process and in pathological situations as metabolic disease

Optimality Clue for Graph Coloring Problem

In this paper, we present a new approach which qualifies or not a solution found by a heuristic as a potential optimal solution. Our approach is based on the following observation: for a minimization problem, the number of admissible solutions decreases with the value of the objective function. For the Graph Coloring Problem (GCP), we confirm this observation and present a new way to prove optimality. This proof is based on the counting of the number of different k-colorings and the number of independent sets of a given graph G. Exact solutions counting problems are difficult problems (\#P-complete). However, we show that, using only randomized heuristics, it is possible to define an estimation of the upper bound of the number of k-colorings. This estimate has been calibrated on a large benchmark of graph instances for which the exact number of optimal k-colorings is known. Our approach, called optimality clue, build a sample of k-colorings of a given graph by running many times one randomized heuristic on the same graph instance. We use the evolutionary algorithm HEAD [Moalic et Gondran, 2018], which is one of the most efficient heuristic for GCP. Optimality clue matches with the standard definition of optimality on a wide number of instances of DIMACS and RBCII benchmarks where the optimality is known. Then, we show the clue of optimality for another set of graph instances. Optimality Metaheuristics Near-optimal

La Caridad/Solidaridad desde las Hermandades de Gloria

Colectivos de personas aglutinados a través de las llamadas Hermandades de Gloria realizan una fecunda labor de ayuda al prójimo. Tienen sus sedes en dos espacios urbanos ubicados en extremos distantes del perímetro de Sevilla como por un lado es Triana, que acaba dando al río en su separación de Camas y San Juan de Aznalfarache y por el otro la Barriada Juan XXIII, que más allá tiene toda la zona Este que le lleva a Alcalá de Guadaira. Los responsables de sus Diputaciones de Caridad narrarán los quehaceres de las Hermandades del Rocío y de la Anunciación, respectivamente

Développement sans rupture de systèmes complexes : une approche basée multi-exigences

Prouver qu'un système satisfait à ses exigences est un défi important de l'ingénierie des exigences. D'une part, les approches formelles fournissent un moyen d'exprimer les exigences mathématiquement et de prouver qu'un système satisfait ses exigences. Cependant, si la formalisation offre des possibilités supplémentaires telles que la vérification, voire la validation, elle s'avère souvent trop difficile à utiliser en pratique par les acteurs impliqués dans le développement des systèmes. D'autre part, dans la plupart des cas, les exigences sont écrites et parfois tracées en langage naturel à des fins de communication et de compréhension mutuelle. De plus, cela reste le cas tout au long du processus de développement. Ainsi, il est nécessaire de considérer le besoin de s'adresser à toutes ces parties prenantes pendant le processus de développement. L'objectif principal de cette thèse est de fournir une méthodologie sans rupture qui permet de bénéficier de la formalisation des exigences tout en étant compréhensible par toutes les parties prenantes. Nous proposons une approche qui considère les exigences comme des parties du code du système, ce qui, en tant que tel, contribue à améliorer l'évaluation de la qualité. De plus, l'intégration des exigences dans le code garantit un développement sans rupture. Ces contributions visent trois avantages principaux. Premièrement, il n'est pas nécessaire de passer d'un outil ou d'un environnement à un autre : un cadre unique prend en charge le développement de l'analyse à la mise en œuvre. Deuxièmement, les changements et la réversibilité deviennent un phénomène régulier, directement pris en charge par la méthode, le langage et les outils, ce qui facilite les allers-retours. Enfin, les différents niveaux d'abstraction restent dans le cadre du paradigme orienté objet. Nous appliquons cette vision au processus de développement lui-même avec les mêmes avantages attendus. Le cycle de vie du développement peut alors bénéficier de cette forte intégration des exigences dans le code. Ces artefacts aident au développement du logiciel en fournissant un support et des lignes directrices pour l'analyse ou l'aide à la décision et en renforçant la qualité du logiciel. En outre, la réutilisabilité, l'évolutivité et la maintenabilité sont améliorées. La traçabilité entre les exigences et le code permet une analyse d'impact facile lorsque l'un de ces artefacts évolue. Cependant, si ce paradigme est familier aux développeurs et même si nous faisons un effort d'expressivité, il ne s'adresse pas aux autres parties prenantes qui ont l'habitude de travailler avec d'autres outils. Puisque nous souhaitons également que des non-experts utilisent notre approche pour valider des systèmes dans la première phase de leur développement, nous proposons un langage spécifique au domaine : (i) proche du langage naturel et (ii) basé sur une sémantique formelle. En utilisant les techniques de l'ingénierie dirigée par les modèles, ce langage permet de combler le fossé entre les différents acteurs impliqués dans un projet (compte tenu de leurs différentes expériences) et entre les exigences et le code. Nous avons enfin consacré un effort de recherche à la définition des relations entre les exigences. Nous fournissons leurs définitions formelles et leurs propriétés sur la propagation de l'état de satisfaction. Ces définitions peuvent aider les ingénieurs à vérifier les exigences (en vérifiant la validité de la sémantique des relations entre deux exigences) et à vérifier la conformité du système (grâce à la propagation de la satisfaction). Ce travail est une étape vers l'introduction de la sémantique formelle dans la traçabilité, permettant d'analyser automatiquement les exigences et d'utiliser leurs relations pour vérifier l'implémentation correspondante du système.Proving that a system satisfies its requirements is an important challenge of Requirements Engineering. On the one hand, formal approaches provide a way to express requirements mathematically and prove that a system satisfies its requirements. However, if formalization offers additional possibilities such as verification, or even validation, it often proves to be too difficult to use in practice by the stakeholders involved in the development of systems. On the other hand, in most cases, requirements are written and sometimes traced in Natural Language for communication and mutual understanding purposes. Moreover, this remains during the whole development process. Thus, it is necessary to consider the need to address all these stakeholders during the development process. The main objective of this thesis is to provide a seamless methodology that allows benefiting from the formalization of requirements while being understandable by all stakeholders. We propose an approach that considers requirements as parts of the system's code, which, as such, contributes to improving quality assessment. In addition, integrating the requirements into the code guarantees a seamless development. The contributions target three main benefits. First, there is no need to switch from one tool or environment to another: a single framework supports the development from analysis to implementation. Second, changes and reversibility become a regular occurrence, directly supported by the method, language, and tools, facilitating round-trips. Third, the different levels of abstraction remain inside the object-oriented paradigm. We apply this vision to the development process itself with the same expected advantages. The development life-cycle can then benefit from this strong integration of requirements into the code. These artifacts help in software development by providing support and guidelines for analysis or decision support and reinforcing the software quality. Besides, reusability, evolutivity, and maintainability are enhanced. Traceability between requirements and code allows an easy impact analysis when any of these artifacts evolve. However, if this paradigm is familiar to developers and even if we put an effort in providing expressivity, they are not addressed to other stakeholders that used to work with several tools. Since we also want non-experts to use our approach to validate systems in the early stage of their development, we propose a Domain-Specific Language: (i) close to natural language and (ii) based on formal semantics. Using Model-Driven Engineering techniques, this language bridges the gap between the several stakeholders involved in a project (considering their different backgrounds) and between the requirements and the code. We finally put a research effort into defining relationships between requirements. We provide their formal definitions and properties on the propagation of the satisfaction state. These definitions can help engineers verify requirements (by checking the validity of the semantics of the relationships between two requirements) and verify the system compliance (thanks to satisfaction propagation). This work is a step towards introducing formal semantics into traceability, making it possible to automatically analyze requirements and use their relationships to verify the corresponding implementation of the system