nils-herrmann/clean_scirepeval huggingface dataset:
Klout score: Measuring influence across multiple social networks

In this work, we present the Klout Score, an influence scoring system that assigns scores to 750 million users across 9 different social networks on a daily basis. We propose a hierarchical framework for generating an influence score for each user, by incorporating information for the user from multiple networks and communities. Over 3600 features that capture signals of influential interactions are aggregated across multiple dimensions for each user. The features are scalably generated by processing over 45 billion interactions from social networks every day, as well as by incorporating factors that indicate real world influence. Supervised models trained from labeled data determine the weights for features, and the final Klout Score is obtained by hierarchically combining communities and networks. We validate the correctness of the score by showing that users with higher scores are able to spread information more effectively in a network. Finally, we use several comparisons to other ranking systems to show that highly influential and recognizable users across different domains have high Klout scores.
Coordinated Broadcasting for Multiuser Indoor Visible Light Communication Systems

Visible light communication (VLC) reuses illumination devices, particularly light-emitting diodes (LEDs), for communication purposes. It has great potential to alleviate the strain on radio-frequency spectrum in indoor environments. VLC-enabled LED luminaries form VLC attocells that carry downlink data traffic to indoor mobile or stationary terminals. While one of the advantages of indoor VLC is low interference due to natural cell boundaries such as walls, multiple VLC attocells within a room would interfere. This is because illumination requirements often mandate a rich overlap of emissions of luminaries in a room. In this paper, we suggest the coordination of multiple VLC attocells (i.e., VLC-enabled LED luminaries) to turn the problem of overlap and thus interference into an advantage. We stipulate that this coordination can be accomplished through power line communication, which has been considered before as a means to transport data to VLC transmitters. Borrowing from concepts developed for radio-frequency wireless communications, we develop several precoding schemes for the new coordinated VLC broadcasting architecture. These include designs for the case of imperfect channel knowledge at the VLC transmitter, since channel information is usually provided through a low-rate feedback channel. The performance advantages for VLC transmission due to the proposed coordination and precoding designs are demonstrated based on a set of numerical results.
A low-cost smart sensor for non intrusive load monitoring applications

Next generation Smart Cities have the potential to enhance the citizens quality of life and to reduce the overall energy expenditure. In particular, emerging smart metering technologies promise to greatly increase energy efficiency in the residential and industrial areas. In this context, new power metering methods such as Non-Intrusive Load Monitoring (NILM) can provide important real-time information about the contribution of any single appliance. In this paper, we present a complete hardware-software design that concentrates locally an efficient event-based supervised NILM algorithm for load disaggregation. This new kind of power analysis, which usually requires high computing capability, is executed real-time on a low-cost and easy-to-install smart meter ready for the Internet of Things (IoT).
Partial midfacial duplication.

A case of craniofacial duplication is presented. Details on this rare form are described, and its treatment is discussed with brief review of the pertinent literature. We excised the duplicate maxilla and also discovered bilateral macrostomia. A year later, a mass appeared again. By CT scan, we found that there was a mass in the skull base extruding to the superior wall of cavitas pharyngis. The mass below the sphenoid bone and the ethmoid bone connected with the skull base. CT scan also showed malformation of the first cervical vertebra and odontoid process had bifurcated. Once again, we excised the mass and found a cranial meningocele on the skull base, repaired the palate cleft, and closed the cerebral meningocele. The patient had a palate fistula after operation. A year later, the palate fistula and macrostomia were repaired. We think the patient should be operated on immediately after she was born so that we could relieve the dyspnea; furthermore, by one well-planned operation, we could repair the palate cleft and other deformity just after we excised the mass.
A Study of WhatsApp Usage Patterns and Prediction Models without Message Content

Internet social networks have become a ubiquitous application allowing people to easily share text, pictures, and audio and video files. Popular networks include WhatsApp, Facebook, Reddit and LinkedIn. We present an extensive study of the usage of the WhatsApp social network, an Internet messaging application that is quickly replacing SMS messaging. In order to better understand people’s use of the network, we provide an analysis of over 6 million messages from over 100 users, with the objective of building demographic prediction models using activity data. We performed extensive statistical and numerical analysis of the data and found significant differences in WhatsApp usage across people of different genders and ages. We also inputted the data into the Weka data mining package and studied models created from decision tree and Bayesian network algorithms. We found that different genders and age demographics had significantly different usage habits in almost all message and group attributes. We also noted differences in users’ group behavior and created prediction models, including the likelihood a given group would have relatively more file attachments, if a group would contain a larger number of participants, a higher frequency of activity, quicker response times and shorter messages. We were successful in quantifying and predicting a user’s gender and age demographic. Similarly, we were able to predict different types of group usage. All models were built without analyzing message content. We present a detailed discussion about the specific attributes that were contained in all predictive models and suggest possible applications based on these results. ∗This research is based on work supported in part by MAFAT and the ISRAEL SCIENCE FOUNDATION grant #1488/14. 1 ar X iv :1 80 2. 03 39 3v 1 [ cs .C Y ] 9 F eb 2 01 8
A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization

