Open Government Data (OGD) provides means for citizens to understand and follow governmental policies and decisions . Herein we present the use of three different visualization tools, a commercial one and two academic ones, applied to two specific Brazilian cases: the implementation of the DrinkDriving Law and the construction of a new overpass in an important city avenue .…

## Reaction or Speculation Building Computational Support for Users in Catching Up Series Based on an Emerging Media Consumption Phenomenon

A growing number of people are using catch-up TV services rather than watching simultaneously with other audience members at the time of broadcast . This conversely suggests that there is potential forcomputational support to enhance the consumption experiences of catching-up users .…

## To Reuse or Not To Reuse A Framework and System for Evaluating Summarized Knowledge

As the amount of information online continues to grow, a correspondinglyimportant opportunity is for individuals to reuse knowledge rather than starting from scratch . appropriatereuse requires judging the relevance, trustworthiness, and thoroughness of others’ knowledge in relation to an individual’s goals and context .…

## Destination similarity based on implicit user interest

Online travel industry data are more challenging to analyze due to extra sparseness, dispersed userhistory actions, fast change of user interest and lack of direct or indirectfeedbacks . A new similarity method is proposed to measure thedestination similarity in terms of implicit user interest .…

## An Overview of Recommender Systems and Machine Learning in Feature Modeling and Configuration

Recommender systems support decisions in various domains ranging from simple books and movies to more complex items such as financialservices, telecommunication equipment, and software systems . In this context,recommendations are determined, for example, on the basis of analyzing thepreferences of similar users .…

## Bootstrapping Large Scale Fine Grained Contextual Advertising Classifier from Wikipedia

We propose wiki2cat, amethod to tackle the problem of large-scaled fine-grained text classification by tapping on Wikipedia category graph . The method is ideal for large-scale classification problems since it does not require any manually-labeled document or hand-curated rules or keywords .…

## SceneRec Scene Based Graph Neural Networks for Recommender Systems

Collaborative filtering has been largely used to advance modern recommendersystems to predict user preference . A key component in collaborative filtering is representation learning, which aims to project users and items into a lowdimensional space to capture collaborative signals . We propose a novel representation model SceneRec .…

## Multi access Coded Caching Scheme with Linear Sub packetization using PDAs

We consider multi-access coded caching problem introduced by Hachem et.al., where each user has access to $L$ neighboring caches in a cyclic wrap-around fashion . We focus on the deterministic schemes for a specific class ofmulti-accesscoded caching problem based on the concept of PDA .…

## On the Application of BAC NOMA to 6G umMTC

This letter studies the application of backscatter communications (BackCom)assisted non-orthogonal multiple access (BAC-NOMA) to the envisionedsixixth-generation (6G) ultra-massive machine type communications (umMTC) Inparticular, the proposed BAC-nOMA transmission scheme can realize simultaneousenergy and spectrum cooperation between uplink and downlink users . Computer simulations areprovided to demonstrate the superior performance of BAC NOMA .…

## Tightening the Dependence on Horizon in the Sample Complexity of Q Learning

