nils-herrmann/clean_scirepeval huggingface dataset:
3D reconstruction based on SIFT and Harris feature points

This paper presents a new 3D reconstruction method using feature points extracted by the SIFT and Harris corner detector. Since the SIFT feature points can be detected stably and relatively accurately, the proposed algorithm first uses the SIFT matching points to calculate the fundamental matrix. On the other hand many of the feature points detected by the SIFT are not what we need for reconstruction, so by combining the SIFT feature points with the Harris corners it is possible to obtain more vivid and detailed 3D information. Experiments have been conducted to validate the proposed method.
Automatic collision avoidance during parking and maneuvering — An optimal control approach

In order to reduce the great number of parking incidences and other collisions in low speed scenarios, an obstacle avoidance algorithm is proposed. Since collision avoidance can be achieved by sole braking when driving slowly this algorithm's objective is a comfort orientated braking routine. Therefore, an optimization problem is formulated leading to jerk and time optimal trajectories for braking. In addition to that, based on the prediction of the future vehicle motion, this algorithm compensates for a significant actuator time delay. Using an occupancy grid for representing the static vehicle environment and the current driving state, possible collision points are determined not only for the vehicle front or rear, but also for both vehicle sides, where no sensors are located. The algorithm's performance is demonstrated in a real-world scenario.
OF A NOVEL SUPER WIDE BAND CIRCULAR-HEXAGONAL FRACTAL ANTENNA

In this paper, a novel circular-hexagonal Fractal antenna is investigated for super wide band applications. The proposed antenna is made of iterations of a hexagonal slot inside a circular metallic patch with a transmission line. A partial ground plane and asymmetrical patch toward the substrate are used for designing the antenna to achieve a super wide bandwidth ranging from 2.18 GHz to 44.5GHz with a bandwidth ratio of 20.4 : 1. The impedance bandwidth and gain of the proposed antenna are much better than the recently reported super wideband antennas which make it appropriate for many wireless communications systems such as ISM, Wi-Fi, GPS, Bluetooth, WLAN and UWB. Details of the proposed antenna design are presented and discussed.
Data Preprocessing for Supervised Leaning

Many factors affect the success of Machine Learning (ML) on a given task. The representation and quality of the instance data is first and foremost. If there is much irrelevant and redundant information present or noisy and unreliable data, then knowledge discovery during the training phase is more difficult. It is well known that data preparation and filtering steps take considerable amount of processing time in ML problems. Data pre-processing includes data cleaning, normalization, transformation, feature extraction and selection, etc. The product of data pre-processing is the final training set. It would be nice if a single sequence of data pre-processing algorithms had the best performance for each data set but this is not happened. Thus, we present the most well know algorithms for each step of data pre-processing so that one achieves the best performance for their data set. Data mining, feature selection, data cleaning.
Texture Synthesis Using Convolutional Neural Networks

Here we introduce a new model of natural textures based on the feature spaces of convolutional neural networks optimised for object recognition. Samples from the model are of high perceptual quality demonstrating the generative power of neural networks trained in a purely discriminative fashion. Within the model, textures are represented by the correlations between feature maps in several layers of the network. We show that across layers the texture representations increasingly capture the statistical properties of natural images while making object information more and more explicit. The model provides a new tool to generate stimuli for neuroscience and might offer insights into the deep representations learned by convolutional neural networks.
On the Use of Machine Learning to Predict the Time and Resources Consumed by Applications

Most data centers, clouds and grids consist of multiple generations of computing systems, each with different performance profiles, posing a challenge to job schedulers in achieving the best usage of the infrastructure. A useful piece of information for scheduling jobs, typically not available, is the extent to which applications will use available resources once they are executed. This paper comparatively assesses the suitability of several machine learning techniques for predicting spatio temporal utilization of resources by applications. Modern machine learning techniques able to handle large number of attributes are used, taking into account application- and system-specific attributes (e.g., CPU micro architecture, size and speed of memory and storage, input data characteristics and input parameters). The work also extends an existing classification tree algorithm, called Predicting Query Runtime (PQR), to the regression problem by allowing the leaves of the tree to select the best regression method for each collection of data on leaves. The new method (PQR2) yields the best average percentage error, predicting execution time, memory and disk consumption for two bioinformatics applications, BLAST and RAxML, deployed on scenarios that differ in system and usage. In specific scenarios where usage is a non-linear function of system and application attributes, certain configurations of two other machine learning algorithms, Support Vector Machine and k-nearest neighbors, also yield competitive results. In addition, experiments show that the inclusion of system performance and application-specific attributes also improves the performance of machine learning algorithms investigated.
Deep learning of binary hash codes for fast image retrieval

