Byzantine Gathering in Polynomial Time

We study the task of Byzantine gathering in a network modeled as a graph. Despite the presence of Byzantine agents, all the other (good) agents, starting from possibly different nodes and applying the same deterministic algorithm, have to meet at the same node in finite time and stop moving. An adversary chooses the initial nodes of the agents and assigns a different label to each of them. The agents move in synchronous rounds and communicate with each other only when located at the same node. Within the team, f of the agents are Byzantine. A Byzantine agent acts in an unpredictable way: in particular it may forge the label of another agent or create a completely new one. Besides its label, which corresponds to a local knowledge, an agent is assigned some global knowledge GK that is common to all agents. In literature, the Byzantine gathering problem has been analyzed in arbitrary n-node graphs by considering the scenario when GK=(n,f) and the scenario when GK=f. In the first (resp. second) scenario, it has been shown that the minimum number of good agents guaranteeing deterministic gathering of all of them is f+1 (resp. f+2). For both these scenarios, all the existing deterministic algorithms, whether or not they are optimal in terms of required number of good agents, have a time complexity that is exponential in n and L, where L is the largest label belonging to a good agent. In this paper, we seek to design a deterministic solution for Byzantine gathering that makes a concession on the proportion of Byzantine agents within the team, but that offers a significantly lower complexity. We also seek to use a global knowledge whose the length of the binary representation is small. Assuming that the agents are in a strong team i.e., a team in which the number of good agents is at least some prescribed value that is quadratic in f, we give positive and negative results

Magnetosomes: biogenic iron nanoparticles produced by environmental bacteria

International audienc

Byzantine Gathering in Polynomial Time

