Providing security and fault tolerance in P2P connections between clouds for mHealth services

The mobile health (mHealth) and electronic health (eHealth) systems are useful to maintain a correct administration of health information and services. However, it is mandatory to ensure a secure data transmission and in case of a node failure, the system should not fall down. This fact is important because several vital systems could depend on this infrastructure. On the other hand, a cloud does not have infinite computational and storage resources in its infrastructure or would not provide all type of services. For this reason, it is important to establish an interrelation between clouds using communication protocols in order to provide scalability, efficiency, higher service availability and flexibility which allow the use of services, computing and storage resources of other clouds. In this paper, we propose the architecture and its secure protocol that allows exchanging information, data, services, computing and storage resources between all interconnected mHealth clouds. The system is based on a hierarchic architecture of two layers composed by nodes with different roles. The routing algorithm used to establish the connectivity between the nodes is the shortest path first (SPF), but it can be easily changed by any other one. Our architecture is highly scalable and allows adding new nodes and mHealth clouds easily, while it tries to maintain the load of the cloud balanced. Our protocol design includes node discovery, authentication and fault tolerance. We show the protocol operation and the secure system design. Finally we provide the performance results in a controlled test bench.     

Multilingual resources for NLP in the lexical markup framework (LMF)

Optimizing the production, maintenance and extension of lexical resources is one the crucial aspects impacting natural language processing (NLP). A second aspect involves optimizing the process leading to their integration in applications. With this respect, we believe that a consensual specification on monolingual, bilingual and multilingual lexicons can be a useful aid for the various NLP actors. Within ISO, one purpose of Lexical Markup Framework (LMF, ISO-24613) is to define a standard for lexicons that covers multilingual lexical data.

A novel fluorescence lifetime imaging system that optimizes photon efficiency

Fluorescence lifetime imaging (FLIM) is a powerful microscopy technique for providing contrast of biological and other systems by differences in molecular species or their environments. However, the cost of equipment and the complexity of data analysis have limited the application of FLIM. We present a mathematical model and physical implementation for a low cost digital frequency domain FLIM (DFD-FLIM) system, which can provide lifetime resolution with quality comparable to time-correlated single photon counting methods. Our implementation provides data natively in the form of phasors. On the basis of the mathematical model, we present an error analysis that shows the precise parameters for maximizing the quality of lifetime acquisition, as well as data to support this conclusion. The hardware and software of the proposed DFD-FLIM method simplifies the process of data acquisition for FLIM, presents a new interface for data display and interpretation, and optimizes the accuracy of lifetime determination.     

Cytosolic Calcium Concentration Changes in Neuronal Cells Under Clinorotation and in Parabolic Flight Missions

All life on earth has been established under conditions of stable gravity of 1g. Nevertheless, in numerous experiments the direct gravity dependence of biological processes has been shown on all levels of organization, from single molecules to humans. To study the effects especially of microgravity on biological systems, a variety of platforms are available, from drop towers to the ISS. Due to the costs of these platforms and their limited availability, as an alternative, numerous simulators have been developed for so called “simulated” microgravity. A classical systems is a clinostat, basically rotating a sample around one axis, and by integration of the gravity vector for 360° arguing that thus the effects of gravity are depleted. Indeed, a variety of studies has shown that taking out the direction of gravity from a biological system often results in consequences similar to the exposure of the system to real microgravity. Nevertheless, the opposite has been shown, too, and as a consequence the relevance of clinostats in microgravity research is still under discussion. To get some more insight into this problem we have constructed a small fluorescence clinostat and have studied the effects of clinorotation on the cytosolic calcium concentration of neuroglioma cells. The results have been compared to experiments with identical cells in real microgravity, utilizing parabolic flight missions. Our results show that in case of a cell suspension used in a small florescence clinostat within a tube diameter of 2mm, the effects of clinorotation are comparable to those under real microgravity, both showing a significant increase in intracellular calcium concentration.     

Cyclic Nanoindentation for Local High Cycle Fatigue Investigations: A Methodological Approach Accounting for Thermal Drift

Cyclic nanoindentation allows characterizing the influence of single phases and their interactions on fatigue mechanisms. Herein, a method for high cycle fatigue testing by nanoindentation is presented. By combining high- and low-frequency indentation modes, high cycle numbers are achieved while obtaining sufficient data points to reconstruct force–displacement hysteresis loops. A challenge is the stochastic course of thermal drift which is addressed by measuring drift rate in regular low-force holding segments. Drift rates are used to correct the displacement values, yielding reproducible cyclic deformation data as it is shown for two very different materials, a ductile metal and a brittle ceramic.     

Practical voting rules with partial information

Voting is an essential mechanism that allows multiple agents to reach a joint decision. The joint decision, representing a function over the preferences of all agents, is the winner among all possible (candidate) decisions. To compute the winning candidate, previous work has typically assumed that voters send their complete set of preferences for computation, and in fact this has been shown to be required in the worst case. However, in practice, it may be infeasible for all agents to send a complete set of preferences due to communication limitations and willingness to keep as much information private as possible. The goal of this paper is to empirically evaluate algorithms to reduce communication on various sets of experiments. Accordingly, we propose an iterative algorithm that allows the agents to send only part of their preferences, incrementally. Experiments with simulated and real-world data show that this algorithm results in an average of 35% savings in communications, while guaranteeing that the actual winning candidate is revealed. A second algorithm applies a greedy heuristic to save up to 90% of communications. While this heuristic algorithm cannot guarantee that a true winning candidate is found, we show that in practice, close approximations are obtained.     

The undirected capacitated arc routing problem with profits

A profit and a demand are associated with each edge of a set of profitable edges of a given graph. A travel time is associated with each edge of the graph. A fleet of capacitated vehicles is given to serve the profitable edges. A maximum duration of the route of each vehicle is also given. The profit of an edge can be collected by one vehicle only that also serves the demand of the edge. The objective of this problem, which is called the undirected capacitated arc routing problem with profits (UCARPP), is to find a set of routes that satisfy the constraints on the duration of the route and on the capacity of the vehicle and maximize the total collected profit. We propose a branch-and-price algorithm and several heuristics. We can solve exactly instances with up to 97 profitable edges. The best heuristics find the optimal solution on most of instances where it is available.     

Linear complete differential resultants and the implicitization of linear DPPEs

The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resultants of the implicit equation of a system of n$n$ linear differential polynomial parametric equations in n−1$n-1$ differential parameters. We give necessary conditions to ensure properness of the system of differential polynomial parametric equations.