nils-herrmann/clean_scirepeval huggingface dataset:
Iterative methods for sparse linear systems

Sometimes we need to solve the linear equation Ax = b for a very big and very sparse A. For example, the Poisson equation where only 5 entries of each row of the matrix A are non-zero. Standard methods such as inverting the matrix A (numerically unstable) or Guass elimination do not take advantage of the sparsity of A. In this lesson we will discuss two iterative methods suitable for sparse linear systems: Jacobi and Gauss-Seidel.
MUC-4 evaluation metrics

The MUC-4 evaluation metrics measure the performance of the message understanding systems . This paper describes the scoring algorithms used to arrive at the metrics as well as the improvements that were made to th e MUC-3 methods . MUC-4 evaluation metrics were stricter than those used in MUC-3. Given the differences in scoring between MUC-3 and MUC-4, the MUC-4 systems' scores represent a larger improvement over MUC-3 performance than the numbers themselves suggest .
A Frame of Mind: Using Statistical Models for Detection of Framing and Agenda Setting Campaigns

Framing is a sophisticated form of discourse in which the speaker tries to induce a cognitive bias through consistent linkage between a topic and a specific context (frame). We build on political science and communication theory and use probabilistic topic models combined with time series regression analysis (autoregressive distributed-lag models) to gain insights about the language dynamics in the political processes. Processing four years of public statements issued by members of the U.S. Congress, our results provide a glimpse into the complex dynamic processes of framing, attention shifts and agenda setting, commonly known as ‘spin’. We further provide new evidence for the divergence in party discipline in U.S. politics.
Sensor Systems for Prognostics and Health Management

Prognostics and health management (PHM) is an enabling discipline consisting of technologies and methods to assess the reliability of a product in its actual life cycle conditions to determine the advent of failure and mitigate system risk. Sensor systems are needed for PHM to monitor environmental, operational, and performance-related characteristics. The gathered data can be analyzed to assess product health and predict remaining life. In this paper, the considerations for sensor system selection for PHM applications, including the parameters to be measured, the performance needs, the electrical and physical attributes, reliability, and cost of the sensor system, are discussed. The state-of-the-art sensor systems for PHM and the emerging trends in technologies of sensor systems for PHM are presented.
A consumer transceiver for long-range IoT communications in emergency environments

As an emerging technology, IoT enables a machine-to-machine connectivity without a network infrastructure. Therefore, IoT is strongly considered a technology for communications in emergency environments. Especially, a WiFi protocol is under standardization as IEEE802.11ah for IoT-based long-range communications. However, the service range is not enough to cover a communication area in emergency situations. This paper addresses a consumer transceiver for long range communications of IoT in emergency environments. The transceiver is based on IEEE802.11ah WiFi protocol which is under standardization for low-cost and low-power services. In this paper, a novel architecture for the transceiver is proposed in order to increase the service range of IEEE802.11ah, which is necessary for the long-range IoT communication of emergency messages in emergency situations. Experimental results show that the presented architecture is suitable for the long-range IoT communication of emergency alert messages.
Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs

Most analysis of web search relevance and performance takes a single query as the unit of search engine interaction. When studies attempt to group queries together by task or session, a timeout is typically used to identify the boundary. However, users query search engines in order to accomplish tasks at a variety of granularities, issuing multiple queries as they attempt to accomplish tasks. In this work we study real sessions manually labeled into hierarchical tasks, and show that timeouts, whatever their length, are of limited utility in identifying task boundaries, achieving a maximum precision of only 70%. We report on properties of this search task hierarchy, as seen in a random sample of user interactions from a major web search engine's log, annotated by human editors, learning that 17% of tasks are interleaved, and 20% are hierarchically organized. No previous work has analyzed or addressed automatic identification of interleaved and hierarchically organized search tasks. We propose and evaluate a method for the automated segmentation of users' query streams into hierarchical units. Our classifiers can improve on timeout segmentation, as well as other previously published approaches, bringing the accuracy up to 92% for identifying fine-grained task boundaries, and 89-97% for identifying pairs of queries from the same task when tasks are interleaved hierarchically. This is the first work to identify, measure and automatically segment sequences of user queries into their hierarchical structure. The ability to perform this kind of segmentation paves the way for evaluating search engines in terms of user task completion.
An Accelerator for High Efficient Vision Processing

