Scalable digital hardware for a trapped ion quantum computer

Quantum Information Processing - Many of the challenges of scaling quantum computer hardware lie at the interface between the qubits and the classical control signals used to manipulate them....     

Studying re-opened bugs in open source software

Bug fixing accounts for a large amount of the software maintenance resources. Generally, bugs are reported, fixed, verified and closed. However, in some cases bugs have to be re-opened. Re-opened bugs increase maintenance costs, degrade the overall user-perceived quality of the software and lead to unnecessary rework by busy practitioners. In this paper, we study and predict re-opened bugs through a case study on three large open source projects—namely Eclipse, Apache and OpenOffice. We structure our study along four dimensions: (1) the work habits dimension (e.g., the weekday on which the bug was initially closed), (2) the bug report dimension (e.g., the component in which the bug was found) (3) the bug fix dimension (e.g., the amount of time it took to perform the initial fix) and (4) the team dimension (e.g., the experience of the bug fixer). We build decision trees using the aforementioned factors that aim to predict re-opened bugs. We perform top node analysis to determine which factors are the most important indicators of whether or not a bug will be re-opened. Our study shows that the comment text and last status of the bug when it is initially closed are the most important factors related to whether or not a bug will be re-opened. Using a combination of these dimensions, we can build explainable prediction models that can achieve a precision between 52.1–78.6 % and a recall in the range of 70.5–94.1 % when predicting whether a bug will be re-opened. We find that the factors that best indicate which bugs might be re-opened vary based on the project. The comment text is the most important factor for the Eclipse and OpenOffice projects, while the last status is the most important one for Apache. These factors should be closely examined in order to reduce maintenance cost due to re-opened bugs.     

Sensitivity analysis of shape memory alloy shells

This paper presents procedures for efficient design sensitivity analysis for shape memory alloy (SMA) structures modeled with shell elements. Availability of sensitivity information at low computational cost can dramatically improve the efficiency of the optimization process, as it enables use of efficient gradient-based optimization algorithms. The formulation and computation of design sensitivities of SMA shell structures using the direct differentiation method is considered, in a steady state electro-thermo-mechanical finite element context. Finite difference, semi-analytical and refined semi-analytical sensitivity analysis approaches are considered and compared in terms of efficiency, accuracy and implementation effort, based on a representative finite element model of a miniature SMA gripper.     

Viewfinder Alignment

The viewfinder of a digital camera has traditionally been used for one purpose: to display to the user a preview of what is seen through the camera's lens. High quality cameras are now available on devices such as mobile phones and PDAs, which provide a platform where the camera is a programmable device, enabling applications such as online computational photography, computer vision‐based interactive gaming, and augmented reality. For such online applications, the camera viewfinder provides the user's main interaction with the environment. In this paper, we describe an algorithm for aligning successive viewfinder frames. First, an estimate of inter‐frame translation is computed by aligning integral projections of edges in two images. The estimate is then refined to compute a full 2D similarity transformation by aligning point features. Our algorithm is robust to noise, never requires storing more than one viewfinder frame in memory, and runs at 30 frames per second on standard smartphone hardware. We use viewfinder alignment for panorama capture, low‐light photography, and a camera‐based game controller.     

Near optimum sampling design and an efficient algorithm for single tone frequency estimation

Work on single tone frequency estimation has focused on uniformly sampled data. However, it has been shown that, for a given number of samples, more information on the frequency of a signal can be gained by non-uniform sampling schemes [M. Wieler, S. Trittler, F.A. Hamprecht, Optimal design for single tone frequency estimation, Digital Signal Process., in press]. Unfortunately, an optimum sampling pattern (that, for example, minimizes the Cramér–Rao bound) does not automatically have a fast and simple algorithm for frequency estimation associated with it. For application in an interferometric measurement system, an algorithm is needed that gathers as much information as possible from a low number of samples, while at the same time keeping the computational effort sufficiently low to process millions of time series in a few seconds. This paper proposes a simple approximation to the optimum sampling pattern by using uniformly sampled blocks of data and further proposes to estimate phase and frequency in each of these blocks and to exploit these intermediate results in the final estimation. An approach to do so is investigated in detail. Results are compared to the Cramér–Rao bound (CRB), and it is shown that this algorithm almost reaches this limit on the variance of unbiased estimators, at a computational complexity lower than that of a typical FFT-based approach. For $M=32$ samples and a signal-to-noise ratio of 10, the standard deviation of the frequency estimate is lower by more than 50% compared to uniform sampling. In addition, the algorithm can easily be applied to poorly characterized systems, e.g. systems for which the noise is not known exactly. Finally, we demonstrate that the proposed strategy yields results that are within 3% of the theoretically achievable accuracy for the theoretically optimum sampling pattern.     

