nils-herrmann/clean_scirepeval huggingface dataset:
Protocol design and throughput analysis for multi-user cognitive cooperative systems

This paper deals with protocol design for cognitive cooperative systems with many secondary users. In contrast with previous cognitive configurations, the channel model considered assumes a cluster of secondary users which perform both a sensing process for transmitting opportunities and can relay data for the primary user. Appropriate relaying improves the throughput of the primary users and can increase the transmission opportunities for the cognitive users. Based on different multi-access protocols, the schemes investigated enable relaying either between the primary user and a selected secondary user or between two selected secondary users. This collaboration can be a simple distributed multiple-input single-output transmission of the primary data or a simultaneous transmission of primary and secondary data using dirty-paper coding (DPC). The parametrization of DPC as well as its combination with opportunistic relay selection yields an interesting trade-off between the primary and the secondary performance which is investigated by theoretical and simulation results under the perspective of a desired primary throughput. The proposed protocols are studied from a networking point of view and the stable throughput for primary and secondary users is derived based on the principles of queueing theory.
A SURVEY OF DISTRIBUTED FILE SYSTEMS

This paper is a survey of the current state of the art in the design and implementation of distributed file systems. It consists of four major parts: an overview of background material, case studies of a number of contemporary file systems, identification of key design techniques, and an examination of current research issues. The systems surveyed are Sun NFS, Apollo Domain, Andrew, IBM AIX DS, AT&T RFS, and Sprite. The coverage of background material includes a taxonomy of file system issues, a brief history of distributed file systems, and a summary of empirical research on file properties. A comprehensive bibliography forms an important of the paper.
Fingertip Detection and Tracking for Recognition of Air-Writing in Videos

Air-writing is the process of writing characters or words in free space using finger or hand movements without the aid of any hand-held device. In this work, we address the problem of mid-air finger writing using web-cam video as input. In spite of recent advances in object detection and tracking, accurate and robust detection and tracking of the fingertip remains a challenging task, primarily due to small dimension of the fingertip. Moreover, the initialization and termination of mid-air finger writing is also challenging due to the absence of any standard delimiting criterion. To solve these problems, we propose a new writing hand pose detection algorithm for initialization of air-writing using the Faster R-CNN framework for accurate hand detection followed by hand segmentation and finally counting the number of raised fingers based on geometrical properties of the hand. Further, we propose a robust fingertip detection and tracking approach using a new signature function called distance-weighted curvature entropy. Finally, a fingertip velocity-based termination criterion is used as a delimiter to mark the completion of the air-writing gesture. Experiments show the superiority of ∗Corresponding author.  Email address: sohom31011997@gmail.com (*Sohom Mukherjee)  2018 ar X iv :1 80 9. 03 01 6v 1 [ cs .C V ] 9 S ep 2 01 8 the proposed fingertip detection and tracking algorithm over state-of-the-art approaches giving a mean precision of 73.1 % while achieving real-time performance at 18.5 fps, a condition which is of vital importance to air-writing. Character recognition experiments give a mean accuracy of 96.11 % using the proposed air-writing system, a result which is comparable to that of existing handwritten character recognition systems.
Smart antennas for satellite communications on the move

Smart antennas are important for SATCOM on-the-move (SOTM) because they can increase the channel capacity and coverage range of the communication systems. Firstly, this paper briefly reviews the state-of-art on the smart antenna design for SOTM applications. Different types of antenna for SOTM are discussed. Then, two design examples from the recent collaborated research work from the University of Kent are presented. One is a Ka-band low-cost beam scanning folded reflectarray. This reflectarray uses the dual-polarized slot antenna with multi-layered PCB structure as the unit cell and scans its beam within large angle range. Another design example is a Ku-band low cost dual polarized reconfigurable reflectarray with single bit phase control by using PIN diodes. For both design examples, measurement results are given to show their good beam scanning performance.
The qualitative interview in IS research: Examining the craft

The qualitative interview is one of the most important data gathering tools in qualitative research, yet it has remained an unexamined craft in IS research. This paper discusses the potential difficulties, pitfalls and problems of the qualitative interview in IS research. Building on Goffman’s seminal work on social life, the paper proposes a dramaturgical model as a useful way of conceptualizing the qualitative interview. Based on this model the authors suggest guidelines for the conduct of qualitative interviews.
Tomahawk: Parallelism and heterogeneity in communications signal processing MPSoCs