Approximate nearest neighbor search is an efficient strategy for large-scale image retrieval. Encouraged by the recent advances in convolutional neural networks (CNNs), we propose an effective deep learning framework to generate binary hash codes for fast image retrieval. Our idea is that when the data labels are available, binary codes can be learned by employing a hidden layer for representing the latent concepts that dominate the class labels. The utilization of the CNN also allows for learning image representations. Unlike other supervised methods that require pair-wised inputs for binary code learning, our method learns hash codes and image representations in a point-wised manner, making it suitable for large-scale datasets. Experimental results show that our method outperforms several state-of-the-art hashing algorithms on the CIFAR-10 and MNIST datasets. We further demonstrate its scalability and efficacy on a large-scale dataset of 1 million clothing images.
Expression and export: recombinant protein production systems for Aspergillus

Several Aspergillus species, in particular Aspergillus niger and Aspergillus oryzae, are widely used as protein production hosts in various biotechnological applications. In order to improve the expression and secretion of recombinant proteins in these filamentous fungi, several novel genetic engineering strategies have been developed in recent years. This review describes state-of-the-art genetic manipulation technologies used for strain improvement, as well as recent advances in designing the most appropriate engineering strategy for a particular protein production process. Furthermore, current developments in identifying bottlenecks in the protein production and secretion pathways are described and novel approaches to overcome these limitations are introduced. An appropriate combination of expression vectors and optimized host strains will provide cell factories customized for each production process and expand the great potential of Aspergilli as biotechnology workhorses to more complex multi-step industrial applications.
Scene Text Detection via Connected Component Clustering and Nontext Filtering

In this paper, we present a new scene text detection algorithm based on two machine learning classifiers: one allows us to generate candidate word regions and the other filters out nontext ones. To be precise, we extract connected components (CCs) in images by using the maximally stable extremal region algorithm. These extracted CCs are partitioned into clusters so that we can generate candidate regions. Unlike conventional methods relying on heuristic rules in clustering, we train an AdaBoost classifier that determines the adjacency relationship and cluster CCs by using their pairwise relations. Then we normalize candidate word regions and determine whether each region contains text or not. Since the scale, skew, and color of each candidate can be estimated from CCs, we develop a text/nontext classifier for normalized images. This classifier is based on multilayer perceptrons and we can control recall and precision rates with a single free parameter. Finally, we extend our approach to exploit multichannel information. Experimental results on ICDAR 2005 and 2011 robust reading competition datasets show that our method yields the state-of-the-art performance both in speed and accuracy.
Transgender face recognition with off-the-shelf pre-trained CNNs: A comprehensive study

Face recognition has become a ubiquitous way of establishing identity in many applications. Gender transformation therapy induces changes to face on both for structural and textural features. A challenge for face recognition system is, therefore, to reliably identify the subjects after they undergo gender change while the enrolment images correspond to pre-change. In this work, we propose a new framework based on augmenting and fine-tuning deep Residual Network-50 (ResNet-50). We employ YouTube database with 37 subjects whose images are self-captured to evaluate the performance of state-of-the-schemes. Obtained results demonstrate the superiority of the proposed scheme over twelve different state-of-the-art schemes with an improved Rank — 1 recognition rate.
Sentence Simplification by Monolingual Machine Translation

In this paper we describe a method for simplifying sentences using Phrase Based Machine Translation, augmented with a re-ranking heuristic based on dissimilarity, and trained on a monolingual parallel corpus. We compare our system to a word-substitution baseline and two state-of-the-art systems, all trained and tested on paired sentences from the English part of Wikipedia and Simple Wikipedia. Human test subjects judge the output of the different systems. Analysing the judgements shows that by relatively careful phrase-based paraphrasing our model achieves similar simplification results to state-of-the-art systems, while generating better formed output. We also argue that text readability metrics such as the Flesch-Kincaid grade level should be used with caution when evaluating the output of simplification systems.
Momentum , Business Cycle and Time-Varying Expected Returns By

Momentum, Business Cycle and Time -Varying Expected Returns In recent years there has been a dramatic growth in academic interest in the predictability of asset returns based on past history. A growing number of researchers argue that time-series patterns in returns are due to investor irrationality, and thus can be translated into abnormal profits. Continuation of shortterm returns or momentum is one such pattern that has defied any rational explanation, and is at odds with market efficiency. This paper shows that profits to momentum strategies can be explained by a set of lagged macroeconomic variables and payoffs to momentum strategies disappear once stock returns are adjusted for their predictability based on these macroeconomic variables. Our results provide a possible role for time-varying expected returns as an explanation for momentum payoffs.
Boosting in the Limit: Maximizing the Margin of Learned Ensembles

