nils-herrmann/clean_scirepeval huggingface dataset:
A Secured System for Information Hiding in Image Steganography using Genetic Algorithm and Cryptography

Encryption is used to securely communicate data in open networks. Each type of data has its own structures; therefore according to the data the different techniques should be used to defend confidential data. Among them digital images are also very popular to carry confidential information in untrusted networks. . For pleasing the defense of data hiding and communication over network, the proposed system uses cryptographic algorithm along with Steganography. In the proposed system, the file which user want to make secure is firstly compressed to shrink in size and then the compressed data is altered into cipher text by using AES cryptographic algorithm and then the encrypted data is concealed in the image. In order to hide the information over the image in complex manner the genetic algorithm based technique is implemented which is used to evaluate the valuable pixels where the data can be hide in a secure manner. In addition of that, for hiding the information in images, the LSB (least significant bits) based steganographic method is used after the selection of eligible pixels. The implementation of the anticipated technique is performed using JAVA technology and for performance evaluation the time and space complexity is computed. In addition of that a
The standard operating procedure of the DOE-JGI Microbial Genome Annotation Pipeline (MGAP v.4)

The DOE-JGI Microbial Genome Annotation Pipeline performs structural and functional annotation of microbial genomes that are further included into the Integrated Microbial Genome comparative analysis system. MGAP is applied to assembled nucleotide sequence datasets that are provided via the IMG submission site. Dataset submission for annotation first requires project and associated metadata description in GOLD. The MGAP sequence data processing consists of feature prediction including identification of protein-coding genes, non-coding RNAs and regulatory RNA features, as well as CRISPR elements. Structural annotation is followed by assignment of protein product names and functions.
Deep Residual Learning for Compressed Sensing CT Reconstruction via Persistent Homology Analysis

Recently, compressed sensing (CS) computed tomography (CT) using sparse projection views has been extensively investigated to reduce the potential risk of radiation to patient. However, due to the insufficient number of projection views, an analytic reconstruction approach results in severe streaking artifacts and CS-based iterative approach is computationally very expensive. To address this issue, here we propose a novel deep residual learning approach for sparse-view CT reconstruction. Specifically, based on a novel persistent homology analysis showing that the manifold of streaking artifacts is topologically simpler than original one, a deep residual learning architecture that estimates the streaking artifacts is developed. Once a streaking artifact image is estimated, an artifact-free image can be obtained by subtracting the streaking artifacts from the input image. Using extensive experiments with real patient data set, we confirm that the proposed residual learning provides significantly better image reconstruction performance with several orders of magnitude faster computational speed.
A comparative evaluation of two algorithms for Windows Registry Anomaly Detection

We present a component anomaly detector for a host-based intrusion detection system (IDS) for Microsoft Windows. The core of the detector is a learning-based anomaly detection algorithm that detects attacks on a host machine by looking for anomalous accesses to the Windows Registry. We present and compare two anomaly detection algorithms for use in our IDS system and evaluate their performance. One algorithm called PAD, for Probabilistic Anomaly Detection, is based upon a probability density estimation while the second uses the Support Vector Machine framework. The key idea behind the detector is to first train a model of normal Registry behavior on a Windows host, even when noise may be present in the training data, and use this model to detect abnormal Registry accesses. At run-time the model is used to check each access to the Registry in real-time to determine whether or not the behavior is abnormal and possibly corresponds to an attack. The system is effective in detecting the actions of malicious software while maintaining a low rate of false alarms. We show that the probabilistic anomaly detection algorithm exhibits better performance in accuracy and in computational complexity over the support vector machine implementation under three different kernel functions.
Asynchronous Large-Scale Graph Processing Made Easy

Scaling large iterative graph processing applications through parallel computing is a very important problem. Several graph processing frameworks have been proposed that insulate developers from low-level details of parallel programming. Most of these frameworks are based on the bulk synchronous parallel (BSP) model in order to simplify application development. However, in the BSP model, vertices are processed in fixed rounds, which often leads to slow convergence. Asynchronous executions can significantly accelerate convergence by intelligently ordering vertex updates and incorporating the most recent updates. Unfortunately, asynchronous models do not provide the programming simplicity and scalability advantages of the BSP model. In this paper, we combine the easy programmability of the BSP model with the high performance of asynchronous execution. We have designed GRACE, a new graph programming platform that separates application logic from execution policies. GRACE provides a synchronous iterative graph programming model for users to easily implement, test, and debug their applications. It also contains a carefully designed and implemented parallel execution engine for both synchronous and user-specified built-in asynchronous execution policies. Our experiments show that asynchronous execution in GRACE can yield convergence rates comparable to fully asynchronous executions, while still achieving the near-linear scalability of a synchronous BSP system.
A vision for personalized service level agreements in the cloud

