We describe a framework and methodology for managing the privacy policy of an enterprise, including creation (based on factors like legislation and consumer preferences), validation and verification, deployment and enforcement, and compliance testing for business processes and software. To evaluate this approach, one module of our framework (compliance testing) is implemented for an existing prominent electronic commerce software application. Our unique approach monitors the personal information sent and received by the software application and converts it to a standardized representation. At defined points in the electronic commerce workflow, the transmissions are compared to a set of privacy rules (extracted from a privacy policy) to ascertain compliance. Non-compliant transmissions of personal information are labeled `potential privacy infractions' and are reported. Though presently implemented for software testing, ultimately the methodology is intended to halt or alter a workflow to avoid privacy infractions.

Business Intelligence (BI) has proven to be a competitive advantage for organizations, allowing them to better measure, manage, and optimize their operations. It has provided the means to improve data-driven decision making and to harmonize an organization's strategy with its everyday operations. The early success of BI arose in providing a semantic-level access to heterogeneous data sources beyond organizations' information technology departments. Retrospective and predictive analytical components have since increased the value of BI to the organizations. In this talk, we will discuss success factors and influences for BI that have arisen by making information available across an organization and will open a discussion on some of the near-term and long-term BI challenges.

Technology may be able to play a role in improving the quality of life for Alzheimer's patients and their caregivers. We are evaluating the feasibility of an information appliance with the goal of alleviating repetitive questioning behaviour, a contributing factor to caregiver stress. Interviews were conducted with persons with Alzheimer's disease and their caregivers to determine the nature of the repetitive questioning behaviour, the information needs of patients, and the interaction abilities of both the patients and the caregivers. We report results of these interviews and discuss the challenges of requirements gathering with persons with Alzheimer's disease and the feasibility of introducing an information appliance to this population.

Dialog Table is a shared interface where you use hand gestures to discover a museum's collection. Several people can gather around and together explore the table's movies, narratives and 3D journeys. The table provides an opportunity for people to discuss with each other their thoughts on what they have seen. Several teen beta-testers said they wanted their desk at home to work just like the table. The table can work in situations as varied as hospital kiosks, conference rooms, collaborative design stations, game rooms, bedrooms...Dialog Table was commissioned by the Walker Art Center through an international design competition to promote social interactions among visitors, to provide access to the Walker's multidisciplinary collections, and to facilitate learning about art. The table was designed by Marek Walczak, an artist and architect, Michael McAllister, an industrial designer and Jakub Segen, a leader in recognition systems. http://dialogtable.com.

No abstract available.

In the plane, the post-office problem, which asks for the closest site to a query site, and retraction motion planning, which asks for a one-dimensional retract of the free space of a robot, are both classically solved by computing a Voronoi diagram. When the sites are k disjoint convex sets, we give a compact representation of the Voronoi diagram, using O(k) line segments, that is sufficient for logarithmic time post-office location queries and motion planning. If these sets are polygons with n total vertices, we compute this diagram optimally in O(klog n) deterministic time for the Euclidean metric and in O(klog nlog m) deterministic time for the convex distance function defined by a convex m-gon.>