Budget Feasible Mechanisms for Experimental Design

In the classical experimental design setting, an experimenter E has access to a population of $n$ potential experiment subjects $i\in \{1,...,n\}$, each associated with a vector of features $x_i\in R^d$. Conducting an experiment with subject $i$ reveals an unknown value $y_i\in R$ to E. E typically assumes some hypothetical relationship between $x_i$'s and $y_i$'s, e.g., $y_i \approx \beta x_i$, and estimates $\beta$ from experiments, e.g., through linear regression. As a proxy for various practical constraints, E may select only a subset of subjects on which to conduct the experiment. We initiate the study of budgeted mechanisms for experimental design. In this setting, E has a budget $B$. Each subject $i$ declares an associated cost $c_i >0$ to be part of the experiment, and must be paid at least her cost. In particular, the Experimental Design Problem (EDP) is to find a set $S$ of subjects for the experiment that maximizes V(S) = \log\det(I_d+\sum_{i\in S}x_i\T{x_i}) under the constraint $\sum_{i\in S}c_i\leq B$; our objective function corresponds to the information gain in parameter $\beta$ that is learned through linear regression methods, and is related to the so-called $D$-optimality criterion. Further, the subjects are strategic and may lie about their costs. We present a deterministic, polynomial time, budget feasible mechanism scheme, that is approximately truthful and yields a constant factor approximation to EDP. In particular, for any small $\delta > 0$ and $\epsilon > 0$, we can construct a (12.98, $\epsilon$)-approximate mechanism that is $\delta$-truthful and runs in polynomial time in both $n$ and $\log\log\frac{B}{\epsilon\delta}$. We also establish that no truthful, budget-feasible algorithms is possible within a factor 2 approximation, and show how to generalize our approach to a wide class of learning problems, beyond linear regression

Quantum Detection with Unknown States

We address the problem of distinguishing among a finite collection of quantum states, when the states are not entirely known. For completely specified states, necessary and sufficient conditions on a quantum measurement minimizing the probability of a detection error have been derived. In this work, we assume that each of the states in our collection is a mixture of a known state and an unknown state. We investigate two criteria for optimality. The first is minimization of the worst-case probability of a detection error. For the second we assume a probability distribution on the unknown states, and minimize of the expected probability of a detection error. We find that under both criteria, the optimal detectors are equivalent to the optimal detectors of an ``effective ensemble''. In the worst-case, the effective ensemble is comprised of the known states with altered prior probabilities, and in the average case it is made up of altered states with the original prior probabilities.Comment: Refereed version. Improved numerical examples and figures. A few typos fixe

Energy Harvesting from the Beating Heart by a Mass Imbalance Oscillation Generator

Energy-harvesting devices attract wide interest as power supplies of today's medical implants. Their long lifetime will spare patients from repeated surgical interventions. They also offer the opportunity to further miniaturize existing implants such as pacemakers, defibrillators or recorders of bio signals. A mass imbalance oscillation generator, which consists of a clockwork from a commercially available automatic wrist watch, was used as energy harvesting device to convert the kinetic energy from the cardiac wall motion to electrical energy. An MRI-based motion analysis of the left ventricle revealed basal regions to be energetically most favorable for the rotating unbalance of our harvester. A mathematical model was developed as a tool for optimizing the device's configuration. The model was validated by an in vitro experiment where an arm robot accelerated the harvesting device by reproducing the cardiac motion. Furthermore, in an in vivo experiment, the device was affixed onto a sheep heart for 1h. The generated power in both experiments—in vitro (30μW) and in vivo (16.7μW)—is sufficient to power modern pacemaker

Optimal quantum detectors for unambiguous detection of mixed states

We consider the problem of designing an optimal quantum detector that distinguishes unambiguously between a collection of mixed quantum states. Using arguments of duality in vector space optimization, we derive necessary and sufficient conditions for an optimal measurement that maximizes the probability of correct detection. We show that the previous optimal measurements that were derived for certain special cases satisfy these optimality conditions. We then consider state sets with strong symmetry properties, and show that the optimal measurement operators for distinguishing between these states share the same symmetries, and can be computed very efficiently by solving a reduced size semidefinite program.Comment: Submitted to Phys. Rev.

