Source code is an intermediary through which humans communicate with computer systems. It contains a large amount of domain knowledge which can be learned by statistical models. Furthermore, this knowledge can be used...
详细信息
With the rapid development of cloud computing, more and more complicated services are deployed on the cloud. The frequent communication between services places a great burden on the network of the data center and lead...
详细信息
Entity alignment (EA) is to match entities referring to identical real-world facts among different knowledge graphs (KGs). For simplicity, most previous work ignores the existence of dangling entities in the source KG...
详细信息
Among different electromagnetic spectrum monitoring tasks, a fundamental one is detecting the presence of weak communication signal under non-cooperative setting. Various detection methods have been studied in the lit...
详细信息
Due to the significance and complexity of rail surface quality inspections on production lines, manual completion is inefficient. Existing 3D vision techniques, such as stereo vision, are too complex and cumbersome fo...
详细信息
In multiobjective optimization, the R2 indicator is widely used for designing indicator-based algorithms, and the Tchebycheff approach is commonly employed in decomposition-based algorithms. Despite their wide use, th...
详细信息
In multiobjective optimization, the R2 indicator is widely used for designing indicator-based algorithms, and the Tchebycheff approach is commonly employed in decomposition-based algorithms. Despite their wide use, the connection between these two different paradigms is still not well understood, particularly in the field of multiobjective efficient global optimization (MOEGO). Considering that expected improvement (EI) is a cornerstone in efficient global optimization, this paper first studies the relationship between R2-based EI and Tchebycheff-based EI. Then, we introduce a Many-to-Few (M2F) decomposition framework, offering a new perspective for linking the R2-based method and the Tchebycheff decomposition approach. By incorporating M2F decomposition into MOEGO, a new algorithm called R2/D-EGO is proposed. At each iteration, R2/D-EGO utilizes the Tchebycheff decomposition paradigm to generate a set of candidate solutions, each one corresponding to a different weight vector. Subsequently, a subset of query points is selected from the candidates based on the lower bound of R2-based EI. Empirical results indicate that the proposed R2/D-EGO is highly competitive in comparison with both R2-based and decomposition-based MOEGO algorithms in the parallel (or batch) setting. IEEE
With the continuous evolution of AI-generated images, the generalized detection of them has become a crucial aspect of AI security. Existing detectors have focused on cross-generator generalization, while it remains u...
As stated by the United Arab Emirates's (UAE) Community Development Authority (CDA), there are around 3,065 individuals with hearing disabilities in the country. These individuals often struggle to communicate wit...
详细信息
With the rapid progress in quantum hardware and software, the need for verification of quantum systems becomes increasingly crucial. While model checking is a dominant and very successful technique for verifying class...
详细信息
In this paper, we investigate the fundamental laws of quantum programming. We extend a comprehensive set of Hoare et al.’s basic laws of classical programming to the quantum setting. These laws characterise the algeb...
详细信息
暂无评论