Evaluating Groundedness in Dialogue Systems The BEGIN Benchmark

The Benchmark for Evaluation of Grounded INteraction (BEGIN) consists of 8113 dialogue turns generated by language-model-based dialogue systems . These annotations are based on an extension of the naturallanguage inference paradigm . We use the benchmark to demonstrate theeffectiveness of adversarially generated data for improving an evaluationmetric based on existing natural language inference datasets .…

An analysis of full size Russian complexly NER labelled corpus of Internet user reviews on the drugs based on deep learning and language neural nets

We present the full-size Russian complexly NER-labeled corpus of Internet user reviews . The evaluation of accuracy levels reached on thiscorpus by a set of advanced deep learning neural networks to extract thepharmacologically meaningful entities from Russian texts . The state of the art for the pharmacological entity extraction problem for Russian is established on afull-size labeled corpus .…

Traceability Technology Adoption in Supply Chain Networks

Modern traceability technologies promise to improve supply chain management by simplifying recalls, increasing demand visibility, or ascertainings sustainable supplier practices . We introduce a model of the dynamics of traceability technology adoption insupply chain networks to tackle the problem of selecting the smallest set of early adopters guaranteeing broad dissemination .…

Improving the Accessibility of Scientific Documents Current State User Needs and a System Solution to Enhance Scientific PDF Accessibility for Blind and Low Vision Users

The majority of scientific papers are distributed in PDF, which pose challenges for accessibility, especially for blind and low vision (BLV) readers . We introduce the SciA11y system to offset some of the issues around inaccessibility . We successfully produce HTMLrenders for over 12M papers, of which an open access subset of 1.5M are available for browsing at http://scia11y.org/…

Anytime Decoding by Monte Carlo Tree Search

An anytime decoding algorithm for tree codes using Monte-Carlo tree search is proposed . The algorithm can approximate the maximum-likelihood sequencedecoding of tree codes . The proposed method may also be extended to the decoding ofconvolutional codes and block codes .…

On the Computation of PSNR for a Set of Images or Video

When comparing learned image/video restoration and compression methods, it iscommon to report peak-signal to noise ratio (PSNR) results . However, there doesnot exist a generally agreed upon practice to compute PSNR for sets of imagesor video . Some authors report average of individual image/frame PSNR, which is equivalent to computing PSNR from geometric mean of individualimage/frame mean-square error (MSE) Others compute a single PSNR of Y-channel only, while others compute MSE/PSNR for RGB channels .…

Open Source Memory Compiler for Automatic RRAM Generation and Verification

This is the first open-source memory compilers that has been developed specifically to automate ResistiveRandom Access Memory (RRAM) generation . RRAM holds the promise of achieving high speed, high density and non-volatility . A novel RRAM architecture,additionally is proposed, and a number of generated RRAM arrays are evaluated to identify their worst case control line parasitics and worst case settlingtime across the memristors of their cells .…

Self Dimensioning and Planning of Small Cell Capacity in Multitenant 5G Networks

An important concept in the fifth generation of mobile networks ismultitenancy, which allows diverse operators sharing the same wireless infrastructure . This paper proposes a new framework for automated cell planning in multitenant small cell networks . The simulation results show the effectiveness of various methods to derive the planning specifications depending on the correlation between the tenant’s and network’s traffic demands .…

Simplicial contagion in temporal higher order networks

Complex networks represent the natural backbone to study epidemic processes in populations of interacting individuals . Such a modeling framework is naturally limited to pairwise interactions, making it less suitable toproperly describe social contagion . Here we extend simplicial contagion to time-varying networks,where pairwise and higher-order simplices can be created or destroyed overtime .…

Quantum Foundations of Classical Reversible Computing

The reversible computation paradigm aims to provide a new foundation for forgeneral classical digital computing that is capable of circumventing thethermodynamic limits to the energy efficiency of the conventional,non-reversible paradigm . We use the framework ofGorini-Kossakowski-Sudarshan-Lindblad dynamics (a.k.a. Lindbladians) with multiple asymptotic states, incorporating recent results from resource theory, full counting statistics, and stochastic thermodynamics .…

Black box adversarial attacks using Evolution Strategies

In the last decade, deep neural networks have proven to be very powerful incomputer vision tasks . However, they are not robust toperturbations of the input data . Several methods able to generateadversarial samples make use of gradients, which usually are not available to an attacker in real-world scenarios .…

Cybersecurity in Power Grids Challenges and Opportunities

Increasing volatilities within power transmission and distribution force power grid operators to amplify their use of communication infrastructure to monitor and control their grid . The resulting increase in communication creates a larger attack surface for malicious actors . Cyber attacks on powergrids have already succeeded in causing temporary, large-scale blackouts in therecent past .…

