A O~(n2)\tilde O(n^2) Time-Space Trade-off for Undirected s-t Connectivity

Version 3 makes use of the Metropolis-Hastings walkInternational audienceIn this paper, we make use of the Metropolis-type walks due to Nonaka et al. (2010) to provide a faster solution to the $S$-$T$-connectivity problem in undirected graphs (USTCON). As our main result, we propose a family of randomized algorithms for USTCON which achieves a time-space product of $S\cdot T = \tilde O(n^2)$ in graphs with $n$ nodes and $m$ edges (where the $\tilde O$-notation disregards poly-logarithmic terms). This improves the previously best trade-off of $\tilde O(n m)$, due to Feige (1995). Our algorithm consists in deploying several short Metropolis-type walks, starting from landmark nodes distributed using the scheme of Broder et al. (1994) on a modified input graph. In particular, we obtain an algorithm running in time $\tilde O(n+m)$ which is, in general, more space-efficient than both BFS and DFS. We close the paper by showing how to fine-tune the Metropolis-type walk so as to match the performance parameters (e.g., average hitting time) of the unbiased random walk for any graph, while preserving a worst-case bound of $\tilde O(n^2)$ on cover time

Bounds on monotone switching networks for directed connectivity

We separate monotone analogues of L and NL by proving that any monotone switching network solving directed connectivity on $n$ vertices must have size at least $n^(\Omega(\lg(n)))$.Comment: 49 pages, 12 figure

(No) Quantum space-time tradeoff for USTCON

Undirected st-connectivity is important both for its applications in network problems, and for its theoretical connections with logspace complexity. Classically, a long line of work led to a time-space tradeoff of T = Oe(n2/S) for any S such that S = Ω(log(n)) and S = O(n2/m). Surprisingly, we show that quantumly there is no nontrivial time-space tradeoff: there is a quantum algorithm that achieves both optimal time Oe(n) and space O(log(n)) simultaneously. This improves on previous results, which required either O(log(n)) space and Oe(n1.5) time, or Oe(n) space and time. To complement this, we show that there is a nontrivial time-space tradeoff when given a lower bound on the spectral gap of a corresponding random walk

LIPIcs, Volume 274, ESA 2023, Complete Volume

LIPIcs, Volume 274, ESA 2023, Complete Volum

ONJAG, network overlays supporting distributed graph processing

The "Big Data" term refers to the exponential growth that is affecting the production of structured and unstructured data. However, due to the size characterising this data, usually deep analyses are required in order to extract its intrinsic value. Several computational models and various techniques have been studied and employed in order to process this data in a distribute manner, i.e. the capabilities of a single machine can not carry out the computation of this data. Today, a significant part of such data is modelled as a graph. Recently, graph processing frameworks orchestrate the execution as a network simulation where vertices and edges correspond to nodes and links, respectively. In this context the thesis exploits the Peer-to-Peer approach. The overlay concept is introduced and ONJAG ("Overlays Not Just A Graph"), a distributed framework, is developed. ONJAG runs over Spark, a distributed Bulk Synchronous Parallel-like data processing framework. Moreover, a well-known problem in graph theory has studied. It is the balanced minimum k-way partitioning problem, which is also called minimum k-way cut. Finally, a novel algorithm to solve the balanced minimum k-way cut is proposed. The proposal exploits the P2P approach and the overlays in order to improve a pre-existent solution

Gene regulatory networks involved in drought stress responses: identification, genetic control and variability in cultivated sunflower, Helianthus annuus and its relatives

