nils-herrmann/clean_scirepeval huggingface dataset:
Breast Cancer Multi-classification from Histopathological Images with Structured Deep Learning Model

Automated breast cancer multi-classification from histopathological images plays a key role in computer-aided breast cancer diagnosis or prognosis. Breast cancer multi-classification is to identify subordinate classes of breast cancer (Ductal carcinoma, Fibroadenoma, Lobular carcinoma, etc.). However, breast cancer multi-classification from histopathological images faces two main challenges from: (1) the great difficulties in breast cancer multi-classification methods contrasting with the classification of binary classes (benign and malignant), and (2) the subtle differences in multiple classes due to the broad variability of high-resolution image appearances, high coherency of cancerous cells, and extensive inhomogeneity of color distribution. Therefore, automated breast cancer multi-classification from histopathological images is of great clinical significance yet has never been explored. Existing works in literature only focus on the binary classification but do not support further breast cancer quantitative assessment. In this study, we propose a breast cancer multi-classification method using a newly proposed deep learning model. The structured deep learning model has achieved remarkable performance (average 93.2% accuracy) on a large-scale dataset, which demonstrates the strength of our method in providing an efficient tool for breast cancer multi-classification in clinical settings.
A review of high-power wireless power transfer

High-power wireless power transfer (HPWPT) is a key enabling technology for the adoption of battery electric vehicles (BEVs). As the technology has matured from year to year, discussions of standardization and many commercial partners have come to the area. Much research has been done in this area, and the realization of high-power charging has been furthered by the introduction of new techniques and devices. Here, current high-power WPT systems are reviewed and the passive elements, devices, subsystems, and techniques that have been developed to reach high-power levels are briefly detailed.
Information privacy risk assessment of Facebook Graph Search

This Social networking sites remain a popular method of interaction and channel of communication for modern society. As the number of social networking users increase, the size of social networks is significantly increasing. To enhance the searching technique, graph based search algorithm is adopted but the adoption of this searching technique has increased the security issues for the users and their data. There is a necessity for strong privacy tools which will protect the privacy of users in graph based search. In this poster, we present the privacy risks of Facebook (FB) Graph Search.
An Assessment of the Accuracy of Automatic Evaluation in Summarization

Automatic evaluation has greatly facilitated system development in summarization. At the same time, the use of automatic evaluation has been viewed with mistrust by many, as its accuracy and correct application are not well understood. In this paper we provide an assessment of the automatic evaluations used for multi-document summarization of news. We outline our recommendations about how any evaluation, manual or automatic, should be used to find statistically significant differences between summarization systems. We identify the reference automatic evaluation metrics— ROUGE 1 and 2—that appear to best emulate human pyramid and responsiveness scores on four years of NIST evaluations. We then demonstrate the accuracy of these metrics in reproducing human judgements about the relative content quality of pairs of systems and present an empirical assessment of the relationship between statistically significant differences between systems according to manual evaluations, and the difference according to automatic evaluations. Finally, we present a case study of how new metrics should be compared to the reference evaluation, as we search for even more accurate automatic measures.
Factors Influencing Consumers ’ E-Commerce Commodity Purchases

The 2002 North America Online Report published by eMarketer estimates that almost 24 million pre-college age students (ages 9-17) are already shopping online and gaining valuable e-commerce purchasing experience. Estimates of online shopping usage project steady growth, the number of young adults buying online will increase proportionally. This research seeks to develop a better understanding of the factors motivating young people to select e-commerce vendors for commodity purchases by exploring attitudes, demographic characteristics and purchase decision perceptions (i.e., the product, shopping experience, customer service, and consumer risk). Findings indicate that young adults with a history of e-commerce purchasing experience have a more positive attitude towards online buying than do young adults without e-commerce purchasing experience. In a related finding, a history of e-commerce purchasing experience serves as a good predictor of future e-commerce commodity purchases. Additionally, consumer risk and shopping experience perceptions were found to influence experienced e-commerce shoppers’ commodity purchase decisions more than customer service or consumer risk.
Dude, where's my card?: RFID positioning that works with multipath and non-line of sight

