Related papers: Interactions Between Brauer Configuration Algebras…
A novel canonical duality theory (CDT) is presented for solving general bilevel mixed integer nonlinear optimization governed by linear and quadratic knapsack problems. It shows that the challenging knapsack problems can be solved…
The concurrent refinement algebra has been developed to support rely/guarantee reasoning about concurrent programs. The algebra supports atomic commands and defines parallel composition as a synchronous operation, as in Milner's SCCS. In…
Bayesian calibration of black-box computer models offers an established framework to obtain a posterior distribution over model parameters. Traditional Bayesian calibration involves the emulation of the computer model and an additive model…
We consider weighted algebras of holomorphic functions on a Banach space. We determine conditions on a family of weights that assure that the corresponding weighted space is an algebra or has polynomial Schauder decompositions. We study the…
We begin with a review of the notion of a braid group. We then discuss some known solutions to decision problems in braid groups. We then move on to proving new results in braid group algorithmics. We offer a quick solution to the…
In order to handle large data sets omnipresent in modern science, efficient compression algorithms are necessary. Here, a Bayesian data compression (BDC) algorithm that adapts to the specific measurement situation is derived in the context…
Here we introduce an improved approach to Variational Quantum Attack Algorithms (VQAA) on crytographic protocols. Our methods provide robust quantum attacks to well-known cryptographic algorithms, more efficiently and with remarkably fewer…
Canonical Correlation Analysis (CCA) and its regularised versions have been widely used in the neuroimaging community to uncover multivariate associations between two data modalities (e.g., brain imaging and behaviour). However, these…
We introduce in a general setting a dynamic programming method for solving reconfiguration problems. Our method is based on contracted solution graphs, which are obtained from solution graphs by performing an appropriate series of edge…
Barycentric coordinates provide solutions to the problem of expressing an element of a compact convex set as a convex combination of a finite number of extreme points of the set. They have been studied widely within the geometric…
Rigged configurations are combinatorial objects prominent in the study of solvable lattice models. Marginally large tableaux are semi-standard Young tableaux of special form that give a realization of the crystals ${\cal B}(\infty)$. We…
We introduce a graphical framework for Bayesian inference that is sufficiently general to accommodate not just the standard case but also recent proposals for a theory of quantum Bayesian inference wherein one considers density operators…
Quantum machine learning is often motivated by the idea that quantum systems can expose useful high-dimensional structure that is difficult to access with classical models. We isolate one central component of this claim: the fixed…
Comparison is a core task in visual analysis. Although there are numerous guidelines to help users design effective visualizations to aid known comparison tasks, there are few techniques available when users want to make ad hoc comparisons…
Bayes' rule is widely regarded as the canonical prescription for belief updating. We show, however, that one can arbitrarily preserve pre-specified beliefs while appearing to perform Bayesian updates via "prior hacking": engineering a…
The classical characteristic map associates symmetric functions to characters of the symmetric groups. There are two natural analogues of this map involving the Brauer algebra. The first of them relies on the action of the orthogonal or…
This paper proposes a new block cipher termed as "Modular Arithmetic based Block Cipher with Varying Key-Spaces (MABCVK)" that uses private key-spaces of varying lengths to encrypt data files. There is a simple but intelligent use of theory…
Deep generative systems that learn probabilistic models from a corpus of existing music do not explicitly encode knowledge of a musical style, compared to traditional rule-based systems. Thus, it can be difficult to determine whether deep…
The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous…
A notion of rational Baker-Akhiezer (BA) function related to a configuration of hyperplanes in C^n is introduced. It is proved that BA function exists only for very special configurations (locus configurations), which satisfy certain…