nils-herrmann/clean_scirepeval huggingface dataset:
Data curation + process curation=data integration + science

In bioinformatics, we are familiar with the idea of curated data as a prerequisite for data integration. We neglect, often to our cost, the curation and cataloguing of the processes that we use to integrate and analyse our data. Programmatic access to services, for data and processes, means that compositions of services can be made that represent the in silico experiments or processes that bioinformaticians perform. Data integration through workflows depends on being able to know what services exist and where to find those services. The large number of services and the operations they perform, their arbitrary naming and lack of documentation, however, mean that they can be difficult to use. The workflows themselves are composite processes that could be pooled and reused but only if they too can be found and understood. Thus appropriate curation, including semantic mark-up, would enable processes to be found, maintained and consequently used more easily. This broader view on semantic annotation is vital for full data integration that is necessary for the modern scientific analyses in biology. This article will brief the community on the current state of the art and the current challenges for process curation, both within and without the Life Sciences.
Going Wild: Large-Scale Classification of Open DNS Resolvers

Since several years, millions of recursive DNS resolvers are-deliberately or not-open to the public. This, however, is counter-intuitive, since the operation of such openly accessible DNS resolvers is necessary in rare cases only. Furthermore, open resolvers enable both amplification DDoS and cache snooping attacks, and can be abused by attackers in multiple other ways. We thus find open recursive DNS resolvers to remain one critical phenomenon on the Internet.
 In this paper, we illuminate this phenomenon by analyzing it from two different angles. On the one hand, we study the landscape of DNS resolvers based on empirical data we collected for over a year. We analyze the changes over time and classify the resolvers according to device type and software version. On the other hand, we take the viewpoint of a client and measure the response authenticity of these resolvers. Besides legitimate redirections (e.g., to captive portals or router login pages), we find millions of resolvers to deliberately manipulate DNS resolutions (i.e., return bogus IP address information). To understand this threat in more detail, we systematically analyze non-legitimate DNS responses and reveal open DNS resolvers that manipulate DNS resolutions to censor communication channels, inject advertisements, serve malicious files, perform phishing, or redirect to other kinds of suspicious or malicious activities.
Handwriting Arabic character recognition LeNet using neural network

Character recognition has served as one of the principal proving grounds for neural network methods and has emerged as one of the most successful applications of this technology. In this paper, a new network is designed to recognize a set of handwritten arabic characters. This new network consists of two stages. The first is to recognize the main shape of the character, and the second stage is for dots recognition. Also, the characteristics, structure, and the training algorithm for the network are presented.
ColorBars: increasing data rate of LED-to-camera communication using color shift keying

LED-to-camera communication allows LEDs deployed for illumination purposes to modulate and transmit data which can be received by camera sensors available in mobile devices like smartphones, wearable smart-glasses etc. Such communication has a unique property that a user can visually identify a transmitter (i.e. LED) and specifically receive information from the transmitter. It can support a variety of novel applications such as augmented reality through mobile devices, navigation using smart signs, fine-grained location specific advertisement etc. However, the achievable data rate in current LED-to-camera communication techniques remains very low (≈ 12 bytes per second) to support any practical application. In this paper, we present ColorBars, an LED-to-camera communication system that utilizes Color Shift Keying (CSK) to modulate data using different colors transmitted by the LED. It exploits the increasing popularity of Tri-LEDs (RGB) that can emit a wide range of colors. We show that commodity cameras can efficiently and accurately demodulate the color symbols. ColorBars ensures flicker-free and reliable communication even in the presence of inter-frame loss and diversity of rolling shutter cameras. We implement ColorBars on embedded platform and evaluate it with Android and iOS smartphones as receivers. Our evaluation shows that ColorBars can achieve a data rate of 5.2 Kbps on Nexus 5 and 2.5 Kbps on iPhone 5S, which is significantly higher than previous approaches. It is also shown that lower CSK modulations (e.g. 4 and 8 CSK) provide extremely low symbol error rates (< 10--3), making them a desirable choice for reliable LED-to-camera communication.
Portfolio Selection Using Fuzzy Analytic Hierarchy Process ( FAHP )

