nils-herrmann/clean_scirepeval huggingface dataset:
Seeing Behind the Camera: Identifying the Authorship of a Photograph

We introduce the novel problem of identifying the photographer behind a photograph. To explore the feasibility of current computer vision techniques to address this problem, we created a new dataset of over 180,000 images taken by 41 well-known photographers. Using this dataset, we examined the effectiveness of a variety of features (low and high-level, including CNN features) at identifying the photographer. We also trained a new deep convolutional neural network for this task. Our results show that high-level features greatly outperform low-level features. We provide qualitative results using these learned models that give insight into our method's ability to distinguish between photographers, and allow us to draw interesting conclusions about what specific photographers shoot. We also demonstrate two applications of our method.
Hierarchical Singular Value Decomposition of Tensors

We define the hierarchical singular value decomposition (SVD) for tensors of order d ≥ 2. This hierarchical SVD has properties like the matrix SVD (and collapses to the SVD in d = 2), and we prove these. In particular, one can find low rank (almost) best approximations in a hierarchical format (H-Tucker) which requires only O((d − 1)k3 + dnk) parameters, where d is the order of the tensor, n the size of the modes and k the (hierarchical) rank. The H-Tucker format is a specialization of the Tucker format and it contains as a special case all (canonical) rank k tensors. Based on this new concept of a hierarchical SVD we present algorithms for hierarchical tensor calculations allowing for a rigorous error analysis. The complexity of the truncation (finding lower rank approximations to hierarchical rank k tensors) is in O((d−1)k4 +dnk2) and the attainable accuracy is just 2–3 digits less than machine precision.
Stochastic Gradient Hamiltonian Monte Carlo

Hamiltonian Monte Carlo (HMC) sampling methods provide a mechanism for defining distant proposals with high acceptance probabilities in a Metropolis-Hastings framework, enabling more efficient exploration of the state space than standard random-walk proposals. The popularity of such methods has grown significantly in recent years. However, a limitation of HMC methods is the required gradient computation for simulation of the Hamiltonian dynamical system—such computation is infeasible in problems involving a large sample size or streaming data. Instead, we must rely on a noisy gradient estimate computed from a subset of the data. In this paper, we explore the properties of such a stochastic gradient HMC approach. Surprisingly, the natural implementation of the stochastic approximation can be arbitrarily bad. To address this problem we introduce a variant that uses second-order Langevin dynamics with a friction term that counteracts the effects of the noisy gradient, maintaining the desired target distribution as the invariant distribution. Results on simulated data validate our theory. We also provide an application of our methods to a classification task using neural networks and to online Bayesian matrix factorization.
Motivated recruitment of autobiographical memories.

We hypothesized that people motivated to believe that they possess a given trait search for autobiographical memories that reflect that trait, so as to justify their desired self-view. We led subjects to believe that either extraversion or introversion was desirable, and obtained convergent evidence from open-ended memory-listing tasks as well as from reaction-time tasks measuring the speed with which memories could be generated that this manipulation enhanced the accessibility of memories reflecting the desired trait. If people rely on their memories to construct desired self-concepts, motivated changes in self-concepts should be constrained by the content of available memories. Our final study demonstrates such constraints.
Learning to rank: from pairwise approach to listwise approach

The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative filtering, and many other applications. Several methods for learning to rank have been proposed, which take object pairs as 'instances' in learning. We refer to them as the pairwise approach in this paper. Although the pairwise approach offers advantages, it ignores the fact that ranking is a prediction task on list of objects. The paper postulates that learning to rank should adopt the listwise approach in which lists of objects are used as 'instances' in learning. The paper proposes a new probabilistic method for the approach. Specifically it introduces two probability models, respectively referred to as permutation probability and top k probability, to define a listwise loss function for learning. Neural Network and Gradient Descent are then employed as model and algorithm in the learning method. Experimental results on information retrieval show that the proposed listwise approach performs better than the pairwise approach.
An approach for the economical evaluation of solar irrigation in Bangladesh

This paper represents a comparative picture of irrigation cost of different Bangladeshi crops for diesel, grid electricity and solar power based irrigation systems. The study has been conducted on 27 types of crops. All the data were collected about volume of water for those crops. Then three different types of pump (solar, diesel, electric) have been chosen with same power rating i.e. 5hp. Specific area covered for different crops are calculated furthermore from the attained water volumes. Then finally it has been calculated the 10 years cost in taka. The study found for the entire crops grid powered irrigation cost is minimum than solar powered irrigation cost because the later one is associated with huge primary investment.[12] The study also discovered irrigation with solar power for most of the crops such as onion, carrot, chill, tomato, maize, garlic, gourd, ginger, turmeric, pumpkin, cabbage, cauliflower, lady finger, banana, papaya and groundnut are not beneficial at all rather it costs very high among all the three types of irrigation system.[5] It is also evident that irrigation with solar power of certain crops like potato, cotton, soybean, sunflower, strawberry, lentil, mustard are very much lucrative compared to diesel powered irrigation.
Perceptual Design of Haptic Icons