La sécheresse affecte le rendement des plantes de grande culture comme le tournesol. Ces plantes développent des réponses morpho-physiologiques pour améliorer leur tolérance au manque d'eau. De nombreux gènes formant un réseau de régulation (GRN) contribuent à un contrôle génétique complexe de ces réponses. Le travail présenté étudie ce réseau, ses différents gènes et leurs interactions chez le tournesol. Tout d'abord, nous avons mis en évidence trois gènes récepteurs du signal environnemental afin de construire un biomarqueur du statut hydrique. Puis, par une étude d'association, nous avons reconstruit le GRN reliant les gènes de réponse au stress et déchiffré leur contrôle génétique. Enfin, par une approche de biologie des systèmes, nous avons inféré le GRN groupant des gènes de régulation et de réponse. Cette étude nous a permis d'identifier des mécanismes majeurs de tolérance à la sécheresse chez le tournesol, ainsi que le rôle de ce réseau dans l'évolution du genre Heliantus.Drought is a major stress that affects growth, physiology and therefore yield of crops as sunflower. To become more tolerant, plants develop complex morpho-physiological responses. Various genes interacting between them and with the environment are involved in the genetic control of those responses. They form together a gene regulatory network (GRN). Here, we focused on these drought GRN, its different gene groups and their interactions in the cultivated sunflower. First, we highlighted three genes reflecting the environmental signal. From their expression we built a plant water status biomarker. Then through an association study, we built the GRN connecting drought responsive genes and we deciphered their genetic control. Finally, thanks to a systems biology approach we inferred the GRN linking regulatory and drought responsive genes. Studying this network, we examined how it could drive phenotypic changes and how it was related to Heliantus evolution and sunflower breeding

The 'War on Terror' metaframe in film and television

Following the terrorist attacks of September 11th, 2001, the government of the United States of America declared a ‘War on Terror’. This was targeted not only at the ostensible culprits – al-Qaeda - but at ‘terror’ itself. The ‘War on Terror’ acted as a rhetorical ‘metaframe’, which was sufficiently flexible to incorporate a broad array of nominally-related policies, events, phenomena and declarations, from the Iraq war to issues of immigration. The War on Terror is strategically limitless, and therefore incorporates not only actual wars, but potential wars. For example, the bellicose rhetoric towards those countries labelled the ‘Axis of Evil’ or ‘Outposts of Tyranny’ is as much a manifestation of the metaframe as the ‘Shock and Awe’ bombing of Baghdad. As a rhetorical frame, it is created through all of its utterances; its narrative may have been initially scripted by the Bush administration, but it is reified and naturalised by the news media and other commentators, who adopt the frame’s language even when critical of its content. Moreover, film and television texts participate in this process, with fiction-based War on Terror narratives sharing and supporting – co-constituting – the War on Terror discourse’s ‘reality’. This thesis argues that the War on Terror metaframe manifests itself in multiple interconnected narrative forms, and these forms both transcode and affect its politics. I propose a congruency between the frame’s expansiveness and its associational interconnections, and a corresponding cinematic plot-structure I term the Global Network Narrative. Elsewhere, an emphasis on the pressures of clock-time is evoked by the real-time sequential-series 24, while the authenticity and authority implied by the embedded ‘witness’ is shown to be codified and performed in multiple film and television fiction texts. Throughout, additional contextual influences – social, historical, and technological – are introduced where appropriate, so as not to adopt the metaframe’s claims of limitlessness and uniqueness, while efforts are made to address film and television not as mutually exclusive areas of study, but as suggestively responsive to one another

Electric Vehicle Efficient Power and Propulsion Systems

Vehicle electrification has been identified as one of the main technology trends in this second decade of the 21st century. Nearly 10% of global car sales in 2021 were electric, and this figure would be 50% by 2030 to reduce the oil import dependency and transport emissions in line with countries’ climate goals. This book addresses the efficient power and propulsion systems which cover essential topics for research and development on EVs, HEVs and fuel cell electric vehicles (FCEV), including: Energy storage systems (battery, fuel cell, supercapacitors, and their hybrid systems); Power electronics devices and converters; Electric machine drive control, optimization, and design; Energy system advanced management methods Primarily intended for professionals and advanced students who are working on EV/HEV/FCEV power and propulsion systems, this edited book surveys state of the art novel control/optimization techniques for different components, as well as for vehicle as a whole system. New readers may also find valuable information on the structure and methodologies in such an interdisciplinary field. Contributed by experienced authors from different research laboratory around the world, these 11 chapters provide balanced materials from theorical background to methodologies and practical implementation to deal with various issues of this challenging technology. This reprint encourages researchers working in this field to stay actualized on the latest developments on electric vehicle efficient power and propulsion systems, for road and rail, both manned and unmanned vehicles