Minimizing information disclosure to third parties in social login platforms

Over the past few years, a large and ever increasing number of Web sites have incorporated one or more social login platforms and have encouraged users to log in with their Facebook, Twitter, Google, or other social networking identities. Research results suggest that more than two million Web sites have already adopted Facebook’s social login platform, and the number is increasing sharply. Although one might theoretically refrain from such social login features and cross-site interactions, usage statistics show that more than 250 million people might not fully realize the privacy implications of opting-in. To make matters worse, certain Web sites do not offer even the minimum of their functionality unless users meet their demands for information and social interaction. At the same time, in a large number of cases, it is unclear why these sites require all that personal information for their purposes. In this paper, we mitigate this problem by designing and developing a framework for minimum information disclosure in social login interactions with third-party sites. Our example case is Facebook, which combines a very popular single sign-on platform with information-rich social networking profiles. Whenever users want to browse to a Web site that requires authentication or social interaction using a Facebook identity, our system employs, by default, a Facebook session that reveals the minimum amount of information necessary. Users have the option to explicitly elevate that Facebook session in a manner that reveals more or all of the information tied to their social identity. This enables users to disclose the minimum possible amount of personal information during their browsing experience on third-party Web sites.     

Efficient Dynamic Constraints for Animating Articulated Figures

This paper presents an efficient dynamics-based computer animation system for simulating and controlling the motion of articulated figures. A non-trivial extension of Featherstone's O(n) recursive forward dynamics algorithm is derived which allows enforcing one or more constraints on the animated figures. We demonstrate how the constraint force evaluation algorithm we have developed makes it possible to simulate collisions between articulated figures, to compute the results of impulsive forces, to enforce joint limits, to model closed kinematic loops, and to robustly control motion at interactive rates. Particular care has been taken to make the algorithm not only fast, but also easy to implement and use. To better illustrate how the constraint force evaluation algorithm works, we provide pseudocode for its major components. Additionally, we analyze its computational complexity and finally we present examples demonstrating how our system has been used to generate interactive, physically correct complex motion with small user effort.     

On scaling the IEEE 802.11 to facilitate scalable wireless networks

The IEEE 802.11 MAC protocol has gained widespread popularity and has been adopted as the de-facto layer 2 protocol for wireless local area networks (WLANs). However, it is well known that as the number of competing stations increases, the performance of the protocol degrades dramatically. Given the explosive growth in WLANs’ usage, the question of how to sustain each user’s perceived performance when a large number of competing stations are present, is an important and challenging open research problem.Motivated by this, in this paper we analyze the behavior of 802.11-based WLANs as the number of competing stations increases, and attempt to provide concrete answers to the following fundamental questions: (i) is there a set of system and protocol parameters that we can scale in order to sustain each individual user’s perceived performance, and (ii) what is the minimum scaling factor?Using theoretical analysis coupled with extensive simulations we show that such a set of parameters exists, and that the minimum scaling factor is equal to the factor by which the number of users increases. Our results reveal several important scaling properties that exist in today’s 802.11-based wireless networks, and set guidelines for designing future versions of such networks that can efficiently support a very large number of users.     

UX Curve: A method for evaluating long-term user experience

The goal of user experience design in industry is to improve customer satisfaction and loyalty through the utility, ease of use, and pleasure provided in the interaction with a product. So far, user experience studies have mostly focused on short-term evaluations and consequently on aspects relating to the initial adoption of new product designs. Nevertheless, the relationship between the user and the product evolves over long periods of time and the relevance of prolonged use for market success has been recently highlighted. In this paper, we argue for the cost-effective elicitation of longitudinal user experience data. We propose a method called the “UX Curve” which aims at assisting users in retrospectively reporting how and why their experience with a product has changed over time. The usefulness of the UX Curve method was assessed in a qualitative study with 20 mobile phone users. In particular, we investigated how users’ specific memories of their experiences with their mobile phones guide their behavior and their willingness to recommend the product to others. The results suggest that the UX Curve method enables users and researchers to determine the quality of long-term user experience and the influences that improve user experience over time or cause it to deteriorate. The method provided rich qualitative data and we found that an improving trend of perceived attractiveness of mobile phones was related to user satisfaction and willingness to recommend their phone to friends. This highlights that sustaining perceived attractiveness can be a differentiating factor in the user acceptance of personal interactive products such as mobile phones. The study suggests that the proposed method can be used as a straightforward tool for understanding the reasons why user experience improves or worsens in long-term product use and how these reasons relate to customer loyalty.     

A comprehensive solution for application‐level adaptation

Driven by the emergence of mobile and pervasive computing there is a growing demand for context‐aware software systems that can dynamically adapt to their run‐time environment. We present the results of project MADAM that has delivered a comprehensive solution for the development and operation of context‐aware, self‐adaptive applications. The main contributions of MADAM are (a) a sophisticated middleware that supports the dynamic adaptation of component‐based applications, and (b) an innovative model‐driven development methodology that is based on abstract adaptation models and corresponding model‐to‐code transformations. MADAM has demonstrated the viability of a general, integrated approach to application‐level adaptation. We discuss our experiences with two real‐world case studies that were built using the MADAM approach. Copyright © 2008 John Wiley & Sons, Ltd.     

Shadowing Dynamic Scenes with Arbitrary BRDFs

We present a real-time relighting and shadowing method for dynamic scenes with varying lighting, view and BRDFs. Our approach is based on a compact representation of reflectance data that allows for changing the BRDF at run-time and a data-driven method for accurately synthesizing self-shadows on articulated and deformable geometries. Unlike previous self-shadowing approaches, we do not rely on local blocking heuristics. We do not fit a model to the BRDF-weighted visibility, but rather only to the visibility that changes during animation. In this manner, our model is more compact than previous techniques and requires less computation both during fitting and at run-time. Our reflectance product operators can re-integrate arbitrary low-frequency view-dependent BRDF effects on-the-fly and are compatible with all previous dynamic visibility generation techniques as well as our own data-driven visibility model. We apply our reflectance product operators to three different visibility generation models, and our data-driven model can achieve framerates well over 300Hz.     

Wear identification in rotor-bearing systems by measurements of dynamic bearing characteristics

During operation of rotating machines, journal and bearing mechanisms are progressively worn down. To prevent catastrophic failure of a rotating system, it is necessary both to detect wear precisely, without shutting down and dismantling the machinery and to predict future replacement needs. In this work, Computational Fluid Dynamics (CFD) analysis is used to solve the Navier–Stokes equations. Diagrams of bearing characteristics such as relative eccentricity, attitude angle, lubricant side flow and friction coefficient versus Sommerfeld number are presented for various wear depths and used for online wear identification. A graphical detection method is analytically presented to identify the wear depth associated with the measured dynamic bearing characteristics.     

Graphs of linear clique-width at most 3

A graph has linear clique-width at most k if it has a clique-width expression using at most k labels such that every disjoint union operation has an operand which is a single vertex graph. We give the first characterisation of graphs of linear clique-width at most 3, and we give the first polynomial-time recognition algorithm for graphs of linear clique-width at most 3. In addition, we present new characterisations of graphs of linear clique-width at most 2. We also give a layout characterisation of graphs of bounded linear clique-width; a similar characterisation was independently shown by Gurski and by Lozin and Rautenbach.