检索结果-内蒙古大学图书馆

Petri Net Control Method for Pipe-line Systems and Its Implementation via CIF3 ⁎

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2019年第24期52卷 261-266页

作者： YuHao Fu JiLiang Luo Huifeng Wu Jianhong Ye Yi-sheng Huang College Information Science and Engineering Huaqiao University Xiamen 361021 China College Information Science and Engineering Huaqiao University Xiamen 361021 China and also with Fujian Engineering Research Center of Motor Control and System Optimal Schedule Xiamen 361021 China Institute of Intelligent and Software Technology Hangzhou Dianzi University Hangzhou 310018 China Computer Science and Technology Huaqiao University Xiamen 361021 China and also with Fujian Provincial Key Laboratory of Data Intensive Computing Quanzhou 362000 China Department of Electrical Engineering National Ilan University Taiwan

As for a pipe-line system subjected to complex operations, an approach is proposed to synthesize the controller via Petri nets (PNs) such that the plant is run as concurrently as possible and the loads of equipments are balanced. A P-timed and labeled PN is designed to model the whole process of a pipe-line system, where tasks, including transporting material from one tank to another and cleaning tank, are represented by operational places, and level sensors amounted in tanks are represented by labels assigned to transitions. Further, monitor places are designed to resolve the conflict relations among tasks due to the shared valves and pipes. An method is presented to translate an PN controller into a CIF3 (Compositional Interchange Format) model, which can be converted into a PLC program in the CIF3 tool. A beer filtration plant is taken as an example to illustrate the approach, and its simulation experiments are carried out to verify the theoretic results.

关键词： Chemical plant Valve control Petri net CIF3

Shape robust text detection with progressive scale expansion network

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Wang, Wenhai Xie, Enze Li, Xiang Hou, Wenbo Lu, Tong Yu, Gang Shao, Shuai National Key Lab for Novel Software Technology Nanjing University Department of Comuter Science and Technology Tongji University School of Computer and Engineering Nanjing University of Science and Technology Momenta Technology Inc PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China

Scene text detection has witnessed rapid progress especially with the recent development of convolutional neural networks. However, there still exists two challenges which prevent the algorithm into industry applications. On the one hand, most of the state-of-art algorithms require quadrangle bounding box which is in-accurate to locate the texts with arbitrary shape. On the other hand, two text instances which are close to each other may lead to a false detection which covers both instances. Traditionally, the segmentation-based approach can relieve the first problem but usually fail to solve the second challenge. To address these two challenges, in this paper, we propose a novel Progressive Scale Expansion Network (PSENet), which can precisely detect text instances with arbitrary shapes. More specifically, PSENet generates the different scale of kernels for each text instance, and gradually expands the minimal scale kernel to the text instance with the complete shape. Due to the fact that there are large geometrical margins among the minimal scale kernels, our method is effective to split the close text instances, making it easier to use segmentation-based methods to detect arbitrary-shaped text instances. Extensive experiments on CTW1500, Total-Text, ICDAR 2015 and ICDAR 2017 MLT validate the effectiveness of PSENet. Notably, on CTW1500, a dataset full of long curve texts, PSENet achieves a F-measure of 74.3% at 27 FPS, and our best F-measure (82.2%) outperforms state-of-art algorithms by 6.6%. The code will be released in the future. Copyright © 2019, The Authors. All rights reserved.

关键词： Chemical detection

Lockout-Tagout Ransomware: A Detection Method for Ransomware using Fuzzy Hashing and Clustering

学校读者我要写书评

暂无评论

Lockout-Tagout Ransomware: A Detection Method for Ransomware...

IEEE Symposium Series on Computational Intelligence (SSCI)

作者： Nitin Naik Paul Jenkins Jonathan Gillett Haralambos Mouratidis Kshirasagar Naik Jingping Song School of Computing University of Portsmouth United Kingdom Faculty of Science and Technology Bournemouth University United Kingdom Centre for Secure Intelligent and Usable Systems University of Brighton United Kingdom Department of Electrical and Computer Engineering University of Waterloo Canada Software College Northeastern University China

ISBN: (数字)9781728124858

ISBN: (纸本)9781728124865

