nils-herrmann/clean_scirepeval huggingface dataset:
Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN

In Software Defined Networking (SDN) the control plane is physically separate from the forwarding plane. Control software programs the forwarding plane (e.g., switches and routers) using an open interface, such as OpenFlow. This paper aims to overcomes two limitations in current switching chips and the OpenFlow protocol: i) current hardware switches are quite rigid, allowing ``Match-Action'' processing on only a fixed set of fields, and ii) the OpenFlow specification only defines a limited repertoire of packet processing actions. We propose the RMT (reconfigurable match tables) model, a new RISC-inspired pipelined architecture for switching chips, and we identify the essential minimal set of action primitives to specify how headers are processed in hardware. RMT allows the forwarding plane to be changed in the field without modifying hardware. As in OpenFlow, the programmer can specify multiple match tables of arbitrary width and depth, subject only to an overall resource limit, with each table configurable for matching on arbitrary fields. However, RMT allows the programmer to modify all header fields much more comprehensively than in OpenFlow. Our paper describes the design of a 64 port by 10 Gb/s switch chip implementing the RMT model. Our concrete design demonstrates, contrary to concerns within the community, that flexible OpenFlow hardware switch implementations are feasible at almost no additional cost or power.
Speech recognition with deep recurrent neural networks

Recurrent neural networks (RNNs) are a powerful model for sequential data. End-to-end training methods such as Connectionist Temporal Classification make it possible to train RNNs for sequence labelling problems where the input-output alignment is unknown. The combination of these methods with the Long Short-term Memory RNN architecture has proved particularly fruitful, delivering state-of-the-art results in cursive handwriting recognition. However RNN performance in speech recognition has so far been disappointing, with better results returned by deep feedforward networks. This paper investigates deep recurrent neural networks, which combine the multiple levels of representation that have proved so effective in deep networks with the flexible use of long range context that empowers RNNs. When trained end-to-end with suitable regularisation, we find that deep Long Short-term Memory RNNs achieve a test set error of 17.7% on the TIMIT phoneme recognition benchmark, which to our knowledge is the best recorded score.
A State-Space Approach to Dynamic Nonnegative Matrix Factorization

Nonnegative matrix factorization (NMF) has been actively investigated and used in a wide range of problems in the past decade. A significant amount of attention has been given to develop NMF algorithms that are suitable to model time series with strong temporal dependencies. In this paper, we propose a novel state-space approach to perform dynamic NMF (D-NMF). In the proposed probabilistic framework, the NMF coefficients act as the state variables and their dynamics are modeled using a multi-lag nonnegative vector autoregressive (N-VAR) model within the process equation. We use expectation maximization and propose a maximum-likelihood estimation framework to estimate the basis matrix and the N-VAR model parameters. Interestingly, the N-VAR model parameters are obtained by simply applying NMF. Moreover, we derive a maximum a posteriori estimate of the state variables (i.e., the NMF coefficients) that is based on a prediction step and an update step, similarly to the Kalman filter. We illustrate the benefits of the proposed approach using different numerical simulations where D-NMF significantly outperforms its static counterpart. Experimental results for three different applications show that the proposed approach outperforms two state-of-the-art NMF approaches that exploit temporal dependencies, namely a nonnegative hidden Markov model and a frame stacking approach, while it requires less memory and computational power.
High quality compatible triangulations for 2D shape morphing

We propose a new method to compute compatible triangulations of two polygons in order to create a smooth geometric transformation between them. Compared with existing methods, our approach creates triangulations of better quality, that is, triangulations with fewer long thin triangles and Steiner points. This results in visually appealing morphing when transforming the shape from one to another. Our method consists of three stages. First, we compatibly decompose the target and source polygons into a set of sub-polygons, in which each source sub-polygon is triangulated. Second, we map the triangulation of a source sub-polygon onto the corresponding sub-polygon of the target polygon using linear transformation, thereby generating the compatible meshes between the source and the target. Third, we refine the compatible meshes, which can create better quality planar shape morphing with detailed textures. Experimental results show that our method can create compatible meshes of higher quality compared with existing methods, which facilitates smoother morphing process. The proposed algorithm is robust and computationally efficient. It can be applied to produce convincing transformations such as interactive 2D animation creation and special effects in movies.
Microcontroller Based Smart Helmet Using GSM & GPRS