RFIDs are emerging as a vital component of the Internet of Things. In 2012, billions of RFIDs have been deployed to locate equipment, track drugs, tag retail goods, etc. Current RFID systems, however, can only identify whether a tagged object is within radio range (which could be up to tens of meters), but cannot pinpoint its exact location. Past proposals for addressing this limitation rely on a line-of-sight model and hence perform poorly when faced with multipath effects or non-line-of-sight, which are typical in real-world deployments. This paper introduces the first fine-grained RFID positioning system that is robust to multipath and non-line-of-sight scenarios. Unlike past work, which considers multipath as detrimental, our design exploits multipath to accurately locate RFIDs. The intuition underlying our design is that nearby RFIDs experience a similar multipath environment (e.g., reflectors in the environment) and thus exhibit similar multipath profiles. We capture and extract these multipath profiles by using a synthetic aperture radar (SAR) created via antenna motion. We then adapt dynamic time warping (DTW) techniques to pinpoint a tag's location. We built a prototype of our design using USRP software radios. Results from a deployment of 200 commercial RFIDs in our university library demonstrate that the new design can locate misplaced books with a median accuracy of 11~cm.
Detailed Full-Body Reconstructions of Moving People from Monocular RGB-D Sequences

We accurately estimate the 3D geometry and appearance of the human body from a monocular RGB-D sequence of a user moving freely in front of the sensor. Range data in each frame is first brought into alignment with a multi-resolution 3D body model in a coarse-to-fine process. The method then uses geometry and image texture over time to obtain accurate shape, pose, and appearance information despite unconstrained motion, partial views, varying resolution, occlusion, and soft tissue deformation. Our novel body model has variable shape detail, allowing it to capture faces with a high-resolution deformable head model and body shape with lower-resolution. Finally we combine range data from an entire sequence to estimate a high-resolution displacement map that captures fine shape details. We compare our recovered models with high-resolution scans from a professional system and with avatars created by a commercial product. We extract accurate 3D avatars from challenging motion sequences and even capture soft tissue dynamics.
How We’re Predicting AI – or Failing to

This paper will look at the various predictions that have been made about AI and propose decomposition schemas for analyzing them. It will propose a variety of theoretical tools for analyzing, judging, and improving these predictions. Focusing specifically on timeline predictions (dates given by which we should expect the creation of AI), it will show that there are strong theoretical grounds to expect predictions to be quite poor in this area. Using a database of 95 AI timeline predictions, it will show that these expectations are born out in practice: expert predictions contradict each other considerably, and are indistinguishable from non-expert predictions and past failed predictions. Predictions that AI lie 15 to 25 years in the future are the most common, from experts and non-experts alike. Armstrong, Stuart, and Kaj Sotala. 2012. “How We’re Predicting AI—or Failing To.” In Beyond AI: Artificial Dreams, edited by Jan Romportl, Pavel Ircing, Eva Zackova, Michal Polak, and Radek Schuster, 52–75.  University of West Bohemia. This version contains minor changes. Stuart Armstrong,
When Social Bots Attack: Modeling Susceptibility of Users in Online Social Networks

Social bots are automatic or semi-automatic computer programs that mimic humans and/or human behavior in online social networks. Social bots can attack users (targets) in online social networks to pursue a variety of latent goals, such as to spread information or to influence targets. Without a deep understanding of the nature of such attacks or the susceptibility of users, the potential of social media as an instrument for facilitating discourse or democratic processes is in jeopardy. In this paper, we study data from the Social Bot Challenge 2011 an experiment conducted by the WebEcologyProject during 2011 in which three teams implemented a number of social bots that aimed to influence user behavior on Twitter. Using this data, we aim to develop models to (i) identify susceptible users among a set of targets and (ii) predict users’ level of susceptibility. We explore the predictiveness of three different groups of features (network, behavioral and linguistic features) for these tasks. Our results suggest that susceptible users tend to use Twitter for a conversational purpose and tend to be more open and social since they communicate with many different users, use more social words and show more affection than non-susceptible users.
Organizational Learning and Management Information Systems

T he articles in this issue ofDATA BASE were chosen b y Anthony G . Hopwood, who is a professor of accounting and financial reporting at the London Graduate Schoo l of Business Studies . The articles contain important ideas , Professor Hopwood wrote, of significance to all intereste d in information systems, be they practitioners or academics . The authors, with their professional affiliations at th e time, were Chris Argyris, Graduate School of Education , Harvard University; Bo Hedberg and Sten Jonsson, Department of Business Administration, University o f Gothenburg;  Philips' Gloeilampenfabrieken, The Netherlands, and Michael J . Earl, Oxford Centre for Management Studies . The articles appeared originally in Accounting, Organizations and Society, a publication of which Professor Hopwood is editor-in-chief. AOS exists to monitor emergin g developments and to actively encourage new approaches and perspectives .
Information interaction: Providing a framework for information architecture

