nils-herrmann/clean_scirepeval huggingface dataset:
Cloud-based bioinformatics workflow platform for large-scale next-generation sequencing analyses

Due to the upcoming data deluge of genome data, the need for storing and processing large-scale genome data, easy access to biomedical analyses tools, efficient data sharing and retrieval has presented significant challenges. The variability in data volume results in variable computing and storage requirements, therefore biomedical researchers are pursuing more reliable, dynamic and convenient methods for conducting sequencing analyses. This paper proposes a Cloud-based bioinformatics workflow platform for large-scale next-generation sequencing analyses, which enables reliable and highly scalable execution of sequencing analyses workflows in a fully automated manner. Our platform extends the existing Galaxy workflow system by adding data management capabilities for transferring large quantities of data efficiently and reliably (via Globus Transfer), domain-specific analyses tools preconfigured for immediate use by researchers (via user-specific tools integration), automatic deployment on Cloud for on-demand resource allocation and pay-as-you-go pricing (via Globus Provision), a Cloud provisioning tool for auto-scaling (via HTCondor scheduler), and the support for validating the correctness of workflows (via semantic verification tools). Two bioinformatics workflow use cases as well as performance evaluation are presented to validate the feasibility of the proposed approach.
Incorporating Syntactic Uncertainty in Neural Machine Translation with a Forest-to-Sequence Model

Incorporating syntactic information in Neural Machine Translation (NMT) can lead to better reorderings, particularly useful when the language pairs are syntactically highly divergent or when the training bitext is not large. Previous work on using syntactic information, provided by top-1 parse trees generated by (inevitably error-prone) parsers, has been promising. In this paper, we propose a forest-to-sequence NMT model to make use of exponentially many parse trees of the source sentence to compensate for the parser errors. Our method represents the collection of parse trees as a packed forest, and learns a neural transducer to translate from the input forest to the target sentence. Experiments on English to German, Chinese and Farsi translation tasks show the superiority of our approach over the sequence-to-sequence and tree-to-sequence neural translation models.
Vehicle control system for automatic valet parking with infrastructure sensors

This paper presents vehicle control system for automatic valet parking with infrastructure sensors. First, we describe the automatic valet parking service system. In the service, vehicle moves autonomously based on sensing data generated by infrastructure sensors. Second, we implement vehicle control system for automatic valet parking. We design hardware and software components focusing on minimizing the add-on devices and maximizing data integration. Finally, we do a feasibility test for verification of the system.
High-quality passive facial performance capture using anchor frames

We present a new technique for passive and markerless facial performance capture based on anchor frames. Our method starts with high resolution per-frame geometry acquisition using state-of-the-art stereo reconstruction, and proceeds to establish a single triangle mesh that is propagated through the entire performance. Leveraging the fact that facial performances often contain repetitive subsequences, we identify anchor frames as those which contain similar facial expressions to a manually chosen reference expression. Anchor frames are automatically computed over one or even multiple performances. We introduce a robust image-space tracking method that computes pixel matches directly from the reference frame to all anchor frames, and thereby to the remaining frames in the sequence via sequential matching. This allows us to propagate one reconstructed frame to an entire sequence in parallel, in contrast to previous sequential methods. Our anchored reconstruction approach also limits tracker drift and robustly handles occlusions and motion blur. The parallel tracking and mesh propagation offer low computation times. Our technique will even automatically match anchor frames across different sequences captured on different occasions, propagating a single mesh to all performances.
Effective Representing of Information Network by Variational Autoencoder

Network representation is the basis of many applications and of extensive interest in various fields, such as information retrieval, social network analysis, and recommendation systems. Most previous methods for network representation only consider the incomplete aspects of a problem, including link structure, node information, and partial integration. The present study proposes a deep network representation model that seamlessly integrates the text information and structure of a network. Our model captures highly non-linear relationships between nodes and complex features of a network by exploiting the variational autoencoder (VAE), which is a deep unsupervised generation algorithm. We also merge the representation learned with a paragraph vector model and that learned with the VAE to obtain the network representation that preserves both structure and text information. We conduct comprehensive empirical experiments on benchmark datasets and find our model performs better than state-of-the-art techniques by a large margin.
Opinion-based entity ranking

