Query: Extended Tracking Powers: Measuring the Privacy Diffusion Enabled by Browser Extensions

Relevant passages:
The Web Never Forgets: Persistent Tracking Mechanisms in the Wild <=SEP=> We present the first large-scale studies of three advanced web tracking mechanisms - canvas fingerprinting, evercookies and use of "cookie syncing" in conjunction with evercookies. Canvas fingerprinting, a recently developed form of browser fingerprinting, has not previously been reported in the wild; our results show that over 5% of the top 100,000 websites employ it. We then present the first automated study of evercookies and respawning and the discovery of a new evercookie vector, IndexedDB. Turning to cookie syncing, we present novel techniques for detection and analysing ID flows and we quantify the amplification of privacy-intrusive tracking practices due to cookie syncing.
 Our evaluation of the defensive techniques used by privacy-aware users finds that there exist subtle pitfalls --- such as failing to clear state on multiple browsers at once - in which a single lapse in judgement can shatter privacy defenses. This suggests that even sophisticated users face great difficulties in evading tracking techniques.

Detecting and Defending Against Third-Party Tracking on the Web <=SEP=> While third-party tracking on the web has garnered much attention, its workings remain poorly understood. Our goal is to dissect how mainstream web tracking occurs in the wild. We develop a client-side method for detecting and classifying five kinds of third-party trackers based on how they manipulate browser state. We run our detection system while browsing the web and observe a rich ecosystem, with over 500 unique trackers in our measurements alone. We find that most commercial pages are tracked by multiple parties, trackers vary widely in their coverage with a small number being widely deployed, and many trackers exhibit a combination of tracking behaviors. Based on web search traces taken from AOL data, we estimate that several trackers can each capture more than 20% of a user’s browsing behavior. We further assess the impact of defenses on tracking and find that no existing browser mechanisms prevent tracking by social media sites via widgets while still allowing those widgets to achieve their utility goals, which leads us to develop a new defense. To the best of our knowledge, our work is the most complete study of web tracking to date.

Cookieless Monster: Exploring the Ecosystem of Web-Based Device Fingerprinting <=SEP=> The web has become an essential part of our society and is currently the main medium of information delivery. Billions of users browse the web on a daily basis, and there are single websites that have reached over one billion user accounts. In this environment, the ability to track users and their online habits can be very lucrative for advertising companies, yet very intrusive for the privacy of users. In this paper, we examine how web-based device fingerprinting currently works on the Internet. By analyzing the code of three popular browser-fingerprinting code providers, we reveal the techniques that allow websites to track users without the need of client-side identifiers. Among these techniques, we show how current commercial fingerprinting approaches use questionable practices, such as the circumvention of HTTP proxies to discover a user's real IP address and the installation of intrusive browser plugins. At the same time, we show how fragile the browser ecosystem is against fingerprinting through the use of novel browser-identifying techniques. With so many different vendors involved in browser development, we demonstrate how one can use diversions in the browsers' implementation to distinguish successfully not only the browser-family, but also specific major and minor versions. Browser extensions that help users spoof the user-agent of their browsers are also evaluated. We show that current commercial approaches can bypass the extensions, and, in addition, take advantage of their shortcomings by using them as additional fingerprinting features.

Understanding Malvertising Through Ad-Injecting Browser Extensions <=SEP=> Malvertising is a malicious activity that leverages advertising to distribute various forms of malware. Because advertising is the key revenue generator for numerous Internet companies, large ad networks, such as Google, Yahoo and Microsoft, invest a lot of effort to mitigate malicious ads from their ad networks. This drives adversaries to look for alternative methods to deploy malvertising. In this paper, we show that browser extensions that use ads as their monetization strategy often facilitate the deployment of malvertising. Moreover, while some extensions simply serve ads from ad networks that support malvertising, other extensions maliciously alter the content of visited webpages to force users into installing malware. To measure the extent of these behaviors we developed Expector, a system that automatically inspects and identifies browser extensions that inject ads, and then classifies these ads as malicious or benign based on their landing pages. Using Expector, we automatically inspected over 18,000 Chrome browser extensions. We found 292 extensions that inject ads, and detected 56 extensions that participate in malvertising using 16 different ad networks and with a total user base of 602,417.