Heterogeneity and parallelism in MPSoCs for 4G (and beyond) communications signal processing are inevitable in order to meet stringent power constraints and performance requirements. The question arises on how to cope with the problem of system programmability and runtime management incurred by the statically or even dynamically varying number and type of processing elements. This work addresses this challenge by proposing the concept of a heterogeneous many-core platform called Tomahawk. Apart from the definition of the system architecture, in this approach a unified framework including a model of computation, a programming interface and a dedicated runtime management unit called CoreManager is proposed. The increase of system complexity in terms of application parallelism and number of resources may lead to a dramatic increase of the management costs, hence causing performance degradation. For this reason, the efficient implementation of the CoreManager becomes a major issue in system design. This work compares the performance and capabilities of various CoreManager HW/SW solutions, based on ASIC, RISC and ASIP paradigms. The results demonstrate that the proposed ASIP-based solution approaches the performance of the ASIC realization, while preserving the full flexibility of the software (RISC-based) implementation.
AP3: cooperative, decentralized anonymous communication

This paper describes a cooperative overlay network that provides anonymous communication services for participating users. The Anonymizing Peer-to-Peer Proxy (AP3) system provides clients with three primitives: (i) anonymous message delivery, (ii) anonymous channels, and (iii) secure pseudonyms. AP3 is designed to be lightweight, low-cost and provides "probable innocence" anonymity to participating users, even under a large-scale coordinated attack by a limited fraction of malicious overlay nodes. Additionally, we use AP3's primitives to build novel anonymous group communication facilities (multicast and anycast), which shield the identity of both publishers and subscribers.
Interpersonal connectedness: conceptualization and directions for a measurement instrument

Interpersonal connectedness is the sense of belonging based on the appraisal of having sufficient close social contacts. This feeling is regarded as one of the major outcomes of successful (mediated) social interaction and as such an important construct for HCI. However, the exact nature of this feeling, how to achieve it, and how to assess it remain unexplored to date. In the current paper we start the theoretical conceptualization of this phenomenon by exploring its basic origins in psychological literature and simultaneously formulate requirements for a measurement instrument to be developed in the service of exploring and testing CMC applications, in particular awareness technologies.
Rapid Synthesis of Massive Face Sets for Improved Face Recognition

Recent work demonstrated that computer graphics techniques can be used to improve face recognition performances by synthesizing multiple new views of faces available in existing face collections. By so doing, more images and more appearance variations are available for training, thereby improving the deep models trained on these images. Similar rendering techniques were also applied at test time to align faces in 3D and reduce appearance variations when comparing faces. These previous results, however, did not consider the computational cost of rendering: At training, rendering millions of face images can be prohibitive; at test time, rendering can quickly become a bottleneck, particularly when multiple images represent a subject. This paper builds on a number of observations which, under certain circumstances, allow rendering new 3D views of faces at a computational cost which is equivalent to simple 2D image warping. We demonstrate this by showing that the run-time of an optimized OpenGL rendering engine is slower than the simple Python implementation we designed for the same purpose. The proposed rendering is used in a face recognition pipeline and tested on the challenging IJB-A and Janus CS2 benchmarks. Our results show that our rendering is not only fast, but improves recognition accuracy.
Machine Learning Techniques in Spam Filtering

The article gives an overview of some of the most popular machine learning methods (Bayesian classification, k-NN, ANNs, SVMs) and of their applicability to the problem of spam-filtering. Brief descriptions of the algorithms are presented, which are meant to be understandable by a reader not familiar with them before. A most trivial sample implementation of the named techniques was made by the author, and the comparison of their performance on the PU1 spam corpus is presented. Finally, some ideas are given of how to construct a practically useful spam filter using the discussed techniques. The article is related to the author’s first attempt of applying the machine-learning techniques in practice, and may therefore be of interest primarily to those getting aquainted with machine-learning.
Learning a non-linear knowledge transfer model for cross-view action recognition

This paper concerns action recognition from unseen and unknown views. We propose unsupervised learning of a non-linear model that transfers knowledge from multiple views to a canonical view. The proposed Non-linear Knowledge Transfer Model (NKTM) is a deep network, with weight decay and sparsity constraints, which finds a shared high-level virtual path from videos captured from different unknown viewpoints to the same canonical view. The strength of our technique is that we learn a single NKTM for all actions and all camera viewing directions. Thus, NKTM does not require action labels during learning and knowledge of the camera viewpoints during training or testing. NKTM is learned once only from dense trajectories of synthetic points fitted to mocap data and then applied to real video data. Trajectories are coded with a general codebook learned from the same mocap data. NKTM is scalable to new action classes and training data as it does not require re-learning. Experiments on the IXMAS and N-UCLA datasets show that NKTM outperforms existing state-of-the-art methods for cross-view action recognition.
A Faster Algorithm for Betweenness Centrality ∗

