D2S Document to Slide Generation Via Query Based Text Summarization

Presentations are critical for communication in all areas of our lives, yet the creation of slide decks is often tedious and time-consuming . We present D2S, a novel system that tackles the document-to-slides task with a two-step approach: 1)Use slide titles to retrieve relevant and engaging text, figures, and tables;2) Summarize the retrieved context into bullet points with long-form questionanswering.…

Joint Beamforming and Reconfigurable Intelligent Surface Design for Two Way Relay Networks

In this paper, we consider a reconfigurable intelligent surface(RIS)-assisted two-way relay network . We propose two algorithms to design the RIS phase shifts and the BSpower amplification parameter, namely the SNR-upper-bound-maximization (SUM)method, and genetic-SNR (GSM) method . Our objective is tomaximize the minimum signal-to-noise ratio (SNR) of the two users, under the transmit power constraint at the BS .…

Coded Alternating Least Squares for Straggler Mitigation in Distributed Recommendations

Matrix factorization is an important representation learning algorithm, e.g.,recommender systems, where a large matrix can be factorized into the product of two low dimensional matrices termed as latent representations . This paper investigates the problem of matrix factorization in distributed computingsystems with stragglers, those compute nodes that are slow to returncomputation results .…

Continuous representations of intents for dialogue systems

Intent modelling has become an important part of modern dialogue systems . Up until recently the focus has been on detecting a fixed,discrete, number of seen intents . This paper proposes a novel model where intents are continuous points placed in a specialist Intent Space that yields severaladvantages.…

Latency Controlled Neural Architecture Search for Streaming Speech Recognition

Recently, neural architecture search (NAS) has attracted much attention and has been explored for automatic speech recognition (ASR) In thiswork, we focus on streaming ASR scenarios and propose the latency-controlledNAS for acoustic modeling . Extensive experiments show that: Based on the proposed neuralarchitecture, the neural networks with a medium latency of 550ms (millisecond)and a low latency of 190ms can be learned in the vanilla and revised operationspace respectively .…

Applications of Auction and Mechanism Design in Edge Computing A Survey

Edge computing as a promising technology provides lower latency, moreefficient transmission, and faster speed of data processing . Each edge server with limited resources can offload latency-sensitive and computation-intensive tasks from nearby user devices . Edge computing faces challenges such as resource allocation, energy consumption, security and privacy issues .…

The Pony Express Communication Problem

We introduce a new problem which we call the Pony Express problem . n robots with differing speeds are situated over some domain . The objective is to deliver the message in minimum time . We provide an offline algorithm running in O(n log n) running time and an online algorithm that attains a competitive ratio of 3/2 which we show is the best possible .…

LPVcore MATLAB Toolbox for LPV Modelling Identification and Control

LPVcore software package for MATLAB developed to model, simulate, estimate and control systems via linear parameter-varying(LPV) input-output (IO), state-space (SS) and linear fractional (LFR) representations . The paper contains an overview of functions in the toolbox to simulate and identify and identify IO, SS and LFR representations .…

Fast Neighborhood Rendezvous

