nils-herrmann/clean_scirepeval huggingface dataset:
A comparative review of tone-mapping algorithms for high dynamic range video

Tone-mapping constitutes a key component within the field of high dynamic range (HDR) imaging. Its importance is manifested in the vast amount of tone-mapping methods that can be found in the literature, which are the result of an active development in the area for more than two decades. Although these can accommodate most requirements for display of HDR images, new challenges arose with the advent of HDR video, calling for additional considerations in the design of tone-mapping operators (TMOs). Today, a range of TMOs exist that do support video material. We are now reaching a point where most camera captured HDR videos can be prepared in high quality without visible artifacts, for the constraints of a standard display device. In this report, we set out to summarize and categorize the research in tone-mapping as of today, distilling the most important trends and characteristics of the tone reproduction pipeline. While this gives a wide overview over the area, we then specifically focus on tone-mapping of HDR video and the problems this medium entails. First, we formulate the major challenges a video TMO needs to address. Then, we provide a description and categorization of each of the existing video TMOs. Finally, by constructing a set of quantitative measures, we evaluate the performance of a number of the operators, in order to give a hint on which can be expected to render the least amount of artifacts. This serves as a comprehensive reference, categorization and comparative assessment of the state-of-the-art in tone-mapping for HDR video.
Wind Power Density Forecasting Using Ensemble Predictions and Time Series Models

Wind power is an increasingly used form of renewable energy. The uncertainty in wind generation is very large due to the inherent variability in wind speed, and this needs to be understood by operators of power systems and wind farms. To assist with the management of this risk, this paper investigates methods for predicting the probability density function of generated wind power from one to ten days ahead at five U.K. wind farm locations. These density forecasts provide a description of the expected future value and the associated uncertainty. We construct density forecasts from weather ensemble predictions, which are a relatively new type of weather forecast generated from atmospheric models. We also consider density forecasting from statistical time series models. The best results for wind power density prediction and point forecasting were produced by an approach that involves calibration and smoothing of the ensemble-based wind power density.
Clickbait Detection

This paper proposes a new model for the detection of clickbait, i.e., short messages that lure readers to click a link. Clickbait is primarily used by online content publishers to increase their readership, whereas its automatic detection will give readers a way of filtering their news stream. We contribute by compiling the first clickbait corpus of 2992 Twitter tweets, 767 of which are clickbait, and, by developing a clickbait model based on 215 features that enables a random forest classifier to achieve 0.79 ROC-AUC at 0.76 precision and 0.76 recall.
Modeling and controller design of a bidirectional resonant converter battery charger

In this manuscript, an optimized and detailed controller design methodology is proposed for a bidirectional CLLLC-type resonant converter for battery charging application. While this topology of resonant converters offers a number of advantages, including soft-switching in all switches, and very high power-stage efficiency, the dynamic characteristics of this converter change significantly as the battery charges or discharges which imposes difficulty in closed loop controller design. High-Q resonant peaking in the open-loop bode-plots of this converter is main cause of system instability. In this paper, a controller design methodology is proposed that will guarantee a stable operation during the entire operating frequency range in both battery charging mode (BCM) and regeneration mode (RM). To validate the proposed controller design methodology, the output current and voltage loop controllers are designed for a 3.5 kW converter. The step response showed a stable system thus validating the proposed controller design methodology.
STM32-based vehicle data acquisition system for Internet-of-Vehicles

As the new era of the Internet of Things(IoT) is driving the evolution of conventional Vehicle Ad-hoc Networks into the Internet of Vehicles(IoV), vehicles are equipped with different kinds of sensor and become a sensing node themselves in IoV. Consequently, complexity of the automotive electronic system inside the vehicles are daily increasing. To guarantee the safe operation of vehicles, it is of great significance to acquire vehicle data in real-time to realize the on-line diagnosis, cyber-security attacking detection and et al. In this paper, we propose to realize a STM32-based data acquisition system(DAS), where the vehicle data transferred on CAN networks are acquired through the OBD2(On-Broad Diagnosis) interface. And then, the acquired vehicle data are parsed and analyzed preliminarily according to the OBD2 protocol, and then shown on a LED displayer. Through the implementation of a prototype system, the feasibility and effectiveness of the proposed design of DAS is verified.
Modularized Morphing of Neural Networks

