Tsinghua Science and Technology最新文献_第3页

Blockchain-Driven Secure Data Sharing Framework for Edge Computing Networks 边缘计算网络中区块链驱动的安全数据共享框架

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-12-30 DOI: 10.26599/TST.2024.9010051

Fuad A. M. Al-Yarimi;Ramzi Salah;Khaled Mohamoud

{"title":"Blockchain-Driven Secure Data Sharing Framework for Edge Computing Networks","authors":"Fuad A. M. Al-Yarimi;Ramzi Salah;Khaled Mohamoud","doi":"10.26599/TST.2024.9010051","DOIUrl":"https://doi.org/10.26599/TST.2024.9010051","url":null,"abstract":"This study examines secure and effective data sharing methods for edge computing networks. Traditional methods of sharing data at the edge have issues with security, speed, and consensus. The goal is to develop a Blockchain-based Secure Data Sharing Framework (BSDSF) capable of improving data integrity, latency, and overall network efficiency for edge-cloud computing applications. BSDSF proposes using blockchain technology with Byzantine Fault Tolerance (BFT) and smart contract-based validation as a new method of secure data sharing. It has a two-tiered consensus protocol to meet the needs of edge computing, which requires instantaneous responses. BSDSF employs Byzantine fault tolerance to deal with errors and protect against attacks. Smart contracts automate validation and consensus operations, while edge computing processes data at the attack site. Node validation and failure detection methods monitor network quality and dependability, while system security ensures secure communication between nodes. BSDSF is an important step toward digital freedom and trust by protecting security and improving transaction reliability. The framework demonstrates a reduction in transaction latency by up to 30% and an increase in throughput by 25% compared to traditional edge computing models, positioning BSDSF as a pivotal solution for fostering digital freedom and trust in edge computing environments.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 3","pages":"978-997"},"PeriodicalIF":6.6,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10817767","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142905813","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}

引用次数: 0

A Review on Air-Ground Coordination in Mobile Edge Computing: Key Technologies, Applications and Future Directions 移动边缘计算中地空协同：关键技术、应用及未来发展方向

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-12-30 DOI: 10.26599/TST.2024.9010142

Siqi Li;Guoqiang Liu;Li Li;Zhongyuan Zhang;Wenhao Fei;Haolong Xiang

{"title":"A Review on Air-Ground Coordination in Mobile Edge Computing: Key Technologies, Applications and Future Directions","authors":"Siqi Li;Guoqiang Liu;Li Li;Zhongyuan Zhang;Wenhao Fei;Haolong Xiang","doi":"10.26599/TST.2024.9010142","DOIUrl":"https://doi.org/10.26599/TST.2024.9010142","url":null,"abstract":"In recent years, Mobile Edge Computing (MEC) has received extensive research attention due to its characteristics, such as real-time data processing and flexible application deployment. However, traditional MEC server deployment relies on the terrestrial Base Stations (BSs), resulting in high deployment costs and limited coverage range. In response to these challenges, air-ground coordination has emerged, which effectively combines the advantages of edge computing and Unmanned Aerial Vehicles (UAVs), providing an effective architecture for edge intelligence. By utilizing the flexibility of UAVs and empowering them into edge nodes with computing resources, the coverage range of MEC can be expanded, thereby reducing the reliance of edge devices on terrestrial BSs. Furthermore, leveraging terrestrial BSs as supplements to the computing power compensates for relatively limited computational capabilities of UAVs. Although extensive studies have been conducted on air-ground coordination, there are few related summaries of application technologies and prospects. Thus, the key technologies of air-ground coordination and applications are comprehensively reviewed in this paper. Finally, to provide guidance for interested researchers, the development trends and potential applications of air-ground coordination are explored.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 3","pages":"1359-1386"},"PeriodicalIF":6.6,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10817761","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142905817","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}

引用次数: 0

MDGCN-Lt: Fair Web API Classification with Sparse and Heterogeneous Data Based on Deep GCN MDGCN-Lt：基于深度GCN的稀疏异构数据公平Web API分类

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-12-30 DOI: 10.26599/TST.2024.9010026

Boyuan Yan;Yankun Zhang;Wenwen Gong;Haoyang Wan;Wenwei Wang;Weiyi Zhong;Caixia Bu