In recent years, neural network accelerators have been shown to achieve both high energy efficiency and high performance for a broad application scope within the important category of recognition and mining applications. Still, both the energy efficiency and performance of such accelerators remain limited by memory accesses. In this paper, we focus on image applications, arguably the most important category among recognition and mining applications. The neural networks which are state-of-the-art for these applications are convolutional neural networks (CNNs), and they have an important property: weights are shared among many neurons, considerably reducing the neural network memory footprint. This property allows to entirely map a CNN within an SRAM, eliminating all DRAM accesses for weights. By further hoisting this accelerator next to the image sensor, it is possible to eliminate all remaining DRAM accesses, i.e., for inputs and outputs. In this paper, we propose such a CNN accelerator, placed next to a CMOS or CCD sensor. The absence of DRAM accesses combined with a careful exploitation of the specific data access patterns within CNNs allows us to design an accelerator which is highly energy-efficient. We present a single-core implementation down to the layout at 65 nm, with a modest footprint of 5.94mm $^{\boldsymbol {2}}$  and consuming only 336mW, but still about  $\boldsymbol {30\times }$  faster than high-end GPUs. For visual processing with higher resolution and frame-rate requirements, we further present a multicore implementation with elevated performance.
Survey on Reliability of Power Electronic Systems

With wide-spread application of power electronic systems across many different industries, their reliability is being studied extensively. This paper presents a comprehensive review of reliability assessment and improvement of power electronic systems from three levels: 1) metrics and methodologies of reliability assessment of existing system; 2) reliability improvement of existing system by means of algorithmic solutions without change of the hardware; and 3) reliability-oriented design solutions that are based on fault-tolerant operation of the overall systems. The intent of this review is to provide a clear picture of the landscape of reliability research in power electronics. The limitations of the current research have been identified and the direction for future research is suggested.
Offloading in Heterogeneous Networks: Modeling, Analysis, and Design Insights

Pushing data traffic from cellular to WiFi is an example of inter radio access technology (RAT) offloading. While this clearly alleviates congestion on the over-loaded cellular network, the ultimate potential of such offloading and its effect on overall system performance is not well understood. To address this, we develop a general and tractable model that consists of M different RATs, each deploying up to K different tiers of access points (APs), where each tier differs in transmit power, path loss exponent, deployment density and bandwidth. Each class of APs is modeled as an independent Poisson point process (PPP), with mobile user locations modeled as another independent PPP, all channels further consisting of i.i.d. Rayleigh fading. The distribution of rate over the entire network is then derived for a weighted association strategy, where such weights can be tuned to optimize a particular objective. We show that the optimum fraction of traffic offloaded to maximize SINR coverage is not in general the same as the one that maximizes rate coverage, defined as the fraction of users achieving a given rate.
Factors contributing to attrition behavior in diabetes self-management programs: A mixed method approach

Diabetes self-management education is a critical component in diabetes care. Despite worldwide efforts to develop efficacious DSME programs, high attrition rates are often reported in clinical practice. The objective of this study was to examine factors that may contribute to attrition behavior in diabetes self-management programs.



We conducted telephone interviews with individuals who had Type 2 diabetes (n = 267) and attended a diabetes education centre. Multivariable logistic regression was performed to identify factors associated with attrition behavior. Forty-four percent of participants (n = 118) withdrew prematurely from the program and were asked an open-ended question regarding their discontinuation of services. We used content analysis to code and generate themes, which were then organized under the Behavioral Model of Health Service Utilization.



Working full and part-time, being over 65 years of age, having a regular primary care physician or fewer diabetes symptoms were contributing factors to attrition behaviour in our multivariable logistic regression. The most common reasons given by participants for attrition from the program were conflict between their work schedules and the centre's hours of operation, patients' confidence in their own knowledge and ability when managing their diabetes, apathy towards diabetes education, distance to the centre, forgetfulness, regular physician consultation, low perceived seriousness of diabetes, and lack of familiarity with the centre and its services. There was considerable overlap between our quantitative and qualitative results.



Reducing attrition behaviour requires a range of strategies targeted towards delivering convenient and accessible services, familiarizing individuals with these services, increasing communication between centres and their patients, and creating better partnerships between centres and primary care physicians.
Greed is good: Approximating independent sets in sparse and bounded-degree graphs