This paper considers a convex optimization problem with a globally coupled linear equality constraint and local polyhedron constraints and develops efficient distributed optimization methods. The considered problem has many engineering applications. Due to the polyhedron constraints, agents in the existing methods have to deal with polyhedron constrained subproblems at each iteration. One of the key challenges is that projection onto a polyhedron set is not trivial, which prohibits the agents from solving these subproblems efficiently. In this paper, based on the alternating direction method of multipliers (ADMM), we propose a new distributed optimization method, called proximal dual consensus ADMM (PDC-ADMM). The PDC-ADMM transforms the polyhedron constraints as quadratic penalty terms in the subproblems, making the subproblems efficiently solvable and consequently reducing the overall computational overhead of the agents. In addition, we propose a randomized PDC-ADMM which can deal with time-varying networks with randomly ON/OFF agents and communication errors, and an inexact (randomized) PDC-ADMM for low-complexity computations. We show that the proposed distributed methods converge to the optimal solution set almost surely and have a O (1/k) ergodic convergence rate in the mean. Numerical results show that the proposed methods offer significantly lower computation time than the existing distributed ADMM method in solving a linearly constrained LASSO problem.
Event-based stock market prediction

There are various studies on the behavior of the market. In particular, derivatives such as futures and options have taken a lot of attentions, lately. Predicting these derivatives is not only important for the risk management purposes, but also for price speculative activities. Besides that accurate prediction of the market’s direction can help investors to gain enormous profits with small amount of capital [Tsaih et al., 1998]. Stock market prediction can be viewed as a challenging time-series prediction [Kim, 2003]. There are many factors that are influential on the financial markets, including political events, natural disasters, economic conditions, and so on. Despite the complexity of the movements in market prices, the market behavior is not completely random. Instead, it is governed by a highly nonlinear dynamical system [Blank, 1991]. Forecasting the future prices is carried out based on the technical analysis, which studies the market’s action using past prices and the other market information. Market analysis is in contradiction with the Efficient Market Hypothesis (EMH). EMH was developed in 1970 by economist Eugene Fama [Fama, 1965a, Fama, 1965b] whose theory stated that it is not possible for an investor to outperform the market because all available information is already built into all stock prices. If the EMH was true, it would not be possible to use machine learning techniques for market prediction. Nevertheless, there are many successful technical analysis in the financial world and number of studies appearing in academic literature that are using machine learning techniques for market prediction [Choudhry and Garg, 2008]. One way to forecast the market movement is by analyzing the special events of the market such as earnings announcements. Earnings announcement for each stock is an official public statement of a company’s profitability for a specific time period, typically a quarter or a year. Each company has its specific earnings announcement dates. Stock price of a company is affected by the earnings announcement event. Equity analysts usually predict the earnings per share (EPS) prior to the announcement date. In this project, using machine-learning techniques, we want to predict whether a given stock will be rising in the following day after earnings announcement or not. This will lead to a binary classification problem, which can be tackled based on the huge amount of available public data. This project consists of two major tasks: data collection and application of machine learning algorithms. In §2, we will discuss our efforts to collect the required data. In continuation in §3, features definitions and selections are described. We have considered and discussed different machine learning algorithms in §4. In §5, the summary of our results and possible extensions are explained.
Loss of ‘Small-World’ Networks in Alzheimer's Disease: Graph Analysis of fMRI Resting-State Functional Connectivity

Local network connectivity disruptions in Alzheimer's disease patients have been found using graph analysis in BOLD fMRI. Other studies using MEG and cortical thickness measures, however, show more global long distance connectivity changes, both in functional and structural imaging data. The form and role of functional connectivity changes thus remains ambiguous. The current study shows more conclusive data on connectivity changes in early AD using graph analysis on resting-state condition fMRI data.



