Micro Expression (ME) is the subtle facial expressions that people show when they express their inner feelings. To address the problem that micro-expression recognition is difficult and less accurate due to the small ...
详细信息
In Weighted Model Counting(WMC),we assign weights to literals and compute the sum of the weights of the models of a given propositional formula where the weight of an assignment is the product of the weights of its **...
详细信息
In Weighted Model Counting(WMC),we assign weights to literals and compute the sum of the weights of the models of a given propositional formula where the weight of an assignment is the product of the weights of its *** current WMC solvers work on Conjunctive Normal Form(CNF)***,CNF is not a natural representation for human-being in many *** by the stronger expressive power of Pseudo-Boolean(PB)formulas than CNF,we propose to perform WMC on PB *** on a recent dynamic programming algorithm framework called ADDMC for WMC,we implement a weighted PB counting tool *** compare PBCounter with the state-of-the-art weighted model counters SharpSAT-TD,ExactMC,D4,and ADDMC,where the latter tools work on CNF with encoding methods that convert PB constraints into a CNF *** experiments on three domains of benchmarks show that PBCounter is superior to the model counters on CNF formulas.
Road traffic safety can decrease when drivers drive in a low-visibility *** application of visual perception technology to detect vehicles and pedestrians in infrared images proves to be an effective means of reducing...
详细信息
Road traffic safety can decrease when drivers drive in a low-visibility *** application of visual perception technology to detect vehicles and pedestrians in infrared images proves to be an effective means of reducing the risk of *** tackle the challenges posed by the low recognition accuracy and the substan-tial computational burden associated with current infrared pedestrian-vehicle detection methods,an infrared pedestrian-vehicle detection method A proposal is presented,based on an enhanced version of You Only Look Once version 5(YOLOv5).First,A head specifically designed for detecting small targets has been integrated into the model to make full use of shallow feature information to enhance the accuracy in detecting small ***,the Focal Generalized Intersection over Union(GIoU)is employed as an alternative to the original loss function to address issues related to target overlap and category ***,the distribution shift convolution optimization feature extraction operator is used to alleviate the computational burden of the model without significantly compromising detection *** test results of the improved algorithm show that its average accuracy(mAP)reaches 90.1%.Specifically,the Giga Floating Point Operations Per second(GFLOPs)of the improved algorithm is only *** contrast,the improved algorithms outperformed the other algorithms on similar GFLOPs,such as YOLOv6n(11.9),YOLOv8n(8.7),YOLOv7t(13.2)and YOLOv5s(16.0).The mAPs that are 4.4%,3%,3.5%,and 1.7%greater than those of these algorithms show that the improved algorithm achieves higher accuracy in target detection tasks under similar computational resource *** the other hand,compared with other algorithms such as YOLOv8l(91.1%),YOLOv6l(89.5%),YOLOv7(90.8%),and YOLOv3(90.1%),the improved algorithm needs only 5.5%,2.3%,8.6%,and 2.3%,respectively,of the *** improved algorithm has shown significant advancements in balancing accuracy and computati
Numerous high-performance updatable learned indexes have recently been designed to support the writing requirements in practical systems. Researchers have proposed various strategies to improve the availability of upd...
详细信息
Genealogical knowledge graphs depict the relationships of family networks and the development of family histories. They can help researchers to analyze and understand genealogical data, search for genealogical descend...
详细信息
Cross-network node classification aims to train a classifier for an unlabeled target network using a source network with rich labels. In applications, the degree of nodes mostly conforms to the long-tail distribution,...
详细信息
Cross-network node classification aims to train a classifier for an unlabeled target network using a source network with rich labels. In applications, the degree of nodes mostly conforms to the long-tail distribution, i.e., most nodes in the network are tail nodes with sparse neighborhoods. The established methods focus on either the discrepancy cross network or the long tail in a single network. As for the cross-network node classification under long tail, the coexistence of sparsity of tail nodes and the discrepancy cross-network challenges existing methods for long tail or methods for the cross-network node classification. To this end, a multicomponent similarity graphs for cross-network node classification (MS-CNC) is proposed in this article. Specifically, in order to address the sparsity of the tail nodes, multiple component similarity graphs, including attribute and structure similarity graphs, are constructed for each network to enrich the neighborhoods of the tail nodes and alleviate the long-tail phenomenon. Then, multiple representations are learned from the multiple similarity graphs separately. Based on the multicomponent representations, a two-level adversarial model is designed to address the distribution difference across networks. One level is used to learn the invariant representations cross network in view of structure and attribute components separately, and the other level is used to learn the invariant representations in view of the fused structure and attribute graphs. Extensive experimental results show that the MS-CNC outperforms the state-of-the-art methods. Impact Statement-Node classification is an important task in graph mining. With the unavailability of labels, some researchers propose cross-network node classification, using one labeled network to assist the node classification of another unlabeled network. However, the long-tail of nodes leads to unsatisfactory performance and challenges the recent cross-network node classification m
The rapid advancements in autonomous driving technology necessitate the extensive deployment of automotive radars operating within the 77-81 GHz millimeter-wave band in the forthcoming years. In contrast to earlier Fr...
详细信息
Local differential privacy(LDP),which is a technique that employs unbiased statistical estimations instead of real data,is usually adopted in data collection,as it can protect every user’s privacy and prevent the lea...
详细信息
Local differential privacy(LDP),which is a technique that employs unbiased statistical estimations instead of real data,is usually adopted in data collection,as it can protect every user’s privacy and prevent the leakage of sensitive *** segment pairs method(SPM),multiple-channel method(MCM)and prefix extending method(PEM)are three known LDP protocols for heavy hitter identification as well as the frequency oracle(FO)problem with large ***,the low scalability of these three LDP algorithms often limits their ***,communication and computation strongly affect their ***,excessive grouping or sharing of privacy budgets makes the results *** address the abovementioned problems,this study proposes independent channel(IC)and mixed independent channel(MIC),which are efficient LDP protocols for FO with a large *** design a flexible method for splitting a large domain to reduce the number of ***,we employ the false positive rate with interaction to obtain an accurate *** experiments demonstrate that IC outperforms all the existing solutions under the same privacy guarantee while MIC performs well under a small privacy budget with the lowest communication cost.
Latent Dirichlet allocation(LDA)is a topic model widely used for discovering hidden semantics in massive text *** Gibbs sampling(CGS),as a widely-used algorithm for learning the parameters of LDA,has the risk of priva...
详细信息
Latent Dirichlet allocation(LDA)is a topic model widely used for discovering hidden semantics in massive text *** Gibbs sampling(CGS),as a widely-used algorithm for learning the parameters of LDA,has the risk of privacy ***,word count statistics and updates of latent topics in CGS,which are essential for parameter estimation,could be employed by adversaries to conduct effective membership inference attacks(MIAs).Till now,there are two kinds of methods exploited in CGS to defend against MIAs:adding noise to word count statistics and utilizing inherent *** two kinds of methods have their respective *** sampled from the Laplacian distribution sometimes produces negative word count statistics,which render terrible parameter estimation in *** inherent privacy could only provide weak guaranteed privacy when defending against *** is promising to propose an effective framework to obtain accurate parameter estimations with guaranteed differential *** key issue of obtaining accurate parameter estimations when introducing differential privacy in CGS is making good use of the privacy budget such that a precise noise scale is *** is the first time that R′enyi differential privacy(RDP)has been introduced into CGS and we propose RDP-LDA,an effective framework for analyzing the privacy loss of any differentially private ***-LDA could be used to derive a tighter upper bound of privacy loss than the overestimated results of existing differentially private CGS obtained byε-*** RDP-LDA,we propose a novel truncated-Gaussian mechanism that keeps word count statistics *** we propose distribution perturbation which could provide more rigorous guaranteed privacy than utilizing inherent *** validate that our proposed methods produce more accurate parameter estimation under the JS-divergence metric and obtain lower precision and recall when defending against MIAs.
Bidirectional encoder representations from transformers(BERT) gives full play to the advantages of the attention mechanism, improves the performance of sentence representation, and provides a better choice for various...
详细信息
Bidirectional encoder representations from transformers(BERT) gives full play to the advantages of the attention mechanism, improves the performance of sentence representation, and provides a better choice for various natural language understanding(NLU)tasks. Many methods using BERT as the pre-trained model achieve state-of-the-art performance in almost various text classification scenarios. Among them, the multitask learning framework combining the negative supervision and the pre-trained model solves the issue of the model performance degradation that occurs as the semantic similarity of texts conflicts with the classification standards. The current model does not consider the degree of difference between labels, which leads to insufficient difference information learned by the model, and affects classification performance, especially in the rating classification tasks. On the basis of the multi-task learning model, this paper fully considers the degree of difference between labels, which is expressed by using weights to solve the above problems. We supervise negative samples on the classifier layer instead of the encoder layer, so that the classifier layer can also learn the difference information between the labels. Experimental results show that our model can not only performs well in 2-class and multi-class rating text classification tasks, but also performs well in different languages.
暂无评论