Partial maximum satisfiability(PMS) is a significant generalization of Boolean satisfiability(SAT) and maximum satisfiability(MaxSAT), by introducing hard clauses and soft clauses. Compared with SAT and MaxSAT, the PM...
详细信息
Partial maximum satisfiability(PMS) is a significant generalization of Boolean satisfiability(SAT) and maximum satisfiability(MaxSAT), by introducing hard clauses and soft clauses. Compared with SAT and MaxSAT, the PMS problem has more real-world applications where both hard and soft constraints are involved. Local search is an effective incomplete method for solving PMS and is useful for important domains where good-quality solutions are desired within reasonable *** local search PMS solvers, the approach for initial assignment generation is crucial because its effectiveness significantly affects practical performance. In this study, we propose a novel initial assignment prediction approach, called InitPMS. When predicting an assignment for PMS, InitPMS considers the specific structure of PMS instances, i.e., distinguishing hard and soft clauses. Our experiments on extensive PMS instances from MaxSAT evaluations(MSEs) 2020 and 2021 show that InitPMS significantly boosts the performance of five state-of-the-art local search PMS solvers, demonstrating its generality. In addition,our results indicate that incorporating InitPMS could improve the performance of one of the best incomplete PMS solvers in MaxSAT Evaluation 2021, indicating that InitPMS might help advance the state of the art in PMS solving.
Although ray tracing produces high-fidelity, realistic images, it is considered computationally burdensome when implemented on a high rendering rate system. Perception-driven rendering techniques generate images with ...
详细信息
Although ray tracing produces high-fidelity, realistic images, it is considered computationally burdensome when implemented on a high rendering rate system. Perception-driven rendering techniques generate images with minimal noise and distortion that are generally acceptable to the human visual system, thereby reducing rendering costs. In this paper, we introduce a perception-entropy-driven temporal reusing method to accelerate real-time ray tracing. We first build a just noticeable difference(JND) model to represent the uncertainty of ray samples and image space masking effects. Then, we expand the shading gradient through gradient max-pooling and gradient filtering to enlarge the visual receipt field. Finally, we dynamically optimize reusable time segments to improve the accuracy of temporal reusing. Compared with Monte Carlo ray tracing, our algorithm enhances frames per second(fps) by 1.93× to 2.96× at 8 to 16 samples per pixel, significantly accelerating the Monte Carlo ray tracing process while maintaining visual quality.
Recently,weak supervision has received growing attention in the field of salient object detection due to the convenience of ***,there is a large performance gap between weakly supervised and fully supervised salient o...
详细信息
Recently,weak supervision has received growing attention in the field of salient object detection due to the convenience of ***,there is a large performance gap between weakly supervised and fully supervised salient object detectors because the scribble annotation can only provide very limited foreground/background ***,an intuitive idea is to infer annotations that cover more complete object and background regions for *** this end,a label inference strategy is proposed based on the assumption that pixels with similar colours and close positions should have consistent ***,k-means clustering algorithm was first performed on both colours and coordinates of original annotations,and then assigned the same labels to points having similar colours with colour cluster centres and near coordinate cluster ***,the same annotations for pixels with similar colours within each kernel neighbourhood was set *** experiments on six benchmarks demonstrate that our method can significantly improve the performance and achieve the state-of-the-art results.
Low earth orbit(LEO) satellite edge computing can overcome communication difficulties in harsh environments, which lack the support of terrestrial communication infrastructure. It is an indispensable option for achiev...
详细信息
Low earth orbit(LEO) satellite edge computing can overcome communication difficulties in harsh environments, which lack the support of terrestrial communication infrastructure. It is an indispensable option for achieving worldwide wireless communication coverage in the future. To improve the quality-of-service(QoS) for Internet-of-things(IoT) devices, we combine LEO satellite edge computing and ground communication systems to provide network services for IoT devices in harsh environments. We study the QoS-aware computation offloading(QCO) problem for IoT devices in LEO satellite edge computing. Then we investigate the computation offloading strategy for IoT devices that can minimize the total QoS cost of all devices while satisfying multiple constraints, such as the computing resource constraint, delay constraint, and energy consumption constraint. We formulate the QoSaware computation offloading problem as a game model named QCO game based on the non-cooperative competition game among IoT devices. We analyze the finite improvement property of the QCO game and prove that there is a Nash equilibrium for the QCO game. We propose a distributed QoS-aware computation offloading(DQCO) algorithm for the QCO game. Experimental results show that the DQCO algorithm can effectively reduce the total QoS cost of IoT devices.
Dialogue-based relation extraction(DialogRE) aims to predict relationships between two entities in dialogue. Current approaches to dialogue relationship extraction grapple with long-distance entity relationships in di...
详细信息
Dialogue-based relation extraction(DialogRE) aims to predict relationships between two entities in dialogue. Current approaches to dialogue relationship extraction grapple with long-distance entity relationships in dialogue data as well as complex entity relationships, such as a single entity with multiple types of connections. To address these issues, this paper presents a novel approach for dialogue relationship extraction termed the hypergraphs and heterogeneous graphs model(HG2G). This model introduces a two-tiered structure, comprising dialogue hypergraphs and dialogue heterogeneous graphs, to address the shortcomings of existing methods. The dialogue hypergraph establishes connections between similar nodes using hyper-edges and utilizes hypergraph convolution to capture multi-level features. Simultaneously, the dialogue heterogeneous graph connects nodes and edges of different types, employing heterogeneous graph convolution to aggregate cross-sentence information. Ultimately, the integrated nodes from both graphs capture the semantic nuances inherent in dialogue. Experimental results on the DialogRE dataset demonstrate that the HG2G model outperforms existing state-of-the-art methods.
Data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er soun...
详细信息
Data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er sound race ***,this constraint-based approach has serious limitations on helping programmers analyze and understand data ***,it may report a large number of false positives due to the unrecognized dataflow propa-gation of the ***,it recommends a wide range of thread context switches to schedule the reported race(in-cluding the false one)whenever this race is exposed during the constraint-solving *** ad hoc recommendation imposes too many context switches,which complicates the data race *** address these two limitations in the state-of-the-art constraint-based race detection,this paper proposes DFTracker,an improved constraint-based race detec-tor to recommend each data race with minimal thread context ***,we reduce the false positives by ana-lyzing and tracking the dataflow in the *** this means,DFTracker thus reduces the unnecessary analysis of false race *** further propose a novel algorithm to recommend an effective race schedule with minimal thread con-text switches for each data *** experimental results on the real applications demonstrate that 1)without removing any true data race,DFTracker effectively prunes false positives by 68%in comparison with the state-of-the-art constraint-based race detector;2)DFTracker recommends as low as 2.6-8.3(4.7 on average)thread context switches per data race in the real world,which is 81.6%fewer context switches per data race than the state-of-the-art constraint based race ***,DFTracker can be used as an effective tool to understand the data race for programmers.
The slow development of traditional computing has prompted the search for new materials to replace silicon-based computers. Bio-computers, which use molecules as the basis of computation, are highly parallel and infor...
详细信息
The slow development of traditional computing has prompted the search for new materials to replace silicon-based computers. Bio-computers, which use molecules as the basis of computation, are highly parallel and information capable, attracting a lot of attention. In this study, we designed a NAND logic gate based on the DNA strand displacement mechanism. We assembled a molecular calculation model, a 4-wire-2-wire priority encoder logic circuit, by cascading the proposed NAND gates. Different concentrations of input DNA chains were added into the system, resulting in corresponding output, through DNA hybridization and strand displacement. Therefore, it achieved the function of a priority encoder. Simulation results verify the effectiveness and accuracy of the molecular NAND logic gate and the priority coding system presented in this study. The unique point of this proposed circuit is that we cascaded only one kind of logic gate, which provides a beneficial exploration for the subsequent development of complex DNA cascade circuits and the realization of the logical coding function of information.
As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention...
详细信息
As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.
Current methods for Music Emotion Recognition (MER) face challenges in effectively extracting features sensitive to emotions, especially those rich in temporal detail. Moreover, the narrow scope of music-related modal...
详细信息
Constructing an effective common latent embedding by aligning the latent spaces of cross-modal variational autoencoders(VAEs) is a popular strategy for generalized zero-shot learning(GZSL). However, due to the lac...
详细信息
Constructing an effective common latent embedding by aligning the latent spaces of cross-modal variational autoencoders(VAEs) is a popular strategy for generalized zero-shot learning(GZSL). However, due to the lack of fine-grained instance-wise annotations, existing VAE methods can easily suffer from the posterior collapse problem. In this paper, we propose an innovative asymmetric VAE network by aligning enhanced feature representation(AEFR) for GZSL. Distinguished from general VAE structures, we designed two asymmetric encoders for visual and semantic observations and one decoder for visual reconstruction. Specifically, we propose a simple yet effective gated attention mechanism(GAM) in the visual encoder for enhancing the information interaction between observations and latent variables, alleviating the possible posterior collapse problem effectively. In addition, we propose a novel distributional decoupling-based contrastive learning(D2-CL) to guide learning classification-relevant information while aligning the representations at the taxonomy level in the latent representation space. Extensive experiments on publicly available datasets demonstrate the state-of-the-art performance of our method. The source code is available at https://***/seeyourmind/AEFR.
暂无评论