Ballistic effects in a proximity induced superconducting diffusive metal

Using a Scanning Tunneling Microscope (STM), we investigate the Local Density of States (LDOS) of artificially fabricated normal metal nano-structures in contact with a superconductor. Very low temperature local spectroscopic measurements (100 mK) reveal the presence of well defined subgap peaks at energy |E|<Delta in the LDOS at various positions of the STM tip. Although no clear correlations between the LDOS and the shape of the samples have emerged, some of the peak features suggest they originate from quasi-particle bound states within the normal metal structures (De Gennes St James states). Refocusing of electronic trajectories induced by the granular srtucture of the samples can explain the observation of spatially uncorrelated interference effects in a non-ballistic medium.Comment: 4 pages, 4 figure

Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems

The reoptimization issue studied in this paper can be described as follows: given an instance I of some problem Π, an optimal solution OPT for Π in I and an instance I′ resulting from a local perturbation of I that consists of insertions or removals of a small number of data, we wish to use OPT in order to solve Π in I', either optimally or by guaranteeing an approximation ratio better than that guaranteed by an ex nihilo computation and with running time better than that needed for such a computation. We use this setting in order to study weighted versions of several representatives of a broad class of problems known in the literature as maximum induced hereditary subgraph problems. The main problems studied are max independent set, max k-colorable subgraph and max split subgraph under vertex insertions and deletion

A Survey on Approximation Mechanism Design without Money for Facility Games

In a facility game one or more facilities are placed in a metric space to serve a set of selfish agents whose addresses are their private information. In a classical facility game, each agent wants to be as close to a facility as possible, and the cost of an agent can be defined as the distance between her location and the closest facility. In an obnoxious facility game, each agent wants to be far away from all facilities, and her utility is the distance from her location to the facility set. The objective of each agent is to minimize her cost or maximize her utility. An agent may lie if, by doing so, more benefit can be obtained. We are interested in social choice mechanisms that do not utilize payments. The game designer aims at a mechanism that is strategy-proof, in the sense that any agent cannot benefit by misreporting her address, or, even better, group strategy-proof, in the sense that any coalition of agents cannot all benefit by lying. Meanwhile, it is desirable to have the mechanism to be approximately optimal with respect to a chosen objective function. Several models for such approximation mechanism design without money for facility games have been proposed. In this paper we briefly review these models and related results for both deterministic and randomized mechanisms, and meanwhile we present a general framework for approximation mechanism design without money for facility games

LP-based Covering Games with Low Price of Anarchy

We present a new class of vertex cover and set cover games. The price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimization problems for linear and also for submodular costs -- in contrast to all previously studied covering games, where the price of anarchy cannot be bounded by a constant (e.g. [6, 7, 11, 5, 2]). In particular, we describe a vertex cover game with a price of anarchy of 2. The rules of the games capture the structure of the linear programming relaxations of the underlying optimization problems, and our bounds are established by analyzing these relaxations. Furthermore, for linear costs we exhibit linear time best response dynamics that converge to these almost optimal Nash equilibria. These dynamics mimic the classical greedy approximation algorithm of Bar-Yehuda and Even [3]

A photon calorimeter using lead tungstate crystals for the CEBAF Hall A Compton polarimeter

The performances of the calorimeter of the Jlab Hall A Compton Polarimeter have been measured using the Mainz tagged photon beam.Comment: 13 page

Self-stabilizing algorithms for Connected Vertex Cover and Clique decomposition problems

In many wireless networks, there is no fixed physical backbone nor centralized network management. The nodes of such a network have to self-organize in order to maintain a virtual backbone used to route messages. Moreover, any node of the network can be a priori at the origin of a malicious attack. Thus, in one hand the backbone must be fault-tolerant and in other hand it can be useful to monitor all network communications to identify an attack as soon as possible. We are interested in the minimum \emph{Connected Vertex Cover} problem, a generalization of the classical minimum Vertex Cover problem, which allows to obtain a connected backbone. Recently, Delbot et al.~\cite{DelbotLP13} proposed a new centralized algorithm with a constant approximation ratio of $2$ for this problem. In this paper, we propose a distributed and self-stabilizing version of their algorithm with the same approximation guarantee. To the best knowledge of the authors, it is the first distributed and fault-tolerant algorithm for this problem. The approach followed to solve the considered problem is based on the construction of a connected minimal clique partition. Therefore, we also design the first distributed self-stabilizing algorithm for this problem, which is of independent interest

Anisotropic behaviour of human gallbladder walls

Inverse estimation of biomechanical parameters of soft tissues from non-invasive measurements has clinical significance in patient-specific modelling and disease diagnosis. In this paper, we propose a fully nonlinear approach to estimate the mechanical properties of the human gallbladder wall muscles from in vivo ultrasound images. The iteration method consists of a forward approach, in which the constitutive equation is based on a modified Hozapfel–Gasser–Ogden law initially developed for arteries. Five constitutive parameters describing the two orthogonal families of fibres and the matrix material are determined by comparing the computed displacements with medical images. The optimisation process is carried out using the MATLAB toolbox, a Python code, and the ABAQUS solver. The proposed method is validated with published artery data and subsequently applied to ten human gallbladder samples. Results show that the human gallbladder wall is anisotropic during the passive refilling phase, and that the peak stress is 1.6 times greater than that calculated using linear mechanics. This discrepancy arises because the wall thickness reduces by 1.6 times during the deformation, which is not predicted by conventional linear elasticity. If the change of wall thickness is accounted for, then the linear model can used to predict the gallbladder stress and its correlation with pain. This work provides further understanding of the nonlinear characteristics of human gallbladder

On cycle transversals and their connected variants in the absence of a small linear forest.

A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity results for the two classical cycle transversal problems Feedback Vertex Set and Odd Cycle Transversal by showing that they can be solved in polynomial time for (sP1+P3) -free graphs for every integer s≥1 . We show the same result for the variants Connected Feedback Vertex Set and Connected Odd Cycle Transversal. For the latter two problems we also prove that they are polynomial-time solvable for cographs; this was known already for Feedback Vertex Set and Odd Cycle Transversal