In-medium nucleon-nucleon potentials in configuration space

Based on the thermodynamic Green function approach two-nucleon correlations in nuclear matter at finite temperatures are revisited. To this end, we derive phase equivalent effective $r$-space potentials that include the effect of the Pauli blocking at a given temperature and density. These potentials enter into a Schr\"odinger equation that is the $r$-space representation of the Galitskii-Feynman equation for two nucleons. We explore the analytical structure of the equation in the complex $k$-plane by means of Jost functions. We find that despite the Mott effect the correlation with deuteron quantum numbers are manifested as antibound states, i.e., as zeros of the Jost function on the negative imaginary axis of the complex momentum space. The analysis presented here is also suited for Coulombic systems.Comment: 6 pages, 1 table, 4 figure

Off the Beaten Path: Let's Replace Term-Based Retrieval with k-NN Search

Retrieval pipelines commonly rely on a term-based search to obtain candidate records, which are subsequently re-ranked. Some candidates are missed by this approach, e.g., due to a vocabulary mismatch. We address this issue by replacing the term-based search with a generic k-NN retrieval algorithm, where a similarity function can take into account subtle term associations. While an exact brute-force k-NN search using this similarity function is slow, we demonstrate that an approximate algorithm can be nearly two orders of magnitude faster at the expense of only a small loss in accuracy. A retrieval pipeline using an approximate k-NN search can be more effective and efficient than the term-based pipeline. This opens up new possibilities for designing effective retrieval pipelines. Our software (including data-generating code) and derivative data based on the Stack Overflow collection is available online

IoTSan: Fortifying the Safety of IoT Systems

Today's IoT systems include event-driven smart applications (apps) that interact with sensors and actuators. A problem specific to IoT systems is that buggy apps, unforeseen bad app interactions, or device/communication failures, can cause unsafe and dangerous physical states. Detecting flaws that lead to such states, requires a holistic view of installed apps, component devices, their configurations, and more importantly, how they interact. In this paper, we design IoTSan, a novel practical system that uses model checking as a building block to reveal "interaction-level" flaws by identifying events that can lead the system to unsafe states. In building IoTSan, we design novel techniques tailored to IoT systems, to alleviate the state explosion associated with model checking. IoTSan also automatically translates IoT apps into a format amenable to model checking. Finally, to understand the root cause of a detected vulnerability, we design an attribution mechanism to identify problematic and potentially malicious apps. We evaluate IoTSan on the Samsung SmartThings platform. From 76 manually configured systems, IoTSan detects 147 vulnerabilities. We also evaluate IoTSan with malicious SmartThings apps from a previous effort. IoTSan detects the potential safety violations and also effectively attributes these apps as malicious.Comment: Proc. of the 14th ACM CoNEXT, 201

Thermal Degradation of Adsorbed Bottle-Brush Macromolecules: Molecular Dynamics Simulation

The scission kinetics of bottle-brush molecules in solution and on an adhesive substrate is modeled by means of Molecular Dynamics simulation with Langevin thermostat. Our macromolecules comprise a long flexible polymer backbone with $L$ segments, consisting of breakable bonds, along with two side chains of length $N$, tethered to each segment of the backbone. In agreement with recent experiments and theoretical predictions, we find that bond cleavage is significantly enhanced on a strongly attractive substrate even though the chemical nature of the bonds remains thereby unchanged. We find that the mean bond life time decreases upon adsorption by more than an order of magnitude even for brush molecules with comparatively short side chains $N=1 \div 4$. The distribution of scission probability along the bonds of the backbone is found to be rather sensitive regarding the interplay between length and grafting density of side chains. The life time declines with growing contour length $L$ as $\propto L^{-0.17}$, and with side chain length as $\propto N^{-0.53}$. The probability distribution of fragment lengths at different times agrees well with experimental observations. The variation of the mean length $L(t)$ of the fragments with elapsed time confirms the notion of the thermal degradation process as a first order reaction.Comment: 15 pages, 7 figure

QCD equation of state in a virial expansion