The betweenness centrality index is essential in the analysis of social networks, but costly to compute. Currently, the fastest known algorithms require Θ(n) time and Θ(n) space, where n is the number of actors in the network. Motivated by the fast-growing need to compute centrality indices on large, yet very sparse, networks, new algorithms for betweenness are introduced in this paper. They require O(n + m) space and run in O(nm) and O(nm + n log n) time on unweighted and weighted networks, respectively, where m is the number of links. Experimental evidence is provided that this substantially increases the range of networks for which centrality analysis is feasible.
A SUMMARY REVIEW OF VIBRATION-BASED DAMAGE IDENTIFICATION METHODS

This paper provides an overview of methods to detect, locate, and characterize damage in structural and mechanical systems by examining changes in measured vibration response. Research in vibration-based damage identification has been rapidly expanding over the last few years. The basic idea behind this technology is that modal parameters (notably frequencies, mode shapes, and modal damping) are functions of the physical properties of the structure (mass, damping, and stiffness). Therefore, changes in the physical properties will cause detectable changes in the modal properties. The motivation for the development of this technology is presented. The methods are categorized according to various criteria such as the level of damage detection provided, model-based vs. non-model-based methods and linear vs. nonlinear methods. The methods are also described in general terms including difficulties associated with their implementation and their fidelity. Past, current and future-planned applications of this technology to actual engineering systems are summarized. The paper concludes with a discussion of critical issues for future research in the area of vibration-based damage identification.
Suitable MLP Network Activation Functions for Breast Cancer and Thyroid Disease Detection

This paper compared various MLP activation functions for classification problems. The most well-known (Artificial Neural Network) ANN architecture is the Multilayer Perceptron (MLP) network which is widely used for solving problems related to data classifications. Selection of the activation functions in the MLP network plays an essential role on the network performance. A lot of studies have been conducted by reseachers to investigate special activation function to solve different kind of problems. Therefore, this paper intends to investigate the activation functions in MLP networks in terms of the accuracy performances. The activation functions under investigation are sigmoid, hyperbolic tangent, neuronal, logarithmic, sinusoidal and exponential. Medical diagnosis data from two case studies, thyroid disease classification and breast cancer classification, have been used to test the performance of the MLP network. The MLP networks are trained using Back Propagation learning algorithm. The performance of the MLP networks are calculated based on the percentage of correct classificition. The results show that the hyperbolic tangent function in MLP network had the capability to produce the highest accuracy for classifying breast cancer data. Meanwhile, for thyroid disease classification, neuronal function is the most suitable function that performed the highest accuracy in MLP network.
VisDB: database exploration using multidimensional visualization

Discusses how the VisDB system supports the query specification process by representing the result visually. The main idea behind the system stems from the view of relational database tables as sets of multidimensional data where the number of attributes corresponds to the number of dimensions. In such a view, it is often unclear. In this system, each display pixel represents one database item. Pixels are arranged and colored to indicate the item's relevance to a user query and to give a visual impression of the resulting data set.<<ETX>>
Demanding Customers : Consumerist Patients and Quality of Care

Consumerism arises when patients acquire and use medical information from sources other than their physicians. This practice has been hailed as a means of improving quality. This need not be the result. Our theoretical model identifies a channel through which consumerism may reduce quality: consumerist patients place additional demands on their doctors’ time, thus imposing a negative externality on other patients. Relative to a world in which consumerism does not exist, consumerism may harm other consumerists, non-consumerists, or both. Data from a large national survey of physicians confirm the negative effects of consumerism: high levels of consumerist patients are associated with lower perceived quality among physicians.
Neural Machine Translation with Gumbel-Greedy Decoding

Previous neural machine translation models used some heuristic search algorithms (e.g., beam search) in order to avoid solving the maximum a posteriori problem over translation sentences at test phase. In this paper, we propose the GumbelGreedy Decoding which trains a generative network to predict translation under a trained model. We solve such a problem using the Gumbel-Softmax reparameterization, which makes our generative network differentiable and trainable through standard stochastic gradient methods. We empirically demonstrate that our proposed model is effective for generating sequences of discrete words.
Complete traumatic hemipelvectomy: Report of a case after 19 years of follow-up.

Sandra Lasurt , Andrés Combalia-Aleu * a Hospital Clı́nic, University of Barcelona, Department of Orthopaedic Surgery and Trauma, Barcelona, Spain b Hospital Clı́nic, Department of Orthopaedic Surgery and Trauma and Department of Human Anatomy and Embryology, Faculty of Medicine, University of Barcelona, Institut d’Investigació August Pi I Sunyer (IDIBAPS), Villarroel 170, 08036 Barcelona, Spain
Supervised Classification Performance of Multispectral Images