The deployment of Web 2.0 technologies has led to rapid growth of various opinions and reviews on the web, such as reviews on products and opinions about people. Such content can be very useful to help people find interesting entities like products, businesses and people based on their individual preferences or tradeoffs. Most existing work on leveraging opinionated content has focused on integrating and summarizing opinions on entities to help users better digest all the opinions. In this paper, we propose a different way of leveraging opinionated content, by directly ranking entities based on a user’s preferences. Our idea is to represent each entity with the text of all the reviews of that entity. Given a user’s keyword query that expresses the desired features of an entity, we can then rank all the candidate entities based on how well opinions on these entities match the user’s preferences. We study several methods for solving this problem, including both standard text retrieval models and some extensions of these models. Experiment results on ranking entities based on opinions in two different domains (hotels and cars) show that the proposed extensions are effective and lead to improvement of ranking accuracy over the standard text retrieval models for this task.
77 GHz lens-based multistatic MIMO radar with colocated antennas for automotive applications

With the fast development of highly integrated 77 GHz SiGe-MMICs, cost effective and reliable radar systems are feasible to significantly increase driving safety in all vehicle classes. New features have to be implemented in these sensors to fulfill the ascending requirements for future systems. Important demands will be the detection and separation of multiple targets in a range cell and the exact measurement of angles in azimuth and elevation. In this paper we present a new lens based 77 GHz MIMO radar system with SiGe MMICs. The center of attention in our investigations is the comparison between conventional lens based radar configurations and lens based MIMO radar configurations.
Trust as a facilitator in cloud computing: a survey

Cloud computing offers massively scalable, elastic resources (e.g., data, computing power, and services) over the internet from remote data centres to the consumers. The growing market penetration, with an evermore diverse provider and service landscape, turns Cloud computing marketplaces a highly competitive one. In this highly competitive and distributed service environment, the assurances are insufficient for the consumers to identify the dependable and trustworthy Cloud providers. This paper provides a landscape and discusses incentives and hindrances to adopt Cloud computing from Cloud consumers’ perspective. Due to these hindrances, potential consumers are not sure whether they can trust the Cloud providers in offering dependable services. Trust-aided unified evaluation framework by leveraging trust and reputation systems can be used to assess trustworthiness (or dependability) of Cloud providers. Hence, cloud-related specific parameters (QoS + ) are required for the trust and reputation systems in Cloud environments. We identify the essential properties and corresponding research challenges to integrate the QoS + parameters into trust and reputation systems. Finally, we survey and analyse the existing trust and reputation systems in various application domains, characterizing their individual strengths and weaknesses. Our work contributes to understanding 1) why trust establishment is important in the Cloud computing landscape, 2) how trust can act as a facilitator in this context and 3) what are the exact requirements for trust and reputation models (or systems) to support the consumers in establishing trust on Cloud providers.
Deconstructing the Blockchain to Approach Physical Limits

The concept of a blockchain was invented by Satoshi Nakamoto to maintain a distributed ledger for an electronic payment system, Bitcoin. In addition to its security, important performance measures of a blockchain protocol are its transaction throughput, confirmation latency and confirmation reliability. Existing systems operate far away from these physical limits. In this work we introduce Prism , a new proof-of-work blockchain protocol, which can achieve 1) security against up to 50% adversarial hashing power; 2) optimal throughput up to the capacity C of the network; 3) confirmation latency for honest transactions proportional to the propagation delay D, with confirmation error probability exponentially small in the bandwidth-delay product CD; 4) eventual total ordering of all transactions. Our approach to the design of this protocol is based on deconstructing the blockchain into its basic functionalities and systematically scaling up these functionalities to approach their physical limits.
The principles and practice of probabilistic programming

Probabilities describe degrees of belief, and probabilistic inference describes rational reasoning under uncertainty. It is no wonder, then, that probabilistic models have exploded onto the scene of modern artificial intelligence, cognitive science, and applied statistics: these are all sciences of inference under uncertainty. But as probabilistic models have become more sophisticated, the tools to formally describe them and to perform probabilistic inference have wrestled with new complexity. Just as programming beyond the simplest algorithms requires tools for abstraction and composition, complex probabilistic modeling requires new progress in model representation—probabilistic programming languages. These languages provide compositional means for describing complex probability distributions; implementations of these languages provide generic inference engines: tools for performing efficient probabilistic inference over an arbitrary program. In their simplest form, probabilistic programming languages extend a well-specified deterministic programming language with primitive constructs for random choice. This is a relatively old idea, with foundational work by Giry, Kozen, Jones, Moggi, SahebDjahromi, Plotkin, and others [see e.g. 7]. Yet it has seen a resurgence thanks to new tools for probabilistic inference and new complexity of probabilistic modeling applications. There are a number of recent probabilistic programming languages [e.g. 8, 9, 11–17], embodying different tradeoffs in expressivity, efficiency, and perspicuity. We will focus on the probabilistic programming language Church [6] for simplicity, but the design of probabilistic languages to best support complex model representation and efficient inference is an active and important topic. Church extends (the purely functional subset of) Scheme with elementary random primitives, such as flip (a bernoulli), multinomial, and gaussian. In addition, Church includes language constructs that simplify modeling. For instance, mem, a higher-order procedure that memoizes its input function, is useful for describing persistent random properties and lazy model construction. (Interestingly, memoization has a semantic effect in probabilistic languages.) If we view the semantics of the underlying deterministic language as a map from programs to executions of the program, the semantics of the probabilistic language will be a map from programs to distributions over executions. When the program halts
Towards Multi-Stakeholder Utility Evaluation of Recommender Systems