Trends and Lessons from Three Years Fighting Malicious Extensions <=SEP=> In this work we expose wide-spread efforts by criminals to abuse the Chrome Web Store as a platform for distributing malicious extensions. A central component of our study is the design and implementation of WebEval, the first system that broadly identifies malicious extensions with a concrete, measurable detection rate of 96.5%. Over the last three years we detected 9,523 malicious extensions: nearly 10% of every extension submitted to the store. Despite a short window of operation—we removed 50% of malware within 25 minutes of creation— a handful of under 100 extensions escaped immediate detection and infected over 50 million Chrome users. Our results highlight that the extension abuse ecosystem is drastically different from malicious binaries: miscreants profit from web traffic and user tracking rather than email spam or banking theft.

Study of Lightning Surge Overvoltages at Substations Due to Direct Lightning Strokes to Phase Conductors <=SEP=> Accurate predictions of lightning surge overvoltages are essential to power equipment insulation design. Recent observations of lightning strokes to ultra-high-voltage designed transmission lines confirmed direct lightning strokes caused by shielding failure and found phenomena unexplainable by conventional shielding theories. However, there are few detailed studies of direct lightning surge overvoltages. This study assumed direct lightning stroke currents based on observational data and performs electromagnetic transient program analysis of the gas-insulated switchgear (GIS) and transformer overvoltages at substations to study the basic characteristics of overvoltages due to direct lightning strokes and evaluate lightning protection design. Consequently, the maximum GIS overvoltages were found during back-flashovers, and the locations of maximum overvoltages from direct lightning strokes and back-flashovers differ. Direct lightning strokes may be more severe than back-flashovers for transformers. This paper also studied the overvoltage generation mechanism and showed the relationship of the maximum voltage to lightning stroke current and transformer capacitance.

A ZigBee -wireless wearable remote physiological monitoring system <=SEP=> Wearable health monitoring systems use integrated sensors to monitor vital physiological parameters of the wearer. The paper discusses the preliminary results of a prototype wearable physiological monitoring system to monitor physiological parameters such as Electrocardiogram (ECG), Heart Rate (HR), Electroencephalogram (EEG) and Body Temperature. The ECG and EEG signals are acquired using a textile electrodes integrated into the fabric of the wearer. The acquired ECG and EEG signals are processed to remove noises and the parameters are extracted and trend analysis is carried out. The physiological parameters are monitored at the remote monitoring station using a ZigBee wireless communication.

A Fast Monte-Carlo Test for Primality <=SEP=> 

GISMO: a Graphical Interactive Student Monitoring Tool for Course Management Systems <=SEP=> This paper presents GISMO, a graphical interactive student monitoring and tracking system tool that extracts tracking data from an on-line course maintained with a Course Management System, and generates graphical representations that can be explored by course instructors to examine various aspects of distance students. GISMO uses techniques from Information Visualisation to render into an appropriate graphical manner the complex multidimensional student tracking data provided by the Course Management System. GISMO aims to help instructors to become aware of what is happening in their classes and provide a better support to their learners.

Mapping learning and game mechanics for serious games analysis <=SEP=> While there is a consensus on the instructional potential of Serious Games (SGs), there is still a lack of methodologies and tools not only for design but also to support analysis and assessment. Filling this gap is one of the main aims of the Games and Learning Alliance (GALA, www.galanoe.eu) European Network of Excellence on Serious Games (SGs), which has a focus upon pedagogy-driven SGs. This paper relies on the assumption that the fundamental aspect of SG design consists in the translation of learning goals/practices into mechanical element of game-play, serving to an instructional purpose beside that of play and fun. This paper proposes the Learning Mechanics-Game Mechanics (LM-GM) model, which supports SG analysis and design by allowing reflection on the various pedagogical and game elements in a SG. The LM-GM model includes a set of pre-defined game mechanics and pedagogical elements that we have abstracted from literature on game studies and learning theories. Designers and analysts can exploit these mechanics to draw the LM-GM map for a game, so as to identify and highlight its main pedagogical and entertainment features, and their interrelations. The tool may also be useful for teachers to evaluate the effectiveness of a given game and better understand how to implement it in educational settings. A case study is reported to illustrate the framework’s support in determining how game-play and pedagogy intertwine in a SG. Finally, the paper presents the results of two comparative user tests demonstrating the advantages of the proposed model with respect to a similar state-of-the-art framework.