Q-learning seeks to learn the optimal Q-function of a Markov decisionprocess (MDP) in a model-free fashion . To yield an entrywise $\varepsilon$-accurate estimate of the optimal function, state-of-the-arttheory requires at least an order of $\frac{|\mathcal{S}||\mathCal{A}|}{(1-\gamma)$ (up to somelogarithmic factor) for any $0 <1, leading to an order-wiseimprovement in terms of the effective horizon $1-1- \gamma . Our finding unveils the effectiveness of vanilla Q-learning, which matches that of speedy Q- learningwithout requiring extra computation and storage . A key ingredient of ouranalysis lies in the establishment of novel error decompositions andrecursions . …

## Rate Splitting Multiple Access to Mitigate the Curse of Mobility in Massive MIMO Networks

Rate-Splitting Multiple Access (RSMA) is a flexible and robust multiple-access scheme for downlink multi-antenna wireless networks . RSMA relies onmulti-antennage rate-splitting at the transmitter and SuccessiveInterference Cancellation at the receivers . The proposed powerallocation greatly reduces precoder design complexity for RSMA .…

## Complete Power Reallocation for MU MIMO under Per Antenna Power Constraint

This paper proposes a beamforming method under a per-antenna power constraint . The proposed complete power reallocation (CPR) method can generate beamformers with excellent performance only with linearoperations . CPR is designed to have a simple structure, making it highlyflexible and practical .…

## Uncertainty of Information Scheduling A Restless Multi armed Bandit Framework

The age of information (AoI) of a processcorresponds to the time since its last update . In general, the associated UoI can be a non-increasing function, or even an oscillating function, of its AoI . This paper’s Whittle index policy is valid for any RMAB inwhich the bandits are binary Markov processes and the penalty is a concavefunction of the belief state of the Markov process .…

## Distributed Source Coding with Encryption Using Correlated Keys

We pose and investigate the distributed secure source coding based on thecommon key cryptosystem . We propose a new security criterion which isgenerally more strict compared to the commonly used security criterion . Under this criterion, we establish the necessary and sufficientcondition for the secure transmission of correlated sources .…

## On Graph Matching Using Generalized Seed Side Information

The graph matchingproblem emerges naturally in various applications such as social networkde-anonymization, image processing, DNA sequencing, and natural language processing . In this paper, matching pairs of stocahstically generated graphs in the presence of generalized seed side-information is considered . The objective is to leverage thecorrelation among the edges of the graphs along with the side information provided in the form of ambiguity sets to recover the labels of the vertices in the second graph .…

## Responsibility and verification Importance value in temporal logics

We aim at measuring the influence of the nondeterministic choices of a part of a system on its ability to satisfy a specification . The importance of a component is measured by giving its control to an adversary, alone or along with other components, and testing whether the system can still fulfill the specification .…

## VSync Push Button Verification and Optimization for Synchronization Primitives on Weak Memory Models Technical Report

This technical report contains material accompanying our work with same titlepublished at ASPLOS’21 . We start in Sec. 1 with a detailed presentation of the innovation of this work, Await Model Checking (AMC) The correctnessproofs of AMC can be found in .…

## A Computability Perspective on Verified Machine Learning

There is a strong consensus that combining the versatility of machinelearning with the assurances given by formal verification is highly desirable . Weconsider this question from the (unexpected?) perspective of computableanalysis . This allows us to define the computational tasks underlying verifiedML in a model-agnostic way, and show that they are in principle computable .…

## Algebraic cocompleteness and finitary functors

Every endofunctor has an initial algebra and a terminalcoalgebra . For all finitary (and, more generally, all precontinuous) setfunctors are proved to carry acanonical partial order . And they also both carry a canonical ultrametric with the same Cauchy completion .…

## Complete Bidirectional Typing for the Calculus of Inductive Constructions

This article presents a bidirectional type system for the Calculus ofInductive Constructions (CIC) It introduces a novel judgement intermediate between the usual inference and checking, dubbed constrained inference, to handle the presence of computation in types . The key property is the completeness of the system with respect to the usual undirected one, which has been proven in Coq as a part of the MetaCoq project .…

## On Signings and the Well Founded Semantics

In this note, we use Kunen’s notion of a signing to establish two theorems about the well-founded semantics of logic programs . The first theorem identifies a class of programs for which the programs coincide for the positive part of $p$ .…

## Intelligent Software Web Agents A Gap Analysis

Semantic web technologies have shown their effectiveness, especially when it comes to knowledge representation, reasoning, and data integrations . However, the original semantic web vision, whereby machine readable web data could beautomatically actioned upon by intelligent software web agents, has yet to berealised .…

## Interview Hoarding

Many centralized matching markets are preceded by interviews between the participants . We study the impact on the final match of an increase to thenumber of interviews one side of the market can participate in. Our motivationis the match between residents and hospitals where, due to the COVID-19pandemic, interviews for the 2020-21 season of the NRMP match have switched to a virtual format.…

## Fair Robust Assignment using Redundancy

We study the consideration of fairness in redundant assignment formulti-agent task allocation . Solving this problem optimally is NP-hard . We exploit properties ofsupermodularity to propose a polynomial-time, near-optimal solution . Empirically, our algorithm outperforms benchmarks, scales to large problems, and provides improvements in both fairness and average utility.…

## Deep learning architectural designs for super resolution of noisy images

Advances in deep learning have led to significant improvements insingle image super-resolution research . However, state-of-the-art methods often fail atconstructing high-resolution images from noisy versions of theirlow-resolution counterparts . In-network design obtains the strongest results when the typeof image corruption is aligned in the training and testing dataset, for any choice of denoiser .…

## User manual for bch a program for the fast computation of the Baker Campbell Hausdorff and similar series

bch is an efficient program written in the C programminglanguage for the fast computation of the Baker-Campbell-Hausdorff (BCH) and similar Lie series . The computation of 111013 coefficients for the BCH series up to terms of degree20 takes less than half a second on an ordinary personal computer and requires a modest 11MB of memory .…

## Core Imaging Library Part II Multichannel reconstruction for dynamic and spectral tomography

Core Imaging Library (CIL) is a flexible plug and playlibrary for tomographic imaging with a specific focus on iterativereconstruction . CIL provides building blocks for tailored regularised regularised algorithms and explicitly supports multichannel tomographic data . This paper focuses on applications of CIL for multichanneldata, e.g.,…

## From perspective maps to epigraphical projections

The projection onto the epigraph or a level set of a closed proper convexfunction can be achieved by finding a root of a scalar equation . The approach is based on the variational-analytic properties of general convexoptimization problems that are (partial) infimal projections of the sum of the function in question and the perspective map of a convex kernel .…

## Low precision logarithmic number systems Beyond base 2

Logarithmic number systems (LNS) are used to represent real numbers in many applications using a constant base raised to a fixed-point exponent making its distribution exponential . This greatly simplifies hardware multiply, divide andsquare root . LNS with base-2 is most common, but in this paper we show that for low-precision LNS the choice of base has a significant impact .…

## Numerical analysis of a model of two phase compressible fluid flow

We consider a model of a binary mixture of two immiscible compressible fluids . We propose a numerical scheme and discuss its basic properties . The convergence is established via themethod of generalized weak solutions combined with the weak-strong uniquenessprinciple .…

## Potential Singularity Formation of 3D Axisymmetric Navier Stokes Equations with Degenerate Variable Diffusion Coefficients

An important feature of this potential singularity is that the solution develops a two-scaletraveling wave that travels towards the origin . The driving mechanism is due to twoantisymmetric vortex dipoles that generate a strong shearing layer in both theradial and axial velocity fields .…

## Numerical investigation of Mach number consistent Roe solvers for the Euler equations of gas dynamics

Traditional approaches to prevent the carbuncle phenomenon in gasdynamics simulations increase the viscosity on entropy and shear waves nearshocks . The goal is to achieve what, in thispaper, we call Mach number consistency . We take the simple approach that was used for the proof of concepttogether with the simple model for the increased numerical viscoity on linearwaves .…

## A fast and scalable computational framework for goal oriented linear Bayesian optimal experimental design Application to optimal sensor placement

Optimal experimental design (OED) is a principled framework for maximizing information gained from limited data in inverse problems . We develop a fast andscalable computational framework for goal-oriented OED of large-scale Bayesianlinear inverse problems that finds sensor locations to maximize the expectedinformation gain (EIG) for a predicted quantity of interest .…

## 3D 1D coupling on non conforming meshes via three field optimization based domain decomposition

A new numerical approach is proposed for the simulation of coupledthree-dimensional and one-dimensional elliptic equations (3D-1D coupling) The method is based on a well posed mathematical formulation and results in anumerical scheme with high robustness and flexibility in handling geometricalcomplexities .…

## Flying V and Reference Aircraft Evacuation Simulation and Comparison

A preliminary comparison of evacuation times of the Flying V and the AirbusA350-900 is presented in this study . Certification regulations state that thetime to evacuate a civil aircraft in case of an emergency with half of all exitdoors closed must be less than 90 seconds .…

## A space time discretization of a nonlinear peridynamic model on a 2D lamina

Peridynamics is a nonlocal theory for dynamic fracture analysis consisting in a second order in time partial integro-differential equation . We implement a spectral method for the space discretization based on the Fourier expansion of the solution . This computational approach takes advantages from theconvolutional form of the peridynamic operator and from the use of the discreteFourier transform .…

## PVTSI boldmath m A Novel Approach to Computation of Hadamard Finite Parts of Nonperiodic Singular Integrals

We consider the numerical computation of the Hadamard Finite Part of the finite-rangesingular integral . $f(x)=g(x)/(x-t)^{m$ with $a

## Exactness and Convergence Properties of Some Recent Numerical Quadrature Formulas for Supersingular Integrals of Periodic Functions

In a recent work, we developed three compact numerical quadratureformulas for finite-range periodic supersingular integrals $I[f[f]=t/n$ with $h=T/n . We prove that these formulas have spectral accuracy . We also prove that, when $u(z)$ is analytic in astrip $Im, the errors in all three formulas are $O(e^{-2n\pi\sigma/T)$ as$n\to\infty$ for all practical purposes .…

## Unified Compact Numerical Quadrature Formulas for Hadamard Finite Parts of Singular Integrals of Periodic Functions

We consider the numerical computation of finite-range singular integrals . We use a generalization of the Euler–Maclaurin expansion for integrals with arbitrary algebraic endpointsingularities . For each $m$ we develop a number of numerical quadratureformulas of trapezoidal type for $I[f]$ .…

## Robust Hybrid High Order method on polytopal meshes with small faces

We design a Hybrid High-Order scheme for the Poisson problem that is robust on polytopal meshes in the presence of small edges/faces . We stategeneral assumptions on the stabilisation terms involved in the scheme, underwhich optimal error estimates are established with multiplicative constants that do not depend on the maximum number of faces in each element, or the relative size between an element and its faces .…

## Well posedness theory for nonlinear scalar conservation laws on networks

We consider nonlinear scalar conservation laws posed on a network . We establish $L^1$ stability, and thus uniqueness, for weak solutions satisfying the entropy condition . We demonstrate themethod’s properties through several numerical experiments . In one important case — for monotone fluxes with an upwinddifference scheme — we show that the set of (discrete) stationary solutions is sufficiently large to suit our general theory .…

## An approximation method for electromagnetic wave models based on fractional partial derivative

The FPDE is a fractionalpartial differential equation (FPDE) arising from electromagnetic waves indielectric media (EMWDM) The truncated Bernoulli and Hermite wavelets series have been used to approximate the solution in both temporal and spatial variables . The resulted system of a linearalgebraic equation has been solved by the collocation method .…

## Leveraging Benchmarking Data for Informed One Shot Dynamic Algorithm Selection

A key challenge in the application of evolutionary algorithms in practice is the selection of an algorithm instance that best suits the problem at hand . Different algorithms may be bestsuited for different stages of the optimization process . Dynamic algorithmselection and configuration are well-researched topics inevolutionary computation .…

## Towards Large Scale Automated Algorithm Design by Integrating Modular Benchmarking Frameworks

We present a first proof-of-concept use-case that demonstrates the efficiency of interfacing the algorithm framework ParadisEO with the automated algorithmconfiguration tool irace and the experimental platform IOHprofiler . Key advantages of our pipeline are fast evaluation times, the possibility to generate rich data sets to support the analysis of the algorithms .…

## Visualizing hierarchies in scRNA seq data using a density tree biased autoencoder

Single cell RNA sequencing (scRNA-seq) data makes studying the development of cells possible at unparalleled resolution . Given that many cellulardifferentiation processes are hierarchical, their scRNA-sequencing data is expected to be approximately tree-shaped in gene expression space . Inference andrepresentation of this tree-structure in two dimensions is highly desirable forbiological interpretation and exploratory analysis .…

## Neural Architecture Search as Program Transformation Exploration

Improving the performance of deep neural networks is important to both the compiler and neural architecture search (NAS) communities . We express neural architectureoperations as program transformations whose legality depends on a notion ofrepresentational capacity . This allows them to be combined with existing transformations into a unified optimization framework .…

## High Order Control Lyapunov Barrier Functions for Temporal Logic Specifications

Recent work has shown that stabilizing an affine control system to a desired state while optimizing a quadratic cost subject to state and controlconstraints can be reduced to a sequence of Quadratic Programs . In this paper, we generalize HOCBFs to High OrderControl Lyapunov-Barrier Functions (HOCLBFs) We also show that the proposed HOCLFs can be used to guarantee the Boolean satisfaction of Signal TemporalLogic (STL) formulae over the state of the system .…

## Predicting and Attending to Damaging Collisions for Placing Everyday Objects in Photo Realistic Simulations

Placing objects is a fundamental task for domestic service robots (DSRs) We show that a rule-based approach that uses plane detection,to detect free areas, performs poorly . To address this, we develop PonNet, which has multimodal attention branches and a self-attention mechanism topredict damaging collisions .…

## Customizable Stochastic High Fidelity Model of the Sensors and Camera onboard a Low SWaP Fixed Wing Autonomous Aircraft

The navigation systems of autonomous aircraft rely on the readings provided by a suite of onboard sensors to estimate the aircraft state . Anaccurate representation of the behavior and error sources of each of thesesensors, together with the images generated by the cameras, in indispensable for flight simulation and the evaluation of novel inertial or visual navigational algorithms .…

## Fast Fault Detection on a Quadrotor using Onboard Sensors and a Kalman Filter Approach

This paper presents a novel method for fast and robust detection of actuatorfailures on quadrotors . A Kalman filter estimator estimates a stochastic effectivenessfactor for every actuator, using only onboard RPM, gyro and accelerometermeasurements . Then, a hypothesis test identifies the failed actuator .…