Public Clouds today provide a variety of services for data analysis such as Amazon Elastic MapReduce and Google BigQuery. Each service comes with a pricing model and service level agreement (SLA). Today's pricing models and SLAs are described at the level of compute resources (instance-hours or gigabytes processed). They are also different from one service to the next. Both conditions make it difficult for users to select a service, pick a configuration, and predict the actual analysis cost. To address this challenge, we propose a new abstraction, called a Personalized Service Level Agreement, where users are presented with what they can do with their data in terms of query capabilities, guaranteed query performance and fixed hourly prices.
A HOG-based Real-time and Multi-scale Pedestrian Detector Demonstration System on FPGA

Pedestrian detection will play a major role in future driver assistance and autonomous driving. One powerful algorithm in this field uses HOG features to describe the specific properties of pedestrians in images. To determine their locations, features are extracted and classified window-wise from different scales of an input image. The results of the classification are finally merged to remove overlapping detections. The real-time execution of this method requires specific FPGA- or ASIC-architectures. Recent work focused on accelerating the feature extraction and classification. Although merging is an important step in the algorithm, it is only rarely considered in hardware implementations. A reason for that could be its complexity and irregularity that is not trivial to implement in hardware. In this paper, we present a new bottom-up FPGA architecture that maps the full HOG-based algorithm for pedestrian detection including feature extraction, SVM classification, and multi-scale processing in combination with merging. For that purpose, we also propose a new hardware-optimized merging method. The resulting architecture is highly efficient. Additionally, we present an FPGA-based full real-time and multi-scale pedestrian detection demonstration system.
A General Two-Step Approach to Learning-Based Hashing

Most existing approaches to hashing apply a single form of hash function, and an optimization process which is typically deeply coupled to this specific form. This tight coupling restricts the flexibility of the method to respond to the data, and can result in complex optimization problems that are difficult to solve. Here we propose a flexible yet simple framework that is able to accommodate different types of loss functions and hash functions. This framework allows a number of existing approaches to hashing to be placed in context, and simplifies the development of new problem-specific hashing methods. Our framework decomposes the hashing learning problem into two steps: hash bit learning and hash function learning based on the learned bits. The first step can typically be formulated as binary quadratic problems, and the second step can be accomplished by training standard binary classifiers. Both problems have been extensively studied in the literature. Our extensive experiments demonstrate that the proposed framework is effective, flexible and outperforms the state-of-the-art.
Go-ICP: Solving 3D Registration Efficiently and Globally Optimally

Registration is a fundamental task in computer vision. The Iterative Closest Point (ICP) algorithm is one of the widely-used methods for solving the registration problem. Based on local iteration, ICP is however well-known to suffer from local minima. Its performance critically relies on the quality of initialization, and only local optimality is guaranteed. This paper provides the very first globally optimal solution to Euclidean registration of two 3D point sets or two 3D surfaces under the L2 error. Our method is built upon ICP, but combines it with a branch-and-bound (BnB) scheme which searches the 3D motion space SE(3) efficiently. By exploiting the special structure of the underlying geometry, we derive novel upper and lower bounds for the ICP error function. The integration of local ICP and global BnB enables the new method to run efficiently in practice, and its optimality is exactly guaranteed. We also discuss extensions, addressing the issue of outlier robustness.
SMC: A Practical Schema for Privacy-Preserved Data Sharing over Distributed Data Streams