The bulk of applications for haptic feedback employ direct rendering approaches wherein a user touches a virtual model of some “real” thing, often displayed graphically as well. We propose a new class of applications based on abstract messages, ranging from “haptic icons” – brief signals conveying an object’s or event’s state, function or content – to an expressive haptic language for interpersonal communication. Building this language requires us to understand how synthetic haptic signals are perceived, and what they can mean to us. Experiments presented here address the perception question by using an efficient version of Multidimensional Scaling (MDS) to extract perceptual axes for complex haptic icons: once this space is mapped, icons can be designed to maximize both differentiability and individual salience. Results show that a set of icons constructed by varying the frequency, magnitude and shape of 2-sec, time-invariant wave shapes map to two perceptual axes, which differ depending on the signals’ frequency range; and suggest that expressive capability is maximized in one frequency subspace.
In the mood: engaging teenagers in psychotherapy using mobile phones

Mental illness is a significant and growing problem throughout the world. Many mental health problems have their root in childhood, and early intervention is recommended. Engaging young people in psychotherapeutic activities is challenging, and treatment adherence is often poor. This paper presents a series of studies carried out as part of the development of a mobile and online symptom tracking tool for adolescents with mental health problems. Teenagers use the system to record symptoms on their mobile phones and can view this information in a clinical setting with a therapist. We focus on a clinical pilot of the system with ten users in public mental health clinics. As well as indicating that the mobile diary tool can increase client adherence to therapeutic activities, the study yields insight into the factors influencing the success of the design and informs the design of other systems to be used as adjuncts to therapy.
Digital Mont'e Prama: Exploring Large Collections of Detailed 3D Models of Sculptures

We present and evaluate a scalable interactive system for the exploration of large collections of detailed three-dimensional digital models of sculptures. The system has been applied to the valorization of the Mont’e Prama complex, an extraordinary collection of protostoric Mediterranean sculptures, which depict models of cone-shaped stone towers, as well as larger-than-life human figures. The software architecture is based on scalable components for efficient distribution and adaptive rendering of extremely detailed surface meshes with overlaid information. The user interface, based on a simple and effective interactive camera controller tailored for touch interaction, has been designed for targeting both small screens and large display systems. The system components have been integrated in different interactive applications, ranging from large-screen museum setups and low-end mobile devices both with very high visual quality. The large-scale system has been installed in a variety of temporal and permanent exhibitions and has been extensively used by tens of thousands of visitors. We provide an early analysis in this article of the data gathered during a 20-month period in the National Archaeological Museum in Cagliari and a 6-month period in the Civic Museum in Cabras, for a total of over 67,000 exploration sessions.
Toward tense as a clinical marker of specific language impairment in English-speaking children.

A critical clinical issue is the identification of a clinical marker, a linguistic form or principle that can be shown to be characteristic of children with Specific Language Impairment (SLI). In this paper we evaluate, as candidate clinical markers, a set of morphemes that mark Tense. In English, this includes -s third person singular, -ed regular past, BE, and DO. According to the Extended Optional Infinitive Account (EOI) of Rice, Wexler, and Cleave (1995), this set of morphemes is likely to appear optionally in the grammars of children with SLI at a rate lower than the optionality evident in younger controls. Three groups of preschool children participated: 37 children with SLI, and two control groups, one of 40 MLU-equivalent children and another of 45 age-equivalent children. Three kinds of evidence support the conclusion that a set of morphemes that marks Tense can be considered a clinical marker: (a) low levels of accuracy for the target morphemes for the SLI group relative to either of the two control groups; (b) affectedness for the set of morphemes defined by the linguistic function of Tense, but not for morphemes unrelated to Tense; and (c) a bimodal distribution for Tense-marking morphemes relative to age peers, in which the typical children are at essentially adult levels of the grammar, whereas children in the SLI group were at low (i.e., non-adultlike) levels of performance. The clinical symptoms are evident in omissions of surface forms. Errors of subject-verb agreement and syntactic misuses are rare, showing that, as predicted, children in an EOI stage who are likely to mark Tense optionally at the same time know a great deal about the grammatical properties of finiteness and agreement in the adult grammar. The findings are discussed in terms of alternative accounts of the grammatical limitations of children with SLI and implications for clinical identification.
Video and learning: a systematic review (2007-2017)