The thought of developing this proposed model comes from social responsibility towards the society. Lack of immediate First Aid and Emergency medical services during accident are prime cause of death in majority of cases of accidents. The one of the main reasons for this may be late arrival of ambulance, no person at place of accident to give information to the ambulance. This thought of taking responsibility of society resulted in our proposed model “Microcontroller based smart helmet using GSM & GPRS”. The aim of this proposed model design is to inform the responsible persons at the earliest about the accident so that they can take required actions to save the life of the injured person. Our proposed system consists of Arduino as Microcontroller, GSM for calling purpose, GPRS for tracking purpose and mainly Sensors to detect the accident. Our proposed system detects the accident and sends text message along with a voice message within a minute to the registered number.
The GUM corpus: creating multilayer resources in the classroom

This paper presents the methodology, design principles and detailed evaluation of a new freely available multilayer corpus, collected and edited via classroom annotation using collaborative software. After briefly discussing corpus design for open, extensible corpora, five classroom annotation projects are presented, covering structural markup in TEI XML, multiple part of speech tagging, constituent and dependency parsing, information structural and coreference annotation, and Rhetorical Structure Theory analysis. Layers are inspected for annotation quality and together they coalesce to form a richly annotated corpus that can be used to study the interactions between different levels of linguistic description. The evaluation gives an indication of the expected quality of a corpus created by students with relatively little training. A multifactorial example study on lexical NP coreference likelihood is also presented, which illustrates some applications of the corpus. The results of this project show that high quality, richly annotated resources can be created effectively as part of a linguistics curriculum, opening new possibilities not just for research, but also for corpora in linguistics pedagogy.
Desh: deep learning for system health prediction of lead times to failure in HPC

Today's large-scale supercomputers encounter faults on a daily basis. Exascale systems are likely to experience even higher fault rates due to increased component count and density. Triggering resilience-mitigating techniques remains a challenge due to the absence of well defined failure indicators. System logs consist of unstructured text that obscures essential system health information contained within. In this context, efficient failure prediction via log mining can enable proactive recovery mechanisms to increase reliability.
 This work aims to predict node failures that occur in supercomputing systems via long short-term memory (LSTM) networks that exploit recurrent neural networks (RNNs). Our framework, Desh1 (<u>De</u>ep Learning for <u>S</u>ystem <u>H</u>ealth), diagnoses and predicts failures with short lead times. Desh identifies failure indicators with enhanced training and classification for generic applicability to logs from operating systems and software components without the need to modify any of them. Desh uses a novel three-phase deep learning approach to (1) train to recognize chains of log events leading to a failure, (2) re-train chain recognition of events augmented with expected lead times to failure, and (3) predict lead times during testing/inference deployment to predict which specific node fails in how many minutes. Desh obtains as high as 3 minutes average lead time with no less than 85% recall and 83% accuracy to take proactive actions on the failing nodes, which could be used to migrate computation to healthy nodes.
Adaptive Background Mixture Models for Real-Time Tracking

A common method for real-time segmentation of moving regions in image sequences involves “background subtraction,” or thresholding the error between an estimate of the image without moving objects and the current image. The numerous approaches to this problem differ in the type of background model used and the procedure used to update the model. This paper discusses modeling each pixel as a mixture of Gaussians and using an on-line approximation to update the model. The Gaussian distributions of the adaptive mixture model are then evaluated to determine which are most likely to result from a background process. Each pixel is classified based on whether the Gaussian distribution which represents it most effectively is considered part of the background model. This results in a stable, real-time outdoor tracker which reliably deals with lighting changes, repetitive motions from clutter, and long-term scene changes. This system has been run almost continuously for 16 months, 24 hours a day, through rain and snow.
Text Analytics in Social Media

The rapid growth of online social media in the form of collaborativelycreated content presents new opportunities and challenges to both producers and consumers of information. With the large amount of data produced by various social media services, text analytics provides an effective way to meet usres’ diverse information needs. In this chapter, we first introduce the background of traditional text analytics and the distinct aspects of textual data in social media. We next discuss the research progress of applying text analytics in social media from different perspectives, and show how to improve existing approaches to text representation in social media, using real-world examples.
Unsupervised Learning for Solving RSS Hardware Variance Problem in WiFi Localization

Hardware variance can significantly degrade the positional accuracy of RSS-based WiFi localization systems. Although manual adjustment can reduce positional error, this solution is not scalable as the number of new WiFi devices increases. We propose an unsupervised learning method to automatically solve the hardware variance problem in WiFi localization. This method was designed and implemented in a working WiFi positioning system and evaluated using different WiFi devices with diverse RSS signal patterns. Experimental results demonstrate that the proposed learning method improves positional accuracy within 100 s of learning time.
Fractal Merkle Tree Representation and Traversal