Memory Optimality for Non Blocking Containers

A bounded container maintains a collection of elements that can be inserted and extracted as long as the number of stored elements does not exceed the capacity . We consider the concurrent implementations of a bounded container more or less memory-friendly depending on how much memory they use in addition to storing the elements .…

LightIoT Lightweight and Secure Communication for Energy Efficient IoT in Health Informatics

Internet of Things (IoT) is considered as a key enabler of healthinformatics . IoT-enabled devices are used for in-hospital and in-home patientmonitoring to collect and transfer biomedical data pertaining to bloodpressure, electrocardiography (ECG), blood sugar levels, body temperature, etc. These devices generate data in real-time and transmitthem to nearby gateways and remote servers for processing and visualization .…

A numerical exploration of signal detector arrangement in a spin wave reservoir computing device

This paper studies numerically how the signal detector arrangement influencesthe performance of reservoir computing using spin waves excited in aferrimagnetic garnet film . This investigation is essentially important sincethe input information is not only conveyed but also transformed by the spinwaves into high-dimensional information space when the waves propagate in the film in a spatially distributed manner .…

Complementation in t perfect graphs

There are only five pairs of graphs such that both the graphs and their complements are minimally t-imperfect . A full characterization of t-perfection with respect to substitution has been obtained by Benchetrit in his Ph.D. thesis . In particular, there are only 5 pairs such that the graph and its complements and the graph is minimally perfect, such as in the case of a pair of pairs of perfect graphs with the same degree of complementation .…

GTN ED Event Detection Using Graph Transformer Networks

Recent works show that the graph structure of sentences, generated fromdependency parsers, has potential for improving event detection . However, they often only leverage the edges (dependencies) between words, and discard the labels (e.g., nominal-subject) labels . In this work, we propose a novel framework for incorporatingboth dependencies and their labels using a recently proposed technique calledGraph Transformer Networks (GTN) We integrate GTNs to leverage dependencyrelations on two existing homogeneous-graph-based models .…

A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with 2 times 2 submatrices

In this paper, we consider the problem of computing the degree of the determinant of a block-structured symbolic matrix . This problem can be viewed as an algebraic generalization of themaximum weight perfect bipartite matching problem . The main result of this paper is a combinatorial $O(n^4)$-time algorithm for the deg-det computation of a $2 \times 2$-type generic partitioned polynomialmatrix of size $2n .…

Cross Modal Music Video Recommendation A Study of Design Choices

In this work, webuild upon a recent video-music retrieval system (the VM-NET), which originallyrelies on an audio representation obtained by a set of statistics computed overhandcrafted features . We demonstrate that using audio representationlearning such as the audio embeddings provided by the pre-trained MuSimNet,OpenL3, MusicCNN or by AudioSet, largely improves recommendations .…

Speeding up Python based Lagrangian Fluid Flow Particle Simulations via Dynamic Collection Data Structures

Array-like collection data structures are widely established in Python’s scientific computing-ecosystem for high-performance computations . High performance is,however, only guaranteed for static computations with a fixed computational domain . We show that for dynamic computations within an actively changing domain, the array-like collections provided by NumPy and itsderivatives are a bottleneck for large computations.…

Methodology for Biasing Random Simulation for Rapid Coverage of Corner Cases in AMS Designs

Exploring the limits of an Analog and Mixed Signal (AMS) circuit by drivingappropriate inputs has been a serious challenge to the industry . In order to meet time-to-marketrequirements, often suboptimal coverage results of an integrated circuit (IC)are leveraged . No standards have been defined which can be used to identify a target in the continuous state space of analog domain such that the searching algorithm can be guided with some heuristics .…

Performance evaluation results of evolutionary clustering algorithm star for clustering heterogeneous datasets

This article presents the data used to evaluate the performance ofevolutionary clustering algorithm star (ECA*) compared to five traditional and modern clustering algorithms . Two experimental methods are employed to examinethe performance of ECA* against genetic algorithm for clustering++(GENCLUST++), learning vector quantisation (LVQ) , expectation maximisation(EM) and K-means (KM) The results of the experiments performeddemonstrate some limitations in the ECA*: (i) ECA*.…

Paraphrastic Representations at Scale

We present a system that allows users to train their own state-of-the-art paraphrastic sentence representations in a variety of languages . We alsorelease trained models for English, Arabic, German, French, Spanish, Russian,Turkish, and Chinese . We train these models on large amounts of data, achievingsignificantly improved performance from the original papers proposing themethods on a suite of monolingual semantic similarity, cross-lingual semanticsimilarity, and bitext mining tasks .…