Investors participate in stock markets for the exclusive purposes of earning highest return and sustaining and enhancing profitability. With this in mind, identifying effective determining factors regarding the selection of both the volume and type of invested securities (portfolio) is a matter of great importance. The selection of an optimal portfolio is dependent upon different factors, including extrinsic and intrinsic criteria that are associated with investors’ objectives. The present study first attempts to identify the most effective factors utilized in the selection of a portfolio; then, taking advantage of the Fuzzy Analytical Hierarchy Process (FAHP) as one of the multi-criteria decision-making (MCDM) models, the study proceeds to demonstrate the selection of an optimal stock portfolio. In this paper, in order to investigate the criteria that are most effective in the selection of stocks, a hierarchy of criteria is first presented. Using the Delphi methodology which recognizes the value of experts’ opinions, the best available advice from experts is selected and analyzed, and the weight of each identified criterion is measured applying the Analytic Hierarchy Process (AHP) method. The findings of this research suggest that the most significant criteria in the decisions made by investors regarding the selection of stocks are international risk, international economy, competitiveness (as extrinsic factors), and profit, management quality, information transparency, efficiency (as the criterion associated with investors’ objectives and as intrinsic factors). Finally we made a selection (portfolio) consisting of 7 top companies with the highest total return between 200720011. Then, regarding the result of previous method which were based on both quantitative and qualitative criteria, we ranked the stock of those companies using Fuzzy Analytic Hierarchy Process (FAHP).
Relation Networks for Object Detection

Although it is well believed for years that modeling relations between objects would help object recognition, there has not been evidence that the idea is working in the deep learning era. All state-of-the-art object detection systems still rely on recognizing object instances individually, without exploiting their relations during learning. This work proposes an object relation module. It processes a set of objects simultaneously through interaction between their appearance feature and geometry, thus allowing modeling of their relations. It is lightweight and in-place. It does not require additional supervision and is easy to embed in existing networks. It is shown effective on improving object recognition and duplicate removal steps in the modern object detection pipeline. It verifies the efficacy of modeling object relations in CNN based detection. It gives rise to the first fully end-to-end object detector.
Identification of influencers - Measuring influence in customer networks

Viral marketing refers to marketing techniques that use social networks to produce increases in brand awareness through self-replicating viral diffusion of messages, analogous to the spread of pathological and computer viruses. The idea has successfully been used by marketers to reach a large number of customers rapidly. If data about the customer network is available, centrality measures provide a structural measure that can be used in decision support systems to select influencers and spread viral marketing campaigns in a customer network. Usage stimulation and churn management are examples of DSS applications, where centrality of customers does play a role. The literature on network theory describes a large number of such centrality measures. A critical question is which of these measures is best to select an initial set of customers for a marketing campaign, in order to achieve a maximum dissemination of messages. In this paper, we present the results of computational experiments based on call data from a telecom company to compare different centrality measures for the diffusion of marketing messages. We found a significant lift when using central customers in message diffusion, but also found differences in the various centrality measures depending on the underlying network topology and diffusion process. The simple out-degree centrality performed well in all treatments.
Learning to Remember Rare Events

Despite recent advances, memory-augmented deep neural networks are still limited when it comes to life-long and one-shot learning, especially in remembering rare events. We present a large-scale life-long memory module for use in deep learning. The module exploits fast nearest-neighbor algorithms for efficiency and thus scales to large memory sizes. Except for the nearest-neighbor query, the module is fully differentiable and trained end-to-end with no extra supervision. It operates in a life-long manner, i.e., without the need to reset it during training. Our memory module can be easily added to any part of a supervised neural network. To show its versatility we add it to a number of networks, from simple convolutional ones tested on image classification to deep sequence-to-sequence and recurrent-convolutional models. In all cases, the enhanced network gains the ability to remember and do life-long one-shot learning. Our module remembers training examples shown many thousands of steps in the past and it can successfully generalize from them. We set new state-of-the-art for one-shot learning on the Omniglot dataset and demonstrate, for the first time, life-long one-shot learning in recurrent neural networks on a large-scale machine translation task.
Design and control of a GaN-based, 13-level, flying capacitor multilevel inverter

Multilevel topologies are an appealing method to achieve higher power density inverters for both mobile and stationary systems. This work discusses the design and development of a 13-level, flying capacitor multilevel (FCML) inverter.  A 120 kHz switching frequency is enabled through the use of GaN FETs and the development of custom integrated switching cells, which reduce commutation loop inductance and allow for a modular design. Additionally, the frequency multiplication effect of FCML inverters allows the output inductor of the inverter to be made exceptionally small (4.7 μH) while maintaining a 0.7 % THD due to the 1.44 MHz effective inductor ripple frequency.
On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract)

Abs t r ac t . This paper presents algorithms for the automatic synthesis of real-time controllers by finding a winning strategy for certain games defined by the timed-automata of Alur and Dill. In such games, the outcome depends on the players' actions as well as on their timing. We believe that these results will pave the way for the application of program synthesis techniques to the construction of real-time embedded systems from their specifications.
BCYCLIC: A parallel block tridiagonal matrix cyclic solver

