nils-herrmann/clean_scirepeval huggingface dataset:
Embodied Construction Grammar

Construction-based approaches to grammar are driven by the insight that meaning plays a crucial role in answering this question: the meanings of both words and grammatical structures can affect grammaticality, and they should therefore be incorporated into grammatical representations. To wit, the various approaches presented in this volume take this tack in predicting the grammaticality of utterances of all sorts, from the creative to the conventional. But focusing on utterance grammaticality removes utterances from their physical and social contexts of use. The result is an approach to language that resembles traditional anatomy, in which utterances are dissected, categorized, and explained in terms of their structural and distributional properties. Insights from such an approach can be both useful and informative in accounting for what utterances are or potentially could be. They do not, however, explain human language use—that is, the mechanisms and representations that human beings use to learn, produce, and understand utterances. If we are interested in these latter issues, issues more properly situated within cognitive science than analytical linguistics, then we find our investigations of grammar (and language more generally) guided by a different sort of question:
Topics in semantic representation.

Processing language requires the retrieval of concepts from memory in response to an ongoing stream of information. This retrieval is facilitated if one can infer the gist of a sentence, conversation, or document and use that gist to predict related concepts and disambiguate words. This article analyzes the abstract computational problem underlying the extraction and use of gist, formulating this problem as a rational statistical inference. This leads to a novel approach to semantic representation in which word meanings are represented in terms of a set of probabilistic topics. The topic model performs well in predicting word association and the effects of semantic association and ambiguity on a variety of language-processing and memory tasks. It also provides a foundation for developing more richly structured statistical models of language, as the generative process assumed in the topic model can easily be extended to incorporate other kinds of semantic and syntactic structure.
A Convolutional Attention Network for Extreme Summarization of Source Code

Attention mechanisms in neural networks have proved useful for problems in which the input and output do not have fixed dimension. Often there exist features that are locally translation invariant and would be valuable for directing the model’s attention, but previous attentional architectures are not constructed to learn such features specifically. We introduce an attentional neural network that employs convolution on the input tokens to detect local time-invariant and long-range topical attention features in a context-dependent way. We apply this architecture to the problem of extreme summarization of source code snippets into short, descriptive function name-like summaries. Using those features, the model sequentially generates a summary by marginalizing over two attention mechanisms: one that predicts the next summary token based on the attention weights of the input tokens and another that is able to copy a code token as-is directly into the summary. We demonstrate our convolutional attention neural network’s performance on 10 popular Java projects showing that it achieves better performance compared to previous attentional mechanisms.
CLEAR: Cross-layer exploration for architecting resilience: Combining hardware and software techniques to tolerate soft errors in processor cores

We present a first of its kind framework which overcomes a major challenge in the design of digital systems that are resilient to reliability failures: achieve desired resilience targets at minimal costs (energy, power, execution time, area) by combining resilience techniques across various layers of the system stack (circuit, logic, architecture, software, algorithm). This is also referred to as cross-layer resilience. In this paper, we focus on radiation-induced soft errors in processor cores. We address both single-event upsets (SEUs) and single-event multiple upsets (SEMUs) in terrestrial environments. Our framework automatically and systematically explores the large space of comprehensive resilience techniques and their combinations across various layers of the system stack (798 cross-layer combinations in this paper), derives cost-effective solutions that achieve resilience targets at minimal costs, and provides guidelines for the design of new resilience techniques. We demonstrate the practicality and effectiveness of our framework using two diverse designs: a simple, in-order processor core and a complex, out-of-order processor core. Our results demonstrate that a carefully optimized combination of circuit-level hardening, logic-level parity checking, and micro-architectural recovery provides a highly cost-effective soft error resilience solution for general-purpose processor cores. For example, a 50× improvement in silent data corruption rate is achieved at only 2.1% energy cost for an out-of-order core (6.1% for an in-order core) with no speed impact. However, selective circuit-level hardening alone, guided by a thorough analysis of the effects of soft errors on application benchmarks, provides a cost-effective soft error resilience solution as well (with ~1% additional energy cost for a 50× improvement in silent data corruption rate).
Fast and Efficient Skin Detection for Facial Detection

