Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00119
Chaozhi Huang, Guobin Yang, Haidong Chen, Xiping Liu
The radial force has a unique impact on vibration and noise to Switched Reluctance Motor (SRM) which limit its application. The rectangular slot on the top of stator can decrease the radial force where the original unidirectional radial flux density component is decomposed into radial and tangential ones. The air-gap magnetic field is divided 4 regions before and after slotting in this paper, where magnetic field line is simulated with the parabola type and straight line. The influence of the stator slot on radial force, torque ripple and average torque of SRM is analyzed by means of theoretical calculation and the Finite Element Method (FEM). It is proved that the slotted structure can effectively suppress radial force and that the degree of inhibition is affected by the slot width while the average torque slightly decreases with slot on the top of stator.
{"title":"Inhibitory Effect of Radial Force to Switched Reluctance Motor with Stator Pole Slot","authors":"Chaozhi Huang, Guobin Yang, Haidong Chen, Xiping Liu","doi":"10.1109/CIS2018.2018.00119","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00119","url":null,"abstract":"The radial force has a unique impact on vibration and noise to Switched Reluctance Motor (SRM) which limit its application. The rectangular slot on the top of stator can decrease the radial force where the original unidirectional radial flux density component is decomposed into radial and tangential ones. The air-gap magnetic field is divided 4 regions before and after slotting in this paper, where magnetic field line is simulated with the parabola type and straight line. The influence of the stator slot on radial force, torque ripple and average torque of SRM is analyzed by means of theoretical calculation and the Finite Element Method (FEM). It is proved that the slotted structure can effectively suppress radial force and that the degree of inhibition is affected by the slot width while the average torque slightly decreases with slot on the top of stator.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127080818","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00045
Fan Zhang, Yong Wang, Miao Ye
Convolution neural network (CNN) has achieved great performance in network traffic classification problem. However, it needs large-scale training set to achieve better classification performance while decreases the accuracy result in the case of the small dataset. To solve this problem, this paper proposed a traffic classification algorithm based on the improved capsule neural network (CapsNet), which replaces the scalar feature output of CNN with vector output, and replaces the max-pooling with consistent routing, and disturbs some values in the capsule to reconstruct images. The experimental results show that the proposed method have a robust performance compared with the existing CNN method when processing small data sets, which corresponds the fact that the grayscale images output by the reconstruction module can make the classification results easier to understand.
{"title":"Network Traffic Classification Method Based on Improved Capsule Neural Network","authors":"Fan Zhang, Yong Wang, Miao Ye","doi":"10.1109/CIS2018.2018.00045","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00045","url":null,"abstract":"Convolution neural network (CNN) has achieved great performance in network traffic classification problem. However, it needs large-scale training set to achieve better classification performance while decreases the accuracy result in the case of the small dataset. To solve this problem, this paper proposed a traffic classification algorithm based on the improved capsule neural network (CapsNet), which replaces the scalar feature output of CNN with vector output, and replaces the max-pooling with consistent routing, and disturbs some values in the capsule to reconstruct images. The experimental results show that the proposed method have a robust performance compared with the existing CNN method when processing small data sets, which corresponds the fact that the grayscale images output by the reconstruction module can make the classification results easier to understand.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125080471","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00055
Chao Deng
with the development of big data and Internet of things, the application of electronic label have been more and more widely. The data security of electronic label has a direct impact on the security of the carrier, data encryption technology is a common means to ensure data security. This algorithm takes S50 as an example, put forward a kind of encryption algorithm of high-frequency electronic label, using ISO/IEC14443/Type-A protocol, with S50 electronic label UID code as calculation factor, with customized long string as divergence factor, and the key system of 16 sector is calculated by PSAM card, so as to realize the security of electronic label S50 authentication, at the same time realize the internal logic authentication and external MAC code authentication of the electronic label.
{"title":"Research of S50 Based Electronic Label Authentication Algorithm","authors":"Chao Deng","doi":"10.1109/CIS2018.2018.00055","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00055","url":null,"abstract":"with the development of big data and Internet of things, the application of electronic label have been more and more widely. The data security of electronic label has a direct impact on the security of the carrier, data encryption technology is a common means to ensure data security. This algorithm takes S50 as an example, put forward a kind of encryption algorithm of high-frequency electronic label, using ISO/IEC14443/Type-A protocol, with S50 electronic label UID code as calculation factor, with customized long string as divergence factor, and the key system of 16 sector is calculated by PSAM card, so as to realize the security of electronic label S50 authentication, at the same time realize the internal logic authentication and external MAC code authentication of the electronic label.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125083384","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00013
Xingyin Wang, Yuping Wang, Junhua Liu, Sixin Guo, Liwen Liu
Many real world problems can be formulated as many objective optimization problems (MaOPs) which can not be solved easily. Although a lot of many-objective evolutionary algorithms(MOEAs) have been proposed, balancing the diversity and convergence is still an unsolved issue. In this paper, a two-archive based evolutionary algorithm based on adaptive reference point and decomposition method is proposed. Firstly, we use binary indicator to update convergence archive(CA). Then, we use the updated CA to generate adaptive reference points. Furthermore, we update diversity archive (DA) with modified penalty-based boundary intersection approach. Finally, the proposed algorithm has been tested on DTLZ1-DTLZ4 and WFG1-WFG9 benchmark problems with 10-22 objectives, and is compared with three state-of-art algorithms. The experimental results indicate that the proposed algorithm has great advantage to handle many-objective optimization.
{"title":"Two-Archive Based Evolutionary Algorithm Using Adaptive Reference Direction and Decomposition for Many-Objective Optimization","authors":"Xingyin Wang, Yuping Wang, Junhua Liu, Sixin Guo, Liwen Liu","doi":"10.1109/CIS2018.2018.00013","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00013","url":null,"abstract":"Many real world problems can be formulated as many objective optimization problems (MaOPs) which can not be solved easily. Although a lot of many-objective evolutionary algorithms(MOEAs) have been proposed, balancing the diversity and convergence is still an unsolved issue. In this paper, a two-archive based evolutionary algorithm based on adaptive reference point and decomposition method is proposed. Firstly, we use binary indicator to update convergence archive(CA). Then, we use the updated CA to generate adaptive reference points. Furthermore, we update diversity archive (DA) with modified penalty-based boundary intersection approach. Finally, the proposed algorithm has been tested on DTLZ1-DTLZ4 and WFG1-WFG9 benchmark problems with 10-22 objectives, and is compared with three state-of-art algorithms. The experimental results indicate that the proposed algorithm has great advantage to handle many-objective optimization.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123455735","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}
Pub Date : 2018-11-01DOI: 10.1109/cis2018.2018.00006
{"title":"CIS 2018 Organizing Committee","authors":"","doi":"10.1109/cis2018.2018.00006","DOIUrl":"https://doi.org/10.1109/cis2018.2018.00006","url":null,"abstract":"","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125415864","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00074
Jiading Wang, Hejun Xuan, Yuping Wang, Yuanchao Yang, Sen Liu
In this paper, the problem of routing and spectrum assignment for static connection requests in elastic optical networks (EONs) is studied. Two different ratios of blocking formations are adopted, and a global constraint optimization model is established to minimize the ratio of blocking in the network. First, we propose an availability index of the frequency slots in the path. Second, a strategy of routing is designed by considering the two indexes of path length and availability index to judge the quality of the path. Then, a greedy strategy, which can obtain the largest availability index in the path after the frequency slot allocated, is proposed for the sake of assigning the spectra effectively. Simulation experiments were carried out in two network topologies. The two different ratios of blocking are obtained for different sorting strategy for connection requests and the number of connection requests. The experimental results show that the routing and spectrum assignment scheme designed in this paper can get a small ratio of blocking.
{"title":"Optimization Model and Algorithm for Routing and Spectrum Assignment in Elastic Optical Networks","authors":"Jiading Wang, Hejun Xuan, Yuping Wang, Yuanchao Yang, Sen Liu","doi":"10.1109/CIS2018.2018.00074","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00074","url":null,"abstract":"In this paper, the problem of routing and spectrum assignment for static connection requests in elastic optical networks (EONs) is studied. Two different ratios of blocking formations are adopted, and a global constraint optimization model is established to minimize the ratio of blocking in the network. First, we propose an availability index of the frequency slots in the path. Second, a strategy of routing is designed by considering the two indexes of path length and availability index to judge the quality of the path. Then, a greedy strategy, which can obtain the largest availability index in the path after the frequency slot allocated, is proposed for the sake of assigning the spectra effectively. Simulation experiments were carried out in two network topologies. The two different ratios of blocking are obtained for different sorting strategy for connection requests and the number of connection requests. The experimental results show that the routing and spectrum assignment scheme designed in this paper can get a small ratio of blocking.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129574737","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00077
Haiye Qiao
Wireless positioning technology is used to get the target position by sending a certain frequency signal in a certain space, then collect, detect, analyze the difference of feedback signal and signal sent. In order to reduce the chance of the collision of the signal in the air, the positioning algorithm is implemented by the segmentation positioning method. The key technology of segmented positioning lies in accurate ranging. Due to the complex and changeable working environment, there are large errors in the single time domain reflection method. In order to overcome this disadvantage, a comprehensive ranging analysis method is proposed in this thesis, i.e. the frequency-domain reflection and time-domain reflection integrated ranging is used to precisely separate the resistor part and capacitance part in the feedback waveform, and the feedback waveform is analyzed by wavelet transform to achieve the accurate positioning.
{"title":"An Algorithm of Segmentation Positioning Analysis Based on CSS","authors":"Haiye Qiao","doi":"10.1109/CIS2018.2018.00077","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00077","url":null,"abstract":"Wireless positioning technology is used to get the target position by sending a certain frequency signal in a certain space, then collect, detect, analyze the difference of feedback signal and signal sent. In order to reduce the chance of the collision of the signal in the air, the positioning algorithm is implemented by the segmentation positioning method. The key technology of segmented positioning lies in accurate ranging. Due to the complex and changeable working environment, there are large errors in the single time domain reflection method. In order to overcome this disadvantage, a comprehensive ranging analysis method is proposed in this thesis, i.e. the frequency-domain reflection and time-domain reflection integrated ranging is used to precisely separate the resistor part and capacitance part in the feedback waveform, and the feedback waveform is analyzed by wavelet transform to achieve the accurate positioning.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128432467","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}
Pub Date : 2018-11-01DOI: 10.1109/cis2018.2018.00008
{"title":"CIS 2018 Additional Reviewers","authors":"","doi":"10.1109/cis2018.2018.00008","DOIUrl":"https://doi.org/10.1109/cis2018.2018.00008","url":null,"abstract":"","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123350239","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00033
Miaomiao Chen, Fengshan Bai
In order to make x ray image recognition to apply to BP neural network effectively. Firstly, preprocess x ray image and k-mean segmentation image, extract image feature, The extracted feature as input of BP neural network for training and testing network. Standard BP neural network and improved BP neural network are used to recognize x ray image of this paper, then compare learning rate, training error and recognition rate of two algorithms. Innovation is using improved BP network model to detect the target object. It can successfully detect the object of x ray image with covered by other object or without occlusion. Experiment shows that improved BP neural network has faster learning rate, less error, high recognition rate, it can identify and detect the target object of x ray image effectively.
{"title":"Research of X Ray Image Recognition Based on Neural Network","authors":"Miaomiao Chen, Fengshan Bai","doi":"10.1109/CIS2018.2018.00033","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00033","url":null,"abstract":"In order to make x ray image recognition to apply to BP neural network effectively. Firstly, preprocess x ray image and k-mean segmentation image, extract image feature, The extracted feature as input of BP neural network for training and testing network. Standard BP neural network and improved BP neural network are used to recognize x ray image of this paper, then compare learning rate, training error and recognition rate of two algorithms. Innovation is using improved BP network model to detect the target object. It can successfully detect the object of x ray image with covered by other object or without occlusion. Experiment shows that improved BP neural network has faster learning rate, less error, high recognition rate, it can identify and detect the target object of x ray image effectively.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114231733","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00063
Xinzhong Xu, Liancheng Zhang, Juwei Yan
Compared with passive flow correlation technology, active flow watermarking technology has the advantages of high accuracy and low false positive rate in the aspects of stepping stone attack tracking and anonymous abuser association. Multi-flow attack can detect the existence of flow watermark, restore the flow watermark, and even remove the flow watermark from target watermarked flow. To improve the multi-flow attack resistance capability of flow rate-based direct sequence spread spectrum (DSSS) flow watermarking technology, a pseudo-noise (PN) code diversification based spread spectrum flow watermarking technology is proposed. Each watermark bit is spread by different PN code fragments before embedded into target flow, which can eliminate the inter-dependence between these watermarked flows and effectively defend against multi-flow attack. Compared with the embedding position randomization method, the complexity of our proposed technology is low and the false positive rate doesn't increase. Compared with the watermark bit reordering method, our proposed technology is more suitable for the DSSS flow watermarking technology and the multi-flow attack resistant effect is better.
{"title":"PN Code Diversification Based Spread Spectrum Flow Watermarking Technology","authors":"Xinzhong Xu, Liancheng Zhang, Juwei Yan","doi":"10.1109/CIS2018.2018.00063","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00063","url":null,"abstract":"Compared with passive flow correlation technology, active flow watermarking technology has the advantages of high accuracy and low false positive rate in the aspects of stepping stone attack tracking and anonymous abuser association. Multi-flow attack can detect the existence of flow watermark, restore the flow watermark, and even remove the flow watermark from target watermarked flow. To improve the multi-flow attack resistance capability of flow rate-based direct sequence spread spectrum (DSSS) flow watermarking technology, a pseudo-noise (PN) code diversification based spread spectrum flow watermarking technology is proposed. Each watermark bit is spread by different PN code fragments before embedded into target flow, which can eliminate the inter-dependence between these watermarked flows and effectively defend against multi-flow attack. Compared with the embedding position randomization method, the complexity of our proposed technology is low and the false positive rate doesn't increase. Compared with the watermark bit reordering method, our proposed technology is more suitable for the DSSS flow watermarking technology and the multi-flow attack resistant effect is better.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126496354","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：