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.     

Online learning and fusion of orientation appearance models for robust rigid object tracking

We introduce a robust framework for learning and fusing of orientation appearance models based on both texture and depth information for rigid object tracking. Our framework fuses data obtained from a standard visual camera and dense depth maps obtained by low-cost consumer depth cameras such as the Kinect. To combine these two completely different modalities, we propose to use features that do not depend on the data representation: angles. More specifically, our framework combines image gradient orientations as extracted from intensity images with the directions of surface normals computed from dense depth fields. We propose to capture the correlations between the obtained orientation appearance models using a fusion approach motivated by the original Active Appearance Models (AAMs). To incorporate these features in a learning framework, we use a robust kernel based on the Euler representation of angles which does not require off-line training, and can be efficiently implemented online. The robustness of learning from orientation appearance models is presented both theoretically and experimentally in this work. This kernel enables us to cope with gross measurement errors, missing data as well as other typical problems such as illumination changes and occlusions. By combining the proposed models with a particle filter, the proposed framework was used for performing 2D plus 3D rigid object tracking, achieving robust performance in very difficult tracking scenarios including extreme pose variations.     

Enzymatic degradation of thermoresponsive poly(N‐isopropylacrylamide) grafted to carboxymethylcellulose copolymers

The enzymatic degradation of poly(N‐isopropyl acrylamide) (PNIPAM) grafted to carboxymethylcellulose (CMC) copolymers with a cellulasic preparation (Trichoderma viride) was studied. The enzymatic activity of the cellulasic preparation against CMC and the grafted copolymers was determined by the Petterson–Porath method, while their reduced viscosity variation in the presence of the same preparation was also followed. It has been shown that the enzymatic degradation behavior depends on the copolymer composition and the reaction temperature. Reducing sugars analysis showed that the experimental values for the grafted copolymers were higher than the calculated ones. At 50°C, the enzymatic reaction is completed in about 20 min for the copolymers, whereas for CMC it takes more than 40 min. It can be concluded that their enzymatic degradation is facilitated by the presence of the PNIPAM grafts. © 2002 Wiley Periodicals, Inc. J Appl Polym Sci 87: 1383–1386, 2003     

Hand dexterity assessment based on mouse pointer trajectory measurements in children with learning disabilities

Universal Access in the Information Society - We present an investigation of the systematic differences in upper limb motor skills between children with learning disabilities (LDs) and children...     

Speed Scaling for Maximum Lateness

We consider the power-aware problem of scheduling non-preemptively a set of jobs on a single speed-scalable processor so as to minimize the maximum lateness, under a given budget of energy. In the offline setting, our main contribution is a combinatorial polynomial time algorithm for the case in which the jobs have common release dates. In the presence of arbitrary release dates, we show that the problem becomes strongly \(\mathcal {N}\mathcal {P}\)-hard. Moreover, we show that there is no O(1)-competitive deterministic algorithm for the online setting in which the jobs arrive over time. Then, we turn our attention to an aggregated variant of the problem, where the objective is to find a schedule minimizing a linear combination of maximum lateness and energy. As we show, our results for the budget variant can be adapted to derive a similar polynomial time algorithm and an \(\mathcal {N}\mathcal {P}\)-hardness proof for the aggregated variant in the offline setting, with common and arbitrary release dates respectively. More interestingly, for the online case, we propose a 2-competitive algorithm.     

New facets of mobile botnet: architecture and evaluation

It is without a doubt that botnets pose a growing threat to the Internet, with DDoS attacks of any kind carried out by botnets to be on the rise. Nowadays, botmasters rely on advanced Command and Control (C&C) infrastructures to achieve their goals and most importantly to remain undetected. This work introduces two novel botnet architectures that consist only of mobile devices and evaluates both their impact in terms of DNS amplification and TCP flooding attacks, and their cost pertaining to the maintenance of the C&C channel. The first one puts forward the idea of using a continually changing mobile HTTP proxy in front of the botherder, while the other capitalizes on DNS protocol as a covert channel for coordinating the botnet. That is, for the latter, the messages exchanged among the bots and the herder appear as legitimate DNS transactions. Also, a third architecture is described and assessed, which is basically an optimized variation of the first one. Namely, it utilizes a mixed layout where all the attacking bots are mobile, but the proxy machines are typical PCs not involved in the actual attack. For the DNS amplification attack, which is by nature more powerful, we report an amplification factor that fluctuates between 32.7 and 34.1. Also, regarding the imposed C&C cost, we assert that it is minimal (about 0.25 Mbps) per bot in the worst case happening momentarily when the bot learns about the parameters of the attack.     

The contribution of proteomics towards deciphering the enigma of Coxiella burnetii

Coxiella burnetii, the causative agent of Q fever, is an intracellular bacterium and a potential weapon for bioterrorism. The widespread throughout the world, zoonosis is manifested clinically as a self-limited febrile illness, as pneumonia (acute Q fever) or as a chronic illness with endocarditis being its major complication. The recent Netherlands Q fever outbreak has driven the bacterium from a relatively cryptic, underappreciated, “niche” microorganism on the sideline of bacteriology, to one of possibly great impact on public health. Advances in the study of this microorganism proceeded slowly, primarily due to the, until recently, obligatory intracellular nature of the pathogen that in its virulent phase I must be manipulated under biosafety level-3 conditions. Proteomic studies, in particular, have generated a vast amount of information concerning several aspects of the bacterium such as virulence factors, detection/diagnostic and immunogenic biomarkers, inter-/intraspecies variation, resistance to antibiotics, and secreted effector proteins with significant clinical impact. The phenomenon observed following the genomics era, that of generation and accumulation of huge amount of data that ultimately end up unexploited on several databases, begins to emerge in the proteomics field as well. This review will focus on the advances in the field of C. burnetii proteomics through MS, attempting in parallel to utilize some of the proteomics findings by suggesting future directions for the improvement of Q fever diagnosis and therapy.     

Data access in distributed simulations of multi-agent systems

Distributed simulation has emerged as an important instrument for studying large-scale complex systems. Such systems inherently consist of a large number of components, which operate in a large shared state space interacting with it in highly dynamic and unpredictable ways. Optimising access to the shared state space is crucial for achieving efficient simulation executions. Data accesses may take two forms: locating data according to a set of attribute value ranges (range query) or locating a particular state variable from the given identifier (ID query and update). This paper proposes two alternative routing approaches, namely the address-based approach, which locates data according to their address information, and the range-based approach, whose operation is based on looking up attribute value range information along the paths to the destinations. The two algorithms are discussed and analysed in the context of PDES-MAS, a framework for the distributed simulation of multi-agent systems, which uses a hierarchical infrastructure to manage the shared state space. The paper introduces a generic meta-simulation framework which is used to perform a quantitative comparative analysis of the proposed algorithms under various circumstances.