In this paper, an efficient skin detection system is proposed. The algorithm is based on a very fast efficient pre-processing step utilizing the concept of ternary conversion in order to identify candidate windows and subsequently, a novel local two-stage diffusion method which has F-score accuracy of 0.5978 on SDD dataset. The pre-processing step has been proven to be useful to boost the speed of the system by eliminating 82% of an image in average. This is obtained by keeping the true positive rate above 98%. In addition, a novel segmentation algorithm is also designed to process candidate windows which is quantitatively and qualitatively proven to be very efficient in term of accuracy. The algorithm has been implemented in FPGA to obtain real-time processing speed. The system is designed fully pipeline and the inherent parallel structure of the algorithm is fully exploited to maximize the performance. The system is implemented on a Spartan-6 LXT45 Xilinx FPGA and it is capable of processing 98 frames of 640*480 24-bit color images per second.
Accurate design of corrugated waveguide low-pass filters using exclusively closed-form expressions

A simple, quasi-analytical, and accurate method to design classical corrugated rectangular waveguide low-pass filters is presented in this paper. Unlike in other published techniques, the dimensions of the final filter are directly obtained in a quasi-analytical manner following exclusively closed-form expressions and, in particular, using neither electromagnetic simulation nor optimization. Thus, our method is amenable to be implemented using an off-the-shelf mathematical software tool such as Matlab. The proposed method is based on the synthesis of the heights and lengths of the final structure taking into account the shunt capacitance effect (produced by the excitation of higher-order modes at the height steps) over the magnitude and phase of the local reflection coefficients. The novel method has been validated with the design of a classical Chebyshev corrugated low-pass filter of order 31, which shows a remarkable accordance between the ideal and simulated frequency responses.
Information Disclosure and Control on Facebook: Are They Two Sides of the Same Coin or Two Different Processes?

Facebook, the popular social network site, is changing the nature of privacy and the consequences of information disclosure. Despite recent media reports regarding the negative consequences of disclosing information on social network sites such as Facebook, students are generally thought to be unconcerned about the potential costs of this disclosure. The current study explored undergraduate students' information disclosure and information control on Facebook and the personality factors that influence levels of disclosure and control. Participants in this online survey were 343 undergraduate students who were current users of Facebook. Results indicated that participants perceived that they disclosed more information about themselves on Facebook than in general, but participants also reported that information control and privacy were important to them. Participants were very likely to have posted information such as their birthday and e-mail address, and almost all had joined an online network. They were also very likely to post pictures such as a profile picture, pictures with friends, and even pictures at parties and drinking with friends. Contrary to expectations, information disclosure and information control were not significantly negatively correlated, and multiple regression analyses revealed that while disclosure was significantly predicted by the need for popularity, levels of trust and self-esteem predicted information control. Therefore, disclosure and control on Facebook are not as closely related as expected but rather are different processes that are affected by different aspects of personality. Implications of these findings and suggestions for future research are discussed.
The theory of multidimensional persistence

Persistent homology captures the topology of a filtration - a one-parameter family of increasing spaces - in terms of a complete discrete invariant. This invariant is a multiset of intervals that denote the lifetimes of the topological entities within the filtration. In many applications of topology, we need to study a multifiltration: a family of spaces parameterized along multiple geometric dimensions. In this paper, we show that no similar complete discrete invariant exists for multidimensional persistence. Instead, we propose the rank invariant, a discrete invariant for the robust estimation of Betti numbers in a multifiltration, and prove its completeness in one dimension.
Systematic review of bankruptcy prediction models: Towards a framework for tool selection

The bankruptcy prediction research domain continues to evolve with many new different predictive models developed using various tools. Yet many of the tools are used with the wrong data conditions or for the wrong situation. Using the Web of Science, Business Source Complete and Engineering Village databases, a systematic review of 49 journal articles published between 2010 and 2015 was carried out. This review shows how eight popular and promising tools perform based on 13 key criteria within the bankruptcy prediction models research area. These tools include two statistical tools: multiple discriminant analysis and Logistic regression; and six artificial intelligence tools: artificial neural network, support vector machines, rough sets, case based reasoning, decision tree and genetic algorithm. The 13 criteria identified include accuracy, result transparency, fully deterministic output, data size capability, data dispersion, variable selection method required, variable types applicable, and more. Overall, it was found that no single tool is predominantly better than other tools in relation to the 13 identified criteria. A tabular and a diagrammatic framework are provided as guidelines for the selection of tools that best fit different situations. It is concluded that an overall better performance model can only be found by informed integration of tools to form a hybrid model. This paper contributes towards a thorough understanding of the features of the tools used to develop bankruptcy prediction models and their related shortcomings.
Strategy-Proofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions*

Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategy-proof if it always induces every committee member to cast a ballot revealing his preference. I prove three theorems. First, every strategy-proof voting procedure is dictatorial. Second, this paper’s strategy-proofness condition for voting procedures corresponds to Arrow’s rationality, independence of irrelevant alternatives, nonnegative response, and citizens’ sovereignty conditions for social welfare functions. Third, Arrow’s general possibility theorem is proven in a new manner.
Coherent Online Video Style Transfer

