Beeping a Maximal Independent Set

We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that an adversary chooses at which time slot each node wakes up. At each time slot a node can either beep, that is, emit a signal, or be silent. At a particular time slot, beeping nodes receive no feedback, while silent nodes can only differentiate between none of its neighbors beeping, or at least one of its neighbors beeping. We start by proving a lower bound that shows that in this model, it is not possible to locally converge to an MIS in sub-polynomial time. We then study four different relaxations of the model which allow us to circumvent the lower bound and find an MIS in polylogarithmic time. First, we show that if a polynomial upper bound on the network size is known, it is possible to find an MIS in O(log^3 n) time. Second, if we assume sleeping nodes are awoken by neighboring beeps, then we can also find an MIS in O(log^3 n) time. Third, if in addition to this wakeup assumption we allow sender-side collision detection, that is, beeping nodes can distinguish whether at least one neighboring node is beeping concurrently or not, we can find an MIS in O(log^2 n) time. Finally, if instead we endow nodes with synchronous clocks, it is also possible to find an MIS in O(log^2 n) time.Comment: arXiv admin note: substantial text overlap with arXiv:1108.192

On the Limits and Practice of Automatically Designing Self-Stabilization

A protocol is said to be self-stabilizing when the distributed system executing it is guaranteed to recover from any fault that does not cause permanent damage. Designing such protocols is hard since they must recover from all possible states, therefore we investigate how feasible it is to synthesize them automatically. We show that synthesizing stabilization on a fixed topology is NP-complete in the number of system states. When a solution is found, we further show that verifying its correctness on a general topology (with any number of processes) is undecidable, even for very simple unidirectional rings. Despite these negative results, we develop an algorithm to synthesize a self-stabilizing protocol given its desired topology, legitimate states, and behavior. By analogy to shadow puppetry, where a puppeteer may design a complex puppet to cast a desired shadow, a protocol may need to be designed in a complex way that does not even resemble its specification. Our shadow/puppet synthesis algorithm addresses this concern and, using a complete backtracking search, has automatically designed 4 new self-stabilizing protocols with minimal process space requirements: 2-state maximal matching on bidirectional rings, 5-state token passing on unidirectional rings, 3-state token passing on bidirectional chains, and 4-state orientation on daisy chains

Proceedings of the 22nd Conference on Formal Methods in Computer-Aided Design – FMCAD 2022

The Conference on Formal Methods in Computer-Aided Design (FMCAD) is an annual conference on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing groundbreaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system design including verification, specification, synthesis, and testing

Proceedings of the 22nd Conference on Formal Methods in Computer-Aided Design – FMCAD 2022

The Conference on Formal Methods in Computer-Aided Design (FMCAD) is an annual conference on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing groundbreaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system design including verification, specification, synthesis, and testing

Aerospace medicine and biology: A continuing bibliography with indexes, supplement 183

This bibliography lists 273 reports, articles, and other documents introduced into the NASA scientific and technical information system in July 1978

Airframe assembly, systems integration and flight testing of a long endurance electric UAV

