SoroushVahidi/scidocs huggingface dataset:
Guidelines for usability testing with children
(1997)

A Although user-centered design is a well-supported concept in the literature on adult computer products, not until recently have publications begun to appear addressing the need to include the user in the design process of children's computer products. Good examples are a recent panel discussion in interactions on the importance of understanding the perspectives and needs of children, and the energizing work of Allison Druin and Cynthia Solomon [1, 2]. Growth has also occurred in evaluation research in both the industrial and academic communities, assessing the effectiveness or appeal of various types of (6 to 10 years), and middle-school-aged children (11 to 14 years). These age divisions are arbitrary , and many behaviors will overlap. In our experience, most children younger than 2 1/2 years of age are not proficient enough with standard input devices (e.g., mouse, trackball, or keyboard) to interact with the technology and provide useful data. Children older than 14 years of age will likely behave as adults in a testing situation and should be treated accordingly. Preschool (ages 2 to 5 years) Preschoolers require the most extensive adaptations of usability testing because their attention span, their motivation to please adults, and their ability to adjust to strange surroundings and new people may change from one moment to the next. In general, children in this age range should be allowed to explore the computer according to their own interests and pacing instead of performing a series of directed tasks. They will often be happy to show you what they know, and what they can do on the computer independently. When assessing appeal or engagement, testers will need to closely observe children's behavior such as sighing, smiling, or sliding under the table. Children this age often have difficulty expressing their likes and dislikes in words. Elementary School (ages 6 to 10 years) Children in this age range are relatively easy to include in software usability testing. Their experience in school makes them ready to sit at a task and follow directions from an adult, and they are generally not self-conscious about being observed as they play on the computer. They will answer questions and try new things with ease. In this age range, children will develop more sophistication about how they can describe the things they see and do. Six-and seven-year-old children will be more hands-on—ready to work on the computer but a little shy or inarticulate when …
4D Light Field Superpixel and Segmentation
(2017)

Superpixel segmentation of 2D image has been widely used in many computer vision tasks. However, limited to the Gaussian imaging principle, there is not a thorough segmentation solution to the ambiguity in defocus and occlusion boundary areas. In this paper, we consider the essential element of image pixel, i.e., rays in the light space and propose light field superpixel (LFSP) segmentation to eliminate the ambiguity. The LFSP is first defined mathematically and then a refocus-invariant metric named LFSP self-similarity is proposed to evaluate the segmentation performance. By building a clique system containing 80 neighbors in light field, a robust refocus-invariant LFSP segmentation algorithm is developed. Experimental results on both synthetic and real light field datasets demonstrate the advantages over the state-of-the-arts in terms of traditional evaluation metrics. Additionally the LFSP self-similarity evaluation under different light field refocus levels shows the refocus-invariance of the proposed algorithm.
Parameter Sharing Reinforcement Learning Architecture for Multi Agent Driving Behaviors
(2018)

Multi-agent learning provides a potential framework for learning and simulating traffic behaviors. This paper proposes a novel architecture to learn multiple driving behaviors in a traffic scenario. The proposed architecture can learn multiple behaviors independently as well as simultaneously. We take advantage of the homogeneity of agents and learn in a parameter sharing paradigm. To further speed up the training process asynchronous updates are employed into the architecture. While learning different behaviors simultaneously, the given framework was also able to learn cooperation between the agents, without any explicit communication. We applied this framework to learn two important behaviors in driving: 1) Lane-Keeping and 2) Over-Taking. Results indicate faster convergence and learning of a more generic behavior, that is scalable to any number of agents. When compared the results with existing approaches, our results indicate equal and even better performance in some cases.
HarmTrace : Automatic functional harmonic analysis
(2011)

Music scholars have been intensively studying tonal harmony for centuries, yielding numerous theories and models. Unfortunately, a large number of these theories are formulated in a rather informal fashion and lack mathematical precision. In this article we present HarmTrace, a functional model of Western tonal harmony, which builds on well-known theories of tonal harmony. In contrast to many other theories which remain purely theoretical, we present an implemented system that is evaluated empirically. Given a sequence of symbolic chord labels, HarmTrace automatically derives the harmonic relations between chords. For this, we use advanced functional programming techniques which are uniquely available in the Haskell programming language. We show that our system is fast, easy to modify and maintain, is robust against noisy data, and returns harmonic analyses that comply with Western tonal harmony theory.
Sequential Short-Text Classification with Recurrent and Convolutional Neural Networks
(2016)

