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.…

## 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 .…

## 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 .…

## 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 .…

## 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.…

## An Introduction to Hamiltonian Monte Carlo Method for Sampling

The goal of this article is to introduce the Hamiltonian Monte Carlo (HMC)method . We focus on the “idealized” case, where onecan compute continuous trajectories exactly . We show that idealized HMCpreserves $pi$ and we establish its convergence when $f$ is strongly convexand smooth .…

## 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 .…

## 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 .…

## 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 .…

## Injecting Text in Self Supervised Speech Pretraining

The proposed method, tts4pretrain, complements the power of contrastivelearning in self-supervision with linguistic/lexical representations derived from synthesized speech . Lexical learning in the speech encoder is enforced through anadditional sequence loss term that is coupled with contrastive loss duringpretraining . We demonstrate that this novel pretraining method yields WordError Rate (WER) reductions of 10% relative on the well-benchmarked,Librispeech task over a state-of-the-art baseline pretrained with wav2vec2.0only .…

## An explicit vector algorithm for high girth MaxCut

We give an approximation algorithm for MaxCut and provide guarantees on theaverage fraction of edges cut on $d$-regular graphs of girth . Our guarantees are better than those of all other classical and quantum algorithms known to the authors . Ouralgorithm constructs an explicit vector solution to the standard semidefiniterelaxation of MaxCut .…

## LaForge Always Correct and Fast Incremental Builds from Simple Specifications

Developers rely on build systems to generate software from code . Simple build specifications are easy to write, but limit incremental work . We introduce LaForge, a novel build tool that eliminates the need to specifydependencies or incremental build steps .…

## A Two step Heuristic for the Periodic Demand Estimation Problem

Freight carriers rely on tactical plans to satisfy demand in a cost-effective way . The periodic demand is the demand that is expected torepeat in each period of the planning horizon . Laage et al. (2021) recently introduced the Periodic Demand Estimation (PDE)problem and showed that it has a high value .…

## 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 .…

## 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 .…

## Separable Temporal Convolution plus Temporally Pooled Attention for Lightweight High performance Keyword Spotting

Keyword spotting (KWS) on mobile devices generally requires a small memory footprint . Most current models still maintain a large number ofparameters in order to ensure good performance . We propose atemporally pooled attention module which can capture global features better than the AveragePool .…

## Revising Ontologies via Models The ALC formula Case

Most approaches for repairing description logic (DL) ontologies aim at changing axioms as little as possible . Instead, the input for the update is given by a model which we want to add or remove . This new setting is motivated by scenarios where an ontology isbuilt automatically and needs to be refined or updated .…

## 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 .…

## Automata Linear Dynamic Logic on Finite Traces

Automata Linear Dynamic Logic on Finite Traces (ALDL_f) combines propositional logic with nondeterministic finite automata (NFA) to express temporal constraints . This is a gain in expressiveness over LTL at no cost. ALDL$_f$ is equivalent to Monadic Second-Order Logic. This is an improvement in satisfiability of LTL.…

## 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 .…

## Task aware Warping Factors in Mask based Speech Enhancement

This paper proposes the use of two task-aware warping factors in mask-basedspeech enhancement (SE) It is easy to apply the proposed dual-warping factors approach to anymask-based SE method, and it allows a single SE system to handle multiple tasks without task-dependent training .…

## 4 bit Quantization of LSTM based Speech Recognition Models

We investigate impact of aggressive low-precision representations ofweights and activations in large LSTM-based architectures forAutomatic Speech Recognition (ASR) Using a 4-bit integer representation, a quantization approach results in significant Word ErrorRate (WER) degradation . We show that minimal accuracy loss is achievable with an appropriate choice of quantizers and initializations .…

## 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 .…

## Replaying Archived Twitter When your bird is broken will it bring you down

Historians and researchers trust web archives to preserve social mediacontent that no longer exists on the live web . Twitter forced the use of its new UI in June 2020 . Most web archives were unable to archive the new UI, resulting in archived Twitter pages displaying Twitter’s “Something went wrong” error .…

## NimbleChain Low latency consensusless cryptocurrencies in general purpose permissionless blockchains

NimbleChain is the first system to bring together fast transactions with strongly-consistent consensus-based transactions in a permissionless setting . The average latency to promise a transaction is an order of magnitude faster than consensus based commit . The system is an extension of Ethereum and evaluate it in a 500-node geo-distributed deployment .…

## 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 .…

## 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 .…