Robust Adaptive Control of Cooperating Mobile Manipulators With Relative Motion

In this paper, coupled dynamics are presented for two cooperating mobile robotic manipulators manipulating an object with relative motion in the presence of uncertainties and external disturbances. Centralized robust adaptive controls are introduced to guarantee the motion, and force trajectories of the constrained object converge to the desired manifolds with prescribed performance. The stability of the closed-loop system and the boundedness of tracking errors are proved using Lyapunov stability synthesis. The tracking of the constraint trajectory/force up to an ultimately bounded error is achieved. The proposed adaptive controls are robust against relative motion disturbances and parametric uncertainties and are validated by simulation studies.     

Transaction aggregation as a strategy for credit card fraud detection

The problem of preprocessing transaction data for supervised fraud classification is considered. It is impractical to present an entire series of transactions to a fraud detection system, partly because of the very high dimensionality of such data but also because of the heterogeneity of the transactions. Hence, a framework for transaction aggregation is considered and its effectiveness is evaluated against transaction-level detection, using a variety of classification methods and a realistic cost-based performance measure. These methods are applied in two case studies using real data. Transaction aggregation is found to be advantageous in many but not all circumstances. Also, the length of the aggregation period has a large impact upon performance. Aggregation seems particularly effective when a random forest is used for classification. Moreover, random forests were found to perform better than other classification methods, including SVMs, logistic regression and KNN. Aggregation also has the advantage of not requiring precisely labeled data and may be more robust to the effects of population drift.     

Unsupervised context detection using wireless signals

The sensing context plays an important role in many pervasive and mobile computing applications. Continuing from previous work [D. Phung, B. Adams, S. Venkatesh, Computable social patterns from sparse sensor data, in: Proceedings of First International Workshop on Location Web, World Wide Web Conference (WWW), New York, NY, USA, 2008, ACM 69–72.], we present an unsupervised framework for extracting user context in indoor environments with existing wireless infrastructures. Our novel approach casts context detection into an incremental, unsupervised clustering setting. Using WiFi observations consisting of access point identification and signal strengths freely available in office or public spaces, we adapt a density-based clustering technique to recover basic forms of user contexts that include user motion state and significant places the user visits from time to time. High-level user context, termed rhythms, comprising sequences of significant places are derived from the above low-level context by employing probabilistic clustering techniques, latent Dirichlet allocation and its n-gram temporal extension. These user contexts can enable a wide range of context-ware application services. Experimental results with real data in comparison with existing methods are presented to validate the proposed approach. Our motion classification algorithm operates in real-time, and achieves a 10% improvement over an existing method; significant locations are detected with over 90% accuracy and near perfect cluster purity. Richer indoor context and meaningful rhythms, such as typical daily routines or meeting patterns, are also inferred automatically from collected raw WiFi signals.     

Evaluating choice in universal access: an example from rehabilitation robotics

This paper describes a technique using dimensional analysis that so far has been rarely, if ever, used in studies of universal access. However, this procedure can produce a robust decision support process for inclusive designs. In this paper, it is applied to a case study of a wheelchair robot computer interface with choices in data input methods, addressing disparate requirements of different groups of intended users. The main underlying issue is to combine technical measurements, speed of operation and cost with subjective opinion. It turns out that Braglia’s method has greater robustness in determining rank compared to standard techniques. In this, case a simple switch was rated better than a mouse or voice operation for control.