nils-herrmann/clean_scirepeval huggingface dataset:
Classification for Fraud Detection with Social Network Analysis

Worldwide fraud conducts to big losses to states’ treasuries and to private companies. Because of that, motivations to detect and fight fraud are high, but despite continuous efforts, it is far from being accomplished. The problems faced when trying to characterize fraud activities are many, with the specificities of fraud on each business domain leading the list. Despite the differences, building a classifier for fraud detection almost always requires to deal with unbalanced datasets, since fraudulent records are usually in a small number when compared with the nonfraudulent ones. This work describes two types of techniques to deal with fraud detection: techniques at a preprocessing level where the goal is to balance the dataset, and techniques at a processing level where the objective is to apply different errors costs to fraudulent and non-fraudulent cases. Besides that, as organizations and people more often do associations in order to commit fraud, is proposed a new method to make use of that information to improve the training of classifiers for fraud detection. In particular, this new method identifies patterns among the social networks for fraudulent organizations, and uses them to enrich the description of its entity. The enriched data will then be used jointly with balancing techniques to produce a better classifier to identify fraud.
SAGE2: A new approach for data intensive collaboration using Scalable Resolution Shared Displays

Current web-based collaboration systems, such as Google Hangouts, WebEx, and Skype, primarily enable single users to work with remote collaborators through video conferencing and desktop mirroring. The original SAGE software, developed in 2004 and adopted at over one hundred international sites, was designed to enable groups to work in front of large shared displays in order to solve problems that required juxtaposing large volumes of information in ultra high-resolution. We have developed SAGE2, as a complete redesign and implementation of SAGE, using cloud-based and web browser technologies in order to enhance data intensive co-located and remote collaboration. This paper provides an overview of SAGE2's infrastructure, the technical design challenges, and the afforded benefits to data intensive collaboration. Lastly, we provide insight on how future collaborative applications can be developed to support large displays and demonstrate the power and flexibility that SAGE2 offers in collaborative scenarios through a series of use cases.
Planar Differential Elliptical UWB Antenna Optimization

A recently proposed optimization procedure, based on the time domain characteristics of an antenna, is exploited to design a planar differential elliptical antenna for ultrawideband (UWB) applications. The optimization procedure aims at finding an antenna not only with low VSWR but also one exhibiting low-dispersion characteristics over the relevant frequency band. Furthermore, since in pulse communications systems the input signal is often of a given form, suited to a particular purpose, the optimization procedure also aims at finding the best antenna for the given input signal form. Specifically, the optimized antenna is designed for high temporal correlation between its electric field intensity signal and the given input signal. The optimization technique followed in this work makes use of genetic algorithm (GA) search concepts. The electromagnetic analysis of the antenna is done by means of a finite-difference time-domain method using the commercially available CST Microwave Studio software
The effect of experimental presentation of thin media images on body satisfaction: a meta-analytic review.

The effect of experimental manipulations of the thin beauty ideal, as portrayed in the mass media, on female body image was evaluated using meta-analysis.



Data from 25 studies (43 effect sizes) were used to examine the main effect of mass media images of the slender ideal, as well as the moderating effects of pre-existing body image problems, the age of the participants, the number of stimulus presentations, and the type of research design.



Body image was significantly more negative after viewing thin media images than after viewing images of either average size models, plus size models, or inanimate objects. This effect was stronger for between-subjects designs, participants less than 19 years of age, and for participants who are vulnerable to activation of a thinness schema.



Results support the sociocultural perspective that mass media promulgate a slender ideal that elicits body dissatisfaction. Implications for prevention and research on social comparison processes are considered.
A Fast String Searching Algorithm

An algorithm is presented that searches for the location, “<italic>i</italic>l” of the first occurrence of a character string, “<italic>pat</italic>,” in another string, “<italic>string</italic>.” During the search operation, the characters of <italic>pat</italic> are matched starting with the last character of <italic>pat</italic>. The information gained by starting the match at the end of the pattern often allows the algorithm to proceed in large jumps through the text being searched. Thus the algorithm has the unusual property that, in most cases, not all of the first <italic>i</italic> characters of <italic>string</italic> are inspected. The number of characters actually inspected (on the average) decreases as a function of the length of <italic>pat</italic>. For a random English pattern of length 5, the algorithm will typically inspect <italic>i</italic>/4 characters of <italic>string</italic> before finding a match at <italic>i</italic>. Furthermore, the algorithm has been implemented so that (on the average) fewer than <italic>i</italic> + <italic>patlen</italic> machine instructions are executed. These conclusions are supported with empirical evidence and a theoretical analysis of the average behavior of the algorithm. The worst case behavior of the algorithm is linear in <italic>i</italic> + <italic>patlen</italic>, assuming the availability of array space for tables linear in <italic>patlen</italic> plus the size of the alphabet.
3~
Optimal Step Nonrigid ICP Algorithms for Surface Registration

