Related papers: Blurred constitutive laws and bipotential convex c…
With the prevalence of digital cameras, the number of digital images increases quickly, which raises the demand for non-manual image quality assessment. While there are many methods considered useful for detecting blurriness, in this paper…
We prove the multiple cover formula conjecture for abelian surfaces for a large class of insertions, including all stationary invariants. The proof uses the reduced degeneration formula expressing the invariants in terms of the correlated…
Diagrammatic techniques to compute perturbatively the spectral properties of Euclidean Random Matrices in the high-density regime are introduced and discussed in detail. Such techniques are developed in two alternative and very different…
A covariant quantization method for physical systems with reducible constraints is presented.
In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…
Construction of representations of braid group generators from $N$-state vertex models provide an elegant route to study knot and link invariants. Using such a braid group representation, an algebraic formula for the link invariants was put…
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…
We use the theory of the quantum group $U_q(gl(2,\RR))$ in order to develop a quantum theory of invariants and show a decomposition of invariants into a Gordan-Capelli series. Higher binary forms are introduced on the basis of braided…
It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…
In this paper, we discuss the ambiguous chance constrained based portfolio optimization problems, in which the perturbations associated with the input parameters are stochastic in nature, but their distributions are not known precisely. We…
We consider a multiscale approach based on immersed methods for the efficient computational modeling of tissues composed of an elastic matrix (in two or three-dimensions) and a thin vascular structure (treated as a co-dimension two…
When using boundary integral equation methods, we represent solutions of a linear partial differential equation as layer potentials. It is well-known that the approximation of layer potentials using quadrature rules suffer from poor…
Link prediction is critical for the application of incomplete knowledge graph (KG) in the downstream tasks. As a family of effective approaches for link predictions, embedding methods try to learn low-rank representations for both entities…
Bilinear systems emerge in a wide variety of fields as natural models for dynamical systems ranging from robotics to quantum dots. Analyzing controllability of such systems is of fundamental and practical importance, for example, for the…
Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in $\mathbb{R}^4$; including virtual crossings allows for a theory of virtual knotted surfaces and virtual cobordisms. Biquandle counting invariants are…
Variational regularization of ill-posed inverse problems is based on minimizing the sum of a data fidelity term and a regularization term. The balance between them is tuned using a positive regularization parameter, whose automatic choice…
In a non supervised Bayesian estimation approach for inverse problems in imaging systems, one tries to estimate jointly the unknown image pixels $\fb$ and the hyperparameters $\thetab$. This is, in general, done through the joint posterior…
We associate bicomplexes with several integrable models in such a way that conserved currents are obtained by a simple iterative construction. Gauge transformations and dressings are discussed in this framework and several examples are…
We present in this short note a polynomial graph extension procedure that can be used to improve any graph isomorphism algorithm. This construction propagates new constraints from the isomorphism constraints of the input graphs (denoted by…
A new method is proposed for the analysis of specular and off-specular reflectivity from supported lipid bilayers. Both thermal fluctuations and the "static" roughness induced by the substrate are carefully taken into account. Examples from…