Living in times of war: waste of c. 1600 from two garderobe chutes from the Castle of Middelburg-in-Flanders (Belgium)

The material remains and environmental data recovered during a rescue excavation in 2002-03 in the castle of the new town of Middelburg-in-Flanders throw light on the site, region and landscape in wartime. The paper discusses the historical context at the turn of the 16th century, the excavation of the castle, the taphonomy of the chutes, the analysis of the artefacts and ecological data recovered from two garderobe chutes in the upper court, and concludes with a synthesis focussing on the interpretation of the excavated record in the historically attested natural and socio-economic disruption caused by the Spanish-Dutch War

The sequence of the 5.8 S ribosomal RNA of the crustacean <i>Artemia salina</i>. With a proposal for a general secondary structure model for 5.8 S ribosomal RNA

We report the primary structure of 5.8 S rRNA from the crustacean Artemia salina. The preparation shows length heterogeneity at the 5′-terminus, but consists of uninterrupted RNA chains, in contrast to some insect 5.8 S rRNAs, which consist of two chains of unequal length separated in the gene by a short spacer. The sequence was aligned with those of 11 other 5.8 S rRNAs and a general secondary structure model derived. It has four helical regions in common with the model of Nazar et al. (J. Biol. Chem. 250, 8591–8597 (1975)), but for a fifth helix a different base pairing scheme was found preferable, and the terminal sequences are presumed to bind to 28 S rRNA instead of binding to each other. In the case of yeast, where both the 5.8 S and 26 S rRNA sequences are known, the existence of five helices in 5.8 S rRNA is shown to be compatible with a 5.8 S - 26 S rRNA interaction model

Optimal Unravellings for Feedback Control in Linear Quantum Systems

For quantum systems with linear dynamics in phase space much of classical feedback control theory applies. However, there are some questions that are sensible only for the quantum case, such as: given a fixed interaction between the system and the environment what is the optimal measurement on the environment for a particular control problem? We show that for a broad class of optimal (state-based) control problems (the stationary Linear-Quadratic-Gaussian class), this question is a semi-definite program. Moreover, the answer also applies to Markovian (current-based) feedback.Comment: 5 pages. Version published by Phys. Rev. Let

Compact Ring for the ThomX-ray Source

THPE060International audienceOne advantage of X-ray sources based on Compton Back Scattering (CBS) processes is that such compact machines can produce an intense flux of monochromatic X-rays. CBS results from collisions between laser pulses and relativistic electron bunches. Aiming at high X-ray flux, one possible configuration combining a low emittance linear accelerator with a compact storage ring and a high gain laser cavity has been adopted by the ThomX project. We present here the main ring lattice characteristics in terms of baseline optics, possible other tunings such as low or negative momentum compaction, and orbit correction schemes. In addition, non-linear beam dynamics aspects including fringe field components as well as higher multipole tolerances are presented

Vertex importance extension of betweenness centrality algorithm

Variety of real-life structures can be simplified by a graph. Such simplification emphasizes the structure represented by vertices connected via edges. A common method for the analysis of the vertices importance in a network is betweenness centrality. The centrality is computed using the information about the shortest paths that exist in a graph. This approach puts the importance on the edges that connect the vertices. However, not all vertices are equal. Some of them might be more important than others or have more significant influence on the behavior of the network. Therefore, we introduce the modification of the betweenness centrality algorithm that takes into account the vertex importance. This approach allows the further refinement of the betweenness centrality score to fulfill the needs of the network better. We show this idea on an example of the real traffic network. We test the performance of the algorithm on the traffic network data from the city of Bratislava, Slovakia to prove that the inclusion of the modification does not hinder the original algorithm much. We also provide a visualization of the traffic network of the city of Ostrava, the Czech Republic to show the effect of the vertex importance adjustment. The algorithm was parallelized by MPI (http://www.mpi-forum.org/) and was tested on the supercomputer Salomon (https://docs.it4i.cz/) at IT4Innovations National Supercomputing Center, the Czech Republic.808726