Ransomware attacks are a prevalent cybersecurity threat to every user and enterprise today. This is attributed to their polymorphic behaviour and dispersion of inexhaustible versions due to the same ransomware family or threat actor. A certain ransomware family or threat actor repeatedly utilises nearly the same style or codebase to create a vast number of ransomware versions. Therefore, it is essential for users and enterprises to keep well-informed about this threat landscape and adopt proactive prevention strategies to minimise its spread and affects. This requires a technique to detect ransomware samples to determine the similarity and link with the known ransomware family or threat actor. Therefore, this paper presents a detection method for ransomware by employing a combination of a similarity preserving hashing method called fuzzy hashing and a clustering method. This detection method is applied on the collected WannaCry/WannaCryptor ransomware samples utilising a range of fuzzy hashing and clustering methods. The clustering results of various clustering methods are evaluated through the use of the internal evaluation indexes to determine the accuracy and consistency of their clustering results, thus the effective combination of fuzzy hashing and clustering method as applied to the particular ransomware corpus. The proposed detection method is a static analysis method, which requires fewer computational overheads and performs rapid comparative analysis with respect to other static analysis methods.

关键词： Ransomware Clustering methods Indexes Cryptography Engines Syntactics

Selective kernel networks

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Li, Xiang Wang, Wenhai Hu, Xiaolin Yang, Jian PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China Momenta National Key Lab for Novel Software Technology Nanjing University Department of Computer Science and Technology Tsinghua University China

In standard Convolutional Neural Networks (CNNs), the receptive fields of artificial neurons in each layer are designed to share the same size. It is well-known in the neuroscience community that the receptive field size of visual cortical neurons are modulated by the stimulus, which has been rarely considered in constructing CNNs. We propose a dynamic selection mechanism in CNNs that allows each neuron to adaptively adjust its receptive field size based on multiple scales of input information. A building block called Selective Kernel (SK) unit is designed, in which multiple branches with different kernel sizes are fused using softmax attention that is guided by the information in these branches. Different attentions on these branches yield different sizes of the effective receptive fields of neurons in the fusion layer. Multiple SK units are stacked to a deep network termed Selective Kernel Networks (SKNets). On the ImageNet and CIFAR benchmarks, we empirically show that SKNet outperforms the existing state-of-the-art architectures with lower model complexity. Detailed analyses show that the neurons in SKNet can capture target objects with different scales, which verifies the capability of neurons for adaptively adjusting their receptive field sizes according to the input. The code and models are available at https://***/implus/SKNet. Copyright © 2019, The Authors. All rights reserved.

关键词： Neurons

Protecting privacy of users in brain-computer interface applications

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Agarwal, Anisha Dowsley, Rafael McKinney, Nicholas D. Wu, Dongrui Lin, Chin-Teng De Cock, Martine Nascimento, Anderson C.A. School of Engineering and Technology University of Washington TacomaWA98402 United States Department of Computer Science Bar-Ilan University Israel School of Engineering and Technology University of Washington TacomaWA98402 United States Key Laboratory of the Ministry of Education for Image Processing and Intelligent Control School of Automation Huazhong University of Science and Technology Wuhan China School of Software University of Technology Sydney Australia Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent9000 Belgium

Machine learning (ML) is revolutionizing research and industry. Many ML applications rely on the use of large amounts of personal data for training and inference. Among the most intimate exploited data sources is electroencephalogram (EEG) data, a kind of data that is so rich with information that application developers can easily gain knowledge beyond the professed scope from unprotected EEG signals, including passwords, ATM PINs, and other intimate data. The challenge we address is how to engage in meaningful ML with EEG data while protecting the privacy of users. Hence, we propose cryptographic protocols based on Secure Multiparty Computation (SMC) to perform linear regression over EEG signals from many users in a fully privacy-preserving (PP) fashion, i.e. such that each individual's EEG signals are not revealed to anyone else. To illustrate the potential of our secure framework, we show how it allows estimating the drowsiness of drivers from their EEG signals as would be possible in the unencrypted case, and at a very reasonable computational cost. Our solution is the first application of commodity-based SMC to EEG data, as well as the largest documented experiment of secret sharing based SMC in general, namely with 15 players involved in all the computations. Copyright © 2019, The Authors. All rights reserved.

关键词： Machine learning

Erratum: EFNet: evidence fusion network for tumor segmentation from PET-CT volumes (2021 Phys. Med. Biol.66 205005)

学校读者我要写书评

暂无评论

Physics in medicine and biology 2021年第24期66卷

作者： Zhaoshuo Diao Huiyan Jiang Xian-Hua Han Yu-Dong Yao Tianyu Shi Software College Northeastern University Shenyang 110819 People's Republic of China. Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang 110819 People's Republic of China. Graduate School of Sciences and Technology for Innovation Yamaguchi University Yamaguchi-shi 7538511 Japan. Department of Electrical and Computer Engineering Stevens Institute of Technology Hoboken NJ 07030 United States of America.

Secure Beamforming Design for MISO SWIPT Systems: An Indirectly Optimized Approach

学校读者我要写书评

暂无评论

Secure Beamforming Design for MISO SWIPT Systems: An Indirec...

2019 IEEE Global Communications Conference (GLOBECOM)