{"title":"MDGCN-Lt: Fair Web API Classification with Sparse and Heterogeneous Data Based on Deep GCN","authors":"Boyuan Yan;Yankun Zhang;Wenwen Gong;Haoyang Wan;Wenwei Wang;Weiyi Zhong;Caixia Bu","doi":"10.26599/TST.2024.9010026","DOIUrl":"https://doi.org/10.26599/TST.2024.9010026","url":null,"abstract":"Developers integrate web Application Programming Interfaces (APIs) into edge applications, enabling data expansion to the edge computing area for comprehensive coverage of devices in that region. To develop edge applications, developers search API categories to select APIs that meet specific functionalities. Therefore, the accurate classification of APIs becomes critically important. However, existing approaches, as evident on platforms like programableweb.com, face significant challenges. Firstly, sparsity in API data reduces classification accuracy in works focusing on single-dimensional API information. Secondly, the multidimensional and heterogeneous structure of web APIs adds complexity to data mining tasks, requiring sophisticated techniques for effective integration and analysis of diverse data aspects. Lastly, the long-tailed distribution of API data introduces biases, compromising the fairness of classification efforts. Addressing these challenges, we propose MDGCN-Lt, an API classification approach offering flexibility in using multi-dimensional heterogeneous data. It tackles data sparsity through deep graph convolutional networks, exploring high-order feature interactions among API nodes. MDGCN-Lt employs a loss function with logit adjustment, enhancing efficiency in handling long-tail data scenarios. Empirical results affirm our approach's superiority over existing methods.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 3","pages":"1294-1314"},"PeriodicalIF":6.6,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10817770","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142905808","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}

引用次数: 0

DEFOG: Deep Learning with Attention Mechanism Enabled Cross-Age Face Recognition 深度学习与注意机制支持跨年龄人脸识别

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-12-30 DOI: 10.26599/TST.2024.9010107

Biaokai Zhu;Lu Li;Xiaochun Hu;Fulin Wu;Zhaojie Zhang;Shengnan Zhu;Yanxi Wang;Jiali Wu;Jie Song;Feng Li;Sanman Liu;Jumin Zhao

引用次数: 0

Efficient Maximum Vertex (k,ℓ)-Biplex Computation on Bipartite Graphs 双向图上的高效最大顶点 (k,ℓ)- 双工计算

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-12-09 DOI: 10.26599/TST.2024.9010009

Hongru Zhou;Shengxin Liu;Ruidi Cao

{"title":"Efficient Maximum Vertex (k,ℓ)-Biplex Computation on Bipartite Graphs","authors":"Hongru Zhou;Shengxin Liu;Ruidi Cao","doi":"10.26599/TST.2024.9010009","DOIUrl":"https://doi.org/10.26599/TST.2024.9010009","url":null,"abstract":"Cohesive subgraph search is a fundamental problem in bipartite graph analysis. Given integers \u0000<tex>$k$</tex>\u0000 and ℓ, a (k,ℓ)-biplex is a cohesive structure which requires each vertex to disconnect at most \u0000<tex>$k$</tex>\u0000 or \u0000<tex>$l$</tex>\u0000 vertices in the other side. Computing (k,ℓ)-biplexes has been a popular research topic in recent years and has various applications. However, most existing studies considered the problem of finding (k, ℓ)-biplex with the largest number of edges. In this paper, we instead consider another variant and focus on the maximum vertex (k, ℓ)-biplex problem which aims to search for a (k, ℓ)-biplex with the maximum cardinality. We first show that this problem is Non-deterministic Polynomial-time hard (NP-hard) for any positive integers \u0000<tex>$k$</tex>\u0000 and ℓ while max{k, ℓ} is at least 3. Guided by this negative result, we design an efficient branch-and-bound algorithm with a novel framework. In particular, we introduce a branching strategy based on whether there is a pivot in the current set, with which our proposed algorithm has the time complexity of γ\u0000<sup>n</sup>\u0000n\u0000<sup>O(1)</sup>\u0000, where γ< 2. In addition, we also apply multiple speed-up techniques and various pruning strategies. Finally, we conduct extensive experiments on various real datasets which demonstrate the efficiency of our proposed algorithm in terms of running time.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 2","pages":"569-584"},"PeriodicalIF":6.6,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10786929","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142825882","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}

