Results 11 to 20 of about 45,874 (260)
Classification of Multioperations of Rank 2 by E-precomplete Sets
Известия Иркутского государственного университета: Серия "Математика", 2020 In this paper multioperations defined on a two-element set and their closure operator based on composition operator and the equality predicate branching operator is considered. The composition operator is based on union of sets.
V.I. Panteleev, L.V. Ryabets
doaj +1 more source
Fast Line Segment Detection and Large Scene Airport Detection for PolSAR
Remote Sensing, 2022 In this paper, we propose a fast Line Segment Detection algorithm for Polarimetric synthetic aperture radar (PolSAR) data (PLSD). We introduce the Constant False Alarm Rate (CFAR) edge detector to obtain the gradient map of the PolSAR image, which tests ...
Daochang Wang, Qi Liu, Qiang Yin, Fei Ma
doaj +1 more source
FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems [PDF]
Logical Methods in Computer Science, 2016 A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(
Florent Jacquemard +2 more
doaj +1 more source
Efficient Multi-Client Functional Encryption for Conjunctive Equality and Range Queries
IEEE Access, 2022 In multi-client functional encryption (MC-FE) for predicate queries, clients generate ciphertexts of plaintexts $x_{1}, \ldots, x_{n}$ binding with a time period $T$ and store them on a cloud server, and the cloud server receives a function key ...
Kwangsu Lee
doaj +1 more source
Multi-client Predicate-Only Encryption for Conjunctive Equality Tests [PDF]
, 2018 We propose the first multi-client predicate-only encryption scheme capable of efficiently testing the equality of two encrypted vectors. Our construction can be used for the privacy-preserving monitoring of relations among multiple clients. Since both the clients’ data and the predicates are encrypted, our system is suitable for situations in which ...
Tim van de Kamp +3 more
openaire +4 more sources
Известия Иркутского государственного университета: Серия "Математика", 2019 Multioperations are operations from a finite set A to set of all subsets of A. The usual composition operator leads to a continuum of closed sets. Therefore, the research of closure operators, which contain composition and other operations becomes ...
V.I. Panteleev, L. Riabets
doaj +1 more source
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces [PDF]
, 2011 We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of reasoning varies
Kontchakov, Roman +3 more
core +4 more sources
Mathematical foundations of epistemology based on experiments
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2015 The paper deals with basic prerequisites for the development of epistemology, which uses information concerning real experiments in the real world (with real objects).
Sergey M Krylov
doaj +1 more source
A Bounded Domain Property for an Expressive Fragment of First-Order Linear Temporal Logic [PDF]
, 2019 First-Order Linear Temporal Logic (FOLTL) is well-suited to specify infinite-state systems. However, FOLTL satisfiability is not even semi-decidable, thus preventing automated verification. To address this, a possible track is to constrain specifications
Brunel, Julien +2 more
core +4 more sources
A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment [PDF]
, 2017 Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms.
Voigt, Marco
core +3 more sources