{"title":"A Teaching-Learning-Based Optimization with Uniform Design for Solving Constrained Optimization Problems","authors":"Liping Jia, Zhonghua Li","doi":"10.1109/CIS.2017.00058","DOIUrl":"https://doi.org/10.1109/CIS.2017.00058","url":null,"abstract":"As a newly developed population-based metaheuristic algorithm, teaching-learning-based optimization (TBLO) has been gained extensively attention since it was proposed in 2011. It has been applied to many optimal problems and a lot of algorithms have also been designed to solve these real-world problems. In this paper, TBLO with uniform design is proposed for solving constrained optimization problems. The performance of the proposed algorithm is checked by experiments with two type of different benchmark problems under the criteria of best, mean, worst, function evaluations and ratio of feasible search space. Compared results are given to illustrate the efficiency of the proposed algorithm.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115315334","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}
{"title":"Regression Model of Autonomous Lateral Rectification with Driver Perception","authors":"Liang Qiao, H. Bao, Zuxing Xuan, Qing Yang","doi":"10.1109/CIS.2017.00096","DOIUrl":"https://doi.org/10.1109/CIS.2017.00096","url":null,"abstract":"It is usually hard for autonomous vehicle to perform human-likely in lateral rectification between desired path and ego-vehicle, since those methods choose linear preview point according to speed. This paper presents a regression model of autonomous lateral rectification with driver perception to describe relationship between preview point and speed. It is shown in Driver Perception Model(DPM) that logarithmic relationship between speed and preview point distance. Experimental results show that compared with lateral rectification of Stanley method, regression model of autonomous lateral rectification with driver perception can 1) acquire lower lateral acceleration, which enhances comfort; 2) promote robustness of algorithm on parameter tuning.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121031696","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}
{"title":"Social Networks Privacy Preserving Data Publishing","authors":"S. Bourahla, Y. Challal","doi":"10.1109/CIS.2017.00063","DOIUrl":"https://doi.org/10.1109/CIS.2017.00063","url":null,"abstract":"The proliferation of social networks allowed creating a big quantity of data which contains rich private information that should be preserved. In this paper we consider social networks that are represented as labeled bipartite graphs where each node can have a set of information representing its profile. We propose a solution that allows publishing the social network graphs while preserving the privacy of data. We identify a critical \"safety partitioning condition\" which has provable guarantees to prevent variety of privacy attacks. We demonstrate the utility of our solution by studying the accuracy with which complex queries can be answered over the anonymized data.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122123501","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}
{"title":"Secure System Logon Based on IBC and Mobile Terminal","authors":"Y. Liu, Yihong Long, Xu Zhou, Fen Li","doi":"10.1109/CIS.2017.00130","DOIUrl":"https://doi.org/10.1109/CIS.2017.00130","url":null,"abstract":"Password-based authentication is widely used due to its simplicity but it is not secure. Systems with high security requirements often employ public key infrastructure (PKI) technology, but PKI is complex and requires users to perform certificate related operations manually. Furthermore, it requires portable cryptographic hardware devices such USB keys to secure the users' private keys and to perform the cryptographic operations. This imposes additional costs on the users, and these devices may not work in some cases such as when the USB ports of a computer are sealed or removed due to security consideration. To address these issues, we propose a secure system logon approach based on identity based cryptography (IBC) and mobile terminal, with three different schemes, and analyze the advantages of the proposed schemes. The approach presented is promising.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129961302","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}
{"title":"An Algorithm for Global Optimization Based on CFO-BFGS","authors":"Ruiqi Sun","doi":"10.1109/CIS.2017.00054","DOIUrl":"https://doi.org/10.1109/CIS.2017.00054","url":null,"abstract":"Evolutionary algorithm has some drawbacks, such as premature convergence. To overcome these problems, this article proposed a hybrid algorithm of Central Force Optimization (CFO) and BFGS method. A new mutation operator are constructed to balance the exploration and exploitation. Several benchmark functions are selected to test the validity of hybrid algorithm. The numerical experiment results show that new algorithm is effective for solving global optimization problems.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124622159","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}
{"title":"Forward Vehicle Detection Based on Incremental Learning and Fast R-CNN","authors":"Kaijing Shi, H. Bao, Nan Ma","doi":"10.1109/CIS.2017.00024","DOIUrl":"https://doi.org/10.1109/CIS.2017.00024","url":null,"abstract":"Recently the research of vehicle detection is mainly through machine learning, but it still has low detection accuracy problem. With the study of researchers, using deep learning methods of vehicle detection becomes hot. In this paper, a selective search method and a target detection model based on Fast R-CNN are used to detect vehicle. The strategy optimizes the model by preprocessing the sample image and the new network structure. Firstly, the experiment uses the public KITTI data set and self-collected BUU-T2Y data set, respectively, for training validation and test. Secondly, based on the original data set, the experiments go on through incremental learning, combining the KITTI dataset with the BUU-T2Y dataset. The experimental results show that the proposed method is superior to the result of multi-feature and classifier detection in terms of accuracy. To a large extent, the proposed method solved the problem of missing vehicle for detection and improved the accuracy of vehicle testing and robustness.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130680956","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}
{"title":"Research on Emotional Word Clustering Based on Affinity Propagation","authors":"Bin Gui, Qiong Shen","doi":"10.1109/CIS.2017.00040","DOIUrl":"https://doi.org/10.1109/CIS.2017.00040","url":null,"abstract":"In this paper, the affinity propagation algorithm algorithm(AP) and its related parameters are studied, and the volatility is used to measure the intensity of the data concussion. The two parameters of preference and damping factor are studied. Then, according to the need of clustering analysis of emotion words, the AP algorithm is improved and applied to the generation of emotional word clustering. From the experimental results, the improved algorithm has better time performance and emotional word clustering performance.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116259576","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}
{"title":"Possible Transitions Between Types of Pseudoknots of RNA Structure","authors":"Qingxia Kong, Yaoyao Fu, Zhendong Liu","doi":"10.1109/CIS.2017.00092","DOIUrl":"https://doi.org/10.1109/CIS.2017.00092","url":null,"abstract":"There are several dynamic programming methods for predicting RNA secondary structures with pseudoknots, but reasonable and efficient ways which are constructed by some kinds of structures is difficult, the structure can be equipped with prescribed and expected energies in RNAlocmin. In this paper. According to the BHG and MFE principle, we present the algorithms to improve theγ1-structure in Boltzmann sampling. The experiments by the software package called gfold indicates that improving γ1-structure as an instance is very efficient, and we also implement the transitions between different types of pseudoknots.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126248392","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}
{"title":"Improving Managerial Efficiency Through Analyzing and Mining Resigned Staff Data","authors":"L. Jia, Haolan Zhang","doi":"10.1109/CIS.2017.00078","DOIUrl":"https://doi.org/10.1109/CIS.2017.00078","url":null,"abstract":"Reducing the resigned staff number has become a significant challenge in many companies. Nevertheless, resignation can in many cases help companies to establish a 'survival of the fittest' culture that can provide companies with competitive advantages. However, a high percentage of resigned staff will have a negative impact on a company's daily operation and, in worst cases, will cause organizational breakdown. Analyzing the factors that influence the resigned staff could enable solutions to be found to prevent such incidences occurring in companies. In this paper, a data analytical method has been employed based on a China Construction Bank Hangzhou sub-branch to find whether the salary standard could have a significant effect on the rate of resignation. Through this work we could improve the contingency plan to reduce the resignation percentage and build a more reasonable human resource management system.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128174546","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}
{"title":"DPETs: A Differentially Private ExtraTrees","authors":"Chunmei Zhang, Yang Li, Zibin Chen","doi":"10.1109/CIS.2017.00072","DOIUrl":"https://doi.org/10.1109/CIS.2017.00072","url":null,"abstract":"In this paper, we consider the problem of constructing private classifiers using extra decision trees, within the framework of differential privacy. We proposed a differential privacy classifier DPETs using Laplace mechanism and exponential mechanism in the construction of each decision tree during the process of splitting point and selecting attribute. We used the gini index as the scoring function of exponential mechanism, distributed the privacy budget dynamically by calculating its consumption and used Laplace mechanism adding count noise for the equivalence class. DPETs satisfies the requirement of differential privacy during the whole process. Due to the randomization in the process of feature selection and division, noise added to ensure the privacy was reduced compared with the construction of traditional differential private decision trees, so the accuracy of the classifier was improved especially in high dimensional datasets with discrete attributes.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131330023","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}