Colyseus: A Distributed Architecture for Online Multiplayer Games <=SEP=> This paper presents the design, implementation, and evaluation of Colyseus, a distributed architecture for interactive multiplayer games. Colyseus takes advantage of a game’s tolerance for weakly consistent state and predictable workload to meet the tight latency constraints of game-play and maintain scalable communication costs. In addition, it provides a rich distributed query interface and effective pre-fetching subsystem to help locate and replicate objects before they are accessed at a node. We have implemented Colyseus and modified Quake II, a popular first person shooter game, to use it. Our measurements of Quake II and our own Colyseus-based game with hundreds of players shows that Colyseus effectively distributes game traffic across the participating nodes, allowing Colyseus to support low-latency game-play for an order of magnitude more players than existing single server designs, with similar per-node bandwidth costs.

AskWorld: Budget-Sensitive Query Evaluation for Knowledge-on-Demand <=SEP=> Recently, several Web-scale knowledge harvesting systems have been built, each of which is competent at extracting information from certain types of data (e.g., unstructured text, structured tables on the web, etc.). In order to determine the response to a new query posed to such systems (e.g., is sugar a healthy food?), it is useful to integrate opinions from multiple systems. If a response is desired within a specific time budget (e.g., in less than 2 seconds), then maybe only a subset of these resources can be queried. In this paper, we address the problem of knowledge integration for on-demand time-budgeted query answering. We propose a new method, AskWorld, which learns a policy that chooses which queries to send to which resources, by accommodating varying budget constraints that are available only at query (test) time. Through extensive experiments on real world datasets, we demonstrate AskWorld’s capability in selecting most informative resources to query within test-time constraints, resulting in improved performance compared to competitive baselines.

Model-free control <=SEP=> Model-free control” and the corresponding “intelligent” PID controllers (iPIDs), which already had many successful concrete applications, are presented here for the first time in an unified manner, where the new advances are taken into account. The basics of model-free control is now employing some old functional analysis and some elementary differential algebra. The estimation techniques become quite straightforward via a recent online parameter identification approach. The importance of iPIs and especially of iPs is deduced from the presence of friction. The strange industrial ubiquity of classic PID’s and the great difficulty for tuning them in complex situations is deduced, via an elementary sampling, from their connections with iPIDs. Several numerical simulations are presented which include some infinite-dimensional systems. They demonstrate not only the power of our intelligent controllers but also the great simplicity for tuning them.

A Distributed Test System Architecture for Open-source IoT Software <=SEP=> In this paper, we discuss challenges that are specific to testing of open IoT software systems. The analysis reveals gaps compared to wireless sensor networks as well as embedded software. We propose a testing framework which (a) supports continuous integration techniques, (b) allows for the integration of project contributors to volunteer hardware and software resources to the test system, and (c) can function as a permanent distributed plugtest for network interoperability testing. The focus of this paper lies in open-source IoT development but many aspects are also applicable to closed-source projects.

On Poisson Graphical Models <=SEP=> Undirected graphical models, such as Gaussian graphical models, Ising, and multinomial/categorical graphical models, are widely used in a variety of applications for modeling distributions over a large number of variables. These standard instances, however, are ill-suited to modeling count data, which are increasingly ubiquitous in big-data settings such as genomic sequencing data, user-ratings data, spatial incidence data, climate studies, and site visits. Existing classes of Poisson graphical models, which arise as the joint distributions that correspond to Poisson distributed node-conditional distributions, have a major drawback: they can only model negative conditional dependencies for reasons of normalizability given its infinite domain. In this paper, our objective is to modify the Poisson graphical model distribution so that it can capture a rich dependence structure between count-valued variables. We begin by discussing two strategies for truncating the Poisson distribution and show that only one of these leads to a valid joint distribution. While this model can accommodate a wider range of conditional dependencies, some limitations still remain. To address this, we investigate two additional novel variants of the Poisson distribution and their corresponding joint graphical model distributions. Our three novel approaches provide classes of Poisson-like graphical models that can capture both positive and negative conditional dependencies between count-valued variables. One can learn the graph structure of our models via penalized neighborhood selection, and we demonstrate the performance of our methods by learning simulated networks as well as a network from microRNA-sequencing data.

