nils-herrmann/clean_scirepeval huggingface dataset:
Principles of remote attestation

Remote attestation is the activity of making a claim about properties of a target by supplying evidence to an appraiser over a network. We identify five central principles to guide development of attestation systems. We argue that (i) attestation must be able to deliver temporally fresh evidence; (ii) comprehensive information about the target should be accessible; (iii) the target, or its owner, should be able to constrain disclosure of information about the target; (iv) attestation claims should have explicit semantics to allow decisions to be derived from several claims; and (v) the underlying attestation mechanism must be trustworthy. We illustrate how to acquire evidence from a running system, and how to transport it via protocols to remote appraisers. We propose an architecture for attestation guided by these principles. Virtualized platforms, which are increasingly well supported on stock hardware, provide a natural basis for our attestation architecture.
Dynamic programming algorithm optimization for spoken word recognition

This paper reports on an optimum dynamic programming (DP) based time-normalization algorithm for spoken word recognition. First, a general principle of time-normalization i s given using timewarping function. Then, two time-normalized distance definitions, d e d symmetric and asymmetric forms, are derived from the principle. These two forms are compared with each other through theoretical discussions and experimental studies. The symmetric form algorithm superiority is established. A new technique, called slope constraint, is successfully introduced, in which the warping function slope is restricted so as to improve discrimination between words in different categories. The effective slope constraint characteristic is qualitatively analyzed, and the optimum slope constraint condition is determined through experiments. The optimized algorithm is then extensively subjected to experimentat comparison with various DP-algorithms, previously applied to spoken word recognition by different research groups. The experiment shows that the present algorithm gives no more than about twothirds errors, even compared to the best conventional algorithm.
Connectivity-based garbage collection

We introduce a new family of connectivity-based garbage collectors (Cbgc) that are based on potential object-connectivity properties. The key feature of these collectors is that the placement of objects into partitions is determined by performing one of several forms of connectivity analyses on the program. This enables partial garbage collections, as in generational collectors, but without the need for any write barrier.The contributions of this paper are 1) a novel family of garbage collection algorithms based on object connectivity; 2) a detailed description of an instance of this family; and 3) an empirical evaluation of Cbgc using simulations. Simulations help explore a broad range of possibilities for Cbgc, ranging from simplistic ones that determine connectivity based on type information to oracular ones that use run-time information to determine connectivity. Our experiments with the oracular Cbgc configurations give an indication of the potential for Cbgc and also identify weaknesses in the realistic configurations. We found that even the simplistic implementations beat state-of-the-art generational collectors with respect to some metrics (pause times and memory footprint).
Synthetic Data for Text Localisation in Natural Images

In this paper we introduce a new method for text detection in natural images. The method comprises two contributions: First, a fast and scalable engine to generate synthetic images of text in clutter. This engine overlays synthetic text to existing background images in a natural way, accounting for the local 3D scene geometry. Second, we use the synthetic images to train a Fully-Convolutional Regression Network (FCRN) which efficiently performs text detection and bounding-box regression at all locations and multiple scales in an image. We discuss the relation of FCRN to the recently-introduced YOLO detector, as well as other end-to-end object detection systems based on deep learning. The resulting detection network significantly out performs current methods for text detection in natural images, achieving an F-measure of 84.2% on the standard ICDAR 2013 benchmark. Furthermore, it can process 15 images per second on a GPU.
Community Evaluation and Exchange of Word Vectors at wordvectors.org

Vector space word representations are useful for many natural language processing applications. The diversity of techniques for computing vector representations and the large number of evaluation benchmarks makes reliable comparison a tedious task both for researchers developing new vector space models and for those wishing to use them. We present a website and suite of offline tools that that facilitate evaluation of word vectors on standard lexical semantics benchmarks and permit exchange and archival by users who wish to find good vectors for their applications. The system is accessible at: www.wordvectors.org.
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism

Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query graph, from a large set of graphs. Considering the problem of testing subgraph isomorphism is generally NP-hard, most of the existing techniques are based on the framework of filtering-and-verification to reduce the precise computation costs; consequently various novel feature-based indexes have been developed. While the existing techniques work well for small query graphs, the verification phase becomes a bottleneck when the query graph size increases. Motivated by this, in the paper we firstly propose a novel and efficient algorithm for testing subgraph isomorphism, QuickSI. Secondly, we develop a new feature-based index technique to accommodate QuickSI in the filtering phase. Our extensive experiments on real and synthetic data demonstrate the efficiency and scalability of the proposed techniques, which significantly improve the existing techniques.
Analysis of the Veracities of Industry Used Software Development Life Cycle Methodologies

