General Fast Sampling Theorems for Nonlinear Systems

This paper is concerned with the gap metric approach to controller discretisation problems for continuous-time nonlinear systems with disturbances in both input and output channels. The principal idea is to construct a discrete controller based on a given stabilizing continuous time controller via a fast sampling and hold procedure and to calculate the gap between the two controllers. It is expected that, under general conditions, the computed gap depends on the discrete sample size and the faster the sample rate, the smaller the gap and, therefore, existing gap metric robust stability theorems can be applied to obtain both stability and performance results for the appropriately discretised controller. This is shown for the case of memoryless controllers and for a more general class of controllers specified by stable, causal operators. In both cases, both regional and global results are obtained under respective local and global incremental stability assumptions on the controllers

Greedy MAXCUT Algorithms and their Information Content

MAXCUT defines a classical NP-hard problem for graph partitioning and it serves as a typical case of the symmetric non-monotone Unconstrained Submodular Maximization (USM) problem. Applications of MAXCUT are abundant in machine learning, computer vision and statistical physics. Greedy algorithms to approximately solve MAXCUT rely on greedy vertex labelling or on an edge contraction strategy. These algorithms have been studied by measuring their approximation ratios in the worst case setting but very little is known to characterize their robustness to noise contaminations of the input data in the average case. Adapting the framework of Approximation Set Coding, we present a method to exactly measure the cardinality of the algorithmic approximation sets of five greedy MAXCUT algorithms. Their information contents are explored for graph instances generated by two different noise models: the edge reversal model and Gaussian edge weights model. The results provide insights into the robustness of different greedy heuristics and techniques for MAXCUT, which can be used for algorithm design of general USM problems.Comment: This is a longer version of the paper published in 2015 IEEE Information Theory Workshop (ITW

Exotic Superconducting Properties in Topological Nodal Semimetal PbTaSe2_2

We report the electronic properties of superconductivity in the topological nodal-line semimetal PbTaSe$_2$. Angle-resolved photoemission measurements accompanied by band calculations confirmed the nodal-line band structure in the normal state of single crystalline PbTaSe$_2$. Resistivity, magnetic-susceptibility and specific heat measurements have also been performed on high-quality single crystals. We observed upward features and large anisotropy in upper critical field ($H_{c2}$) measured in-plane (H//\textbf{ab}) and out-plane (H//\textbf{c}), respectively. Especially, $H_{c2}$ measured in H//\textbf{ab} shows sudden upward features rather than a signal of saturation in ultralow temperatures. The specific heat measurements under magnetic field reveal a full superconducting gap with no gapless nodes. These behaviors in this clean noncentrosymmetric superconductor is possibly related to the underlying exotic physics, providing important clue for realization of topological superconductivity.Comment: 6 pages, 5 figures,1 table;Accepted for publication on PR

Probabilistic Timed Automata with Clock-Dependent Probabilities

Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition probabilities can depend linearly on clock values. Clock-dependent probabilistic timed automata allow the modelling of a continuous relationship between time passage and the likelihood of system events. We show that the problem of deciding whether the maximum probability of reaching a certain location is above a threshold is undecidable for clock-dependent probabilistic timed automata. On the other hand, we show that the maximum and minimum probability of reaching a certain location in clock-dependent probabilistic timed automata can be approximated using a region-graph-based approach.Comment: Full version of a paper published at RP 201

The cumulative effects of known susceptibility variants to predict primary biliary cirrhosis risk.

Multiple genetic variants influence the risk for development of primary biliary cirrhosis (PBC). To explore the cumulative effects of known susceptibility loci on risk, we utilized a weighted genetic risk score (wGRS) to evaluate whether genetic information can predict susceptibility. The wGRS was created using 26 known susceptibility loci and investigated in 1840 UK PBC and 5164 controls. Our data indicate that the wGRS was significantly different between PBC and controls (P=1.61E-142). Moreover, we assessed predictive performance of wGRS on disease status by calculating the area under the receiver operator characteristic curve. The area under curve for the purely genetic model was 0.72 and for gender plus genetic model was 0.82, with confidence limits substantially above random predictions. The risk of PBC using logistic regression was estimated after dividing individuals into quartiles. Individuals in the highest disclosed risk group demonstrated a substantially increased risk for PBC compared with the lowest risk group (odds ratio: 9.3, P=1.91E-084). Finally, we validated our findings in an analysis of an Italian PBC cohort. Our data suggested that the wGRS, utilizing genetic variants, was significantly associated with increased risk for PBC with consistent discriminant ability. Our study is a first step toward risk prediction for PBC