nils-herrmann/clean_scirepeval huggingface dataset:
An Overview of Tiles in HEVC

Tiles is a new feature in the High Efficiency Video Coding (HEVC) standard that divides a picture into independent, rectangular regions. This division provides a number of advantages. Specifically, it increases the “parallel friendliness” of the new standard by enabling improved coding efficiency for parallel architectures, as compared to previous sliced based methods. Additionally, tiles facilitate improved maximum transmission unit (MTU) size matching, reduced line buffer memory, and additional region-of-interest functionality. In this paper, we introduce the tiles feature and survey the performance of the tool. Coding efficiency is reported for different parallelization factors and MTU size requirements. Additionally, a tile-based region of interest coding method is developed.
The IAM-database: an English sentence database for offline handwriting recognition

In this paper we describe a database that consists of handwritten English sentences. It is based on the Lancaster-Oslo/Bergen (LOB) corpus. This corpus is a collection of texts that comprise about one million word instances. The database includes 1,066 forms produced by approximately 400 different writers. A total of 82,227 word instances out of a vocabulary of 10,841 words occur in the collection. The database consists of full English sentences. It can serve as a basis for a variety of handwriting recognition tasks. However, it is expected that the database would be particularly useful for recognition tasks where linguistic knowledge beyond the lexicon level is used, because this knowledge can be automatically derived from the underlying corpus. The database also includes a few image-processing procedures for extracting the handwritten text from the forms and the segmentation of the text into lines and words.
The domestication of social cognition in dogs.

Dogs are more skillful than great apes at a number of tasks in which they must read human communicative signals indicating the location of hidden food. In this study, we found that wolves who were raised by humans do not show these same skills, whereas domestic dog puppies only a few weeks old, even those that have had little human contact, do show these skills. These findings suggest that during the process of domestication, dogs have been selected for a set of social-cognitive abilities that enable them to communicate with humans in unique ways.
Boosting the margin: A new explanation for the effectiveness of voting methods

One of the surprising recurring phenomena observed in experiments with boosting is that the test error of the generated classifier usually does not increase as its size becomes very large, and often is observed to decrease even after the training error reaches zero. In this paper, we show that this phenomenon is related to the distribution of margins of the training examples with respect to the generated voting classification rule, where the margin of an example is simply the difference between the number of correct votes and the maximum number of votes received by any incorrect label. We show that techniques used in the analysis of Vapnik’s support vector classifiers and of neural networks with small weights can be applied to voting methods to relate the margin distribution to the test error. We also show theoretically and experimentally that boosting is especially effective at increasing the margins of the training examples. Finally, we compare our explanation to those based on the bias-variance decomposition.
Our Twitter Profiles, Our Selves: Predicting Personality with Twitter

Psychological personality has been shown to affect a variety of aspects: preferences for interaction styles in the digital world and for music genres, for example. Consequently, the design of personalized user interfaces and music recommender systems might benefit from understanding the relationship between personality and use of social media. Since there has not been a study between personality and use of Twitter at large, we set out to analyze the relationship between personality and different types of Twitter users, including popular users and influentials. For 335 users, we gather personality data, analyze it, and find that both popular users and influentials are extroverts and emotionally stable (low in the trait of Neuroticism). Interestingly, we also find that popular users are `imaginative' (high in Openness), while influentials tend to be `organized' (high in Conscientiousness). We then show a way of accurately predicting a user's personality simply based on three counts publicly available on profiles: following, followers, and listed counts. Knowing these three quantities about an active user, one can predict the user's five personality traits with a root-mean-squared error below 0.88 on a $[1,5]$ scale. Based on these promising results, we argue that being able to predict user personality goes well beyond our initial goal of informing the design of new personalized applications as it, for example, expands current studies on privacy in social media.
Factorized adaptation for deep neural network

In this paper, we propose a novel method to adapt context-dependent deep neural network hidden Markov model (CD-DNN-HMM) with only limited number of parameters by taking into account the underlying factors that contribute to the distorted speech signal. We derive this factorized adaptation method from the perspectives of joint factor analysis and vector Taylor series expansion, respectively. Evaluated on Aurora 4, the proposed method can get 19.0% and 10.6% relative word error rate reduction on test set B and D with only 20 adaptation utterances, and can have decent improvement with as few as two adaptation utterances. We also show that the proposed method is better than feature discriminative linear regression (fDLR), an existing DNN adaptation method. Its small number of parameters and short training time offer an attractive solution to low-footprint speech applications.
Aspect-oriented in-lined reference monitors

