nils-herrmann/clean_scirepeval huggingface dataset:
Learning High-Level Judgments of Urban Perception

Human observers make a variety of perceptual inferences about pictures of places based on prior knowledge and experience. In this paper we apply computational vision techniques to the task of predicting the perceptual characteristics of places by leveraging recent work on visual features along with a geo-tagged dataset of images associated with crowd-sourced urban perception judgments for wealth, uniqueness, and safety. We perform extensive evaluations of our models, training and testing on images of the same city as well as training and testing on images of different cities to demonstrate generalizability. In addition, we collect a new densely sampled dataset of streetview images for 4 cities and explore joint models to collectively predict perceptual judgments at city scale. Finally, we show that our predictions correlate well with ground truth statistics of wealth and crime.
Explicit reference modeling methodology in parametric CAD system

Today parametric associative CAD systems must help companies to create more efficient virtual development processes. While dealing with complex parts (e.g. the number of surfaces of the solid) no CAD modeling methodology is existing. Based on the analysis of industrial designers’ practices as well as student practices on CAD, we identified key factors that lead to better performance. Our objective in this article is to propose a practical method for complex parts modeling in parametric CAD system. An illustration of the performances and the results obtained by this method are presented comparing the traditional method with the proposed one while using an academic case and then an industrial case.
Android Permissions Remystified: A Field Study on Contextual Integrity

Due to the amount of data that smartphone applications can potentially access, platforms enforce permission systems that allow users to regulate how applications access protected resources. If users are asked to make security decisions too frequently and in benign situations, they may become habituated and approve all future requests without regard for the consequences. If they are asked to make too few security decisions, they may become concerned that the platform is revealing too much sensitive information. To explore this tradeoff, we instrumented the Android platform to collect data regarding how often and under what circumstances smartphone applications are accessing protected resources regulated by permissions. We performed a 36-person field study to explore the notion of “contextual integrity,” that is, how often are applications accessing protected resources when users are not expecting it? Based on our collection of 27 million data points and exit interviews with participants, we examine the situations in which users would like the ability to deny applications access to protected resources. We found out that at least 80% of our participants would have preferred to prevent at least one permission request, and overall, they thought that over a third of requests were invasive and desired a mechanism to block them.
Lineage tracing for general data warehouse transformations

Data warehousing systems integrate information from operational data sources into a central repository to enable analysis and mining of the integrated information. During the integration process, source data typically undergoes a series of transformations, which may vary from simple algebraic operations or aggregations to complex “data cleansing” procedures. In a warehousing environment, the data lineage problem is that of tracing warehouse data items back to the original source items from which they were derived. We formally define the lineage tracing problem in the presence of general data warehouse transformations, and we present algorithms for lineage tracing in this environment. Our tracing procedures take advantage of known structure or properties of transformations when present, but also work in the absence of such information. Our results can be used as the basis for a lineage tracing tool in a general warehousing setting, and also can guide the design of data warehouses that enable efficient lineage tracing.
Potential Forensic Analysis of IoT Data: An Overview of the State-of-the-Art and Future Possibilities

Academics and practicing digital forensics experts have previously proposed several models for tackling the end to end procedure of investigating IoT devices. However, these approaches are still very high level or focuses on one specific evidence collection technique. There is not, as yet, a comprehensive enumeration of classes of forensic data collected by IoT devices, nor even a comprehensive list of techniques for extracting specific forensic information from specific IoT devices. This paper addresses these issues by describing the potential forensic information that can be gathered, derived, or inferred from IoT-collected data. We also present an overview of existing IoT data collection methods for the Amazon Echo, Z-wave protocol, and home routers to illustrate the types of forensic data already being collected and the techniques used to obtain it. Finally, we present possible avenues for additional mechanisms for obtaining forensic data from these devices.
CampusSense — A smart vehicle parking monitoring and management system using ANPR cameras and android phones