The “minimum margin” of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it give s to any correct training label. Recent work has shown that the Adaboost algorithm is particularly effective at producing ensembles with large minimum margins, and theory suggests that this may account for its success at reducing generaliza tion error. We note, however, that the problem of finding good margins is closely related to linear programming, and we use this connection to derive and test new “LPboosting” algorithms that achieve better minimum margins than Adaboost. However, these algorithms do n talways yield better generalization performance. In fact, more often the opposite is tru e. We report on a series of controlled experiments which show that no simple version of the minimum-margin story can be complete. We conclude that the crucial question as to why boosting works so well in practice, and how to further improve upon it, remains mostly open. Some of our experiments are interesting for another reason: we show that Adaboost sometimes does overfit—eventually. This may take a very long time to occur, however, which is perhaps why this phenomenon has gone largely unnoticed.
Compact Ultrawideband MIMO Antenna With Half-Slot Structure

In this letter, a multiple-input–multiple-output (MIMO) antenna with very compact size of only <inline-formula> <tex-math notation="LaTeX">$\text{23}\times \text{18}\; \text{mm}^{2}$</tex-math></inline-formula> is proposed for ultrawideband (UWB) applications. The proposed MIMO antenna consists of two symmetrical half-slot antenna elements with coplanar waveguide-fed structures and a Y-shaped slot that is cut at the bottom center of the common ground plane. The slot efficiently prevents the current from directly flowing between two ports at low UWB frequency. For such a compact-size antenna, the ground plane works as a radiator as well as a reflector that reflects the radiation from radiators at high frequency. The measured impedance bandwidth for <inline-formula><tex-math notation="LaTeX"> $S_{11}, S_{22}$</tex-math></inline-formula> < −10 dB is from 3 to 12.4 GHz. The measured mutual coupling for <inline-formula><tex-math notation="LaTeX">$S_{12}, S_{21}$</tex-math></inline-formula> < −15 dB is from 3 to 4 GHz and for <inline-formula><tex-math notation="LaTeX">$S_{12}, S_{21}$ </tex-math></inline-formula> < −20 dB is from 4 to 12.4 GHz. The proposed antenna also contains relatively stable radiation patterns and gains. These performances indicate that the proposed antenna is one competitive candidate for UWB applications.
Code Bits: An Inexpensive Tangible Computational Thinking Toolkit For K-12 Curriculum

The extensive research in the domain of computational thinking has identified itself as one of the critical skills that needs to be a part of regular K-12 curriculum. However, most of the tangible computational thinking toolkits that are being developed are bulky and expensive to be deployed in classroom environments. In this paper we present Code Bits, a paper based tangible computational thinking toolkit that is inexpensive, portable and scalable. The students create programs using the tangible paper bits on any flat surface and use the Code Bits mobile application to process the code, which runs on any android device with a camera and uses augmented reality based games to improve the computational thinking skills of the students. The toolkit has been designed in way so as to promote collaboration amongst students.
Applications of soft union sets to hemirings via SU-h-ideals

The aim of this article is to lay a foundation for providing a soft algebraic tool in considering many problems that contain uncertainties. In order to provide these soft algebraic structures, we introduce the concepts of soft union hemirings (soft union h-ideals) of hemirings by soft intersection-union product and obtain some related results. Finally, we investigate some characterizations of h-hemiregular hemirings by soft union h-ideals.
Comparison of Measurement-Based Call Admission Control Algorithms for Controlled-Load Service

We compare the performance of four admission control algorithms—one parameter-based and three measurementbased—for controlled-load service. The parameter-based admission control ensures that the sum of reserved resources is bounded by capacity. The three measurementbased algorithms are based on measured bandwidth, acceptance region , and equivalent bandwidth [7]. We use simulationon several network scenarios to evaluate the link utilization and adherence to service commitment achieved by these four algorithms.
Autism spectrum disorders: developmental disconnection syndromes

Autism is a common and heterogeneous childhood neurodevelopmental disorder. Analogous to broad syndromes such as mental retardation, autism has many etiologies and should be considered not as a single disorder but, rather, as 'the autisms'. However, recent genetic findings, coupled with emerging anatomical and functional imaging studies, suggest a potential unifying model in which higher-order association areas of the brain that normally connect to the frontal lobe are partially disconnected during development. This concept of developmental disconnection can accommodate the specific neurobehavioral features that are observed in autism, their emergence during development, and the heterogeneity of autism etiology, behaviors and cognition.
Enabling preemptive multiprogramming on GPUs

