{"title":"A Novel Solution of Event Conflict Resolution Based on D-S Evidence Theory","authors":"Xiaojuan Yang, Tao Sun","doi":"10.1109/DCABES.2015.76","DOIUrl":"https://doi.org/10.1109/DCABES.2015.76","url":null,"abstract":"Usually, there will still be data conflicts left in the event mentions after the events have been co-reference resolution. This paper presents a novel experiments-proven solution to the conflicts of event mentions by first categorize the conflicts of events into named entity conflicts, semantic conflicts and data presentation conflicts and then take advantage of the D-S evidence theory in dealing with uncertain data based on \"evidence\" and \"combination\".","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123100848","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 Modified K-Means Algorithm Based RBF Neural Network and Its Application in Time Series Modelling","authors":"Yiping Jiao, Yu-zhi Shen, Shu-ming Fei","doi":"10.1109/DCABES.2015.126","DOIUrl":"https://doi.org/10.1109/DCABES.2015.126","url":null,"abstract":"In this paper, a modified K-means based RBFNN is discussed. To improve the performance of RBFNN, an initial cluster centers (ICCs) selection strategy is proposed for K-means algorithm. The algorithm takes breadth preferred subset of samples as ICCs to cover the sample space using greedy strategy. The results shows that the proposed algorithm can improve the performance of RBFNN remarkably in chaotic time series modelling.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124811036","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":"K-Means Clustering Algorithm for Large-Scale Chinese Commodity Information Web Based on Hadoop","authors":"Geng Yu-shui, Zhang Lishuo","doi":"10.1109/DCABES.2015.71","DOIUrl":"https://doi.org/10.1109/DCABES.2015.71","url":null,"abstract":"With the growing popularity of the network, product information filled in the many pages of the Internet, which you want to get the information you need on these pages tend to consider clustering information, and the current explosive growth of data so that the information mass storage condition occurs, clustering to facing the problems such as large calculation complexity and time consuming, then the traditional K-Means clustering algorithm does not meet the needs of large data environments today, so this article combined with the advantages of the Hadoop platform and MapReduce programming model is proposed the K-Means clustering algorithm for large-scale Chinese commodity information Web based on Hadoop. Map function calculates the distance from the cluster center for each sample and mark to their category, Reduce function intermediate results are summarized and calculated new clustering center for the next round of iteration. Experimental results show that this method can better improve the clustering processing speed.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117021937","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":"Simulation Study on Multi-lane Traffic Flow under Right-most Overtaking Rule Based on Driving Security Determination and Assistance Overtaking System and Intelligent System","authors":"Hongxia Wang, Wenkai Guan, Yue Yu, Dongfei Liu, Qiyu Liang, Yongsheng Yu","doi":"10.1109/DCABES.2015.57","DOIUrl":"https://doi.org/10.1109/DCABES.2015.57","url":null,"abstract":"This paper proposes two systems, Driving Security Determination and Assistance Overtaking System and Intelligent System, to analyze the performance of the right-most rule on multi-lane traffic flow. Driving Security Determination and Assistance Overtaking System (DSDAOS) is established to analyze the relationship between security, speed limit and traffic flow while Intelligent System (IS) is theoretically designed on the basis of DSDAOS and it has better impact on promoting traffic flow from aspects of speed limit and lane conditions when compared to DSDAOS. DSDAOS is a system that utilizes computer to produce vehicles in the simulation, give some properties to them which are made to run in lanes according to certain rules, and finally output security level and relational traffic flow. IS is a system in which computers use information-gathering device to automatically gather information, then deal with the information and get relating response which refers to the function of shifting speed limit of lanes and changing lanes to promote traffic flow. All in all, IS makes great difference to promote use ratio and carrying capacity of lanes. What is more important is that Intelligent System is a circulating system with high independence.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129356916","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 Application of Fuzzy Rough Sets in Predicting on Urban Traffic Congestion","authors":"Yingchao Shao","doi":"10.1109/DCABES.2015.59","DOIUrl":"https://doi.org/10.1109/DCABES.2015.59","url":null,"abstract":"In this paper, the soft fuzzy rough set theory is applied to predicting urban traffic congestion. For this purpose, a practical example predicting on urban traffic congestion based on the soft fuzzy rough set is presented.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129897151","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 Optimization Framework Based on Kriging Method with Additive Bridge Function for Variable-Fidelity Problem","authors":"Peng-Huan Wang, Yang Li, Chengshan Li","doi":"10.1109/DCABES.2015.104","DOIUrl":"https://doi.org/10.1109/DCABES.2015.104","url":null,"abstract":"Variable-fidelity optimization (VFO), which utilizes the precise value of high-fidelity (HF) model and underlying trend of low-fidelity (LF) model, has solved many computationally expensive problems by simulation-based design. Though it has been developed rapidly in recent years, the simpler and cheaper ones are still needed. In this paper, a new optimization framework based on Kriging method with additive bridge function for variable-fidelity problem is proposed. The simple additive bridge function is taken to construct the primal HF model with Kriging method. With the local and global search strategies, the sample sets can be updated and the HF model be refreshed. It is worth mentioning that the fusion of them not only makes the method easy to implement, but also helps to find the optimal result much faster. In order to illustrate the ideas and features of the proposed optimization framework clearly, a mathematic example is presented in detail. Furthermore, another two problems are analyzed, including an engineering problem. The results show that the proposed optimization framework is feasible and effective, indicating it is suitable to solve complicated variable-fidelity problems.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"625 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124478421","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":"The Application of BP Neural Network Algorithm in Optical Fiber Fault Diagnosis","authors":"Yan Shan, Liu Yijuan, Guan Fangjing","doi":"10.1109/DCABES.2015.133","DOIUrl":"https://doi.org/10.1109/DCABES.2015.133","url":null,"abstract":"Adding the momentum is to build a suitable BP network model and the selected data are normalized to get the final sample data, and then analyze the data, by simulation experiments prove the feasibility that the BP neural network algorithm is applied in optical fiber fault diagnosis.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132395086","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 Secure Blind Watermarking Scheme Based on Embedding Function Matrix","authors":"Wang Xiao, Liu Shuo","doi":"10.1109/DCABES.2015.89","DOIUrl":"https://doi.org/10.1109/DCABES.2015.89","url":null,"abstract":"In this paper, a secure blind watermarking scheme is proposed. In the scheme, an embedding function matrix (EFM) is generated based on a serial number which is unique to each owner or owner group, then the cellular automata system embeds the scrambled watermark into the 3-level DWT coefficients of the original image based on the EFM. In the procedure of extracting, the original image is not needed, however even if the algorithm is known, without the correct function matrix, watermark can not be extracted. This shows that the proposed scheme can enhance the security of watermark. Experimental results also show that the proposed scheme is robust to geometrical attacks and common image processing attacks.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130068891","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":"Improvement Research Based on Affine Encryption Algorithm","authors":"Yong Wu","doi":"10.1109/DCABES.2015.49","DOIUrl":"https://doi.org/10.1109/DCABES.2015.49","url":null,"abstract":"In the scientific development of today, people increasingly realize the importance of information security and secrecy. This greatly promoted the development of cryptology in information security, also it is social fields plays a important role. Therefore, cryptography to become important subject of security and confidentiality of communications. This paper compares traditional and modern cryptography, deeply analyses affine cryptography, and improves it by alphabet extension, block encryption and hash function, enhances the security and application of the algorithm.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130092734","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":"Cloud Data Migration Method Based on PSO Algorithm","authors":"Geng Yu-shui, Yuan Jiaheng","doi":"10.1109/DCABES.2015.43","DOIUrl":"https://doi.org/10.1109/DCABES.2015.43","url":null,"abstract":"Cloud storage system can play an important role in large-scale, and it supports high-performance cloud applications. To cloud storage systems, data migration is key technology to realize the nodes dynamically extensible and elastic load balancing. How to reduce migration cost of time is the problem that cloud service providers need to solve. Existing research efforts were focused on the data migration issues under the non-virtualized environments, which often do not applicable to cloud storage systems. In response to these challenges, we put data migration issues into the load-balancing scenarios to solve. We propose an algorithm based on particle swarm optimization algorithm which can reduces the cost of time. In the experiment, we can use Yahoo services benchmarking YCSB tool which could verify the validity of the method. It is a test framework designed to help users understand the different cloud computing, database performance.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134528498","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}