## A High Fidelity Flow Solver for Unstructured Meshes on Field Programmable Gate Arrays

In this work, we design a custom FPGA-based accelerator for a computationalfluid dynamics (CFD) code . We target the entire unstructured Poisson solver . We propose a novel datamovement-reducing technique where we compute geometric factors on the fly, which yields significant (700+ GFlop/s) single-precision performance and anupwards of 2x reduction in runtime for the local evaluation of the Laplace operator .…

## 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 .…

## 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 .…

## A denotational semantics for PROMELA addressing arbitrary jumps

PROMELA (Process Meta Language) is a high-level specification languagedesigned for modeling interactions in distributed systems . It is used as an input language for the model checker SPIN (Simple Promela INterpreter) The main characteristics are non-determinism, process communication through synchronous as well as asynchronous channels .…

## 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 .…

## 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 .…

## 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 .…

## A functional skeleton transfer

The animation community has spent significant effort trying to ease riggingprocedures . The increasing availability of 3D datamakes manual rigging infeasible . However, object animations involve understanding elaborate geometry and dynamics . This paper proposes a functional approach for skeletontransfer that uses limited information and does not require a complete match between the geometries .…

## 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 .…

## SAUCE Truncated Sparse Document Signature Bit Vectors for Fast Web Scale Corpus Expansion

When a sufficient amount of within-domain text may not be available, expanding a seed corpus of relevant documents from large-scale web data poses several challenges . The authors propose a novel truncated sparse document bit-vectorrepresentation, termed Signature Assisted Unsupervised Corpus Expansion(SAUCE) The SAUCE can reduce the computational burden while ensuring high within-Domain lexical coverage, especially under limited seed corpora scenarios.…

## SPARROW A Novel Covert Communication Scheme Exploiting Broadcast Signals in LTE 5G Beyond

This work proposes a novel framework to identify and exploit vulnerable MAClayer procedures in commercial wireless technologies for covert communication . Examples of covert communication include data exfiltration, remotecommand-and-control (CnC) and espionage . In this framework, the SPARROW schemesuse the broadcast power of incumbent wireless networks to covertly relay messages across a long distance without connecting to them .…

## 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.…

## Classification of Emotions and Evaluation of Customer Satisfaction from Speech in Real World Acoustic Environments

This paper focuses on finding suitable features to robustly recognizeemotions and evaluate customer satisfaction from speech in real acousticscenarios . The classification of emotions is based on standard and well-knowncorpora . The evaluation of customer satisfaction is . based on recordings of .…

## 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 .…

## Developer Centric Test Amplification The Interplay Between Automatic Generation and Human Exploration

Automatically generating test cases for software has been an active research topic for many years . While current tools can generate powerful regression or crash-reproducing test cases, these are often kept separately from themaintained test suite . In this paper, we leverage the developer’s familiarity with test cases amplified from existing, manually written developer tests .…

## Enel Context Aware Dynamic Scaling of Distributed Dataflow Jobs using Graph Propagation

Enel is a novel dynamic scaling approach that uses messagepropagation on an attributed graph to model dataflow jobs and, thus, allows forderiving effective rescaling decisions . Enel incorporates descriptiveproperties that capture the respective execution context, considers statisticsfrom individual dataflow tasks, and propagates predictions through the jobgraph to eventually find an optimized new scale-out .…

## A Typed Programmatic Interface to Contracts on the Blockchain

Smart contract applications on the blockchain can only reach their fullpotential if they integrate seamlessly with traditional software systems via aprogrammatic interface . This interface should provide for originating andinvoking contracts as well as observing the state of the blockchain .…

## 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 .…

## 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 .…

## CharmFL A Fault Localization Tool for Python

Fault localization is one of the most time-consuming and error-prone parts of software debugging . The tool employsSpectrum-based fault localization (SBFL) to help Python developers analyze their programs and generate useful data at run-time to beused, then to produce a ranked list of potentially faulty program elements .…

## 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 .…

## Towards a Methodology for Participant Selection in Software Engineering Experiments A Vision of the Future

Software Engineering (SE) researchers extensively perform experiments with human subjects . Well-defined samples are required to ensure validity . Samples are selected by either by purpose or by convenience, limiting the generalizability of results . We outline a new selectionmethodology, by defining the characteristics of the desired population, .…

## Relational Hypersequent S4 and B are Cut Free Hypersequent Incomplete

We show that relational hypersequent K4, S4, KB and RB are cut-free hypersequent incomplete . In addition, the former two are also cut free sequent and formula incomplete .…