An Aspect-Oriented, declarative, security policy specification language is presented, for enforcement by In-lined Reference Monitors. The semantics of the language establishes a formal connection between Aspect-Oriented Programming and In-lined Reference Monitoring wherein policy specifications denote Aspect-Oriented security automata---security automata whose edge labels are encoded as pointcut expressions. The prototype language implementation enforces these security policies by automatically rewriting Java bytecode programs so as to detect and prevent policy violations at runtime.
Long-Term Trends in the Public Perception of Artificial Intelligence

Analyses of text corpora over time can reveal trends in beliefs, interest, and sentiment about a topic. We focus on views expressed about artificial intelligence (AI) in the New York Times over a 30-year period. General interest, awareness, and discussion about AI has waxed and waned since the field was founded in 1956. We present a set of measures that captures levels of engagement, measures of pessimism and optimism, the prevalence of specific hopes and concerns, and topics that are linked to discussions about AI over decades. We find that discussion of AI has increased sharply since 2009, and that these discussions have been consistently more optimistic than pessimistic. However, when we examine specific concerns, we find that worries of loss of control of AI, ethical concerns for AI, and the negative impact of AI on work have grown in recent years. We also find that hopes for AI in healthcare and education have increased over time.
A COMPARISON OF ENTERPRISE ARCHITECTURE FRAMEWORKS

An Enterprise Architecture Framework (EAF) maps all of the software development processes within the enterprise and how they relate and interact to fulfill the enterprise’s mission. It provides organizations with the ability to understand and analyze weaknesses or inconsistencies to be identified and addressed. There are a number of already established EAF in use today; some of these frameworks were developed for very specific areas, whereas others have broader functionality. This study provides a comparison of several frameworks that can then be used for guidance in the selection of an EAF that meets the needed criteria.
Lightweight Memory Tracing

Dynamic binary instrumentation is a technique that consists of translating the binary code of executables on-the-fly, including all the loaded libraries. The original binary code is instrumented in the process of translation. Applications of this technique range from sandboxes to debugging and profiling tools. In this thesis we describe lMem, a lightweight binary translation framework for the IA-32/x64 architectures. One of the challenges when writing instrumentation tools is that resources such as registers and memory have to be shared between the instrumented program and the instrumentation logic. A possible way to approach this problem is to translate a given machine code snippet in an intermediate representation (IR), add instrumentation code written in this IR and then recompile the snippet to machine code and run it. Tools such as Valgrind successfully make use of this technique. These IR-based methods however are heavyweight in the sense that a significant amount of work done by the compiler has to be replicated at runtime. IR-based recompilation increases the runtime overhead and the complexity of the binary translation framework itself. A second approach consists of saving and restoring some of the state before and after the inserted instrumentation code. This approach, which is used for example by the selDebug debugger, is simple but it suffers from overhead due to frequent saving and restoring of state. A third approach is to let the instrumentation code make use of hardware resources that are not used by the instrumented program. The minemu taint checking tool achieves good performance by exploiting the fact that some 32 bit machines lack SSE registers. This enables it to fool the application into thinking that it is running on such a machine while in reality these registers are used by the instrumentation code. lMem translates IA-32 programs to x64 and uses additional registers and memory for instrumentation. To gauge the performance of this approach we implement a simple application on top of lMem which enables to insert an arbitrary number of watchpoints. We observe that this lMem-based application has overheads of only 50% to 200% on SPEC CPU 2006 benchmarks.
Searching the world wide Web

The coverage and recency of the major World Wide Web search engines was analyzed, yielding some surprising results. The coverage of any one engine is significantly limited: No single engine indexes more than about one-third of the "indexable Web," the coverage of the six engines investigated varies by an order of magnitude, and combining the results of the six engines yields about 3.5 times as many documents on average as compared with the results from only one engine. Analysis of the overlap between pairs of engines gives an estimated lower bound on the size of the indexable Web of 320 million pages.
Very-low-profile, stand-alone, tri-band WLAN antenna design for laptop-tablet computer with complete metal-backed cover

A very-low-profile, tri-band, planar inverted-F antenna (PIFA) with a height of 3.7 mm only for wireless local area network (WlAN) applications in the 2.4 GHz (2400∼2484 MHz), 5.2 GHz (5150∼5350 MHz), and 5.8 GHz (5725∼5825 MHz) bands for tablet-laptop computer with a metal back cover is presented. The antenna was made of a flat plate of size 18.7 mm × 32.5 mm and bent into a compact structure with the dimensions 3.7 mm × 7 mm × 32.5 mm. The PIFA comprised a radiating top patch, a feeding/shorting portion, and an antenna ground plane. The top patch was placed horizontally above the ground with the feeding/shorting portion connecting perpendicularly therebetween. The antenna was designed in a way that the radiating patch consisted of three branches, in which each branch controlled the corresponding resonant mode in the 2.4/5.2/5.8 GHz bands.
A survey of point-based POMDP solvers