Recent approaches based on artificial neural networks (ANNs) have shown promising results for short-text classification. However, many short texts occur in sequences (e.g., sentences in a document or utterances in a dialog), and most existing ANN-based systems do not leverage the preceding short texts when classifying a subsequent one. In this work, we present a model based on recurrent neural networks and convolutional neural networks that incorporates the preceding short texts. Our model achieves state-of-the-art results on three different datasets for dialog act prediction.
Snooping Keystrokes with mm-level Audio Ranging on a Single Phone
(2015)

This paper explores the limits of audio ranging on mobile devices in the context of a keystroke snooping scenario. Acoustic keystroke snooping is challenging because it requires distinguishing and labeling sounds generated by tens of keys in very close proximity. Existing work on acoustic keystroke recognition relies on training with labeled data, linguistic context, or multiple phones placed around a keyboard --- requirements that limit usefulness in an adversarial context. In this work, we show that mobile audio hardware advances can be exploited to discriminate mm-level position differences and that this makes it feasible to locate the origin of keystrokes from only a single phone behind the keyboard. The technique clusters keystrokes using time-difference of arrival measurements as well as acoustic features to identify multiple strokes of the same key. It then computes the origin of these sounds precise enough to identify and label each key. By locating keystrokes this technique avoids the need for labeled training data or linguistic context. Experiments with three types of keyboards and off-the-shelf smartphones demonstrate scenarios where our system can recover $94\%$ of keystrokes, which to our knowledge, is the first single-device technique that enables acoustic snooping of passwords.
On Best-Possible Obfuscation
(2007)

An obfuscator is a compiler that transforms any program (which we will view in this work as a boolean circuit) into an obfuscated program (also a circuit) that has the same input-output functionality as the original program, but is “unintelligible”. Obfuscation has applications for cryptography and for software protection. Barak et al. (CRYPTO 2001, pp. 1–18, 2001) initiated a theoretical study of obfuscation, which focused on black-box obfuscation, where the obfuscated circuit should leak no information except for its (black-box) input-output functionality. A family of functionalities that cannot be obfuscated was demonstrated. Subsequent research has showed further negative results as well as positive results for obfuscating very specific families of circuits, all with respect to black box obfuscation. This work is a study of a new notion of obfuscation, which we call best-possible obfuscation. Best possible obfuscation makes the relaxed requirement that the obfuscated program leaks as little information as any other program with the same functionality (and of similar size). In particular, this definition allows the program to leak information that cannot be obtained from a black box. Best-possible obfuscation guarantees that any information that is not hidden by the obfuscated program is also not hidden by any other similar-size program computing the same functionality, and thus the obfuscation is (literally) the best possible. In this work we study best-possible obfuscation and its relationship to previously studied definitions. Our main results are: (1) A separation between black-box and best-possible obfuscation. We show a natural obfuscation task that can be achieved under the best-possible definition, but cannot be achieved under the black-box definition. (2) A hardness result for best-possible obfuscation, showing that strong (information-theoretic) best-possible obfuscation implies a collapse in the Polynomial-Time Hierarchy. (3) An impossibility result for efficient best-possible (and black-box) obfuscation in the presence of random oracles. This impossibility result uses a random oracle to construct hard-to-obfuscate circuits, and thus it does not imply impossibility in the standard model.
Main-memory foreign key joins on advanced processors: design and re-evaluations for OLAP workloads
(2018)

The hash join algorithm family is one of the leading techniques for equi-join performance evaluation. OLAP systems borrow this line of research to efficiently implement foreign key joins between dimension tables and big fact tables. From data warehouse schema and workload feature perspective, the hash join algorithm can be further simplified with multidimensional mapping, and the foreign key join algorithms can be evaluated from multiple perspectives instead of single performance perspective. In this paper, we introduce the surrogate key index oriented foreign key join as schema-conscious and OLAP workload customized design foreign key join to comprehensively evaluate how state-of-the-art join algorithms perform in OLAP workloads. Our experiments and analysis gave the following insights: (1) customized foreign key join algorithm for OLAP workload can make join performance step forward than general-purpose hash joins; (2) each join algorithm shows strong and weak performance regions dominated by the cache locality ratio of input_size/cache_size with a fine-grained micro join benchmark; (3) the simple hardware-oblivious shared hash table join outperforms complex hardware-conscious radix partitioning hash join in most benchmark cases; (4) the customized foreign key join algorithm with surrogate key index simplified the algorithm complexity for hardware accelerators and make it easy to be implemented for different hardware accelerators. Overall, we argue that improving join performance is a systematic work opposite to merely hardware-conscious algorithm optimizations, and the OLAP domain knowledge enables surrogate key index to be effective for foreign key joins in data warehousing workloads for both CPU and hardware accelerators.
Electricity-producing bacterial communities in microbial fuel cells.
(2006)

