2019 6th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)最新文献

筛选
英文 中文
Association Rules Hiding via Multi-Objective Differential Evolution Algorithm 基于多目标差分进化算法的关联规则隐藏
Nankun Mu, Fan Yang
{"title":"Association Rules Hiding via Multi-Objective Differential Evolution Algorithm","authors":"Nankun Mu, Fan Yang","doi":"10.1109/ICCSS48103.2019.9115471","DOIUrl":"https://doi.org/10.1109/ICCSS48103.2019.9115471","url":null,"abstract":"Association rules (ARs) mining has been widely used in discovering interesting patterns from massive data as a key data mining technique. However, this mining technique may lead to the disclosure of sensitive ARs, and thus, the ARs hiding strategy is very important and necessary. In this paper, a novel ARs hiding method (DEvoArH) is proposed for hiding the ARs. Noting that there are three side-effects in ARs hiding (ARH), i.e., the hiding failure rate, the lost rules rate, and the ghost rules rate, a multi-objective differential evolution algorithm is carefully designed. Specifically, the Pareto-optimal solutions are defined as the elite set, and then each solution is capable of learning from the elite set with a certain probability. Considering the convergence speed and search ability, a directional mutation and random mutate round is introduced into the mutation operator. Besides, to further decrease the data change rate, a database pre-processing mechanism is proposed to filter the unrelated data before the hiding process. Finally, the results of the comparison experiments also demonstrate the superiority of the proposed ARH method in terms of the three side-effects and efficiency.","PeriodicalId":431083,"journal":{"name":"2019 6th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115431964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Differential Privacy Optimal Consensus for Multiagent System by Using Functional Perturbation 基于函数摄动的多智能体系统差分隐私最优共识
Xiangyu Bu, Tao Dong
{"title":"Differential Privacy Optimal Consensus for Multiagent System by Using Functional Perturbation","authors":"Xiangyu Bu, Tao Dong","doi":"10.1109/ICCSS48103.2019.9115459","DOIUrl":"https://doi.org/10.1109/ICCSS48103.2019.9115459","url":null,"abstract":"Optimal consensus algorithm is affective algorithm using for distributed system, which makes each agent realize consensus and minimize the cost function. However, cooperative control requires that the agents exchange information in the public channel, which means that the important information disclosure may appear. To solve the problem, in this paper, we propose a differential privacy optimal algorithm by adding functional perturbation. By using the convex properties, the mean square consensus conditions are obtained. In addition, we analyze the privacy-preserving level and compute the sensitivity of the differential privacy at the same time. At last, the simulation is given to show the effectiveness of the theoretical results.","PeriodicalId":431083,"journal":{"name":"2019 6th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126647105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Row-Stochastic Matrices Based Distributed Optimization Algorithm With Uncoordinated Step-Sizes 基于行随机矩阵的非协调步长分布优化算法
Huaqing Li, Jinmeng Wang, Zheng Wang
{"title":"Row-Stochastic Matrices Based Distributed Optimization Algorithm With Uncoordinated Step-Sizes","authors":"Huaqing Li, Jinmeng Wang, Zheng Wang","doi":"10.1109/ICCSS48103.2019.9115478","DOIUrl":"https://doi.org/10.1109/ICCSS48103.2019.9115478","url":null,"abstract":"This paper investigates the distributed optimization problem over multi-agent networks, in which the target of agents is to collaboratively optimize the sum of all local objective functions. Each local objective function is uniquely known by a single agent. We concentrate on the scenario where communication among agents is portrayed as directed graphs. Based on the exact first order method, a fully distributed optimization algorithm is proposed to deal with the optimization problem. The proposed algorithm utilizes row-stochastic matrices and uncoordinated step-sizes, which exactly drives all agents to converge to the global optimization solution. Under the assumptions that the global objective function is strong convex and the local objective functions have Lipschitz continuous gradient, we show that the proposed algorithm linearly converges to the global optimization solution as long as the maximum step-size of agents does not exceed an explicitly characterized upper bound. Finally, numerical experiments are presented to demonstrate the correctness of theoretical analysis.","PeriodicalId":431083,"journal":{"name":"2019 6th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130263370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Robust $H_{infty}$ Control Based on Event-Triggered Optimization 基于事件触发优化的稳健$H_{infty}$控制
J. Lu, Y. Fan, Teng Li
{"title":"Robust $H_{infty}$ Control Based on Event-Triggered Optimization","authors":"J. Lu, Y. Fan, Teng Li","doi":"10.1109/ICCSS48103.2019.9115434","DOIUrl":"https://doi.org/10.1109/ICCSS48103.2019.9115434","url":null,"abstract":"For linear systems, the robust control under the event-triggered optimization mechanism is analyzed. Firstly, on basic of time-triggering and event-triggering mechanism, the system optimization performance index is given and the optimized controller is designed. When the external interference is zero, the proof of the asymptotic stability of the linear systems is given. When the external interference is not zero, the system has interference suppression level γ of $H_{infty}$ control. Then, the Zeno behavior of the linear system is analyzed, and a positive minimum event-triggering time interval is given by derivation. Finally, system simulation demonstrates the proposed algorithm's correctness.","PeriodicalId":431083,"journal":{"name":"2019 6th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121738842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Optimal Transmission Channel Selection Algorithm for Emergency Communication 一种用于应急通信的最优传输信道选择算法
Xidong Zhang, Heng Zhang, Wenhong Liu, Baojun Song, Hongbo Zhang, Shujie Zhu
{"title":"An Optimal Transmission Channel Selection Algorithm for Emergency Communication","authors":"Xidong Zhang, Heng Zhang, Wenhong Liu, Baojun Song, Hongbo Zhang, Shujie Zhu","doi":"10.1109/ICCSS48103.2019.9115479","DOIUrl":"https://doi.org/10.1109/ICCSS48103.2019.9115479","url":null,"abstract":"An optimal transmission channel selection algorithm based on AHP (Analytical Hierarchy Process) aiming at fulfilling the demand of emergency communication scenario is proposed in this paper. In the process of the algorithm, a Specifications Vector Library is set up based on communication requirement presetting, meanwhile, a Weight Vector Library is set up according to the definition of the importance of the specifications. By matching the available network channel resources and the two Vector Libraries, a communication link scheme is produced with an AHP based decision making process to strike a balance between transmission efficiency and economy under the restraint of the available communication network channel resource condition.","PeriodicalId":431083,"journal":{"name":"2019 6th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"21 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132288638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Exponential synchronization of memristive Cohen-Grossberg neural networks with hybrid time delays 混合时滞记忆性Cohen-Grossberg神经网络的指数同步
Yinghua Zhou, Jiamin Quan, Hongyi Liu, Huiyu Nie
{"title":"Exponential synchronization of memristive Cohen-Grossberg neural networks with hybrid time delays","authors":"Yinghua Zhou, Jiamin Quan, Hongyi Liu, Huiyu Nie","doi":"10.1109/ICCSS48103.2019.9115476","DOIUrl":"https://doi.org/10.1109/ICCSS48103.2019.9115476","url":null,"abstract":"The paper focuses on the issue of global exponential synchronization for a type of impulsive memristive Cohen-Grossberg neural networks with hybrid time delays. By applying the impulsive functional differential equations, constructing suitable Lyapunov function and contradiction method, several corresponding easy-to-check criteria are derived. Moreover, the research findings in this paper can be easily used to verify or improve the conditions deduced in most of existing literature related to the stability or synchronization for impulsive memristive neural networks. A simulation is represented to checkout the validity of the theory at the end of the paper.","PeriodicalId":431083,"journal":{"name":"2019 6th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125883479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
$H_{infty}$ control for T-S fuzzy systems with aperiodic sampling $H_{infty}$ 非周期采样T-S模糊系统的控制
Jinnan Luo, Wenhong Tian, S. Zhong, Daixi Liao, Jun Cheng, Kaibo Shi
{"title":"$H_{infty}$ control for T-S fuzzy systems with aperiodic sampling","authors":"Jinnan Luo, Wenhong Tian, S. Zhong, Daixi Liao, Jun Cheng, Kaibo Shi","doi":"10.1109/ICCSS48103.2019.9115464","DOIUrl":"https://doi.org/10.1109/ICCSS48103.2019.9115464","url":null,"abstract":"This study focuses on $H_{infty}$ control for T-S fuzzy systems with variable sampling. By utilizing the information of the state, an improved Lyapunov-Krasovskii functional (LKF) is constructed, together with free-weighted approach and aperiodic sampling techniques, further results are presented to ensure the T-S fuzzy systems to be asymptotically stable. Moreover, the $H_{infty}$ controller is devised with a larger sampling interval. Finally, the merits of the proposed results are affirmed by a truck-trailer system.","PeriodicalId":431083,"journal":{"name":"2019 6th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114161330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Delay System Approach to Networked Control System via An Event-triggered Scheme 基于事件触发方案的网络控制系统延迟方法
Feng Hu, Xiaojie Su
{"title":"A Delay System Approach to Networked Control System via An Event-triggered Scheme","authors":"Feng Hu, Xiaojie Su","doi":"10.1109/ICCSS48103.2019.9115474","DOIUrl":"https://doi.org/10.1109/ICCSS48103.2019.9115474","url":null,"abstract":"This paper concerns a controller design problem for proposed networked control system, the networked control system contains multiple delays in the state. The event-triggered mechanism is also considered to save resources of the communication network. Firstly, a system with two successive delay components via an event-triggered scheme is constructed, then results on stability and $H_{infty}$ performance are derived for networked control system by use of Lyapunov-Krasovskii functional, after that, the event-triggered controller is designed. Finally, a numerical example is given to demonstrate the advantage of proposed result.","PeriodicalId":431083,"journal":{"name":"2019 6th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133631005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A recurrent neural network for optimal energy management considering the battery cycle-life in smart grid 考虑电池循环寿命的智能电网最优能量管理递归神经网络
Miao Sun, Xing He
{"title":"A recurrent neural network for optimal energy management considering the battery cycle-life in smart grid","authors":"Miao Sun, Xing He","doi":"10.1109/ICCSS48103.2019.9115477","DOIUrl":"https://doi.org/10.1109/ICCSS48103.2019.9115477","url":null,"abstract":"This paper proposes a combined battery energy management (CBEM) model against the background of smart grid, which focus on the absorptive ability of Battery Energy Storage System (BESS) distinguishing to the traditional energy management. To solve the CBEM model, an one-layer recurrent neural network (RNN) is recommended. Furthermore, by considering the peak and valley periods division prices, the generators absorption and the distribution network bought from power grid are optimized. Meanwhile, the emission cost is considered in total cost and there is a corresponding constraint to control the emission and the outputs of generators. Finally, the effectiveness of the CBEM model is verified on Matlab. With the fluctuation of electrical price, the charge model and discharge model of BESS are showed. Results indicate that this model performs well in cutting the load in peak time and storage energy in valley time.","PeriodicalId":431083,"journal":{"name":"2019 6th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117280674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Fast Method of Function Approximation using Broad Learning System 一种基于广义学习系统的快速函数逼近方法
Yuzhuo Ma, Tie-shan Li, Y. Zuo, C. L. Philip Chen, Liang'en Yuan, Qihe Shan
{"title":"A Fast Method of Function Approximation using Broad Learning System","authors":"Yuzhuo Ma, Tie-shan Li, Y. Zuo, C. L. Philip Chen, Liang'en Yuan, Qihe Shan","doi":"10.1109/ICCSS48103.2019.9115446","DOIUrl":"https://doi.org/10.1109/ICCSS48103.2019.9115446","url":null,"abstract":"In this paper, A new method is applied to approach function -The Broad Learning System (BLS). Due to the complexity of the system in actual engineering, when the traditional algorithm handles the approximation problem, it faces problems such as complicated calculations and severe time consumption. To solve the above problems, the BLS uses the way of network horizontal expansion, horizontal extension and vertical immobility. Input data is mapped to feature nodes as feature vectors of the network, and then connected enhancement nodes by random weights, the enhancement node and the function node are spliced together as an input layer, and then directly connected to the output of the system. Finally, compared with traditional algorithms: back propagation neural network (BPNN), Radial Basis Function neural network (RBFNN), the results of experiments show that the function approximation method based on the BLS in this paper can make the system use less time under the premise of ensuring the approximation accuracy. This result provides the possibility of real-time and high-precision approximation for other intelligent algorithms.","PeriodicalId":431083,"journal":{"name":"2019 6th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122062903","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书