Information interaction is the process that people use in interacting with the content of an information system. Information architecture is a blueprint and navigational aid to the content of information-rich systems. As such information architecture performs an important supporting role in information interactivity. This article elaborates on a model of information interactivity that crosses the “no-man’s land” between user and computer articulating a model that includes user, content and system, illustrating the context for information architecture.
DOLPHIn—Dictionary Learning for Phase Retrieval

We propose a new algorithm to learn a dictionary for reconstructing and sparsely encoding signals from measurements without phase. Specifically, we consider the task of estimating a two-dimensional image from squared-magnitude measurements of a complex-valued linear transformation of the original image. Several recent phase retrieval algorithms exploit underlying sparsity of the unknown signal in order to improve recovery performance. In this work, we consider such a sparse signal prior in the context of phase retrieval, when the sparsifying dictionary is not known in advance. Our algorithm jointly reconstructs the unknown signal-possibly corrupted by noise-and learns a dictionary such that each patch of the estimated image can be sparsely represented. Numerical experiments demonstrate that our approach can obtain significantly better reconstructions for phase retrieval problems with noise than methods that cannot exploit such “hidden” sparsity. Moreover, on the theoretical side, we provide a convergence result for our method.
Multi-document English Text Summarization using Latent Semantic Analysis

In today's busy schedule, everybody expects to get the information in short but meaningful manner. Huge long documents consume more time to read. For this, we need summarization of document. Work has been done on Single-document but need of multiple document summarization is encouraging. Existing methods such as cluster approach, graph-based approach and fuzzy-based approach for multiple document summaries are improving. The statistical approach based on algebraic method is still topic of research. It demands for improvement in the approach by considering the limitations of Latent Semantic Analysis (LSA). Firstly, it reads only input text and does not consider world knowledge, for example women and lady it does not consider synonyms. Secondly, it does not consider word order, for example I will deliver to you tomorrow, deliver I will to you or tomorrow I will deliver to you. These different clauses may wrongly convey same meaning in different parts of document. Experimental results have overcomed the limitation and prove LSA with tf-idf method better in performance than KNN with tf-idf.
Fixed-point algorithms for learning determinantal point processes

Determinantal point processes (DPPs) offer an elegant tool for encoding probabilities over subsets of a ground set. Discrete DPPs are parametrized by a positive semidefinite matrix (called the DPP kernel), and estimating this kernel is key to learning DPPs from observed data. We consider the task of learning the DPP kernel, and develop for it a surprisingly simple yet effective new algorithm. Our algorithm offers the following benefits over previous approaches: (a) it is much simpler; (b) it yields equally good and sometimes even better local maxima; and (c) it runs an order of magnitude faster on large problems. We present experimental results on both real and simulated data to illustrate the numerical performance of our technique.
Budgeted Task Scheduling for Crowdsourced Knowledge Acquisition

Knowledge acquisition (e.g. through labeling) is one of the most successful applications in crowdsourcing. In practice, collecting as specific as possible knowledge via crowdsourcing is very useful since specific knowledge can be generalized easily if we have a knowledge base, but it is difficult to infer specific knowledge from general knowledge. Meanwhile, tasks for acquiring more specific knowledge can be more difficult for workers, thus need more answers to infer high-quality results. Given a limited budget, assigning workers to difficult tasks will be more effective for the goal of specific knowledge acquisition. However, existing crowdsourcing task scheduling cannot incorporate the specificity of workers' answers. In this paper, we present a new framework for task scheduling with the limited budget, targeting an effective solution to more specific knowledge acquisition. We propose novel criteria for evaluating the quality of specificity-dependent answers and result inference algorithms to aggregate more specific answers with budget constraints. We have implemented our framework with real crowdsourcing data and platform, and have achieved significant performance improvement compared with existing approaches.
Normalization at the field level: Fractional counting of citations

Van Raan et al. (2010) accepted our critique for the case of journal normalization (previously CPP/JCSm); CWTS has in the meantime adapted its procedures. However, a new indicator was proposed for field normalization (previously CPP/FCSm), called the “mean normalized citation score” (MNCS; cf. Lundberg, 2007). In our opinion, this latter change does not sufficiently resolve the problems. Since the new indicator is considered another “crown indicator,” it seems urgent to warn against and elaborate on these remaining problems. In addition to damaging evaluation processes at the level of individuals and institutions, the “crown indicator” is also used by CWTS for the “Leiden Rankings,” and flaws in it can therefore misguide policies at national levels.
Association Rule Mining: A Survey