The need to adopt new techniques and practices in the Aerospace Industry branch is a consequence of technological development. The present work aims to study the use of solar power as a main energy source in the aviation, in this case for a flight of long endurance of an unmanned air vehicle. This master thesis follows on previous works of the LEEUAV, where it was done the design and construction of a long endurance unmanned aerial system. Thus, the main objective of this work is the systems integration, flight testing and concepts validation. LEEUAV, a prototype of 4.5 meters’ wingspan and ultralight structure partially covered by solar cells was designed to fulfil a continuous flight mission of at least 8 hours on the equinox. The 5.42Kg remotely piloted aircraft was successfully tested showing the agreement with theoretical calculations already made. The longest flight achieved lasted more than 8.5 hours’ resulting in a total distance travelled of more than 75 km. In order to validate the airworthiness concept of the LEEUAV several flight tests were performed and their respective data (static and total pressure, air temperature, ground speed and pitch angle) was collected for further analysis, using a flight controller with multiple sensors on board. The results obtained allowed to study the general performance of the aircraft, the main defects, agreement with the theoretical results as well as determine the real values of aerodynamic coefficients (????, ????), through a reading and processing flight data algorithm in Software MATLAB. Finally, some future expectations for upcoming work are suggested in order to make the LEEUAV an Unmanned Aerial Vehicle of reference.A necessidade de adoção de novas técnicas e práticas no ramo da Indústria Aeronáutica é uma consequência do desenvolvimento tecnológico. O presente trabalho aborda o uso de energia solar como principal fonte de energia na aviação, com enfoque num voo de grande autonomia de uma aeronave não tripulada. Esta tese de mestrado surge na sequência de trabalhos anteriores relativos ao LEEUAV, nos quais se efetuou o projeto e construção de uma aeronave não tripulada de grande autonomia. Assim, o principal objetivo deste trabalho é a integração de sistemas, testes de voo e validação de conceitos. O UAV Solar LEEUAV é um protótipo de 4.5 metros de envergadura e de estrutura ultraleve parcialmente coberto de células fotovoltaicas sendo projetado para cumprir uma missão de voo contínuo de pelo menos 8h no equinócio. O avião de 5.42kg foi testado com sucesso mostrando a concordância com os cálculos teóricos já elaborados. O voo mais longo conseguido foi de 3.13 horas correspondendo a uma distância total percorrida de 96.265 km. De modo a validar o conceito de aeronavegabilidade do LEEUAV foram efetuados vários voos de teste e recolhidos dados de voo (pressão estática e dinâmica, temperatura do ar, velocidade no solo e ângulo de arfagem) para posterior análise, utilizando um controlador de voo com múltiplos sensores a bordo. A análise dos resultados obtidos permitiu precisar o desempenho geral da aeronave, os principais defeitos, concordância com os resultados teóricos assim como determinar os valores reais dos coeficientes aerodinâmicos (???? , ????) através de um algoritmo de leitura e processamento de dados de voo, em Software MATLAB. Por fim, são referidas algumas sugestões para o desenvolvimento de novos trabalhos com o objetivo de tornar O LEEUAV num veículo aéreo não tripulado de referência

Recent developments in mathematical aspects of relativistic fluids

We review some recent developments in mathematical aspects of relativistic fluids. The goal is to provide a quick entry point to some research topics of current interest that is accessible to graduate students and researchers from adjacent fields, as well as to researches working on broader aspects of relativistic fluid dynamics interested in its mathematical formalism. Instead of complete proofs, which can be found in the published literature, here we focus on the proofs' main ideas and key concepts. After an introduction to the relativistic Euler equations, we cover the following topics: a new wave-transport formulation of the relativistic Euler equations tailored to applications; the problem of shock formation for relativistic Euler; rough (i.e., low-regularity) solutions to the relativistic Euler equations; the relativistic Euler equations with a physical vacuum boundary; relativistic fluids with viscosity. We finish with a discussion of open problems and future directions of research.Comment: Minor typos correcte

Algebraic tools in phylogenomics.