Theminimum-degree greedy algorithm, or Greedy for short, is a simple and well-studied method for finding independent sets in graphs. We show that it achieves a performance ratio of (Δ+2)/3 for approximating independent sets in graphs with degree bounded by Δ. The analysis yields a precise characterization of the size of the independent sets found by the algorithm as a function of the independence number, as well as a generalization of Turán’s bound. We also analyze the algorithm when run in combination with a known preprocessing technique, and obtain an improved $$(2\bar d + 3)/5$$ performance ratio on graphs with average degree $$\bar d$$ , improving on the previous best $$(\bar d + 1)/2$$ of Hochbaum. Finally, we present an efficient parallel and distributed algorithm attaining the performance guarantees of Greedy.
OpenFlow: enabling innovation in campus networks

This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day. OpenFlow is based on an Ethernet switch, with an internal flow-table, and a standardized interface to add and remove flow entries. Our goal is to encourage networking vendors to add OpenFlow to their switch products for deployment in college campus backbones and wiring closets. We believe that OpenFlow is a pragmatic compromise: on one hand, it allows researchers to run experiments on heterogeneous switches in a uniform way at line-rate and with high port-density; while on the other hand, vendors do not need to expose the internal workings of their switches. In addition to allowing researchers to evaluate their ideas in real-world traffic settings, OpenFlow could serve as a useful campus component in proposed large-scale testbeds like GENI. Two buildings at Stanford University will soon run OpenFlow networks, using commercial Ethernet switches and routers. We will work to encourage deployment at other schools; and We encourage you to consider deploying OpenFlow in your university network too
Improved Fully Differential Analog Filters

This paper proposes two novel design techniques that improve the performance of fully differential filters built by coupling two equal single-ended filters. These filters usually reach a high common-mode rejection ratio (CMRR) without using tightly matched passive components but may become unstable because of common-mode signals. Previously proposed techniques to solve these problems, based on resistor or capacitor T-networks, reduce the CMRR. The two techniques proposed overcome this tradeoff. The first technique improves the stability of the filter common-mode gain by adding damping resistors that do not modify the desired differential frequency response or the CMRR. The second technique, which is particularly valuable when a path for input bias currents must be provided, uses a resistor network to estimate the common-mode voltage of the input and uses it as common ground voltage for the filter.
Network neutrality on the Internet: A two-sided market analysis

We discuss network neutrality regulation of the Internet in the context of a two-sided market model. Platforms sell broadband Internet access services to residential consumers and may set fees to content and application providers on the Internet. When access is monopolized, cross-group externalities (network effects) can give a rationale for network neutrality regulation (requiring zero fees to content providers): there exist parameter ranges for which network neutrality regulation increases the total surplus compared to the fully private optimum at which the monopoly platform imposes positive fees on content providers. However, for other parameter values, network neutrality regulation can decrease total surplus. Extending the model to a duopoly of residential broadband ISPs, we again find parameter values such that network neutrality regulation increases total surplus suggesting that network neutrality regulation could be warranted even when some competition is present.
Attribute-Based Messaging: Access Control and Confidentiality

Attribute-Based Messaging (ABM) enables messages to be addressed using attributes of recipients rather than an explicit list of recipients. Such messaging offers benefits of efficiency, exclusiveness, and intensionality, but faces challenges in access control and confidentiality. In this article we explore an approach to intraenterprise ABM based on providing access control and confidentiality using information from the same attribute database exploited by the addressing scheme. We show how to address three key challenges. First, we demonstrate a manageable access control system based on attributes. Second, we demonstrate use of attribute-based encryption to provide end-to-end confidentiality. Third, we show that such a system can be efficient enough to support ABM for mid-size enterprises. Our implementation can dispatch confidential ABM messages approved by XACML policy review for an enterprise of at least 60,000 users with only seconds of latency.
Bio-medical ( EMG ) Signal Analysis and Feature Extraction Using Wavelet Transform

In this paper, the multi-channel electromyogram acquisition system is being developed using programmable system on chip (PSOC) microcontroller to obtain the surface of EMG signal. The two pairs of single-channel surface electrodes are utilized to measure the EMG signal obtained from forearm muscles. Then different levels of Wavelet family are used to analyze the EMG signal. Later features in terms of root mean square, logarithm of root mean square, centroid of frequency, as well as standard deviation were used to extract the EMG signal. The proposed method of feature extraction for extracting EMG signal states that root means square feature extraction method gives better performance as compared to the other features. In the near future, this method can be used to control a mechanical arm as well as robotic arm in field of real-time processing.
CypherDB: A Novel Architecture for Outsourcing Secure Database Processing