Vehicle parking monitoring and management has become a big challenge for educational institutions with increasing enrollments, high percentage of vehicle ownership and decreasing parking supply which in result triggering blockage of vehicle, congestion, wastage of time and money. In university campuses particularly in Kingdom of Saudi Arabia, vehicle parking monitoring and management problem is getting worse and more frustrating due to the fact that majority of students, faculty and staff members own cars and drive through them to the university campuses. These common problems include finding out people (evidence) who are responsible for the damages (hitting, scraping, scratching and dents) to other cars and the blockage of car due to wrong car parking which takes much time to locate the owner of the car. Moreover, locating or forgetting their car park location another difficulty that is often faced by the students, faculty and staff members. The existing cameras located at the parking lots are only for video surveillance and cannot help in such situations as there is a lack of proper vehicle parking monitoring and management system. To cope with above mentioned problems and to ensure a better parking experience by accommodating increasing number of vehicles in a proper convenient manner, we propose a smart vehicle parking monitoring and management system called CampusSense. In CampusSense, Automatic Number Plate Recognition (ANPR) cameras and android based mobile application is developed to efficiently monitor, manage and protect the parking facilities at university campuses. Parking problems around the university campus faced by the students, faculty and staff members are analyzed by conducting a survey.
Integration of an On-line Kaldi Speech Recogniser to the Alex Dialogue Systems Framework

This paper describes the integration of an on-line Kaldi speech recogniser into the Alex Dialogue Systems Framework (ADSF). As the Kaldi OnlineLatgenRecogniser is written in C++, we first developed a Python wrapper for the recogniser so that the ADSF, written in Python, could interface with it. Training scripts for acoustic and language modelling were developed and integrated into ADSF, and acoustic and language models were build. Finally, optimal recogniser parameters were determined and evaluated. The dialogue system Alex with the new speech recogniser is evaluated on Public Transport Information (PTI) domain.
Towards Conversational Recommender Systems

People often ask others for restaurant recommendations as a way to discover new dining experiences. This makes restaurant recommendation an exciting scenario for recommender systems and has led to substantial research in this area. However, most such systems behave very differently from a human when asked for a recommendation. The goal of this paper is to begin to reduce this gap. In particular, humans can quickly establish preferences when asked to make a recommendation for someone they do not know. We address this cold-start recommendation problem in an online learning setting. We develop a preference elicitation framework to identify which questions to ask a new user to quickly learn their preferences. Taking advantage of latent structure in the recommendation space using a probabilistic latent factor model, our experiments with both synthetic and real world data compare different types of feedback and question selection strategies. We find that our framework can make very effective use of online user feedback, improving personalized recommendations over a static model by 25% after asking only 2 questions. Our results demonstrate dramatic benefits of starting from offline embeddings, and highlight the benefit of bandit-based explore-exploit strategies in this setting.
Sparse Gaussian Processes for Multi-task Learning

Multi-task learning models using Gaussian processes (GP) have been developed and successfully applied in various applications. The main difficulty with this approach is the computational cost of inference using the union of examples from all tasks. Therefore sparse solutions, that avoid using the entire data directly and instead use a set of informative “representatives” are desirable. The paper investigates this problem for the grouped mixed-effect GP model where each individual response is given by a fixed-effect, taken from one of a set of unknown groups, plus a random individual effect function that captures variations among individuals. Such models have been widely used in previous work but no sparse solutions have been developed. The paper presents the first sparse solution for such problems, showing how the sparse approximation can be obtained by maximizing a variational lower bound on the marginal likelihood, generalizing ideas from single-task Gaussian processes to handle the mixed-effect model as well as grouping. Experiments using artificial and real data validate the approach showing that it can recover the performance of inference with the full sample, that it outperforms baseline methods, and that it outperforms state of the art sparse solutions for other multi-task GP formulations.
Automatically Producing Plot Unit Representations for Narrative Text

In the 1980s, plot units were proposed as a conceptual knowledge structure for representing and summarizing narrative stories. Our research explores whether current NLP technology can be used to automatically produce plot unit representations for narrative text. We create a system called AESOP that exploits a variety of existing resources to identify affect states and applies “projection rules” to map the affect states onto the characters in a story. We also use corpus-based techniques to generate a new type of affect knowledge base: verbs that impart positive or negative states onto their patients (e.g., being eaten is an undesirable state, but being fed is a desirable state). We harvest these “patient polarity verbs” from a Web corpus using two techniques: co-occurrence with Evil/Kind Agent patterns, and bootstrapping over conjunctions of verbs. We evaluate the plot unit representations produced by our system on a small collection of Aesop’s fables.
Enabling Self-Service BI on Document Stores