Different voltage-dependent thresholds for inducing long-term depression and long-term potentiation in slices of rat visual cortex <=SEP=> IN the hippocampus and neocortex, high-frequency (tetanic) stimu-lation of an afferent pathway leads to long-term potentiation (LTP) of synaptic transmission1–5. In the hippocampus it has recently been shown that long-term depression (LTD) of excitatory transmission can also be induced by certain combinations of synaptic activation6,7. In most hippocampal8 and all neocortical pathways4,9–11 studied so far, the induction of LTP requires the activation of JV-methyl-D-aspartate (NMDA) receptorgated conductances. Here we report that LTD can occur in neurons of slices of the rat visual cortex and that the same tetanic stimulation can induce either LTP or LTD depending on the level of depolarization of the postsynaptic neuron. By applying intracellular current injections or pharmacological disinhibition to modify the depolarizing response of the postsynaptic neuron to tetanic stimulation, we show that the mechanisms of induction of LTD and LTP are both postsynaptic. LTD is obtained if postsynaptic depolarization exceeds a critical level but remains below a threshold related to NMDA receptorgated conductances, whereas LTP is induced if this second threshold is reached.

Identifying adverse drug events from patient social media: A case study for diabetes <=SEP=> Patient social media sites have emerged as major platforms for discussion of treatments and drug side effects, making them a promising source for listening to patients' voices in adverse drug event reporting. However, extracting patient reports from social media continues to be a challenge in health informatics research. In light of the need for more robust extraction methods, the authors developed a novel information extraction framework for identifying adverse drug events from patient social media. They also conducted a case study on a major diabetes patient social media platform to evaluate their framework's performance. Their approach achieves an f-measure of 86 percent in recognizing discussion of medical events and treatments, an f-measure of 69 percent for identifying adverse drug events, and an f-measure of 84 percent in patient report extraction. Their proposed methods significantly outperformed prior work in extracting patient reports of adverse drug events in health social media.

Slip detection and prediction in human walking using only wearable inertial measurement units (IMUs) <=SEP=> Slip and fall is one of the major causes for human injuries for elders and professional workers. Real-time detection and prediction of the foot slip is critical for developing effective assistive and rehabilitation devices to prevent falls and train balance disorder patients. This paper presents a novel real-time slip detection and prediction scheme with wearable inertial measurement units (IMUs). The slip-detection algorithm is built on a new dynamic model for bipedal walking with slips. An extended Kalman filter is designed to reliably predict the foot slip displacement using the wearable IMU measurements and kinematic constraints. The proposed slip detection and prediction scheme has been demonstrated by extensive experiments.

Graphite: Iterative Generative Modeling of Graphs <=SEP=> Graphs are a fundamental abstraction for modeling relational data. However, graphs are discrete and combinatorial in nature, and learning representations suitable for machine learning tasks poses statistical and computational challenges. In this work, we propose Graphite an algorithmic framework for unsupervised learning of representations over nodes in a graph using deep latent variable generative models. Our model is based on variational autoencoders (VAE), and uses graph neural networks for parameterizing both the generative model (i.e., decoder) and inference model (i.e., encoder). The use of graph neural networks directly incorporates inductive biases due to the spatial, local structure of graphs directly in the generative model. We draw novel connections of our framework with approximate inference via kernel embeddings. Empirically, Graphite outperforms competing approaches for the tasks of density estimation, link prediction, and node classification on synthetic and benchmark datasets.