Training a feed-forward network for the fast neural style transfer of images has proven successful, but the naive extension of processing videos frame by frame is prone to producing flickering results. We propose the first end-toend network for online video style transfer, which generates temporally coherent stylized video sequences in near realtime. Two key ideas include an efficient network by incorporating short-term coherence, and propagating short-term coherence to long-term, which ensures consistency over a longer period of time. Our network can incorporate different image stylization networks and clearly outperforms the per-frame baseline both qualitatively and quantitatively. Moreover, it can achieve visually comparable coherence to optimization-based video style transfer, but is three orders of magnitude faster.
The joint student response analysis and recognizing textual entailment challenge: making sense of student responses in educational applications

We present the results of the Joint Student Response Analysis and 8th Recognizing Textual Entailment Challenge. The goal of this challenge was to bring together researchers from the Educational Natural Language Processing and Computational Semantics communities. The goal of the Student Response Analysis (SRA) task is to assess student responses to questions in the science domain, focusing on correctness and completeness of the response content. Nine teams took part in the challenge, submitting a total of 18 runs using methods and features adapted from previous research on Automated Short Answer Grading, Recognizing Textual Entailment and Semantic Textual Similarity. We provide an extended analysis of the results focusing on the impact of evaluation metrics, application scenarios and the methods and features used by the participants. We conclude that additional research is required to be able to leverage syntactic dependency features and external semantic resources for this task, possibly due to limited coverage of scientific domains in existing resources. However, each of three approaches to using features and models adjusted to application scenarios achieved better system performance, meriting further investigation by the research community. The research reported here was supported by the US ONR award N000141410733 and by the Institute of Education Sciences, U.S. Department of Education, through Grant R305A120808 to the University of North Texas. The opinions expressed are those of the authors and do not represent views of the Institute of Education Sciences or the U.S. Department of Education.  Dzikovska School of Informatics, University of Edinburgh, Edinburgh, United Kingdom E-mail: m.dzikovska@ed.ac.uk R.D. Nielsen University of North Texas, Denton, TX, USA E-mail: Rodney.Nielsen@UNT.edu Claudia Leacock McGraw Hill Education/CTB, USA E-mail: claudia.leacock@ctb.com 2 M. Dzikovska, R. Nielsen, C. Leacock
An analysis of social engineering principles in effective phishing

Phishing is a widespread practice and a lucrative business. It is invasive and hard to stop: a company needs to worry about all emails that all employees receive, while an attacker only needs to have a response from a key person, e.g., a finance or human resources' responsible, to cause a lot of damages. Some research has looked into what elements make phishing so successful. Many of these elements recall strategies that have been studied as principles of persuasion, scams and social engineering. This paper identifies, from the literature, the elements which reflect the effectiveness of phishing, and manually quantifies them within a phishing email sample. Most elements recognised as more effective in phishing commonly use persuasion principles such as authority and distraction. This insight could lead to better automate the identification of phishing emails and devise more appropriate countermeasures against them.
Elements of Information Theory

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.. Society for Industrial and Applied Mathematics is collaborating with JSTOR to digitize, preserve and extend access to SIAM Review.
Librispeech: An ASR corpus based on public domain audio books

This paper introduces a new corpus of read English speech, suitable for training and evaluating speech recognition systems. The LibriSpeech corpus is derived from audiobooks that are part of the LibriVox project, and contains 1000 hours of speech sampled at 16 kHz. We have made the corpus freely available for download, along with separately prepared language-model training data and pre-built language models. We show that acoustic models trained on LibriSpeech give lower error rate on the Wall Street Journal (WSJ) test sets than models trained on WSJ itself. We are also releasing Kaldi scripts that make it easy to build these systems.
Deep Forest: Towards An Alternative to Deep Neural Networks