Currently, software industries are using different SDLC (software development life cycle) models which are designed for specific purposes. The use of technology is booming in every perspective of life and the software behind the technology plays an enormous role. As the technical complexities are increasing, successful development of software solely depends on the proper management of development processes. So, it is inevitable to introduce improved methodologies in the industry so that modern human centred software applications development can be managed and delivered to the user successfully. So, in this paper, we have explored the facts of different SDLC models and perform their comparative analysis. Software Development Life Cycle; Plan Driven Model; Agile Model; Development Environment; Industry Success
Fraud : The Affinity of Classification Techniques to Insurance Fraud Detection

Quite a large number of data mining techniques employed in financial fraud detection (FFD) are seen to be classification techniques. In this paper, we developed an algorithm to find the features of classification techniques (or method) that so much place it (classification techniques) in the heart of researchers in their various efforts in the study of insurance frauds detection. We also got to know the characteristics of insurance frauds data that made data mining classification techniques so much attracted to it (insurance data).
Exploring the relationship between knowledge management practices and innovation performance

The process of innovation depends heavily on knowledge, and the management of knowledge and human capital should be an essential element of running any type of business. Recent research indicates that organisations are not consistent in their approach to knowledge management (KM), with KM approaches being driven predominantly within an information technology (IT) or humanist framework, with little if any overlap. This paper explores the relationship between KM approaches and innovation performance through a preliminary study focusing on the manufacturing industry. The most significant implication that has emerged from the study is that managers in manufacturing firms should place more emphasis on human resource management (HRM) practices when developing innovation strategies for product and process innovations. The study shows that KM contributes to innovation performance when a simultaneous approach of “soft HRM practices” and “hard IT practices” are implemented.
Magnetic Optimization Algorithms a new synthesis

A novel optimization algorithm is proposed here that is inspired by the principles of magnetic field theory. In the proposed Magnetic Optimization Algorithm (MOA) the possible solutions are magnetic particles scattered in the search space. Each magnetic particle has a measure of mass and magnetic field according to its fitness. The fitter magnetic particles are those with higher magnetic field and higher mass. These particles are located in a lattice-like environment and apply a force of attraction to their neighbors. The proposed cellular structure allows a better exploitation of local neighborhoods before they move towards the global best, hence it increases population diversity. Experimental results on 14 numerical benchmark functions show that MOA in some benchmark functions can work better than GA and PSO.
A First Look at Quality of Mobile Live Streaming Experience: the Case of Periscope

Live multimedia streaming from mobile devices is rapidly gaining popularity but little is known about the QoE they provide. In this paper, we examine the Periscope service. We first crawl the service in order to understand its usage patterns. Then, we study the protocols used, the typical quality of experience indicators, such as playback smoothness and latency, video quality, and the energy consumption of the Android application.
ETCF: An Ensemble Model for CTR Prediction

Online advertising has attracted lots of attention in both academic and industrial domains. Among many realworld advertising systems, click through rate (CTR) prediction plays a central role. With a large volume of user history log and given its various features, it is quite a challenge to fully extract the meaningful information inside that amount of data. What's more, for many machine learning models, in order to achieve the best performance of the CTR prediction, a lot of hyper-parameters need to be tuned, which often costs plenty of time. In this paper, we propose an ensemble model named ETCF, which cascades GBDT with gcForest to tackle the practical problems of CTR prediction and do not need much hyper-parameter tuning work to realize its best performance. Experimental results validate the effective prediction power of ETCF against classical baseline models, and the superiority of GBDT transformed features.
Fast trajectory clustering using Hashing methods

There has been an explosion in the usage of trajectory data. Clustering is one of the simplest and most powerful approaches for knowledge discovery from trajectories. In order to produce meaningful clusters, well-defined metrics are required to capture the essence of similarity between trajectories. One such distance function is Dynamic Time Warping (DTW), which aligns two trajectories together in order to determine similarity. DTW has been widely accepted as a very good distance measure for trajectory data. However, trajectory clustering is very expensive due to the complexity of the similarity functions, for example, DTW has a high computational cost O(n2), where n is the average length of the trajectory, which makes the clustering process very expensive. In this paper, we propose the use of hashing techniques based on Distance-Based Hashing (DBH) and Locality Sensitive Hashing (LSH) to produce approximate clusters and speed up the clustering process.
AsterixDB: A Scalable, Open Source BDMS

