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.     

Projective active shape models for pose-variant image analysis of quasi-planar objects: Application to facial analysis

One of the important obstacles in the image-based analysis of the human face is the 3D nature of the problem and the 2D nature of most imaging systems used for biometric applications. Due to this, accuracy is strongly influenced by the viewpoint of the images, being frontal views the most thoroughly studied. However, when fully automatic face analysis systems are designed, capturing frontal-view images cannot be guaranteed. Examples of this situation can be found in surveillance systems, car driver images or whenever there are architectural constraints that prevent from placing a camera frontal to the subject. Taking advantage of the fact that most facial features lie approximately on the same plane, we propose the use of projective geometry across different views. An active shape model constructed with frontal-view images can then be directly applied to the segmentation of pictures taken from other viewpoints. The proposed extension demonstrates being significantly more invariant than the standard approach. Validation of the method is presented in 360 images from the AV@CAR database, systematically divided into three different rotations (to both sides), as well as upper and lower views due to nodding. The presented tests are among the largest quantitative results reported to date in face segmentation under varying poses.     

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.     

Adoption of open source software in software-intensive organizations – A systematic literature review

ContextOpen source software (OSS) is changing the way organizations develop, acquire, use, and commercialize software.ObjectiveThis paper seeks to identify how organizations adopt OSS, classify the literature according to these ways of adopting OSS, and with a focus on software development evaluate the research on adoption of OSS in organizations.MethodBased on the systematic literature review method we reviewed publications from 24 journals and seven conference and workshop proceedings, published between 1998 and 2008. From a population of 24,289 papers, we identified 112 papers that provide empirical evidence on how organizations actually adopt OSS.ResultsWe show that adopting OSS involves more than simply using OSS products. We moreover provide a classification framework consisting of six distinctly different ways in which organizations adopt OSS. This framework is used to illustrate some of the opportunities and challenges organizations meet when approaching OSS, to show that OSS can be adopted successfully in different ways, and to organize and review existing research. We find that existing research on OSS adoption does not sufficiently describe the context of the organizations studied, and it fails to benefit fully from related research fields. While existing research covers a large number of topics, it contains very few closely related studies. To aid this situation, we offer directions for future research.ConclusionThe implications of our findings are twofold. On the one hand, practitioners should embrace the many opportunities OSS offers, but consciously evaluate the consequences of adopting it in their own context. They may use our framework and the success stories provided by the literature in their own evaluations. On the other hand, researchers should align their work, and perform more empirical research on topics that are important to organizations. Our framework may be used to position this research and to describe the context of the organization they are studying.     

nSPARQL: A navigational language for RDF

Navigational features have been largely recognized as fundamental for graph database query languages. This fact has motivated several authors to propose RDF query languages with navigational capabilities. In this paper, we propose the query language nSPARQL that uses nested regular expressions to navigate RDF data. We study some of the fundamental properties of nSPARQL and nested regular expressions concerning expressiveness and complexity of evaluation. Regarding expressiveness, we show that nSPARQL is expressive enough to answer queries considering the semantics of the RDFS vocabulary by directly traversing the input graph. We also show that nesting is necessary in nSPARQL to obtain this last result, and we study the expressiveness of the combination of nested regular expressions and SPARQL operators. Regarding complexity of evaluation, we prove that given an RDF graph G and a nested regular expression E, this problem can be solved in time O(|G||E|).