Related papers: Domain closure conditions and definability preserv…
Assessment of the degree of boundedness/stability of multidimensional nonlinear systems with time-dependent and nonperiodic coefficients is an important problem in various applied areas which has no adequate resolution yet. Most of the…
The main objective of this article is to develop a matrix pencil approach for the study of the controllability and reachability of a class of linear singular discrete time systems. The description equation of a practical system may be…
Domain Adaptation is a technique to address the lack of massive amounts of labeled data in unseen environments. Unsupervised domain adaptation is proposed to adapt a model to new modalities using solely labeled source data and unlabeled…
Domain decomposition methods are used for approximate solving boundary problems for partial differential equations on parallel computing systems. Specific features of unsteady problems are taken into account in the most complete way in…
We consider a variational problem with boundary singularity and Dirichlet condition. We give a blow-up analysis for sequences of solutions of an equation with exponential nonlinearity. Also, we derive a compactness criterion under some…
For linear infinite systems the approximate controllability problem by control constraints is considered. Controllability conditions represented via system parameters are obtained. Partial differential control systems and control systems…
The purpose of this work is to find out how different library classification systems and linguistic ontologies arrange a particular domain of interest and what are the limitations for information retrieval. We use knowledge representation…
The pinning phenomena of the domain wall in the presence of exchange bias is studied analytically. The analytic solution of the domain wall spin configuration is presented. Unlike the traditional solution which is symmetric, our new…
We give a simple and more elementary proof that the notions of Domain of Holomorphy and Weak Domain of Holomorphy are equivalent. This proof is based on a combination of Baire's Category Theorem and Montel's Theorem. We also obtain…
We present a domain-theoretic framework for probabilistic programming that provides a constructive definition of conditional probability and addresses computability challenges previously identified in the literature. We introduce a novel…
Machine learning methods can be unreliable when deployed in domains that differ from the domains on which they were trained. There are a wide range of proposals for mitigating this problem by learning representations that are ``invariant''…
The applicability domain refers to the range of data for which the prediction of the predictive model is expected to be reliable and accurate and using a model outside its applicability domain can lead to incorrect results. The ability to…
Concerning the Laplace operator with homogeneous Dirichlet boundary conditions, the classical notion of isospectrality assumes that two domains are related when they give rise to the same spectrum. In two dimensions, non isometric,…
The domain name system (DNS) is an important protocol in today's Internet operation, and is the standard naming convention between domain names, names that are easy to read, understand, and remember by humans, to IP address of Internet…
We study questions of existence and uniqueness of quadrature domains using computational tools from real algebraic geometry. These problems are transformed into questions about the number of solutions to an associated real semi-algebraic…
The manuscript is devoted to the boundary behavior of mappings with bounded and finite distortion. We consider mappings of domains of the Euclidean space that satisfy weighted Poletsky inequality. Assume that, the definition domain is…
Drawing on the previous work on interpolation failure, we show that Beth's definability theorem does not hold for intuitionistic predicate logic of constant domains without identity.
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagation is performed by propagators implementing a certain notion…
Non-closedness of subexponentiality by the convolution operation is well-known. We go a step further and show that subexponentiality and non-subexponentiality are generally changeable by the convolution. We also give several conditions, by…
Literature on Constraint Satisfaction exhibits the definition of several structural properties that can be possessed by CSPs, like (in)consistency, substitutability or interchangeability. Current tools for constraint solving typically…