Data collection is required to be safe and efficient considering both data privacy and system performance. In this paper, we study a new problem: distributed data sharing with privacy-preserving requirements. Given a data demander requesting data from multiple distributed data providers, the objective is to enable the data demander to access the distributed data without knowing the privacy of any individual provider. The problem is challenged by two questions: how to transmit the data safely and accurately; and how to efficiently handle data streams? As the first study, we propose a practical method, Shadow Coding, to preserve the privacy in data transmission and ensure the recovery in data collection, which achieves privacy preserving computation in a data-recoverable, efficient, and scalable way. We also provide practical techniques to make Shadow Coding efficient and safe in data streams. Extensive experimental study on a large-scale real-life dataset offers insight into the performance of our schema. The proposed schema is also implemented as a pilot system in a city to collect distributed mobile phone data.
Marine animal classification using UMSLI in HBOI optical test facility

Environmental monitoring is a critical aspect of marine renewable energy project success. A new system called Unobtrusive Multistatic Serial LiDAR Imager (UMSLI) has been prepared to capture and classify marine life interaction with electrical generation equipment. We present both hardware and software innovations of the UMSLI system. Underwater marine animal imagery has been captured for the first time using red laser diode serial LiDAR, which has advantages over conventional optical cameras in many areas. Moreover, given the scarcity of existing underwater LiDAR data, a shape matching based classification algorithm is proposed which requires few training data. On top of applying shape descriptors, the algorithm also adopts information theoretical learning based affine shape registration, improving point correspondences found by shape descriptors as well as the final similarity measure. Within Florida Atlantic University’s Harbor Branch Oceanographic Institute optical test facility, experimental LiDAR data are collected through the front end of the UMSLI prototype, on which the classification algorithm is validated.
Control strategy of an active crowbar for DFIG based wind turbine under grid voltage dips

