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

Approximation and Heuristic Algorithms for the Priority Facility Location Problem with Outliers 有异常值的优先设施定位问题的近似和启发式算法

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-06-20 DOI: 10.26599/TST.2023.9010152

Hang Luo;Lu Han;Tianping Shuai;Fengmin Wang

引用次数: 0

Adaptive Model Compression for Steel Plate Surface Defect Detection: An Expert Knowledge and Working Condition-Based Approach 用于钢板表面缺陷检测的自适应模型压缩：基于专家知识和工作条件的方法

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-06-20 DOI: 10.26599/TST.2024.9010039

Maojie Sun;Fang Dong;Zhaowu Huang;Junzhou Luo

{"title":"Adaptive Model Compression for Steel Plate Surface Defect Detection: An Expert Knowledge and Working Condition-Based Approach","authors":"Maojie Sun;Fang Dong;Zhaowu Huang;Junzhou Luo","doi":"10.26599/TST.2024.9010039","DOIUrl":"https://doi.org/10.26599/TST.2024.9010039","url":null,"abstract":"The steel plate is one of the main products in steel industries, and its surface quality directly affects the final product performance. How to detect surface defects of steel plates in real time during the production process is a challenging problem. The single or fixed model compression method cannot be directly applied to the detection of steel surface defects, because it is difficult to consider the diversity of production tasks, the uncertainty caused by environmental factors, such as communication networks, and the influence of process and working conditions in steel plate production. In this paper, we propose an adaptive model compression method for steel surface defect online detection based on expert knowledge and working conditions. First, we establish an expert system to give lightweight model parameters based on the correlation between defect types and manufacturing processes. Then, lightweight model parameters are adaptively adjusted according to working conditions, which improves detection accuracy while ensuring real-time performance. The experimental results show that compared with the detection method of constant lightweight parameter model, the proposed method makes the total detection time cut down by 23.1%, and the deadline satisfaction ratio increased by 36.5%, while upgrading the accuracy by 4.2% and reducing the false detection rate by 4.3%.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1851-1871"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10565998","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435224","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

Integral Attack on the Full FUTURE Block Cipher 对全 FUTURE 区块密码的积分攻击

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-06-04 DOI: 10.26599/TST.2024.9010007

Zeyu Xu;Jiamin Cui;Kai Hu;Meiqin Wang

{"title":"Integral Attack on the Full FUTURE Block Cipher","authors":"Zeyu Xu;Jiamin Cui;Kai Hu;Meiqin Wang","doi":"10.26599/TST.2024.9010007","DOIUrl":"https://doi.org/10.26599/TST.2024.9010007","url":null,"abstract":"FUTURE is a recently proposed lightweight block cipher that achieved a remarkable hardware performance due to careful design decisions. FUTURE is an Advanced Encryption Standard (AES)-like Substitution-Permutation Network (SPN) with 10 rounds, whose round function consists of four components, i.e., SubCell, MixColumn, ShiftRow, and AddRoundKey. Unlike AES, it is a 64-bit-size block cipher with a 128-bit secret key, and the state can be arranged into 16 cells. Therefore, the operations of FUTURE including its S-box is defined over \u0000<tex>$boldsymbol{F}_{2}^{4}$</tex>\u0000. The previous studies have shown that the integral properties of 4-bit S-boxes are usually weaker than larger-size S-boxes, thus the number of rounds of FUTURE, i.e., 10 rounds only, might be too aggressive to provide enough resistance against integral cryptanalysis. In this paper, we mount the integral cryptanalysis on FUTURE. With state-of-the-art detection techniques, we identify several integral distinguishers of 7 rounds of FUTURE. By extending this 7-round distinguisher by 3 forward rounds, we manage to recover all the 128 bits secret keys from the full FUTURE cipher without the full codebook for the first time. To further achieve better time complexity, we also present a key recovery attack on full FUTURE with full codebook. Both attacks have better time complexity than existing results.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 1","pages":"161-170"},"PeriodicalIF":6.6,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10547705","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142169650","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

Time-of-Use Price Resource Scheduling in Multiplex Networked Industrial Chains 多路复用网络产业链中的使用时间价格资源调度

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-04-23 DOI: 10.26599/TST.2024.9010012

Pan Li;Kai Di;Xinlei Bai;Fulin Chen;Yuanshuang Jiang;Xiping Fu;Yichuan Jiang

{"title":"Time-of-Use Price Resource Scheduling in Multiplex Networked Industrial Chains","authors":"Pan Li;Kai Di;Xinlei Bai;Fulin Chen;Yuanshuang Jiang;Xiping Fu;Yichuan Jiang","doi":"10.26599/TST.2024.9010012","DOIUrl":"https://doi.org/10.26599/TST.2024.9010012","url":null,"abstract":"With the advancement of electronic information technology and the growth of the intelligent industry, the industrial sector has undergone a shift from simplex, linear, and vertical chains to complex, multi-level, and multi-dimensional networked industrial chains. In order to enhance energy efficiency in multiplex networked industrial chains under time-of-use price, a coarse time granularity task scheduling approach has been adopted. This approach adjusts the distribution of electricity supply based on task deadlines, dividing it into longer periods to facilitate batch access to task information. However, traditional simplex-network task assignment optimization methods are unable to achieve a globally optimal solution for cross-layer links in multiplex networked industrial chains. Existing solutions struggle to balance execution costs and completion efficiency in time-of-use price scenarios. Therefore, this paper presents a mixed-integer linear programming model for solving the problem scenario and two algorithms: an exact algorithm based on the branch-and-bound method and a multi-objective heuristic algorithm based on cross-layer policy propagation. These algorithms are designed to adapt to small-scale and large-scale problem scenarios under coarse time granularity. Through extensive simulation experiments and theoretical analysis, the proposed methods effectively optimize the energy and time costs associated with the task execution.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 1","pages":"303-317"},"PeriodicalIF":6.6,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10507222","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142169606","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

High-Security HEVC Video Steganography Method Using the Motion Vector Prediction Index and Motion Vector Difference 利用运动矢量预测指数和运动矢量差值的高安全性 HEVC 视频隐写方法

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-04-12 DOI: 10.26599/TST.2024.9010016

Jun Li;Minqing Zhang;Ke Niu;Yingnan Zhang;Yan Ke;Xiaoyuan Yang

{"title":"High-Security HEVC Video Steganography Method Using the Motion Vector Prediction Index and Motion Vector Difference","authors":"Jun Li;Minqing Zhang;Ke Niu;Yingnan Zhang;Yan Ke;Xiaoyuan Yang","doi":"10.26599/TST.2024.9010016","DOIUrl":"https://doi.org/10.26599/TST.2024.9010016","url":null,"abstract":"Recently proposed steganalysis methods based on the local optimality of motion vector prediction (MVP) indicate that the existing HEVC (high efficiency video coding) motion vector (MV) domain video steganography algorithms can disturb the optimality of MVP in advanced motion vector prediction (AMVP) technology. In order to improve the security of steganography algorithm, this paper proposes an MV domain steganography method in HEVC based on MVP's index and motion vector difference (MVD). First, we analyze the conditions that need to be met for steganography to resist attacks from MVP's optimality features and other traditional steganalysis features. Then, a distortion function for minimizing embedding distortion is designed, and an algorithm for secret message embedding and extraction in units of inter-frame is proposed. Experimental results show that the proposed algorithm can resist attacks based on the optimality of MVP and also has high security against other traditional steganalysis methods. In addition, the proposed algorithm has excellent performance in visual quality and coding efficiency, and can be applied to practical scenarios of video covert communication.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 2","pages":"813-829"},"PeriodicalIF":6.6,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10499222","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142797959","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

Cloud-Network-End Collaborative Security for Wireless Networks: Architecture, Mechanisms, and Applications 无线网络的云网端协作安全：架构、机制和应用

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-04-09 DOI: 10.26599/TST.2023.9010158

Xiangyu Wang;Jianfeng Ma

{"title":"Cloud-Network-End Collaborative Security for Wireless Networks: Architecture, Mechanisms, and Applications","authors":"Xiangyu Wang;Jianfeng Ma","doi":"10.26599/TST.2023.9010158","DOIUrl":"https://doi.org/10.26599/TST.2023.9010158","url":null,"abstract":"The core goal of network security is to protect the security of data sharing. Traditional wireless network security technology is committed to guaranteeing end-to-end data transmission security. However, with the advancement of mobile networks, cloud computing, and Internet of Things, communication-computing integration and cloud-network integration have been important technical routes. As a result, the main application requirements of wireless networks have changed from data transmission to cloud-based information services. Traditional data transmission security technology cannot overcome the security requirements of cloud-network-end collaborative services in the new era, and secure semantic communication has become an important model. To address this issue, we propose a cloud-network-end collaborative security architecture. Firstly, we clarify security mechanisms for end system security, network connection security, and cloud services security, respectively. Next, based on the above three aspects, we elaborate on the connotation of cloud-network-end collaborative security. By giving example applications, including heterogeneous network secure convergence framework, unmanned system collaborative operations security framework, and space-air-ground integrated network security framework, we demonstrate the universality of the proposed architecture. Finally, we review the current research on end system security, network connection security, and cloud services security, respectively.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 1","pages":"18-33"},"PeriodicalIF":6.6,"publicationDate":"2024-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10495800","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142169564","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

Optimizing Risk-Aware Task Migration Algorithm Among Multiplex UAV Groups Through Hybrid Attention Multi-Agent Reinforcement Learning 通过混合注意力多代理强化学习优化多路无人机群之间的风险意识任务迁移算法

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-04-01 DOI: 10.26599/TST.2024.9010013

Yuanshuang Jiang;Kai Di;Ruiyi Qian;Xingyu Wu;Fulin Chen;Pan Li;Xiping Fu;Yichuan Jiang

{"title":"Optimizing Risk-Aware Task Migration Algorithm Among Multiplex UAV Groups Through Hybrid Attention Multi-Agent Reinforcement Learning","authors":"Yuanshuang Jiang;Kai Di;Ruiyi Qian;Xingyu Wu;Fulin Chen;Pan Li;Xiping Fu;Yichuan Jiang","doi":"10.26599/TST.2024.9010013","DOIUrl":"https://doi.org/10.26599/TST.2024.9010013","url":null,"abstract":"Recently, with the increasing complexity of multiplex Unmanned Aerial Vehicles (multi-UAVs) collaboration in dynamic task environments, multi-UAVs systems have shown new characteristics of inter-coupling among multiplex groups and intra-correlation within groups. However, previous studies often overlooked the structural impact of dynamic risks on agents among multiplex UAV groups, which is a critical issue for modern multi-UAVs communication to address. To address this problem, we integrate the influence of dynamic risks on agents among multiplex UAV group structures into a multi-UAVs task migration problem and formulate it as a partially observable Markov game. We then propose a Hybrid Attention Multi-agent Reinforcement Learning (HAMRL) algorithm, which uses attention structures to learn the dynamic characteristics of the task environment, and it integrates hybrid attention mechanisms to establish efficient intra- and inter-group communication aggregation for information extraction and group collaboration. Experimental results show that in this comprehensive and challenging model, our algorithm significantly outperforms state-of-the-art algorithms in terms of convergence speed and algorithm performance due to the rational design of communication mechanisms.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 1","pages":"318-330"},"PeriodicalIF":6.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10488078","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142169603","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

Non-Line-of-Sight Multipath Classification Method for BDS Using Convolutional Sparse Autoencoder with LSTM 使用带有 LSTM 的卷积稀疏自动编码器的 BDS 非视距多径分类方法

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-03-26 DOI: 10.26599/TST.2024.9010004

Yahang Qin;Zhenni Li;Shengli Xie;Bo Li;Ming Liu;Victor Kuzin

{"title":"Non-Line-of-Sight Multipath Classification Method for BDS Using Convolutional Sparse Autoencoder with LSTM","authors":"Yahang Qin;Zhenni Li;Shengli Xie;Bo Li;Ming Liu;Victor Kuzin","doi":"10.26599/TST.2024.9010004","DOIUrl":"https://doi.org/10.26599/TST.2024.9010004","url":null,"abstract":"Multipath signal recognition is crucial to the ability to provide high-precision absolute-position services by the BeiDou Navigation Satellite System (BDS). However, most existing approaches to this issue involve supervised machine learning (ML) methods, and it is difficult to move to unsupervised multipath signal recognition because of the limitations in signal labeling. Inspired by an autoencoder with powerful unsupervised feature extraction, we propose a new deep learning (DL) model for BDS signal recognition that places a long short-term memory (LSTM) module in series with a convolutional sparse autoencoder to create a new autoencoder structure. First, we propose to capture the temporal correlations in long-duration BeiDou satellite time-series signals by using the LSTM module to mine the temporal change patterns in the time series. Second, we develop a convolutional sparse autoencoder method that learns a compressed representation of the input data, which then enables downscaled and unsupervised feature extraction from long-duration BeiDou satellite series signals. Finally, we add an l\u0000<inf>1/2</inf>\u0000 regularizer to the objective function of our DL model to remove redundant neurons from the neural network while ensuring recognition accuracy. We tested our proposed approach on a real urban canyon dataset, and the results demonstrated that our algorithm could achieve better classification performance than two ML-based methods (e.g., 11% better than a support vector machine) and two existing DL-based methods (e.g., 7.26% better than convolutional neural networks).","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 1","pages":"68-86"},"PeriodicalIF":6.6,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10480322","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142169736","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

Blockchain-Based Platform for the Compliance Inspection of the Ready-Mixed Concrete Supply Chain

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-03-23 DOI: 10.26599/TST.2024.9010019

Wen Wang;Guodong Zhang;Hao Hu;Shishu Ding

引用次数: 0

Algorithms for Scheduling Problems with Rejection 具有拒绝功能的调度问题算法

IF 6.6 1区计算机科学

Tsinghua Science and Technology Pub Date : 2024-03-19 DOI: 10.26599/TST.2023.9010146

Quanchang Zheng;Fanyu Kong;Jianfeng Ren;Yuzhong Zhang

{"title":"Algorithms for Scheduling Problems with Rejection","authors":"Quanchang Zheng;Fanyu Kong;Jianfeng Ren;Yuzhong Zhang","doi":"10.26599/TST.2023.9010146","DOIUrl":"https://doi.org/10.26599/TST.2023.9010146","url":null,"abstract":"We study scheduling problems with rejection on parallel-machine. Each job consists of a processing time, a rejection cost, and a release date. The goal is to minimize the makespan of the jobs accepted when the total rejection cost is not larger than a given threshold. Firstly, we verify that these problems are NP-hard. Secondly, for the multiprocessor scheduling problem with rejection, we give a pseudo-polynomial algorithm and two fully polynomial approximation schemes (FPTAS for short) for fixed positive integer m, where \u0000<tex>$m$</tex>\u0000 is the number of machines. For the scheduling problem with rejection and the job with non-identical release time on \u0000<tex>$m$</tex>\u0000 machines, we also design a pseudo-polynomial algorithm and a fully polynomial approximation scheme when \u0000<tex>$m$</tex>\u0000 is a fixed positive integer. We provide an approximation algorithm with the worst case performance 2 for arbitrary positive integer m. Finally, we discuss the online scheduling problem with rejection. We show that even if there are just two distinct arrive times for the jobs, there is not any online algorithm whose competitive ratio is constant for it.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 2","pages":"561-568"},"PeriodicalIF":6.6,"publicationDate":"2024-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10475893","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142825883","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