nils-herrmann/clean_scirepeval huggingface dataset:
An Efficient Domain-Independent Algorithm for Detecting Approximately Duplicate Database Records

Detecting database records that are approximate duplicates, but not exact duplicates, is an important task. Databases may contain duplicate records concerning the same real-world entity because of data entry errors, because of un-standardized abbreviations, or because of diierences in the detailed schemas of records from multiple databases, among other reasons. In this paper, we present an eecient algorithm for recognizing clusters of approximately duplicate records. Three key ideas distinguish the algorithm presented. First, a version of the Smith-Waterman algorithm for computing minimum edit-distance is used as a domain-independent method to recognize pairs of approximately duplicate records. Second, the union//nd algorithm is used to keep track of clusters of duplicate records incrementally, as pairwise duplicate relationships are discovered. Third, the algorithm uses a priority queue of cluster subsets to respond adaptively to the size and homogeneity of the clusters discovered as the database is scanned. This typically reduces by over 75% the number of times that the expensive pair-wise record matching (Smith-Waterman or other) is applied, without impairing accuracy. Comprehensive experiments on synthetic databases and on a real database of bibliographic records connrm the eeectiveness of the new algorithm.
Adversarial Cross-Modal Retrieval

Cross-modal retrieval aims to enable flexible retrieval experience across different modalities (e.g., texts vs. images). The core of cross-modal retrieval research is to learn a common subspace where the items of different modalities can be directly compared to each other. In this paper, we present a novel Adversarial Cross-Modal Retrieval (ACMR) method, which seeks an effective common subspace based on adversarial learning. Adversarial learning is implemented as an interplay between two processes. The first process, a feature projector, tries to generate a modality-invariant representation in the common subspace and to confuse the other process, modality classifier, which tries to discriminate between different modalities based on the generated representation. We further impose triplet constraints on the feature projector in order to minimize the gap among the representations of all items from different modalities with same semantic labels, while maximizing the distances among semantically different images and texts. Through the joint exploitation of the above, the underlying cross-modal semantic structure of multimedia data is better preserved when this data is projected into the common subspace. Comprehensive experimental results on four widely used benchmark datasets show that the proposed ACMR method is superior in learning effective subspace representation and that it significantly outperforms the state-of-the-art cross-modal retrieval methods.
20 years of the SMART protein domain annotation resource