AsterixDB is a new, full-function BDMS (Big Data Management System) with a feature set that distinguishes it from other platforms in today’s open source Big Data ecosystem. Its features make it well-suited to applications like web data warehousing, social data storage and analysis, and other use cases related to Big Data. AsterixDB has a flexible NoSQL style data model; a query language that supports a wide range of queries; a scalable runtime; partitioned, LSM-based data storage and indexing (including B-tree, R-tree, and text indexes); support for external as well as natively stored data; a rich set of built-in types; support for fuzzy, spatial, and temporal types and queries; a built-in notion of data feeds for ingestion of data; and transaction support akin to that of a NoSQL store. Development of AsterixDB began in 2009 and led to a mid2013 initial open source release. This paper is the first complete description of the resulting open source AsterixDB system. Covered herein are the system’s data model, its query language, and its software architecture. Also included are a summary of the current status of the project and a first glimpse into how AsterixDB performs when compared to alternative technologies, including a parallel relational DBMS, a popular NoSQL store, and a popular Hadoop-based SQL data analytics platform, for things that both technologies can do. Also included is a brief description of some initial trials that the system has undergone and the lessons learned (and plans laid) based on those early ”customer” engagements.
Tracking Sentiment in Mail: How Genders Differ on Emotional Axes

With the widespread use of email, we now have access to unprecedented amounts of text that we ourselves have written. In this paper, we show how sentiment analysis can be used in tandem with effective visualizations to quantify and track emotions in many types of mail. We create a large word–emotion association lexicon by crowdsourcing, and use it to compare emotions in love letters, hate mail, and suicide notes. We show that there are marked differences across genders in how they use emotion words in work-place email. For example, women use many words from the joy–sadness axis, whereas men prefer terms from the fear–trust axis. Finally, we show visualizations that can help people track emotions in their emails.
Review of statistical shape spaces for 3D data with comparative analysis for human faces

With systems for acquiring 3D surface data being evermore commonplace, it has become important to reliably extract specific shapes from the acquired data. In the presence of noise and occlusions, this can be done through the use of statistical shape models, which are learned from databases of clean examples of the shape in question. In this paper, we review, analyze and compare different statistical models: from those that analyze the variation in geometry globally to those that analyze the variation in geometry locally. We first review how different types of models have been used in the literature, then proceed to define the models and analyze them theoretically, in terms of both their statistical and computational aspects. We then perform extensive experimental comparison on the task of model fitting, and give intuition about which type of model is better for a few applications. Due to the wide availability of databases of high-quality data, we use the human face as the specific shape we wish to extract from corrupted data.
Airborne Communication Networks: A Survey

Owing to the explosive growth of requirements of rapid emergency communication response and accurate observation services, airborne communication networks (ACNs) have received much attention from both industry and academia. ACNs are subject to heterogeneous networks that are engineered to utilize satellites, high-altitude platforms (HAPs), and low-altitude platforms (LAPs) to build communication access platforms. Compared to terrestrial wireless networks, ACNs are characterized by frequently changed network topologies and more vulnerable communication connections. Furthermore, ACNs have the demand for the seamless integration of heterogeneous networks such that the network quality-of-service (QoS) can be improved. Thus, designing mechanisms and protocols for ACNs poses many challenges. To solve these challenges, extensive research has been conducted. The objective of this special issue is to disseminate the contributions in the field of ACNs. To present this special issue with the necessary background and offer an overall view of this field, three key areas of ACNs are covered. Specifically, this paper covers LAP-based communication networks, HAP-based communication networks, and integrated ACNs. For each area, this paper addresses the particular issues and reviews major mechanisms. This paper also points out future research directions and challenges.
Robust control of uncertain Markov Decision Processes with temporal logic specifications