En aquesta tesi interdisciplinar desenvolupem eines algebraiques per a problemes en filogenètica i genòmica. Per estudiar l'evolució molecular de les espècies sovint s'usen models evolutius estocàstics. L'evolució es representa en un arbre (anomenat filogenètic) on les espècies actuals corresponen a fulles de l'arbre i els nodes interiors corresponen a ancestres comuns a elles. La longitud d'una branca de l'arbre representa la quantitat de mutacions que han ocorregut entre les dues espècies adjacents a la branca. Llavors l'evolució de seqüències d'ADN en aquestes espècies es modelitza amb un procés Markov ocult al llarg de l'arbre. Si el procés de Markov se suposa a temps continu, normalment s'assumeix que també és homogeni i, en tal cas, els paràmetres del model són les entrades d'una raó de mutació instantània i les longituds de les branques. Si el procés de Markov és a temps discret, llavors els paràmetres del model són les probabilitats condicionades de substitució de nucleòtids al llarg de l'arbre i no hi ha cap hipòtesi d'homogeneïtat. Aquests últims són els tipus de models que considerem en aquesta tesi i són, per tant, més generals que els de temps continu. Des d'aquesta perspectiva s'estudien els problemes més bàsics de la filogenètica: donat un conjunt de seqüències d'ADN, com decidim quin és el model evolutiu més adequat? com inferim de forma eficient els paràmetres del model? I fins i tot, tal i com també hem provat en aquesta tesi, és possible que les espècies no hagin evolucionat seguint un sol arbre sinó una mescla d'arbres i llavors cal abordar aquestes preguntes en aquest cas més general. Per a models evolutius a temps continu i homogenis, s'ha proposat solucions diverses a aquestes preguntes al llarg de les últimes dècades. En aquesta tesi resolem aquests dos problemes per a models evolutius a temps discret usant tècniques algebraiques provinents d'àlgebra lineal, teoria de grups, geometria algebraica i estadística algebraica. A més a més, la nostra solució per al primer problema és vàlida també per a mescles filogenètiques. Hem fet tests dels mètodes proposats en aquesta tesi sobre dades simulades i dades reals del projectes ENCODE (Encyclopedia Of DNA Elements). Per tal de provar els nostres mètodes hem donat algoritmes per a generar seqüències evolucionant sota un model a temps discret amb un nombre esperat de mutacions prefixat. I així mateix, hem demostrat que aquests algorismes generen totes les seqüències possibles (per la majoria de models). Els tests sobre dades simulades mostren que els mètodes proposats són molt acurats i els resultats sobre dades reals permeten corroborar hipòtesis prèviament formulades. Tots els mètodes proposats en aquesta tesi han estat implementats per a un nombre arbitrari d'espècies i estan disponibles públicament.In this thesis we develop interdisciplinary algebraic tools for genomic and phylogenetic problems. To study the molecular evolution of species one often uses stochastic evolutionary models. The evolution is represented in a tree (called phylogenetic tree) whose leaves represent current species and whose internal nodes correspond to their common ancestors. The length of a branch of the tree represents the number of mutations that have occurred between the two species adjacent to the branch. Then ,the evolution of DNA sequences in these species is modeled with a hidden Markov process along the tree. If the Markov process is assumed to be continuous in time, it is usually assumed homogeneous as well and, if so, the model parameters are the instantaneous rate of mutation and the lengths of the branches. If the Markov process is discrete in time, then the model parameters are the conditional probabilities of nucleotide substitution along the tree and there is no assumption of homogeneity. The latter are the types of models we consider in this thesis and are therefore more general than the homogeneous continuous ones. From this perspective we study the basic problems of phylogenetics: Given a set of DNA sequences, what is the evolutionary model that best fits the data? how can we efficiently infer the model parameters? Also, as we also checked in this thesis, it is possible that species have not evolved along a single tree but a mixture of trees so that we need to address these questions in this more general case. For continuous-time, homogeneous, evolutionary models, several solutions to these questions have been proposed during the last decades. In this thesis we solve these two problems for discrete-time evolutionary models, using algebraic techniques from linear algebra, group theory, algebraic geometry and algebraic statistics. In addition, our solution to the first problem is also valid for phylogenetic mixtures. We have made tests of the methods proposed in this thesis on simulated and real data from ENCODE Project (Encyclopedia Of DNA Elements). To test our methods, we also provide algorithms to generate sequences evolving under discrete-time models with a given expected number of mutations. Even more, we have proved that these algorithms generate all possible sequences (for most models). Tests on simulated data show that the methods are very accurate and our results on real data confirm hypotheses previously formulated. All the methods in this thesis have been implemented for an arbitrary number of species and are publicly available.Postprint (published version

The Fifteenth Marcel Grossmann Meeting

The three volumes of the proceedings of MG15 give a broad view of all aspects of gravitational physics and astrophysics, from mathematical issues to recent observations and experiments. The scientific program of the meeting included 40 morning plenary talks over 6 days, 5 evening popular talks and nearly 100 parallel sessions on 71 topics spread over 4 afternoons. These proceedings are a representative sample of the very many oral and poster presentations made at the meeting.Part A contains plenary and review articles and the contributions from some parallel sessions, while Parts B and C consist of those from the remaining parallel sessions. The contents range from the mathematical foundations of classical and quantum gravitational theories including recent developments in string theory, to precision tests of general relativity including progress towards the detection of gravitational waves, and from supernova cosmology to relativistic astrophysics, including topics such as gamma ray bursts, black hole physics both in our galaxy and in active galactic nuclei in other galaxies, and neutron star, pulsar and white dwarf astrophysics. Parallel sessions touch on dark matter, neutrinos, X-ray sources, astrophysical black holes, neutron stars, white dwarfs, binary systems, radiative transfer, accretion disks, quasars, gamma ray bursts, supernovas, alternative gravitational theories, perturbations of collapsed objects, analog models, black hole thermodynamics, numerical relativity, gravitational lensing, large scale structure, observational cosmology, early universe models and cosmic microwave background anisotropies, inhomogeneous cosmology, inflation, global structure, singularities, chaos, Einstein-Maxwell systems, wormholes, exact solutions of Einstein's equations, gravitational waves, gravitational wave detectors and data analysis, precision gravitational measurements, quantum gravity and loop quantum gravity, quantum cosmology, strings and branes, self-gravitating systems, gamma ray astronomy, cosmic rays and the history of general relativity