nils-herrmann/clean_scirepeval huggingface dataset:
Brain Tumor Segmentation and Radiomics Survival Prediction: Contribution to the BRATS 2017 Challenge

Quantitative analysis of brain tumors is critical for clinical decision making. While manual segmentation is tedious, time consuming and subjective, this task is at the same time very challenging to solve for automatic segmentation methods. In this paper we present our most recent effort on developing a robust segmentation algorithm in the form of a convolutional neural network. Our network architecture was inspired by the popular U-Net and has been carefully modified to maximize brain tumor segmentation performance. We use a dice loss function to cope with class imbalances and use extensive data augmentation to successfully prevent overfitting. Our method beats the current state of the art on BraTS 2015, is one of the leading methods on the BraTS 2017 validation set (dice scores of 0.896, 0.797 and 0.732 for whole tumor, tumor core and enhancing tumor, respectively) and achieves very good Dice scores on the test set (0.858 for whole, 0.775 for core and 0.647 for enhancing tumor). We furthermore take part in the survival prediction subchallenge by training an ensemble of a random forest regressor and multilayer perceptrons on shape features describing the tumor subregions. Our approach achieves 52.6% accuracy, a Spearman correlation coefficient of 0.496 and a mean square error of 209607 on the test set.
Single Document Summarization based on Nested Tree Structure

Many methods of text summarization combining sentence selection and sentence compression have recently been proposed. Although the dependency between words has been used in most of these methods, the dependency between sentences, i.e., rhetorical structures, has not been exploited in such joint methods. We used both dependency between words and dependency between sentences by constructing a nested tree, in which nodes in the document tree representing dependency between sentences were replaced by a sentence tree representing dependency between words. We formulated a summarization task as a combinatorial optimization problem, in which the nested tree was trimmed without losing important content in the source document. The results from an empirical evaluation revealed that our method based on the trimming of the nested tree significantly improved the summarization of texts.
The Impact of Deep Hierarchical Discourse Structures in the Evaluation of Text Coherence

Previous work by Lin et al. (2011) demonstrated the effectiveness of using discourse relations for evaluating text coherence. However, their work was based on discourse relations annotated in accordance with the Penn Discourse Treebank (PDTB) (Prasad et al., 2008), which encodes only very shallow discourse structures; therefore, they cannot capture long-distance discourse dependencies. In this paper, we study the impact of deep discourse structures for the task of coherence evaluation, using two approaches: (1) We compare a model with features derived from discourse relations in the style of Rhetorical Structure Theory (RST) (Mann and Thompson, 1988), which annotate the full hierarchical discourse structure, against our re-implementation of Lin et al.’s model; (2) We compare a model encoded using only shallow RST-style discourse relations, against the one encoded using the complete set of RST-style discourse relations. With an evaluation on two tasks, we show that deep discourse structures are truly useful for better differentiation of text coherence, and in general, RST-style encoding is more powerful than PDTBstyle encoding in these settings.
An enhancing framework for botnet detection using generative adversarial networks

The botnet, as one of the most formidable threats to cyber security, is often used to launch large-scale attack sabotage. How to accurately identify the botnet, especially to improve the performance of the detection model, is a key technical issue. In this paper, we propose a framework based on generative adversarial networks to augment botnet detection models (Bot-GAN). Moreover, we explore the performance of the proposed framework based on flows. The experimental results show that Bot-GAN is suitable for augmenting the original detection model. Compared with the original detection model, the proposed approach improves the detection performance, and decreases the false positive rate, which provides an effective method for improving the detection performance. In addition, it also retains the primary characteristics of the original detection model, which does not care about the network payload information, and has the ability to detect novel botnets and others using encryption or proprietary protocols.
Compact Triband Square-Slot Antenna With Symmetrical L-Strips for WLAN/WiMAX Applications

A novel triband square-slot antenna with symmetrical L-strips is presented for WLAN and WiMAX applications. The proposed antenna is composed of a square slot, a pair of L-strips, and a monopole radiator. By employing these structures, the antenna can yield three different resonances to cover the desired bands while maintaining small size and simple structure. Based on this concept, a prototype of a triband antenna is designed, fabricated, and tested. The experimental results show the antenna has the impedance bandwidths of 480 MHz (2.34-2.82 GHz), 900 MHz (3.16-4.06 GHz), and 680 MHz (4.69-5.37 GHz), which can cover both WLAN in the 2.4/5.2-GHz bands and WiMAX in the 2.5/3.5-GHz bands.
Muscular Movement Model-Based Automatic 3D/4D Facial Expression Recognition

