Weakly Durable High Performance Transactions

AciKV is a middle ground between systems that perform fast atomic operations and those that support transactions . This middle ground is useful as it providessimilar performance to the former, while preventing isolation and consistencyanomalies like the latter . Under workloads that involve write requests, AciV exhibits more than two orders of magnitude higher throughput than existing strongly durable systems .…

Ultrafast Neuromorphic Photonic Image Processing with a VCSEL Neuron

Neuromorphic (brain-like) processors are one highly-promising solution to the ever-increasing demand for AI-optimised hardware . The photonic system is combined with a software-implemented spiking neural network yielding a full platform for complex image classification tasks . This work highlights potentials of VCSEL-based platforms for novel, ultrafast, all-optical processors interfacing with current computation and communications systems for use in future light-enabled AI and computer vision functionalities .…

Prolog as a Querying Language for MongoDB

Today’s database systems have shown to be capable of supporting AI applications that demand a lot of data processing . Mongolog is syntactically a subset of Prolog language, and we define its operational semantics through translations into aggregation pipelines . Queries in MongoDBdatabases are represented as sequential stages within an aggregation pipelinewhere each stage defines a transformation of the input data, and passes thetransformed data to the next stage .…

An impossible utopia in distance geometry

The Distance Geometry Problem asks for a realization of a given weightedgraph in $\mathbb{R}^K$ Two variants of this problem, both originating fromprotein conformation, are based on a given vertices . The presence of this constraint allows one to prove, via a combinatorial counting of the number of solutions,that the realization algorithm is fixed-parameter tractable .…

An impossible utopia in distance geometry

The Distance Geometry Problem asks for a realization of a given weightedgraph in $\mathbb{R}^K$ Two variants of this problem, both originating fromprotein conformation, are based on a given vertices . The presence of this constraint allows one to prove, via a combinatorial counting of the number of solutions,that the realization algorithm is fixed-parameter tractable .…

Deep Learning for Principal Agent Mean Field Games

Deep learning algorithm for solving Principal-Agent (PA)mean field games with market-clearing conditions . We use an actor-critic approach to optimization, where the agents form a Nash equilibria according to the principal’s penalty function . The inner problem’s Nashequilibria is obtained using a variant of the deep backward stochasticdifferential equation (BSDE) method modified for McKean-Vlasov forward-backwardSDEs .…

LazySets jl Scalable Symbolic Numeric Set Computations

LazySets.jl is an easy-to-use, general-purpose and scalable library for computations that mix symbolics and numerics . It is the core library of JuliaReach, a cutting-edge software addressing the fundamental problem of reachability analysis . The library was originally designed for reachability and formal verification, but its scope goes beyond such topics .…

Collective eXplainable AI Explaining Cooperative Strategies and Agent Contribution in Multiagent Reinforcement Learning with Shapley Values

Explainable Artificial Intelligence (XAI) is increasingly expandingmore areas of application . Little has been applied to make deep ReinforcementLearning (RL) more comprehensible . This study proposes anovel approach to explain cooperative strategies in multiagent RL using Shapleyvalues . Shapley values are a game theory concept used in XAI that successfully explains therationale behind decisions taken by Machine Learning algorithms .…

Metric Indexing for Graph Similarity Search

A widely-used similarity measure is the graph edit distance, which provides an intuitive notion of similarity . Since its computation is NP-hard, techniques for accelerating similarity search have been studied extensively . We propose a filter-verification framework for similaritysearch, which supports non-uniform edit costs for graphs with arbitrary attributes .…

An impossible utopia in distance geometry

The Distance Geometry Problem asks for a realization of a given weightedgraph in $\mathbb{R}^K$ Two variants of this problem, both originating fromprotein conformation, are based on a given vertices . The presence of this constraint allows one to prove, via a combinatorial counting of the number of solutions,that the realization algorithm is fixed-parameter tractable .…

Behaviour conditioned policies for cooperative reinforcement learning tasks

In various real-world tasks, an agent needs tocooperate with unknown partner agent types . This requires the agent to assessthe behaviour of the partner agent during a cooperative task and to adjust itsown policy to support the cooperation . Deep reinforcement learning models can be trained to deliver the required functionality but are known to suffer from sample inefficiency and slow learning .…

LazySets jl Scalable Symbolic Numeric Set Computations

LazySets.jl is an easy-to-use, general-purpose and scalable library for computations that mix symbolics and numerics . It is the core library of JuliaReach, a cutting-edge software addressing the fundamental problem of reachability analysis . The library was originally designed for reachability and formal verification, but its scope goes beyond such topics .…

An Unconditionally Stable Conformal LOD FDTD Method For Curved PEC Objects and Its Application for EMC Problems

The traditional finite-difference time-domain (FDTD) method is constrained by the Courant-Friedrich-Levy (CFL) condition . By considering the partially filled cells, the proposed CLOD-FDTDmethod can significantly improve the accuracy of the FDTD method . At the same time the proposed methodpreserves unconditional stability, which is analyzed and numerically validatedusing the Von-Neuman method .…

Hypergraph regularity and random sampling

The graph case of the graph case was proved by Alon, Fischer, Newman andShapira . The error term measuring thequasirandomness of the subhypergraphs of $H$ requires only an arbitrarily smalladditive correction . This has applications to combinatorial property testing . We prove that with high probability a large enoughuniform random sample of the vertices of $K$ also admits the same regularityinstance .…

Hypergraph regularity and random sampling

The graph case of the graph case was proved by Alon, Fischer, Newman andShapira . The error term measuring thequasirandomness of the subhypergraphs of $H$ requires only an arbitrarily smalladditive correction . This has applications to combinatorial property testing . We prove that with high probability a large enoughuniform random sample of the vertices of $K$ also admits the same regularityinstance .…

A Survey on Channel Estimation and Practical Passive Beamforming Design for Intelligent Reflecting Surface Aided Wireless Communications

Intelligent reflecting surface (IRS) has emerged as a key enabling technology to realize smart and reconfigurable radio environment for wireless communications . IRS provides a new and cost-effectivemeans to combat the wireless channel impair-ments in a proactive manner . IRS faces new and unique challenges in its efficient integration into wireless communication systems, especially its efficiency and passive beamforming design under various practical hardware constraints .…

Cyclic Implicit Complexity

Circular (or cyclic) proofs have received increasing attention in recent years . Little is known about the complexity theoretic aspects of circular proofs . We introduce a circular proof system based on Bellantoni andCook’s famous safe-normal function algebra . We identify suitable prooftheoretical constraints to characterise the polynomial-time and elementarycomputable functions .…

Weakly Durable High Performance Transactions

AciKV is a middle ground between systems that perform fast atomic operations and those that support transactions . This middle ground is useful as it providessimilar performance to the former, while preventing isolation and consistencyanomalies like the latter . Under workloads that involve write requests, AciV exhibits more than two orders of magnitude higher throughput than existing strongly durable systems .…