The past decade has seen a significant breakthrough in research on solving partially observable Markov decision processes (POMDPs). Where past solvers could not scale beyond perhaps a dozen states, modern solvers can handle complex domains with many thousands of states. This breakthrough was mainly due to the idea of restricting value function computations to a finite subset of the belief space, permitting only local value updates for this subset. This approach, known as point-based value iteration, avoids the exponential growth of the value function, and is thus applicable for domains with longer horizons, even with relatively large state spaces. Many extensions were suggested to this basic idea, focusing on various aspects of the algorithm—mainly the selection of the belief space subset, and the order of value function updates. In this survey, we walk the reader through the fundamentals of point-based value iteration, explaining the main concepts and ideas. Then, we survey the major extensions to the basic algorithm, discussing their merits. Finally, we include an extensive empirical analysis using well known benchmarks, in order to shed light on the strengths and limitations of the various approaches.
Learning user-specific parameters in a multibiometric system

Biometric systems that use a single biometric trait have to contend with noisy data, restricted degrees of freedom, failureto-enroll problems, spoof attacks, and unacceptable error rates. Multibiometric systems that use multiple traits of an individual for authentication, alleviate some of these problems while improving verification performance. We demonstrate that the performance of multibiometric systems can be further improved by learning user-specific parameters. Two types of parameters are considered here. (i) Thresholds that are used to decide if a matching score indicates a genuine user or an impostor, and (ii) weights that are used to indicate the importance of matching scores output by each biometric trait. User-specific thresholds are computed using the cumulative histogram of impostor matching scores corresponding to each user. The user-specific weights associated with each biometric are estimated by searching for that set of weights which minimizes the total verification error. The tests were conducted on a database of 50 users who provided fingerprint, face and hand geometry data, with 10 of these users providing data over a period of two months. We observed that user-specific thresholds improved system performance by ∼ 2%, while user-specific weights improved performance by ∼ 3%.
Detecting Violent Crowds using Temporal Analysis of GLCM Texture

The severity of sustained injury resulting from assault-related violence can be minimized by reducing detection time [10,28]. However, it has been shown that human operators perform poorly at detecting events found in video footage when presented with simultaneous feeds [30]. We utilize computer vision techniques to develop an automated method of violence detection that can aid a human operator. We observed that violence in city centre environments often occur in crowded areas, resulting in individual actions being occluded by other crowd members. Measures of visual texture have shown to be effective at encoding crowd appearance [8, 23, 31]. Therefore, we propose modelling crowd dynamics using changes in crowd texture. We refer to this approach as Violent Crowd Texture (VCT). Real-world surveillance footage of night time environments and the violent flows [16] dataset were tested using a random forest classifier to evaluate the ability of the VCT method at discriminating between violent and non-violent behaviour. Our method achieves ROC values of 0.98 and 0.91 for the realworld and violent flows data respectively.
Internet Addiction: The Emergence of a New Clinical Disorder

Anecdotal reports indicated that some on-line users were becoming addicted to the Internet in much that same way that others became addicted to drugs or alcohol which resulted in academic, social, and occupational impairment. However, research among sociologists, psychologists, or psychiatrists has not formally identified addictive use of the Internet as a problematic behavior. This study investigated the existence of Internet addiction and the extent of problems caused by such potential misuse. This study utilized an adapted version of the criteria for pathological gambling defined by the DSM-IV (APA, 1994). On the basis of this criteria, case studies of 396 dependent Internet users (Dependents) and a control group of 100 non-dependent Internet users (Non-Dependents) were classified. Qualitative analyses suggests significant behavioral and functional usage differences between the two groups. Clinical and social implications of pathological Internet use and future directions for research are discussed.
Self organization of a massive document collection

This article describes the implementation of a system that is able to organize vast document collections according to textual similarities. It is based on the self-organizing map (SOM) algorithm. As the feature vectors for the documents statistical representations of their vocabularies are used. The main goal in our work has been to scale up the SOM algorithm to be able to deal with large amounts of high-dimensional data. In a practical experiment we mapped 6,840,568 patent abstracts onto a 1,002,240-node SOM. As the feature vectors we used 500-dimensional vectors of stochastic figures obtained as random projections of weighted word histograms.
Incremental Learning for Robust Visual Tracking

