Int. J. Comput. Commun. Control最新文献_第8页

PLDANet: Reasonable Combination of PCA and LDA Convolutional Networks PLDANet: PCA与LDA卷积网络的合理结合

Int. J. Comput. Commun. Control Pub Date : 2022-02-08 DOI: 10.15837/ijccc.2022.2.4541

Caicai Zhang, Mei Mei, Zhuolin Mei, Junkang Zhang, Anyuan Deng, Chenglang Lu

引用次数: 4

Fault Detection in Nuclear Power Plants using Deep Leaning based Image Classification with Imaged Time-series Data 基于时间序列图像数据的深度学习图像分类在核电厂故障检测中的应用

Int. J. Comput. Commun. Control Pub Date : 2022-02-03 DOI: 10.15837/ijccc.2022.1.4714

Yong Shi, Xiaodong Xue, Jiayu Xue, Yi Qu

{"title":"Fault Detection in Nuclear Power Plants using Deep Leaning based Image Classification with Imaged Time-series Data","authors":"Yong Shi, Xiaodong Xue, Jiayu Xue, Yi Qu","doi":"10.15837/ijccc.2022.1.4714","DOIUrl":"https://doi.org/10.15837/ijccc.2022.1.4714","url":null,"abstract":"Fault detection is critical to ensure the safely routine operations in nuclear power plants (NPPs), requiring very high accuracy and efficiency. Meanwhile, the rapid development of modern information technologies have profoundly changed and promoted various sectors including nuclear industry. Inspired by the great progress and promising performance of deep learning based image classification recent years, a two-stage fault detection methodology in NPPs has been proposed in this paper. First the time-series data describing the operating status of NPPs have been transformed into two-dimensional images by four methods, preserving the time-series information in images and converting the fault detection problem into a supervised image classification task. Then four specific image classifying models based on three primary deep learning architectures have been separately experimented on the imaged time-series data, achieving excellent accuracies. Further the performances of different combinations of transforming means and classifying models have been compared and discussed with extensive experiments and detailed analysis of throughput for four transforming methods. This methodology proposed has obtained remarkable results by reshaping data format and structure, making image classifying models applicable, which not only efficiently detect and warn possible faults in NPPs but also enhances the capability for safety management in nuclear power systems.","PeriodicalId":179619,"journal":{"name":"Int. J. Comput. Commun. Control","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121223512","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}

引用次数: 3

Segmentation Method of Magnetic Tile Surface Defects Based on Deep Learning 基于深度学习的磁砖表面缺陷分割方法

Int. J. Comput. Commun. Control Pub Date : 2022-01-25 DOI: 10.15837/ijccc.2022.2.4502

Yu An, Yinan Lu, Tie-ru Wu

{"title":"Segmentation Method of Magnetic Tile Surface Defects Based on Deep Learning","authors":"Yu An, Yinan Lu, Tie-ru Wu","doi":"10.15837/ijccc.2022.2.4502","DOIUrl":"https://doi.org/10.15837/ijccc.2022.2.4502","url":null,"abstract":"Magnet tile is an essential part of various industrial motors, and its performance significantly affects the use of the motor. Various defects such as blowholes, break, cracks, fray, uneven, etc., may appear on the surface of the magnet tile. At present, most of these defects rely on manual visual inspection. To solve the problems of slow speed and low accuracy of segmentation of different defects on the magnetic tile surface, in this paper, we propose a segmentation method of the weighted YOLACT model. The proposed model uses the resnet101 network as the backbone, obtains multi-scale features through the weighted feature pyramid network, and performs two parallel subtasks simultaneously: generating a set of prototype masks and predicting the mask coefficients of each target. In the prediction mask coefficient branch, the residual structure and weights are introduced. Then, masks are generated by linearly combining the prototypes and the mask coefficients to complete the final target segmentation. The experimental results show that the proposed method achieves 43.44/53.44 mask and box mAP on the magnetic tile surface defect dataset, and the segmentation speed reaches 24.40 fps, achieving good segmentation results.","PeriodicalId":179619,"journal":{"name":"Int. J. Comput. Commun. Control","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117279465","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}

引用次数: 3

In Memoriam: Prof. Ioan Dzitac - Editorial 纪念:Ioan Dzitac教授-社论

Int. J. Comput. Commun. Control Pub Date : 2022-01-24 DOI: 10.15837/ijccc.2022.1.4694

F. Filip

引用次数: 0

Improve the design and testing of fuzzy systems with a set of (almost) simple rules 用一组(几乎)简单的规则改进模糊系统的设计和测试

Int. J. Comput. Commun. Control Pub Date : 2022-01-19 DOI: 10.15837/ijccc.2022.1.4683

H. Teodorescu

引用次数: 0

Broadcast Guidance of Multi-Agent Systems 多智能体系统的广播制导

Int. J. Comput. Commun. Control Pub Date : 2022-01-14 DOI: 10.15837/ijccc.2022.1.4678

I. Segall, A. Bruckstein

{"title":"Broadcast Guidance of Multi-Agent Systems","authors":"I. Segall, A. Bruckstein","doi":"10.15837/ijccc.2022.1.4678","DOIUrl":"https://doi.org/10.15837/ijccc.2022.1.4678","url":null,"abstract":"We consider the emergent behavior of a group of mobile agents guided by an exogenous broadcast signal. The agents’ dynamics is modelled by single integrators and they are assumed oblivious to their own position, however they share a common orientation (i.e. they have compasses). The broadcast control, a desired velocity vector, is detected by arbitrary subgroups of agents,that upon receipt of the guidance signal become \"ad-hoc\" leaders. The control signal and the set of leaders are assumed to be constant over some considerable intervals in time. A system without \"ad-hoc\" leaders is referred to as autonomous. The autonomous rule of motion is identical for all agents and is a gathering process ensuring a cohesive group. The agents that become leaders upon receipt of the exogenous control add the detected broadcast velocity to the velocity vector dictated by the autonomous rule of motion. This paradigm was considered in conjunction with several models of cohesive dynamics, linear and non-linear, with fixed inter-agent interaction topology, as well as systems with neighborhood based topology determined by the inter-agent distances. The autonomous dynamics of the models considered provides cohesion to the swarm, while, upon detection of a broadcast velocity vector, the leaders guide the group of agents in the direction of the control. For each local cohesion interaction model we analyse the effect of the broadcast velocity and of the set of leaders on the emergent behavior of the system. We show that in all cases considered the swarm moves in the direction of the broadcast velocity signal with speed set by the number of agents receiving the control and in a constellation determined by the model and the subset of \"ad-hoc\" leaders. All results are illustrated by simulations.","PeriodicalId":179619,"journal":{"name":"Int. J. Comput. Commun. Control","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133577622","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

Travel preference of bicycle-sharing users: A multi-granularity sequential pattern mining approach 共享单车用户出行偏好:一种多粒度顺序模式挖掘方法

Int. J. Comput. Commun. Control Pub Date : 2022-01-11 DOI: 10.15837/ijccc.2022.1.4673

Yu Zhou, Mengdie Zhang, Gang Kou, Yiming Li

引用次数: 4

Random Permutation Set 随机排列集

Int. J. Comput. Commun. Control Pub Date : 2022-01-10 DOI: 10.15837/ijccc.2022.1.4542

Yong Deng

{"title":"Random Permutation Set","authors":"Yong Deng","doi":"10.15837/ijccc.2022.1.4542","DOIUrl":"https://doi.org/10.15837/ijccc.2022.1.4542","url":null,"abstract":"For exploring the meaning of the power set in evidence theory, a possible explanation of power set is proposed from the view of Pascal’s triangle and combinatorial number. Here comes the question: what would happen if the combinatorial number is replaced by permutation number? To address this issue, a new kind of set, named as random permutation set (RPS), is proposed in this paper, which consists of permutation event space (PES) and permutation mass function (PMF). The PES of a certain set considers all the permutation of that set. The elements of PES are called the permutation events. PMF describes the chance of a certain permutation event that would happen. Based on PES and PMF, RPS can be viewed as a permutation-based generalization of random finite set. Besides, the right intersection (RI) and left intersection (LI) of permutation events are presented. Based on RI and LI, the right orthogonal sum (ROS) and left orthogonal sum (LOS) of PMFs are proposed. In addition, numerical examples are shown to illustrate the proposed conceptions. The comparisons of probability theory, evidence theory, and RPS are discussed and summarized. Moreover, an RPS-based data fusion algorithm is proposed and applied in threat assessment. The experimental results show that the proposed RPS-based algorithm can reasonably and efficiently deal with uncertainty in threat assessment with respect to threat ranking and reliability ranking.","PeriodicalId":179619,"journal":{"name":"Int. J. Comput. Commun. Control","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128388189","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}

引用次数: 95

First Responders' Localization and Health Monitoring During Rescue Operations 救援行动中第一响应者的定位与健康监测

Int. J. Comput. Commun. Control Pub Date : 2022-01-10 DOI: 10.15837/ijccc.2022.1.4665

A. Simo, S. Dzitac, Domnica Dzitac

引用次数: 0

Information Bottleneck in Deep Learning - A Semiotic Approach 深度学习中的信息瓶颈——符号学方法

Int. J. Comput. Commun. Control Pub Date : 2022-01-09 DOI: 10.15837/ijccc.2022.1.4650

Bogdan Musat, Razvan Andonie

{"title":"Information Bottleneck in Deep Learning - A Semiotic Approach","authors":"Bogdan Musat, Razvan Andonie","doi":"10.15837/ijccc.2022.1.4650","DOIUrl":"https://doi.org/10.15837/ijccc.2022.1.4650","url":null,"abstract":"\u0000 \u0000 \u0000The information bottleneck principle was recently proposed as a theory meant to explain some of the training dynamics of deep neural architectures. Via information plane analysis, patterns start to emerge in this framework, where two phases can be distinguished: fitting and compression. We take a step further and study the behaviour of the spatial entropy characterizing the layers of convolutional neural networks (CNNs), in relation to the information bottleneck theory. We observe pattern formations which resemble the information bottleneck fitting and compression phases. From the perspective of semiotics, also known as the study of signs and sign-using behavior, the saliency maps of CNN’s layers exhibit aggregations: signs are aggregated into supersigns and this process is called semiotic superization. Superization can be characterized by a decrease of entropy and interpreted as information concentration. We discuss the information bottleneck principle from the perspective of semiotic superization and discover very interesting analogies related to the informational adaptation of the model. In a practical application, we introduce a modification of the CNN training process: we progressively freeze the layers with small entropy variation of their saliency map representation. Such layers can be stopped earlier from training without a significant impact on the performance (the accuracy) of the network, connecting the entropy evolution through time with the training dynamics of a network. \u0000 \u0000 \u0000","PeriodicalId":179619,"journal":{"name":"Int. J. Comput. Commun. Control","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130420870","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}

引用次数: 4