The growing use of document stores has resulted in vast amounts of semi-structured data holding precious information, which could be profitably integrated into existing BI systems. Unfortunately, due to their schemaless nature, document stores are hardly accessible via direct OLAP querying. In this paper we propose an interactive, schema-on-read approach for finding multidimensional structures in document stores aimed at enabling OLAP querying in the context of self-service BI. Our approach works in three steps: multidimensional enrichment, querying, and OLAP enabling; the validation of user queries and the detection of multidimensional structures is based on the mining of approximate functional dependencies from data. The efficiency of our approach is discussed with reference to real datasets. CCS Concepts •Information systems Ñ Data warehouses; •Applied computing Ñ Business intelligence;
A Comparison of Algorithms for Maximum Entropy Parameter Estimation

Conditional maximum entropy (ME) models provide a general purpose machine learning technique which has been successfully applied to fields as diverse as computer vision and econometrics, and which is used for a wide variety of classification problems in natural language processing. However, the flexibility of ME models is not without cost. While parameter estimation for ME models is conceptually straightforward, in practice ME models for typical natural language tasks are very large, and may well contain many thousands of free parameters. In this paper, we consider a number of algorithms for estimating the parameters of ME models, including iterative scaling, gradient ascent, conjugate gradient, and variable metric methods. Surprisingly, the standardly used iterative scaling algorithms perform quite poorly in comparison to the others, and for all of the test problems, a limitedmemory variable metric algorithm outperformed the other choices.
Static test case prioritization using topic models

Software development teams use test suites to test changes to their source code. In many situations, the test suites are so large that executing every test for every source code change is infeasible, due to time and resource constraints. Development teams need to prioritize their test suite so that as many distinct faults as possible are detected early in the execution of the test suite. We consider the problem of static black-box test case prioritization (TCP), where test suites are prioritized without the availability of the source code of the system under test (SUT). We propose a new static black-box TCP technique that represents test cases using a previously unused data source in the test suite: the linguistic data of the test cases, i.e., their identifier names, comments, and string literals. Our technique applies a text analysis algorithm called topic modeling to the linguistic data to approximate the functionality of each test case, allowing our technique to give high priority to test cases that test different functionalities of the SUT. We compare our proposed technique with existing static black-box TCP techniques in a case study of multiple real-world open source systems: several versions of Apache Ant and Apache Derby. We find that our static black-box TCP technique outperforms existing static black-box TCP techniques, and has comparable or better performance than two existing execution-based TCP techniques. Static black-box TCP methods are widely applicable because the only input they require is the source code of the test cases themselves. This contrasts with other TCP techniques which require access to the SUT runtime behavior, to the SUT specification models, or to the SUT source code.
Passage retrieval vs. document retrieval for factoid question answering

Question answering (QA) systems often contain an information retrieval subsystem that identifies documents or passages where the answer to a question might appear [1–3, 5, 6, 10]. The QA system generates queries from the questions and submits them to the IR subsystem. The IR subsystem returns the top-ranked documents or passages, and the QA system selects the answers from them. In many QA systems, the IR component retrieves entire documents. Then, in a post-retrieval step, the system scans the retrieved documents and locates groups of sentences that contain most or all of the question keywords [3,10, and others]. These sentences are subjected to further analysis to select the answer. In other QA systems, a passage-retrieval technique is employed to directly identify locations within the document collection where the answer might be found, avoiding the post-retrieval step [1, 2, 5, 6, and others]. In this context, a “relevant” document or passage is one that contains an answer. We utilize this notion of relevance to evaluate an IR subsystem in isolation from the rest of its QA system by applying standard measures of IR effectiveness. By restricting our evaluation to a single subsystem we hope to gain experience that is applicable to QA systems beyond our own. An assumption inherent in this approach is that improved precision in the IR subsystem will translate to improved performance of the QA system as a whole. This assumption holds for our own system, and should (at least) hold for any system that exploits redundancy—that takes advantage of the observation that answers tend to occur in more than one retrieved passage [1, 2, 5]. In this paper we compare a successful passage-retrieval method [1, 5] with a well-known and effective documentretrieval method: Okapi BM25 [7]. Our goal is to examine
Error control and concealment for video communication: a review

