相关论文: Calculating Valid Domains for BDD-Based Interactiv…
We calculate the degree of the algebra of covariants $\mathcal{C}_d$ for binary $d$-form. Also, for the degree we obtain its integral representation and asymptotic behavior.
The configuration database is one of the vital systems in the BaBar on-line system. It provides services for the different parts of the data acquisition system and control system, which require run-time parameters. The original design and…
Web Services provide interoperable mechanisms for describing, locating and invoking services over the Internet; composition further enables to build complex services out of simpler ones for complex B2B applications. While current studies on…
We develop a theory of Valuation Hilbert Modules and prove a version of Beurling's theorem for these. Then we apply our version of Beurling's theorem to obtain complete descriptions of the closed invariant subspaces of a number of Hilbert…
This paper discusses a Domain Specific Language (DSL) that has been developed to enable implementation of concepts of discrete mathematics. A library of data types and functions provides functionality which is frequently required by users.…
Most current planners assume complete domain models and focus on generating correct plans. Unfortunately, domain modeling is a laborious and error-prone task. While domain experts cannot guarantee completeness, often they are able to…
Let $D$ be an integral domain. Then $D$ is an almost valuation (AV-)domain if for $a, b\in D\setminus \{0\}$ there exists a natural number $n$ with $a^{n}\mid b^{n}$ or $b^{n}\mid a^{n}$. AV-domains are closely related to valuation domains,…
In this paper, we present an algorithm to compute a basis of the space of algebraic modular forms on the maximal order of the definite quaternion algebra of discriminant $2$, and provide a database of such bases. One of our motivations is…
Existing calibration algorithms address the problem of covariate shift via unsupervised domain adaptation. However, these methods suffer from the following limitations: 1) they require unlabeled data from the target domain, which may not be…
We study the geometry of convex optimization problems given in a Domain-Driven form and categorize possible statuses of these problems using duality theory. Our duality theory for the Domain-Driven form, which accepts both conic and…
The use of Domain-Specific Languages (DSLs) is a promising field for the development of tools tailored to specific problem spaces, effectively diminishing the complexity of hand-made software. With the goal of making models as precise,…
We generalize the classical calculus rules satisfied by functions of bounded variation to the framework of RCD spaces. In the infinite dimensional setting we are able to define an analogue of the distributional differential and on finite…
We introduce new algorithms and provide example constructions of stabilizer models for the gapped boundaries, domain walls, and $0D$ defects of Abelian composite-dimensional twisted quantum doubles. Using the physically intuitive concept of…
A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers. A labelled tableau system is…
Probabilistic powerdomain in domain theory plays an important role in modeling the semantics of nondeterministic functional programming languages with probabilistic choice. In this paper, we extend the notion of powerdomain to directed…
Domain generalization aims to learn a model with good generalization ability, that is, the learned model should not only perform well on several seen domains but also on unseen domains with different data distributions. State-of-the-art…
Though many safety-critical software systems use floating point to represent real-world input and output, programmers usually have idealized versions in mind that compute with real numbers. Significant deviations from the ideal can cause…
This paper discusses the extension of the Prototype Verification System (PVS) sub-theory for rings, part of the PVS algebra theory, with theorems related to the division algorithm for Euclidean rings and Unique Factorization Domains that…
Quantum computations are expressed in general as quantum circuits, which are specified by ordered lists of quantum gates. The resulting specifications are used during the optimisation and execution of the expressed computations. However,…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…