Building Specifications in the Event B Institution

This paper describes a formal semantics for the Event-B specification language using the theory of institutions . We define an institution for the language, EVT, and prove that it meets validity requirements forsatisfaction preservation and model amalgamation . We also present a series offunctions that show how the constructs of the language can be mapped into our institution .…

Large Scale Image Completion via Co Modulated Generative Adversarial Networks

Paired/UnpairedInception Discriminative Score (P-IDS/U-IDS) measures the fidelity of inpainted images compared to real images via linearseparability in a feature space . Code is available at https://github.com/zsyzzsoft/co-mod-gan, available at http://://://www.zsyzsoft/coder-gan.org/p-IDS-du-gan . P-IDS is a generic new approach that bridges the gap between image-conditional and recent modulatedunconditional generative architectures via co-modulation .…

PPT SASMM Scalable Analytical Shared Memory Model Predicting the Performance of Multicore Caches from a Single Threaded Execution Trace

Scalable Analytical Analytical Shared Memory Model (SASMM) can predict performance of parallel applications running on a multicore . SASMM uses aprobabilistic and computationally-efficient method to predict the reusedistance profiles of caches in multicores . The model relies on a stochastic, static, static block-level analysis of reuse profiles .…

Frobenius Numbers and Automatic Sequences

The Frobenius number $g(S)$ of a set $S$ of non-negative integers with $gcd1$ is the largest integer not expressible as a linear combination of elementsof $S$. In this paper we compute $G_{\bf s} (i)$ for some classical automatic sequences: theevil numbers, the odious numbers, and the lower and upper Wythoff sequences .…

Local Computation Algorithms for Coloring of Uniform Hypergraphs

We present progress on local computation algorithms for two coloring of $k$-uniform hypergraphs . We focus on instances that satisfy strengthened assumption of Local Lemma of the form $2^{1-\alpha k} (\Delta+1) e < 1$ We present a procedure that, within similar bounds on running time, solves widerrange of instances by allowing $\alpha$ at most about $0.227$. We discuss how previous works on the subject can be used to obtain an algorithm that worksin polylogarithmic time per query for $0 .139$. …

Enabling OpenMP Task Parallelism on Multi FPGAs

FPGA-based hardware accelerators have received increasing attention mainly due to their ability to accelerate deep pipelined applications . However, programming such architecture is a challenging task . This paper extends the OpenMP task-based computation offloading model to enable a number of FPGAs to work together as a single Multi-FPGA architecture .…

Mode wise Tensor Decompositions Multi dimensional Generalizations of CUR Decompositions

Low rank tensor approximation is a fundamental tool in modern machinelearning and data science . In this paper, we study the characterization,perturbation analysis, and an efficient sampling strategy for two primarytensor CUR approximations, namely Chidori and Fiber CUR . We also present theoretical error bound of the tensor CUR approximation when (adversarial orGaussian) noise appears .…

Adversarial and Contrastive Variational Autoencoder for Sequential Recommendation

Sequential recommendation as an emerging topic has attracted increasing attention due to its important practical significance . Models based on deeplearning and attention mechanism have achieved good performance in sequentialrecommendation . VAE-based models suffer from a common limitation that the representational ability of the obtained approximateposterior distribution is limited, resulting in lower quality of generated samples .…

A systematic association of subgraph counts over a network

We associate all small subgraph counting problems with a systematic graphencoding/representation system . The system can serve as a unified foundation for studying andconnecting many important graph problems in theory and practice . We describe relations among graphlets (graph elements) in rigorous mathematicslanguage and from the perspective of graph encoding .…

Localized Reduced Basis Additive Schwarz Methods

Reduced basis methods build low-rank approximation spaces for the solutionsets of parameterized PDEs by computing solutions of the given PDE for selected snapshot parameters . Localized reduced basis methods reduce the offline cost of computing these snapshot solutions by insteadconstructing a global space from spatially localized less expensive problems .…

An operadic approach to substitution in Lie Butcher series

The paper follows an operadic approach to provide a bialgebraic description of substitution for Lie-Butcher series . We show how the well-known description for substitution in Butcher’s $B$-series can beobtained from the pre-Lie operad . We then apply the same construction to the post-Lieoperad to arrive at a bialgebra $\mathcal{Q}$ .…