We show how to extend the ICP framework to nonrigid registration, while retaining the convergence properties of the original algorithm. The resulting optimal step nonrigid ICP framework allows the use of different regularisations, as long as they have an adjustable stiffness parameter. The registration loops over a series of decreasing stiffness weights, and incrementally deforms the template towards the target, recovering the whole range of global and local deformations. To find the optimal deformation for a given stiffness, optimal iterative closest point steps are used. Preliminary correspondences are estimated by a nearest-point search. Then the optimal deformation of the template for these fixed correspondences and the active stiffness is calculated. Afterwards the process continues with new correspondences found by searching from the displaced template vertices. We present an algorithm using a locally affine regularisation which assigns an affine transformation to each vertex and minimises the difference in the transformation of neighbouring vertices. It is shown that for this regularisation the optimal deformation for fixed correspondences and fixed stiffness can be determined exactly and efficiently. The method succeeds for a wide range of initial conditions, and handles missing data robustly. It is compared qualitatively and quantitatively to other algorithms using synthetic examples and real world data.
Parsing English with a Link Grammar

We develop a formal grammatical system called a link grammar, show how English grammar can be encoded in such a system, and give algorithms for efficiently parsing with a link grammar. Although the expressive power of link grammars is equivalent to that of context free grammars, encoding natural language grammars appears to be much easier with the new system. We have written a program for general link parsing and written a link grammar for the English language. The performance of this preliminary system – both in the breadth of English phenomena that it captures and in the computational resources used – indicates that the approach may have practical uses as well as linguistic significance. Our program is written in C and may be obtained through the internet.  School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, sleator@cs.cmu.edu. y Music Department, Columbia University, New York, NY 10027,  Research supported in part by the National Science Foundation under grant CCR-8658139, Olin Corporation, and R. R. Donnelley and Sons. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of Olin Corporation, R. R. Donnelley and Sons, or the NSF.
MediaPaaS: A Cloud-Based Media Processing Platform for Elastic Live Broadcasting

Mobility is changing the way of how people consume live media content. By staying always connected with the Internet from various mobile devices, people expect to have enhanced TV viewing experience from anywhere on any device. Therefore, live broadcasting needs to be widely accessible and customizable, instead of being passive content only on TV. In this paper we present a cloud-based media processing platform, called MediaPaaS, for enabling elastic live broadcasting in the cloud. As an ecosystem-oriented solution for content providers, we outsource complex media processing from both content providers and terminal devices to the cloud. A distributed media processing model is proposed to enable dynamic pipeline composition and cross-pipeline task sharing in the cloud for flexible live content processing. Also, a prediction-based task scheduling algorithm is presented to minimize cloud resource usage without affecting quality of streams. The MediaPaaS platform allows third-party application developers to extend its capability to enable certain customization for running live channels. To our knowledge, this paper is the first work to openly discuss the detailed design issues of a cloud-based platform for elastic live broadcasting.
Momentum Investment Strategies of Mutual Funds , Performance Persistence , and Survivorship Bias

We show that the persistent use of momentum investment strategies by mutual funds has important implications for the performance persistence and survivorship bias controversies. Using mutual fund portfolio holdings from a database free of survivorship bias, we  ̄nd that the best performing funds during one year are the best performers during the following year, with the exception of 1981, 1983, 1988, and 1989. This pattern corresponds exactly to the pattern exhibited by the momentum e®ect in stock returns,  ̄rst documented by Jegadeesh and Titman (1993) and recently studied by Chan, Jegadeesh, and Lakonishok (1996). Our evidence points not only to the momentum e®ect in stock returns, but to the persistent, active use of momentum strategies by mutual funds as the reasons for performance persistence. Moreover, essentially no persistence remains after controlling for the one-year momentum e®ect in stock returns. We also explain why most recent studies have found that survivorship bias is a relatively small concern. Funds that were the best performers during one year are the worst performers during the following year whenever the momentum e®ect in stock returns is absent, and these funds tend to disappear with a frequency not appreciably lower than that of consistently poor performers. Therefore, the pool of non-surviving funds is more representative of the cross-section of all funds than previously thought. Speci ̄cally, we  ̄nd a di®erence of only 20 basis points per year in risk-adjusted pre-expense returns between the average fund and the average surviving fund.
Computing the Stereo Matching Cost with a Convolutional Neural Network Seminar Recent Trends in 3 D Computer Vision