This paper proposes a novel crowbar control technique and a stator voltage oriented direct power control (SVODPC strategy for the doubly fed induction generator (DFIG) used in wind power generation systems. The main difficulty for a DFIG to ride through a severe symmetrical grid voltage dip is the big transient currents induced in the rotor windings, which may damage the AC excitation converter. The proposed SVODPC is capable of suppressing the transient oscillations of the fault currents and electromagnetic torque. The crowbar protection is able to limit the peak values of the rotor currents under a preset threshold. Moreover, reactive current is injected in good time to assist the recovery of the grid voltage. Simulation results prove that with this control scheme the DFIG is able to ride through the severe grid voltage dips.
What storytelling can do for information visualization

A well-told story conveys great quantities of information in relatively few words in a format that is easily assimilated by the listener or viewer. People usually find it easier to understand information integrated into stories than information spelled out in serial lists (such as bulleted items in an overhead slide). Stories are also just more compelling. For example, despite its sketchiness, the story fragment in Figure 1 is loaded with information, following an analysis similar to that of John Thomas of IBM Research . We find that Jim uses technology (a pager and the Internet) and is dedicated to his job. Many other pieces of information can be deduced about Jim and his work, as well as about his relationships with his coworkers, as noted in the right side of the figure. The story does not express all this information explicitly; some is only implied; for example, we can surmise that Jim is probably not at the gym and his attendance at the meeting is important to his boss and coworkers, as well as to his company’s business performance. As in most stories, this one involves uncerFor as long as people have been around, they have used stories to convey information, cultural values, and experiences. Since the invention of writing and the printing press until today, technology and culture have constantly provided new and increasingly sophisticated means to tell stories. More recently, technology, entertainment, and art have converged in the computer. The ancient art of storytelling and its adaptation in film and video can now be used to efficiently convey information in our increasingly computerized world. What Storytelling Can Do for Information Visualization
Machine Learning approach for Predictive Maintenance in Industry 4.0

Condition monitoring together with predictive maintenance of electric motors and other equipment used by the industry avoids severe economic losses resulting from unexpected motor failures and greatly improves the system reliability. This paper describes a Machine Learning architecture for Predictive Maintenance, based on Random Forest approach. The system was tested on a real industry example, by developing the data collection and data system analysis, applying the Machine Learning approach and comparing it to the simulation tool analysis. Data has been collected by various sensors, machine PLCs and communication protocols and made available to Data Analysis Tool on the Azure Cloud architecture. Preliminary results show a proper behavior of the approach on predicting different machine states with high accuracy.
Omnidirectional planar dipole array antenna for WLAN access point

In this paper, a low-cost planar dipole array antenna with an omnidirectional radiation characteristic is presented. The proposed omnidirectional planar dipole array antenna comprises two 1/spl times/2 dipole arrays arranged back to back, and can be easily constructed by printing on both sides of a dielectric substrate. By selecting the central ground plane to have a small width (about 6 mm for operating at about 2.4 GHz), the proposed array antenna can have a good omnidirectional radiation pattern in the azimuthal plane (gain variations less than 2 dBi). Prototypes of the proposed antenna for WLAN operation in the 2.4 GHz band (2400-2484 MHz) were constructed and studied.
The Shaping of Information by Visual Metaphors

The nature of an information visualization can be considered to lie in the visual metaphors it uses to structure information. The process of understanding a visualization therefore involves an interaction between these external visual metaphors and the user's internal knowledge representations. To investigate this claim, we conducted an experiment to test the effects of visual metaphor and verbal metaphor on the understanding of tree visualizations. Participants answered simple data comprehension questions while viewing either a treemap or a node-link diagram. Questions were worded to reflect a verbal metaphor that was either compatible or incompatible with the visualization a participant was using. The results suggest that the visual metaphor indeed affects how a user derives information from a visualization. Additionally, we found that the degree to which a user is affected by the metaphor is strongly correlated with the user's ability to answer task questions correctly. These findings are a first step towards illuminating how visual metaphors shape user understanding, and have significant implications for the evaluation, application, and theory of visualization.
A performance spectrum for parallel computational frameworks that solve PDEs

Important computational physics problems are often large-scale in nature, and it is highly desirable to have robust and high performing computational frameworks that can quickly address these problems. However, it is no trivial task to determine whether a computational framework is performing efficiently or is scalable. The aim of this paper is to present various strategies for better understanding the performance of any parallel computational frameworks for solving PDEs. Important performance issues that negatively impact time-to-solution are discussed, and we propose a performance spectrum analysis that can enhance one’s understanding of critical aforementioned performance issues. As proof of concept, we examine commonly used finite element simulation packages and software and apply the performance spectrum to quickly analyze the performance and scalability across various hardware platforms, software implementations, and numerical discretizations. It is shown that the proposed performance spectrum is a versatile performance model that is not only extendable to more complex PDEs such as hydrostatic ice sheet flow equations, but also useful for understanding hardware performance in a massively parallel computing environment. Potential applications and future extensions of this work are also discussed.
A Development Platform for Integrating Wireless Devices and Sensors into Ambient Intelligence Systems

Architecture, HYDRA will enable the development of generic services based on open standards. I. DEVELOPING MIDDLEWARE TO ENABLE SOFTWARE DEVELOPERS TO CREATE SERVICES FOR EMBEDDED SYSTEMS Embedded Systems are everywhere, built into healthcare devices, into building automation, heating systems and home appliances, into mobile phones and communication, into cars, roads, bridges and tunnels, and even into our clothes. They are interconnected into networks of many devices and they form the building blocks of the future Internet of Things. Embedded Systems technologies are deployed in all relevant market sectors and have a major impact on the way these sectors work and collaborate, how they will develop, and how successful their products will be on the world market. Manufacturers are thus increasingly seeking to network their own products with other systems in order to provide higher value-added solutions for their customers – often a difficult, time consuming and costly development process, in particular for SME's. The HYDRA project aims to alleviate the problems facing European industries by researching and developing middleware for networked embedded systems that allows developers to develop cost-effective, high-performance Ambient Intelligence (AmI) applications using heterogeneous physical devices. Middleware is software that connects different components or applications to enable multiple processes running on one or more machines to interact across a network. The 52 months Hydra project is working on developing middleware that allows developers to create ambient intelligence applications, i.e. electronic environments that are sensitive and responsive to the presence of people. HYDRA will showcase its prototype for secure home automation. This will demonstrate how future ambient environments can be designed, realised and integrated. It will also allow users and developers to provide their input and feedback. II. HYDRA The HYDRA project  develops middleware for networked embedded systems that allows developers to create ambient intelligence applications utilizing device and sensor networks. Device and sensor networking research has seen increasing activity in the last years, with advances in sensor node and radio hardware  . This work has been instrumental in clarifying the trade-off between computation and communication and the need for in-network processing. Most of this work is based on topographically addressed sensor nodes; other researchers (Heideman et. al. ) have based their work on the use of attribute-based naming for structure and data diffusion. The use of attribute-based naming is an interesting concept that will be further investigated in HYDRA. Internet ad hoc routing (Broch et al. …