Related papers: A Category-Theoretic Perspective on Approximation …
In recent years, Deep Neural Networks (DNN) based methods have achieved remarkable performance in a wide range of tasks and have been among the most powerful and widely used techniques in computer vision. However, DNN-based methods are both…
One of the most prominent tools for abstract argumentation is the Dung's framework, AF for short. It is accompanied by a variety of semantics including grounded, complete, preferred and stable. Although powerful, AFs have their…
In this paper, we define concept of approximate fixed point property of a function and a set in intuitionistic fuzzy normed space. Furthermore, we give intuitionistic fuzzy version of some class of maps used in fixed point theory and…
In this letter, a fast Fourier transform (FFT)-enhanced low-complexity super-resolution sensing algorithm for near-field source localization with both angle and range estimation is proposed. Most traditional near-field source localization…
One of us (MEC) developed a hands-on workbook for density-functional theory (DFT) during the summer of 2020. The idea was to have something that could be used to provide practical teaching for students at the Masters or advanced…
Logarithmic conformal field theories are based on vertex algebras with non-semisimple representation categories. While examples of such theories have been known for more than 25 years, some crucial aspects of local logarithmic CFTs have…
These are lecture notes of a course given at the Summer School on Topology and Field Theories held at the Centre for Mathematics of the University of Notre Dame, Indiana, from May 29 to June 2, 2012. The idea of extending quantum field…
We give the generalization of Fractional Analytic Perturbation Theory (FAPT) for QCD observables, recently developed both for the Euclidean and Minkowski regions of squared momentum transfer q^2, which takes into account heavy-quark…
Compatible equations, Singularities of solutions, Topological charges and quasi-charges. PhD thesis (translated frorm Russian). The book shows the sights of Absolute Parallelism (AP), and contains useful information on the problem of…
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…
This paper presents a generalized flux-corrected transport (FCT) algorithm, which is shown to be total variation diminishing under some conditions. The new algorithm has improved properties from the standpoint of use and analysis. Results…
The Minimalist Foundation, for short MF, is a two-level foundation for constructive mathematics ideated by Maietti and Sambin in 2005 and then fully formalized by Maietti in 2009. MF serves as a common core among the most relevant…
Feature Structures (FSs) are a widespread tool used for decompositional frameworks of Attribute-Value associations. Even though they thrive in simple systems, they lack a way of representing higher-order entities and relations. This is…
Mathematicians still use Naive Set Theory when generating sets without danger of producing any contradiction. Therefore their working method can be considered as a consistent inference system with an experience of over 100 years. My…
An accelerated failure time (AFT) model assumes a log-linear relationship between failure times and a set of covariates. In contrast to other popular survival models that work on hazard functions, the effects of covariates are directly on…
Supervised Fine-Tuning (SFT) is the standard paradigm for domain adaptation, yet it frequently incurs the cost of catastrophic forgetting. In sharp contrast, on-policy Reinforcement Learning (RL) effectively preserves general capabilities.…
In the last few years there have been rapid developments in SMT solving for finite fields. These include new decision procedures, new implementations of SMT theory solvers, and new software verifiers that rely on SMT solving for finite…
We study two-dimensional conformal field theories (CFTs) with boundaries via the conformal bootstrap. We derive a positive semi-definite program from crossing symmetry of three observables: the annulus partition function, the two-point…
The accelerated failure time (AFT) model is widely used to analyze relationships between variables in the presence of censored observations. However, this model relies on some assumptions such as the error distribution, which can lead to…
The design of fixed point algorithms is at the heart of monotone operator theory, convex analysis, and of many modern optimization problems arising in machine learning and control. This tutorial reviews recent advances in understanding the…