Visual tracking, in essence, deals with non-stationary image streams that change over time. While most existing algorithms are able to track objects well in controlled environments, they usually fail in the presence of significant variation of the object’s appearance or surrounding illumination. One reason for such failures is that many algorithms employ fixed appearance models of the target. Such models are trained using only appearance data available before tracking begins, which in practice limits the range of appearances that are modeled, and ignores the large volume of information (such as shape changes or specific lighting conditions) that becomes available during tracking. In this paper, we present a tracking method that incrementally learns a low-dimensional subspace representation, efficiently adapting online to changes in the appearance of the target. The model update, based on incremental algorithms for principal component analysis, includes two important features: a method for correctly updating the sample mean, and a forgetting factor to ensure less modeling power is expended fitting older observations. Both of these features contribute measurably to improving overall tracking performance. Numerous experiments demonstrate the effectiveness of the proposed tracking algorithm in indoor and outdoor environments where the target objects undergo large changes in pose, scale, and illumination.
Context-aware Learning for Sentence-level Sentiment Analysis with Posterior Regularization

This paper proposes a novel context-aware method for analyzing sentiment at the level of individual sentences. Most existing machine learning approaches suffer from limitations in the modeling of complex linguistic structures across sentences and often fail to capture nonlocal contextual cues that are important for sentiment interpretation. In contrast, our approach allows structured modeling of sentiment while taking into account both local and global contextual information. Specifically, we encode intuitive lexical and discourse knowledge as expressive constraints and integrate them into the learning of conditional random field models via posterior regularization. The context-aware constraints provide additional power to the CRF model and can guide semi-supervised learning when labeled data is limited. Experiments on standard product review datasets show that our method outperforms the state-of-theart methods in both the supervised and semi-supervised settings.
Congruity Effects in Time and Space: Behavioral and ERP Measures

Two experiments investigated whether motion metaphors for time affected the perception of spatial motion. Participants read sentences either about literal motion through space or metaphorical motion through time written from either the ego-moving or object-moving perspective. Each sentence was followed by a cartoon clip. Smiley-moving clips showed an iconic happy face moving toward a polygon, and shape-moving clips showed a polygon moving toward a happy face. In Experiment 1, using an explicit judgment task, participants judged smiley-moving cartoons as related to ego-moving sentences about space and about time, and shape-moving cartoons as related to object-moving sentences. In Experiment 2, participants viewed the same stimuli, but the cartoons were task-irrelevant. Event-related brain potentials revealed an early attentional effect of congruity on cartoons following sentences about space, and a later semantic effect on cartoons following sentences about time. Results are most consistent with accounts that posit differences in the processing of novel and conventional metaphors.
Model-based evaluation: from dependability to security

The development of techniques for quantitative, model-based evaluation of computer system dependability has a long and rich history. A wide array of model-based evaluation techniques is now available, ranging from combinatorial methods, which are useful for quick, rough-cut analyses, to state-based methods, such as Markov reward models, and detailed, discrete-event simulation. The use of quantitative techniques for security evaluation is much less common, and has typically taken the form of formal analysis of small parts of an overall design, or experimental red team-based approaches. Alone, neither of these approaches is fully satisfactory, and we argue that there is much to be gained through the development of a sound model-based methodology for quantifying the security one can expect from a particular design. In this work, we survey existing model-based techniques for evaluating system dependability, and summarize how they are now being extended to evaluate system security. We find that many techniques from dependability evaluation can be applied in the security domain, but that significant challenges remain, largely due to fundamental differences between the accidental nature of the faults commonly assumed in dependability evaluation, and the intentional, human nature of cyber attacks.
Vertical and horizontal elasticity for dynamic virtual machine reconfiguration

Today, cloud computing applications are rapidly constructed by services belonging to different cloud providers and service owners. This work presents the inter-cloud elasticity framework, which focuses on cloud load balancing based on dynamic virtual machine reconfiguration when variations on load or on user requests volume are observed. We design a dynamic reconfiguration system, called inter-cloud load balancer (ICLB), that allows scaling up or down the virtual resources (thus providing automatized elasticity), by eliminating service downtimes and communication failures. It includes an inter-cloud load balancer for distributing incoming user HTTP traffic across multiple instances of inter-cloud applications and services and we perform dynamic reconfiguration of resources according to the real time requirements. The experimental analysis includes different topologies by showing how real-time traffic variation (using real world workloads) affects resource utilization and by achieving better resource usage in inter-cloud.