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.     

A parallel hp‐FEM infrastructure for three‐dimensional structural acoustics

This paper describes a parallel three‐dimensional numerical infrastructure for the solution of a wide range of time‐harmonic problems in structural acoustics and vibration. High accuracy and rate of error‐convergence, in the mid‐frequency regime,is achieved by the use of hp‐finite and infinite element approximations. The infrastructure supports parallel computation in both single and multi‐frequency settings. Multi‐frequency solves utilize concurrent factoring of the frequency‐dependent linear algebraic systems and are naturally scalable. Scalability of large‐scale single‐frequency problems is realized by using FETI‐DP—an iterative domain‐decomposition scheme. Numerical examples are presented to cover applications in vibratory response of fluid‐filled elastic structures as well as radiation and scattering from elastic structures submerged in an infinite acoustic medium. We demonstrate both the numerical accuracy as well as parallel scalability of the infrastructure in terms of problem parameters that include wavenumber and number of frequencies, polynomial degree of finite/infinite element approximations as well as the number of processors. Scalability and accuracy is evaluated for both single and multiple frequency sweeps on four high‐performance parallel computing platforms: SGI Altix, SGI Origin, IBM p690 SP and Linux‐cluster. Results show good performance on shared as well as distributed‐memory architecture. Copyright © 2006 John Wiley & Sons, Ltd.     

Influence of Cl-, Br-, NO 3 - and SO 4 2- ions on the corrosion behaviour of 6061 Al alloy

The effects of anions like Cl^-, Br^-, NO ₃ ^- and SO ₄ ^2- on the anodic dissolution of the monolithic Al 6061 alloy have been investigated at neutral pH through immersion testing and electrochemical techniques like potentiodynamic polarization and a.c. impedance spectroscopy. Scanning electron microscopy was employed to characterize the corroded surface and to observe the extent of pitting in different media. From the evaluated corrosion parameters it was found that the dissolution of the matrix was extensively reduced in presence of aqueous solutions containing Br^-, NO ₃ ^- and SO ₄ ^2- ions while Cl^- ions aggravated corrosion by penetrating into the barrier oxide film on the surface of the material. Pronounced effect of pitting was observed in presence of Cl^- and the level of pitting in NO ₃ ^- and Br^- were mild. In presence of SO ₄ ^2- ions passivity was extended over a wide potential range and breakdown of passivity occurs when the material was polarized beyond pitting potential. The departure of capacitive behaviour towards resistive behaviour was clearly observed through impedance measurements when investigations were conducted in Cl^- media and in presence of the other electrolytes. Corrosion rates were, however, controlled during prolonged exposure in the electrolytic media, specially in case of chloride media, due to the predominance of film repair kinetics.