{"title":"Intelligent Transportation System Performance Analysis of Indoor and Outdoor Internet of Vehicle (IoV) Applications Towards 5G","authors":"Preeti Rani;Rohit Sharma","doi":"10.26599/TST.2023.9010119","DOIUrl":"https://doi.org/10.26599/TST.2023.9010119","url":null,"abstract":"The Internet of Vehicles (IoVs) has seen rapid development due to advances in advanced communication technologies. The 5-th Generation (5G) systems will be integrated into next-generation vehicles, enabling them to operate more efficiently by cooperating with the environment. The millimeter Wave (mmWave) technology is projected to provide a large bandwidth to meet future needs for more effective data rate communications. A viable approach for transferring raw sensor data among autonomous vehicles would be to use mmWave communication. This paper attracts various research interests in academic, indoor, and outdoor mmWave operations. This paper presents mmWave propagation measurements for indoor and outdoor at 66 GHz frequency for IoVs scenarios. The proposed model examines the equivalent path loss using Free-Space Path Loss (FSPL) based on the transmitter and receiver distances for indoor and outdoor communications of the vehicles. In the indoor scenario, path loss propagation has the lowest penetration loss, but it is ineffective in the outdoor scenario because distance increases as free space path loss increases. The probability of error is increased, concerning the transmitter and receiver distances due to propagation effect, packet collisions, busy receiver, and sensing threshold. The proposed methodology shows a higher packet delivery ratio and average throughput with less delay in the connection during transmission.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1785-1795"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10565999","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435219","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}
Ashish Bagwari;Jaganathan Logeshwaran;M. Raja;P. Devisivasankari;Jyotshana Bagwari;Vikas Rathi;Asma Mohammed Elbashir Saad
{"title":"Intelligent Computational Model for Energy Efficiency and AI Automation of Network Devices in 5G Communication Environment","authors":"Ashish Bagwari;Jaganathan Logeshwaran;M. Raja;P. Devisivasankari;Jyotshana Bagwari;Vikas Rathi;Asma Mohammed Elbashir Saad","doi":"10.26599/TST.2024.9010005","DOIUrl":"https://doi.org/10.26599/TST.2024.9010005","url":null,"abstract":"Currently, the 4G network service has caused massive digital growth in high use. Video calling has become the go-to Internet application for many people, downloading even huge files in minutes. Everyone is looking for and buying only 4G Subscriber Identity Module (SIM)-capable mobiles. In this case, the expectation of 5G has increased in line with 2G, 3G, and 4G, where the G stands for generation, and it does not indicate Internet or Internet speed. 5G includes next-generation features that are more advanced than those available in 4G network services. The main objective of 5G is uninterrupted telecommunication service in hybrid energy storage system. This paper proposes an intelligent networking model to obtain the maximum energy efficiency and Artificial Intelligence (AI) automation of 5G networks. There is currently an issue where the signal cuts out when crossing an area with one tower and traveling to an area with another tower. The problem of “call drop”, where the call is disconnected while talking, is not present in 5G. The proposed Intelligent Computational Model (ICM) model obtained 96.31% network speed management, 90.63% battery capacity management, 92.27% network device management, 93.57% energy efficiency, and 88.41% AI automation.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1728-1751"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435316","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":"Two-Stage Submodular Maximization Under Knapsack Problem","authors":"Zhicheng Liu;Jing Jin;Donglei Du;Xiaoyan Zhang","doi":"10.26599/TST.2023.9010107","DOIUrl":"https://doi.org/10.26599/TST.2023.9010107","url":null,"abstract":"Two-stage submodular maximization problem under cardinality constraint has been widely studied in machine learning and combinatorial optimization. In this paper, we consider knapsack constraint. In this problem, we give \u0000<tex>$n$</tex>\u0000 articles and \u0000<tex>$m$</tex>\u0000 categories, and the goal is to select a subset of articles that can maximize the function \u0000<tex>$F(S)$</tex>\u0000. Function \u0000<tex>$F(S)$</tex>\u0000 consists of \u0000<tex>$m$</tex>\u0000 monotone submodular functions \u0000<tex>$f_{j}, j=1,2, ldots, m$</tex>\u0000, and each \u0000<tex>$f_{j}$</tex>\u0000 measures the similarity of each article in category \u0000<tex>$j$</tex>\u0000. We present a constant-approximation algorithm for this problem.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1703-1708"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435249","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":"Approximation Algorithms for Maximization of $k$-Submodular Function Under a Matroid Constraint","authors":"Yuezhu Liu;Yunjing Sun;Min Li","doi":"10.26599/TST.2023.9010122","DOIUrl":"https://doi.org/10.26599/TST.2023.9010122","url":null,"abstract":"In this paper, we design a deterministic 1/3-approximation algorithm for the problem of maximizing non-monotone \u0000<tex>$k$</tex>\u0000-submodular function under a matroid constraint. In order to reduce the complexity of this algorithm, we also present a randomized 1/3-approximation algorithm with the probability of \u0000<tex>$1-varepsilon$</tex>\u0000, where \u0000<tex>$varepsilon$</tex>\u0000 is the probability of algorithm failure. Moreover, we design a streaming algorithm for both monotone and non-monotone objective \u0000<tex>$k$</tex>\u0000-submodular functions.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1633-1641"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566024","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435375","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}
Gajula Ramesh;Anil Kumar Budati;Shayla Islam;Louai A. Maghrabi;Abdullah Al-Atwai
{"title":"Artificial Intelligence Enabled Future Wireless Electric Vehicles with Multi-Model Learning and Decision Making Models","authors":"Gajula Ramesh;Anil Kumar Budati;Shayla Islam;Louai A. Maghrabi;Abdullah Al-Atwai","doi":"10.26599/TST.2023.9010094","DOIUrl":"https://doi.org/10.26599/TST.2023.9010094","url":null,"abstract":"In the contemporary era, driverless vehicles are a reality due to the proliferation of distributed technologies, sensing technologies, and Machine to Machine (M2M) communications. However, the emergence of deep learning techniques provides more scope in controlling and making such vehicles energy efficient. From existing methods, it is understood that there have been many approaches found to automate safe driving in autonomous and electric vehicles and also their energy efficiency. However, the models focus on different aspects separately. There is need for a comprehensive framework that exploits multiple deep learning models in order to have better control using Artificial Intelligence (AI) on autonomous driving and energy efficiency. Towards this end, we propose an AI-based framework for autonomous electric vehicles with multi-model learning and decision making. It focuses on both safe driving in highway scenarios and energy efficiency. The deep learning based framework is realized with many models used for localization, path planning at high level, path planning at low level, reinforcement learning, transfer learning, power control, and speed control. With reinforcement learning, state-action-feedback play important role in decision making. Our simulation implementation reveals that the efficiency of the AI-based approach towards safe driving of autonomous electric vehicle gives better performance than that of the normal electric vehicles.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1776-1784"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435458","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}
Chunming Xu;Mingfei Bai;Chenchen Wu;Qiyue Wang;Yiwei Wang
{"title":"An Optimal Pricing and Ordering Policy with Trapezoidal-Type Demand Under Partial Backlogged Shortages","authors":"Chunming Xu;Mingfei Bai;Chenchen Wu;Qiyue Wang;Yiwei Wang","doi":"10.26599/TST.2023.9010040","DOIUrl":"https://doi.org/10.26599/TST.2023.9010040","url":null,"abstract":"Based on the retail inventory operation of Heilan Home, this study incorporates the price factor into inventory environment involving trapezoidal time-varying products. A joint pricing and ordering issue with deteriorating items under partial backlogged shortages is firstly explored in a fixed selling cycle. The corresponding optimization model aiming at maximizing profit performance of inventory system is developed, the theoretical analysis of solving the model is further provided, and the modelling frame generalizes some inventory models in the existing studies. Then, a solving algorithm for the model is designed to determine the optimal price, initial ordering quantity, shortage time point, and the maximum inventory level. Finally, numerical examples are presented to illustrate the model, and the results show the robustness of the proposed model.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1709-1727"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566000","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435501","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}
Qihua Zhou;Zhili Zhou;Zhipeng Bao;Weina Niu;Yuling Liu
{"title":"IIN-FFD: Intra-Inter Network for Face Forgery Detection","authors":"Qihua Zhou;Zhili Zhou;Zhipeng Bao;Weina Niu;Yuling Liu","doi":"10.26599/TST.2024.9010022","DOIUrl":"https://doi.org/10.26599/TST.2024.9010022","url":null,"abstract":"Since different kinds of face forgeries leave similar forgery traces in videos, learning the common features from different kinds of forged faces would achieve promising generalization ability of forgery detection. Therefore, to accurately detect known forgeries while ensuring high generalization ability of detecting unknown forgeries, we propose an intra-inter network (IIN) for face forgery detection (FFD) in videos with continual learning. The proposed IIN mainly consists of three modules, i.e., intra-module, inter-module, and forged trace masking module (FTMM). Specifically, the intra-module is trained for each kind of face forgeries by supervised learning to extract special features, while the inter-module is trained by self-supervised learning to extract the common features. As a result, the common and special features of the different forgeries are decoupled by the two feature learning modules, and then the decoupled common features can be utlized to achieve high generalization ability for FFD. Moreover, the FTMM is deployed for contrastive learning to further improve detection accuracy. The experimental results on FaceForensic++ dataset demonstrate that the proposed IIN outperforms the state-of-the-arts in FFD. Also, the generalization ability of the IIN verified on DFDC and Celeb-DF datasets demonstrates that the proposed IIN significantly improves the generalization ability for FFD.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1839-1850"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435251","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":"Approximation and Heuristic Algorithms for the Priority Facility Location Problem with Outliers","authors":"Hang Luo;Lu Han;Tianping Shuai;Fengmin Wang","doi":"10.26599/TST.2023.9010152","DOIUrl":"https://doi.org/10.26599/TST.2023.9010152","url":null,"abstract":"In this paper, we propose the Priority Facility Location Problem with Outliers (PFLPO), which is a generalization of both the Facility Location Problem with Outliers (FLPO) and Priority Facility Location Problem (PFLP). As our main contribution, we use the technique of primal-dual to provide a 3-approximation algorithm for the PFLPO. We also give two heuristic algorithms. One of them is a greedy-based algorithm and the other is a local search algorithm. Moreover, we compare the experimental results of all the proposed algorithms in order to illustrate their performance.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"29 6","pages":"1694-1702"},"PeriodicalIF":6.6,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10566010","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435248","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":"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}
{"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}