In this work we study the problem of network morphism, an effective learning scheme to morph a well-trained neural network to a new one with the network function completely preserved. Different from existing work where basic morphing types on the layer level were addressed, we target at the central problem of network morphism at a higher level, i.e., how a convolutional layer can be morphed into an arbitrary module of a neural network. To simplify the representation of a network, we abstract a module as a graph with blobs as vertices and convolutional layers as edges, based on which the morphing process is able to be formulated as a graph transformation problem. Two atomic morphing operations are introduced to compose the graphs, based on which modules are classified into two families, i.e., simple morphable modules and complex modules. We present practical morphing solutions for both of these two families, and prove that any reasonable module can be morphed from a single convolutional layer. Extensive experiments have been conducted based on the state-of-the-art ResNet on benchmark datasets, and the effectiveness of the proposed solution has been verified.
Home automation using IoT and a chatbot using natural language processing

Home automation — controlling the fans, lights and other electrical appliances in a house using Internet of things is widely preferred in recent days. In this paper, we propose a web application using which the fans, lights and other electrical appliances can be controlled over the Internet. The important features of the web application is that firstly, we have a chatbot algorithm such that the user can text information to control the functioning of the electrical appliances at home. The messages sent using the chatbot is processed using Natural Language processing techniques. Secondly, any device connected to the local area network of the house can control the devices and other appliances in the house. Thirdly, the web application used to enable home automation also has a security feature that only enables certain users to access the application. And finally, it also has a functionality of sending an email alert when intruder is detected using motion sensors.
A survey of event detection techniques in online social networks

The online social networks (OSNs) have become an important platform for detecting real-world event in recent years. These real-world events are detected by analyzing huge social-stream data available on different OSN platforms. Event detection has become significant because it contains substantial information which describes different scenarios during events or crisis. This information further helps to enable contextual decision making, regarding the event location, content and the temporal specifications. Several studies exist, which offers plethora of frameworks and tools for detecting and analyzing events used for applications like crisis management, monitoring and predicting events in different OSN platforms. In this paper, a survey is done for event detection techniques in OSN based on social text streams—newswire, web forums, emails, blogs and microblogs, for natural disasters, trending or emerging topics and public opinion-based events. The work done and the open problems are explicitly mentioned for each social stream. Further, this paper elucidates the list of event detection tools available for the researchers.
QRSF: QoS-aware resource scheduling framework in cloud computing

Cloud computing harmonizes and delivers the ability of resource sharing over different geographical sites. Cloud resource scheduling is a tedious task due to the problem of finding the best match of resource-workload pair. The efficient management of dynamic nature of resource can be done with the help of cloud workloads. Till cloud workload is deliberated as a central capability, the resources cannot be utilized in an effective way. In literature, very few efficient resource scheduling policies for energy, cost and time constraint cloud workloads are reported. This paper presents an efficient cloud workload management framework in which cloud workloads have been identified, analyzed and clustered through K-means on the basis of weights assigned and their QoS requirements. Further scheduling has been done based on different scheduling policies and their corresponding algorithms. The performance of the proposed algorithms has been evaluated with existing scheduling policies through CloudSim toolkit. The experimental results show that the proposed framework gives better results in terms of energy consumption, execution cost and time of different cloud workloads as compared to existing algorithms.
The KUKA Control Toolbox: motion control of KUKA robot manipulators with MATLAB

The KUKA Control Toolbox (KCT) is a collection of MATLAB functions developed at the University of Siena, for motion control of KUKA robot manipulators. The toolbox, which is compatible with all 6 DOF small and low-payload KUKA robots that use the Eth.RSIXML, runs on a remote computer connected with the KUKA controller via TCP/IP. KCT includes more than 40 functions, spanning operations such as forward and inverse kinematics computation, point-to-point joint and Cartesian control, trajectory generation, graphical display, 3-D animation and diagnostics. Applicative examples show the flexibility of KCT and its easy interfacing with other toolboxes and external devices.
Machine Learning and Inference Laboratory An Optimized Design of Finned-Tube Evaporators Using the Learnable Evolution Model

Optimizing the refrigerant circuitry for a finned-tube evaporator is a daunting task for traditional exhaustive search techniques due to the extremely large number of circuitry possibilities. For this reason, more intelligent search techniques are needed. This paper presents and evaluates a novel optimization system, called ISHED1 (Intelligent System for Heat Exchanger Design). This system uses a recently developed non-Darwinian evolutionary computation method to seek evaporator circuit designs that maximize the capacity of the evaporator under given technical and environmental constraints. Circuitries were developed for an evaporator with three depth rows of 12 tubes each, based on optimizing the performance with uniform and non-uniform airflow profiles. ISHED1 demonstrated the capability to design an optimized circuitry for a non-uniform air distribution so the capacity showed no degradation over the traditional balanced circuitry design working with a uniform airflow.
Active Learning Literature Survey

