Tight Mobile Byzantine Tolerant Atomic Storage

This paper proposes the first implementation of an atomic storage tolerant to mobile Byzantine agents. Our implementation is designed for the round-based synchronous model where the set of Byzantine nodes changes from round to round. In this model we explore the feasibility of multi-writer multi-reader atomic register prone to various mobile Byzantine behaviors. We prove upper and lower bounds for solving the atomic storage in all the explored models. Our results, significantly different from the static case, advocate for a deeper study of the main building blocks of distributed computing while the system is prone to mobile Byzantine failures

Ensino de matemática: novas tecnologias, novos problemas

O instrumental tecnológico constitui um potencial valioso tanto para os professores como para os estudantes: para os primeiros como um auxílio poderoso visando a construção significativa do conhecimento; para os segundos como uma ferramenta que possibilita o desenvolvimento da capacidade de investigação e conseqüentemente da capacidade de estabelecer e desenvolver projetos. Algumas atividades, que exemplificam a ênfase colocada, são propostas no trabalho

Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems

A stabilizing Byzantine single-writer single-reader (SWSR) regular register, which stabilizes after the first invoked write operation, is first presented. Then, new/old ordering inversions are eliminated by the use of a (bounded) sequence number for writes, obtaining a practically stabilizing SWSR atomic register. A practically stabilizing Byzantine single-writer multi-reader (SWMR) atomic register is then obtained by using several copies of SWSR atomic registers. Finally, bounded time-stamps, with a time-stamp per writer, together with SWMR atomic registers, are used to construct a practically stabilizing Byzantine multi-writer multi-reader (MWMR) atomic register. In a system of $n$ servers implementing an atomic register, and in addition to transient failures, the constructions tolerate t<n/8 Byzantine servers if communication is asynchronous, and t<n/3 Byzantine servers if it is synchronous. The noteworthy feature of the proposed algorithms is that (to our knowledge) these are the first that build an atomic read/write storage on top of asynchronous servers prone to transient failures, and where up to t of them can be Byzantine

Spatial mismatch, wages and unemployment in metropolitan areas in Brazil

The spatial mismatch hypothesis states that a lack of connection to job opportunities may affect an individual's prospects in the labour market, especially for low-skilled workers. This phenomenon is especially observed in large urban areas, in which low-skilled minorities tend to live far away from jobs and face geographical barriers to finding and keeping jobs. This paper aims to investigate whether this negative relationship between spatial mismatch and labour market outcomes is valid in Brazil after controlling for individual characteristics. Our conclusions indicate that there is no clear relation between different measures of accessibility to jobs and the probability of being unemployed. However, for wages there is a clear correlation, which is stronger in larger metropolitan areas in the country. Given the exploratory nature of this work, our results still rely on strong identification hypotheses to avoid potential bias related to simultaneous location decisions of workers and firms within the city. Even if these conditions do not hold, the results are still meaningful as they provide a better understanding of the conditional distribution of wages and the unemployment rate in the biggest metropolitan areas of Brazil

Stabilizing Byzantine-Fault Tolerant Storage

Distributed storage service is one of the main abstractions provided to developers of distributed applications due to its ability to hide the complexity generated by the various messages exchanged between processes. Many protocols have been proposed to build Byzantine-fault-tolerant (BFT) storage services on top of a message-passing system but none of them considers the possibility that well-behaving processes (i.e. correct processes) may experience transient failures due to, say, isolated errors during computation or bit alteration during message transfer. This paper proposes a stabilizing Byzantine-tolerant algorithm for emulating a multi-writer multi-reader regular register abstraction on top of a message passing system with n > 5f servers, which we prove to be the minimal possible number of servers for stabilizing and tolerating f Byzantine servers. That is, each read operation returns the value written by the most recent write and write operations are totally ordered with respect to the happened before relation. Our algorithm is particularly appealing for cloud computing architectures where both processors and memory contents (including stale messages in transit) are prone to errors, faults and malicious behaviors. The proposed implementation extends previous BFT implementations in two ways. First, the algorithm works even when the local memory of processors and the content of the communication channels are initially corrupted in an arbitrary manner. Second, unlike previous solutions, our algorithm uses bounded logical timestamps, a feature difficult to achieve in the presence of transient errors

3d crs analysis: a new data-driven optimization strategy for the simultaneous estimate of the eight stacking parameters

We devised a data-driven strategy for the simultaneous estimate of the eight CRS traveltime attributes, solving a global non-linear minimization problem without the need of computing gradients. The essential elements in this Eni research and development activity are the following: a conjugate-direction method supported by well known convergence properties and an iterative line-search implementing the strong Wolfe-Powell rule for the control of the steplength. The resulting algorithm can reach very good solutions in presence of many local minima.3284-329

The superfamily keeps growing: Identification in trypanosomatids of RibJ, the first riboflavin transporter family in protists