In the rendezvous problem, two computing entities (called \emph{agents) have to meet at the same vertices in a graph . The only known result is that the time complexity of $O(\sqrt{n)$ rounds is achievable if the graph is complete and agents areprobabilistic, asymmetric, and can use whiteboards placed at vertices .…

Quantum Proofs of Proximity

We initiate the systematic study of QMA algorithms in the setting of propertytesting, to which we refer as QMA proofs of proximity (QMAPs) We show quantum speedups for properties that lie outside of thisfamily, such as graph bipartitneness . We also investigate the complexitylandscape of this model, showing that QMAPs can be exponentially stronger than both classical and quantum testers .…

The Tags Are Alright Robust Large Scale RFID Clone Detection Through Federated Data Augmented Radio Fingerprinting

Radio fingerprinting (RFP) is a compelling approach that leverages the imperfections in the tag’s wireless circuitry to achieve large-scale RFID clone detection . Time-varying channel conditions can significantly decrease the accuracy of the RFP process . We propose a novel training framework based on federatedmachine learning (FML) and data augmentation (DAG) to boost the accuracy .…

Parameterized Complexity of Feature Selection for Categorical Data Clustering

We develop new algorithmic methods with provable guarantees for featureselection in regard to categorical data clustering . Our algorithm is based on asolution to a more general problem, Constrained Clustering with Outliers . We assume that there are some inadvertent (or undesirable)features of the input data that unnecessarily increase the cost of clustering on the selected features .…

Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space

The notions of synchronizing and partitioning sets are recently introducedvariants of locally consistent parsings with great potential inproblem-solving . In this paper we propose a deterministic algorithm thatconstructs for a given readonly string of length $n$ over the alphabet$\{0,1,\ldots,n^{\mathcal{O}(1)}\}$ The algorithm uses a version of a set withsize $tau = \frac{n/b$ using $taus$ and $\tau$-partitioning set .…

Error analysis of an unfitted HDG method for a class of non linear elliptic problems

Hibridizable Discontinuous Galerkin discretizations for a class of non-linear interior elliptic boundary value problems . We show that, under mild assumptions on thesource term and the computational domain, the discrete systems are well posed. We provide a priori error estimates showing that the discretesolution will have optimal order of convergence as long as the distance betweenthe curved boundary and the computation boundary remains of the same order ofmagnitude as the mesh parameter .…

AnomalyHop An SSL based Image Anomaly Localization Method

AnomalyHop is mathematically transparent, easy to train, and fast in its inference speed . Its area under the ROC curve (ROC-AUC)performance on the MVTec AD dataset is 95.9%, which is among the best of several benchmarking methods . Comparing with state-of-the-art image anomaly localization methods based on deep neuralnetworks (DNNs) The code is publicly available at Github and available in the works .…

A Phase Theory of MIMO LTI Systems

In this paper, we introduce a definition of phase response for a class of MIMO linear time-invariant systems whosefrequency responses are (semi-)sectorial at all frequencies . The newly definedphase concept subsumes the well-known notions of positive real systems and negative imaginary systems .…

An Influence based Approach for Root Cause Alarm Discovery in Telecom Networks

Alarm root cause analysis is critical for efficient and accurate fault localization and failure recovery . We propose a novel data-driven framework for root cause alarm localization, combining both causal inference and network embedding techniques . We subsequently discover root cause alarms in a real-time data stream by applying an influence maximization algorithm on the weighted graph .…

CoDE Collocation for Demonstration Encoding

Roboticists frequently turn to Imitation learning (IL) for data efficient policy learning . Many IL methods combat distributional shift issues with older BehaviorCloning (BC) methods by introducing oracle experts . We present adata-efficient imitation learning technique called Collocation forDemonstration Encoding (CoDE) that operates on only a fixed set of trajectorydemonstrations by modeling learning as empirical risk minimization .…

The Challenges and Opportunities of Human Centered AI for Trustworthy Robots and Autonomous Systems

The trustworthiness of Robots and Autonomous Systems (RAS) has gained aprominent position on many research agendas towards fully autonomous systems . RAS must be (i)safe in any uncertain and dynamic surrounding environments; (ii) secure, thusprotecting itself from any cyber-threats; (iii) healthy with fault tolerance;(iv) trusted and easy to use to allow effective human-machine interaction(HMI) The risks posed by advanced AI in RAS have not received sufficient scientific attention .…

Probabilistic Visual Place Recognition for Hierarchical Localization

Visual localization techniques often comprise a hierarchical localizationpipeline, with a visual place recognition module used as a coarse localizer toinitialize a pose refinement stage . We demonstrate significant improvements to the localizationaccuracy of the coarse localization stage using our methods, whilst retaining state-of-the-art performance under severe appearance change .…

Towards Real World Category level Articulation Pose Estimation

Current Category-levelArticulation Pose Estimation (CAPE) methods are studied under the single-instance setting with a fixed kinematic structure for each category . We reform this problem setting for real-world environments and suggest a CAPE-Real (CAPER) task setting . This setting allows multiple instancesto co-exist in an observation of real world .…

VIRAL SLAM Tightly Coupled Camera IMU UWB Lidar SLAM

In this paper, we propose a tightly-coupled, multi-modal simultaneouslocalization and mapping (SLAM) framework, integrating an extensive set of sensors: IMU, cameras, multiple lidars, and Ultra-wideband (UWB) rangemeasurements . We propose a two stage approach . In the first stage,lidar, camera, and IMU data on a local sliding window are processed in a coreodometry thread .…

Executable Interval Temporal Logic Specifications

In this paper the reversibility of executable Interval Temporal Logic (ITL)specifications is investigated . ITL allows for the reasoning about systems interms of behaviours which are represented as non-empty sequences of states . At a high level one can specify a system in terms of properties, for instance safetyand liveness properties .…

CASTing a Net Supporting Teachers with Search Technology

Past and current research has typically focused on ensuring that searchtechnology for the classroom serves children . In this paper, we argue for theneed to broaden the research focus to include teachers and how searchtechnology can aid them . We share how furnishing abehind-the-scenes portal for teachers can empower them by providing a window into the spelling, writing, and concept connection skills of their students .…

fAshIon after fashion A Report of AI in Fashion

Report: fAshIon (artificial intelligence (AI) in fashion) explores its potentiality to become a major disruptor of the fashion industry in the near future . Report: Many potential opportunities exist for the use of AI in fashion which can transform the industry embedded with AItechnologies and boost profits .…

Lambek pregroups are Frobenius spiders in preorders

“Spider” is a nickname of *special Frobenius algebras, a fundamental structure from mathematics, physics, and computer science . Pregroups and spiders have been used in natural language processing: one for syntax, the other forsemantics . The compositional framework that emerged with the results suggests new ways tounderstand and apply the basis structures in machine learning and data analysis .…