Facial expression is an important channel for human nonverbal communication. This paper presents a novel and effective approach to automatic 3D/4D facial expression recognition based on the muscular movement model (MMM). In contrast to most of existing methods, the MMM deals with such an issue in the viewpoint of anatomy. It first automatically segments the input 3D face (frame) by localizing the corresponding points within each muscular region of the reference using iterative closest normal point. A set of features with multiple differential quantities, including coordinate, normal, values, are then extracted to describe the geometry deformation of each segmented region. Meanwhile, we analyze the importance of these muscular areas, and a score level fusion strategy is exploited to optimize their weights by the genetic algorithm in the learning step. The support vector machine and the hidden Markov model are finally used to predict the expression label in 3D and 4D, respectively. The experiments are conducted on the BU-3DFE and BU-4DFE databases, and the results achieved clearly demonstrate the effectiveness of the proposed method.
Teaching Classification Boundaries to Humans

Given a classification task, what is the best way to teach the resulting boundary to a human? While machine learning techniques can provide excellent methods for finding the boundary, including the selection of examples in an online setting, they tell us little about how we would teach a human the same task. We propose to investigate the problem of example selection and presentation in the context of teaching humans, and explore a variety of mechanisms in the interests of finding what may work best. In particular, we begin with the baseline of random presentation and then examine combinations of several mechanisms: the indication of an example’s relative difficulty, the use of the shaping heuristic from the cognitive science literature (moving from easier examples to harder ones), and a novel kernel-based “coverage model” of the subject’s mastery of the task. From our experiments on 54 human subjects learning and performing a pair of synthetic classification tasks via our teaching system, we found that we can achieve the greatest gains with a combination of shaping and the coverage model.
AOP++: A Generic Aspect-Oriented Programming Framework in C++

This paper presents AOP++, a generic aspect-oriented programming framework in C++. It successfully incorporates AOP with object-oriented programming as well as generic programming naturally in the framework of standard C++. It innovatively makes use of C++ templates to express pointcut expressions and match join points at compile time. It innovatively creates a full-fledged aspect weaver by using template metaprogramming techniques to perform aspect weaving. It is notable that AOP++ itself is written completely in standard C++, and requires no language extensions. With the help of AOP++, C++ programmers can facilitate AOP with only a little effort.
Data Governance for Platform Ecosystems: Critical Factors and the State of Practice

Recently, “platform ecosystem” has received attention as a key business concept. Sustainable growth of platform ecosystems is enabled by platform users supplying and/or demanding content from each other: e.g. Facebook, YouTube or Twitter. The importance and value of user data in platform ecosystems is accentuated since platform owners use and sell the data for their business. Serious concern is increasing about data misuse or abuse, privacy issues and revenue sharing between the different stakeholders. Traditional data governance focuses on generic goals and a universal approach to manage the data of an enterprise. It entails limited support for the complicated situation and relationship of a platform ecosystem where multiple participating parties contribute, use data and share profits. This article identifies data governance factors for platform ecosystems through literature review. The study then surveys the data governance state of practice of four platform ecosystems: Facebook, YouTube, EBay and Uber. Finally, 19 governance models in industry and academia are compared against our identified data governance factors for platform ecosystems to reveal the gaps and limitations.
Energy efficient virtual machine placement algorithm with balanced and improved resource utilization in a data center

Powerful data centers are the essential supporting infrastructure for mobile, ubiquitous, and cognitive computing, which are the most popular computing paradigms to utilize all kinds of physical resources and provide various services. To ensure the high quality of services, the performance and cost of a data center is a critical factor. In this paper, we investigate the issue of increasing the resource utilization of data centers to improve their performance and lower the cost. It is an efficient way to increase resource utilization via resource sharing. Technically, server virtualization provides the opportunity to share resources in data centers. However, it also introduces other problems, the primary problem being virtualmachine placement (VMP),which is to choose a proper physicalmachine (PM) to deploy virtual machines (VMs) in runtime. We study the virtual machine placement problem with the target of minimizing the total energy consumption by the running of PMs, which is also an indication of resource utilization and the cost of a data center. Due to themultiple dimensionality of physical resources, there always exists a waste of resources, which results from the imbalanced use ofmulti-dimensional resources. To characterize the multi-dimensional resource usage states of PMs, we present a multi-dimensional space partition model. Based on this model, we then propose a virtual machine placement algorithm EAGLE, which can balance the utilization ofmulti-dimensional resources, reduce the number of running PMs, and thus lower the energy consumption. We also evaluate our proposed balanced algorithm EAGLE via extensive simulations and experiments on real traces. Experimental results show, over the long run, that EAGLE can save as much as 15% more energy than the first fit algorithm.
Microscopy cell counting and detection with fully convolutional regression networks

