## Optimizing the hybrid parallelization of BHAC

We present our experience with the modernization on the GR-MHD code BHAC,aimed at improving its novel hybrid (MPI+OpenMP) parallelization scheme . We showcase the use of performance profiling tools usable on x86(Intel-based) architectures . Our performance characterization and threadinganalysis provided guidance in improving the concurrency and thus the efficiencyof the OpenMP parallel regions .…

## Large Large deviations for spatial telecommunication systems The boolean model

Spatial telecommunication systems have evolved along the years, leading to some concerns that telecommunication companies are facing today . The maininquietude is the ability to provide quality service to customers or users in adense regime . What is the best possibleconfigurations of base stations and users that maximizes quality service?…

## Positive Planar Satisfiability Problems under 3 Connectivity Constraints

A 3-SAT problem is called positive and planar if all the literals are positive and the clause-variable incidence graph (i.e., SAT graph) is planar . In this paper we prove that a positive planar NAE3SAT is always satisfiable when the underlying SAT graph is 3-connected, and asatisfiable assignment can be obtained in linear time .…

## Green Internet of Vehicles IoV in the 6G Era Toward Sustainable Vehicular Communications and Networking

There has been an upsurge of interest to develop the green IoVtowards sustainable vehicular communication and networking in the 6G era . We introduce the potential challenges and the emerging technologies in 6G for developing green IoVs systems . Finally, we discuss theresearch trends in designing energy-efficient IoV systems.…

## Positive Planar Satisfiability Problems under 3 Connectivity Constraints

A 3-SAT problem is called positive and planar if all the literals are positive and the clause-variable incidence graph (i.e., SAT graph) is planar . In this paper we prove that a positive planar NAE3SAT is always satisfiable when the underlying SAT graph is 3-connected, and asatisfiable assignment can be obtained in linear time .…

## One Bend Drawings of Outerplanar Graphs Inside Simple Polygons

We consider the problem of drawing an outerplanar graph with $n$ vertices with at most one bend per edge if the outer face is already drawn as a simplepolygon . We prove that it can be decided in $O(nm)$ time if such a drawingexists, where $m\le n-3$ is the number of interior edges .…

## The Devil is in the Detail Simple Tricks Improve Systematic Generalization of Transformers

Recently, many datasets have been proposed to test the systematicgeneralization ability of neural networks . The companion baseline Transformers, typically trained with default hyper-parameters from standard tasks, are shownto fail dramatically . Here we demonstrate that by revisiting modelconfigurations as basic as scaling of embeddings, early stopping, relativepositional embedding, and Universal Transformer variants, we can drasticallyimprove the performance of Transformers on systematic generalization .…

## Quantum Sub Gaussian Mean Estimator

We present a new quantum algorithm for estimating the mean of a real-valued random variable obtained as the output of a quantum computation . Our estimatorachieves a nearly-optimal quadratic speedup over the number of classical i.i.d.samples needed . We obtain new quantum algorithms for the .…

## Targeting Underrepresented Populations in Precision Medicine A Federated Transfer Learning Approach

The limited representation of minorities and disadvantaged populations in large-scale clinical and genomics research has become a barrier to translating precision medicine research into practice . Risk prediction models are often found to be underperformed inthese underrepresented populations . In this paper, we propose a two-way data integration strategy that integrates heterogeneous data from diverse populations and from multiple healthcare institutions via a federated transfer learning approach .…

## Rule based Adaptations to Control Cybersickness in Social Virtual Reality Learning Environments

Social virtual reality learning environments (VRLEs) provide immersiveexperience to users with increased accessibility to remote learning . Lack of high-performance and secured data delivery in critical VRLE domains (e.g., military training, manufacturing) can disrupt application functionality and induce cybersickness . In the event of an anomaly, the framework features rule-based adaptationsthat are triggered by using various decision metrics .…

## Bottleneck Convex Subsets Finding k Large Convex Sets in a Point Set

Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary givenset $P$ of $n$ points in the plane . We show the problem is NP-hard when $k$ is an arbitrary input parameter .…

## GLocal K Global and Local Kernels for Recommender Systems

Recommender systems typically operate on high-dimensional sparse user-item matrix matrix . We propose a Global-Local Kernel-based matrix completionframework, named GLocal-K . Our model outperforms the state-of-the-artbaselines on three collaborative filtering benchmarks: ML-100K, ML-1M, andDouban. We apply our model under the extreme low-resource setting, which includes only a user item rating matrix, with no side information, to an extreme low resource setting .…

## Robustness Disparities in Commercial Face Detection

Facial detection and analysis systems have been deployed by large companies and critiqued by scholars and activists for the past decade . We present the first of its kind detailedbenchmark of the robustness of three such systems: Amazon Rekognition,Microsoft Azure, and Google Cloud Platform .…

## Two In One A Design Space for Mapping Unimanual Input into Bimanual Interactions in VR for Users with Limited Movement