18 mild AD patients and 21 healthy age-matched control subjects without memory complaints were investigated in resting-state condition with MRI at 1.5 Tesla. Functional coupling between brain regions was calculated on the basis of pair-wise synchronizations between regional time-series. Local (cluster coefficient) and global (path length) network measures were quantitatively defined. Compared to controls, the characteristic path length of AD functional networks is closer to the theoretical values of random networks, while no significant differences were found in cluster coefficient. The whole-brain average synchronization does not differ between Alzheimer and healthy control groups. Post-hoc analysis of the regional synchronization reveals increased AD synchronization involving the frontal cortices and generalized decreases located at the parietal and occipital regions. This effectively translates in a global reduction of functional long-distance links between frontal and caudal brain regions.



We present evidence of AD-induced changes in global brain functional connectivity specifically affecting long-distance connectivity. This finding is highly relevant for it supports the anterior-posterior disconnection theory and its role in AD. Our results can be interpreted as reflecting the randomization of the brain functional networks in AD, further suggesting a loss of global information integration in disease.
Automated segmentation of cell nuclei in PAP smear images

In this paper an automated method for cell nucleus segmentation in PAP smear images is presented. The method combines the global knowledge about the cells and nuclei appearance and the local characteristics of the area of the nuclei, in order to achieve an accurate nucleus boundary. Filters and morphological operators in all three channels of a color image result in the determination of the locations of nuclei in the image, even in cases where cell overlapping occurs. The nucleus boundary is determined by a deformable model. The results are very promising, even when images with high degree of overlapping are used.
A multi-structural framework for adaptive supply chain planning and operations control with structure dynamics considerations

A trend in up-to-date developments in supply chain management (SCM) is to make supply chains more agile, flexible, and responsive. In supply chains, different structures (functional, organizational, informational, financial etc.) are (re)formed. These structures interrelate with each other and change in dynamics. The paper introduces a new conceptual framework for multi-structural planning and operations of adaptive supply chains with structure dynamics considerations. We elaborate a vision of adaptive supply chain management (A-SCM), a new dynamic model and tools for the planning and control of adaptive supply chains. SCM is addressed from perspectives of execution dynamics under uncertainty. Supply chains are modelled in terms of dynamic multi-structural macro-states, based on simultaneous consideration of the management as a function of both states and structures. The research approach is theoretically based on the combined application of control theory, operations research, and agent-based modelling. The findings suggest constructive ways to implement multi-structural supply chain management and to transit from a " one-way " partial optimization to the feedback-based, closed-loop adaptive supply chain optimization and execution management for value chain adaptability, stability and crisis-resistance. The proposed methodology enhances managerial insight into advanced supply chain management.
VMVM: unit test virtualization for Java

As software evolves and grows, its regression test suites tend to grow as well. When these test suites become too large, they can eventually reach a point where they become too length to regularly execute. Previous work in Test Suite Minimization has reduced the number of tests in such suites by attempting to identify those that are redundant (e.g. by a coverage metric). Our approach to ameliorating the runtime of these large test suites is complementary, instead focusing on reducing the overhead of running each test, an approach that we call Unit Test Virtualization. This Tool Demonstration presents our implementation of Unit Test Virtualization, VMVM (pronounced "vroom-vroom") and summarizes an evaluation of our implementation on 20 real-world Java applications, showing that it reduces test suite execution time by up to 97% (on average, 62%). A companion video to this demonstration is available online, at https://www.youtube.com/watch?v=sRpqF3rJERI.
SYBL: An Extensible Language for Controlling Elasticity in Cloud Applications

Elasticity in cloud computing is a complex problem, regarding not only resource elasticity but also quality and cost elasticity, and most importantly, the relations among the three. Therefore, existing support for controlling elasticity in complex applications, focusing solely on resource scaling, is not adequate. In this paper we present SYBL - a novel language for controlling elasticity in cloud applications - and its runtime system. SYBL allows specifying in detail elasticity monitoring, constraints, and strategies at different levels of cloud applications, including the whole application, application component, and within application component code. Based on simple SYBL elasticity directives, our runtime system will perform complex elasticity controls for the client, by leveraging underlying cloud monitoring and resource management APIs. We also present a prototype implementation and experiments illustrating how SYBL can be used in real-world scenarios.
Ontology Development Tools for Ontology-Based Knowledge Management

Ontologies play a key role in realizing the full power of etechnology. Ontologies allow for machine-understandable semantics of data, and facilitate the search, exchange, and integration of knowledge for B2B (business-to-business) and B2C (business-to-consumer) e-commerce. Ontology is defined as the specification of shared knowledge (Waterson & Preece, 1999). By using semantic data, the usability of e-technology can be facilitated. There are several languages like XML (extensible markup language), RDF (resource description framework), RDFS (RDF schema), DAML+OIL (DARPA Markup Language+Web Ontology Language), and OWL. Many tools have been developed for implementing metadata of ontologies using these languages. However, current tools have problems with interoperation and collaboration. The primary goal of this survey is to introduce and understand several tools through their use. Therefore, we can develop a new generation of tools that not only support more capabilities, but also solve the problems of current tools.
How to Remember What to Remember: Exploring Possibilities for Digital Reminder Systems