A block tridiagonal matrix is factored with minimal fill-in using a cyclic reduction algorithm that is easily parallelized. Storage of the factored blocks allows the application of the inverse to multiple right-hand sides which may not be known at factorization time. Scalability with the number of block rows is achieved with cyclic reduction, while scalability with the block size is achieved using multithreaded routines (OpenMP, GotoBLAS) for block matrix manipulation. This dual scalability is a noteworthy feature of this new solver, as well as its ability to efficiently handle arbitrary (non-powers-of-2) block row and processor numbers. Comparison with a state-of-the art parallel sparse solver is presented. It is expected that this new solver will allow many physical applications to optimally use the parallel resources on current supercomputers. Example usage of the solver in magneto-hydrodynamic (MHD), three-dimensional equilibrium solvers for high-temperature fusion plasmas is cited.
Predicting conversion from MCI to AD with FDG-PET brain images at different prodromal stages

Early diagnosis of Alzheimer disease (AD), while still at the stage known as mild cognitive impairment (MCI), is important for the development of new treatments. However, brain degeneration in MCI evolves with time and differs from patient to patient, making early diagnosis a very challenging task. Despite these difficulties, many machine learning techniques have already been used for the diagnosis of MCI and for predicting MCI to AD conversion, but the MCI group used in previous works is usually very heterogeneous containing subjects at different stages. The goal of this paper is to investigate how the disease stage impacts on the ability of machine learning methodologies to predict conversion. After identifying the converters and estimating the time of conversion (TC) (using neuropsychological test scores), we devised 5 subgroups of MCI converters (MCI-C) based on their temporal distance to the conversion instant (0, 6, 12, 18 and 24 months before conversion). Next, we used the FDG-PET images of these subgroups and trained classifiers to distinguish between the MCI-C at different stages and stable non-converters (MCI-NC). Our results show that MCI to AD conversion can be predicted as early as 24 months prior to conversion and that the discriminative power of the machine learning methods decreases with the increasing temporal distance to the TC, as expected. These findings were consistent for all the tested classifiers. Our results also show that this decrease arises from a reduction in the information contained in the regions used for classification and by a decrease in the stability of the automatic selection procedure.
Self-Censorship on Facebook

We report results from an exploratory analysis examining “last-minute” self-censorship, or content that is filtered after being written, on Facebook. We collected data from 3.9 million users over 17 days and associate self-censorship behavior with features describing users, their social graph, and the interactions between them. Our results indicate that 71% of users exhibited some level of last-minute self-censorship in the time period, and provide specific evidence supporting the theory that a user’s “perceived audience” lies at the heart of the issue: posts are censored more frequently than comments, with status updates and posts directed at groups censored most frequently of all sharing use cases investigated. Furthermore, we find that: people with more boundaries to regulate censor more; males censor more posts than females and censor even more posts with mostly male friends than do females, but censor no more comments than females; people who exercise more control over their audience censor more content; and, users with more politically and age diverse friends censor less, in general.
Content Centric Networking in tactical and emergency MANETs

Reliable and secure content distribution in a disruptive environment is a critical challenge due to high mobile and lossy channels. Traditional IP networking and wireless protocols tend to perform poorly. In this paper, we propose Content Centric Networking (CCN) for emergency wireless ad hoc environments. CCN is a novel communication architecture capable to access and retrieve content by name. This new approach achieves scalability, security, and efficient network resource management in large scale disaster recovery and battlefield networks. Existing Internet CCN schemes cannot be directly applied to wireless mobile ad hoc networks due to different environments and specific limitations. Thus, we must extend the CCN architecture by introducing features and requirements especially designed for disruptive networks. We prove feasibility and performance gain of the new design via implementation and experimentation.
More Risk-Sensitive Markov Decision Processes

