Related papers: Representations of Stream Processors Using Nested …
We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…
This paper introduces a novel topology, referred to as the star topology, on finite graphs. By treating vertices and edges as points in a unified space, we explore continuous maps between Bare representations of a graph and their…
Graph embedding methods embed the nodes in a graph in low dimensional vector space while preserving graph topology to carry out the downstream tasks such as link prediction, node recommendation and clustering. These tasks depend on a…
Exchangeable random graphs serve as an important probabilistic framework for the statistical analysis of network data. In this work we develop an alternative parameterization for a large class of exchangeable random graphs, where the nodes…
Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…
We present a neural model for representing snippets of code as continuous distributed vectors ("code embeddings"). The main idea is to represent a code snippet as a single fixed-length $\textit{code vector}$, which can be used to predict…
In the present paper we propose a new approach on `distributed systems': the processes are represented through total orders and the communications are characterized by means of biorders. The resulting distributed systems capture situations…
In this paper, we formulate extended stream functions (ESFs) to describe the dynamics of Bose-Einstein condensations in the two-dimensional space. The ordinary stream function is applicable only for stationary and incompressible…
We report on work in progress on 'nested term graphs' for formalizing higher-order terms (e.g. finite or infinite lambda-terms), including those expressing recursion (e.g. terms in the lambda-calculus with letrec). The idea is to represent…
The field of declarative stream programming (discrete time, clocked synchronous, modular, data-centric) is divided between the data-flow graph paradigm favored by domain experts, and the functional reactive paradigm favored by academics. In…
This paper is concerned with the characterizations of fixed points of the generating function of branching processes with countably infinitely many types. We assume each particle of type $i$ can only give offspring of type $j\geq i$, whose…
We propose a novel approach for learning node representations in directed graphs, which maintains separate views or embedding spaces for the two distinct node roles induced by the directionality of the edges. We argue that the previous…
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer. Over finite words, it is a classical result that any rational function is regular, i.e. it can be computed by a deterministic two-way…
We consider two-level finite element discretization methods for the stream function formulation of the Navier-Stokes equations. The two-level method consists of solving a small nonlinear system on the coarse mesh, then solving a linear…
Channel flow, the pressure driven flow between parallel plates, has exact coherent structures that show various degrees of localization. For states which are localized in streamwise direction but extended in spanwise direction, we show that…
We consider fixed boundary flow with canonical interpretability as principal components extended on non-linear Riemannian manifolds. We aim to find a flow with fixed starting and ending points for noisy multivariate data sets lying on an…
In this paper we argue that representing entity properties by tuple attributes, as evangelized in most set-oriented data models, is a controversial method conflicting with the principle of tuple immutability. As a principled solution to…
Recently in [1] a new class of maximal monotone operators has been introduced. In this note we study domain range properties as well as connections with other classes and calculus rules for these operators we called strongly-representable.…
Building meaningful representations of noun compounds is not trivial since many of them scarcely appear in the corpus. To that end, composition functions approximate the distributional representation of a noun compound by combining its…
Dense flow visualization is a popular visualization paradigm. Traditionally, the various models and methods in this area use a continuous formulation, resting upon the solid foundation of functional analysis. In this work, we examine a…