引用次数: 0

DPN: Dynamics Priori Networks for Radiology Report Generation DPN：用于放射报告生成的动态先验网络

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-12-09 DOI: 10.26599/TST.2023.9010134

Bokai Yang;Hongyang Lei;Huazhen Huang;Xinxin Han;Yunpeng Cai

引用次数: 0

Evaluation Method of Motor Coordination Ability in Children Based on Machine Vision 基于机器视觉的儿童运动协调能力评估方法

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-12-09 DOI: 10.26599/TST.2024.9010069

Yi Lei;Dawei Shu;Miao Yu;Donglin Shi;Jianqiang Li;Yanjie Chen

{"title":"Evaluation Method of Motor Coordination Ability in Children Based on Machine Vision","authors":"Yi Lei;Dawei Shu;Miao Yu;Donglin Shi;Jianqiang Li;Yanjie Chen","doi":"10.26599/TST.2024.9010069","DOIUrl":"https://doi.org/10.26599/TST.2024.9010069","url":null,"abstract":"Motor coordination is crucial for preschoolers' development and is a key factor in assessing childhood development. Current diagnostic methods often rely on subjective manual assessments. This paper presents a machine vision-based approach aimed at improving the objectivity and adaptability of assessments. The method proposed involves the extraction of key points from the human skeleton through the utilization of a lightweight pose estimation network, thereby transforming video assessments into evaluations of keypoint sequences. The study uses different methods to handle static and dynamic actions, including regularization and Dynamic Time Warping (DTW) for spatial alignment and temporal discrepancies. A penalty-adjusted single-frame pose similarity method is used to evaluate actions. The lightweight pose estimation model reduces parameters by 85%, uses only 6.6% of the original computational load, and has an average detection missing rate of less than 1%. The average error for static actions is 0.071 with a correlation coefficient of 0.766, and for dynamic actions it is 0.145 with a correlation coefficient of 0.653. These results confirm the proposed method's effectiveness, which includes customized visual components like motion waveform graphs to improve accuracy in pediatric healthcare diagnoses.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 2","pages":"633-649"},"PeriodicalIF":6.6,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10786931","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142825976","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}

引用次数: 0

Physical Layer Security for CR-NOMA Network with Cooperative Jamming 具有合作干扰功能的 CR-NOMA 网络的物理层安全性

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-12-09 DOI: 10.26599/TST.2023.9010128

Meiling Li;Peng Xue;Hu Yuan;Yuxing Han

{"title":"Physical Layer Security for CR-NOMA Network with Cooperative Jamming","authors":"Meiling Li;Peng Xue;Hu Yuan;Yuxing Han","doi":"10.26599/TST.2023.9010128","DOIUrl":"https://doi.org/10.26599/TST.2023.9010128","url":null,"abstract":"Cooperative jamming can effectively combat eavesdropping in physical layer security communication without affecting the legal receiver and improve the security performance of the system. This paper introduces cooperative jamming to cognitive radio (CR) networks with non-orthogonal multiple access (NOMA) technology. The secure performance of the considered CR and NOMA (CR-NOMA) network is evaluated using two modes: non-cooperative jamming and cooperative jamming. In particular, the secrecy outage probabilities (SOPs) of the primary user (PU) in the two modes are derived under Rician fading channels, based on which, the influences of the transmission signal-to-noise ratio (SNR) of secondary users (SUs), the number of SUs, the secrecy rate, and the power allocation coefficient on the SOPs of PU are analyzed thereafter. Both analysis and simulation results show that cooperative jamming effectively prevents eavesdropping behaviour, which reduces the SOP of PU compared to non-cooperative jamming. We also show that the transmission SNR, the number of SUs, the secrecy rate, and the power distribution coefficients greatly influence performance improvement.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 2","pages":"708-720"},"PeriodicalIF":6.6,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10786938","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142825880","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}

引用次数: 0

Wearable Continuous Blood Pressure Monitoring Based on Pulsatile Cycle Volume Adjustment Method 基于脉动周期量调节法的可穿戴式连续血压监测系统

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-12-09 DOI: 10.26599/TST.2024.9010043

