Information Sciences最新文献_第10页

An adaptive helper and equivalent objective evolution strategy for constrained optimization 约束优化的自适应辅助和等效目标演化策略

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.ins.2024.121536

Tao Xu , Hongyang Chen , Jun He

{"title":"An adaptive helper and equivalent objective evolution strategy for constrained optimization","authors":"Tao Xu , Hongyang Chen , Jun He","doi":"10.1016/j.ins.2024.121536","DOIUrl":"10.1016/j.ins.2024.121536","url":null,"abstract":"<div><div>The matrix adaptation evolution strategy is a simplified covariance matrix adaptation evolution strategy with reduced computational cost. Using it as a search engine, several algorithms have been recently proposed for constrained optimization and have shown excellent performance. However, these algorithms require the simultaneous application of multiple techniques to handle constraints, and also require gradient information. This makes them inappropriate for handling non-differentiable functions. This paper proposes a new matrix adaption evolutionary strategy for constrained optimization using helper and equivalent objectives. The method optimizes two objectives but with no need for special handling of infeasible solutions and without gradient information. A new mechanism is designed to adaptively adjust the weights of the two objectives according to the convergence rate. The efficacy of the proposed algorithm is evaluated using computational experiments on the IEEE CEC 2017 Constrained Optimization Competition benchmarks. Experimental results demonstrate that it outperforms current state-of-the-art evolutionary algorithms. Furthermore, this paper provides sufficient conditions for the convergence of helper and equivalent objective evolutionary algorithms and proves that using helper objectives can reduce the likelihood of premature convergence.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121536"},"PeriodicalIF":8.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142434455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Hierarchical graph contrastive learning framework based on quantum neural networks for sentiment analysis 基于量子神经网络的层次图对比学习框架用于情感分析

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.ins.2024.121543

Keliang Jia, Fanxu Meng, Jing Liang

{"title":"Hierarchical graph contrastive learning framework based on quantum neural networks for sentiment analysis","authors":"Keliang Jia, Fanxu Meng, Jing Liang","doi":"10.1016/j.ins.2024.121543","DOIUrl":"10.1016/j.ins.2024.121543","url":null,"abstract":"<div><div>Existing multi-modal sentiment analysis (MSA) methods typically achieve interaction by connecting different layers or designing special structures, but rarely consider the synergistic effects among data. Moreover, most sentiment analysis research tends to focus solely on single sentiment polarity analysis, without considering the intensity and directional attributes of emotions. Addressing these issues, we propose a framework called Hierarchical Graph Contrastive Learning based on Quantum Neural Network (HGCL-QNN) to remedy these shortcomings. Specifically, a graph structure is established within and between modalities. In the quantum fuzzy neural network module, fuzzy quantum encoding is implemented by using complex-valued, then quantum superposition and entanglement are utilized to consider the intensity and directional attributes of emotions while analyzing emotional polarity. In the quantum multi-modal fusion neural network module, methods such as amplitude encoding and quantum entanglement are employed to further integrate information from different modalities, thereby enhancing the model's power to express emotional information. To enhance the model's understanding of fine-grained and global features, and to better align and integrate features from different modalities, hierarchical graph contrastive learning is employed on different levels. The experimental results demonstrate that HGCL-QNN outperforms the existing baseline methods on MOSI and MOSEI datasets, achieving significant efficacy improvements.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121543"},"PeriodicalIF":8.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142434458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Event-based integral sliding mode control for leader-follower consensus with perturbed agent dynamics 基于事件的积分滑模控制，实现具有扰动代理动态的领导者-追随者共识

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.ins.2024.121535

Tara Swaraj , Krishanu Nath , Manas Kumar Bera , Rajiv Kumar Mishra , Sudipta Chakraborty

