{"title":"ControlService: a containerized solution for control-algorithm-as-a-service in cloud control systems","authors":"Chenggang Shan, Runze Gao, Zhen Yang, Wei Zhang, Yuanqing Xia","doi":"10.1007/s11432-023-4017-0","DOIUrl":"https://doi.org/10.1007/s11432-023-4017-0","url":null,"abstract":"<p>As an extension of networked control systems, cloud control systems (CCSs) have emerged as a new control paradigm to improve the service quality of emerging control missions, such as data-driven modeling and automated vehicles. Existing studies have used the workflow-based restructured method to optimize the computation-intensive algorithms in the CCSs. However, the challenges here are how to define and submit these algorithms’ workflows as cloud services and execute these algorithms’ workflows in a containerized manner. Based on these challenges, we propose a containerized solution for the control-algorithm-as-a-service (C3aS) in the CCSs, namely ControlService. It offers the control algorithm as a cloud workflow service and uses a customized workflow engine to realize the containerized execution. First, we employ a cloud workflow representation method to define a control algorithm into an abstract cloud workflow form. Afterward, we provide a cloud service representation of the abstract cloud workflow. Next, we design a workflow engine and submit the cloud service to this workflow engine to implement containerized execution of this cloud service in the CCSs. In the experiment, we discuss the cloud service form and containerized implementation of the subspace identification method. Experimental results show that the proposed ControlService has significant performance advantages in computational time, reduction percentage, and speedup ratio compared with the baseline method.</p>","PeriodicalId":21618,"journal":{"name":"Science China Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.8,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141515964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distributed generalized Nash equilibrium seeking: event-triggered coding-decoding-based secure communication","authors":"Shaofu Yang, Wenying Xu, Wangli He, Jinde Cao","doi":"10.1007/s11432-023-4009-4","DOIUrl":"https://doi.org/10.1007/s11432-023-4009-4","url":null,"abstract":"<p>In this paper, we consider the distributed generalized Nash equilibrium (GNE) seeking problem in strongly monotone games. The transmission among players is implemented through a digital communication network with limited bandwidth. For improving communication efficiency or/and security, an event-triggered coding-decoding-based communication is first proposed, where the data (decision variable) are first mapped to a series of finite-level codewords and, only when an event condition is satisfied, then sent to the neighboring agents. Moreover, a distributed communication-efficient GNE seeking algorithm is constructed accordingly, and the overrelaxation scheme is further taken into consideration. Through primal-dual analysis, the proposed algorithm is proven to converge to a variational GNE with fixed step-sizes by recasting it as an inexact forward-backward iteration. Finally, numerical simulations illustrate the benefit of the proposed algorithms in terms of saving communication resources.</p>","PeriodicalId":21618,"journal":{"name":"Science China Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.8,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141530881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Path signature-based XAI-enabled network time series classification","authors":"Le Sun, Yueyuan Wang, Yongjun Ren, Feng Xia","doi":"10.1007/s11432-023-3978-y","DOIUrl":"https://doi.org/10.1007/s11432-023-3978-y","url":null,"abstract":"<p>Classifying network time series (NTS) is crucial for automating network administration and ensuring cyberspace security. It enables the detection of anomalies, the identification of network attacks, and the monitoring of performance issues, thereby providing valuable support for network protection and optimization. However, modern communication networks pose challenges for NTS classification methods. These include handling large-scale and complex NTS data, extracting features from intricate datasets, and addressing explainability requirements. These challenges are particularly pronounced for complex 5G networks. Notably, explainability has become crucial for the widespread deployment of network automation for 5G networks and beyond. To tackle these challenges, we propose a path-signature-based NTS classification model called recurrent signature (RecurSig). This innovative model is designed to overcome the time-consuming feature selection problem by utilizing deep-learning (DL) techniques. Additionally, it provides a solution for addressing the black-box issue associated with DL models in network automation systems (NAS) by incorporating an explainable classification approach. Extensive experimentation on various public datasets demonstrates that RecurSig outperforms existing models in accuracy and explainability. The results indicate its potential for application in cyberspace security and automated network management, offering an explainable solution for network protection and optimization.</p>","PeriodicalId":21618,"journal":{"name":"Science China Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.8,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141515956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Changhong Wang, Xudong Yu, Chenjia Bai, Qiaosheng Zhang, Zhen Wang
{"title":"Ensemble successor representations for task generalization in offline-to-online reinforcement learning","authors":"Changhong Wang, Xudong Yu, Chenjia Bai, Qiaosheng Zhang, Zhen Wang","doi":"10.1007/s11432-023-4028-1","DOIUrl":"https://doi.org/10.1007/s11432-023-4028-1","url":null,"abstract":"<p>In reinforcement learning (RL), training a policy from scratch with online experiences can be inefficient because of the difficulties in exploration. Recently, offline RL provides a promising solution by giving an initialized offline policy, which can be refined through online interactions. However, existing approaches primarily perform offline and online learning in the same task, without considering the task generalization problem in offline-to-online adaptation. In real-world applications, it is common that we only have an offline dataset from a specific task while aiming for fast online-adaptation for several tasks. To address this problem, our work builds upon the investigation of successor representations for task generalization in online RL and extends the framework to incorporate offline-to-online learning. We demonstrate that the conventional paradigm using successor features cannot effectively utilize offline data and improve the performance for the new task by online fine-tuning. To mitigate this, we introduce a novel methodology that leverages offline data to acquire an ensemble of successor representations and subsequently constructs ensemble <i>Q</i> functions. This approach enables robust representation learning from datasets with different coverage and facilitates fast adaption of <i>Q</i> functions towards new tasks during the online fine-tuning phase. Extensive empirical evaluations provide compelling evidence showcasing the superior performance of our method in generalizing to diverse or even unseen tasks.</p>","PeriodicalId":21618,"journal":{"name":"Science China Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.8,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141502710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhuo Li, Weiran Wu, Jialin Wang, Gang Wang, Jian Sun
{"title":"Continuous advantage learning for minimum-time trajectory planning of autonomous vehicles","authors":"Zhuo Li, Weiran Wu, Jialin Wang, Gang Wang, Jian Sun","doi":"10.1007/s11432-023-4059-6","DOIUrl":"https://doi.org/10.1007/s11432-023-4059-6","url":null,"abstract":"<p>This paper investigates the minimum-time trajectory planning problem of an autonomous vehicle. To deal with unknown and uncertain dynamics of the vehicle, the trajectory planning problem is modeled as a Markov decision process with a continuous action space. To solve it, we propose a continuous advantage learning (CAL) algorithm based on the advantage-value equation, and adopt a stochastic policy in the form of multivariate Gaussian distribution to encourage exploration. A shared actor-critic architecture is designed to simultaneously approximate the stochastic policy and the value function, which greatly reduces the computation burden compared to general actor-critic methods. Moreover, the shared actor-critic is updated with a loss function built as mean square consistency error of the advantage-value equation, and the update step is performed several times at each time step to improve data efficiency. Simulations validate the effectiveness of the proposed CAL algorithm and its better performance than the soft actor-critic algorithm.</p>","PeriodicalId":21618,"journal":{"name":"Science China Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.8,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141745993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An ensemble and cost-sensitive learning-based root cause diagnosis scheme for wireless networks with spatially imbalanced user data distribution","authors":"Qi Wang, Zhiwen Pan, Nan Liu","doi":"10.1007/s11432-023-4055-1","DOIUrl":"https://doi.org/10.1007/s11432-023-4055-1","url":null,"abstract":"<p>A novel feature extraction method that can tolerate imbalanced user data is proposed. A cost-sensitive SVM assigns different misclassification costs to faults with different severity levels to optimize the cause diagnosis process. The simulation results demonstrate the effectiveness and superiority of the proposed algorithm.</p>","PeriodicalId":21618,"journal":{"name":"Science China Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.8,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141516008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards imbalanced motion: part-decoupling network for video portrait segmentation","authors":"Tianshu Yu, Changqun Xia, Jia Li","doi":"10.1007/s11432-023-4030-y","DOIUrl":"https://doi.org/10.1007/s11432-023-4030-y","url":null,"abstract":"<p>Video portrait segmentation (VPS), aiming at segmenting prominent foreground portraits from video frames, has received much attention in recent years. However, the simplicity of existing VPS datasets leads to a limitation on extensive research of the task. In this work, we propose a new intricate large-scale multi-scene video portrait segmentation dataset MVPS consisting of 101 video clips in 7 scenario categories, in which 10843 sampled frames are finely annotated at the pixel level. The dataset has diverse scenes and complicated background environments, which is the most complex dataset in VPS to our best knowledge. Through the observation of a large number of videos with portraits during dataset construction, we find that due to the joint structure of the human body, the motion of portraits is part-associated, which leads to the different parts being relatively independent in motion. That is, the motion of different parts of the portraits is imbalanced. Towards this imbalance, an intuitive and reasonable idea is that different motion states in portraits can be better exploited by decoupling the portraits into parts. To achieve this, we propose a part-decoupling network (PDNet) for VPS. Specifically, an inter-frame part-discriminated attention (IPDA) module is proposed which unsupervisedly segments portrait into parts and utilizes different attentiveness on discriminative features specified to each different part. In this way, appropriate attention can be imposed on portrait parts with imbalanced motion to extract part-discriminated correlations, so that the portraits can be segmented more accurately. Experimental results demonstrate that our method achieves leading performance with the comparison to state-of-the-art methods.</p>","PeriodicalId":21618,"journal":{"name":"Science China Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.8,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141516007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rethinking attribute localization for zero-shot learning","authors":"Shuhuang Chen, Shiming Chen, Guo-Sen Xie, Xiangbo Shu, Xinge You, Xuelong Li","doi":"10.1007/s11432-023-4051-9","DOIUrl":"https://doi.org/10.1007/s11432-023-4051-9","url":null,"abstract":"<p>Recent advancements in attribute localization have showcased its potential in discovering the intrinsic semantic knowledge for visual feature representations, thereby facilitating significant visual-semantic interactions essential for zero-shot learning (ZSL). However, the majority of existing attribute localization methods heavily rely on classification constraints, resulting in accurate localization of only a few attributes while neglecting the rest important attributes associated with other classes. This limitation hinders the discovery of the intrinsic semantic relationships between attributes and visual features across all classes. To address this problem, we propose a novel attribute localization refinement (ALR) module designed to enhance the model’s ability to accurately localize all attributes. Essentially, we enhance weak discriminant attributes by grouping them and introduce weighted attribute regression to standardize the mapping values of semantic attributes. This module can be flexibly combined with existing attribute localization methods. Our experiments show that when combined with the ALR module, the localization errors in existing methods are corrected, and state-of-the-art classification performance is achieved.</p>","PeriodicalId":21618,"journal":{"name":"Science China Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.8,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141784755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhijia Zhao, Jiale Wu, Zhijie Liu, We He, C. L. Philip Chen
{"title":"Adaptive neural network control of a 2-DOF helicopter system considering input constraints and global prescribed performance","authors":"Zhijia Zhao, Jiale Wu, Zhijie Liu, We He, C. L. Philip Chen","doi":"10.1007/s11432-023-3949-3","DOIUrl":"https://doi.org/10.1007/s11432-023-3949-3","url":null,"abstract":"<p>In this study, an adaptive neural network (NN) control is proposed for nonlinear two-degree-of-freedom (2-DOF) helicopter systems considering the input constraints and global prescribed performance. First, radial basis function NN (RBFNN) is employed to estimate the unknown dynamics of the helicopter system. Second, a smooth nonaffine function is exploited to approximate and address nonlinear constraint functions. Subsequently, a new prescribed function is proposed, and an original constrained error is transformed into an equivalent unconstrained error using the error transformation and barrier function transformation methods. The analysis of the established Lyapunov function proves that the controlled system is globally uniformly bounded. Finally, the simulation and experimental results on a constructed Quanser’s test platform verify the rationality and feasibility of the proposed control.</p>","PeriodicalId":21618,"journal":{"name":"Science China Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.8,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141528790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Shor’s algorithm does not factor large integers in the presence of noise","authors":"Jin-Yi Cai","doi":"10.1007/s11432-023-3961-3","DOIUrl":"https://doi.org/10.1007/s11432-023-3961-3","url":null,"abstract":"<p>We consider Shor’s quantum factoring algorithm in the setting of noisy quantum gates. Under a generic model of random noise for (controlled) rotation gates, we prove that the algorithm does not factor integers of the form <i>pq</i> when the noise exceeds a vanishingly small level in terms of <i>n</i>—the number of bits of the integer to be factored, where <i>p</i> and <i>q</i> are from a well-defined set of primes of positive density. We further prove that with probability 1 − <i>o</i>(1) over random prime pairs (<i>p, q</i>), Shor’s factoring algorithm does not factor numbers of the form <i>pq</i>, with the same level of random noise present.</p>","PeriodicalId":21618,"journal":{"name":"Science China Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.8,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141502713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}