Related papers: From axial C-hedra to general P-nets
Recent work has attempted to interpret residual networks (ResNets) as one step of a forward Euler discretization of an ordinary differential equation, focusing mainly on syntactic algebraic similarities between the two systems. Discrete…
We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs. We motivate the choice of our convolutional…
Deep learning has emerged as a compelling framework for scientific and engineering computing, motivating growing interest in neural network-based solvers for partial differential equations (PDEs). Within this landscape, network…
Let C_*(K) denote the cellular chains on the Stasheff associahedra. We construct an explicit combinatorial diagonal \Delta : C_*(K) --> C_*(K) \otimes C_*(K); consequently, we obtain an explicit diagonal on the A_\infty-operad. We apply the…
Cascade is a widely used approach that rejects obvious negative samples at early stages for learning better classifier and faster inference. This paper presents chained cascade network (CC-Net). In this CC-Net, the cascaded classifier at a…
We classify the pairs $(C,G)$ where $C$ is a seminormal curve over an arbitrary field $k$ and $G$ is a smooth connected algebraic group acting faithfully on $C$ with a dense orbit, and we determine the equivariant Picard group of $C$. We…
Let $C$ be an additive category with cokernels and let Mod($C$) be the category of additive functors from $C^{op}$ to the category Ab of abelian groups. Let mod($C$) be the full subcategory of Mod($C$) consisting of coherent functors. In…
The paper studies the generic complex 1-dimensional polynomial vector fields of the form $iP(z)\frac{\partial}{\partial z}$, where $P$ is a polynomial with real coefficients, under topological orbital equivalence preserving the separatrices…
In this paper we introduce the notion of spread net. Spread nets are (safe) Petri nets equipped with vector clocks on places and with ticking functions on transitions, and are such that vector clocks are consistent with the ticking of…
We classify ACM curves contained in a surface of degree d in $\mathbb{P}^{3}$ in terms of weak admissible pairs. In the case of a very general smooth determinantal quartic surface, we provide a geometric description of these curves and…
This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…
We present a discrete theory for modeling developable surfaces as quadrilateral meshes satisfying simple angle constraints. The basis of our model is a lesser known characterization of developable surfaces as manifolds that can be…
We present a geometrical canonical description for superconducting membranes. We consider a general action which includes a general class of superconducting extended objects (strings and domain walls). The description is inspired in the ADM…
In this paper, we propose a categorical embedding discontinuity-capturing shallow neural network for anisotropic elliptic interface problems. The architecture comprises three hidden layers: a discontinuity-capturing layer, which maps domain…
The first goal of this article is to introduce a new type of p-adic reaction-diffusion cellular neural network with delay. We study the stability of these networks and provide numerical simulations of their responses. The second goal is to…
We consider in this paper discrete improper affine spheres based on asymptotic nets. In this context, we distinguish the discrete edges and vertices that must be considered singular. The singular edges can be considered as discrete cuspidal…
Automatic hardhat wearing detection can strengthen the safety management in construction sites, which is still challenging due to complicated video surveillance scenes. To deal with the poor generalization of previous deep learning based…
We study two kinds of generalizations of symmetric block designs to higher dimensions, the so-called $\mathcal{C}$-cubes and $\mathcal{P}$-cubes. For small parameters, all examples up to equivalence are determined by computer calculations.…
A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…
We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…