Video materials have become an integral part of university learning and teaching practice. While empirical research concerning the use of videos for educational purposes has increased, the literature lacks an overview of the specific effects of videos on diverse learning outcomes. To address such a gap, this paper presents preliminary results of a large-scale systematic review of peer-reviewed empirical studies published from 2007-2017. The study synthesizes the trends observed through the analysis of 178 papers selected from the screening of 2531 abstracts. The findings summarize the effects of manipulating video presentation, content and tasks on learning outcomes, such as recall, transfer, academic achievement, among others. The study points out the gap between large-scale analysis of fine-grained data on video interaction and experimental findings reliant on established psychological instruments. Narrowing this gap is suggested as the future direction for the research on video-based learning.
Characterizing debate performance via aggregated twitter sentiment

Television broadcasters are beginning to combine social micro-blogging systems such as Twitter with television to create social video experiences around events. We looked at one such event, the first U.S. presidential debate in 2008, in conjunction with aggregated ratings of message sentiment from Twitter. We begin to develop an analytical methodology and visual representations that could help a journalist or public affairs person better understand the temporal dynamics of sentiment in reaction to the debate video. We demonstrate visuals and metrics that can be used to detect sentiment pulse, anomalies in that pulse, and indications of controversial topics that can be used to inform the design of visual analytic systems for social media events.
UWB antipodal vivaldi antennas with protruded dielectric rods for higher gain, symmetric patterns and minimal phase center variations

In this paper, the authors proposed a technique to improve the gain, narrow the H-plane beamwidth, and minimize the phase center variations with frequency by utilizing Vivaldi antenna with a protruded dielectric rod. A sample antenna was fabricated and measured, and preliminary measured results are very promising, and in good agreement with the simulation results.
Qualitative comparison of graph-based and logic-based multi-relational data mining: a case study

The goal of this paper is to generate insights about the differences between graph-based and logic-based approaches to multi-relational data mining by performing a case study of graph-based system, Subdue and the inductive logic programming system, CProgol. We identify three key factors for comparing graph-based and logic-based multi-relational data mining; namely, the ability to discover structurally large concepts, the ability to discover semantically complicated concepts and the ability to effectively utilize background knowledge. We perform an experimental comparison of Subdue and CProgol on the Mutagenesis domain and various artificially generated Bongard problems. Experimental results indicate that Subdue can significantly outperform CProgol while discovering structurally large multi-relational concepts. It is also observed that CProgol is better at learning semantically complicated concepts and it tends to use background knowledge more effectively than Subdue.
Breaking out of the box of recommendations: from items to packages

Classical recommender systems provide users with a list of recommendations where each recommendation consists of a single item, e.g., a book or DVD. However, several applications can benefit from a system capable of recommending packages of items, in the form of sets. Sample applications include travel planning with a limited budget (price or time) and twitter users wanting to select worthwhile tweeters to follow given that they can deal with only a bounded number of tweets. In these contexts, there is a need for a system that can recommend top-k packages for the user to choose from.
 Motivated by these applications, we consider composite recommendations, where each recommendation comprises a set of items. Each item has both a value (rating) and a cost associated with it, and the user specifies a maximum total cost (budget) for any recommended set of items. Our composite recommender system has access to one or more component recommender system, focusing on different domains, as well as to information sources which can provide the cost associated with each item. Because the problem of generating the top recommendation (package) is NP-complete, we devise several approximation algorithms for generating top-k packages as recommendations. We analyze their efficiency as well as approximation quality. Finally, using two real and two synthetic data sets, we subject our algorithms to thorough experimentation and empirical analysis. Our findings attest to the efficiency and quality of our approximation algorithms for top-k packages compared to exact algorithms.
A Survey of Game Theory as Applied to Network Security

Network security is a complex and challenging problem. The area of network defense mechanism design is receiving immense attention from the research community for more than two decades. However, the network security problem is far from completely solved. Researchers have been exploring the applicability of game theoretic approaches to address the network security issues and some of these approaches look promising. This paper surveys the existing game theoretic solutions which are designed to enhance network security and presents a taxonomy for classifying the proposed solutions. This taxonomy should provide the reader with a better understanding of game theoretic solutions to a variety of cyber security problems.
Reducing restraint use for older adults in acute care.