{"title":"Event-based integral sliding mode control for leader-follower consensus with perturbed agent dynamics","authors":"Tara Swaraj , Krishanu Nath , Manas Kumar Bera , Rajiv Kumar Mishra , Sudipta Chakraborty","doi":"10.1016/j.ins.2024.121535","DOIUrl":"10.1016/j.ins.2024.121535","url":null,"abstract":"<div><div>This manuscript proposes the design of an event-triggered integral sliding mode (ET-ISM)-based distributed controller for multi-agent systems (MASs) to achieve consensus between the leader and followers. Specifically, we consider the MASs, having multi-input-multi-output (MIMO) linear dynamics with unknown bounded perturbations. The information flow in the network is modelled by the directed graph. The design of the continuous-time integral sliding mode (ISM) controller is discussed first, followed by an ET-ISM strategy using a novel triggering rule to avoid periodic communication between the leader and agents. Unlike the earlier works, our proposed method uses an event function entirely devoid of non-differentiable terms to define the triggering condition. The stability of robust closed-loop dynamics of the network is guaranteed using Lyapunov stability theory, and the existence of practical sliding motion (PSM) is established by calculating the band for PSM as well as the band of convergence of the disagreement vector. The Zeno-free behaviour of the closed-loop system is also ensured to show that the sampling is well-behaved means the triggering approach generates a finite number of events. Finally, we take up a numerical example to discuss the design process of the proposed controller and present the simulation results along with a detailed analysis.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121535"},"PeriodicalIF":8.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142434453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Revocable certificate-based broadcast signcryption scheme for edge-enabled IIoT 基于可撤销证书的边缘启用 IIoT 广播签名加密方案

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.ins.2024.121540

Yan Gao , Lunzhi Deng , Shuai Feng , Huan Liu , Binhan Li , Na Wang

{"title":"Revocable certificate-based broadcast signcryption scheme for edge-enabled IIoT","authors":"Yan Gao , Lunzhi Deng , Shuai Feng , Huan Liu , Binhan Li , Na Wang","doi":"10.1016/j.ins.2024.121540","DOIUrl":"10.1016/j.ins.2024.121540","url":null,"abstract":"<div><div>In edge computing-enabled Industrial Internet of Things (edge-enabled IIoT), edge computing facilitates data processing with reduced latency, enhanced reliability, and optimized real-time resource use. With the rapid increase in connected devices, ensuring secure data sharing among them is crucial. Broadcast signcryption technology is an excellent choice for achieving data confidentiality and authentication while enhancing operational efficiency. With devices potentially expiring, aging, or suffering damage, the prompt revocation of their decryption privileges is essential. Currently, there is a lack of research that simultaneously integrates broadcast signcryption with a revocation mechanism. In this paper, we propose a revocable certificate-based broadcast signcryption (RCB-BSC) scheme tailored for edge-enabled IIoT. In our work, base station generates a signcrypted ciphertext for multiple edge computing nodes (ECNs), and sends it to edge service (ES). The ES revokes the access of illegitimate ECNs and generates a new ciphertext for those ECNs with non-revoked decryption privileges, allowing them to decrypt the message using their private keys. Under the random oracle model (ROM), our scheme achieves plaintext confidentiality, ensures anonymity of receivers, and authenticates the legitimacy of the broadcaster. Moreover, the performance analysis shows our scheme excels in computation and communication efficiency, making it ideal for edge-enabled IIoT.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121540"},"PeriodicalIF":8.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142434397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Fuzzy serial-parallel stochastic configuration networks based on nonconvex dynamic membership function optimization 基于非凸动态成员函数优化的模糊串并联随机配置网络

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.ins.2024.121501

Jinghui Qiao , Jiayu Qiao , Peng Gao , Zhe Bai , Ningkang Xiong

