## Digital Einstein Experience Fast Text to Speech for Conversational AI

We describe our approach to create and deliver a custom voice for aconversational AI use-case . Our proposed cloudarchitecture enables for fast voice delivery, making it possible to talk to the digital version of Albert Einstein in real-time . We use a custom dictionary for selected words to ensure their proper pronunciation .…

## Fine Grained Causality Extraction From Natural Language Requirements Using Recursive Neural Tensor Networks

Causal relations (e.g., If A, then B) are prevalent in functional requirements . For various applications of AI4RE, automatically extracting such causal statements are a basic necessity . We lack an approach that is able to extract causal relations from natural language requirements in fine-grainedform .…

## How to Tell Deep Neural Networks What We Know

We present a short survey of ways in which existing scientific knowledge are included when constructing models with neural networks . The inclusion of domain-knowledge is of special interest not just to constructing scientificassistants, but also, many other areas that involve understanding data using human-machine collaboration .…

## Strategic Mitigation of Agent Inattention in Drivers with Open Quantum Cognition Models

State-of-the-art driver-assist systems have failed to effectively mitigatedriver inattention and had minimal impacts on the ever-growing number of roadmishaps . This is because traditional human-machine interaction settings are modeled in classical and behavioralgame-theoretic domains . We propose a novel equilibrium notion in human-systeminteraction games, where the system maximizes its expected utility and humandecisions can be characterized using any general decision model .…

## How Do Pedophiles Tweet Investigating the Writing Styles and Online Personas of Child Cybersex Traffickers in the Philippines

Child sex peddlers spread illegal content and target minors for sexual activities on Twitter in the Philippines using Natural Language Processing techniques . Results of our study show frequently used and co-occurring words that traffickers use tospread content . Four main roles played by these entities that contribute to the proliferation of child pornography in the country .…

## Extension of additive valuations to general valuations on the existence of EFX

Envy-freeness is one of the most widely studied notions in fair division . Since envy-free allocations do not always exist when items are indivisible . We show that an EFXallocation always exists (i) when all agents have one of two general valuationsor (ii) when the number of items is at most $n+3$ .…

## CATE CAusality Tree Extractor from Natural Language Requirements

Causal relations (If A, then B) are prevalent in requirements artifacts . We lack an approach capable of extracting causal relations from natural language with reasonable performance . In this paper, wepresent our tool CATE (CAusality Tree Extractor), which is able to parse thecomposition of a causal relation as a tree structure .…

## On the Modulus in Matching Vector Codes