In this paper, we propose gcForest, a decision tree ensemble approach with performance highly competitive to deep neural networks in a broad range of tasks. In contrast to deep neural networks which require great effort in hyper-parameter tuning, gcForest is much easier to train; even when it is applied to different data across different domains in our experiments, excellent performance can be achieved by almost same settings of hyper-parameters. The training process of gcForest is efficient, and users can control training cost according to computational resource available. The efficiency may be further enhanced because gcForest is naturally apt to parallel implementation. Furthermore, in contrast to deep neural networks which require largescale training data, gcForest can work well even when there are only small-scale training data.
A Simple Compact Reconfigurable Slot Antenna With a Very Wide Tuning Range

A simple and compact slot antenna with a very wide tuning range is proposed. A 25 mm (roughly equal to λH/8, where λH corresponds to the highest frequency of the tuning range) open slot is etched at the edge of the ground. To achieve the tunability, only two lumped elements, namely, a PIN diode and a varactor diode are used in the structure. By switching the PIN diode placed at the open end of the slot, the slot antenna can resonate as a standard slot (when the switch is on) or a half slot (when the switch is off). Continuous tuning over a wide frequency range in those two modes can be achieved by adjusting the reverse bias (giving different capacitances) of the varactor diode loaded in the slot. Through optimal design, the tuning bands of the two modes are stitched together to form a very wide tuning range. The fabricated prototype has a tuning frequency range from 0.42 GHz to 1.48 GHz with Sll better than -10 dB, giving a frequency ratio (fR = fu/fL) of 3.52:1. The measured full spherical radiation patterns show consistent radiation characteristics of the proposed antenna within the whole tuning range.
A geometric study of v-style pop-ups: theories and algorithms

Pop-up books are a fascinating form of paper art with intriguing geometric properties. In this paper, we present a systematic study of a simple but common class of pop-ups consisting of patches falling into four parallel groups, which we call v-style pop-ups. We give sufficient conditions for a v-style paper structure to be pop-uppable. That is, it can be closed flat while maintaining the rigidity of the patches, the closing and opening do not need extra force besides holding two patches and are free of intersections, and the closed paper is contained within the page border. These conditions allow us to identify novel mechanisms for making pop-ups. Based on the theory and mechanisms, we developed an interactive tool for designing v-style pop-ups and an automated construction algorithm from a given geometry, both of which guaranteeing the pop-uppability of the results.
PersonLab: Person Pose Estimation and Instance Segmentation with a Bottom-Up, Part-Based, Geometric Embedding Model

We present a box-free bottom-up approach for the tasks of pose estimation and instance segmentation of people in multi-person images using an efficient single-shot model. The proposed PersonLab model tackles both semantic-level reasoning and object-part associations using part-based modeling. Our model employs a convolutional network which learns to detect individual keypoints and predict their relative displacements, allowing us to group keypoints into person pose instances. Further, we propose a part-induced geometric embedding descriptor which allows us to associate semantic person pixels with their corresponding person instance, delivering instance-level person segmentations. Our system is based on a fully-convolutional architecture and allows for efficient inference, with runtime essentially independent of the number of people present in the scene. Trained on COCO data alone, our system achieves COCO test-dev keypoint average precision of 0.665 using single-scale inference and 0.687 using multi-scale inference, significantly outperforming all previous bottom-up pose estimation systems. We are also the first bottom-up method to report competitive results for the person class in the COCO instance segmentation task, achieving a person category average precision of 0.417.
Deep learning-based classification for brain-computer interfaces

Brain-computer interface (BCI) is an emerging area of research that aims to improve the quality of human-computer applications. It has enormous scope in biomedical applications, neural rehabilitation, biometric authentication, educational programmes, and entertainment applications. A BCI system has four major components: signal acquisition, signal preprocessing, feature extraction, and classification. In this study, we provide a comparison of various traditional classification algorithms to the newer methods of deep learning. We explore two different types of deep learning methods, namely, convolutional neural networks (CNN) and recurrent neural networks (RNN) with long short-term memory (LSTM) architecture. We test the classification accuracies on a recent 5-dass steady-state visual evoked potential (SSVEP) dataset. The results prove the superiority of deep learning methods in comparison with the traditional classification algorithms. Amongst the traditional classifiers, support vector machine (SVM) with Gaussian kernel employing sequential forward selection (SFS) of features provided a better classification accuracy of 66.09%, while CNN provided the highest classification accuracy of 69.03%.