Flexible job shop scheduling problem(s) (FJSP) were study and discussed in large amount. However, it is still far from a real-world manufacturing environment, in which disruptions such as machine failure must be taken into account. The goal of this paper is to create a genetic algorithm (GA) with very special chromosome encoding to handle FJSP that can adapt to disruption to reflect more closely the real-world manufacturing environment. We hope that by using just-in-time machine assignment and adapting scheduling rules, we can achieve the robustness and flexibility we desire. After detailed algorithm design and description, experiments were carried out. In the experiments, we compared our novel approach to two benchmark algorithms: a right-shifting reschedule and a prescheduled. A right-shifting reschedule repairs schedules by delaying affected operations until the disruption is over. A prescheduled works on each disruption scenario separately, treating disruptions like prescheduled downtime. Experiments showed that our approach was able to adapt to disruptions in a manner that minimized lost time than compared benchmark algorithms.
{"title":"GA with Special Encoded Chromosome for FJSP with Machine Disruptions","authors":"H. Yin","doi":"10.1109/CIS.2013.70","DOIUrl":"https://doi.org/10.1109/CIS.2013.70","url":null,"abstract":"Flexible job shop scheduling problem(s) (FJSP) were study and discussed in large amount. However, it is still far from a real-world manufacturing environment, in which disruptions such as machine failure must be taken into account. The goal of this paper is to create a genetic algorithm (GA) with very special chromosome encoding to handle FJSP that can adapt to disruption to reflect more closely the real-world manufacturing environment. We hope that by using just-in-time machine assignment and adapting scheduling rules, we can achieve the robustness and flexibility we desire. After detailed algorithm design and description, experiments were carried out. In the experiments, we compared our novel approach to two benchmark algorithms: a right-shifting reschedule and a prescheduled. A right-shifting reschedule repairs schedules by delaying affected operations until the disruption is over. A prescheduled works on each disruption scenario separately, treating disruptions like prescheduled downtime. Experiments showed that our approach was able to adapt to disruptions in a manner that minimized lost time than compared benchmark algorithms.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121267890","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}
For piecewise-smooth images with neat boundaries, Tikhonov regularization usually makes images overly smooth, and first order nonconvex nonsmooth regularizations could cause staircase artifacts. Moreover, the image boundaries may be blurred by only utilizing the second difference to reduce staircase artifacts. To overcome above drawbacks, in this paper, piecewise-smooth images with neat boundaries are restored by the GNC method based on combining Tikhonov with different order nonconvex nonsmooth regularizations. This method could both restore the smooth parts and protect the neat boundaries more efficiently. The numerical results are used to show the restored performance of the proposed method.
{"title":"Image Restoration Combining Tikhonov with Different Order Nonconvex Nonsmooth Regularizations","authors":"X. Liu, Xingbao Gao, Qiufang Xue","doi":"10.1109/CIS.2013.59","DOIUrl":"https://doi.org/10.1109/CIS.2013.59","url":null,"abstract":"For piecewise-smooth images with neat boundaries, Tikhonov regularization usually makes images overly smooth, and first order nonconvex nonsmooth regularizations could cause staircase artifacts. Moreover, the image boundaries may be blurred by only utilizing the second difference to reduce staircase artifacts. To overcome above drawbacks, in this paper, piecewise-smooth images with neat boundaries are restored by the GNC method based on combining Tikhonov with different order nonconvex nonsmooth regularizations. This method could both restore the smooth parts and protect the neat boundaries more efficiently. The numerical results are used to show the restored performance of the proposed method.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122357914","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}
SMS4 is the first official released commercial cryptographic algorithm. It provides unified standards for designing and using local area wireless network product. The general DPA attack is not suitable for SMS4 owing to the ample random diffusion of the round output. This article proposed a new power analysis method for SMS4 to reduce the diffusion by chosen plaintext. Two means - Hamming distance model and bit model - are used to build the power model. Simulation results show that this method is effective and can be used in actual cryptographic circuit such as smart cards.
{"title":"A Power Analysis on SMS4 Using the Chosen Plaintext Method","authors":"Shutong Wang, Dawu Gu, Junrong Liu, Zheng Guo, Weijia Wang, Sigang Bao","doi":"10.1109/CIS.2013.163","DOIUrl":"https://doi.org/10.1109/CIS.2013.163","url":null,"abstract":"SMS4 is the first official released commercial cryptographic algorithm. It provides unified standards for designing and using local area wireless network product. The general DPA attack is not suitable for SMS4 owing to the ample random diffusion of the round output. This article proposed a new power analysis method for SMS4 to reduce the diffusion by chosen plaintext. Two means - Hamming distance model and bit model - are used to build the power model. Simulation results show that this method is effective and can be used in actual cryptographic circuit such as smart cards.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117030808","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}
Pointing at that Artificial Bee Colony Algorithm (ABC) has the defect of slow search speed and low precision, the article proposed an Improved Artificial Bee Colony Algorithm with Two-Eagle Strategy (ETABC) through using a kind of optimization method-Eagle Strategy, and proved the convergence of ETABC. The simulation results show that ETABC is more effective in solving optimization problems.
{"title":"Artificial Bee Colony Algorithm with Two-Stage Eagle Strategy","authors":"Rui-min Jia, Deng-xu He","doi":"10.1109/CIS.2013.11","DOIUrl":"https://doi.org/10.1109/CIS.2013.11","url":null,"abstract":"Pointing at that Artificial Bee Colony Algorithm (ABC) has the defect of slow search speed and low precision, the article proposed an Improved Artificial Bee Colony Algorithm with Two-Eagle Strategy (ETABC) through using a kind of optimization method-Eagle Strategy, and proved the convergence of ETABC. The simulation results show that ETABC is more effective in solving optimization problems.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123732002","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}
A customer churn analytical model based Bayesian network is built for prediction of customer churn. We propose Bayesian Network approaches to predict churn motivation, mining the result in churn characters in order to help decision-making manager formulate corresponding detainment strategy. Experimental results show that classification performance of both methods is resultful.
{"title":"Analytical Model of Customer Churn Based on Bayesian Network","authors":"Peng Sun, Xin Guo, Yunpeng Zhang, Zi-yan Wu","doi":"10.1109/CIS.2013.63","DOIUrl":"https://doi.org/10.1109/CIS.2013.63","url":null,"abstract":"A customer churn analytical model based Bayesian network is built for prediction of customer churn. We propose Bayesian Network approaches to predict churn motivation, mining the result in churn characters in order to help decision-making manager formulate corresponding detainment strategy. Experimental results show that classification performance of both methods is resultful.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126476801","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}
The security situation of the Internet of Things (IoT) is serious. IoT encounters security problems more than traditional computer networks does. The attributes of dispersity and mass of IoT require that approaches to IoT security should be dynamic. Inspired by immunology, a novel approach to IoT security is proposed in this paper. Traditional network security models are used for reference and special requests of IoT security are taken into account. A dynamic defense frame for IoT security is formed in the proposed approach. The links in the frame are correlated with relative data of IoT security. Performance in biological immunology is applied into some links to make the proposed approach be adaptive to IoT environment. The immunity-based antigen, self and detector in the real IoT environment are simulated. They are adopted to imitate the mechanisms which are used to recognize pathogens in biological immune systems. Simulation experiment results show that the proposed approach may provide a novel effective method to ensure IoT security.
{"title":"A Novel Approach to IoT Security Based on Immunology","authors":"Caiming Liu, Yan Zhang, Hua Zhang","doi":"10.1109/CIS.2013.168","DOIUrl":"https://doi.org/10.1109/CIS.2013.168","url":null,"abstract":"The security situation of the Internet of Things (IoT) is serious. IoT encounters security problems more than traditional computer networks does. The attributes of dispersity and mass of IoT require that approaches to IoT security should be dynamic. Inspired by immunology, a novel approach to IoT security is proposed in this paper. Traditional network security models are used for reference and special requests of IoT security are taken into account. A dynamic defense frame for IoT security is formed in the proposed approach. The links in the frame are correlated with relative data of IoT security. Performance in biological immunology is applied into some links to make the proposed approach be adaptive to IoT environment. The immunity-based antigen, self and detector in the real IoT environment are simulated. They are adopted to imitate the mechanisms which are used to recognize pathogens in biological immune systems. Simulation experiment results show that the proposed approach may provide a novel effective method to ensure IoT security.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126554036","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}
This paper is concerned with the output feedback control problem for a class of nonlinear system with time delay. First, a state feedback controller is design and a sufficient condition with exponential stability is obtained. Second, we study the observer design problem. And we proved that the observer designed in this paper ensure the observation error exponential converge to zero. Furthermore, output feedback controller using state feedback control and observer design is studied.
{"title":"The Design of Output Feedback Controller for a Class of Nonlinear Systems with Time-Delay","authors":"Ruliang Wang, Shanshang Zhang, Wen Huang","doi":"10.1109/CIS.2013.111","DOIUrl":"https://doi.org/10.1109/CIS.2013.111","url":null,"abstract":"This paper is concerned with the output feedback control problem for a class of nonlinear system with time delay. First, a state feedback controller is design and a sufficient condition with exponential stability is obtained. Second, we study the observer design problem. And we proved that the observer designed in this paper ensure the observation error exponential converge to zero. Furthermore, output feedback controller using state feedback control and observer design is studied.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121953071","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}
Server Virtualisation (SV) can improve the application efficiency of network sever resources, reduce the investment of hardware and less the cost of maintenance. This paper analyses that five key factors that are hardware cost, energy cost, software cost, maintenance cost and outage (or downtime) recovery cost in the Server Virtualisation. There a sample case is an university or a company what its application cost of the Server Virtualisation is examined and evaluated by contextual analysis. In addition, it will associate with the result of the case study to set out some critical suggestion in the concluding section.
{"title":"A Study on the Application Cost of Server Virtualisation","authors":"Jing Nie","doi":"10.1109/CIS.2013.176","DOIUrl":"https://doi.org/10.1109/CIS.2013.176","url":null,"abstract":"Server Virtualisation (SV) can improve the application efficiency of network sever resources, reduce the investment of hardware and less the cost of maintenance. This paper analyses that five key factors that are hardware cost, energy cost, software cost, maintenance cost and outage (or downtime) recovery cost in the Server Virtualisation. There a sample case is an university or a company what its application cost of the Server Virtualisation is examined and evaluated by contextual analysis. In addition, it will associate with the result of the case study to set out some critical suggestion in the concluding section.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132390699","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}
In the spectral-type subspace segmentation models, the rank minimization problem was relaxed as Nuclear Norm Minimization(NNM) problem. However, to guarantee the success of NNM, one needs some strict conditions, and NNM may yield the matrix with much higher rank than the real one. In this paper, the L1/2 regularization is introduced into the low-rank spectral-type subspace segmentation model, combining Augmented Lagrange Multiplier(ALM) method and half-threshold operator, a discrete algorithm to solve the proposed model is given. A large number of experiments in section IV demonstrate the effectiveness of our model in data clustering and image segmentation.
{"title":"L1/2 Regularization Based Low-Rank Image Segmentation Model","authors":"Xiujun Zhang, Chen Xu","doi":"10.1109/CIS.2013.87","DOIUrl":"https://doi.org/10.1109/CIS.2013.87","url":null,"abstract":"In the spectral-type subspace segmentation models, the rank minimization problem was relaxed as Nuclear Norm Minimization(NNM) problem. However, to guarantee the success of NNM, one needs some strict conditions, and NNM may yield the matrix with much higher rank than the real one. In this paper, the L1/2 regularization is introduced into the low-rank spectral-type subspace segmentation model, combining Augmented Lagrange Multiplier(ALM) method and half-threshold operator, a discrete algorithm to solve the proposed model is given. A large number of experiments in section IV demonstrate the effectiveness of our model in data clustering and image segmentation.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131735767","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}
W. Mai, Hai-Lin Liu, Lei Chen, Jiongcheng Li, Henghui Xiao
Planning of base stations (BS) is one of the fundamental problems in the fourth generation (4G) wireless network design. A new mathematical model for the 4G BS planning is proposed in this paper. The co-channel interference, orthogonal frequency division multiplexing (OFDM), the cell edge rate, the reference signal received power (RSRP) and the base station density are considered in detail in this model. The objectives of the model are to minimum construction cost, maximum coverage and capacity at the same time. It's a multiobjective optimization problem with constraints. So a multiobjective algorithm with a local search operator is designed to solve this model. Simulation results show that the according algorithm with local search operator can give a set of solutions with relatively lower cost, larger coverage, larger capacity and faster speed than the algorithm without local search operator. The effective and efficient of the proposed model can also be identified by the comparison of the solutions.
{"title":"Multi-objective Evolutionary Algorithm for 4G Base Station Planning","authors":"W. Mai, Hai-Lin Liu, Lei Chen, Jiongcheng Li, Henghui Xiao","doi":"10.1109/CIS.2013.25","DOIUrl":"https://doi.org/10.1109/CIS.2013.25","url":null,"abstract":"Planning of base stations (BS) is one of the fundamental problems in the fourth generation (4G) wireless network design. A new mathematical model for the 4G BS planning is proposed in this paper. The co-channel interference, orthogonal frequency division multiplexing (OFDM), the cell edge rate, the reference signal received power (RSRP) and the base station density are considered in detail in this model. The objectives of the model are to minimum construction cost, maximum coverage and capacity at the same time. It's a multiobjective optimization problem with constraints. So a multiobjective algorithm with a local search operator is designed to solve this model. Simulation results show that the according algorithm with local search operator can give a set of solutions with relatively lower cost, larger coverage, larger capacity and faster speed than the algorithm without local search operator. The effective and efficient of the proposed model can also be identified by the comparison of the solutions.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130799010","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
扫码关注我们
求助内容：
应助结果提醒方式：