Digital reminder systems typically use time and place as triggers to remind people to perform activities. In this paper, we investigate how digital reminder systems could better support the process of remembering in a wider range of situations. We report findings from a survey and one-week diary study, which reveal that people want to remember to perform a broad spectrum of activities in the future, many of which cannot be supported by simple time- and location-based reminders. In addition to these examples of prospective memory, or ‘remembering intentions’ [53], we also find that people want support in ‘retrieving’ [53] information and details, especially those encountered through social interactions or intended for use in conversations with others. Drawing on our analysis of what people want to remember and how they try to support this, we draw implications for the design of intelligent reminder systems such as digital assistants (e.g. Microsoft’s Cortana) and smart speaker systems (e.g. Amazon Echo), and highlight the possibilities afforded by drawing on conversation and giving material form to digital reminders.
FPGA implementations of fast fourier transforms for real-time signal and image processing

Applications based on Fast Fourier Transform (FFT) such as signal and image processing require high computational power, plus the ability to experiment with algorithms. Reconfigurable hardware devices in the form of Field Programmable Gate Arrays (FPGAs) have been proposed as a way of obtaining high performance at an economical price. At present, however, users must program FPGAs at a very low level and have a detailed knowledge of the architecture of the device being used. To try to reconcile the dual requirements of high performance and ease of development, this paper reports on the design and realisation of a High Level framework for the implementation of 1-D and 2-D FFTs for real-time applications. Results show that the parallel implementation of 2-D FFT achieves virtually linear speed-up and real-time performance for large matrix sizes. Finally, an FPGA-based parametrisable environment based on the developed parallel 2-D FFT architecture is presented as a solution for frequencydomain image filtering application.
Google's Deep Web crawl

The Deep Web, i.e., content hidden behind HTML forms, has long been acknowledged as a significant gap in search engine coverage. Since it represents a large portion of the structured data on the Web, accessing Deep-Web content has been a long-standing challenge for the database community. This paper describes a system for surfacing Deep-Web content, i.e., pre-computing submissions for each HTML form and adding the resulting HTML pages into a search engine index. The results of our surfacing have been incorporated into the Google search engine and today drive more than a thousand queries per second to Deep-Web content. Surfacing the Deep Web poses several challenges. First, our goal is to index the content behind many millions of HTML forms that span many languages and hundreds of domains. This necessitates an approach that is completely automatic, highly scalable, and very efficient. Second, a large number of forms have text inputs and require valid inputs values to be submitted. We present an algorithm for selecting input values for text search inputs that accept keywords and an algorithm for identifying inputs which accept only values of a specific type. Third, HTML forms often have more than one input and hence a naive strategy of enumerating the entire Cartesian product of all possible inputs can result in a very large number of URLs being generated. We present an algorithm that efficiently navigates the search space of possible input combinations to identify only those that generate URLs suitable for inclusion into our web search index. We present an extensive experimental evaluation validating the effectiveness of our algorithms.
Normalized cuts in 3-D for spinal MRI segmentation

Segmentation of medical images has become an indispensable process to perform quantitative analysis of images of human organs and their functions. Normalized Cuts (NCut) is a spectral graph theoretic method that readily admits combinations of different features for image segmentation. The computational demand imposed by NCut has been successfully alleviated with the Nystro/spl uml/m approximation method for applications different than medical imaging. In this paper we discuss the application of NCut with the Nystro/spl uml/m approximation method to segment vertebral bodies from sagittal T1-weighted magnetic resonance images of the spine. The magnetic resonance images were preprocessed by the anisotropic diffusion algorithm, and three-dimensional local histograms of brightness was chosen as the segmentation feature. Results of the segmentation as well as limitations and challenges in this area are presented.
TWINE: A real-time system for TWeet analysis via INformation Extraction

In the recent years, the amount of user generated contents shared on the Web has significantly increased, especially in social media environment, e.g. Twitter, Facebook, Google+. This large quantity of data has generated the need of reactive and sophisticated systems for capturing and understanding the underlying information enclosed in them. In this paper we present TWINE, a real-time system for the big data analysis and exploration of information extracted from Twitter streams. The proposed system based on a Named Entity Recognition and Linking pipeline and a multi-dimensional spatial geo-localization is managed by a scalable and flexible architecture for an interactive visualization of micropost streams insights. The demo is available at http://twinemind.cloudapp.net/streaming1,2.