Design and Uncertainty Evaluation of a Strain Measurement System

Strain measurement is very important in various industrial applications as well as different disciplines of science and technology for direct and indirect observations of certain parameters. Designing signal conditioning circuit is always a challenging and important task for satisfactory and reliable performance of a sensor as well as the system. The design and implementation details of a signal conditioning circuit of resistive sensor (strain gauge) for strain measurement are presented in this paper. Also the important aspects in designing a signal conditioning circuit for resistive sensor are presented and a novel method for the measurement of strain is discussed. Quarter bridge configuration with AC voltage excitation is used for the measurement along with the necessary circuitry to get a suitable and measurable output DC voltage. The measurement system is calibrated using a cantilever of stainless steel and the details of calibration are presented in the paper. The uncertainty associated with the measurement system is evaluated.     

Attack resilient P2P dissemination of RSS feed

RSS (really simple syndication) based feeds have become the defacto mechanism of web based publish subscribe. Peer-to-Peer delivery of such feeds can not only alleviate the load at the content server, but also reduce the dissemination latency. However, due to openness of P2P system, malicious peers can join the network as easily as normal peers do. Such malicious peers may pretend to relay but actually not, and thus deny service, or even disseminate counterfeit updates, rendering a Peer-to-Peer mechanism not only useless, but even harmful (e.g. by false updates). We propose overlay independent randomized strategies to mitigate these ill-effects of malicious peers at a marginal overhead, thus enjoying the benefits of Peer-to-Peer dissemination, along with the assurance of content integrity in RSS like web-based publish-subscribe applications without altering currently deployed server infrastructure. We conduct analysis of performance of our proposal by modeling behavior of the system and validating the same with simulation. Results show that our proposal is effective, robust and scalable.     

Development of a biological detection platform utilizing a modular microfluidic stack

The goal of this project is to build a miniaturized, user-friendly cytometry setup (Datta et al. in Microfluidic platform for education and research. COMS, Baton Rouge, 2008; Frische et al. in Development of an miniaturized flow cytometry setup for visual cell inspection and sorting. Baton Rouge, Project Report, 2008) by combining a customized, microfluidic device with visual microscope inspection to detect and extract specific cells from a continuous sample flow. We developed a cytological tool, based on the Coulter particle counter principle, using a microelectrode array patterned on a borosilicate glass chip as electrical detection set-up which is fully embedded into a polymeric multi-layer microfluidic stack. The detection takes place between pairs of coplanar Cr/Au microelectrodes by sensing an impedance change caused by particles continuously carried within a microfluidic channel across the detection area under laminar flow conditions. A wide frequency range available for counting provides information on cell size, membrane capacitance, cytoplasm conductivity and is potentially of interest for in-depth cell diagnostic e.g. to detect damaged or cancerous cells and select them for extraction and further in-depth analysis.     

Multi-objective optimization of multicast overlays for collaborative applications

Current real-time collaborative application implementations use dedicated infrastructure to carry out all communication and synchronization activities. Specifically, they require all end nodes to communicate directly with and through the central server. In this paper, we investigate scenarios in which the most resource intensive functionality of continuous communication among collaborators to disseminate changes is decentralized, utilizing the end users themselves as relays. We observe that communication characteristics of real-time collaboration makes use of existing multicast mechanisms unsuitable. As collaborative editing sessions are typically long and repeated, it is possible to gather and leverage node behavior (their instabilities and frequency of sending updates) and communication links (latencies and average costs). Several criteria to determine the quality of a multicast tree can be identified: cost, latency and instability. In this paper, we analyze the complexity of the problem of finding optimal communication topologies, and propose approximate algorithms to optimize the same. We also consider the multiobjective problem in which we search for a topology that provides good trade-off between these sometimes conflicting measures. Validation of our proposed algorithms on numerous graphs shows that it is important to consider the multiobjective problem, as optimal solutions for one performance measure can be far from optimal for the other metrics. Finally, we briefly present an implementation of a communication library that uses the proposed algorithms to periodically adjust the dissemination tree.     

Bridging the gap: effect of text query reformulation in multimodal retrieval

Multimedia Tools and Applications - Multimodal Retrieval provides new paradigms and methods aimed at effectively searching through the enormous volume of data. Multimodal retrieval is a well...     

On negative results when using sentiment analysis tools for software engineering research

Recent years have seen an increasing attention to social aspects of software engineering, including studies of emotions and sentiments experienced and expressed by the software developers. Most of these studies reuse existing sentiment analysis tools such as SentiStrength and NLTK. However, these tools have been trained on product reviews and movie reviews and, therefore, their results might not be applicable in the software engineering domain. In this paper we study whether the sentiment analysis tools agree with the sentiment recognized by human evaluators (as reported in an earlier study) as well as with each other. Furthermore, we evaluate the impact of the choice of a sentiment analysis tool on software engineering studies by conducting a simple study of differences in issue resolution times for positive, negative and neutral texts. We repeat the study for seven datasets (issue trackers and Stack Overflow questions) and different sentiment analysis tools and observe that the disagreement between the tools can lead to diverging conclusions. Finally, we perform two replications of previously published studies and observe that the results of those studies cannot be confirmed when a different sentiment analysis tool is used.     