CypherDB addresses the problem of protecting the confidentiality of database stored externally in a cloud and enabling efficient computation over it to thwart any curious-but-honest cloud computing service provider. It works by encrypting the entire outsourced database and executing queries over the encrypted data using our novel CypherDB secure processor architecture. To optimize computational efficiency, our proposed processor architecture provides tightly-coupled datapaths that avoid information leakage during database access and query execution. Our simulation using a well-known database benchmark TPC-H over a commercial grade Database Management System (SQLite) demonstrates that our proposed architecture incurs an average of about 10 percent overhead when compared with the same set of operations without secure database processing.
Compiling C/C++ SIMD Extensions for Function and Loop Vectorizaion on Multicore-SIMD Processors

SIMD vectorization has received significant attention in the past decade as an important method to accelerate scientific applications, media and embedded applications on SIMD architectures such as Intel® SSE, AVX, and IBM* AltiVec. However, most of the focus has been directed at loops, effectively executing their iterations on multiple SIMD lanes concurrently relying upon program hints and compiler analysis. This paper presents a set of new C/C++ high-level vector extensions for SIMD programming, and the Intel® C++ product compiler that is extended to translate these vector extensions and produce optimized SIMD instruction sequences of vectorized functions and loops. For a function, our main idea is to vectorize the entire function for callers instead of just vectorizing loops (if any) inside the function. It poses the challenge of dealing with complicated control-flow in the function body, and matching caller and callee for SIMD vector calls while vectorizing caller functions (or loops) and callee functions. Our compilation methods for automatically compiling vector extensions are described. We present performance results of several non-trivial visual computing, computational, and simulation workloads, utilizing SIMD units through the vector extensions on Intel® Multicore 128-bit SIMD processors, and we show that significant SIMD speedups (3.07x to 4.69x) are achieved over the serial execution.
Agile software testing in a large-scale project

Agile software development in general and Extreme Programming (XP) in particular, promote radical changes in how software development organizations traditionally work. We present and analyze new data from a real, large-scale agile project to develop a business-critical enterprise information system for the Israeli Air Force (IAF). Our results offer new evidence that agile testing practices actually work, dramatically improving development quality and productivity. We describe the organization's successful practices and guidelines in four key areas: test design and activity execution, working with professional testers, planning, and defect management
Topic Modelling of Empirical Text Corpora: Validity, Reliability, and Reproducibility in Comparison to Semantic Maps

Using the 6,638 case descriptions of societal impact submitted for evaluation in the Research Excellence Framework (REF 2014), we replicate the topic model (Latent Dirichlet Allocation or LDA) made in this context and compare the results with factor-analytic results using a traditional word-document matrix (Principal Component Analysis or PCA). Removing a small fraction of documents from the sample, for example, has on average a much larger impact on LDA than on PCA-based models to the extent that the largest distortion in the case of PCA has less effect than the smallest distortion of LDA-based models. In terms of semantic coherence, however, LDA models outperform PCA-based models. The topic models inform us about the statistical properties of the document sets under study, but the results are statistical and should not be used for a semantic interpretation—for example, in grant selections and micro-decision making, or scholarly work—without follow-up using domain-specific semantic maps.
From Distributional Semantics to Conceptual Spaces: A Novel Computational Method for Concept Creation

We investigate the relationship between lexical spaces and contextually-defined conceptual spaces, offering applications to creative concept discovery. We define a computational method for discovering members of concepts based on semantic spaces: starting with a standard distributional model derived from corpus co-occurrence statistics, we dynamically select characteristic dimensions associated with seed terms, and thus a subspace of terms defining the related concept. This approach performs as well as, and in some cases better than, leading distributional semantic models on a WordNet-based concept discovery task, while also providing a model of concepts as convex regions within a space with interpretable dimensions. In particular, it performs well on more specific, contextualized concepts; to investigate this we therefore move beyond WordNet to a set of human empirical studies, in which we compare output against human responses on a membership task for novel concepts. Finally, a separate panel of judges rate both model output and human responses, showing similar ratings in many cases, and some commonalities and divergences which reveal interesting issues for computational concept discovery.
Selective stiffening of soft actuators based on jamming

The ability to selectively stiffen otherwise compliant soft actuators increases their versatility and dexterity. We investigate granular jamming and layer jamming as two possible methods to achieve stiffening with PneuFlex actuators, a type of soft continuum actuator. The paper details five designs of jamming compartments that can be attached to an actuator. We evaluate the stiffening of the five different prototypes, achieving an up to 8-fold increase in stiffness. The strength of the most effective prototype based on layer jamming is also validated in the context of pushing buttons, resulting in an 2.23-fold increase in pushing force.