Background: Trypanosomatid parasites represent a major health issue affecting hundreds of million people worldwide, with clinical treatments that are partially effective and/or very toxic. They are responsible for serious human and plant diseases including Trypanosoma cruzi (Chagas disease), Trypanosoma brucei (Sleeping sickness), Leishmania spp. (Leishmaniasis), and Phytomonas spp. (phytoparasites). Both, animals and trypanosomatids lack the biosynthetic riboflavin (vitamin B2) pathway, the vital precursor of flavin mononucleotide (FMN) and flavin adenine dinucleotide (FAD) cofactors. While metazoans obtain riboflavin from the diet through RFVT/SLC52 transporters, the riboflavin transport mechanisms in trypanosomatids still remain unknown. Methodology/Principal findings: Here, we show that riboflavin is imported with high affinity in Trypanosoma cruzi, Trypanosoma brucei, Leishmania (Leishmania) mexicana, Crithidia fasciculata and Phytomonas Jma using radiolabeled riboflavin transport assays. The vitamin is incorporated through a saturable carrier-mediated process. Effective competitive uptake occurs with riboflavin analogs roseoflavin, lumiflavin and lumichrome, and co-factor derivatives FMN and FAD. Moreover, important biological processes evaluated in T. cruzi (i.e. proliferation, metacyclogenesis and amastigote replication) are dependent on riboflavin availability. In addition, the riboflavin competitive analogs were found to interfere with parasite physiology on riboflavin-dependent processes. By means of bioinformatics analyses we identified a novel family of riboflavin transporters (RibJ) in trypanosomatids. Two RibJ members, TcRibJ and TbRibJ from T. cruzi and T. brucei respectively, were functionally characterized using homologous and/or heterologous expression systems. Conclusions/Significance: The RibJ family represents the first riboflavin transporters found in protists and the third eukaryotic family known to date. The essentiality of riboflavin for trypanosomatids, and the structural/biochemical differences that RFVT/SLC52 and RibJ present, make the riboflavin transporter -and its downstream metabolism- a potential trypanocidal drug target.Fil: Balcazar, Dario Emmanuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario. Instituto de Ciencia y Tecnología "Dr. César Milstein". Fundación Pablo Cassará. Instituto de Ciencia y Tecnología ; ArgentinaFil: Vanrell, Maria Cristina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mendoza. Instituto de Histología y Embriología de Mendoza Dr. Mario H. Burgos. Universidad Nacional de Cuyo. Facultad de Cienicas Médicas. Instituto de Histología y Embriología de Mendoza Dr. Mario H. Burgos; ArgentinaFil: Romano, Patricia Silvia. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mendoza. Instituto de Histología y Embriología de Mendoza Dr. Mario H. Burgos. Universidad Nacional de Cuyo. Facultad de Cienicas Médicas. Instituto de Histología y Embriología de Mendoza Dr. Mario H. Burgos; ArgentinaFil: Pereira, Claudio Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Houssay. Instituto de Investigaciones Médicas. Universidad de Buenos Aires. Facultad de Medicina. Instituto de Investigaciones Médicas; ArgentinaFil: Goldbaum, Fernando Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario. Instituto de Investigaciones Bioquímicas de Buenos Aires. Fundación Instituto Leloir. Instituto de Investigaciones Bioquímicas de Buenos Aires; ArgentinaFil: Bonomi, Hernán Ruy. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario. Instituto de Investigaciones Bioquímicas de Buenos Aires. Fundación Instituto Leloir. Instituto de Investigaciones Bioquímicas de Buenos Aires; ArgentinaFil: Carrillo, Carolina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario. Instituto de Ciencia y Tecnología "Dr. César Milstein". Fundación Pablo Cassará. Instituto de Ciencia y Tecnología ; Argentin

Optimal mobile byzantine fault tolerant distributed storage: [Extended Abstract]

We present an optimal emulation of a server based regular read/write storage in a synchronous round-free messagepassing system that is subject to mobile Byzantine failures and prove that the problem is impossible to solve in asynchronous settings. In a system with n servers implementing a regular register, our construction tolerates faults (or attacks) that can be abstracted by agents that are moved (in an arbitrary and unforeseen manner) by a computationally unbounded adversary from a server to another in order to deviate the server's computation. When a server is infected by an adversarial agent, it behaves arbitrarily until the adversary decides to "move" the agent to another server. We investigate the case where the movements of the mobile Byzantine agents are decided by the adversary and are completely decoupled from the message communication delay. Our emulation spans two awareness models: servers with and without self-diagnosis mechanism. In the first case servers are aware that the mobile Byzantine agent has left and hence they can stop running the protocol until they recover a correct state while in the second case, servers are not aware of their faulty state and continue to run the protocol using an incorrect local state. Our results, proven optimal with respect to the threshold of the tolerated mobile Byzantine faults in the first model, are significantly different from the round-based synchronous models. Another interesting side result of our study is that, contrary to the round-based synchronous consensus implementation for systems prone to mobile Byzantine faults, our storage emulation does not rely on the necessity of a core of correct processes all along the computation. That is, every server in the system can be compromised by the mobile Byzantine agents at some point in the computation. This leads to another interesting conclusion: storage is easier than consensus in synchronous settings, when the system is hit by mobile Byzantine failures