Related papers: The Theory of Multiple Peeling
Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…
The analysis of several algorithms and data structures can be framed as a peeling process on a random hypergraph: vertices with degree less than k and their adjacent edges are removed until no vertices of degree less than k are left. Often…
The paper outlines novel variational technique for finding microstructures of optimal multimaterial composites, bounds of composites properties, and multimaterial optimal designs. The translation method that is used for the exact…
A geometrically nonlinear continuum mechanical theory is formulated for deformation and failure behaviors of amorphous polymers. The model seeks to capture material response over a range of loading rates, temperatures, and stress states…
We study fluid-induced deformation and fracture of cohesive granular media, and apply photoporomechanics to uncover the underpinning grain-scale mechanics. We fabricate photoelastic spherical particles of diameter d=2mm, and make a…
In order to study real-world systems, many applied works model them through signed graphs, i.e. graphs whose edges are labeled as either positive or negative. Such a graph is considered as structurally balanced when it can be partitioned…
In this work, we try to address the challenging problem of dimple detection and segmentation in Titanium alloys using machine learning methods, especially neural networks. The images i.e. fractographs are obtained using a Scanning Election…
When modelling discontinuities (interfaces) using the finite element method, the standard approach is to use a conforming finite-element mesh in which the mesh matches the interfaces. However, this approach can prove cumbersome if the…
The minimum convex cover problem seeks to cover a polygon $P$ with the fewest convex polygons that lie within $P$. This problem is $\exists\mathbb R$-complete, and the best previously known algorithm, due to Eidenbenz and Widmayer (2001),…
We consider two stacked ultra-thin layers of different liquids on a solid substrate. Using long-wave theory, we derive coupled evolution equations for the free liquid-liquid and liquid-gas interfaces. Linear and non-linear analyses show…
For more than a decade, graphs have been used to model the voting behavior taking place in parliaments. However, the methods described in the literature suffer from several limitations. The two main ones are that 1) they rely on some…
A general class of nonconvex optimization problems is considered, where the penalty is the composition of a linear operator with a nonsmooth nonconvex mapping, which is concave on the positive real line. The necessary optimality condition…
A concise method for following the evolving geometry of a moving surface using Lagrangian coordinates is described. All computations can be done in the fixed geometry of the initial surface despite the evolving complexity of the moving…
We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under the infinite all-layers model introduced by [Akitaya et al., 2017], in which each simple fold is defined by an…
Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph with bounded overlap, we may look to add or delete few edges to uncover the cluster…
Two successful approaches for the segmentation of biomedical images are (1) the selection of segment candidates from a merge-tree, and (2) the clustering of small superpixels by solving a Multi-Cut problem. In this paper, we introduce a…
We extend the peeling exploration introduced in arxiv:1506.01590 to the setting of Boltzmann planar maps coupled to a rigid $O(n)$ loop model. Its law is related to a class of discrete Markov processes obtained by confining random walks to…
We present a Virtual Element Method (VEM) for possibly nonlinear elastic and inelastic problems, mainly focusing on a small deformation regime. The numerical scheme is based on a low-order approximation of the displacement field, as well as…
The classical multi-set split feasibility problem seeks a point in the intersection of finitely many closed convex domain constraints, whose image under a linear mapping also lies in the intersection of finitely many closed convex range…
The problem of the reflectance of a photon by a metallic mirror whose position is treated quantum mechanically is considered. The interaction between the metallic surface and the light is treated classically. It is shown that the…