Personalized Dialogue Generation with Diversified Traits <=SEP=> Endowing a dialogue system with particular personality traits is essential to deliver more human-like conversations. However, due to the challenge of embodying personality via language expression and the lack of large-scale persona-labeled dialogue data, this research problem is still far from well-studied. In this paper, we investigate the problem of incorporating explicit personality traits in dialogue generation to deliver personalized dialogues. To this end, firstly, we construct PersonalDialog, a large-scale multi-turn dialogue dataset containing various traits from a large number of speakers. The dataset consists of 20.83M sessions and 56.25M utterances from 8.47M speakers. Each utterance is associated with a speaker who is marked with traits like Age, Gender, Location, Interest Tags, etc. Several anonymization schemes are designed to protect the privacy of each speaker. This large-scale dataset will facilitate not only the study of personalized dialogue generation, but also other researches on sociolinguistics or social science. Secondly, to study how personality traits can be captured and addressed in dialogue generation, we propose persona-aware dialogue generation models within the sequence to sequence learning framework. Explicit personality traits (structured by key-value pairs) are embedded using a trait fusion module. During the decoding process, two techniques, namely persona-aware attention and persona-aware bias, are devised to capture and address trait-related information. Experiments demonstrate that our model is able to address proper traits in different contexts. Case studies also show interesting results for this challenging research problem.

Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches <=SEP=> 

Realizing underwater communication through magnetic induction <=SEP=> The majority of the work on underwater communication has mainly been based on acoustic communication. Acoustic communication faces many known problems, such as high propagation delays, very low data rates, and highly environment-dependent channel behavior. In this article, to address these shortcomings, magnetic induction is introduced as a possible communication paradigm for underwater applications. Accordingly, all research challenges in this regard are explained. Fundamentally different from the conventional underwater communication paradigm, which relies on EM, acoustic, or optical waves, the underwater MI communications rely on the time varying magnetic field to covey information between the transmitting and receiving parties. MI-based underwater communications exhibit several unique and promising features such as negligible signal propagation delay, predictable and constant channel behavior, sufficiently long communication range with high bandwidth, as well as silent and stealth underwater operations. To fully utilize the promising features of underwater MI-based communications, this article introduces the fundamentals of underwater MI communications, including the MI channel models, MI networking protocols design, and MI-based underwater localization.

Integrating Configuration Management with Model-driven Cloud Management based on TOSCA <=SEP=> The paradigm of Cloud computing introduces new approaches to manage IT services going beyond concepts originating in traditional IT service management. The main goal is to automate the whole management of services to reduce costs and to make management tasks less error-prone. Two different service management paradigms are used in practice: configuration management and model-driven Cloud management. The latter one aims to be a holistic management approach for services in the Cloud. However, both management paradigms are originating in different backgrounds, thus model-driven Cloud management does not cover all aspects of configuration management that are key for Cloud services. This paper presents approaches for integrating configuration management with model-driven Cloud management and how they can be realized based on the OASIS Topology and Orchestration Specification for Cloud Applications and Chef, a popular configuration management tool. These approaches enable the creation of holistic and highly portable service models.

The BeiHang Keystroke Dynamics Authentication System <=SEP=> Keystroke Dynamics is an important biometric solution for person authentication. Based upon keystroke dynamics, this paper designs an embedded password protection device, develops an online system, collects two public databases for promoting the research on keystroke authentication, exploits the Gabor filter bank to characterize keystroke dynamics, and provides benchmark results of three popular classification algorithms, one-class support vector machine, Gaussian classifier, and nearest neighbour classifier.

Google Web 1T 5-Grams Made Easy (but not for the computer) <=SEP=> This paper introduces Web1T5-Easy, a simple indexing solution that allows interactive searches of the Web 1T 5-gram database and a derived database of quasi-collocations. The latter is validated against co-occurrence data from the BNC and ukWaC on the automatic identification of non-compositional VPC.

