2,291 research outputs found
Linear Time Distributed Swap Edge Algorithms
In this paper, we consider the all best swap edges problem in
a distributed environment. We are given a 2-edge connected positively weighted network X, where all communication is routed through a rooted spanning tree T of X. If one tree edge e = {x, y} fails, the communication network will be disconnected. However, since X is 2-edge connected,
communication can be restored by replacing e by non-tree edge e′, called a swap edge of e, whose ends lie in different components of T − e. Of all possible swap edges of e, we would like to choose the best, as defined by the application. The all best swap edges problem is to identify the
best swap edge for every tree edge, so that in case of any edge failure, the best swap edge can be activated quickly. There are solutions to this problem for a number of cases in the literature. A major concern for all these solutions is to minimize the number of messages. However, especially in fault-transient environments, time is a crucial factor. In this
paper we present a novel technique that addresses this problem from a time perspective; in fact, we present a distributed solution that works in linear time with respect to the height h of T for a number of differentcriteria, while retaining the optimal number of messages. To the best of
our knowledge, all previous solutions solve the problem in O(h^2) time in the cases we consider
New molecular tool for a quick and easy detection of apple scab in the field
Venturia inaequalis, an agent of apple scab, is the most important pathogen of Malus x domestica. Control measures against this pathogen rely on intensive phytosanitary programs based on predictive models to identify the meteorological conditions conducive to the primary infection. The detection of the pathogen in field, both in naturally infected symptomatic and asymptomatic leaves, is desirable. Loop-mediated isothermal amplification (LAMP) assays are profitable molecular diagnostic tools for the direct detection of pathogens in field. A LAMP assay for V. inaequalis has been designed on the elongation factor 1-alpha sequence. The validation of the LAMP assay was carried out following the international EPPO standard PM 7/98 in terms of specificity, sensitivity, repeatability and reproducibility. Specificity testing was performed using target and non-target species, such as phylogenetically related Venturia species and other pathogens commonly found in apple, resulting in positive amplification only for the target with a time to positive ranging from 20 to 30 min. Sensitivity testing was performed with serial dilutions of DNA of the target and by artificial inoculation of young apple leaves. The reliability of the LAMP assay as an early-detection tool and its user-friendly application make it suitable for the diagnosis of apple scab in the field
Forward precision medicine: Micelles for active targeting driven by peptides
Precision medicine is based on innovative administration methods of active principles. Drug delivery on tissue of interest allows improving the therapeutic index and reducing the side effects. Active targeting by means of drug-encapsulated micelles decorated with targeting bioactive moieties represents a new frontier. Between the bioactive moieties, peptides, for their versatility, easy synthesis and immunogenicity, can be selected to direct a drug toward a considerable number of molecular targets overexpressed on both cancer vasculature and cancer cells. Moreover, short peptide sequences can facilitate cellular intake. This review focuses on micelles achieved by self-assembling or mixing peptide-grafted surfactants or peptide-decorated amphiphilic copolymers. Nanovectors loaded with hydrophobic or hydrophilic cytotoxic drugs or with gene silence sequences and externally functionalized with natural or synthetic peptides are described based on their formulation and in vitro and in vivo behaviors
Rendezvous of Two Robots with Constant Memory
We study the impact that persistent memory has on the classical rendezvous
problem of two mobile computational entities, called robots, in the plane. It
is well known that, without additional assumptions, rendezvous is impossible if
the entities are oblivious (i.e., have no persistent memory) even if the system
is semi-synchronous (SSynch). It has been recently shown that rendezvous is
possible even if the system is asynchronous (ASynch) if each robot is endowed
with O(1) bits of persistent memory, can transmit O(1) bits in each cycle, and
can remember (i.e., can persistently store) the last received transmission.
This setting is overly powerful.
In this paper we weaken that setting in two different ways: (1) by
maintaining the O(1) bits of persistent memory but removing the communication
capabilities; and (2) by maintaining the O(1) transmission capability and the
ability to remember the last received transmission, but removing the ability of
an agent to remember its previous activities. We call the former setting
finite-state (FState) and the latter finite-communication (FComm). Note that,
even though its use is very different, in both settings, the amount of
persistent memory of a robot is constant.
We investigate the rendezvous problem in these two weaker settings. We model
both settings as a system of robots endowed with visible lights: in FState, a
robot can only see its own light, while in FComm a robot can only see the other
robot's light. We prove, among other things, that finite-state robots can
rendezvous in SSynch, and that finite-communication robots are able to
rendezvous even in ASynch. All proofs are constructive: in each setting, we
present a protocol that allows the two robots to rendezvous in finite time.Comment: 18 pages, 3 figure
- …