We investigate the problem of minimizing a certainty equivalent of the total or discounted cost over a finite and an infinite horizon which is generated by a Markov Decision Process (MDP). The certainty equivalent is defined by U−1(EU(Y )) where U is an increasing function. In contrast to a risk-neutral decision maker this optimization criterion takes the variability of the cost into account. It contains as a special case the classical risk-sensitive optimization criterion with an exponential utility. We show that this optimization problem can be solved by an ordinary MDP with extended state space and give conditions under which an optimal policy exists. In the case of an infinite time horizon we show that the minimal discounted cost can be obtained by value iteration and can be characterized as the unique solution of a fixed point equation using a ’sandwich’ argument. Interestingly, it turns out that in case of a power utility, the problem simplifies and is of similar complexity than the exponential utility case, however has not been treated in the literature so far. We also establish the validity (and convergence) of the policy improvement method. A simple numerical example, namely the classical repeated casino game is considered to illustrate the influence of the certainty equivalent and its parameters. Finally also the average cost problem is investigated. Surprisingly it turns out that under suitable recurrence conditions on the MDP for convex power utility U , the minimal average cost does not depend on U and is equal to the risk neutral average cost. This is in contrast to the classical risk sensitive criterion with exponential utility.
A Method for Real-Time Eye Blink Detection and Its Application

Various human behaviors can be indicated by eye blink patterns. In this paper, we present a method based on image processing techniques for detecting human eye blinks and generating inter-eye-blink intervals. We applied Haar Cascade Classifier and Camshift algorithms for face tracking and consequently getting facial axis infor mation. In addition, we applied an Adaptive Haar Cascade Classifier from a cascade of boosted classifiers ba ed on Haar-like features using the relationship between t he eyes and the facial axis for positioning the eyes. We pr oposed a new algorithm and a new measurement for eye blinkin g detection called “the eyelid’s state detecting (ESD ) value.” The ESD value can then be used for examining the op en and close states of eyelids. Our algorithm provides a 99.6% overall accuracy detection for eye blink dete ction. We generated inter-eye-blink interval graphs by differencing between two consecutive eye blink stat e . The graphs show that the common blinks of human present s short and long durations alternatively.
Investigating episodes of mobile phone activity as indicators of opportune moments to deliver notifications

We investigate whether opportune moments to deliver notifications surface at the endings of episodes of mobile interaction (making voice calls or receiving SMS) based on the assumption that the endings collocate with naturally occurring breakpoint in the user's primary task. Testing this with a naturalistic experiment we find that interruptions (notifications) are attended to and dealt with significantly more quickly after a user has finished an episode of mobile interaction compared to a random baseline condition, supporting the potential utility of this notification strategy. We also find that the workload and situational appropriateness of the secondary interruption task significantly affect subsequent delay and completion rate of the tasks. In situ self-reports and interviews reveal complexities in the subjective experience of the interruption, which suggest that a more nuanced classification of the particular call or SMS and its relationship to the primary task(s) would be desirable.
English to Sanskrit Translator and Synthesizer (ETSTS)

The development of Machine Translation system for ancient language such as Sanskrit language is much more fascinating and challenging task. In the proposed algorithm we integrate traditional dictionary rule based approach for translation which translate source English sentence into target Sanskrit sentence. It has two models Text to Text Translator module and Text to speech synthesizer module. Due to morphological richness of Sanskrit language, this system uses morphological markings to identify Subject, Object, Verb, Preposition, Adjective, Adverb sentences. This paper presents English to Sanskrit approach for translating well-structured English sentences into well-structured Sanskrit sentences.  Bilingual dictionary, Formant Synthesizer, Natural language processing, Machine translation, Parser, Rule based dictionary approach, Synthesizer, Translator.
Graph-based Approach to Automatic Taxonomy Generation (GraBTax)

We propose a novel graph-based approach for constructing concept hierarchy from a large text corpus. Our algorithm, GraBTax, incorporates both statistical co-occurrences and lexical similarity in optimizing the structure of the taxonomy. To automatically generate topic-dependent taxonomies from a large text corpus, GraBTax first extracts topical terms and their relationships from the corpus. The algorithm then constructs a weighted graph representing topics and their associations. A graph partitioning algorithm is then used to re-cursively partition the topic graph into a tax-onomy. For evaluation, we apply GraBTax to articles, primarily computer science, in the CiteSeerX digital library and search engine. The quality of the resulting concept hierarchy is assessed by both human judges and comparison with Wikipedia categories.
Semantic Match Consistency for Long-Term Visual Localization

Robust and accurate visual localization across large appearance variations due to changes in time of day, seasons, or changes of the environment is a challenging problem which is of importance to application areas such as navigation of autonomous robots. Traditional featurebased methods often struggle in these conditions due to the significant number of erroneous matches between the image and the 3D model. In this paper, we present a method for scoring the individual correspondences by exploiting semantic information about the query image and the scene. In this way, erroneous correspondences tend to get a low semantic consistency score, whereas correct correspondences tend to get a high score. By incorporating this information in a standard localization pipeline, we show that the localization performance can be significantly improved compared to the state-of-the-art, as evaluated on two challenging long-term localization benchmarks.