We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For one choice of parameters, and a total of N leaves, our technique requires a worst-case computational effort of 2 log N/loglog N hash function evaluations per output, and a total storage capacity of less than 1.5 log N/loglog N hash values. This is a simultaneous improvement both in space and time complexity over any previously published algorithm.
Where Do Creative Interactions Come From? The Role of Tie Content and Social Networks

U the determinants of creativity at the individual and organizational level has been the focus of a long history of research in various disciplines from the social sciences, but little attention has been devoted to studying creativity at the dyadic level. Why are some dyadic interactions more likely than others to trigger the generation of novel and useful ideas in organizations? As dyads conduit both knowledge and social forces, they offer an ideal setting to disentangle the effects of knowledge diversity, tie strength, and network structure on the generation of creative thoughts. This paper not only challenges the current belief that sporadic and distant dyadic relationships (weak ties) foster individual creativity but also argues that diverse and strong ties facilitate the generation of creative ideas. From a knowledge viewpoint, our results suggest that ties that transmit a wide (rather than narrow) set of knowledge domains (within the same tie) favor creative idea generation if exchanges occur with sufficient frequency. From a social perspective, we find that strong ties serve as effective catalysts for the generation of creative ideas when they link actors who are intrinsically motivated to work closely together. Finally, this paper also shows that dyadic network cohesion (i.e., the connections from the focal dyad to common contacts) does not always hinder the generation of creative ideas. Our empirical evidence suggests that when cohesion exceeds its average levels, it becomes detrimental to creative idea generation. Hypotheses are tested in a sociometric study conducted within the development department of a software firm.
Implicit and explicit ethnocentrism: revisiting the ideologies of prejudice.

Two studies investigated relationships among individual differences in implicit and explicit prejudice, right-wing ideology, and rigidity in thinking. The first study examined these relationships focusing on White Americans' prejudice toward Black Americans. The second study provided the first test of implicit ethnocentrism and its relationship to explicit ethnocentrism by studying the relationship between attitudes toward five social groups. Factor analyses found support for both implicit and explicit ethnocentrism. In both studies, mean explicit attitudes toward out groups were positive, whereas implicit attitudes were negative, suggesting that implicit and explicit prejudices are distinct; however, in both studies, implicit and explicit attitudes were related (r = .37, .47). Latent variable modeling indicates a simple structure within this ethnocentric system, with variables organized in order of specificity. These results lead to the conclusion that (a) implicit ethnocentrism exists and (b) it is related to and distinct from explicit ethnocentrism.
Autonomy and Reliability of Continuous Active Learning for Technology-Assisted Review

We enhance the autonomy of the continuous active learning method shown by Cormack and Grossman (SIGIR 2014) to be effective for technology-assisted review, in which documents from a collection are retrieved and reviewed, using relevance feedback, until substantially all of the relevant documents have been reviewed. Autonomy is enhanced through the elimination of topic-specific and dataset-specific tuning parameters, so that the sole input required by the user is, at the outset, a short query, topic description, or single relevant document; and, throughout the review, ongoing relevance assessments of the retrieved documents. We show that our enhancements consistently yield superior results to Cormack and Grossman’s version of continuous active learning, and other methods, not only on average, but on the vast majority of topics from four separate sets of tasks: the legal datasets examined by Cormack and Grossman, the Reuters RCV1-v2 subject categories, the TREC 6 AdHoc task, and the construction of the TREC 2002 filtering test collection.
The Adaptation of “ Attitudes toward Research ( ATR ) ” Scale into Turkish

The aim of this study is to adapt The Scale of Attitude toward Research (ATR), which was developed by Papanastasiou (2005), to Turkish culture. In order to determine whether the Turkish translation of scale was appropriate in terms of language or not, English and Turkish forms of scale were applied to 25, third year students who participated voluntarily studying in English language teaching department for two weeks. The language validity provided scale was put through Confirmatory Factor Analysis (CFA) with the data obtained from 391 people, and item total correlation and item discrimination were examined. According to CFA and item analysis results, the scale has maintained its original form in Turkish culture. For the total scale, Cronbach Alpha coefficient was revealed .92.
Where to publish and find ontologies? A survey of ontology libraries