GPUs are being increasingly adopted as compute accelerators in many domains, spanning environments from mobile systems to cloud computing. These systems are usually running multiple applications, from one or several users. However GPUs do not provide the support for resource sharing traditionally expected in these scenarios. Thus, such systems are unable to provide key multiprogrammed workload requirements, such as responsiveness, fairness or quality of service.
 In this paper, we propose a set of hardware extensions that allow GPUs to efficiently support multiprogrammed GPU workloads. We argue for preemptive multitasking and design two preemption mechanisms that can be used to implement GPU scheduling policies. We extend the architecture to allow concurrent execution of GPU kernels from different user processes and implement a scheduling policy that dynamically distributes the GPU cores among concurrently running kernels, according to their priorities. We extend the NVIDIA GK110 (Kepler) like GPU architecture with our proposals and evaluate them on a set of multiprogrammed workloads with up to eight concurrent processes. Our proposals improve execution time of high-priority processes by 15.6x, the average application turnaround time between 1.5x to 2x, and system fairness up to 3.4x
Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filtering

Building a successful recommender system depends on understanding both the dimensions of people’s preferences as well as their dynamics. In certain domains, such as fashion, modeling such preferences can be incredibly difficult, due to the need to simultaneously model the visual appearance of products as well as their evolution over time. The subtle semantics and non-linear dynamics of fashion evolution raise unique challenges especially considering the sparsity and large scale of the underlying datasets. In this paper we build novel models for the One-Class Collaborative Filtering setting, where our goal is to estimate users’ fashion-aware personalized ranking functions based on their past feedback. To uncover the complex and evolving visual factors that people consider when evaluating products, our method combines high-level visual features extracted from a deep convolutional neural network, users’ past feedback, as well as evolving trends within the community. Experimentally we evaluate our method on two large real-world datasets from Amazon.com, where we show it to outperform stateof-the-art personalized ranking measures, and also use it to visualize the high-level fashion trends across the 11-year span of our dataset.
ROOT: replaying multithreaded traces with resource-oriented ordering

We describe ROOT, a new method for incorporating the nondeterministic I/O behavior of multithreaded applications into trace replay. ROOT is the application of Resource-Oriented Ordering to Trace replay: actions involving a common resource are replayed in an order similar to that of the original trace. ROOT is based on the idea that how a program manages resources, as seen in a trace, provides hints about an application's internal dependencies. Inferring these dependencies allows us to partially constrain trace replay in a way that reflects the constraints of the original program. We make three contributions: (1) we describe the ROOT approach, (2) we release ARTC, a new ROOT-based tool for replaying I/O traces, and (3) we create Magritte, a file-system benchmark suite generated by applying ARTC to 34 Apple desktop application traces. When collecting traces on one platform and replaying on another, ARTC achieves an average timing inaccuracy of 10.6% on our benchmark workloads, halving the 21.3% achieved by the next-best replay method we evaluate.
A Language Modeling Approach to Predicting Reading Difficulty

We demonstrate a new research approach to the problem of predicting the reading difficulty of a text passage, by recasting readability in terms of statistical language modeling. We derive a measure based on an extension of multinomial naïve Bayes classification that combines multiple language models to estimate the most likely grade level for a given passage. The resulting classifier is not specific to any particular subject and can be trained with relatively little labeled data. We perform predictions for individual Web pages in English and compare our performance to widely-used semantic variables from traditional readability measures. We show that with minimal changes, the classifier may be retrained for use with French Web documents. For both English and French, the classifier maintains consistently good correlation with labeled grade level (0.63 to 0.79) across all test sets. Some traditional semantic variables such as type-token ratio gave the best performance on commercial calibrated test passages, while our language modeling approach gave better accuracy for Web documents and very short passages (less than 10 words).
Beyond binary choices: Integrating individual and social creativity

The power of the unaided individual mind is highly overrated. Although society often thinks of creative individuals as working in isolation, intelligence and creativity result in large part from interaction and collaboration with other individuals. Much human creativity is social, arising from activities that take place in a context in which interaction with other people and the artifacts that embody collective knowledge are essential contributors.  how individual and social creativity can be integrated by means of proper collaboration models and tools supporting distributed cognition; (2) how the creation of shareable externalizations (“boundary objects”) and the adoption of evolutionary process models in the construction of meta-design environments can enhance creativity and support spontaneous design activities (“unselfconscious cultures of design”); and (3) how a new design competence is emerging—one that requires passage from individual creative actions to synergetic activities, from the reflective practitioner to reflective communities, and from given tasks to personally meaningful activities. The paper offers examples in the context of collaborative design and art practice, including urban planning, interactive art, and open source. In the effort to draw a viable path “beyond binary choices”, the paper points out some major challenges for the next generation of socio-technical environments to further increase the integration of individual and social creativity.