作者： Yao Yu Siyu Wang Shumei Liu Lei Guo Zhaolong Ning Shimin Gong Mohammad S. Obaidat School of Computer Science and Engineering Northeastern University Shenyang China Chongqing University of Posts and Telecommunications China State Key Laboratory for Novel Software Technology Nanjing University China School of Intelligent Systems Engineering Sun Yat-sen University China ECE Department Nazarbayev University Astana Kazakhstan College of Computing and Informatics University of Sharjah UAE The King Abdullah II School of Information Technology The University of Jordan Amman Jordan University of Science and Technology Beijing China

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

By considering the Simultaneous Wireless Information and Power Transfer (SWIPT) schemes, this paper focuses on secure transmission model design in multiple-input-single-output (MISO) channels. In these channels, the channel state information is assumed to be perfect. Our objective is to maximize the worst-case secrecy rate with respect to both potential eavesdroppers and obvious eavesdroppers under the constraints of energy-harvesting and total transmission power. We present an optimization model to indirectly obtain maximum security rate in a single receiver system. Due to the high computational complexity of the solution process caused by the formulated non-convex optimization problem, we propose a novel indirect method to handle this issue. Then, a Semi-Definite Programming (SDP) relaxation method is used to approach the optimal solution. Moreover, we reveal the conditions for ensuring that the above semi-definite relaxation is compact. Simulation results demonstrate that the gained performance in our system is much better than those of the existing competing schemes.

关键词： Receivers Interference Signal to noise ratio Transmitters Optimization Security Communication system security

Simultaneous spectral-spatial feature selection and extraction for hyperspectral images

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhang, Lefei Zhang, Qian Du, Bo Huang, Xin Tang, Yuan Yan Tao, Dacheng State Key Laboratory of Software Engineering School of Computer Wuhan University Wuhan430072 China Beijing Samsung Telecom R&D Center Beijing100028 China School of Remote Sensing and Information Engineering Wuhan University Wuhan430072 China Department of Computer and Information Science University of Macau Macau999078 China Centre for Quantum Computation and Intelligent Systems Faculty of Engineering and Information Technology University of Technology SydneyNSW2007 Australia

In hyperspectral remote sensing data mining, it is important to take into account of both spectral and spatial information, such as the spectral signature, texture feature and morphological property, to improve the performances, e.g., the image classification accuracy. In a feature representation point of view, a nature approach to handle this situation is to concatenate the spectral and spatial features into a single but high dimensional vector and then apply a certain dimension reduction technique directly on that concatenated vector before feed it into the subsequent classifier. However, multiple features from various domains definitely have different physical meanings and statistical properties, and thus such concatenation hasn't efficiently explore the complementary properties among different features, which should benefit for boost the feature discriminability. Furthermore, it is also difficult to interpret the transformed results of the concatenated vector. Consequently, finding a physically meaningful consensus low dimensional feature representation of original multiple features is still a challenging task. In order to address the these issues, we propose a novel feature learning framework, i.e., the simultaneous spectral-spatial feature selection and extraction algorithm, for hyperspectral images spectralspatial feature representation and classification. Specifically, the proposed method learns a latent low dimensional subspace by projecting the spectral-spatial feature into a common feature space, where the complementary information has been effectively exploited, and simultaneously, only the most significant original features have been transformed. Encouraging experimental results on three public available hyperspectral remote sensing datasets confirm that our proposed method is effective and efficient. Copyright © 2019, The Authors. All rights reserved.

关键词： Feature extraction

Accumulative time-based ranking method to reputation evaluation in information networks

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Liao, Hao Liu, Qi-Xin Huang, Ze-Cheng Yeung, Chi Ho Zhang, Yi-Cheng National Engineering Laboratory on Big Data System Computing Technology Guangdong Province Engineering Center of China-made High Performance Data Computing System College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Institute of Big Data Intelligent Management and Decision Shenzhen University Shenzhen518060 China Department of Science and Environmental Studies The Education University of Hong Kong Hong Kong Hong Kong Department of Physics University of Fribourg Fribourg Switzerland

With the rapid development of modern technology, the Web has become an important platform for users to make friends and acquire information. However, since information on the Web is over-abundant, information filtering becomes a key task for online users to obtain relevant suggestions. As most Websites can be ranked according to users’ rating and preferences, relevance to queries, and recency, how to extract the most relevant item from the over-abundant information is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed accumulative time-based ranking (ATR) algorithm, we incorporate two behavioral weighting factors which are updated when users select or rate items, to reflect the evolution of user reputation and item quality over time. We showed that our algorithm outperforms state-of-the-art ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Copyright © 2019, The Authors. All rights reserved.

关键词： Information filtering