The assessment of the performance portability of hybrid programming models is based on many unverifiable observations. Drawing from the assessment by knowledgeable analysts, subjective conclusions from unverifiable da...
详细信息
With the rapid development of blockchain technology in the financial sector, the security of blockchain is being put to the test due to an increase in phishing fraud. Therefore, it is essential to study more effective...
详细信息
Multimedia content's surge on the internet has made multimodal relation extraction vital for applications like intelligent search and knowledge graph construction. As a rich source of image-text data, social media...
详细信息
In open-source software and platforms, developers utilize issues to record software failures or propose new features. The title of an issue, which is a mandatory field, should accurately describe the core content in a...
详细信息
Maximal ancestral graph (MAG) is a prevalent graphical model to characterize causal relations in the presence of latent variables including latent confounders and selection variables. Given observational data, only a ...
详细信息
Maximal ancestral graph (MAG) is a prevalent graphical model to characterize causal relations in the presence of latent variables including latent confounders and selection variables. Given observational data, only a Markov equivalence class (MEC) of MAGs is identifiable if without some additional assumptions. Due to this fact, MAG listing, listing all the MAGs in the MEC, is usually demanded in many downstream tasks. To the best of our knowledge, there are no relevant methods for MAG listing other than brute force in the literature. In this paper, we propose the first brute-force-free MAG listing method, by determining the local structures of each vertex recursively. We provide the graphical characterization for each valid local transformation of a vertex, and present sound and complete rules to incorporate the valid local transformation in the presence of latent confounders and selection variables. Based on these components, our method can efficiently output all the MAGs in the MEC with no redundance, that is, every intermediate graph in the recursive process is necessary for the MAG listing task. The empirical analysis demonstrates the superiority of our proposed method on efficiency and effectiveness. Copyright 2024 by the author(s)
Recently the analysis of remotely sensed images has played a vital role in various aspects of research. The current researches ignore the unique prior knowledge in remote sensing images and do not consider exploring t...
详细信息
Quantum algorithms are raising concerns in the field of cryptography all over the world. A growing number of symmetric cryptography algorithms have been attacked in the quantum setting. Type-3 generalized Feistel sche...
详细信息
Quantum algorithms are raising concerns in the field of cryptography all over the world. A growing number of symmetric cryptography algorithms have been attacked in the quantum setting. Type-3 generalized Feistel scheme(GFS) and unbalanced Feistel scheme with expanding functions(UFS-E) are common symmetric cryptography schemes, which are often used in cryptographic analysis and design. We propose quantum distinguishing attacks on Type-3 GFS and UFS-E in the quantum chosen plaintext attack setting. The results of key recovery are better than those based on exhaustive search in the quantum setting.
For medical images, domain shift is a very common phenomenon. To address this issue, researchers have proposed unsupervised domain adaptation and multi-source domain generalization. However, these methods are sometime...
详细信息
software-defined networking (SDN) offers enhanced control over network infrastructure through a central controller, but it remains vulnerable to security threats like DDoS attacks. This paper proposes an automatic att...
详细信息
ChatGPT can improve software engineering (SE) research practices by offering efficient, accessible information analysis, and synthesis based on natural language interactions. However, ChatGPT could bring ethical chall...
详细信息
暂无评论