HTTP Digest, as specified in RFC 2617, is known to be vulnerable to man-in-the-middle attacks if the client fails to authenticate the server in TLS, or if the same passwords are used for authentication in some other context without TLS. This is a general problem that exists not just with HTTP Digest, but also with other IETF protocols that use tunneled authentication. This document specifies ve...

Scene-level Programming by Demonstration (PbD) is faced with an important challenge perceptual uncertainty. Addressing this problem, we present a scenelevel PbD paradigm that programs robots to perform goal-directed manipulation in unstructured environments with grounded perception. Scene estimation is enabled by our discriminatively-informed generative scene estimation method (DIGEST). Given s...

The fast capacity growth of cheap storage presents an ever-escalating problem for forensic investigations as currently employed forensic technologies are not designed to scale to the degree necessary to meet the challenge. In this work, we present an approach which seeks to scale up the process of finding related digital artifacts across large data sets by employing an advanced version of our s...

A computer algorithm for restriction-site mapping consists of a generator of partial maps and a consistency checker. This paper examines consistency checking and argues that a method based on separation theory extracts the maximum amount of information from fragment lengths in digest data. It results in the minimum number of false maps being generated.

The SpeI/DpnI map of the 5.9 Mb Pseudomonas aeruginosa PAO (DSM 1707) genome was refined by two-dimensional (2D) pulsed-field gel electrophoresis techniques (PFGE) which allow the complete and consistent physical mapping of any bacterial genome of interest. Single restriction digests were repetitively separated by PFGE employing different pulse times and ramps in order to detect all bands with ...