Virtual Reality (VR) applications often require users to perform actions with two hands when performing tasks and interacting with objects in virtualenvironments . We propose Two-in-One, a design space that facilitates the creation of accessible methods for bimanual interactions in VR from unimanual input .…

## Recent Developments in Program Synthesis with Evolutionary Algorithms

Evolutionary computation is one of the main applications in the field of evolutionary computation . With programsynthesis techniques, software developers could be supported in theireveryday work . Even users without any programming knowledge could be empowered to automate repetitive tasks and implement their own newfunctionality .…

## Deep Reinforcement Learning for Wireless Resource Allocation Using Buffer State Information

The resource allocation problem for orthogonal frequency-division multiple access (OFDMA) becomes challenging . We solve the non-convex optimization problem using deepreinforcement learning (DRL) We outline, train and evaluate a DRL agent, which performs the task of media access control scheduling for a downlink OFDMA scenario .…

## Learning to Give Checkable Answers with Prover Verifier Games

Prover-Verifier Games (PVGs) is a game-theoretic framework to encourage learningagents to solve decision problems in a verifiable manner . The PVG consists of two learners with competing objectives: a trusted verifier network tries tochoose the correct answer, and a more powerful but untrusted prover network attempts to persuade the verifier of a particular answer .…

## Group Testing with Non identical Infection Probabilities

We develop an adaptive group testing algorithm that uses the proposed set formation method recursively . We prove novel upper bounds on thenumber of tests for the proposed algorithm . We show thatour algorithm outperforms the state of the art, and performs close to theentropy lower bound.…

## COVID 19 reproduction number estimated from SEIR model association with people s mobility in 2020

This paper is an exploratory study of two epidemiological questions on aworldwide basis . How fast is the disease spreading? Are the restrictions(especially mobility restrictions) for people bring the expected effect? To answer the first question, we propose a tool for estimating the reproductionnumber of epidemic (the number of secondary infections $R_t$) based on the SEIR model .…

## Machine Learning for Performance Prediction of Spark Cloud Applications

Machine Learning (ML) provides black box solutions to model relationship between application performance and system configuration without requiring in-detail knowledge of the system . We investigate the cost-benefits of using supervised ML models for predicting the performance of applications on Spark, one of today’s most widely used frameworks for big data analysis .…

## Bottleneck Convex Subsets Finding k Large Convex Sets in a Point Set

Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary givenset $P$ of $n$ points in the plane . We show the problem is NP-hard when $k$ is an arbitrary input parameter .…

## A map of Digital Humanities research across bibliographic data sources

This is the first large-scale study of DH research that involved a huge number of bibliographic data sources, including open and proprietary databases . Citations from/to DH publications showed relations between DH and research in Computer Science, Linguistics, Psychology, and Pedagogical & Educational Research .…

## On the Upward Book Thickness Problem Combinatorial and Complexity Results

A long-standing conjecture by Heath, Pemmaraju, and Trenk states that theupward book thickness of outerplanar DAGs is bounded above by a constant . We show that the conjecture holds for subfamilies of upwardouterplanar graphs, namely those whose underlying graph is aninternally-triangulated outerpath or a cactus .…

## Positive Planar Satisfiability Problems under 3 Connectivity Constraints

A 3-SAT problem is called positive and planar if all the literals are positive and the clause-variable incidence graph (i.e., SAT graph) is planar . In this paper we prove that a positive planar NAE3SAT is always satisfiable when the underlying SAT graph is 3-connected, and asatisfiable assignment can be obtained in linear time .…

## Representation and Processing of Instantaneous and Durative Temporal Phenomena