This paper concerns automated cell counting and detection in microscopy images. The approach we take is to use convolutional neural networks (CNNs) to regress a cell spatial density map across the image. This is applicable to situations where traditional single-cell segmentation-based methods do not work well due to cell clumping or overlaps. We make the following contributions: (i) we develop and compare architectures for two fully convolutional regression networks (FCRNs) for this task; (ii) since the networks are fully convolutional, they can predict a density map for an input image of arbitrary size, and we exploit this to improve efficiency by end-to-end training on image patches; (iii) we show that FCRNs trained entirely on synthetic data are able to give excellent predictions on microscopy images from real biological experiments without fine-tuning, and that the performance can be further improved by fine-tuning on these real images. Finally, (iv) by inverting feature representations, we show to what extent the information from an input image has been encodedby feature responses in different layers.We set a new state-of-the-art performance for cell counting on standard synthetic image benchmarks and show that the FCRNs trained entirely with synthetic data can generalise well to real microscopy images both for cell counting and detections for the case of overlapping cells. ARTICLE HISTORY Received 15 Nov 2015  Jan 2016
A novel tool for visualizing chronic kidney disease associated polymorbidity: a 13-year cohort study in Taiwan

The aim of this study is to analyze and visualize the polymorbidity associated with chronic kidney disease (CKD). The study shows diseases associated with CKD before and after CKD diagnosis in a time-evolutionary type visualization.



Our sample data came from a population of one million individuals randomly selected from the Taiwan National Health Insurance Database, 1998 to 2011. From this group, those patients diagnosed with CKD were included in the analysis. We selected 11 of the most common diseases associated with CKD before its diagnosis and followed them until their death or up to 2011. We used a Sankey-style diagram, which quantifies and visualizes the transition between pre- and post-CKD states with various lines and widths. The line represents groups and the width of a line represents the number of patients transferred from one state to another.



The patients were grouped according to their states: that is, diagnoses, hemodialysis/transplantation procedures, and events such as death. A Sankey diagram with basic zooming and planning functions was developed that temporally and qualitatively depicts they had amid change of comorbidities occurred in pre- and post-CKD states.



This represents a novel visualization approach for temporal patterns of polymorbidities associated with any complex disease and its outcomes. The Sankey diagram is a promising method for visualizing complex diseases and exploring the effect of comorbidities on outcomes in a time-evolution style.



This type of visualization may help clinicians foresee possible outcomes of complex diseases by considering comorbidities that the patients have developed.
Physics-based face database for color research

Most face databases are meant for pattern recognition use. We report the creation of a unique face database which may be used for color-related studies of faces. We describe it as physicsbased because it not only contains color images but also data on color image formation such as spectral reflectance measurements from facial skin, illuminant spectral power distribution, and camera spectral response. We demonstrate the usefulness of the database by an approach we developed to color correct face images taken under different illumination conditions.
HFST - Framework for Compiling and Applying Morphologies

HFST–Helsinki Finite-State Technology (hfst.sf.net) is a framework for compiling and applying linguistic descriptions with finite-state methods. HFST currently connects some of the most important finite-state tools for creating morphologies and spellers into one open-source platform and supports extending and improving the descriptions with weights to accommodate the modeling of statistical information. HFST offers a path from language descriptions to efficient language applications in key environments and operating systems. HFST also provides an opportunity to exchange transducers between different software providers in order to get the best out of each finite-state library.
Color Dog - Guiding the Global Illumination Estimation to Better Accuracy

An important part of image enhancement is color constancy, which aims to make image colors invariant to illumination. In this paper the Color Dog (CD), a new learning-based global color constancy method is proposed. Instead of providing one, it corrects the other methods’ illumination estimations by reducing their scattering in the chromaticity space by using a its previously learning partition. The proposed method outperforms all other methods on most high-quality benchmark datasets. The results are presented and discussed.
Validation of the Computer Literacy Scale (CLS)

Successful use of ICT requires domain knowledge and interaction knowledge. It shapes and is shaped by the use of ICT and is less common among older adults. This paper focus on the validation of the computer literacy scale (CLS) introduced by . The CLS is an objective knowledge test of ICT-related symbols and terms commonly used in the graphical user interface of interactive computer technology. It has been designed specifically for older adults with little computer knowledge and is based on the idea that knowing common symbols and terms is as necessary for using computers, as it is for reading and writing letters and books. In this paper the Computer literacy scale is described and compared with related meas‐ ures for example computer expertise (CE), Computer Proficiency (CPQ) and computer anxiety (CATS). In addition criterion validity is described with predic‐ tions of successful ICT use exemplified with (1) the use of different data entry methods and (2) the use of different ticket vending machine (TVM) designs.
Managing Semantic Heterogeneity in Databases: A Theoretical Perspective

