Related papers: Operations on Fuzzy Incidence Graphs and Strong In…
In computer vision tasks, features often come from diverse representations, domains (e.g., indoor and outdoor), and modalities (e.g., text, images, and videos). Effectively fusing these features is essential for robust performance,…
This study leverages the data representation capability of fuzzy based membership-mappings for practical secure distributed deep learning using fully homomorphic encryption. The impracticality issue of secure machine (deep) learning with…
A graph is an efficient open (resp.\ closed) domination graph if there exists a subset of vertices whose open (resp.\ closed) neighborhoods partition its vertex set. Graphs that are efficient open as well as efficient closed (shortly EOCD…
We introduce a general purpose algorithm for rapidly computing certain types of oscillatory integrals which frequently arise in problems connected to wave propagation and general hyperbolic equations. The problem is to evaluate numerically…
Conditional image generation (CIG) is a widely studied problem in computer vision and machine learning. Given a class, CIG takes the name of this class as input and generates a set of images that belong to this class. In existing CIG works,…
Aiming at the group decision - making problem with multi - objective attributes, this study proposes a group decision - making system that integrates fuzzy inference and Bayesian network. A fuzzy rule base is constructed by combining…
A major challenge in causal discovery from observational data is the absence of perfect interventions, making it difficult to distinguish causal features from spurious ones. We propose an innovative approach, Feature Matching Intervention…
A vertex set $D$ in a finite undirected graph $G$ is an efficient dominating set (e.d.s. for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$. The Efficient Domination (ED) problem, which asks for the existence…
The transportation of sensitive equipment often suffers from vibrations caused by terrain, weather, and motion speed, leading to inefficiencies and potential damage. To address this challenge, this paper explores an intelligent control…
In this paper we compare three different architectures for the evaluation of influence diagrams: HUGIN, Shafer-Shenoy, and Lazy Evaluation architecture. The computational complexity of the architectures are compared on the LImited Memory…
The Grundy domination number of a simple graph $G = (V,E)$ is the length of the longest sequence of unique vertices $S = (v_1, \ldots, v_k)$, $v_i \in V$, that satisfies the property $N[v_i] \setminus \cup_{j=1}^{i-1}N[v_j] \neq \emptyset$…
The study of graph products is a major research topic and typically concerns the term $f(G*H)$, e.g., to show that $f(G*H)=f(G)f(H)$. In this paper, we study graph products in a non-standard form $f(R[G*H]$ where $R$ is a "reduction", a…
Formal methods are widely recognized as a powerful engineering method for the specification, simulation, development, and verification of distributed interactive systems. However, most formal methods rely on a two-valued logic, and are…
We consider the problem of learning causal information between random variables in directed acyclic graphs (DAGs) when allowing arbitrarily many latent and selection variables. The FCI (Fast Causal Inference) algorithm has been explicitly…
While a number of bounds are known on the zero forcing number $Z(G)$ of a graph $G$ expressed in terms of the order of a graph and maximum or minimum degree, we present two bounds that are related to the (upper) total domination number…
Influence maximization (IM) is the problem of finding a seed vertex set which is expected to incur the maximum influence spread on a graph. It has various applications in practice such as devising an effective and efficient approach to…
The need to increase accuracy in detecting sophisticated cyber attacks poses a great challenge not only to the research community but also to corporations. So far, many approaches have been proposed to cope with this threat. Among them,…
The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating…
In a recent paper published in the Journal of Causal Inference, Philip Dawid has described a graphical causal model based on decision diagrams. This article describes how single-world intervention graphs (SWIGs) relate to these diagrams. In…
Nowadays Intrusion Detection System (IDS) which is increasingly a key element of system security is used to identify the malicious activities in a computer system or network. There are different approaches being employed in intrusion…