SMART (Simple Modular Architecture Research Tool) is a web resource (http://smart.embl.de) for the identification and annotation of protein domains and the analysis of protein domain architectures. SMART version 8 contains manually curated models for more than 1300 protein domains, with approximately 100 new models added since our last update article (1). The underlying protein databases were synchronized with UniProt (2), Ensembl (3) and STRING (4), doubling the total number of annotated domains and other protein features to more than 200 million. In its 20th year, the SMART analysis results pages have been streamlined again and its information sources have been updated. SMART's vector based display engine has been extended to all protein schematics in SMART and rewritten to use the latest web technologies. The internal full text search engine has been redesigned and updated, resulting in greatly increased search speed.
Fine-Grained Categorization and Dataset Bootstrapping Using Deep Metric Learning with Humans in the Loop

Existing fine-grained visual categorization methods often suffer from three challenges: lack of training data, large number of fine-grained categories, and high intraclass vs. low inter-class variance. In this work we propose a generic iterative framework for fine-grained categorization and dataset bootstrapping that handles these three challenges. Using deep metric learning with humans in the loop, we learn a low dimensional feature embedding with anchor points on manifolds for each category. These anchor points capture intra-class variances and remain discriminative between classes. In each round, images with high confidence scores from our model are sent to humans for labeling. By comparing with exemplar images, labelers mark each candidate image as either a "true positive" or a "false positive." True positives are added into our current dataset and false positives are regarded as "hard negatives" for our metric learning model. Then the model is retrained with an expanded dataset and hard negatives for the next round. To demonstrate the effectiveness of the proposed framework, we bootstrap a fine-grained flower dataset with 620 categories from Instagram images. The proposed deep metric learning scheme is evaluated on both our dataset and the CUB-200-2001 Birds dataset. Experimental evaluations show significant performance gain using dataset bootstrapping and demonstrate state-of-the-art results achieved by the proposed deep metric learning methods.
Cloud computing: state-of-the-art and research challenges

Cloud computing has recently emerged as a new paradigm for hosting and delivering services over the Internet. Cloud computing is attractive to business owners as it eliminates the requirement for users to plan ahead for provisioning, and allows enterprises to start from the small and increase resources only when there is a rise in service demand. However, despite the fact that cloud computing offers huge opportunities to the IT industry, the development of cloud computing technology is currently at its infancy, with many issues still to be addressed. In this paper, we present a survey of cloud computing, highlighting its key concepts, architectural principles, state-of-the-art implementation as well as research challenges. The aim of this paper is to provide a better understanding of the design challenges of cloud computing and identify important research directions in this increasingly important area.
A deep CNN based multi-class classification of Alzheimer's disease using MRI

In the recent years, deep learning has gained huge fame in solving problems from various fields including medical image analysis. This work proposes a deep convolutional neural network based pipeline for the diagnosis of Alzheimer's disease and its stages using magnetic resonance imaging (MRI) scans. Alzheimer's disease causes permanent damage to the brain cells associated with memory and thinking skills. The diagnosis of Alzheimer's in elderly people is quite difficult and requires a highly discriminative feature representation for classification due to similar brain patterns and pixel intensities. Deep learning techniques are capable of learning such representations from data. In this paper, a 4-way classifier is implemented to classify Alzheimer's (AD), mild cognitive impairment (MCI), late mild cognitive impairment (LMCI) and healthy persons. Experiments are performed using ADNI dataset on a high performance graphical processing unit based system and new state-of-the-art results are obtained for multiclass classification of the disease. The proposed technique results in a prediction accuracy of 98.8%, which is a noticeable increase in accuracy as compared to the previous studies and clearly reveals the effectiveness of the proposed method.
What is Coordination Theory and How Can It Help Design Cooperative Work Systems?

It is possible to design cooperative work tools based only on “common sense” and good intuitions. But the history of technology is replete with examples of good theories greatly aiding the development of useful technology. Where, then, might we look for theories to help us design computer-supported cooperative work tools? In this paper, we will describe one possible perspective—the interdisciplinary study of coordination—that focuses, in part, on how people work together now and how they might do so differently with new information technologies.
In one sense, there is little that is new about the study of coordination. Many different disciplines—including computer science, sociology, political science, management science, systems theory, economics, linguistics, and psychology—have all dealt, in one way or another, with fundamental questions about coordination. Furthermore, several previous writers have suggested that theories about coordination are likely to be important for designing cooperative work tools (e.g., [Holt88], [Wino86]).
We hope to suggest here, however, that the potential for fruitful interdisciplinary connections concerning coordination is much greater than has as yet been widely appreciated. For instance, we believe that fundamentally similar coordination phenomena arise—unrecognized as such—in many of the fields listed above. Though a single coherent body of theory about coordination does not yet exist, many different disciplines could both contribute to and benefit from more general theories of coordination. Of particular interest to researchers in the field of computer-supported cooperative work is the prospect of drawing on a much richer body of existing and future work in these fields than has previously been suggested.
In this paper, we will first describe what we mean by “coordination theory” and give examples of how previous research on computer-supported cooperative work can be interpreted from this perspective. We will then suggest one way of developing this perspective further by proposing tentative definitions of coordination and analyzing its components in more detail.
A Broadband U-Slot Coupled Microstrip-to-Waveguide Transition

A novel planar broadband microstrip-to-waveguide transition is proposed in this paper. The referred waveguide can be either rectangular waveguide or ridged waveguide. The transition consists of an open-circuited microstrip quarter-wavelength resonator and a resonant U-shaped slot on the upper broadside wall of a short-circuited waveguide. A physics-based equivalent-circuit model is also developed for interpreting the working mechanism and providing a coarse model for engineering design. The broadband transition can be regarded as a stacked two-pole resonator filter. Each coupling circuit can be approximately designed separately using the group-delay information at the center frequency. In addition to its broadband attribute, the transition is compact in size, vialess, and is highly compatible with planar circuits. These good features make the new transition very attractive for the system architecture where waveguide devices need to be surface mounted on a multilayered planer circuit. Two design examples are given to demonstrate the usefulness of the transition: one is a broadband ridged-waveguide bandpass filter and the other is a surface-mountable broadband low-temperature co-fired ceramic laminated waveguide cavity filter. Both filters are with the proposed transition for interfacing with microstrip lines, showing promising potentials in practical applications.
NONCONVEX MODEL FOR FACTORING NONNEGATIVE MATRICES

We study the Nonnegative Matrix Factorization problem which approximates a nonnegative matrix by a low-rank factorization. This problem is particularly important in Machine Learning, and finds itself in a large number of applications. Unfortunately, the original formulation is ill-posed and NPhard. In this paper, we propose a row sparse model based on Row Entropy Minimization to solve the NMF problem under separable assumption which states that each data point is a convex combination of a few distinct data columns. We utilize the concentration of the entropy function and the `∞ norm to concentrate the energy on the least number of latent variables. We prove that under the separability assumption, our proposed model robustly recovers data columns that generate the dataset, even when the data is corrupted by noise. We empirically justify the robustness of the proposed model and show that it is significantly more robust than the state-ofthe-art separable NMF algorithms.
Mining financial statement fraud: An analysis of some experimental issues

Financial statement fraud detection is an important problem with a number of design aspects to consider. Issues such as (i) problem representation, (ii) feature selection, and (iii) choice of performance metrics all influence the perceived performance of detection algorithms. Efficient implementation of financial fraud detection methods relies on a clear understanding of these issues. In this paper we present an analysis of the three key experimental issues associated with financial statement fraud detection, critiquing the prevailing ideas and providing new understandings.
Modeling and Evaluating User Interface Aesthetics Employing ISO 25010 Quality Standard

User interface aesthetics, among other design considerations, are considered to be one of the determinants of user satisfaction. Considered more of a subjective aspect, aesthetics have mostly been evaluated with intrusive approaches. However, according to the recent product quality model in ISO 25010, "aesthetics" is listed under the "usability" characteristic. It is therefore imperative to understand and evaluate aesthetics not only from users' perspective but also from the design or product perspective. In this research, we employ ISO 25010 quality standard to specify user interface aesthetics requirements from two perspectives of quality, i.e., product quality and quality in use, providing a platform for consistently evaluating and therefore improving user interface aesthetics. We also demonstrate the usefulness of our approach with a case study.
Connectivity Learning in Multi-Branch Networks

The CIFAR-10 dataset consists of color images of size 32x32. The training set contains 50,000 images, the testing set 10,000 images. Each image in CIFAR-10 is categorized into one of 10 possible classes. In Table 3, we report the performance of different models trained on CIFAR-10. From these results we can observe that our models using learned connectivity achieve consistently better performance over the equivalent models trained with the fixed connectivity (Xie et al., 2017).
Fast ε-free Inference of Simulation Models with Bayesian Conditional Density Estimation

Many statistical models can be simulated forwards but have intractable likelihoods. Approximate Bayesian Computation (ABC) methods are used to infer properties of these models from data. Traditionally these methods approximate the posterior over parameters by conditioning on data being inside an -ball around the observed data, which is only correct in the limit →0. Monte Carlo methods can then draw samples from the approximate posterior to approximate predictions or error bars on parameters. These algorithms critically slow down as →0, and in practice draw samples from a broader distribution than the posterior. We propose a new approach to likelihood-free inference based on Bayesian conditional density estimation. Preliminary inferences based on limited simulation data are used to guide later simulations. In some cases, learning an accurate parametric representation of the entire true posterior distribution requires fewer model simulations than Monte Carlo ABC methods need to produce a single sample from an approximate posterior.
UHF Deployable Helical Antennas for CubeSats

The design process and the deployment mechanism of a quadrifilar helix antenna (QHA) and a conical log spiral antenna (CLSA) are presented. The two antennas are proposed to operate in the UHF frequency band. They are composed of conductors that are embedded and supported by innovative structural techniques. This allows efficient folding, packaging, and deployment once in space. The conductors in the QHA are composed of beryllium copper and are supported by helical arms of S2 glass fiber reinforced epoxy. The CLSA, on the other hand, has conductors that are made out of a mesh of phosphor bronze and incorporated inside thin insulators composed of continuous fiber composites. The new aspects of these designs lie in their structures and deployment mechanisms. The deployment mechanisms for both antennas include helical pantograph and origami patterns such as Z-folding configurations. Both antennas are fabricated and tested for both deployment and radiation performance. A comparison is executed between both designs, and their potential deployment possibilities from CubeSats are also investigated.
RFBoost: An improved multi-label boosting algorithm and its application to text categorisation

The AdaBoost.MH boosting algorithm is considered to be one of the most accurate algorithms for multilabel classification. AdaBoost.MH works by iteratively building a committee of weak hypotheses of decision stumps. In each round of AdaBoost.MH learning, all features are examined, but only one feature is used to build a new weak hypothesis. This learning mechanism may entail a high degree of computational time complexity, particularly in the case of a large-scale dataset. This paper describes a way to manage the learning complexity and improve the classification performance of AdaBoost.MH. We propose an improved version of AdaBoost.MH, called RFBoost . The weak learning in RFBoost is based on filtering a small fixed number of ranked features in each boosting round rather than using all features, as AdaBoost.MH does. We propose two methods for ranking the features: One Boosting Round and Labeled Latent Dirichlet Allocation (LLDA), a supervised topic model based on Gibbs sampling. Additionally, we investigate the use of LLDA as a feature selection method for reducing the feature space based on the maximal conditional probabilities of words across labels. Our experimental results on eight well-known benchmarks for multi-label text categorisation show that RFBoost is significantly more efficient and effective than the baseline algorithms. Moreover, the LLDA-based feature ranking yields the best performance for RFBoost.
Comparison of Nanostring nCounter® Data on FFPE Colon Cancer Samples and Affymetrix Microarray Data on Matched Frozen Tissues

The prognosis of colorectal cancer (CRC) stage II and III patients remains a challenge due to the difficulties of finding robust biomarkers suitable for testing clinical samples. The majority of published gene signatures of CRC have been generated on fresh frozen colorectal tissues. Because collection of frozen tissue is not practical for routine surgical pathology practice, a clinical test that improves prognostic capabilities beyond standard pathological staging of colon cancer will need to be designed for formalin-fixed paraffin-embedded (FFPE) tissues. The NanoString nCounter® platform is a gene expression analysis tool developed for use with FFPE-derived samples. We designed a custom nCounter® codeset based on elements from multiple published fresh frozen tissue microarray-based prognostic gene signatures for colon cancer, and we used this platform to systematically compare gene expression data from FFPE with matched microarray array data from frozen tissues. Our results show moderate correlation of gene expression between two platforms and discovery of a small subset of genes as candidate biomarkers for colon cancer prognosis that are detectable and quantifiable in FFPE tissue sections.
Semantic Web Challenges

The aim of the Mighty Storage Challenge (MOCHA) at ESWC 2018 was to test the performance of solutions for SPARQL processing in aspects that are relevant for modern applications. These include ingesting data, answering queries on large datasets and serving as backend for applications driven by Linked Data. The challenge tested the systems against data derived from real applications and with realistic loads. An emphasis was put on dealing with data in form of streams or updates.
Exploiting Image-trained CNN Architectures for Unconstrained Video Classification

In this paper, we propose an efficient approach to exploit off-the-shelf image-trained CNN architectures for video classification and evaluate on the challenging TRECVID MED’14 dataset and UCF-101 dataset. Our work is closely related to other research efforts towards the efficient use of CNN for video classification. While it is now clear that CNN-based approaches outperform most state-of-the-art handcrafted features for image classification, it is not yet obvious that this holds true for video classification. Moreover, there seems to be mixed conclusions regarding the benefit of training a spatiotemporal vs. applying an image-trained CNN architecture on videos. Although the specificity of the considered video datasets might play a role, the way the 2D CNN architecture is exploited for video classification is certainly the main reason behind these contradictory observations. The additional computational cost of training on videos is also an element that should be taken into account when comparing the two options. Prior to training a spatiotemporal CNN architecture, it thus seems legitimate to fully exploit the potential of image-trained CNN architectures. Obtained on a highly heterogeneous video dataset, we believe that our results can serve as a strong 2D CNN baseline against which to compare CNN architectures specifically trained on videos. We conduct an in-depth exploration of different strategies for doing event detection in videos using convolutional neural networks (CNNs) trained for image classification (Figure 1, 2). We study different ways of performing spatial and temporal pooling, feature normalization, choice of CNN layers as well as choice of classifiers. Making judicious choices along these dimensions led to a very significant increase in performance over more naive approaches that have been used till now. The modality fusion of image-trained CNN features and motion-based Fisher vectors shows considerably improvement in classification performance. On TRECVID MED’14 dataset, our methods, based entirely on image-trained CNN features, can outperform several state-of-the-art non-CNN models. Our proposed late fusion of CNNand motion-based features can further increase the mean average precision (mAP) on MED’14 from 34.95% to 38.74%, achieving the state-of-the-art (Table 1). On the challenging UCF101 dataset, the image-based approach outperforms other image-trained CNN approaches; the fusion approach yields 89.6% classification accuracy (Table 2).
Number 2 Self-Schemata and Processing Information About the Self

Attempts to organize, summarize, or explain one's own behavior in a particular domain result in the formation of cognitive structures about the self or selfschemata. Self-schemata are cognitive generalizations about the self, derived from past experience, that organize and guide the processing of the self-related information contained in an individual's social experience. The role of schemata in processing information about the self is examined by linking self-schemata to a number of specific empirical referents. Female students with schemata in a particular domain and those without schemata are selected and their performance on a variety of cognitive tasks is compared. The results indicate that self-schemata facilitate the processing of information about the self (judgments and decisions about the self), contain easily retrievable behavioral evidence, provide a basis for the confident self-prediction of behavior on schema-related dimensions, and make individuals resistant to counterschematic information. The relationship of self-schemata to cross-situational consistency in behavior and the implications of self-schemata for attribution theory are discussed.