Modern database management systems essentially solve the problem of accessing and managing large volumes of related data on a single platform, or on a cluster of tightly-coupled platforms. But many problems remain when two or more databases need to work together. A fundamental problem is raised by semantic heterogeneity the fact that data duplicated across multiple databases is represented differently in the underlying database schemas. This tutorial describes fundamental problems raised by semantic heterogeneity and surveys theoretical frameworks that can provide solutions for them. The tutorial considers the following topics: (1) representative architectures for supporting database interoperation; (2) notions for comparing the “information capacity” of database schemas; (3) providing support for read-only integrated views of data, including the .virtual and materialized approaches; (4) providing support for read-write integrated views of data, including the issue of workflows on heterogeneous databases; and (5) research and tools for accessing and effectively using meta-data, e.g., to identify the relationships between schemas of different databases.
Extracting Social Networks from Literary Fiction

We present a method for extracting social networks from literature, namely, nineteenth-century British novels and serials. We derive the networks from dialogue interactions, and thus our method depends on the ability to determine when two characters are in conversation. Our approach involves character name chunking, quoted speech attribution and conversation detection given the set of quotes. We extract features from the social networks and examine their correlation with one another, as well as with metadata such as the novel’s setting. Our results provide evidence that the majority of novels in this time period do not fit two characterizations provided by literacy scholars. Instead, our results suggest an alternative explanation for differences in social networks.
A Novel UWB Antenna With Dual Notched Bands for WiMAX and WLAN Applications

A novel planar ultrawideband (UWB) antenna with dual notched bands is proposed and investigated. The antenna consists of a square patch and a modified grounded plane. To realize dual notched bands characteristics, a T-shaped stub embedded in the square slot of the radiation patch and a pair of U-shaped parasitic strips beside the feed line is used. The advantage of this antenna is the high rejection level in the stopband. The measured results show that the proposed dual-notched-bands planar antenna shows a very wide bandwidth from 2.8 to 11.0 GHz defined by voltage standing wave ratio VSWR <; 2, with two notched bands of 3.3-4.0 GHz (WiMAX band) and 5.05-5.90 GHz (WLAN band), respectively. Both the experimental and simulated results of the proposed antenna are presented, indicating that the antenna is a good candidate for various UWB applications.
Hiding Transaction Amounts and Balances in Bitcoin

Bitcoin is gaining increasing adoption and popularity nowadays. In spite of its reliance on pseudonyms, Bitcoin raises a number of privacy concerns due to the fact that all of the transactions that take place in the system are publicly announced. The literature contains a number of proposals that aim at evaluating and enhancing user privacy in Bitcoin. To the best of our knowledge, ZeroCoin (ZC) is the first proposal which prevents the public tracing of coin expenditure in Bitcoin by leveraging zero-knowledge proofs of knowledge and one-way accumulators. While ZeroCoin hardens the traceability of coins, it does not hide the amount per transaction, nor does it prevent the leakage of the balances of Bitcoin addresses. In this paper, we propose, EZC, an extension of ZeroCoin which (i) enables the construction of multi-valued ZCs whose values are only known to the sender and recipient of the transaction and (ii) supports the expenditure of ZCs among users in the Bitcoin system, without the need to convert them back to Bitcoins. By doing so, EZC hides transaction values and address balances in Bitcoin, for those users who opt-out from exchanging their coins to BTCs. We performed a preliminary assessment of the performance of EZC; our findings suggest that EZC improves the communication overhead incurred in ZeroCoin.
An Efficient Decoupling Feeding Network for Microstrip Antenna Array

An efficient decoupling feeding network is proposed in this letter. It is composed of two directional couplers and two sections of transmission line for connection use. By connecting the two couplers, an indirect coupling with controlled magnitude and phase is introduced, which can be used to cancel out the direct coupling caused by space waves and surface waves between array elements. To demonstrate the method, a two-element microstrip antenna array with the proposed network has been designed, fabricated and measured. Both simulated and measured results have simultaneously proved that the proposed method presents excellent decoupling performance. The measured mutual coupling can be reduced to below -58 dB at center frequency. Meanwhile it has little influence on return loss and radiation patterns. The decoupling mechanism is simple and straightforward which can be easily applied in phased array antennas and MIMO systems.