The key idea behind active learning is that a machine learning algorithm can achieve greater accuracy with fewer labeled training instances if it is allowed to choose the data from which is learns. An active learner may ask queries in the form of unlabeled instances to be labeled by an oracle (e.g., a human annotator). Active learning is well-motivated in many modern machine learning problems, where unlabeled data may be abundant but labels are difficult, time-consuming, or expensive to obtain. This report provides a general introduction to active learning and a survey of the literature. This includes a discussion of the scenarios in which queries can be formulated, and an overview of the query strategy frameworks proposed in the literature to date. An analysis of the empirical and theoretical evidence for active learning, a summary of several problem setting variants, and a discussion of related topics in machine learning research are also presented.
Language support for fast and reliable message-based communication in singularity OS

Message-based communication offers the potential benefits of providing stronger specification and cleaner separation between components. Compared with shared-memory interactions, message passing has the potential disadvantages of more expensive data exchange (no direct sharing) and more complicated programming.In this paper we report on the language, verification, and run-time system features that make messages practical as the sole means of communication between processes in the Singularity operating system. We show that using advanced programming language and verification techniques, it is possible to provide and enforce strong system-wide invariants that enable efficient communication and low-overhead software-based process isolation. Furthermore, specifications on communication channels help in detecting programmer mistakes early---namely at compile-time---thereby reducing the difficulty of the message-based programming model.The paper describes our communication invariants, the language and verification features that support them, as well as implementation details of the infrastructure. A number of benchmarks show the competitiveness of this approach.
Machine learning approach for automated screening of malaria parasite using light microscopic images.

The aim of this paper is to address the development of computer assisted malaria parasite characterization and classification using machine learning approach based on light microscopic images of peripheral blood smears. In doing this, microscopic image acquisition from stained slides, illumination correction and noise reduction, erythrocyte segmentation, feature extraction, feature selection and finally classification of different stages of malaria (Plasmodium vivax and Plasmodium falciparum) have been investigated. The erythrocytes are segmented using marker controlled watershed transformation and subsequently total ninety six features describing shape-size and texture of erythrocytes are extracted in respect to the parasitemia infected versus non-infected cells. Ninety four features are found to be statistically significant in discriminating six classes. Here a feature selection-cum-classification scheme has been devised by combining F-statistic, statistical learning techniques i.e., Bayesian learning and support vector machine (SVM) in order to provide the higher classification accuracy using best set of discriminating features. Results show that Bayesian approach provides the highest accuracy i.e., 84% for malaria classification by selecting 19 most significant features while SVM provides highest accuracy i.e., 83.5% with 9 most significant features. Finally, the performance of these two classifiers under feature selection framework has been compared toward malaria parasite classification.
Pose estimation of anime/manga characters: a case for synthetic data

2D articulated pose estimation is the task of locating the body joint positions of a human figure in an image. A pose estimator that works on anime/manga images could be an important component of an automatic system to create 3D animation from existing manga or anime, which could significantly the lower cost of media production. To create an accurate pose estimator, however, a sizable and high-quality dataset is needed, and such a dataset can be expensive to create.
 To alleviate data scarcity, we propose using a database of 3D character models and poses to generate synthetic training data for 2D pose estimators of anime/manga characters based on convolutional neural networks (CNN). We demonstrate that a high-performing estimator can be obtained by pretraining a network on a large synthetic dataset and then fine-tuning it on a small dataset of drawings. We also show that the approach yields a pose estimator competitive with many previous works when applied to a photograph-based dataset, establishing our synthetic data's usefulness beyond the intended domain.
Multi-dimensional Topic Modeling with Determinantal Point Processes

Probabilistic topics models such as Latent Dirichlet Allocation (LDA) provide a useful and elegant tool for discovering hidden structure within large data sets of discrete data, such as corpuses of text. However, LDA implicitly discovers topics along only a single dimension. Recent research on multi-dimensional topic modeling aims to devise techniques that can discover multiple groups of topics, where each group models some different dimension, or aspect, of the data. For example, applying a multi-dimensional topic modeling algorithm to a text corpus could result in three dimensions that turn out to represent “subject,” “sentiment,” and “political ideology.” In this work, we present a new multi-dimensional topic model that uses a determinantal point process prior to encourage different groups of topics to model different dimensions of the data. Determinantal point processes are probabilistic models of repulsive phenomena which originated in statistical physics but have recently seen interest from the machine learning community. Though topic models are usually applied to text, we motivate our method with the problem of discovering “tastes” (topics) in a data set of recipes that have been rated by users of a cooking web site. We present both an unsupervised algorithm, which discovers dimensions and their tastes automatically, and a semisupervised algorithm, which allows the modeler to steer the tastes (topics) towards ones that will be semantically meaningful, by “seeding” each taste with a small number of representative recipes (words). Our results on the recipe data set are mixed, but we are hopeful that the general technique presented here might very well prove useful to multi-dimensional topic modeling in other domains.
Incorporating partitioning and parallel plans into the SCOPE optimizer