Microbial fuel cells (MFCs) are not yet commercialized but they show great promise as a method of water treatment and as power sources for environmental sensors. The power produced by these systems is currently limited, primarily by high internal (ohmic) resistance. However, improvements in the system architecture will soon result in power generation that is dependent on the capabilities of the microorganisms. The bacterial communities that develop in these systems show great diversity, ranging from primarily delta-Proteobacteria that predominate in sediment MFCs to communities composed of alpha-, beta-, gamma- or delta-Proteobacteria, Firmicutes and uncharacterized clones in other types of MFCs. Much remains to be discovered about the physiology of these bacteria capable of exocellular electron transfer, collectively defined as a community of "exoelectrogens". Here, we review the microbial communities found in MFCs and the prospects for this emerging bioenergy technology.
A survey on ontology mapping
(2006)

Ontology is increasingly seen as a key factor for enabling interoperability across heterogeneous systems and semantic web applications. Ontology mapping is required for combining distributed and heterogeneous ontologies. Developing such ontology mapping has been a core issue of recent ontology research. This paper presents ontology mapping categories, describes the characteristics of each category, compares these characteristics, and surveys tools, systems, and related work based on each category of ontology mapping. We believe this paper provides readers with a comprehensive understanding of ontology mapping and points to various research topics about the specific roles of ontology mapping.
Radial-arrayed rotary electrification for high performance triboelectric generator.
(2014)

Harvesting mechanical energy is an important route in obtaining cost-effective, clean and sustainable electric energy. Here we report a two-dimensional planar-structured triboelectric generator on the basis of contact electrification. The radial arrays of micro-sized sectors on the contact surfaces enable a high output power of 1.5 W (area power density of 19 mW cm(-2)) at an efficiency of 24%. The triboelectric generator can effectively harness various ambient motions, including light wind, tap water flow and normal body movement. Through a power management circuit, a triboelectric-generator-based power-supplying system can provide a constant direct-current source for sustainably driving and charging commercial electronics, immediately demonstrating the feasibility of the triboelectric generator as a practical power source. Given exceptional power density, extremely low cost and unique applicability resulting from distinctive mechanism and structure, the triboelectric generator can be applied not only to self-powered electronics but also possibly to power generation at a large scale.
CATCH: A detecting algorithm for coalition attacks of hit inflation in internet advertising
(2011)

As the Internet flourishes, online advertising becomes essential for marketing campaigns for business applications. To perform a marketing campaign, advertisers provide their advertisements to Internet publishers and commissions are paid to the publishers of the advertisements based on the clicks made for the posted advertisements or the purchases of the products of which advertisements posted. Since the payment given to a publisher is proportional to the amount of clicks received for the advertisements posted by the publisher, dishonest publishers are motivated to inflate the number of clicks on the advertisements hosted on their web sites. Since the click frauds are critical for online advertising to be reliable, the online advertisers make the efforts to prevent them effectively. However, the methods used for click frauds are also becoming more complex and sophisticated. In this paper, we study the problem of detecting coalition attacks of click frauds. The coalition attacks of click fraud is one of the latest sophisticated techniques utilized for click frauds because the fraudsters can obtain not only more gain but also less probability of being detected by joining a coalition. We introduce new definitions for the coalition and propose the novel algorithm called CATCH to find such coalitions. Extensive experiments with synthetic and real-life data sets confirm that our notion of coalition allows us to detect coalitions much more effectively than that of
A Topic-based Reviewer Assignment System
(2015)

Peer reviewing is a widely accepted mechanism for assessing the quality of submitted articles to scientific conferences or journals. Conference management systems (CMS) are used by conference organizers to invite appropriate reviewers and assign them to submitted papers. Typical CMS rely on paper bids entered by the reviewers and apply simple matching algorithms to compute the paper assignment. In this paper, we demonstrate our Reviewer Assignment System (RAS), which has advanced features compared to broadly used CMSs. First, RAS automatically extracts the profiles of reviewers and submissions in the form of topic vectors. These profiles can be used to automatically assign reviewers to papers without relying on a bidding process, which can be tedious and error-prone. Second, besides supporting classic assignment models (e.g., stable marriage and optimal assignment), RAS includes a recently published assignment model by our research group, which maximizes, for each paper, the coverage of its topics by the profiles of its reviewers. The features of the demonstration include (1) automatic extraction of paper and reviewer profiles, (2) assignment computation by different models, and (3) visualization of the results by different models, in order to assess their effectiveness.
Smooth sensitivity and sampling in private data analysis
(2007)

