Learn More
Many clustering and segmentation algorithms both suffer from the limitation that the number of clusters/segments are specified by a human user. It is often impractical to expect a human with sufficient domain knowledge to be available to select the number of clusters/segments to return. In this paper, we investigate techniques to determine the number of(More)
Dynamic Time Warping (DTW) has a quadratic time and space complexity that limits its use to small time series. In this paper we introduce FastDTW, an approximation of DTW that has a linear time and space complexity. FastDTW uses a multilevel approach that recursively projects a solution from a coarser resolution and refines the projected solution. We prove(More)
BACKGROUND Excessive use of the Internet has been associated with attention deficit hyperactivity disorder (ADHD), but the relationship between video games and ADHD symptoms in adolescents is unknown. METHOD A survey of adolescents and parents (n = 72 adolescents, 72 parents) was performed assessing daily time spent on the Internet, television, console(More)
In this paper we investigate machine learning techniques for discovering knowledge that can be used to monitor the operation of devices or systems. Specifically, we study methods for generating models that can detect anomalies in time series data. The normal operation of a device can usually be characterized in different temporal states. To identify these(More)
The normal operation of a device can be characterized in different temporal states. To identify these states, we introduce a segmentation algorithm called Gecko that can determine a reasonable number of segments using our proposed L method. We then use the RIPPER classification algorithm to describe these states in logical rules. Finally, transitional logic(More)
Several vulnerabilities of single-photon detectors have recently been exploited to compromise the security of quantum-key-distribution (QKD) systems. In this Letter, we report the first proof-of-principle implementation of a new quantum-key-distribution protocol that is immune to any such attack. More precisely, we demonstrated this new approach to QKD in(More)
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to locate these objects from names or attributes. And on large-scale grids, these should be scalable and be able to support range queries and multi-criteria searching. Trie-based(More)