We describe recent three-flavor QCD lattice data for the pressure, speed of soun d and interaction measure at nonzero temperature and vanishing chemical potentia l within a virial expansion. For the deconfined phase we use a phenomenological model which includes non-pert urbative effects from dimension two gluon condensates that reproduce the free en ergy of quenched QCD very well. The hadronic phase is parameterized by a generalized resonance-gas model. Furthermore, we extend this approach to finite quark densities introducing an ex plicit $\mu$-dependence of the interaction. We calculate pressure, quark-number density, entropy and energy density and compare to results of lattice calculatio ns. We, additionally, investigate the structure of the phase diagram by calculating the isobaric and isentropic lines as well as the critical endpoint in the ($T, \mu_q$)-plane.Comment: 9 pages, 11 figures. Submitted to Phys. Rev.

Lorenz function of Bi2_{2}Te3_{3}/Sb2_{2}Te3_{3} superlattices

Combining first principles density functional theory and semi-classical Boltzmann transport, the anisotropic Lorenz function was studied for thermoelectric Bi$_{2}$Te$_{3}$/Sb$_{2}$Te$_{3}$ superlattices and their bulk constituents. It was found that already for the bulk materials Bi$_{2}$Te$_{3}$ and Sb$_{2}$Te$_{3}$, the Lorenz function is not a pellucid function on charge carrier concentration and temperature. For electron-doped Bi$_{2}$Te$_{3}$/Sb$_{2}$Te$_{3}$ superlattices large oscillatory deviations for the Lorenz function from the metallic limit were found even at high charge carrier concentrations. The latter can be referred to quantum well effects, which occur at distinct superlattice periods

Software Model Checking with Explicit Scheduler and Symbolic Threads

In many practical application domains, the software is organized into a set of threads, whose activation is exclusive and controlled by a cooperative scheduling policy: threads execute, without any interruption, until they either terminate or yield the control explicitly to the scheduler. The formal verification of such software poses significant challenges. On the one side, each thread may have infinite state space, and might call for abstraction. On the other side, the scheduling policy is often important for correctness, and an approach based on abstracting the scheduler may result in loss of precision and false positives. Unfortunately, the translation of the problem into a purely sequential software model checking problem turns out to be highly inefficient for the available technologies. We propose a software model checking technique that exploits the intrinsic structure of these programs. Each thread is translated into a separate sequential program and explored symbolically with lazy abstraction, while the overall verification is orchestrated by the direct execution of the scheduler. The approach is optimized by filtering the exploration of the scheduler with the integration of partial-order reduction. The technique, called ESST (Explicit Scheduler, Symbolic Threads) has been implemented and experimentally evaluated on a significant set of benchmarks. The results demonstrate that ESST technique is way more effective than software model checking applied to the sequentialized programs, and that partial-order reduction can lead to further performance improvements.Comment: 40 pages, 10 figures, accepted for publication in journal of logical methods in computer scienc

Pruning Algorithms for Low-Dimensional Non-metric k-NN Search: A Case Study

We focus on low-dimensional non-metric search, where tree-based approaches permit efficient and accurate retrieval while having short indexing time. These methods rely on space partitioning and require a pruning rule to avoid visiting unpromising parts. We consider two known data-driven approaches to extend these rules to non-metric spaces: TriGen and a piece-wise linear approximation of the pruning rule. We propose and evaluate two adaptations of TriGen to non-symmetric similarities (TriGen does not support non-symmetric distances). We also evaluate a hybrid of TriGen and the piece-wise linear approximation pruning. We find that this hybrid approach is often more effective than either of the pruning rules. We make our software publicly available

Tau Be or not Tau Be? - A Perspective on Service Compatibility and Substitutability

One of the main open research issues in Service Oriented Computing is to propose automated techniques to analyse service interfaces. A first problem, called compatibility, aims at determining whether a set of services (two in this paper) can be composed together and interact with each other as expected. Another related problem is to check the substitutability of one service with another. These problems are especially difficult when behavioural descriptions (i.e., message calls and their ordering) are taken into account in service interfaces. Interfaces should capture as faithfully as possible the service behaviour to make their automated analysis possible while not exhibiting implementation details. In this position paper, we choose Labelled Transition Systems to specify the behavioural part of service interfaces. In particular, we show that internal behaviours (tau transitions) are necessary in these transition systems in order to detect subtle errors that may occur when composing a set of services together. We also show that tau transitions should be handled differently in the compatibility and substitutability problem: the former problem requires to check if the compatibility is preserved every time a tau transition is traversed in one interface, whereas the latter requires a precise analysis of tau branchings in order to make the substitution preserve the properties (e.g., a compatibility notion) which were ensured before replacement.Comment: In Proceedings WCSI 2010, arXiv:1010.233