Although no evidence shows that restraints are effective for maintaining safety, preventing disruption of treatment, or controlling behavior, they're still commonly used in acute care facilities (especially in critical care) in the United States, where the reported prevalence of their use ranges from 7.4% to 17%.[1–3] They may be used to protect patients from falls or to prevent them from inadvertently removing tubes and other devices.[4] Older adults are three times more likely to be restrained during an acute hospital admission than younger patients, even though this practice is associated with poor outcomes.[1] (See Adverse effects of physical restraints.
Agri-IoT: A semantic framework for Internet of Things-enabled smart farming applications

With the recent advancement of the Internet of Things (IoT), it is now possible to process a large number of sensor data streams using different large-scale IoT platforms. These IoT frameworks are used to collect, process and analyse data streams in real-time and facilitate provision of smart solutions designed to provide decision support. Existing IoT-based solutions are mainly domain-dependent, providing stream processing and analytics focusing on specific areas (smart cities, healthcare etc.). In the context of agri-food industry, a variety of external parameters belonging to different domains (e.g. weather conditions, regulations etc.) have a major influence over the food supply chain, while flexible and adaptive IoT frameworks, essential to truly realize the concept of smart farming, are currently inexistent. In this paper, we propose Agri-IoT, a semantic framework for IoT-based smart farming applications, which supports reasoning over various heterogeneous sensor data streams in real-time. Agri-IoT can integrate multiple cross-domain data streams, providing a complete semantic processing pipeline, offering a common framework for smart farming applications. Agri-IoT supports large-scale data analytics and event detection, ensuring seamless interoperability among sensors, services, processes, operations, farmers and other relevant actors, including online information sources and linked open datasets and streams available on the Web.
Seraph: an efficient, low-cost system for concurrent graph processing

Graph processing systems have been widely used in enterprises like online social networks to process their daily jobs. With the fast growing of social applications, they have to efficiently handle massive concurrent jobs. However, due to the inherent design for single job, existing systems incur great inefficiency in memory use and fault tolerance. Motivated by this, in this paper we introduce Seraph, a graph processing system that enables efficient job-level parallelism. Seraph is designed based on a decoupled data model, which allows multiple concurrent jobs to share graph structure data in memory. Seraph adopts a copy-on-write semantic to isolate the graph mutation of concurrent jobs, and a lazy snapshot protocol to generate consistent graph snapshots for jobs submitted at different time. Moreover, Seraph adopts an incremental checkpoint/regeneration model which can tremendously reduce the overhead of checkpointing. We have implemented Seraph, and the evaluation results show that Seraph significantly outperforms popular systems (such as Giraph and Spark) in both memory usage and job completion time, when executing concurrent graph jobs.
A survey on heuristic malware detection techniques

Malware is a malicious code which is developed to harm a computer or network. The number of malwares is growing so fast and this amount of growth makes the computer security researchers invent new methods to protect computers and networks. There are three main methods used to malware detection: Signature based, Behavioral based and Heuristic ones. Signature based malware detection is the most common method used by commercial antiviruses but it can be used in the cases which are completely known and documented. Behavioral malware detection was introduced to cover deficiencies of signature based method. However, because of some shortcomings, the heuristic methods have been introduced. In this paper, we discuss the state of the art heuristic malware detection methods and briefly overview various features used in these methods such as API Calls, OpCodes, N-Grams etc. and discuss their advantages and disadvantages.
Behavioral resource-aware model inference

Software bugs often arise because of differences between what developers think their system does and what the system actually does. These differences frustrate debugging and comprehension efforts. We describe Perfume, an automated approach for inferring behavioral, resource-aware models of software systems from logs of their executions. These finite state machine models ease understanding of system behavior and resource use.
 Perfume improves on the state of the art in model inference by differentiating behaviorally similar executions that differ in resource consumption. For example, Perfume separates otherwise identical requests that hit a cache from those that miss it, which can aid understanding how the cache affects system behavior and removing cache-related bugs. A small user study demonstrates that using Perfume is more effective than using logs and another model inference tool for system comprehension. A case study on the TCP protocol demonstrates that Perfume models can help understand non-trivial protocol behavior. Perfume models capture key system properties and improve system comprehension, while being reasonably robust to noise likely to occur in real-world executions.
Comparing Speech Recognition Systems (Microsoft API, Google API And CMU Sphinx)

The idea of this paper is to design a tool that will be used to test and compare commercial speech recognition systems, such as Microsoft Speech API and Google Speech API, with open-source speech recognition systems such as Sphinx-4. The best way to compare automatic speech recognition systems in different environments is by using some audio recordings that were selected from different sources and calculating the word error rate (WER). Although the WER of the three aforementioned systems were acceptable, it was observed that the Google API is superior.