Related papers: Atomic Pseudo-Valuation Domains
The creation and justification of the methods for minimax estimation of parameters of the external boundary value problems for the Helmholtz equation in unbounded domains are considered. When observations are distributed in subdomains, the…
In the first section of the present work, we introduce the concept of pseudocomplementation for semirings and show semiring version of some known results in lattice theory. We also introduce semirings with pc-functions and prove some…
The general theory of boundary value problems for linear elliptic wedge operators (on smooth manifolds with boundary) leads naturally, even in the scalar case, to the need to consider vector bundles over the boundary together with general…
Born-Jordan operators are a class of pseudodifferential operators arising as a generalization of the quantization rule for polynomials on the phase space introduced by Born and Jordan in 1925. The weak definition of such operators involves…
In the last decade, G. Bharali and A. Zimmer defined a class of domains called Goldilocks domains and they showed that such a domain satisfies a visibility condition with respect to the Kobayashi extremal curves. Inspired by their…
In this work, we present a novel and effective framework to facilitate object detection with the instance-level segmentation information that is only supervised by bounding box annotation. Starting from the joint object detection and…
Stochastic matrices and positive maps in matrix algebras proved to be very important tools for analysing classical and quantum systems. In particular they represent a natural set of transformations for classical and quantum states,…
Face anti-spoofing (FAS) plays an important role in protecting face recognition systems from face representation attacks. Many recent studies in FAS have approached this problem with domain generalization technique. Domain generalization…
Unsupervised domain adaptation (UDA) methods have been broadly utilized to improve the models' adaptation ability in general computer vision. However, different from the natural images, there exist huge semantic gaps for the nuclei from…
The main result of [HL] (Annals of Math. 102 (1975), 223--290) gives a characterization of the boundaries of complex subvarieties in C^n. An application of this result concerning pseudoconvexity, namely Theorem 10.4 in [HL], is amplified.
We consider pairs of a non-empty compact connected and locally connected Hausdorff space and a real-valued continuous function. Our aim is to measure the difference between this kind of the pairs. In this notes we introduce new…
This monograph is an ongoing revision of "Lectures On A Mathematical Theory of Computation" by Dana Scott. Scott's monograph uses a formulation of domains called neighborhood systems in which finite elements are selected subsets of a master…
We present a detailed motivation for and definition of the contextual values of an observable, which were introduced by Dressel et al. [Phys. Rev. Lett. 104 240401 (2010)]. The theory of contextual values extends the well-established theory…
A commutative monoid is atomic if every non-invertible element factors into irreducibles (also called atoms), while an integral (semi)domain is atomic if its multiplicative monoid is atomic. Notions weaker than atomicity have been…
This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a…
A famous result due to L. S. Levy provides a classification of all finitely generated indecomposable modules over Dedekind-like rings. This motivates us to outline an approach to the classification of indecomposable pseudo-absorbing primary…
Unsupervised domain adaptation is used in many machine learning applications where, during training, a model has access to unlabeled data in the target domain, and a related labeled dataset. In this paper, we introduce a novel and general…
As connected devices multiply and the internet matures into a ubiquitous platform for exchange and communication, the question of what makes a domain name valuable is ever more significant. Due to the scarcity of meaningful vocabulary and…
Positive semidefinite rank (PSD-rank) is a relatively new quantity with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for…
We develop a pseudo-likelihood theory for rank one matrix estimation problems in the high dimensional limit. We prove a variational principle for the limiting pseudo-maximum likelihood which also characterizes the performance of the…