Data mining [Chen et al. 1996] is the process of extracting interesting (non-trivial, implicit, previously unknown and potentially useful) information or patterns from large information repositories such as: relational database, data warehouses, XML repository, etc. Also data mining is known as one of the core processes of Knowledge Discovery in Database (KDD). Many people take data mining as a synonym for another popular term, Knowledge Discovery in Database (KDD). Alternatively other people treat Data Mining as the core process of KDD. The KDD processes are shown in Figure 1 [Han and Kamber 2000]. Usually there are three processes. One is called preprocessing, which is executed before data mining techniques are applied to the right data. The preprocessing includes data cleaning, integration, selection and transformation. The main process of KDD is the data mining process, in this process different algorithms are applied to produce hidden knowledge. After that comes another process called postprocessing, which evaluates the mining result according to users’ requirements and domain knowledge. Regarding the evaluation results, the knowledge can be presented if the result is satisfactory, otherwise we have to run some or all of those processes again until we get the satisfactory result. The actually processes work as follows. First we need to clean and integrate the databases. Since the data source may come from different databases, which may have some inconsistences and duplications, we must clean the data source by removing those noises or make some compromises. Suppose we have two different databases, different words are used to refer the same thing in their schema. When we try to integrate the two sources we can only choose one of them, if we know that they denote the same thing. And also real world data tend to be incomplete and noisy due to the manual input mistakes. The integrated data sources can be stored in a database, data warehouse or other repositories. As not all the data in the database are related to our mining task, the second process is to select task related data from the integrated resources and transform them into a format that is ready to be mined. Suppose we want to find which items are often purchased together in a supermarket, while the database that records the purchase history may contains customer ID, items bought, transaction time, prices, number of each items and so on, but for this specific task we only need items bought. After selection of relevant data, the database that we are going to apply our data mining techniques to will be much smaller, consequently the whole process will be
DeepPano: Deep Panoramic Representation for 3-D Shape Recognition

This letter introduces a robust representation of 3-D shapes, named DeepPano, learned with deep convolutional neural networks (CNN). Firstly, each 3-D shape is converted into a panoramic view, namely a cylinder projection around its principle axis. Then, a variant of CNN is specifically designed for learning the deep representations directly from such views. Different from typical CNN, a row-wise max-pooling layer is inserted between the convolution and fully-connected layers, making the learned representations invariant to the rotation around a principle axis. Our approach achieves state-of-the-art retrieval/classification results on two large-scale 3-D model datasets (ModelNet-10 and ModelNet-40), outperforming typical methods by a large margin.
The prevalence and features of the polycystic ovary syndrome in an unselected population.

Notwithstanding the potential public health impact of the polycystic ovary syndrome (PCOS), estimates regarding its prevalence are limited and unclear. Between July 1998 and October 1999, 400 unselected consecutive premenopausal women (18-45 yr of age) seeking a preemployment physical at the University of Alabama at Birmingham were studied (223 Black, 166 White, and 11 of other races). Evaluation included a history and physical examination, a modified Ferriman-Gallwey hirsutism score, and serum screening for hyperandrogenemia, hyperprolactinemia, and 21-hydroxylase-deficient nonclassical adrenal hyperplasia. PCOS was diagnosed by the presence of the following: 1) oligoovulation, 2) hyperandrogenemia and/or hirsutism (modified Ferriman-Gallwey score > or = 6), and 3) the exclusion of related disorders. Confirmed PCOS was established in those individuals whose evaluation was complete and indicative of PCOS, and possible PCOS was established when the hormonal evaluation was not complete or was unavailable, but the clinical phenotype was otherwise suggestive of the disorder. The individual probability of PCOS in women with possible PCOS was assigned a weight based on the findings in similar subjects whose evaluation was complete, and the total number of PCOS cases arising from these individuals was calculated (i.e. individual probability of PCOS x total number of subjects in the group). The cumulative prevalence of PCOS in our population was 6.6% (26.5 of 400), including 15 subjects among the 347 women completing their evaluation and a calculated prevalence of 11.5 subjects among the remainder. The prevalence rates of PCOS for Black and White women were 8.0 and 4.8%, respectively, not significantly different. These data from a large representative unselected population support the concept that PCOS is the most common endocrine abnormality of reproductive-aged women in the United States.