International audienceGathering a group of mobile agents is a fundamental task in the field of distributed and mobile systems. This can be made drastically more difficult to achieve when some agents are subject to faults, especially the Byzantine ones that are known as being the worst faults to handle. In this paper we study, from a deterministic point of view, the task of Byzantine gathering in a network modeled as a graph. In other words, despite the presence of Byzantine agents, all the other (good) agents, starting from {possibly} different nodes and applying the same deterministic algorithm, have to meet at the same node in finite time and stop moving. An adversary chooses the initial nodes of the agents (the number of agents may be larger than the number of nodes) and assigns a different positive integer (called label) to each of them. Initially, each agent knows its label. The agents move in synchronous rounds and can communicate with each other only when located at the same node. Within the team, f of the agents are Byzantine. A Byzantine agent acts in an unpredictable and arbitrary way. For example, it can choose an arbitrary port when it moves, can convey arbitrary information to other agents and can change its label in every round, in particular by forging the label of another agent or by creating a completely new one. Besides its label, which corresponds to a local knowledge, an agent is assigned some global knowledge denoted by GK that is common to all agents. In literature, the Byzantine gathering problem has been analyzed in arbitrary n-node graphs by considering the scenario when GK=(n,f) and the scenario when GK=f. In the first (resp. second) scenario, it has been shown that the minimum number of good agents guaranteeing deterministic gathering of all of them is f+1 (resp. f+2). However, for both these scenarios, all the existing deterministic algorithms, whether or not they are optimal in terms of required number of good agents, have the major disadvantage of having a time complexity that is exponential in n and L, where L is the value of the largest label belonging to a good agent. In this paper, we seek to design a deterministic solution for Byzantine gathering that makes a concession on the proportion of Byzantine agents within the team, but that offers a significantly lower complexity. We also seek to use a global knowledge whose the length of the binary representation (that we also call size) is small. In this respect, assuming that the agents are in a strong team i.e., a team in which the number of good agents is at least some prescribed value that is quadratic in f, we give positive and negative results. On the positive side, we show an algorithm that solves Byzantine gathering with all strong teams in all graphs of size at most n, for any integers n and f, in a time polynomial in n and the length |l_{min}| of the binary representation of the smallest label of a good agent. The algorithm works using a global knowledge of size O(log log log n), which is of optimal order of magnitude in our context to reach a time complexity that is polynomial in n and |l_{min}|. Indeed, on the negative side, we show that there is no deterministic algorithm solving Byzantine gathering with all strong teams, in all graphs of size at most n, in a time polynomial in n and |l_{min}| and using a global knowledge of size o(log log log n

A Sensitive Magnetic Arsenite-Specific Biosensor Hosted in Magnetotactic Bacteria

International audienceAccording to the World Health Organization, arsenic is the water contaminant that affects the largest number of people worldwide. To limit its impact on the population, inexpensive, quick, and easy-to-use systems of detection are required. One promising solution could be the use of whole-cell biosensors, which have been extensively studied and could meet all these criteria even though they often lack sensitivity. Here, we investigated the benefit of using magnetotactic bacteria as cellular chassis to design and build sensitive magnetic bacterial biosensors. Promoters potentially inducible by arsenic were first identified in silico within the genomes of two magnetotactic bacteria strains, Magnetospirillum magneticum AMB-1 and Magnetospirillum gryphiswaldense MSR-1. The ArsR-dependent regulation was confirmed by reverse transcription-PCR experiments. Biosensors built by transcriptional fusion between the arsenic-inducible promoters and the bacterial luciferase luxCDABE operon gave an element-specific response in 30 min with an arsenite detection limit of 0.5 mu M. After magnetic concentration, we improved the sensitivity of the biosensor by a factor of 50 to reach 10 nM, more than 1 order of magnitude below the recommended guidelines for arsenic in drinking water (0.13 mu M). Finally, we demonstrated the successful preservation of the magnetic bacterium biosensors by freeze-drying.IMPORTANCE Whole-cell biosensors based on reporter genes can be designed for heavy metal detection but often require the optimization of their sensitivity and specific adaptations for practical use in the field. Magnetotactic bacteria as cellular hosts for biosensors are interesting models, as their intrinsic magnetism permits them to be easily concentrated and entrapped to increase the arsenic-response signal. This paves the way for the development of sensitive and immobilized whole-cell biosensors tailored for use in the field

Regulation of alginate catabolism involves a GntR family repressor in the marine flavobacterium Zobellia galactanivorans DsijT

International audienceMarine flavobacteria possess dedicated Polysaccharide Utilization Loci (PULs) enabling efficient degradation of a variety of algal polysaccharides. The expression of these PULs is tightly controlled by the presence of the substrate, yet details on the regulatory mechanisms are still lacking. The marine flavobacterium Zobellia galactanivorans DsijT digests many algal polysaccharides, including alginate from brown algae. Its complex Alginate Utilization System (AUS) comprises a PUL and several other loci. Here, we showed that the expression of the AUS is strongly and rapidly (<30 min) induced upon addition of alginate, leading to biphasic substrate utilization. Polymeric alginate is first degraded into smaller oligosaccharides that accumulate in the extracellular medium before being assimilated. We found that AusR, a GntR family protein encoded within the PUL, regulates alginate catabolism by repressing the transcription of most AUS genes. Based on our genetic, genomic, transcriptomic and biochemical results, we propose the first model of regulation for a PUL in marine bacteria. AusR binds to promoters of AUS genes via single, double or triple copies of operator. Upon addition of alginate, secreted enzymes expressed at a basal level catalyze the initial breakdown of the polymer. Metabolic intermediates produced during degradation act as effectors of AusR and inhibit the formation of AusR/DNA complexes, thus lifting transcriptional repression

The effect of obesity on uterine receptivity is mediated by endometrial extracellular vesicles that control human endometrial stromal cell decidualization and trophoblast invasion

Abstract The objectives of the present study were to determine whether obesity impacts human decidualization and the endometrial control of trophoblast invasion (both of which are required for embryo implantation) and evaluate the potential involvement of endometrial extracellular vesicles (EVs) in the regulation of these physiological processes. Using primary human cell cultures, we first demonstrated that obesity is associated with significantly lower in vitro decidualization of endometrial stromal cells (ESCs). We then showed that a trophoblastic cell line's invasive ability was greater in the presence of conditioned media from cultures of ESCs from obese women. The results of functional assays indicated that supplementation of the culture medium with EVs from nonobese women can rescue (at least in part) the defect in in vitro decidualization described in ESCs from obese women. Furthermore, exposure to endometrial EVs from obese women (vs. nonobese women) was associated with significantly greater invasive activity by HTR‐8/SVneo cells. Using mass‐spectrometry‐based quantitative proteomics, we found that EVs isolated from uterine supernatants of biopsies from obese women (vs. nonobese women) presented a molecular signature focused on cell remodelling and angiogenesis. The proteomics analysis revealed two differentially expressed proteins (fibronectin and angiotensin‐converting enzyme) that might be involved specifically in the rescue of the decidualization capacity in ESCs from obese women; both of these proteins are abundantly present in endometrial EVs from nonobese women, and both are involved in the decidualization process. In conclusion, our results provided new insights into the endometrial EVs’ pivotal role in the poor uterine receptivity observed in obese women