{"title":"Fuzzy serial-parallel stochastic configuration networks based on nonconvex dynamic membership function optimization","authors":"Jinghui Qiao , Jiayu Qiao , Peng Gao , Zhe Bai , Ningkang Xiong","doi":"10.1016/j.ins.2024.121501","DOIUrl":"10.1016/j.ins.2024.121501","url":null,"abstract":"<div><div>A fuzzy series–parallel stochastic configuration networks (F-SPSCN) is proposed based on the application of nonconvex optimization in fuzzy systems. Firstly, the kernel density estimation method is used to fit the distribution of original input data to generate dynamic nonconvex membership functions, which enhances the fuzzy system ability to handle uncertain industrial data. Then the parameters of the nonconvex membership functions are optimized based on Majorization-Minimization algorithm and Generalized Projective Gradient Descent algorithm. The optimized membership matrices and fuzzy outputs are used as inputs of the serial-parallel stochastic configuration networks to improve the overall prediction accuracy of the model. Finally, the prediction accuracy of the F-SPSCN model has been verified by performing prediction experiments with two different functions and four benchmark datasets. The F-SPSCN model demonstrates superior performance compared to other models in predicting the magnetic separation recovery ratio (MSRR) of hydrogen-based mineral phase transformation (HMPT) process for refractory iron ore.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121501"},"PeriodicalIF":8.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142530610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A data anonymization methodology for security operations centers: Balancing data protection and security in industrial systems 安全运营中心的数据匿名化方法：平衡工业系统中的数据保护和安全

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.ins.2024.121534

Giacomo Longo , Francesco Lupia , Alessio Merlo , Francesco Pagano , Enrico Russo

引用次数: 0

Non-blocking functional dependency discovery from data streams 从数据流中发现非阻塞功能依赖关系

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.ins.2024.121531

Loredana Caruccio, Stefano Cirillo, Vincenzo Deufemia, Giuseppe Polese

{"title":"Non-blocking functional dependency discovery from data streams","authors":"Loredana Caruccio, Stefano Cirillo, Vincenzo Deufemia, Giuseppe Polese","doi":"10.1016/j.ins.2024.121531","DOIUrl":"10.1016/j.ins.2024.121531","url":null,"abstract":"<div><div>With the proliferation of sensors and IoT technologies, there is an increasing need to analyze information from data streams that they produce dynamically. However, the volume and velocity of this data require algorithms that mine knowledge as data are read from streams. The capability of dynamically extracting functional dependencies (<span>fd</span>s) from data streams would not only permit to assess and improve the quality of data, but also provide knowledge on the evolution of data correlations within streams, allowing to understand the relevance that each feature has in predicting unknown features. In this paper, we propose a new discovery algorithm, namely COD3, which allows to continuous discovery <span>fd</span>s holding on a data stream, as the data are read from it. COD3 represents the first proposal to use a non-blocking architectural model for discovering <span>fd</span>s from data streams. Furthermore, we present novel data structures and a validation method to handle dynamic discovery and reduce data load inbound streams. Experimental evaluations demonstrate its effectiveness on both adapted real-world datasets and real data streams, such as those from air quality sensors. Moreover, by integrating <span>COD</span>3 with Bleach, a well-known <span>fd</span>-based data stream cleansing framework, we demonstrate its effectiveness in a real-world use case.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121531"},"PeriodicalIF":8.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142434457","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

Adaptive sequential three-way decisions for dynamic time warping 动态时间扭曲的自适应顺序三向决策

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.ins.2024.121541

Jianfeng Xu , Ruihua Wang , Yuanjian Zhang , Weiping Ding

{"title":"Adaptive sequential three-way decisions for dynamic time warping","authors":"Jianfeng Xu , Ruihua Wang , Yuanjian Zhang , Weiping Ding","doi":"10.1016/j.ins.2024.121541","DOIUrl":"10.1016/j.ins.2024.121541","url":null,"abstract":"<div><div>Dynamic time warping (DTW) algorithm is widely used in diversified applications due to its excellent anti-deformation and anti-interference in measuring time-series based similarity. However, the high time complexity of DTW restrains the applicability of real-time case. The existing DTW acceleration studies suffer from a loss of accuracy. How to accelerate computation while maintaining satisfying computational accuracy remains challenging. Motivated by sequential three-way decisions, this paper develops a novel model with adaptive sequential three-way decisions for dynamic time warping (AS3-DTW). Firstly, we systematically summarize distance differences under the context of adjacent tripartite search spaces for DTW, and propose five patterns of granularity adjustments of the search spaces. Furthermore, we present the corresponding calculation method of DTW adjacent tripartite search spaces distances difference. Finally, we construct a novel dynamism on adaptively adjusting time warping by combining sequence-based multi-granularity with sequential three-way decisions. Experimental results show that AS3-DTW effectively achieves promising trade-off between computational speed and accuracy on multiple UCR datasets when compared with the state-of-the-art algorithms.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121541"},"PeriodicalIF":8.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142434456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Enhancing network robustness with structural prior and evolutionary techniques 用结构先验和进化技术增强网络鲁棒性

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-09 DOI: 10.1016/j.ins.2024.121529