A core value in recommender systems is personalization, the idea that the recommendations produced are those that match the user’s preferences. However, in many real-world recommendation contexts, the concerns of additional stakeholders may come into play, such as the producers of items or those of the system owner. Some researchers have examined special cases of such concerns, for example, in reciprocal recommendation. However, there has not been a comprehensive treatment of the integration of multiple stakeholders into recommendation calculations. The paper suggests a utility-based framework for representing stakeholder values in recommendation actions and calculating a multidimensional utility. We demonstrate how a standard algorithm performs in a simulation of a multi-stakeholder recommendation task requiring on-line optimization, and show that a simple greedy approach can lead to enhanced overall utility with minimal loss of accuracy for users.
Classification of Brain MR Images using Texture Feature Extraction

Alzheimer’s disease (AD), is a degenerative disease which leads to memory loss and problems with thinking and behaviour.AD is a type of dementia which accounts for an estimated 60% to 80% of cases. Accurate diagnosis depends on the identification of discriminative features of AD. Recently, different feature extraction methods are used for the classification of AD. In this paper, we proposed a classification framework to select features, which are extracted using Gray-Level Co-occurrence Matrix (GLCM) method to distinguish between the AD and the Normal Control (NC). In order to evaluate the proposed method, we have performed evaluations on the MRI acquiring from the OASIS database. The proposed method yields an average testing accuracy of 75.71% which indicates that the proposed method can differentiate AD and NC satisfactorily.
Distributed Top-k Keyword Search over Very Large Databases with MapReduce

In the last decade, keyword search over relational databases has been extensively studied because it promises to allow users lacking knowledge of structured query languages or unaware of the database schema to query the database in an intuitive way. The existing works about keyword search on databases proposed many approaches and have gain remarkable results. However, most of these approaches are designed for the centralized setting where keyword search is processed by only a single server. In reality, the scale of databases increases sharply and centralized methods hardly can handle keyword queries over these large databases. Moreover, processing keyword search over relational databases is a very time-consuming task, and the efficiency of the existing centralized approaches will degrade notably because the single server cannot provide enough computation power for the keyword search over very large databases. To address these challenges, we propose a distributed keyword search (DKS) approach with MapReduce and this approach can be well deployed on a cluster of servers to deal with keyword search over large databases in a parallel way.
RCD snubber circuit design for 5-level 4-switch DC-AC converter

This paper presents an optimized single phase DC-AC converter with RCD snubber circuit. The proposed converter has an optimized number of levels per number of switches (nL/nS) which is by far the best relationship among the converters proposed in literature. The most important characteristics of the proposed configuration are: (i) reduced number of semiconductor devices, while keeping a high number of levels at the output converter side, (ii) only one DC source without any need to balance capacitor voltages, and (in) reduced semiconductor losses and as a result higher efficiency. The principle of operation, RCD snubber design, modulation technique, and modeling of the proposed converter are presented in this paper. The proposed multilevel DC-AC converter topology is simulated and validated experimentally.
Embedded System for Motion Control of an Omnidirectional Mobile Robot