On Steady State Evolutionary Algorithms and Selective Pressure Why Inverse Rank Based Allocation of Reproductive Trials is Best

We analyse the impact of the selective pressure for the global optimisationcapabilities of steady-state EAs . For the standard bimodal benchmark function\twomax we rigorously prove that using uniform parent selection leads toexponential runtimes with high probability to locate both optima for the standard ($\mu$+1)~EA and $\mu $1/RLS with any polynomial population sizes .…

EXSCLAIM An automated pipeline for the construction of labeled materials imaging datasets from literature

Material microscopy is experiencing an explosion of published imaging data . The standard publication format is not conducive to large-scale data aggregation oranalysis, hindering data sharing and reuse . We highlight the methodology behind the construction of the EXSCLAIM! Python toolkit for the automatic EXtraction,Separation, and Caption-based natural Language Annotation of IMages from scientific literature.…

Zero Delay Lossy Coding of Linear Vector Markov Sources Optimality of Stationary Codes and Near Optimality of Finite Memory Codes

The structureand existence of deterministic and stationary coding policies that are optimalfor the infinite horizon average cost (distortion) problem is established . Inaddition to existence results, for finite blocklength (horizon) $T$ theperformance of an optimal coding policy is shown to approach the infinite timehorizon optimum at a rate $O(\frac{1}{T)$.…

Multi Robot Dynamical Source Seeking in Unknown Environments

This paper presents an algorithmic framework for the distributed on-linesource seeking, termed as ‘DoSS’, with a multi-robot system in an unknowndynamical environment . The algorithm, building on a novel concept called dummyconfidence upper bound (D-UCB), integrates both estimation of the unknownenvironment and task planning for the multiple robots simultaneously .…

Continuous iterative algorithms for anti Cheeger cut

In this paper, we propose a continuous iterative algorithm for theanti-Cheeger cut problem . It does not need rounding at all and has advantages that allsubproblems have explicit analytic solutions . It can also be easily combined with the maxcut iterations for breaking out of local optima and improving the solution quality .…

Quantum inspired Multimodal Fusion for Video Sentiment Analysis

Mainly based on neural networks, existing approaches largely model multimodal interactions in an implicit and hard-to-understand manner . We address this limitation with inspirations from quantum theory . In our quantum-inspired framework, the wordinteraction within a single modality and the interaction across modalities areformulated with superposition and entanglement respectively at differentstages .…

Trustworthy Transparency by Design

Recent dataprotection legislation tries to tackle these issues, but it is inadequate . Individuals lack oversight over systems that process their data . Wethink the conflict between data protection and increasingly data-based systemsshould be solved differently . This enables their data sovereignty, allowing individuals to benefit from sensible data usage while addressingpotentially harmful consequences of data mis usage .…

Weakly Complete Semantics Based on Undecidedness Blocking

In this paper we introduce a novel family of semantics called weakly completesemantics . The new semantics are conflict-free, non-admissible and employ a weaker notion of admissibility . The semantics are also an example of ambiguity blocking Dunganian semantics and the first semantics totackle the problem of self-defeating attacking arguments .…

A Quasi centralized Collision free Path Planning Approach for Multi Robot Systems

This paper presents a novel quasi-centralized approach for collision-freepath planning of multi-robot systems (MRS) in obstacle-ridden environments . Anew formation potential fields (FPF) concept is proposed around a virtual agent, located at the center of the formation . The path of the virtual agent is centrallyplanned and the robots at the minima of the FPF are forced to move along withthe virtual agent .…

Low complexity dynamic resource scheduling for downlink MC NOMA over fading channels

In this paper, we investigate dynamic resource scheduling for downlink multi-channel non-orthogonalmultiple access (MC-NOMA) systems over time-varying fading channels . We address the weighted average sum rate maximization problem with quality-of-service (QoS) constraints . We also develop a heuristic joint subchannel assignment and power allocation (Joint-SAPA) algorithm with very low computational complexity that solves each subproblem .…

Exploiting Isomorphic Subgraphs in SAT Long version

The two methods are distinct and not compatible . The former prunessolutions, whereas the latter prunes areas of the search that do not have solutions, like standard conflict clauses . Both approaches require what we call \emph{full symmetry, namely apropositionally-consistent mapping between the literals .…