Jie Huang , Ruizi Wu , Junli Li

{"title":"Enhancing network robustness with structural prior and evolutionary techniques","authors":"Jie Huang , Ruizi Wu , Junli Li","doi":"10.1016/j.ins.2024.121529","DOIUrl":"10.1016/j.ins.2024.121529","url":null,"abstract":"<div><div>Robustness optimization in complex networks is a critical research area due to its implications for the reliability and stability of various systems. However, existing algorithms encounter two key challenges: the lack of integration of prior network knowledge, leading to suboptimal solutions, and high computational costs, which hinder their practical application. To address these challenges, this paper introduces Eff-R-Net, an efficient evolutionary algorithm framework aimed at enhancing the robustness of complex networks through accelerated evolution. Eff-R-Net leverages global and local network information, featuring a novel three-part composite crossover operator. Prior network knowledge is incorporated in mutation and local search operators to expedite the construction of networks with superior robustness. Additionally, a simplified method for calculating robustness enhances efficiency, while adaptive hyper-parameters dynamically adjust operators execution probabilities for optimal evolution. Extensive evaluations on both synthetic (Scale-Free, Erdös-Rényi, and Small-World) and three infrastructure real-world networks demonstrate the superiority of Eff-R-Net. The algorithm improves robustness by 12.8% and reduces computational time by 25.4% compared to state-of-the-art algorithm in real-world network experiments. These findings underscore Eff-R-Net's versatility and potential in enhancing network robustness across different domains.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121529"},"PeriodicalIF":8.1,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Enhanced tensor based embedding anchor learning for multi-view clustering 基于张量的增强型嵌入式锚点学习，用于多视角聚类

IF 8.1 1区计算机科学

Information Sciences Pub Date : 2024-10-09 DOI: 10.1016/j.ins.2024.121532

Beihua Yang, Peng Song, Yuanbo Cheng, Shixuan Zhou, Zhaowei Liu

{"title":"Enhanced tensor based embedding anchor learning for multi-view clustering","authors":"Beihua Yang, Peng Song, Yuanbo Cheng, Shixuan Zhou, Zhaowei Liu","doi":"10.1016/j.ins.2024.121532","DOIUrl":"10.1016/j.ins.2024.121532","url":null,"abstract":"<div><div>Existing anchor graph based multi-view clustering methods can overcome the problem of high computational cost in traditional multi-view clustering methods. However, the anchor points selected from high-dimensional data often contain irrelevant noise and outliers, which would affect the clustering performance. To address this issue, we propose an embedding anchor based multi-view clustering method, called enhanced tensor based embedding anchor learning (ETEAL). Specifically, we unify the learning process of latent embedding space, anchor points, and anchor graphs into a common framework, which eliminates noise and redundant data in the original space and enhances the synergistic optimization between the components. Meanwhile, we employ an enhanced tensor strategy to constrain the embedding anchor graphs, which exploits the higher-order relationships between views and recovers the global low-rank property of the embedding anchor graphs. Finally, we develop an anchor graph fusion strategy, which significantly reduces the huge overhead of traditional graph fusion that requires the construction of complete graphs. Experimental results on eight benchmark datasets show that the proposed method significantly outperforms other state-of-the-art methods in terms of scalability and clustering accuracy.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121532"},"PeriodicalIF":8.1,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0