Pang Wu;Zhongrui Bai;Pan Xia;Lirui Xu;Peng Wang;Xianxiang Chen;Lidong Du;Ziqing Hei;Weifeng Yao;Xiaoran Li;Zhan Zhao;Zhen Fang

{"title":"Wearable Continuous Blood Pressure Monitoring Based on Pulsatile Cycle Volume Adjustment Method","authors":"Pang Wu;Zhongrui Bai;Pan Xia;Lirui Xu;Peng Wang;Xianxiang Chen;Lidong Du;Ziqing Hei;Weifeng Yao;Xiaoran Li;Zhan Zhao;Zhen Fang","doi":"10.26599/TST.2024.9010043","DOIUrl":"https://doi.org/10.26599/TST.2024.9010043","url":null,"abstract":"Accurate and portable Blood Pressure (BP) monitoring is vital for managing cardiovascular diseases. However, existing wearable continuous BP monitoring technologies are often inaccurate and rely on external calibration, limiting their practical application in continuous BP monitoring. To address this challenge, we have developed a Wearable continuous non-invasive BP Monitor (WeBPM) equipped with a finger cuff sensor, capable of monitoring BP continuously and accurately within medical-grade precision. WeBPM integrates advanced finger oscillographic BP measurement technology to provide reliable self-calibration functionality. Moreover, Pulsatile Cycle Volume Adjustment Method (PCVAM) we proposed for the closed-loop phase can continuously track changes in vasomotor tone under a controlled frequency based on pulsatile cycles, thereby enabling continuous BP measurement. In comparative experiments with the Nexfin monitor, WeBPM demonstrates excellent performance in induced dynamic BP experiments, with measurement errors of (-1.4 ± 6.24) mmHg for Systolic BP (SBP) and (-0.82 ± 4.83) mmHg for Diastolic BP (DBP). Additionally, compared to clinical invasive reference measurements, WeBPM's SBP and DBP measurement errors are (-1.74 ± 4.9) mmHg and (0.37 ± 3.28) mmHg, respectively, further proving its outstanding performance. These results highlight WeBPM's potential in personalized health management and remote monitoring, offering a new solution for continuous non-invasive BP monitoring.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 2","pages":"650-669"},"PeriodicalIF":6.6,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10786939","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142825881","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}

引用次数: 0

From Traces to Packets: Realistic Deep Learning Based Multi-Tab Website Fingerprinting Attacks 从痕迹到数据包：基于深度学习的多标签网站指纹攻击

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-12-09 DOI: 10.26599/TST.2024.9010073

Haoyu Yin;Yingjian Liu;Zhongwen Guo;Yu Wang

{"title":"From Traces to Packets: Realistic Deep Learning Based Multi-Tab Website Fingerprinting Attacks","authors":"Haoyu Yin;Yingjian Liu;Zhongwen Guo;Yu Wang","doi":"10.26599/TST.2024.9010073","DOIUrl":"https://doi.org/10.26599/TST.2024.9010073","url":null,"abstract":"Recent advancements in deep learning (DL) have introduced new security challenges in the form of side-channel attacks. A prime example is the website fingerprinting attack (WFA), which targets anonymity networks like Tor, enabling attackers to unveil users' protected browsing activities from traffic data. While state-of-the-art WFAs have achieved remarkable results, they often rely on unrealistic single-website assumptions. In this paper, we undertake an exhaustive exploration of multi-tab website fingerprinting attacks (MTWFAs) in more realistic scenarios. We delve into MTWFAs and introduce MTWFA-SEG, a task involving the fine-grained packet-level classification within multi-tab Tor traffic. By employing deep learning models, we reveal their potential to threaten user privacy by discerning visited websites and browsing session timing. We design an improved fully convolutional model for MTWFA-SEG, which are enhanced by both network architecture advances and traffic data instincts. In the evaluations on interlocking browsing datasets, the proposed models achieve remarkable accuracy rates of over 68.6%, 71.8%, and 76.1% in closed, imbalanced open, and balanced open-world settings, respectively. Furthermore, the proposed models exhibit substantial robustness across diverse train-test settings. We further validate our designs in a coarse-grained task, MTWFA-MultiLabel, where they not only achieve state-of-the-art performance but also demonstrate high robustness in challenging situations.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 2","pages":"830-850"},"PeriodicalIF":6.6,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10786942","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142797957","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}

引用次数: 0