A Face in any Form: New Challenges and Opportunities for Face Recognition Technology <=SEP=> Despite new technologies that make face detection and recognition more sophisticated, long-recognized problems in security, privacy, and accuracy persist. Refining this technology and introducing it into new domains will require solving these problems through focused interdisciplinary efforts among developers, researchers, and policymakers.

Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems <=SEP=> Nearly all of the currently used and well-tested signature schemes (e.g. RSA or DSA) are based either on the factoring assumption or the presumed intractability of the discrete logarithm problem. Further algorithmic advances on these problems may lead to the unpleasant situation that a large number of schemes have to be replaced with alternatives. In this work we present such an alternative – a signature scheme whose security is derived from the hardness of lattice problems. It is based on recent theoretical advances in lattice-based cryptography and is highly optimized for practicability and use in embedded systems. The public and secret keys are roughly 12000 and 2000 bits long, while the signature size is approximately 9000 bits for a security level of around 100 bits. The implementation results on reconfigurable hardware (Spartan/Virtex 6) are very promising and show that the scheme is scalable, has low area consumption, and even outperforms some classical schemes.

A new primary power regulation method for contactless power transfer <=SEP=> This paper presents a new power regulation method for contactless power transfer systems that combines current magnitude control of a series tuned resonant converter with energy injection concepts suitable for constant load or single pick-up applications. In the latter, the control of the primary converter operates with asymmetrical control, to regulate the magnitude of the high frequency primary track current according to the load requirement of the secondary power pickup. The feedback control algorithm is developed by monitoring the output voltage of the secondary power pickup. Switching losses and EMI are reduced due to the ZCS (Zero Current Switching) operation of the converter. Simulation and experimental results show that the primary converter has a fast and smooth start-up transient response, and the magnitudes of the primary current and the output voltage of a secondary power pickup are both fully controllable against load variations.

Clustering Web pages based on their structure <=SEP=> Several techniques have been recently proposed to automatically generate Web wrappers, i.e., programs that extract data from HTML pages, and transform them into a more structured format, typically in XML. These techniques automatically induce a wrapper from a set of sample pages that share a common HTML template. An open issue, however, is how to collect suitable classes of sample pages to feed the wrapper inducer. Presently, the pages are chosen manually. In this paper, we tackle the problem of automatically discovering the main classes of pages offered by a site by exploring only a small yet representative portion of it. We propose a model to describe abstract structural features of HTML pages. Based on this model, we have developed an algorithm that accepts the URL of an entry point to a target Web site, visits a limited yet representative number of pages, and produces an accurate clustering of pages based on their structure. We have developed a prototype, which has been used to perform experiments on real-life Web sites. 2004 Elsevier B.V. All rights reserved.

Characterizing gene sets using discriminative random walks with restart on heterogeneous biological networks <=SEP=> MOTIVATION
Analysis of co-expressed gene sets typically involves testing for enrichment of different annotations or 'properties' such as biological processes, pathways, transcription factor binding sites, etc., one property at a time. This common approach ignores any known relationships among the properties or the genes themselves. It is believed that known biological relationships among genes and their many properties may be exploited to more accurately reveal commonalities of a gene set. Previous work has sought to achieve this by building biological networks that combine multiple types of gene-gene or gene-property relationships, and performing network analysis to identify other genes and properties most relevant to a given gene set. Most existing network-based approaches for recognizing genes or annotations relevant to a given gene set collapse information about different properties to simplify (homogenize) the networks.


RESULTS
We present a network-based method for ranking genes or properties related to a given gene set. Such related genes or properties are identified from among the nodes of a large, heterogeneous network of biological information. Our method involves a random walk with restarts, performed on an initial network with multiple node and edge types that preserve more of the original, specific property information than current methods that operate on homogeneous networks. In this first stage of our algorithm, we find the properties that are the most relevant to the given gene set and extract a subnetwork of the original network, comprising only these relevant properties. We then re-rank genes by their similarity to the given gene set, based on a second random walk with restarts, performed on the above subnetwork. We demonstrate the effectiveness of this algorithm for ranking genes related to Drosophila embryonic development and aggressive responses in the brains of social animals.


AVAILABILITY AND IMPLEMENTATION
DRaWR was implemented as an R package available at veda.cs.illinois.edu/DRaWR.


CONTACT
blatti@illinois.edu


SUPPLEMENTARY INFORMATION
Supplementary data are available at Bioinformatics online.