We introduce a new, generic framework for private data analysis.The goal of private data analysis is to release aggregate information about a data set while protecting the privacy of the individuals whose information the data set contains.Our framework allows one to release functions f of the data withinstance-based additive noise. That is, the noise magnitude is determined not only by the function we want to release, but also bythe database itself. One of the challenges is to ensure that the noise magnitude does not leak information about the database. To address that, we calibrate the noise magnitude to the smoothsensitivity of f on the database x --- a measure of variabilityof f in the neighborhood of the instance x. The new frameworkgreatly expands the applicability of output perturbation, a technique for protecting individuals' privacy by adding a smallamount of random noise to the released statistics. To our knowledge, this is the first formal analysis of the effect of instance-basednoise in the context of data privacy.
 Our framework raises many interesting algorithmic questions. Namely,to apply the framework one must compute or approximate the smoothsensitivity of f on x. We show how to do this efficiently for several different functions, including the median and the cost ofthe minimum spanning tree. We also give a generic procedure based on sampling that allows one to release f(x) accurately on manydatabases x. This procedure is applicable even when no efficient algorithm for approximating smooth sensitivity of f is known orwhen f is given as a black box. We illustrate the procedure by applying it to k-SED (k-means) clustering and learning mixtures of Gaussians.
Dynamics and control of a 4-dof wearable cable-driven upper arm exoskeleton
(2009)

In this paper, we present the dynamics, control, and preliminary experiments on a wearable upper arm exoskeleton intended for human users with four degrees-of-freedom (dof), driven by six cables. The control of this cable-driven exoskeleton is complicated because the cables can transmit forces to the arm only under tension. The standard PD controllers or Computed torque controllers perform only moderately since the cables need to be in tension. Future efforts will seek to refine these control strategies and their implementations to improve functionality of a human user.
Household availability of ultra-processed foods and obesity in nineteen European countries.
(2018)

OBJECTIVE
To assess household availability of NOVA food groups in nineteen European countries and to analyse the association between availability of ultra-processed foods and prevalence of obesity.


DESIGN
Ecological, cross-sectional study.


SETTING
Europe.


SUBJECTS
Estimates of ultra-processed foods calculated from national household budget surveys conducted between 1991 and 2008. Estimates of obesity prevalence obtained from national surveys undertaken near the budget survey time.


RESULTS
Across the nineteen countries, median average household availability amounted to 33·9 % of total purchased dietary energy for unprocessed or minimally processed foods, 20·3 % for processed culinary ingredients, 19·6 % for processed foods and 26·4 % for ultra-processed foods. The average household availability of ultra-processed foods ranged from 10·2 % in Portugal and 13·4 % in Italy to 46·2 % in Germany and 50·4 % in the UK. A significant positive association was found between national household availability of ultra-processed foods and national prevalence of obesity among adults. After adjustment for national income, prevalence of physical inactivity, prevalence of smoking, measured or self-reported prevalence of obesity, and time lag between estimates on household food availability and obesity, each percentage point increase in the household availability of ultra-processed foods resulted in an increase of 0·25 percentage points in obesity prevalence.


CONCLUSIONS
The study contributes to a growing literature showing that the consumption of ultra-processed foods is associated with an increased risk of diet-related non-communicable diseases. Its findings reinforce the need for public policies and actions that promote consumption of unprocessed or minimally processed foods and make ultra-processed foods less available and affordable.
Variable Rate Image Compression with Recurrent Neural Networks
(2016)

Although image compression has been actively studied for decades, there has been relatively little research on learning to compress images with modern neural networks. Standard approaches, such as those employing patch-based autoencoders, have shown a great deal of promise but cannot compete with popular image codecs because they fail to address three questions: 1) how to effectively binarize activations: in the absence of binarization, a bottleneck layer alone tends not to lead to efficient compression; 2) how to achieve variable-rate encoding: a standard autoencoder generates a fixed-length code for each fixed-resolution input patch, resulting in the same cost for lowand high-entropy patches, and requiring the network to be completely retrained to achieve different compression rates; and 3) how to avoid block artifacts: patch-based approaches are prone to block discontinuities. We propose a general framework for variable-rate image compression and a novel architecture based on convolutional and deconvolutional recurrent networks, including LSTMs, that address these issues and report promising results compared to existing baseline codecs. We evaluate the proposed methods on a large-scale benchmark consisting of tiny images (32× 32), which proves to be very challenging for all the methods.