One of the key promises of the Semantic Web is its potential to enable and facilitate data interoperability. The ability of data providers and application developers to share and reuse ontologies is a critical component of this data interoperability: if different applications and data sources use the same set of well defined terms for describing their domain and data, it will be much easier for them to "talk" to one another. Ontology libraries are the systems that collect ontologies from different sources and facilitate the tasks of finding, exploring, and using these ontologies. Thus ontology libraries can serve as a link in enabling diverse users and applications to discover, evaluate, use, and publish ontologies. In this paper, we provide a survey of the growing-and surprisingly diverse-landscape of ontology libraries. We highlight how the varying scope and intended use of the libraries a ects their features, content, and potential exploitation in applications. From reviewing eleven ontology libraries, we identify a core set of questions that ontology practitioners and users should consider in choosing an ontology library for finding ontologies or publishing their own. We also discuss the research challenges that emerge from this survey, for the developers of ontology libraries to address.
On multiple foreground cosegmentation

In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo sets where a finite number of K foregrounds of interest repeatedly occur cross the entire photo set, but only an unknown subset of them is presented in each image. This contrasts the classical cosegmentation problem dealt with by most existing algorithms, which assume a much simpler but less realistic setting where the same set of foregrounds recurs in every image. We propose a novel optimization method for MFC, which makes no assumption on foreground configurations and does not suffer from the aforementioned limitation, while still leverages all the benefits of having co-occurring or (partially) recurring contents across images. Our method builds on an iterative scheme that alternates between a foreground modeling module and a region assignment module, both highly efficient and scalable. In particular, our approach is flexible enough to integrate any advanced region classifiers for foreground modeling, and our region assignment employs a combinatorial auction framework that enjoys several intuitively good properties such as optimality guarantee and linear complexity. We show the superior performance of our method in both segmentation quality and scalability in comparison with other state-of-the-art techniques on a newly introduced FlickrMFC dataset and the standard ImageNet dataset.
Blockchain and its uses

Blockchain, the technology behind most cryptocurrencies that exist today, offers a paradigm shifting technology that has the potential to transform the way that we record and verify events on the Internet. By offering a decentralized, immutable, community verified record of transactions, regardless of what these transactions represent, blockchain technology promises to transform many industries. In this paper, we provide a survey of this very important technology and discuss its possible use-cases and its effect on society. The purpose of this paper is to familiarize the reader with the current state-of-the-art in the blockchain world both in terms of technology and social impact.
Unilateral gestational macromastia--a rare disorder.

Macromastia is the massive enlargement of the breast, unilateral or bilateral, disproportionate to the growth of the rest of the body. It is called gravid macromastia or gigantomastia of pregnancy when it occurs during pregnancy. It may or may not regress following parturition. Gestational macromastia is exceptionally rare. We report a 28-year-old female with gigantomastia of the left breast. She presented at four months post-partum with painful massive enlargement of the left breast since the third month of pregnancy. The overlying skin was stretched out and showed multiple ulcers with foul smelling discharge. The nipple and areola were unremarkable. Simple mastectomy was done, as fine needle aspiration cytology was suggestive of phylloides tumour. The breast specimen measured 30 x 30 x 9 cm and was replaced totally by grey-white tissue involving all the resection margins. No normal breast tissue or fat was identified. Histopathology showed periductal as well as diffuse fibrosis, adenosis and lactational changes. No features of phylloides tumour or carcinoma were present and it was diagnosed as unilateral gestational macromastia.
A multi-view intelligent editor for digital video libraries

Silver is an authoring tool that aims to allow novice users to edit di gital video. The goal is to make editing of digital video as easy as text editing. Silver provides multiple coordinated views, including project, source, outline, subject, storyboard, textual transcript and timeline views. Selections and edits in any view are synchronized with all other views. A variety of recognition algorithms are applied to the video and audio content and then are used to aid in the editing tasks. The Informedia Digital Library supplies the recognition algorithms and metadata used to support intelligent editing, and Informedia also provides search and a repository. The metadata includes shot boundaries and a time-synchronized transcript, which are used to support intelligent selection and intelligent cut/copy/paste.
Quantum resistant public key cryptography: a survey

Public key cryptography is widely used to secure transactions over the Internet. However, advances in quantum computers threaten to undermine the security assumptions upon which currently used public key cryptographic algorithms are based. In this paper, we provide a survey of some of the public key cryptographic algorithms that have been developed that, while not currently in widespread use, are believed to be resistant to quantum computing based attacks and discuss some of the issues that protocol designers may need to consider if there is a need to deploy these algorithms at some point in the future.