In this paper, we propose a new logic based temporal phenomenadefinition language specifically tailored for Complex Event Processing . We demonstrate the expressiveness ofour proposed language by employing a maritime use case where we define maritimeevents of interest . Finally, we analyse the execution semantics of our proposed language for stream processing and introduce the `Phenesthe’ implementationprototype.…

## Query Focused Extractive Summarisation for Finding Ideal Answers to Biomedical and COVID 19 Questions

This paper presents Macquarie University’s participation to the BioASQSynergy Task, and BioasQ9b Phase B . The Synergy Task is an end-to-end questionanswering task on COVID-19 . Our system splitthe snippets into candidate sentences and used BERT variants under a sentenceclassification setup .…

## The stochastic bilevel continuous knapsack problem with uncertain follower s objective

The leader’s aim is to optimize a linear objectivefunction in the capacity and in the follower’s solution, but with respect to different item values . We address a stochastic version of this problem where the leader’s profits are uncertain from his perspective, and only aprobability distribution is known .…

## On the Upward Book Thickness Problem Combinatorial and Complexity Results

A long-standing conjecture by Heath, Pemmaraju, and Trenk states that theupward book thickness of outerplanar DAGs is bounded above by a constant . We show that the conjecture holds for subfamilies of upwardouterplanar graphs, namely those whose underlying graph is aninternally-triangulated outerpath or a cactus .…

## Full Attention Bidirectional Deep Learning Structure for Single Channel Speech Enhancement

Speech enhancement is a critical area in audio signal processing . The proposed bidirectional attention-basedarchitecture achieves better performance in terms of speech quality (PESQ),compared with OM-LSA, CNN-LSTM, T-GSA and the unidirectional Attention-based LSTM baseline . This is an extension of the previousattention-based RNN method .…

## FAST PCA A Fast and Exact Algorithm for Distributed Principal Component Analysis

Principal Component Analysis (PCA) is a fundamental data preprocessing tool in machine learning . The purpose of PCA is two-fold: dimension reduction and feature learning . This paper proposes a distributed PCA algorithm calledFAST-PCA (Fast and exAct diSTributed PCA) The proposed algorithm is efficientin terms of communication and can be proved to converge linearly and exactly to the principal components that lead to dimension reduction as well as uncorrelated features .…

## Calculating Cost Distributions of a Multiservice Loss System

Congestion pricing means that the operator increases prices at the time of congestion and the traffic demand are expected to decrease . Shadow prices are an optimal way of congestion pricing: users are chargedshadow prices, i.e., the expectations of future losses because of blockedconnections .…

## Similar Scenes arouse Similar Emotions Parallel Data Augmentation for Stylized Image Captioning

Stylized image captioning systems aim to generate a caption not onlysemantically related to a given image but also consistent with a given styled description . One of the biggest challenges with this task is the lack ofsufficient paired stylized data .…

## Visual and Language Navigation A Survey and Taxonomy

Visual-and-Language Navigation is a multi-disciplinary field of increasing importance and with extraordinary practicality . This taxonomy enables researchers to better grasp the keypoint of a specific task and identify directions for future research . For multi-turn tasks, we divided them into imperative task and interactive task based on whether the agent responsesto the instructions .…

## Noise Adaptive Quantum Compilation Strategies Evaluated with Application Motivated Benchmarks

Quantum compilation is the problem of translating an input quantum circuit into the most efficient equivalent of itself, taking into account the device that will execute the computation . Noise-adaptive compilers do take the noise statisticsof the device into account, for some or all passes .…

## Distinct Angle Problems and Variants

The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry . We provide upper and lower bounds on a broad class of distinct angle problems . We introduce a new class of asymptotically optimal point configurations with no four cocircular points .…

## Supercomputing Enabled Deployable Analytics for Disaster Response

MIT SuperCloud precompute range of analytics as files that can be used with standard preinstalled software that does not require network access or additional software . In response to the COVID-19 pandemic, this approach was tested for providing geo-spatial census data to allow quick analysis of demographic data for better responding to emergencies .…

## Enhancing Model Assessment in Vision based Interactive Machine Teaching through Real time Saliency Map Visualization

Interactive Machine Teaching systems allow users to create customized machinelearning models through an iterative process of user-guided training and modelassessment . They primarily offer confidence scores of each label or class as feedback for assessment by users . However, such feedback doesn’t necessarily suffice for users to confirm the behavior of the model .…

## Supercomputing Enabled Deployable Analytics for Disaster Response

MIT SuperCloud precompute range of analytics as files that can be used with standard preinstalled software that does not require network access or additional software . In response to the COVID-19 pandemic, this approach was tested for providing geo-spatial census data to allow quick analysis of demographic data for better responding to emergencies .…

## Look It s a Computer Program It s an Algorithm It s AI Does Terminology Affect Human Perceptions and Evaluations of Intelligent Systems

In the media, in policy-making, but also in research articles, intelligentsystems are referred to as algorithms, artificial intelligence, and computerprograms . We hypothesize that such terminologicaldifferences can affect people’s perceptions of properties of intelligent systems . Our findings highlight the need to be mindful when choosing terms to describe intelligent systems,because terminology can have unintended consequences, and may impact therobustness and replicability of HCI research .…

## Approximation algorithms for the random field Ising model

Approximating the partition function of the ferromagnetic Ising model with general external fields is known to be #BIS-hard in the worst case, even forbounded-degree graphs . We establish the existence of fully polynomial-time approximation schemes and samplers with high probability over the random fieldsif the external fields are IID Gaussians with variance larger than a constant .…

## Cross domain Single channel Speech Enhancement Model with Bi projection Fusion Module for Noise robust ASR

In recent decades, studies have suggested that phase information is crucial for speech enhancement (SE) We put forward a novel cross-domainspeech enhancement model and a bi-projection fusion (BPF) mechanism fornoise-robust ASR . To evaluate the effectiveness of our proposed method, we conduct an extensive set of experiments on the publicly-available Aishell-1Mandarin benchmark speech corpus .…

## Truly Perfect Samplers for Data Streams and Sliding Windows

In the data stream model, $f$ is defined implicitly by asequence of updates to its coordinates, and the goal is to design such asampler in small space . Jayaram and Woodruff (FOCS 2018) gave the first perfect$L_p$ samplers in turnstile streams, using $G(x) space for$p\in(0,2) However, to date all known samplingalgorithms are not truly perfect, since their output distribution is onlypoint-wise $\gamma = 1/\text{poly}(n)$ close to the true distribution .…