Surface Effects on the Mechanical Elongation of AuCu Nanowires: De-alloying and the Formation of Mixed Suspended Atomic Chains

We report here an atomistic study of the mechanical deformation of AuxCu(1-x) atomic-size wires (NWs) by means of high resolution transmission electron microscopy (HRTEM) experiments. Molecular dynamics simulations were also carried out in order to obtain deeper insights on the dynamical properties of stretched NWs. The mechanical properties are significantly dependent on the chemical composition that evolves in time at the junction; some structures exhibit a remarkable de-alloying behavior. Also, our results represent the first experimental realization of mixed linear atomic chains (LACs) among transition and noble metals; in particular, surface energies induce chemical gradients on NW surfaces that can be exploited to control the relative LAC compositions (different number of gold and copper atoms). The implications of these results for nanocatalysis and spin transport of one-atom-thick metal wires are addressed.Comment: Accepted to Journal of Applied Physics (JAP

Apparative Probleme bei der Untersuchung der Konstanz des Wahrnehmungsraumes - und ein neues Verfahren zu ihrer Lösung

An important usage of time sequences is for discovering temporal patterns of events (a special type of data mining). This process usually starts with the specification by the user of an event structure which consists of a number of variables representing events and temporal constraints among these variables. The goal of the data mining is to find temporal patterns, i.e., instantiations of the variables in the structure, which frequently appear in the time sequence. This paper introduces event structures that have temporal constraints with multiple granularities (TCGs). Testing the consistency of such structures is shown to be NP-hard. An approximate algorithm is then presented. The paper also introduces the concept of a timed automation with granularities (TAGs) that can be used to find in a time sequence occurrences of a particular TCG with instantiated variables. The TCGs, the approximate algorithm and the TAGs are shown to be useful for obtaining effective data mining procedures

Supporting Temporal Reasoning by Mapping Calendar Expressions to Minimal Periodic Sets

In the recent years several research efforts have focused on the concept of time granularity and its applications. A first stream of research investigated the mathematical models behind the notion of granularity and the algorithms to manage temporal data based on those models. A second stream of research investigated symbolic formalisms providing a set of algebraic operators to define granularities in a compact and compositional way. However, only very limited manipulation algorithms have been proposed to operate directly on the algebraic representation making it unsuitable to use the symbolic formalisms in applications that need manipulation of granularities. This paper aims at filling the gap between the results from these two streams of research, by providing an efficient conversion from the algebraic representation to the equivalent low-level representation based on the mathematical models. In addition, the conversion returns a minimal representation in terms of period length. Our results have a major practical impact: users can more easily define arbitrary granularities in terms of algebraic operators, and then access granularity reasoning and other services operating efficiently on the equivalent, minimal low-level representation. As an example, we illustrate the application to temporal constraint reasoning with multiple granularities. From a technical point of view, we propose an hybrid algorithm that interleaves the conversion of calendar subexpressions into periodical sets with the minimization of the period length. The algorithm returns set-based granularity representations having minimal period length, which is the most relevant parameter for the performance of the considered reasoning services. Extensive experimental work supports the techniques used in the algorithm, and shows the efficiency and effectiveness of the algorithm

Orchestrating Tuple-based Languages

The World Wide Web can be thought of as a global computing architecture supporting the deployment of distributed networked applications. Currently, such applications can be programmed by resorting mainly to two distinct paradigms: one devised for orchestrating distributed services, and the other designed for coordinating distributed (possibly mobile) agents. In this paper, the issue of designing a pro- gramming language aiming at reconciling orchestration and coordination is investigated. Taking as starting point the orchestration calculus Orc and the tuple-based coordination language Klaim, a new formalism is introduced combining concepts and primitives of the original calculi. To demonstrate feasibility and effectiveness of the proposed approach, a prototype implementation of the new formalism is described and it is then used to tackle a case study dealing with a simplified but realistic electronic marketplace, where a number of on-line stores allow client applications to access information about their goods and to place orders

Privacy in geo-social networks: proximity notification with untrusted service providers and curious buddies

A major feature of the emerging geo-social networks is the ability to notify a user when any of his friends (also called buddies) happens to be geographically in proximity. This proximity service is usually offered by the network itself or by a third party service provider (SP) using location data acquired from the users. This paper provides a rigorous theoretical and experimental analysis of the existing solutions for the location privacy problem in proximity services. This is a serious problem for users who do not trust the SP to handle their location data and would only like to release their location information in a generalized form to participating buddies. The paper presents two new protocols providing complete privacy with respect to the SP and controllable privacy with respect to the buddies. The analytical and experimental analysis of the protocols takes into account privacy, service precision, and computation and communication costs, showing the superiority of the new protocols compared to those appeared in the literature to date. The proposed protocols have also been tested in a full system implementation of the proximity service

SmartWheels: Detecting urban features for wheelchair users’ navigation

People with mobility impairments have heterogeneous needs and abilities while moving in an urban environment and hence they require personalized navigation instructions. Providing these instructions requires the knowledge of urban features like curb ramps, steps or other obstacles along the way. Since these urban features are not available from maps and change in time, crowdsourcing this information from end-users is a scalable and promising solution. However, it is inconvenient for wheelchair users to input data while on the move. Hence, an automatic crowdsourcing mechanism is needed. In this contribution we present SmartWheels, a solution to detect urban features by analyzing inertial sensors data produced by wheelchair movements. Activity recognition techniques are used to process the sensors data stream. SmartWheels is evaluated on data collected from 17 real wheelchair users navigating in a controlled environment (10 users) and in-the-wild (7 users). Experimental results show that SmartWheels is a viable solution to detect urban features, in particular by applying specific strategies based on the confidence assigned to predictions by the classifier

Timed Multiparty Session Types

We propose a typing theory, based on multiparty session types, for modular verification of real-time choreographic interactions. To model real-time implementations, we introduce a simple calculus with delays and a decidable static proof system. The proof system ensures type safety and time-error freedom, namely processes respect the prescribed timing and causalities between interactions. A decidable condition on timed global types guarantees time-progress for validated processes with delays, and gives a sound and complete characterisation of a new class of CTAs with general topologies that enjoys progress and liveness

Vertical ridge augmentation with Ti-reinforced dense polytetrafluoroethylene (d-PTFE) membranes or Ti-meshes and collagen membranes: 3-year results of a randomized clinical trial

BackgroundThe present study aimed to evaluate hard and soft tissue parameters around implants placed in augmented posterior mandible, comparing Ti-reinforced d-PTFE membranes with Ti-meshes covered with collagen membranes, after 3 years of follow-up. Materials and MethodsForty eligible patients were randomly assigned to group A (Ti-reinforced d-PTFE membrane) or group B (mesh covered with collagen membrane) for vertical ridge augmentation (VRA) and simultaneous implants. Implants were evaluated using specific peri-implant parameters for bone and soft tissues: probing pocket depth (PPD), modified plaque index (mPI), bleeding on probing (BoP), modified gingival index (mGI), thickness of keratinized tissue (tKT), width of keratinized tissue (wKT), fornix depth (FD), peri-implant bone level (PBL), interproximal bone peaks (IBP), marginal bone loss (MBL), interproximal bone loss (IBL). ResultsA total of 28 patients with 79 implants were evaluated after 3 years of follow-up. The mean value of MBL was 0.70 mm (group A = 0.73 mm; group B = 0.71 mm), while mean IBL was 0.54 mm (group A = 0.64 mm; group B = 0.40 mm). The treatment with meshes resulted not inferior to PTFE and their clinical results appeared similar. A strong correlation between PBL and IBP was confirmed. Both study groups showed an increase of tKT and wKT values. ConclusionIn the posterior mandible, VRA using both techniques provides stable PBLs up to 3 years. A correct soft tissue management and a strict professional oral hygiene protocol play a crucial role on peri-implant health over time

Fundamental Power Limits of SAR and ΔΣ Analog-to-Digital Converters

This work aims at estimating and comparing the power limits of ΔΣ and charge-redistribution successiveapproximation register (CR-SAR) analog-to-digital converters (ADCs), in order to identify which topology is the most powerefficient for a target resolution. A power consumption model for mismatch-limited SAR ADCs and for discrete-time (DT) ΔΣ modulators is presented and validated against experimental data. SAR ADCs are found to be the best choice for low-to-medium resolutions, up to roughly 80 dB of dynamic range (DR). At high resolutions, on the other hand, ΔΣ modulators become more power-efficient. This is due to the intrinsic robustness of the ΔΣ modulation principle against circuit imperfections and nonidealities. Furthermore, a comparison of the area occupation of such topologies reveals that, at high resolutions and for a given dynamic range, ΔΣ ADCs result more area-efficient as well