In this paper, an embedded system for motion control of omnidirectional mobile robots is presented. An omnidirectional mobile robot is a type of holonomic robots. It can move simultaneously and independently in translation and rotation. The RoboCup small-size league, a robotic soccer competition, is chosen as the research platform in this paper. The first part of this research is to design and implement an embedded system that can communicate with a remote server using a wireless link, and execute received commands. Second, a fuzzy-tuned proportional–integral (PI) path planner and a related low-level controller are proposed to attain optimal input for driving a linear discrete dynamic model of the omnidirectional mobile robot. To fit the planning requirements and avoid slippage, velocity, and acceleration filters are also employed. In particular, low-level optimal controllers, such as a linear quadratic regulator (LQR) for multiple-input-multiple-output acceleration and deceleration of velocity are investigated, where an LQR controller is running on the robot with feedback from motor encoders or sensors. Simultaneously, a fuzzy adaptive PI is used as a high-level controller for position monitoring, where an appropriate vision system is used as a source of position feedback. A key contribution presented in this research is an improvement in the combined fuzzy-PI LQR controller over a traditional PI controller. Moreover, the efficiency of the proposed approach and PI controller are also discussed. Simulation and experimental evaluations are conducted with and without external disturbance. An optimal result to decrease the variances between the target trajectory and the actual output is delivered by the onboard regulator controller in this paper. The modeling and experimental results confirm the claim that utilizing the new approach in trajectory-planning controllers results in more precise motion of four-wheeled omnidirectional mobile robots.
Extended Pasting Scheme for Kolam Pattern Generation

The theory of “Formal Languages” had been applied successfully to study the aspect of generating patterns of the kolam folk designs. In this paper a new picture generating method by the use of pasting of tiles is presented. The generating model “Pasting Scheme” and its variant “Extended Pasting Scheme” are shown to generate patterns including kolams of kambi and non-kambi types and tessellations as well.
Inpher: Inferring Physical Properties of Virtual Objects from Mid-Air Interaction

We present Inpher, a virtual reality system for setting physical properties of virtual objects using mid-air interaction. Users simply grasp virtual objects and mimic their desired physical movement. The physical properties required to fulfill that movement will then be inferred directly from that motion. We provide a 3D user interface that does not require users to have an abstract model of physical properties. Our approach leverages users' real world experiences with physics. We conducted a bodystorming to investigate users' mental model of physics. Based on our iterative design process, we implemented techniques for inferring mass, bounciness and friction. We conducted a case study with 15 participants with varying levels of physics education. The results indicate that users are capable of demonstrating the required interactions and achieve satisfying results.
Guidelines for critique of a research report.

Before findings reported in a research article are used to change clinical practice, the research must be evaluated for evidence of credibility, integrity, and potential for replication. This paper provides guidelines for use in evaluating deductive, empirical research. The standards presented in this paper are derived from the tenets of the scientific method, measurement theory, statistical principles, and research ethics. The guidelines may be used to evaluate each section of a research report, from the title to the interpretation of findings.
A Compact Dual Circularly Polarized Microstrip Patch Array With Interlaced Sequentially Rotated Feed

This communication presents a microstrip patch array, using sequentially rotated feed networks to achieve dual circular polarization in the same band. By interlacing the microstrip patches of adjacent 2 × 2 subarrays, the element spacing is minimized to avoid the challenging grating lobe issue. In this manner, the number of radiating elements is reduced from the conventional 4N to 2N + 2, where N is the number of 2 × 2 subarrays. The array is implemented on a two-layer substrate, with the upper layer hosting the microstrip patch array and the sequentially rotated networks, and the lower layer hosting the power dividers, sharing a common ground plane in the middle. To validate this novel configuration, a prototype is fabricated and measured. It achieves both |S11| <; -10 dB and axial ratio .3 dB bandwidth of 12.5% (4.95-5.61 GHz) for right-hand circular polarization and 14.7% (5.05-5.85 GHz) for left-hand circular polarization. The isolation between the orthogonal circularly polarized ports is about 12 dB in band.
Blockchain-Free Cryptocurrencies : A Framework for Truly Decentralised Fast Transactions

The “blockchain” distributed ledger pioneered by Bitcoin is effective at preventing double-spending, but inherently attracts (1) “user cartels” and (2) incompressible delays, as a result of linear verification and a winner-takes-all incentive lottery. We propose to forgo the “blocks” and “chain” entirely, and build a truly distributed ledger system based on a lean graph of cross-verifying transactions, which now become the main and only objects in the system. A fully distributed consensus mechanism, based on progressive proofs of work with predictable incentives, ensures rapid convergence even across a large network of unequal participants, who all get rewards working at their own pace. Graph-based affirmation fosters snappy response through automatic scaling, while application-agnostic design supports all modern cryptocurrency features such as multiple denominations, swaps, securitisation, scripting, smart contracts, etc. We prove theoretically, and experimentally verify, our proposal to show it achieves a crucial “convergence” property — meaning that any valid transaction entering the system will quickly become enshrined into the ancestry upon which all future transactions will rest.