{"title":"Gesture Recognition with Focuses Using Hierarchical Body Part Combination","authors":"Cheng Zhang;Yibin Hou;Jian He;Xiaoyang Xie","doi":"10.26599/TST.2024.9010059","DOIUrl":"https://doi.org/10.26599/TST.2024.9010059","url":null,"abstract":"Human gesture recognition is an important research field of human-computer interaction due to its potential applications in various fields, but existing methods still face challenges in achieving high levels of accuracy. To address this issue, some existing researches propose to fuse the global features with the cropped features called focuses on vital body parts like hands. However, most methods rely on experience when choosing the focus, the scheme of focus selection is not discussed in detail. In this paper, a hierarchical body part combination method is proposed to take into account the number, combinations, and logical relationships between body parts. The proposed method generates multiple focuses using this method and employs chart-based surface modality alongside red-green-blue and optical flow modalities to enhance each focus. A feature-level fusion scheme based on the residual connection structure is proposed to fuse different modalities at convolution stages, and a focus fusion scheme is proposed to learn the relevancy of focus channels for each gesture class individually. Experiments conducted on ChaLearn isolated gesture dataset show that the use of multiple focuses in conjunction with multi-modal features and fusion strategies leads to better gesture recognition accuracy.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 4","pages":"1583-1599"},"PeriodicalIF":6.6,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10908593","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143553210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jianye Xie;Xudong Wang;Yuwen Liu;Wenwen Gong;Chao Yan;Wajid Rafique;Maqbool Khan;Arif Ali Khan
{"title":"Social Media-Driven User Community Finding with Privacy Protection","authors":"Jianye Xie;Xudong Wang;Yuwen Liu;Wenwen Gong;Chao Yan;Wajid Rafique;Maqbool Khan;Arif Ali Khan","doi":"10.26599/TST.2024.9010065","DOIUrl":"https://doi.org/10.26599/TST.2024.9010065","url":null,"abstract":"In the digital era, social media platforms play a crucial role in forming user communities, yet the challenge of protecting user privacy remains paramount. This paper proposes a novel framework for identifying and analyzing user communities within social media networks, emphasizing privacy protection. In detail, we implement a social media-driven user community finding approach with hashing named MCF to ensure that the extracted information cannot be traced back to specific users, thereby maintaining confidentiality. Finally, we design a set of experiments to verify the effectiveness and efficiency of our proposed MCF approach by comparing it with other existing approaches, demonstrating its effectiveness in community detection while upholding stringent privacy standards. This research contributes to the growing field of social network analysis by providing a balanced solution that respects user privacy while uncovering valuable insights into community dynamics on social media platforms.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 4","pages":"1782-1792"},"PeriodicalIF":6.6,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10908665","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143553426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-Label Prototype-Aware Structured Contrastive Distillation","authors":"Yuelong Xia;Yihang Tong;Jing Yang;Xiaodi Sun;Yungang Zhang;Huihua Wang;Lijun Yun","doi":"10.26599/TST.2024.9010182","DOIUrl":"https://doi.org/10.26599/TST.2024.9010182","url":null,"abstract":"Knowledge distillation has demonstrated considerable success in scenarios involving multi-class single-label learning. However, its direct application to multi-label learning proves challenging due to complex correlations in multi-label structures, causing student models to overlook more finely structured semantic relations present in the teacher model. In this paper, we present a solution called multi-label prototype-aware structured contrastive distillation, comprising two modules: Prototype-aware Contrastive Representation Distillation (PCRD) and prototype-aware cross-image structure distillation. The PCRD module maximizes the mutual information of prototype-aware representation between the student and teacher, ensuring semantic representation structure consistency to improve the compactness of intra-class and dispersion of inter-class representations. In the PCSD module, we introduce sample-to-sample and sample-to-prototype structured contrastive distillation to model prototype-aware cross-image structure consistency, guiding the student model to maintain a coherent label semantic structure with the teacher across multiple instances. To enhance prototype guidance stability, we introduce batch-wise dynamic prototype correction for updating class prototypes. Experimental results on three public benchmark datasets validate the effectiveness of our proposed method, demonstrating its superiority over state-of-the-art methods.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 4","pages":"1808-1830"},"PeriodicalIF":6.6,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10908678","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143535439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CRESP: Cost-Aware Recommendation-Oriented Edge Service Provision","authors":"Li Huang;Bo Li;Lu Zhao","doi":"10.26599/TST.2024.9010151","DOIUrl":"https://doi.org/10.26599/TST.2024.9010151","url":null,"abstract":"In the 5G environment, the edge computing paradigm enables service providers to deploy their service instances on distributed edge servers to serve nearby end users with extremely low latency. This boosts the emergence of modern applications, like AR/VR, online gaming, and autonomous vehicles. Existing approaches find service provision strategies under the assumption that all the user requirements are known. However, this assumption may not be true in practice and thus the effectiveness of existing approaches could be undermined. Inspired by the great success of recommender systems in various fields, we can mine users' interests in new services based on their similarities in terms of current service usage. Then, new service instances can be provisioned accordingly to better fulfil users' requirements. We formulate the problem studied in this paper as a Cost-aware Recommendation-oriented Edge Service Provision (CRESP) problem. Then, we formally model the CRESP problem as a Constrained Optimization Problem (COP). Next, we propose CRESP-O to find optimal solutions to small-scale CRESP problems. Besides, to solve large-scale CRESP problems efficiently, we propose an approximation approach named CRESP-A, which has a theoretical performance guarantee. Finally, we experimentally evaluate the performance of both CRESP-O and CRESP-A against several state-of-the-art approaches on a public testbed.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 4","pages":"1865-1884"},"PeriodicalIF":6.6,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10908596","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143535438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Privacy Policy Text Compliance Reasoning Framework with Large Language Models for Healthcare Services","authors":"Jintao Chen;Fan Wang;Shengye Pang;Mingshuai Chen;Meng Xi;Tiancheng Zhao;Jianwei Yin","doi":"10.26599/TST.2024.9010089","DOIUrl":"https://doi.org/10.26599/TST.2024.9010089","url":null,"abstract":"The advancement of artificial intelligence-generated content drives the diversification of healthcare services, resulting in increased private information collection by healthcare service providers. Therefore, compliance with privacy regulations has increasingly become a paramount concern for both regulatory authorities and consumers. Privacy policies are crucial for consumers to understand how their personal information is collected, stored, and processed. In this work, we propose a privacy policy text compliance reasoning framework called FACTOR, which harnesses the power of large language models (LLMs). Since the General Data Protection Regulation (GDPR) has broad applicability, this work selects Article 13 of the GDPR as regulation requirements. FACTOR segments the privacy policy text using a sliding window strategy and employs LLM-based text entailment to assess compliance for each segment. The framework then applies a rule-based ensemble approach to aggregate the entailment results for all regulation requirements from the GDPR. Our experiments on a synthetic corpus of 388 privacy policies demonstrate the effectiveness of FACTOR. Additionally, we analyze 100 randomly selected websites offering healthcare services, revealing that nine of them lack a privacy policy altogether, while 29 have privacy policy texts that fail to meet the regulation requirements.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 4","pages":"1831-1845"},"PeriodicalIF":6.6,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10908666","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143535484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Lasserre SDP Rounding Approximation Algorithm for Max Directed 3-Section","authors":"Guangfeng Li;Jian Sun;Donglei Du;Xiaoyan Zhang","doi":"10.26599/TST.2024.9010214","DOIUrl":"https://doi.org/10.26599/TST.2024.9010214","url":null,"abstract":"We consider the Max Directed 3-Section problem, which is closely connected to other well-known graph partition problems, such as Max Cut and Max Bisection. Given an arc-weighted directed graph, the goal of the Max Directed 3-Section problem is to partition the vertex set into three disjoint subsets with equal size, while maximizing the total weight of arcs crossing different vertex subsets. By combining the Lasserre hierarchy with the random hyperplane rounding strategy, we propose a polynomial-time algorithm with approximation ratio of 0.489.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 4","pages":"1885-1896"},"PeriodicalIF":6.6,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10908669","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143535532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hanwen Liu;Nianzhe Li;Huaizhen Kou;Shunmei Meng;Qianmu Li
{"title":"FSRPCL: Privacy-Preserve Federated Social Relationship Prediction with Contrastive Learning","authors":"Hanwen Liu;Nianzhe Li;Huaizhen Kou;Shunmei Meng;Qianmu Li","doi":"10.26599/TST.2024.9010077","DOIUrl":"https://doi.org/10.26599/TST.2024.9010077","url":null,"abstract":"Cross-Platform Social Relationship Prediction (CPSRP) aims to utilize users' data information on multiple platforms to enhance the performance of social relationship prediction, thereby promoting socio-economic development. Due to the highly sensitive nature of users' data in terms of privacy, CPSRP typically introduces various privacy-preserving mechanisms to safeguard users' confidential information. Although the introduction mechanism guarantees the security of the users' private information, it tends to degrade the performance of the social relationship prediction. Additionally, existing social relationship prediction schemes overlook the interdependencies among items invoked in a user behavior sequence. For this purpose, we propose a novel privacy-preserve Federated Social Relationship Prediction with Contrastive Learning framework called FSRPCL, which is a multi-task learning framework based on vertical federated learning. Specifically, the users' rating information is perturbed with a bounded differential privacy technology, and then the users' sequential representation information acquired through Transformer is applied for social relationship prediction and contrastive learning. Furthermore, each client uploads their respective weight information to the server, and the server aggregates the weight information and distributes it purposes to each client for updating. Numerous experiments on real-world datasets prove that FSRPCL delivers exceptional performance in social relationship prediction and privacy preservation, and effectively minimizes the impact of privacy-preserving technology on social relationship prediction accuracy.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 4","pages":"1762-1781"},"PeriodicalIF":6.6,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10908667","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143553139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CCDive: A Deep Dive into Code Clone Detection Using Local Sequence Alignment","authors":"Yasir Glani;Luo Ping;Syed Asad Shah;Lin Ke","doi":"10.26599/TST.2024.9010075","DOIUrl":"https://doi.org/10.26599/TST.2024.9010075","url":null,"abstract":"The rapid evolution of software development has accentuated the deficiencies of prevailing code clone detection techniques. As modern applications become more complex, traditional cloning tools often struggle to detect general and large-gap clones that undergo regular modification. Such challenges pose threats to software integrity, emphasizing the critical need for improved code cloning techniques. Observing the prevailing gap, we propose an innovative code clone dive (CCDive) code cloning technique, which is designed to detect an extensive range of clones, from direct clones to the often challenging large-gap clones, thoroughly covering different categories, such as very strongly Type-III, strongly Type-III, and moderate Type-III clones. In CCDive, the fusion of a level-by-level abstraction and an innovative similarity matching algorithm ensures the recognition of clones even when nearly half the original code in the chunk has been modified. Furthermore, by integrating the Smith-Waterman local sequence alignment, the capability of CCDive to spot exact code transformation locations can be enhanced. In a comprehensive evaluation, CCDive was compared with well-known code cloning techniques. The efficacy of CCDive was measured using precision, recall, F1-score, accuracy, and efficiency. CCDive consistently surpassed other techniques in the precision, recall, F1-score, and accuracy metrics for both file-based and function-based clone detection. The robust performance of CCDive emphasizes its effectiveness, reliability, accuracy, and efficiency, making it well-suited for practical applications in the real world.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 4","pages":"1435-1456"},"PeriodicalIF":6.6,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10908670","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143553187","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Causality-Based Contrastive Incremental Learning Framework for Domain Generalization","authors":"Xin Wang;Qingjie Zhao;Lei Wang;Wangwang Liu","doi":"10.26599/TST.2024.9010072","DOIUrl":"https://doi.org/10.26599/TST.2024.9010072","url":null,"abstract":"Learning domain-invariant feature representations is critical to alleviate the distribution differences between training and testing domains. The existing mainstream domain generalization approaches primarily pursue to align the across-domain distributions to extract the transferable feature representations. However, these representations may be insufficient and unstable. Moreover, these networks may also undergo catastrophic forgetting because the previous learned knowledge is replaced by the new learned knowledge. To cope with these issues, we propose a novel causality-based contrastive incremental learning model for domain generalization, which mainly includes three components: (1) intra-domain causal factorization, (2) inter-domain Mahalanobis similarity metric, and (3) contrastive knowledge distillation. The model extracts intra and inter domain-invariant knowledge to improve model generalization. Specifically, we first introduce a causal factori-zation to extract intra-domain invariant knowledge. Then, we design a Mahalanobis similarity metric to extract common inter-domain invariant knowledge. Finally, we propose a contrastive knowledge distillation with exponential moving average to distill model parameters in a smooth way to preserve the previous learned knowledge and mitigate model forgetting. Extensive experiments on several domain generalization benchmarks prove that our model achieves the state-of-the-art results, which sufficiently show the effectiveness of our model.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 4","pages":"1636-1647"},"PeriodicalIF":6.6,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10908663","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143553510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Human Morality Difference when Programming and Actually Operating Autonomous Machines","authors":"Wenfeng Yi;Wenhan Wu;Maoyin Chen;Xiaoping Zheng","doi":"10.26599/TST.2024.9010062","DOIUrl":"https://doi.org/10.26599/TST.2024.9010062","url":null,"abstract":"Autonomous machines (AMs) are poised to possess human-like moral cognition, yet their morality is often pre-programmed for safety. This raises the question of whether the morality intended by programmers aligns with their actions during actual operation, a crucial consideration for a future society with both humans and AMs. Investigating this, we use a micro-robot swarm in a simulated fire scenario, with 180 participants, including 102 robot programmers, completing moral questionnaires and participating in virtual escape trials. These exercises mirror common societal moral dilemmas. Our comparative analysis reveals a “morality gap” between programming presets and real-time operation, primarily influenced by uncertainty about the future and heightened by external pressures, especially social punishment. This discrepancy suggests that operational morality can diverge from programmed intentions, underlining the need for careful AM design to foster a collaborative and efficient society.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 4","pages":"1648-1658"},"PeriodicalIF":6.6,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10908660","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143553222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}