Massive data analysis on large clusters presents new opportunities and challenges for query optimization. Data partitioning is crucial to performance in this environment. However, data repartitioning is a very expensive operation so minimizing the number of such operations can yield very significant performance improvements. A query optimizer for this environment must therefore be able to reason about data partitioning including its interaction with sorting and grouping. SCOPE is a SQL-like scripting language used at Microsoft for massive data analysis. A transformation-based optimizer is responsible for converting scripts into efficient execution plans for the Cosmos distributed computing platform. In this paper, we describe how reasoning about data partitioning is incorporated into the SCOPE optimizer. We show how relational operators affect partitioning, sorting and grouping properties and describe how the optimizer reasons about and exploits such properties to avoid unnecessary operations. In most optimizers, consideration of parallel plans is an afterthought done in a postprocessing step. Reasoning about partitioning enables the SCOPE optimizer to fully integrate consideration of parallel, serial and mixed plans into the cost-based optimization. The benefits are illustrated by showing the variety of plans enabled by our approach.
Trends in extreme learning machines: A review

Extreme learning machine (ELM) has gained increasing interest from various research fields recently. In this review, we aim to report the current state of the theoretical research and practical advances on this subject. We first give an overview of ELM from the theoretical perspective, including the interpolation theory, universal approximation capability, and generalization ability. Then we focus on the various improvements made to ELM which further improve its stability, sparsity and accuracy under general or specific conditions. Apart from classification and regression, ELM has recently been extended for clustering, feature selection, representational learning and many other learning tasks. These newly emerging algorithms greatly expand the applications of ELM. From implementation aspect, hardware implementation and parallel computation techniques have substantially sped up the training of ELM, making it feasible for big data processing and real-time reasoning. Due to its remarkable efficiency, simplicity, and impressive generalization performance, ELM have been applied in a variety of domains, such as biomedical engineering, computer vision, system identification, and control and robotics. In this review, we try to provide a comprehensive view of these advances in ELM together with its future perspectives.
ElliFit: An unconstrained, non-iterative, least squares based geometric Ellipse Fitting method

A novel ellipse fitting method which is selective for digital and noisy elliptic curves is proposed in this paper. The method aims at fitting an ellipse only when the data points are highly likely belong to an ellipse. This is achieved using the geometric distances of the ellipse from the data points. The proposed method models the non-linear problem of ellipse fitting as a combination of two operators, with one being linear, numerically stable, and easily invertible, while the other being non-linear but unique and easily invertible operator. As a consequence, the proposed ellipse fitting method has several salient properties like unconstrained, stable, non-iterative, and computationally inexpensive. The efficacy of the method is compared against six contemporary and recent algorithms based on the least squares formulation using five experiments of diverse practical challenges, like digitization, incomplete ellipses, and Gaussian noise (up to 30%). Three of the experiments comprise of a total of 44,400 ellipses (positive test data) while the other two are tested on 320,000 non-elliptic conics (negative test data). The results show that the proposed method is quite selective to elliptic shapes only and provides accurate fitting results, indicating potential application in medical, robotics, object detection, and other image processing industrial applications. & 2012 Elsevier Ltd. All rights reserved.
A convex relaxation approach for computing minimal partitions

In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts model) in terms of a primal dual Total Variation functional. We show that the Potts prior can be incorporated by means of convex constraints on the dual variables. For minimization we propose an efficient primal dual projected gradient algorithm which also allows a fast implementation on parallel hardware. Although our approach does not guarantee to find global minimizers of the Potts model we can give a tight bound on the energy between the computed solution and the true minimizer. Furthermore we show that our relaxation approach dominates recently proposed relaxations. As a consequence, our approach allows to compute solutions closer to the true minimizer. For many practical problems we even find the global minimizer. We demonstrate the excellent performance of our approach on several multi-label image segmentation and stereo problems.