We present a method for designing a robust control policy for an uncertain system subject to temporal logic specifications. The system is modeled as a finite Markov Decision Process (MDP) whose transition probabilities are not exactly known but are known to belong to a given uncertainty set. A robust control policy is generated for the MDP that maximizes the worst-case probability of satisfying the specification over all transition probabilities in this uncertainty set. To this end, we use a procedure from probabilistic model checking to combine the system model with an automaton representing the specification. This new MDP is then transformed into an equivalent form that satisfies assumptions for stochastic shortest path dynamic programming. A robust version of dynamic programming solves for a ε-suboptimal robust control policy with time complexity O(log1/ε) times that for the non-robust case.
Uncovering individual and collective human dynamics from mobile phone records

Novel aspects of human dynamics and social interactions are investigated by means of mobile phone data. Using extensive phone records resolved in both time and space, we study the mean collective behavior at large scales and focus on the occurrence of anomalous events. We discuss how these spatiotemporal anomalies can be described using standard percolation theory tools. We also investigate patterns of calling activity at the individual level and show that the interevent time of consecutive calls is heavy-tailed. This finding, which has implications for dynamics of spreading phenomena in social networks, agrees with results previously reported on other human activities.
Fuzzy sets and fuzzy logic - theory and applications

fuzzy sets and fuzzy logic theory and applications fuzzy set theory-and its applications, fourth edition fuzzy sets and fuzzy logic theory and applications fuzzy intersection, theory and applications fuzzy sets and fuzzy logic theory and applications pdf free fuzzy set theory helsingin yliopisto applications fuzzy sets and approximate reasoning introduction to fuzzy sets and fuzzy logic fuzzy logic and fuzzy sets link.springer fuzzy sets theory and applications springer fuzzy sets fuzzy logic fuzzy methods with applications fuzzy sets and systems theory and applications mathematics book review: 'fuzzy sets and fuzzy logic theory and fs i: fuzzy sets and fuzzy logic Óbudai egyetem fuzzy sets and fuzzy logic theory and applications 11 fuzzy logic freie universität applications of fuzzy sets theory gbv fuzzy sets and fuzzy logic theory and applications fuzzy set theory and its applications ajkp fuzzy logic and its application in technical systems fuzzy sets and fuzzy logic: theory and applications pdf introduction higher intellect ma3033 fuzzy logic – theory and applications oscar castillo and patricia melin type-2 fuzzy logic musical applications of fuzzy logic artsites.ucsc fundamentals of fuzzy sets and fuzzy logic uic engineering fuzzy sets and fuzzy logic theory and applications fuzzy systems for control applications geoder~ application of fuzzy sets in soil science: fuzzy fuzzy sets and fuzzy logic: theory and applications ebooks type 2 fuzzy logic theory and applications studies in references for type-2 fuzzy sets and fuzzy logic systems fuzzy logic systems: origin, concepts, and trends introduction to fuzzy logic control with application to lecture 23 fuzzy logic: fuzzy set theory introduction to fuzzy logic franck dernoncourt fuzzy sets and systems theory and applications ptfl fuzzy logic, soft computing, and applications introduction to fuzzy logic university of niš a discussion of the applications of fuzzy sets to game control application using fuzzy logic: design of a fuzzy introduction to fuzzy set theory and fuzzy logic
ACCessory: password inference using accelerometers on smartphones

We show that accelerometer readings are a powerful side channel that can be used to extract entire sequences of entered text on a smart-phone touchscreen keyboard. This possibility is a concern for two main reasons. First, unauthorized access to one's keystrokes is a serious invasion of privacy as consumers increasingly use smartphones for sensitive transactions. Second, unlike many other sensors found on smartphones, the accelerometer does not require special privileges to access on current smartphone OSes. We show that accelerometer measurements can be used to extract 6-character passwords in as few as 4.5 trials (median).
A precision variable-supply CMOS comparator

Several new techniques are presented for the design of precision CMOS voltage comparator circuits which operate over a wide range of supply voltages. Since most monolithic A/D converter systems contain an on-chip voltage reference, techniques have been developed to replicate the reference voltage in order to provide stable supply-independent DC bias voltages, and controlled internal voltage swings for the comparator. These techniques are necessary in order to eliminate harmful bootstrapping effects which can potentially occur in all AC coupled MOS analog circuits. An actively controlled biasing scheme has been developed to allow for differentially autozeroing the comparator for applications in differential A/D converter systems. A general approach for selecting the gain in AC-coupled gain stages is also presented. The comparator circuit has been implemented in a standard metal-gate CMOS process. The measured comparator resolution is less than 1 mV, and the allowable supply voltages range from 3.5 to 10 V.