相关论文: Analytic clones

A definable set in a pair (K, k) of algebraically closed fields is co-analyzable relative to the subfield k of the pair if and only if it is almost internal to k. To prove this and some related results for tame pairs of real closed fields…

We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be…

In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…

In this paper we describe an analytic method able to give the multiplication table(s) of the set(s) involved in an $S$-expansion process (with either resonance or $0_S$-resonant-reduction) for reaching a target Lie (super)algebra from a…

In this paper we introduce the concept of completeness of sets. We study this property on the set of integers. We examine how this property is preserved as we carry out various operations compatible with sets. We also introduce the problem…

We consider statistical procedures for hypothesis testing of real valued functionals of matched pairs with missing values. In order to improve the accuracy of existing methods, we propose a novel multiplication combination procedure.…

Binary code representation learning has shown significant performance in binary analysis tasks. But existing solutions often have poor transferability, particularly in few-shot and zero-shot scenarios where few or no training samples are…

We introduce the two substructural propositional logics KL, KL+, which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a…

We present a novel deep-learning-based method to cluster words in documents which we apply to detect and recognize tables given the OCR output. We interpret table structure bottom-up as a graph of relations between pairs of words (belonging…

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…

We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically…

Interpretability is highly desired for deep neural network-based classifiers, especially when addressing high-stake decisions in medical imaging. Commonly used post-hoc interpretability methods have the limitation that they can produce…

We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of originally nonspecific evidence. This methodology is here put in…

Clustering is a popular unsupervised learning tool often used to discover groups within a larger population such as customer segments, or patient subtypes. However, despite its use as a tool for subgroup discovery and description - few…

Cluster analysis methods are used to identify homogeneous subgroups in a data set. In biomedical applications, one frequently applies cluster analysis in order to identify biologically interesting subgroups. In particular, one may wish to…

We address the problem of creating entire and complete maps of software code clones (copy features in data) in a corpus of binary artifacts of unknown provenance. We report on a practical methodology, which employs enhanced suffix data…

Bi-clustering is a useful approach in analyzing biological data when observations come from heterogeneous groups and have a large number of features. We outline a general Bayesian approach in tackling bi-clustering problems in moderate to…

We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.

Binary code clone analysis is an important technique which has a wide range of applications in software engineering (e.g., plagiarism detection, bug detection). The main challenge of the topic lies in the semantics-equivalent code…

In probabilistic cloning with two auxiliary systems, we consider and compare three different protocols for the success probabilities of cloning. We show that, in certain circumstances, it may increase the success probability to add an…