Related papers: Conjugate Function Method and Conformal Mappings i…

An important problem in network analysis is predicting a node attribute using both network covariates, such as graph embedding coordinates or local subgraph counts, and conventional node covariates, such as demographic characteristics.…

This paper describes a computational framework for a grammar architecture in which different linguistic domains such as morphology, syntax, and semantics are treated not as separate components but compositional domains. Word and phrase…

This paper describes a method of calculating the transforms, currently obtained via Fourier and reverse Fourier transforms. The method allows calculating efficiently the transforms of a signal having an arbitrary dimension of the digital…

In this paper we present a combination framework for polynomial complexity analysis of term rewrite systems. The framework covers both derivational and runtime complexity analysis. We present generalisations of powerful complexity…

We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…

Bayesian probabilistic numerical methods are a set of tools providing posterior distributions on the output of numerical methods. The use of these methods is usually motivated by the fact that they can represent our uncertainty due to…

We describe some configurations of conjugate permutations which may be used as a mathematical model of some genetical processes and crystal growth.

Conformal prediction is a framework for uncertainty quantification that constructs prediction sets for previously unseen data, guaranteeing coverage of the true label with a specified probability. However, the efficiency of these prediction…

Variational inference is computationally challenging in models that contain both conjugate and non-conjugate terms. Methods specifically designed for conjugate models, even though computationally efficient, find it difficult to deal with…

The simulation of three dimensional magnetostatic problems plays an important role, for example when simulating synchronous electric machines. Building on prior work that developed a domain decomposition algorithm using isogeometric…

This paper explores the numerical conformal bootstrap in general spacetime dimensions through the lens of a distinct category of analytic functionals, previously employed in two-dimensional studies. We extend the application of these…

New algorithms are presented for numerical conformal mapping based on rational approximations and the solution of Dirichlet problems by least-squares fitting on the boundary. The methods are targeted at regions with corners, where the…

A projective rectangle is like a projective plane that has different lengths in two directions. We develop harmonic conjugation in projective rectangles. We construct projective rectangles in some harmonic matroids (matroids where harmonic…

Many dynamical phenomena display a cyclic behavior, in the sense that time can be partitioned into units within which distributional aspects of a process are homogeneous. In this paper, we introduce a class of models - called conjugate…

The problem of finding a canonical form of complex matrices up to conjugacy with the set of canonical matrices being a union of affine planes in the matrix space is considered. A solution of the problem is given producing a new canonical…

There are relatively few works dealing with conformal prediction for multi-task learning issues, and this is particularly true for multi-target regression. This paper focuses on the problem of providing valid (i.e., frequency calibrated)…

In this paper we give a unified proof of the fact that the Julia set of Newton's method applied to a holomorphic function of the complex plane (a polynomial of degree large than $1$ or an entire transcendental function) is connected. The…

A second mapping method is introduced in the generalized discrete singular convolution algorithm. The mapping approaches are adopted to regularize singularities for one electron system. The applications of the two mapping methods are…

Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…

In the fields of image restoration and image fusion, model-driven methods and data-driven methods are the two representative frameworks. However, both approaches have their respective advantages and disadvantages. The model-driven methods…