664 research outputs found
Multidimensional scaling reveals a color dimension unique to 'color-deficient' observers
Normal color vision depends on the relative rates at which photons are absorbed in three types of retinal cone:short-wave (S), middle-wave (M) and long-wave (L) cones, maximally sensitive near 430, 530 and 560nm, respectively. But 6% of men exhibit an X-linked variant form of color vision called deuteranomaly [1]. Their color vision is thought to depend on S cones and two forms of long-wave cone (L, L′) [2,3]. The two types of L cone contain photopigments that are maximally sensitive near 560nm, but their spectral sensitivities are different enough that the ratio of their activations gives a useful chromatic signal
Revisiting the Problem of Searching on a Line
We revisit the problem of searching for a target at an unknown location on a
line when given upper and lower bounds on the distance D that separates the
initial position of the searcher from the target. Prior to this work, only
asymptotic bounds were known for the optimal competitive ratio achievable by
any search strategy in the worst case. We present the first tight bounds on the
exact optimal competitive ratio achievable, parameterized in terms of the given
bounds on D, along with an optimal search strategy that achieves this
competitive ratio. We prove that this optimal strategy is unique. We
characterize the conditions under which an optimal strategy can be computed
exactly and, when it cannot, we explain how numerical methods can be used
efficiently. In addition, we answer several related open questions, including
the maximal reach problem, and we discuss how to generalize these results to m
rays, for any m >= 2
Parallel Search with no Coordination
We consider a parallel version of a classical Bayesian search problem.
agents are looking for a treasure that is placed in one of the boxes indexed by
according to a known distribution . The aim is to minimize
the expected time until the first agent finds it. Searchers run in parallel
where at each time step each searcher can "peek" into a box. A basic family of
algorithms which are inherently robust is \emph{non-coordinating} algorithms.
Such algorithms act independently at each searcher, differing only by their
probabilistic choices. We are interested in the price incurred by employing
such algorithms when compared with the case of full coordination. We first show
that there exists a non-coordination algorithm, that knowing only the relative
likelihood of boxes according to , has expected running time of at most
, where is the expected running time of the best
fully coordinated algorithm. This result is obtained by applying a refined
version of the main algorithm suggested by Fraigniaud, Korman and Rodeh in
STOC'16, which was designed for the context of linear parallel search.We then
describe an optimal non-coordinating algorithm for the case where the
distribution is known. The running time of this algorithm is difficult to
analyse in general, but we calculate it for several examples. In the case where
is uniform over a finite set of boxes, then the algorithm just checks boxes
uniformly at random among all non-checked boxes and is essentially times
worse than the coordinating algorithm.We also show simple algorithms for Pareto
distributions over boxes. That is, in the case where for
, we suggest the following algorithm: at step choose uniformly
from the boxes unchecked in ,
where . It turns out this algorithm is asymptotically
optimal, and runs about times worse than the case of full coordination
Interplay between friction and spin-orbit coupling as a source of spin polarization
We study an effective one-dimensional quantum model that includes friction
and spin-orbit coupling (SOC), and show that the model exhibits spin
polarization when both terms are finite. Most important, strong spin
polarization can be observed even for moderate SOC, provided that friction is
strong. Our findings might help to explain the pronounced effect of chirality
on spin distribution and transport in chiral molecules. In particular, our
model implies static magnetic properties of a chiral molecule, which lead to
Shiba-like states when a molecule is placed on a superconductor, in accordance
with recent experimental data.Comment: Version accepted for publication in Physical Review
Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
A set of mobile robots is placed at points of an infinite line. The robots
are equipped with GPS devices and they may communicate their positions on the
line to a central authority. The collection contains an unknown subset of
"spies", i.e., byzantine robots, which are indistinguishable from the
non-faulty ones. The set of the non-faulty robots need to rendezvous in the
shortest possible time in order to perform some task, while the byzantine
robots may try to delay their rendezvous for as long as possible. The problem
facing a central authority is to determine trajectories for all robots so as to
minimize the time until the non-faulty robots have rendezvoused. The
trajectories must be determined without knowledge of which robots are faulty.
Our goal is to minimize the competitive ratio between the time required to
achieve the first rendezvous of the non-faulty robots and the time required for
such a rendezvous to occur under the assumption that the faulty robots are
known at the start. We provide a bounded competitive ratio algorithm, where the
central authority is informed only of the set of initial robot positions,
without knowing which ones or how many of them are faulty. When an upper bound
on the number of byzantine robots is known to the central authority, we provide
algorithms with better competitive ratios. In some instances we are able to
show these algorithms are optimal
The change in color matches with retinal angle of incidence of the colorimeter beams
Differences between W.D.W. chromaticities of monochromatic lights obtained with all colorimeter beams incident on the retina "off-axis" and those found for lights striking the retina normally have been studied throughout the visible spectrum on 4 normal trichromats. The results are inconsistent with: 1. (i) the assumption in Weale's theories of the Stiles-Crawford hue shift that the sets of absorption spectra of the visual pigments catching normally and obliquely incident photons are identical, and2. (ii) "self-screening" explanations for the change in color with angle of incidence on the retina. The color matching functions of a protanomalous trichromat are inconsistent with the hypothesis that the absorption spectra of the visual pigments catching normally incident photons in his retina are those catching obliquely incident photons in the normal retina.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/27010/1/0000577.pd
LNCS
We introduce the monitoring of trace properties under assumptions. An assumption limits the space of possible traces that the monitor may encounter. An assumption may result from knowledge about the system that is being monitored, about the environment, or about another, connected monitor. We define monitorability under assumptions and study its theoretical properties. In particular, we show that for every assumption A, the boolean combinations of properties that are safe or co-safe relative to A are monitorable under A. We give several examples and constructions on how an assumption can make a non-monitorable property monitorable, and how an assumption can make a monitorable property monitorable with fewer resources, such as integer registers
NF-κB: A lesson in family values
A set of mobile robots (represented as points) is distributed in the Cartesian plane. The collection contains an unknown subset of byzantine robots which are indistinguishable from the reliable ones. The reliable robots need to gather, i.e., arrive to a configuration in which at the same time, all of them occupy the same point on the plane. The robots are equipped with GPS devices and at the beginning of the gathering process they communicate the Cartesian coordinates of their respective positions to the central authority. On the basis of this information, without the knowledge of which robots are faulty, the central authority designs a trajectory for every robot. The central authority aims to provide the trajectories which result in the shortest possible gathering time of the healthy robots. The efficiency of a gathering strategy is measured by its competitive ratio, i.e., the maximal ratio between the time required for gathering achieved by the given trajectories and the optimal time required for gathering in the offline case, i.e., when the faulty robots are known to the central authority in advance. The role of the byzantine robots, controlled by the adversary, is to act so that the gathering is delayed and the resulting competitive ratio is maximized. The objective of our paper is to propose efficient algorithms when the central authority is aware of an upper bound on the number of byzantine robots. We give optimal algorithms for collections of robots known to contain at most one faulty robot. When the proportion of byzantine robots is known to be less than one half or one third, we provide algorithms with small constant competitive ratios. We also propose algorithms with bounded competitive ratio in the case where the proportion of faulty robots is arbitrary
Unemployment Through Learning from Experience
Digitised version produced by the EUI Library and made available online in 2020
- …