{"title":"Analysis on Convergence of Stochastic Processes in Cloud Computing Models","authors":"J. Nie, Hanlin Tang, Jingxuan Wei","doi":"10.1109/CIS2018.2018.00024","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00024","url":null,"abstract":"On cloud computing systems consisting of task queuing and resource allocations, it is essential but hard to model and evaluate the global performance. In most of the models, researchers use a stochastic process or several stochastic processes to describe a real system. However, due to the absence of theoretical conclusions of any arbitrary stochastic processes, they approximate the complicated model into simple processes that have mathematical results, such as Markov processes. Our purpose is to give a universal method to deal with common stochastic processes as long as the processes can be expressed in the form of transition matrix. To achieve our purpose, we firstly prove several theorems about the convergence of stochastic matrices to figure out what kind of matrix-defined systems has steady states. Furthermore, we propose two strategies for measuring the rate of convergence which reflects how fast the system would come to its steady state. Finally, we give a method for reducing a stochastic matrix into smaller ones, and perform some experiments to illustrate our strategies in practice.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"11 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":"126504275","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":"A SVM and Co-seMLP Integrated Method for Document-Based Question Answering","authors":"Xiaoan Liu, Tao Peng","doi":"10.1109/CIS2018.2018.00046","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00046","url":null,"abstract":"In this paper, we describe our features and models for Chinese Open-Domain Question Answering DBQA shared task in NLPCC-ICCPOL 2017. After the analysis of task and dataset, 8 features were extracted, and then 4 models were trained. Finally, our model achieves a result, in which MRR score is 0.494292 and MAP score is 0.491736.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"152 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":"125906391","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":"Forest Fire Monitoring System and Energy Saving Algorithm","authors":"Yanli Wang, Guogang Dang","doi":"10.1109/CIS2018.2018.00067","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00067","url":null,"abstract":"In order to meet the needs of forest fire monitoring in qinling mountains, the forest fire monitoring system is established based on wireless sensor network, the hardware and software circuit are designed, as well as the system architecture of sensor network was described also. At the same time, an energy saving algorithm based on grid theory is proposed to solve the energy constraint problem of wireless sensor network. The algorithm replaces the calculation of the original peripheral nodes with the calculation of the central point, it reduces the computational complexity. Simulation results show that the error between the calculated coverage and the actual coverage is less than 11%, which proves the validity of the algorithm.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"17 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":"128073657","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":"Speech Recognition Method Based on Normalized Simplified Artificial Fish Swarm Algorithm","authors":"Xiaofeng Li, B. Qiao, Jie Liu","doi":"10.1109/CIS2018.2018.00011","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00011","url":null,"abstract":"In order to improve the classification performance of the speech recognition system, aiming at the problem that the traditional artificial fish swarm algorithm runs the late search blindness, low optimization precision and slow calculation speed, the artificial fish swarm algorithm is simplified by a certain method. A speech recognition method based on normalized simplified artificial fish swarm algorithm is proposed according to a relationship between data structure and optimization algorithm. Firstly, the speech features extracted by Mel Frequency Cepstrum Coefficient is normalized to reduce the complexity of the data structure. Secondly, the streamline operation is used to improve the iterative process of artificial fish swarm algorithm, and the modified algorithm is applied to the support vector machine parameter optimization of speech recognition. Finally, the optimized support vector machine model is used to classify and identify the normalized speech features. The experimental results show that the proposed algorithm improves the speech recognition rate by8.58% in average compared with the traditional artificial fish swarm algorithm, and the maximum increase of 15.34%, and has good anti-noise performance and generalization ability under high signal to noise ratio and large vocabulary.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"9 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":"131714154","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":"A Novel Multi-Objective Evolutionary Algorithm Based on Linear Programming","authors":"Zhicang Wang, Hecheng Li","doi":"10.1109/CIS2018.2018.00082","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00082","url":null,"abstract":"It is the goal of scholars in the field of multiobjective optimization to find wide distributive and uniform Pareto solution set over Pareto front. The reason is that the solutions of multi-objective optimization problem is a set of Pareto solutions which are non-dominated each other, and the obtained Pareto solutions are often not well distributed and cannot satisfy the needs of decision makers. It may be the case that decision-makers expect to have a solution in an area to assist them for making decisions. In this paper, we propose a local search strategy based on linear programming and construct a multi-objective evolutionary algorithm based on linear programming (MOEA/LP). MOEA/LP algorithm makes up for the large “gap” in Pareto front, and makes Pareto optimal solutions over Pareto front more uniform and more extensive. Thereby, the decision makers use MOEA/LP algorithm to make more effective choice. Experiment results show the proposed algorithm has better performance according to some measure indices such as running time, hypervolue and C metric, etc.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"14 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":"127994988","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":"Title Page i","authors":"","doi":"10.1109/cis2018.2018.00001","DOIUrl":"https://doi.org/10.1109/cis2018.2018.00001","url":null,"abstract":"","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"1 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":"131255518","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":"A Two-Dimensional Sky Background Model for LAMOST Based on Improved KICA","authors":"Peng Wu, Qian Yin, Ping Guo","doi":"10.1109/CIS2018.2018.00113","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00113","url":null,"abstract":"To accomplish the sky-subtraction task in a key reduction step upon the large sky area multi-object fiber spectroscopic telescope (LAMOST) data, the sky background is modeled by the LAMOST 2D pipeline using the one-dimensional (1D) extracted spectra of sky fibers. The spectrum of 'super sky' that represents the local background, ignoring the variation in this field, is obtained in each square degree by co-adding approximately 20 sky fiber spectra with a spline function, which could contribute to the difference in the emission line ratios in the spectra of celestial targets, especially at low galactic latitudes. In this paper, we model the sky by using the two-dimensional (2D) CCD images of sky fibers, and the local sky is dynamically simulated by considering the positions of the sky fibers relative to any object. To accelerate the subtraction process in 2D images, we exploit the improved KICA to separate the sky from object spectra. Given the dynamic 2D sky background and the improved KICA, this would be another option for sky-subtraction in CCD images.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"26 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":"131753992","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":"Acceleration of Feature Subset Selection Using CUDA","authors":"Jun Yang, Siyuan Jing","doi":"10.1109/CIS2018.2018.00038","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00038","url":null,"abstract":"Rough sets have been proven to be an effective tool for feature subset selection, which is a key step in various machine learning tasks. However, this task is very time consuming. To address this problem, graphics processing unit (GPU), which is a popular device of high performance computing, is applied to accelerate a sorting-based algorithm of feature subset selection. The proposed algorithm is well designed by CUDA programming framework. To obtain great performance gain, two critical steps in rough sets based feature subset selection, which are computation of equivalence class and feature significance, are both executed on GPU. Experimental results show that the proposed algorithm is efficient and it can scale well on large data sets.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"143 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":"115255650","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}
M. Hwang, E. F. Cahyadi, Yuen-Cheng Chou, Cheng-Ying Yang
{"title":"Cryptanalysis of Kumar's Remote User Authentication Scheme with Smart Card","authors":"M. Hwang, E. F. Cahyadi, Yuen-Cheng Chou, Cheng-Ying Yang","doi":"10.1109/CIS2018.2018.00099","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00099","url":null,"abstract":"One of the common necessity to have secret communication through Internet is to authenticate the legality of users. The simplest and most popular authentication technique to have secret communication through Internet is remote user authentication scheme. Recently, Kumar proposed an enhanced amart card-based remote user authentication scheme. Their scheme was robust and easy to implement. They claimed that their scheme could against explicit key authentication, replay attack, stolen-verifier attacks, forward secrecy, denial of service attacks, impersonation attacks, mutual authentication, parallel session attack, password guessing attacks, smart card loss attacks, attack via registered identity, and attack via password. In this article, we will show that Kumar's scheme is vulnerable to the off-line guessing password attack. In this article, we also propose an improved Kumar's enhanced smart card-based remote user authentication scheme to withstand the vulnerability in their scheme.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"325 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":"113996045","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 Optical Fiber Warning System Based on Vibration Sensing","authors":"Jie Guo, Yibin Chen","doi":"10.1109/CIS2018.2018.00028","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00028","url":null,"abstract":"An optical fiber warning system based on vibration sensing is proposed in this paper. This system mainly consists of laser source, common sensor of optical cable and STM32 micro processor, master computer. There are two optical couplers in the sensor optical cable, which makes the structure of fiber optical interferometer. The master computer interface can see the vibration time and signal power clearly.","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":"124233222","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}