A $k$-query locally decodable code (LDC) allows one to encode any$n$-symbol message $x$ as a codeword $C(x) of$N$symbols . A modulus$m=p_1$may result in an MVC with$k\leq 2^r$and$N=\exp(O(O) (1-1/r)) The $m$is {\em good if it is possible to have $k<2^r$. The good numbers yield moreefficient MVCs. Prior to this work, there are only {\em finitely many goodnumbers. All of them were obtained via computer search and have the form$m= p_1p_2$. All of …

## Guided Generation of Cause and Effect

We present a conditional text generation framework that posits sententialexpressions of possible causes and effects . This framework depends on a very large-scale collection of English sentences expressing causal patterns CausalBank . We extend prior work in lexically-constrained decoding to support disjunctive positive constraints .…

## Multi Agent Belief Sharing through Autonomous Hierarchical Multi Level Clustering

Coordination in multi-agent systems is challenging for agile robots such as UAVs, where relative agent positions frequentlychange due to unconstrained movement . This work proposes autonomous hierarchical multi-level clustering (MLC), which forms aclustering hierarchy utilizing decentralized methods . Using observation aggregation, compression, and dissemination, agentsshare local observations throughout the hierarchy, giving every agent a totalsystem belief with spatially dependent resolution and freshness .…

## JEFL Joint Embedding of Formal Proof Libraries

In this paper, we compare apreviously proposed algorithm for matching concepts across libraries with ourunsupervised embedding approach that can help us retrieve similar concepts . Ourapproach is based on the fasttext implementation of Word2Vec, on top of which atree traversal module is added to adapt its algorithm to the representationformat of our data export pipeline .…

## On function homophily of microbial Protein Protein Interaction Networks

We present a new method for assessing homophily in networks whose verticeshave categorical attributes, namely when the vertices of networks comepartitioned into classes . We apply this method to Protein- Protein Interactionnetworks, where vertices correspond to proteins, partitioned according to theyfunctional role, and edges represent potential interactions between proteins .…

## Dynamic RF Combining for Multi Antenna Ambient Energy Harvesting

Ambient radio frequency (RF) energy harvesting (EH) technology is key to realizing self-sustainable, always-on, low-power, massive Internet of Thingsnetworks . We introduce a dynamic RF combining architecture for ambientRF EH use cases . Among the proposed mechanisms, brute force (BF) demands the highest power consumption, while CB requires the highest-resolution phase shifters .…

## Optimal Rates for Nonparametric Density Estimation under Communication Constraints

We consider density estimation for Besov spaces when each sample is quantized to only a limited number of bits . We provide a noninteractive adaptiveestimator that exploits the sparsity of wavelet bases . We show that our estimator is nearly rate-optimal by derivingminimax lower bounds that hold even when interactive protocols are allowed .…

## Improved Text Classification via Contrastive Adversarial Training

We propose a simple and general method to regularize the fine-tuning of Transformer-based encoders for text classification tasks . We generate adversarial examples by perturbing the word embedding of the model and perform contrastive learning on clean and adversary examples .…

## Answer Set Programs for Reasoning about Counterfactual Interventions and Responsibility Scores for Classification

We describe how answer-set programs can be used to declaratively specifycounterfactual interventions on entities under classification, and reason about them . In particular, they can define and compute responsibilityscores as attribution-based explanations for outcomes from classificationmodels . The approach allows for the inclusion of domain knowledge and supports query answering .…

## Accuracy analysis of Educational Data Mining using Feature Selection Algorithm

EducationalData Mining (EDM) helps to measure the accuracy of data using relevant attributes and machine learning algorithms performed . EDM removes irrelevant features without changing the original data . The data set used in this study was taken from Kaggle.com. The results were compared on the basis ofrecall, precision and f-measure to check accuracy of the student data.…

## Communication Lower Bounds for Nested Bilinear Algorithms

We develop lower bounds on communication in the memory hierarchy or betweenprocessors for nested bilinear algorithms . We build on a previous framework that establishescommunication lower bounds by use of the rank expansion of a matrix . We apply the rankexpansion lower bounds to obtain novel communication lower bounds for nestedToom-Cook convolution, Strassen’s algorithm, and fast algorithms for partiallysymmetric contractions .…

## Provenance Anonymisation and Data Environments a Unifying Construction

The Anonymisation Decision-making Framework (ADF) operationalizes the riskmanagement of data exchange between organizations . The second edition of ADF has increased its emphasis on modeling data flows . We show how data environments can be implemented within the W3CPROV in four different ways .…

## Distribution of Classification Margins Are All Data Equal

Recent theoretical results show that gradient descent on deep neural networks locally maximizes classification margin . This property of the solution however does not fully characterizethe generalization performance . We motivate theoretically and show empiricallythat the area under the curve of the margin distribution on the training set is a good measure of generalization .…

## Comparison of Czech Transformers on Text Classification Tasks

The need for such models emerged from our effort to employ Transformers in our language-specific tasks, but we found the performance of multilingual models to be very limited . Since themultilingual models are usually pre-trained from 100+ languages, most oflow-resourced languages (including Czech) are under-represented in these models .…

## Hilbert Schmidt regularity of symmetric integral operators on bounded domains with applications to SPDE approximations

Regularity estimates for an integral operator with a symmetric continuous kernel on a convex bounded domain are derived . The covariance of a mean-squarecontinuous random field on the domain is an example of such an operator . Theestimates are of the form of Hilbert–Schmidt norms of the integral operatorand its square root, composed with fractional powers of an elliptic operatorequipped with homogeneous boundary conditions of either Dirichlet or Neumanntype .…

## Formal method of synthesis of optimal topologies of computing systems based on projective description of graphs

A deterministic method for synthesizing the interconnect topologies optimized for the required properties is proposed . The method is based on the originaldescription of graphs by projections, on establishing the bijectivecorrespondence of the required . properties and the projection properties of the initial graph, on postulating the corresponding restrictions of modified .…

## THz Transmission meets Untrusted UAV Relaying Trajectory and Communication Co design for Secrecy Energy Efficiency Maximization

Unmanned aerial vehicles (UAVs) and Terahertz (THz) technology are envisioned to play paramount roles in next-generation wireless communications . We present a secure two-phase transmission strategy with cooperative jamming . We assume that the UAV-mounted relay may act, besides providing services, as a potential adversary called the untrusted UAV relay.…