179 research outputs found
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on
graphs. The algorithm is completely deterministic, though it tries to imitate
(and enhance) a random algorithm by keeping the accumulated rounding errors as
small as possible.
Our new algorithm surprisingly closely approximates the idealized process
(where the tokens are divisible) on important network topologies. On
d-dimensional torus graphs with n nodes it deviates from the idealized process
only by an additive constant. In contrast to that, the randomized rounding
approach of Friedrich and Sauerwald (2009) can deviate up to Omega(polylog(n))
and the deterministic algorithm of Rabani, Sinclair and Wanka (1998) has a
deviation of Omega(n^{1/d}). This makes our quasirandom algorithm the first
known algorithm for this setting which is optimal both in time and achieved
smoothness. We further show that also on the hypercube our algorithm has a
smaller deviation from the idealized process than the previous algorithms.Comment: 25 page
Proxy advisors and shareholder dissent. A cross-country comparative study
Proxy advisors are information intermediaries that enable shareholders to exercise their voting rights. While proxy advisorsâ influence is documented in market-based corporate governance systems, we know little about the corporate governance role of proxy advice in relationship-based governance systems. Drawing on agency theory and the comparative corporate governance literature, we theorize that shareholders are sensitive to the costs and benefits of monitoring by considering internal monitoring capabilities. We also theorize that relative to market-based corporate governance systems, proxy advice is both less influential and has lower predictive quality in relationship-based governance systems. We test our multilevel model using 13,497 voting results from 613 firms in 16 Western European countries and generally find support for our predictions
How asynchrony affects rumor spreading time
International audienceIn standard randomized (push-pull) rumor spreading, nodes communicate in synchronized rounds. In each round every node contacts a random neighbor in order to exchange the rumor (i.e., either push the rumor to its neighbor or pull it from the neighbor). A natural asynchronous variant of this algorithm is one where each node has an independent Poisson clock with rate 1, and every node contacts a random neighbor whenever its clock ticks. This asynchronous variant is arguably a more realistic model in various settings, including message broadcasting in communication networks, and information dissemination in social networks. In this paper we study how asynchrony affects the rumor spreading time, that is, the time before a rumor originated at a single node spreads to all nodes in the graph. Our first result states that the asynchronous push-pull rumor spreading time is asymptotically bounded by the standard synchronous time. Precisely, we show that for any graph G on n nodes, where the synchronous push-pull protocol informs all nodes within T (G) rounds with high probability, the asynchronous protocol needs at most time O(T (G) + log n) to inform all nodes with high probability. On the other hand, we show that the expected synchronous push-pull rumor spreading time is bounded by O(â n) times the expected asynchronous time. These results improve upon the bounds for both directions shown recently by Acan et al. (PODC 2015). An interesting implication of our first result is that in regular graphs, the weaker push-only variant of synchronous rumor spreading has the same asymptotic performance as the synchronous push-pull algorithm
Does State Ownership Hurt or Help Minority Shareholders?
We argue that state ownership is a crucial policy instrument for alleviating what is perhaps the
most important principal-principal (PP) agency problem around the globe: private benefits of
control (PBC). Our results illustrate that states reduce PBC in the companies in which they
acquire controlling ownership positions. We also examine how legal and political institutions
influence the extent to which states accomplish this goal. Anti-self-dealing legal regulations
make states more effective in their efforts to constrain PBC, while political constraints make
them less effective. Regimes with high state capacity appear not to prioritize PBC reduction. We
test and corroborate these ideas in a sample of 1,354 control transactions across 54 countries
HIT'nDRIVE: patient-specific multidriver gene prioritization for precision oncology.
Prioritizing molecular alterations that act as drivers of cancer remains a crucial bottleneck in therapeutic development. Here we introduce HIT'nDRIVE, a computational method that integrates genomic and transcriptomic data to identify a set of patient-specific, sequence-altered genes, with sufficient collective influence over dysregulated transcripts. HIT'nDRIVE aims to solve the "random walk facility location" (RWFL) problem in a gene (or protein) interaction network, which differs from the standard facility location problem by its use of an alternative distance measure: "multihitting time," the expected length of the shortest random walk from any one of the set of sequence-altered genes to an expression-altered target gene. When applied to 2200 tumors from four major cancer types, HIT'nDRIVE revealed many potentially clinically actionable driver genes. We also demonstrated that it is possible to perform accurate phenotype prediction for tumor samples by only using HIT'nDRIVE-seeded driver gene modules from gene interaction networks. In addition, we identified a number of breast cancer subtype-specific driver modules that are associated with patients' survival outcome. Furthermore, HIT'nDRIVE, when applied to a large panel of pan-cancer cell lines, accurately predicted drug efficacy using the driver genes and their seeded gene modules. Overall, HIT'nDRIVE may help clinicians contextualize massive multiomics data in therapeutic decision making, enabling widespread implementation of precision oncology
Imaging of the Inner Zone of Blast Furnaces Using MuonRadiography: The BLEMAB Project
The aim of the BLEMAB project (BLast furnace stack density Estimation through online Muons ABsorption measurements) is the application of muon radiography techniques, to image a blast furnaceâs inner zone. In particular, the goal of the study is to characterize the geometry and size of the so-called âcohesive zoneâ, i.e., the spatial region where the slowly downward-moving material begins to soften and melt, which plays such an important role in the performance of the blast furnace itself. Thanks to the high penetration power of natural cosmic-ray muon radiation, muon transmission radiography could be an appropriate non invasive methodology for the imaging of large high-density structures such as a blast furnace, whose linear dimensions can be up to a few tens of meters. A state-of-the-art muon tracking system is currently in development and will be installed at a blast furnace on the ArcelorMittal site in Bremen (Germany), where it will collect data for a period of various months. In this paper, the status of the project and the
expectations based on preliminary simulations are presented and briefly discussed
Biosynthesis of Selenocysteine on Its tRNA in Eukaryotes
Selenocysteine (Sec) is cotranslationally inserted into protein in response to UGA codons and is the 21st amino acid in the genetic code. However, the means by which Sec is synthesized in eukaryotes is not known. Herein, comparative genomics and experimental analyses revealed that the mammalian Sec synthase (SecS) is the previously identified pyridoxal phosphate-containing protein known as the soluble liver antigen. SecS required selenophosphate and O-phosphoseryl-tRNA([Ser]Sec) as substrates to generate selenocysteyl-tRNA([Ser]Sec). Moreover, it was found that Sec was synthesized on the tRNA scaffold from selenide, ATP, and serine using tRNA([Ser]Sec), seryl-tRNA synthetase, O-phosphoseryl-tRNA([Ser]Sec) kinase, selenophosphate synthetase, and SecS. By identifying the pathway of Sec biosynthesis in mammals, this study not only functionally characterized SecS but also assigned the function of the O-phosphoseryl-tRNA([Ser]Sec) kinase. In addition, we found that selenophosphate synthetase 2 could synthesize monoselenophosphate in vitro but selenophosphate synthetase 1 could not. Conservation of the overall pathway of Sec biosynthesis suggests that this pathway is also active in other eukaryotes and archaea that synthesize selenoproteins
Proof-of-concept modular robot platform for cauliflower harvesting
This paper presents a proof-of-concept platform for demonstrating robotic harvesting of summer-varieties of cauliflower, and early tests performed under laboratory conditions. The platform is designed to be modular and has two dexterous robotic arms with variable-stiffness technology. The bi-manual configuration enables the separation of grasping and cutting behaviours into separate robot manipulators. By exploiting the passive compliance of the variable-stiffness arms, the system can operate with both grasping and cutting tool close to the ground. Multiple 3D vision cameras are used to track the cauliflowers in real-time, and to attempt to assess the maturity. Early experiments with the platform in the laboratory highlight the potential and challenges of the platform
The BLEMAB European project: Muon radiography as an imaging tool in the industrial field
The European project called BLEMAB (BLast furnace stack density Estimation through on-line Muons ABsorption measurements), provides for the application of the muon radiography technique in the industrial environment. The project represents a non-invasive way of monitoring a blast furnace and in particular aims to study the geometric and density development of the so-called âcohesive zoneâ, which is important for the performance of the blast furnace itself. The installation of the detectors is expected in 2022 at the ArcelorMittal site in Bremen (Germany). This paper describes the status of the project, the experimental setup and the first results obtained with preliminary simulations. © 2022 Societa Italiana di Fisica. All rights reserved
Ancient horizontal gene transfer and the last common ancestors
Background
The genomic history of prokaryotic organismal lineages is marked by extensive horizontal gene transfer (HGT) between groups of organisms at all taxonomic levels. These HGT events have played an essential role in the origin and distribution of biological innovations. Analyses of ancient gene families show that HGT existed in the distant past, even at the time of the organismal last universal common ancestor (LUCA). Most gene transfers originated in lineages that have since gone extinct. Therefore, one cannot assume that the last common ancestors of each gene were all present in the same cell representing the cellular ancestor of all extant life.
Results
Organisms existing as part of a diverse ecosystem at the time of LUCA likely shared genetic material between lineages. If these other lineages persisted for some time, HGT with the descendants of LUCA could have continued into the bacterial and archaeal lineages. Phylogenetic analyses of aminoacyl-tRNA synthetase protein families support the hypothesis that the molecular common ancestors of the most ancient gene families did not all coincide in space and time. This is most apparent in the evolutionary histories of seryl-tRNA synthetase and threonyl-tRNA synthetase protein families, each containing highly divergent ârareâ forms, as well as the sparse phylogenetic distributions of pyrrolysyl-tRNA synthetase, and the bacterial heterodimeric form of glycyl-tRNA synthetase. These topologies and phyletic distributions are consistent with horizontal transfers from ancient, likely extinct branches of the tree of life.
Conclusions
Of all the organisms that may have existed at the time of LUCA, by definition only one lineage is survived by known progeny; however, this lineage retains a genomic record of heterogeneous genetic origins. The evolutionary histories of aminoacyl-tRNA synthetases (aaRS) are especially informative in detecting this signal, as they perform primordial biological functions, have undergone several ancient HGT events, and contain many sites with low substitution rates allowing deep phylogenetic reconstruction. We conclude that some aaRS families contain groups that diverge before LUCA. We propose that these ancient gene variants be described by the term âhypnologsâ, reflecting their ancient, reticulate origin from a time in life history that has been all but erasedâ.National Science Foundation (U.S.) (Grant DEB 0830024)Exobiology Program (U.S.) (Grant NNX10AR85G)United States. National Aeronautics and Space Administration (Postdoctoral Program
- âŠ