This paper presents a novel approach to the problem of computing the matching-cost for stereo vision. The approach is based upon a Convolutional Neural Network that is used to compute the similarity of input patches from stereo image pairs. In combination with state-ofthe-art stereo pipeline steps, the method achieves top results in major stereo benchmarks. The paper introduces the problem of stereo matching, discusses the proposed method and shows results from recent stereo datasets.
An Optimal Algorithm for Generalized Causal Message Ordering (Abstract)

Asynchronous execution of processes and unpredictable communication delays create nondeterminism in distributed systems that complicates the design, verification, and analysis of distributed programs. To simplify the design and development of distributed applications, the idea of “causal message ordering” (CO) was introduced by Birman and Joseph . If for any two messages M and M’ sent to the same destination d, Send(M) + Send(M’), then CO ensures that Delivered + Deliver-yd(lf’) at d. Existing algorithms that provide CO have high message overhead and use more storage than is required by an optimal algorithm, or make simplifying assumptions by assuming certain topolog y/communicat ion pat t ems and inbuilt synchronize ation. We present an optimal CO algorithm  under the following framework:
An Improved SDA Based Defect Prediction Framework for Both Within-Project and Cross-Project Class-Imbalance Problems

Solving the class-imbalance problem of within-project software defect prediction (SDP) is an important research topic. Although some class-imbalance learning methods have been presented, there exists room for improvement. For cross-project SDP, we found that the class-imbalanced source usually leads to misclassification of defective instances. However, only one work has paid attention to this cross-project class-imbalance problem.  We aim to provide effective solutions for both within-project and cross-project class-imbalance problems.  Subclass discriminant analysis (SDA), an effective feature learning method, is introduced to solve the problems. It can learn features with more powerful classification ability from original metrics. For within-project prediction, we improve SDA for achieving balanced subclasses and propose the improved SDA (ISDA) approach. For cross-project prediction, we employ the semi-supervised transfer component analysis (SSTCA) method to make the distributions of source and target data consistent, and propose the SSTCA+ISDA prediction approach.  Extensive experiments on four widely used datasets indicate that: 1) ISDA-based solution performs better than other state-of-the-art methods for within-project class-imbalance problem; 2) SSTCA+ISDA proposed for cross-project class-imbalance problem significantly outperforms related methods.   Within-project and cross-project class-imbalance problems greatly affect prediction performance, and we provide a unified and effective prediction framework for both problems.
A Circularly Polarized Antenna With Wide Axial Ratio Beamwidth

A novel circularly polarized (CP) antenna with wide angular coverage is presented. The proposed antenna is formed by two bowtie patch antennas and two electric dipoles. It can achieve an impedance bandwidth (SWR < 1.6) of 41% and a 3-dB axial ratio bandwidth of 33%. For this design, very stable and symmetrical radiation patterns are obtained. In the axial ratio passband, the 3-dB beamwidth is 85degplusmn2deg with a gain of 6.3 dBi plusmn0.3 dBi. The cross polarization is lower than -15 dB over a wide range of angles. For the entire half-power beamwidth, the axial ratio can be kept below 3 dB.
Stacked What-Where Auto-encoders

We present a novel architecture, the “stacked what-where auto-encoders” (SWWAE), which integrates discriminative and generative pathways and provides a unified approach to supervised, semi-supervised and unsupervised learning without relying on sampling during training. An instantiation of SWWAE uses a convolutional net (Convnet) (LeCun et al. (1998)) to encode the input, and employs a deconvolutional net (Deconvnet) (Zeiler et al. (2010)) to produce the reconstruction. The objective function includes reconstruction terms that induce the hidden states in the Deconvnet to be similar to those of the Convnet. Each pooling layer produces two sets of variables: the “what” which are fed to the next layer, and its complementary variable “where” that are fed to the corresponding layer in the generative decoder.
Mining geographic-temporal-semantic patterns in trajectories for location prediction

In recent years, research on location predictions by mining trajectories of users has attracted a lot of attention. Existing studies on this topic mostly treat such predictions as just a type of location recommendation, that is, they predict the next location of a user using location recommenders. However, an user usually visits somewhere for reasons other than interestingness. In this article, we propose a novel mining-based location prediction approach called Geographic-Temporal-Semantic-based Location Prediction (GTS-LP), which takes into account a user's geographic-triggered intentions, temporal-triggered intentions, and semantic-triggered intentions, to estimate the probability of the user in visiting a location. The core idea underlying our proposal is the discovery of trajectory patterns of users, namely GTS patterns, to capture frequent movements triggered by the three kinds of intentions. To achieve this goal, we define a new trajectory pattern to capture the key properties of the behaviors that are motivated by the three kinds of intentions from trajectories of users. In our GTS-LP approach, we propose a series of novel matching strategies to calculate the similarity between the current movement of a user and discovered GTS patterns based on various moving intentions. On the basis of similitude, we make an online prediction as to the location the user intends to visit. To the best of our knowledge, this is the first work on location prediction based on trajectory pattern mining that explores the geographic, temporal, and semantic properties simultaneously. By means of a comprehensive evaluation using various real trajectory datasets, we show that our proposed GTS-LP approach delivers excellent performance and significantly outperforms existing state-of-the-art location prediction methods.
Building Caring Healthcare Systems in the Internet of Things