Linearized motion estimation for articulated planes

In this paper, we describe the explicit application of articulation constraints for estimating the motion of a system of articulated planes. We relate articulations to the relative homography between planes and show that these articulations translate into linearized equality constraints on a linear least-squares system, which can be solved efficiently using a Karush-Kuhn-Tucker system. The articulation constraints can be applied for both gradient-based and feature-based motion estimation algorithms and to illustrate this, we describe a gradient-based motion estimation algorithm for an affine camera and a feature-based motion estimation algorithm for a projective camera that explicitly enforces articulation constraints. We show that explicit application of articulation constraints leads to numerically stable estimates of motion. The simultaneous computation of motion estimates for all of the articulated planes in a scene allows us to handle scene areas where there is limited texture information and areas that leave the field of view. Our results demonstrate the wide applicability of the algorithm in a variety of challenging real-world cases such as human body tracking, motion estimation of rigid, piecewise planar scenes, and motion estimation of triangulated meshes.     

The minimum positional error incurred by any connectivity-based positioning algorithm for mobile wireless systems

A very important problem in many wireless ad-hoc networks, including wireless sensor networks, is positioning or the determination of geographical locations of the wireless nodes. Positioning is used both in infrastructural aspects of sensor networks, like geographic routing and topology maintenance, and in applications like wildlife tracking. Connectivity-based positioning algorithms in mobile wireless systems are studied in this work. These algorithms compute node positions based only on the connectivity, i.e. the neighborhood information of each node. Many algorithms have been proposed for positioning in stationary node systems and bounds on positional error of algorithms have been derived. The design and analysis of positioning algorithms for mobile node systems is a more challenging problem. Node mobility increases the amount of positional information available to a positioning algorithm. The work in this paper establishes a bound on the positional error for connectivity-based algorithms in mobile systems. The formulation from the analysis is used to investigate the benefit of this additional positional information on reducing positional error. There is a limit to the usefulness of positional information from previous node positions due to movement. This captures an important performance tradeoff: historical positional information can yield reduced positional error but requires more connectivity information from the network which requires greater computational resources.     

Automated Cellular Modeling and Prediction on a Large Scale

We describe CHAMP (CHurn Analysis, Modeling, andPrediction), an automated system for modeling cellularsubscriber churn that is predicting which customerswill discontinue cellular phone service. We describevarious issues related to developing and deployingthis system including automating data access from aremote data warehouse, preprocessing, featureselection, model validation, and optimization toreflect business tradeoffs. Using data from GTE'sdata warehouse for cellular phone customers, CHAMP iscapable of developing churn models customized byregion for over one hundred GTE cellular phone marketstotaling over 5 million customers. Every month churnfactors are identified for each geographic region andmodels are updated to generate churn scores predictingwho is likely to churn in the short term. Learningmethods such as decision trees and genetic algorithmsare used for feature selection and a cascade neuralnetwork is used for predicting churn scores. Inaddition to producing churn scores, CHAMP alsoproduces qualitative results in the form of rules andcomparison of market trends that are disseminatedthrough a web based interface.     

Snap-stabilization and PIF in tree networks

The contribution of this paper is threefold. First, we present the paradigm of snap-stabilization. A snap- stabilizing protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes in 0 rounds). Second, we propose a new Propagation of Information with Feedback (PIF) cycle, called Propagation of Information with Feedback and Cleaning (). We show three different implementations of this new PIF. The first one is a basic cycle which is inherently snap-stabilizing. However, the first PIF cycle can be delayed O(h ²) rounds (where h is the height of the tree) due to some undesirable local states. The second algorithm improves the worst delay of the basic algorithm from O(h ²) to 1 round. The state requirement for the above two algorithms is 3 states per processor, except for the root and leaf processors that use only 2 states. Also, they work on oriented trees. We then propose a third snap-stabilizing PIF algorithm on un-oriented tree networks. The state requirement of the third algorithm depends on the degree of the processors, and the delay is at most h rounds. Next, we analyze the maximum waiting time before a PIF cycle can be initiated whether the PIF cycle is infinitely and sequentially repeated or launch as an isolated PIF cycle. The analysis is made for both oriented and un-oriented trees. We show or conjecture that the two best of the above algorithms produce optimal waiting time. Finally, we compute the minimal number of states the processors require to implement a single PIF cycle, and show that both algorithms for oriented trees are also (in addition to being time optimal) optimal in terms of the number of states. WARNING: The concept of snap-stabilization was first introduced in [12]. The concept evolved over the last eight years. We take this evolution in consideration in this paper, which includes the early results published in [10] and [12]. In particular, infinite repetition of computation cycles is a requirement of self-stabilizing systems. This is not required in snap-stabilization because snap-stabilization ensures that the first completed computation cycle is executed according to the specification of the problem. The correctness proofs conform to this basic property.