Nowadays government and private agencies use remote sensing imagery for a wide range of applications from military applications to farm development. The images may be a panchromatic, multispectral, hyperspectral or even ultraspectral of terra bytes. Remote sensing image classification is one amongst the most significant application worlds for remote sensing. A few number of image classification algorithms have proved good precision in classifying remote sensing data. But, of late, due to the increasing spatiotemporal dimensions of the remote sensing data, traditional classification algorithms have exposed weaknesses necessitating further research in the field of remote sensing image classification..So an efficient classifier is needed to classify the remote sensing imageries to extract information. We are experimenting with both supervised and unsupervised classification. Here we compare the different classification methods and their performances. It is found that Mahalanobis classifier performed the best in our classification.
Building a Question-Answering Chatbot using Forum Data in the Semantic Space

We build a conversational agent which knowledge base is an online forum for parents of autistic children. We collect about 35,000 threads totalling some 600,000 replies, and label 1% of them for usefulness using Amazon Mechanical Turk. We train a Random Forest Classifier using sent2vec features to label the remaining thread replies. Then, we use word2vec to match user queries conceptually with a thread, and then a reply with a predefined context window.
Fast Change Point Detection on Dynamic Social Networks

A number of real world problems in many domains (e.g. sociology, biology, political science and communication networks) can be modeled as dynamic networks with nodes representing entities of interest and edges representing interactions among the entities at different points in time. A common representation for such models is the snapshot model where a network is defined at logical time-stamps. An important problem under this model is change point detection. In this work we devise an effective and efficient three-step-approach for detecting change points in dynamic networks under the snapshot model. Our algorithm achieves up to 9X speedup over the state-of-the-art while improving quality on both synthetic and real world networks.
PubChem Substance and Compound databases

PubChem () is a public repository for information on chemical substances and their biological activities, launched in 2004 as a component of the Molecular Libraries Roadmap Initiatives of the US National Institutes of Health (NIH). For the past 11 years, PubChem has grown to a sizable system, serving as a chemical information resource for the scientific research community. PubChem consists of three inter-linked databases, Substance, Compound and BioAssay. The Substance database contains chemical information deposited by individual data contributors to PubChem, and the Compound database stores unique chemical structures extracted from the Substance database. Biological activity data of chemical substances tested in assay experiments are contained in the BioAssay database. This paper provides an overview of the PubChem Substance and Compound databases, including data sources and contents, data organization, data submission using PubChem Upload, chemical structure standardization, web-based interfaces for textual and non-textual searches, and programmatic access. It also gives a brief description of PubChem3D, a resource derived from theoretical three-dimensional structures of compounds in PubChem, as well as PubChemRDF, Resource Description Framework (RDF)-formatted PubChem data for data sharing, analysis and integration with information contained in other databases.
Software Testing Research: Achievements, Challenges, Dreams

Software engineering comprehends several disciplines devoted to prevent and remedy malfunctions and to warrant adequate behaviour. Testing, the subject of this paper, is a widespread validation approach in industry, but it is still largely ad hoc, expensive, and unpredictably effective. Indeed, software testing is a broad term encompassing a variety of activities along the development cycle and beyond, aimed at different goals. Hence, software testing research faces a collection of challenges. A consistent roadmap of the most relevant challenges to be addressed is here proposed. In it, the starting point is constituted by some important past achievements, while the destination consists of four identified goals to which research ultimately tends, but which remain as unreachable as dreams. The routes from the achievements to the dreams are paved by the outstanding research challenges, which are discussed in the paper along with interesting ongoing work.
Dynamic Environment Modeling with Gridmap: A Multiple-Object Tracking Application

The Bayesian occupancy filter (BOF) (Coue et al., 2002) has achieved promising results in the object tracking applications. This paper presents a new development of BOF which inherits original BOF's advantages. Meanwhile, the new formulation has significantly reduced original BOF's complexities and can be run in realtime. In Bayesian occupancy filter, the environment is finely divided into 2-dimensional grids. Different from conventional occupancy gridmaps, in BOF, each grid has both static (occupancy) and dynamic (velocity) characteristics. In the new proposed BOF, the velocity of each cell is modeled as a distribution. The distribution for each cell occupancy can therefore be inferred using a filtering mechanism. A segmentation algorithm is implemented to extract the objects from BOF estimation. Thereafter, standard target tracking methods are employed to further analyze each object's motion. By using BOF as a pre-processing tool, the complexity of the data association is significantly reduced. Experiments using data from an indoor human tracking application demonstrate that our approach yields satisfactory results