The nature of healthcare and the computational and physical technologies and constraints present a number of challenges to systems designers and implementers. In spite of the challenges, there is a significant market for systems and products to support caregivers in their tasks as the number of people needing assistance grows substantially. In this paper, we present a structured approach for describing Internet of Things (IoT) for healthcare systems. We illustrate the approach for three use cases and discuss relevant quality issues that arise, in particular, the need to consider caring as a requirement.
Investigation of a new motor assessment scale for stroke patients.

The purpose of this paper is to present and describe a motor assessment scale (MAS) for stroke patients and to report on the investigation of two aspects of its reliability. The MAS is a brief and easily administered assessment of eight areas of motor function and one item related to muscle tone. Each item is scored on a scale from 0 to 6. To check interrater reliability, we videotaped five stroke patients while they were being assessed with the MAS. These scores were used as the criterion ratings. Twenty raters then assessed these patients, and their results were correlated with the criterion ratings. We determined test-retest reliability by assessing on two occasions, separated by a four-week interval, 14 stroke patients whose recovery was considered to be stable and by correlating these scores. The MAS was found to be highly reliable with an average interrater correlation of .95 and an average test-retest correlation of .98.
Software defined air interface: a framework of 5G air interface

The anticipated 1000 fold traffic growth in 2020 and the explosion of new services and applications including the massive Internet of Things, tactile internet, etc. pose tough challenges for the next generation mobile network. A soft end-toend solution from the core network to the radio access network, as well as the air interface is envisioned as the key to meet the extremely stringent demands. This paper presents our perspective of the 5G air interface and raise the concept of software defined air interface (SDAI) as a framework of 5G air interface. Instead of a global optimized air interface for the previous communication generations, SDAI is envisioned to bring agility and heighten the efficiency into the design and implementation of the building blocks of the air interface. The fundamental building blocks and the related parameters including spectrum, bandwidth, multiple access schemes, waveform, and so on, are all tunable such that the air interface can be optimized to each individual application scenario. To clarify the adaptation mechanism of SDAI, we provide a case study on the link adaptation between the sparse code multiple access (SCMA) scheme and the orthogonal frequency division multiplexing access (OFDMA) from energy efficiency and spectral efficiency co-design perspective.
Solving dynamic vehicle routing problem via evolutionary search with learning capability

To date, dynamic vehicle routing problem (DVRP) has attracted great research attentions due to its wide range of real world applications. In contrast to traditional static vehicle routing problem, the whole routing information in DVRP is usually unknown and obtained dynamically during the routing execution process. To solve DVRP, many heuristic and metaheuristic methods have been proposed in the literature. In this paper, we present a novel evolutionary search paradigm with learning capability for solving DVRP. In particular, we propose to capture the structured knowledge from optimized routing solution in early time slot, which can be further reused to bias the customer-vehicle assignment when dynamic occurs. By extending our previous research work, the learning of useful knowledge, and the scheduling of dynamic customer requests are detailed here. Further, to evaluate the efficacy of the proposed search paradigm, comprehensive empirical studies on 21 commonly used DVRP instances with diverse properties are also reported.
Learning a Deep Convolutional Network for Image Super-Resolution

We propose a deep learning method for single image superresolution (SR). Our method directly learns an end-to-end mapping between the low/high-resolution images. The mapping is represented as a deep convolutional neural network (CNN)  that takes the lowresolution image as the input and outputs the high-resolution one. We further show that traditional sparse-coding-based SR methods can also be viewed as a deep convolutional network. But unlike traditional methods that handle each component separately, our method jointly optimizes all layers. Our deep CNN has a lightweight structure, yet demonstrates state-of-the-art restoration quality, and achieves fast speed for practical on-line usage.
Enhancing Knowledge Graph Completion By Embedding Correlations

Despite their large sizes, modern Knowledge Graphs (KGs) are still highly incomplete. Statistical relational learning methods can detect missing links by "embedding" the nodes and relations into latent feature tensors. Unfortunately, these methods are unable to learn good embeddings if the nodes are not well-connected. Our proposal is to learn embeddings for correlations between subgraphs and add a post-prediction phase to counter the lack of training data. This technique, applied on top of methods like TransE or HolE, can significantly increase the predictions on realistic KGs.