The problem of error control and concealment in video communication is becoming increasingly important because of the growing interest in video delivery over unreliable channels such as wireless networks and the Internet. This paper reviews the techniques that have been developed for error control and concealment in the past ten to fifteen years. These techniques are described in three categories according to the roles that the encoder and decoder play in the underlying approaches. Forward error concealment includes methods that add redundancy at the source end to enhance error resilience of the coded bit streams. Error concealment by postprocessing refers to operations at the decoder to recover the damaged areas based on characteristics of image and video signals. Finally, interactive error concealment covers techniques that are dependent on a dialog between the source and destination. Both current research activities and practice in international standards are covered.
Home Bias in Online Investments: An Empirical Study of an Online Crowdfunding Market

An extensive literature in economics and finance has documented " home bias, " the tendency that transactions are more likely to occur between parties in the same country or state, rather than outside. Can the Internet help overcome this spatial divide, especially in the context of online financial investments? We address this question in the context of a large online crowd funding marketplace. We analyze detailed transaction data over an extended period of time under typical market conditions, as well as those from a natural experiment, a period in which investors were restricted to only one state due to regulations. We further employ a quasi-experimental design by tracking borrowers who moved across state boundaries, and study how investors' behaviors change when those borrowers moved. Home bias appears to be a robust phenomenon under all three scenarios. This finding has important implications not just for the home bias literature, but also more broadly for the growing research and policy interest on Internet-based crowd funding, especially as a new channel for entrepreneurial financing.
The Dangers of Replication and a Solution

Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up: a ten-fold increase in nodes and traffic gives a thousand fold increase in deadlocks or reconciliations. Master copy replication (primary copy) schemes reduce this problem. A simple analytic model demonstrates these results. A new two-tier replication algorithm is proposed that allows mobile (disconnected) applications to propose tentative update transactions that are later applied to a master copy. Commutative update transactions avoid the instability of other replication schemes.
Visualizing and Understanding Convolutional Networks

Large Convolutional Network models have recently demonstrated impressive classification performance on the ImageNet benchmark (Krizhevsky et al., 2012). However there is no clear understanding of why they perform so well, or how they might be improved. In this paper we address both issues. We introduce a novel visualization technique that gives insight into the function of intermediate feature layers and the operation of the classifier. Used in a diagnostic role, these visualizations allow us to find model architectures that outperform Krizhevsky et al. on the ImageNet classification benchmark. We also perform an ablation study to discover the performance contribution from different model layers. We show our ImageNet model generalizes well to other datasets: when the softmax classifier is retrained, it convincingly beats the current state-of-the-art results on Caltech-101 and Caltech-256 datasets.
Wireless Telemedicine Systems : An Overview

Rapid advances in information technology and telecommunications and, more specifically, wireless and mobile CO~mUnications and their convergence (“telematics”) are leading to the emergence of a new type of information infrastructure that has the potential of supporting an array of advanced services for healthcare. The objective of this paper is to provide a snapshot of the applications of wireless telemedicine systems. A brief review of the spectrum of these applications and the potential benefits of these efforts will be presented, followed by successful case studies in electronic patient record, emergency telemedicine, teleradiology, and home monitoring. It is anticipated that the progress carried out in these efforts and the potential benefits of emerging mobile technologies will trigger the development of more applications, thus enabling the offering of a better service to the citizen.
Sieve: Cryptographically Enforced Access Control for User Data in Untrusted Clouds

Modern web services rob users of low-level control over cloud storage; a user’s single logical data set is scattered across multiple storage silos whose access controls are set by the web services, not users. The result is that users lack the ultimate authority to determine how their data is shared with other web services. In this thesis, we introduce Sieve, a new architecture for selectively exposing user data to third party web services in a provably secure manner. Sieve starts with a user-centric storage model: each user uploads encrypted data to a single cloud store, and by default, only the user knows the decryption keys. Given this storage model, Sieve defines an infrastructure to support rich, legacy web applications. Using attribute-based encryption, Sieve allows users to define intuitive, understandable access policies that are cryptographically enforceable. Using key homomorphism, Sieve can re-encrypt user data on storage providers in situ, revoking decryption keys from web services without revealing new ones to the storage provider. Using secret sharing and two-factor authentication, Sieve protects against the loss of user devices like smartphones and laptops. The result is that users can enjoy rich, legacy web applications, while benefitting from cryptographically strong controls over what data the services can access.  Nickolai Zeldovich Title: Associate Professor Thesis Supervisor: James Mickens Title: Associate Professor