Tables, as an important means of data storage, are widely used in spreadsheets, web tables, and PDFs. By integrating information from table data with knowledge re-trieved from an external knowledge base, and examining...
详细信息
Recently, two new emerging biometrics technologies, 2D low-resolution palmprint recognition technologies, have received wide attention. Numerous methods have been developed and proposed for palmprint recognition. Amon...
详细信息
The domain of palmprint recognition, characterized by its convenience, low privacy sensitivity, and rich feature sets, has garnered increasing research interest. Moreover, Vision Transformers (ViTs) have emerged as a ...
详细信息
The traditional orbit determination method based on pulsar profile distortion can determine the six elements of the ***,the estimation accuracies of these methods are limited and the computational load of a six-dimens...
详细信息
The traditional orbit determination method based on pulsar profile distortion can determine the six elements of the ***,the estimation accuracies of these methods are limited and the computational load of a six-dimensional search is *** solve this problem,the differential-geometry-based Multi-dimensional Joint Position-Velocity Estimation(MJPVE)using Crab pulsar profile distortion is proposed in this ***,through theoretical analysis,it is found that the pulsar profile distortion caused by the initial state error in some joint positionvelocity directions is very *** other words,the accuracies of estimation in these directions are very ***,the search dimension can be reduced,which in turn greatly reduces the computational ***,we construct the chi-squared function of the pulsar profile with respect to the estimation error in joint position-velocity direction and use differential geometry to find the joint position-velocity directions corresponding to different degrees of ***,we utilize the grid search based on directory folding in these joint position-velocity directions corresponding to large degrees of distortion to obtain the joint position-velocity *** experimental results show that compared with the grouping bi-chi-squared inversion method,MJPVE has high precision and extensive navigation information.
Federated recommender systems(FedRecs) have garnered increasing attention recently, thanks to their privacypreserving benefits. However, the decentralized and open characteristics of current FedRecs present at least t...
详细信息
Federated recommender systems(FedRecs) have garnered increasing attention recently, thanks to their privacypreserving benefits. However, the decentralized and open characteristics of current FedRecs present at least two ***, the performance of FedRecs is compromised due to highly sparse on-device data for each client. Second, the system's robustness is undermined by the vulnerability to model poisoning attacks launched by malicious users. In this paper, we introduce a novel contrastive learning framework designed to fully leverage the client's sparse data through embedding augmentation, referred to as CL4FedRec. Unlike previous contrastive learning approaches in FedRecs that necessitate clients to share their private parameters, our CL4FedRec aligns with the basic FedRec learning protocol, ensuring compatibility with most existing FedRec implementations. We then evaluate the robustness of FedRecs equipped with CL4FedRec by subjecting it to several state-of-the-art model poisoning attacks. Surprisingly, our observations reveal that contrastive learning tends to exacerbate the vulnerability of FedRecs to these attacks. This is attributed to the enhanced embedding uniformity, making the polluted target item embedding easily proximate to popular items. Based on this insight, we propose an enhanced and robust version of CL4FedRec(rCL4FedRec) by introducing a regularizer to maintain the distance among item embeddings with different popularity levels. Extensive experiments conducted on four commonly used recommendation datasets demonstrate that rCL4FedRec significantly enhances both the model's performance and the robustness of FedRecs.
Multi-person pose estimation based on monocular cameras is one of the hot research topics in computer vision. Current monocular multi-person 3D pose estimation methods often treat individuals as independent entities f...
详细信息
In recent years, great success has been achieved in many tasks of natural language processing (NLP), e.g., named entity recognition (NER), especially in the high-resource language, i.e., English, thanks in part to the...
详细信息
The tile-based multiplayer game Mahjong is widely played in Asia and has also become increasingly popular worldwide. Face-to-face or online, each player begins with a hand of 13 tiles and players draw and discard tile...
详细信息
The tile-based multiplayer game Mahjong is widely played in Asia and has also become increasingly popular worldwide. Face-to-face or online, each player begins with a hand of 13 tiles and players draw and discard tiles in turn until they complete a winning hand. An important notion in Mahjong is the deficiency number(*** number in Japanese Mahjong) of a hand, which estimates how many tile changes are necessary to complete the hand into a winning hand. The deficiency number plays an essential role in major decision-making tasks such as selecting a tile to discard. This paper proposes a fast algorithm for computing the deficiency number of a Mahjong hand. Compared with the baseline algorithm, the new algorithm is usually 100 times faster and, more importantly,respects the agent's knowledge about available tiles. The algorithm can be used as a basic procedure in all Mahjong variants by both rule-based and machine learning-based Mahjong AI.
Comprehension of spoken language is essential in dialog systems, as it supports two fundamental tasks: intent classification and slot filling. At present, federated modeling methodologies prevail in the domain of spok...
详细信息
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
暂无评论