Wenjing Li, Xiang-bo Zhang, Yingzhou Bi, Xuan Wang
{"title":"Study and Realization on the Partitioning Algorithm of Parallel Subnet of Petri Net System","authors":"Wenjing Li, Xiang-bo Zhang, Yingzhou Bi, Xuan Wang","doi":"10.1109/DCABES.2015.22","DOIUrl":"https://doi.org/10.1109/DCABES.2015.22","url":null,"abstract":"In order to solve the problem about the partition of Petri net model and subnet division, realize the concurrent execution or simulation runs of Petri net system, the partitioning algorithm of parallel subnet of Petri net is proposed. First, as Petri net system has the characteristics of synchronization and concurrence, provide the place-invariant based Petri net model partitioning and subnet division conditions and parallelizing analysis, put forward the extended theorem and validation of partitioning condition of parallel subnet, then, provide the formalization of subnet division and the solving process of place invariant and place-invariant based partitioning algorithm of parallel subnet of Petri net. The experimental results show that the partitioning algorithm of parallel subnet of place-invariant-based Petri net is feasible and effective.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"51 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":"116771967","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 Method for Embarrassingly Parallel under MIC Architecture","authors":"Yunchun Li, Xiduo Tian","doi":"10.1109/DCABES.2015.12","DOIUrl":"https://doi.org/10.1109/DCABES.2015.12","url":null,"abstract":"Nowadays, heterogeneous architecture of CPU plus accelerator has become a mainstream in supercomputing. Intel lauched its Xeon Phi coprocessor in this context. It uses Intel's many-core architecture, which greatly improves the single node parallelism. This paper studies the optimization of embarrassingly parallel programs under Intel MIC architecture, to maximize the utilization of CPU and Phi processor, and reduce the running time of parallel programs, by combining the computing power of CPU and Phi. This so-called embarrassingly parallel program often have do all main loops, that is, there are no dependencies between iterations, so they can be fully parallelized. This do all loop exists in many typical parallel programs. We come up with a loop allocation method for do all loops under this CPU/MIC architecture, to satisfy the above performance objectives.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"71 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":"121595622","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}
Lu Pan, Haibo Tang, Lei Zhou, Liuyang Wang, Quanyin Zhu
{"title":"An Identification Method of News Scientific Intelligence Based on TF-IDF","authors":"Lu Pan, Haibo Tang, Lei Zhou, Liuyang Wang, Quanyin Zhu","doi":"10.1109/DCABES.2015.131","DOIUrl":"https://doi.org/10.1109/DCABES.2015.131","url":null,"abstract":"With the development of Internet, the amount of Information has been rapidly growing which is spread widely. In order to improve the value and accuracy of science information that is pushed in this paper, an intelligence dichotomous method for science information categorization to identify science information from massive Web news is presents. During the experiment, 85.3% recognition rate of the recognition non-tech news are realized and 82.9% accuracy rate, the results show that the method can effectively identify Web science information news and reduce the amount of independent news.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"56 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":"132994972","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":"Locality-Constrained Linear Coding Based on Principal Components of Visual Vocabulary for Visual Object Categorization","authors":"Hongxia Wang, Long Zeng, Dewei Peng, Feng Geng","doi":"10.1109/DCABES.2015.96","DOIUrl":"https://doi.org/10.1109/DCABES.2015.96","url":null,"abstract":"Through the linear correlation analysis between the local feature and its K-nearest-neighbor visual words and significance testing of locality-constrained linear coding, this paper finds that the fundamental reason for causing nonsignificance of the weight coefficient is the multicollinearity of K-nearest-neighbor visual words in Locality-constrained Linear Coding (LLC) scheme. Locality-constrained principal component linear coding can solve the multicollinearity and improves the classification accuracy, but it increases the time overhead of the coding. This paper presents an improved scheme called Locality-constrained linear coding based on the principal components of visual vocabulary. To determine the principal components of K-nearest-neighbor visual words of each local feature is simplified to only determine the principal components of visual vocabulary. Experiments have been conducted for comparing and evaluating the proposed method utilizing the Caltech-4 dataset. Experimental results show that locality-constrained linear coding based on the principal components of visual vocabulary reduces the time overhead and the same time it retains the advantages of Locality-constrained principal component linear coding.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115693727","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 Medical Image Registration Based on QPSO and Powell Algorithm","authors":"Pan Ting-ting, Zhao Ji","doi":"10.1109/DCABES.2015.86","DOIUrl":"https://doi.org/10.1109/DCABES.2015.86","url":null,"abstract":"This paper proposed a multi-resolution search optimization algorithm combining QPSO and Powell algorithm,it can solve the Powell algorithm shortcoming effectively. In this paper, the algorithm were used in two-dimensional MRI images registration.The experimental results show that the algorithm can effectively overcome the problem of local extremum of mutual information function, and improve the precision and speed of registration.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130398605","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 of Dynamic Time Warping (DTW) Algorithm","authors":"Yuansheng Lou, Huanhuan Ao, Yuchao Dong","doi":"10.1109/DCABES.2015.103","DOIUrl":"https://doi.org/10.1109/DCABES.2015.103","url":null,"abstract":"Dynamic time warping algorithm is widely used in similar search of time series. However, large scales of route search in existing algorithms resulting in low operational efficiency. In order to improve the efficiency of dynamic time warping algorithm, this paper put forward an improved algorithm, which plans out a three rectangular area in the search area of the existing algorithms, search path won't arrive the points outside the rectangular area, thus further reduced the search range of regular path. To some extent, this algorithm reduces computation of original algorithm, thus improving the operational efficiency. The improvement is more pronounced when two time series are longer.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127769900","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 Comprehensive Evaluation Index System for Huadian Transformer Substation Address Selection Based on AHP and SVM","authors":"Du Qiushi, M. Qian, Cong Li","doi":"10.1109/DCABES.2015.129","DOIUrl":"https://doi.org/10.1109/DCABES.2015.129","url":null,"abstract":"This article builds the system of comprehensive evaluation index system for transformer substation address selection with the analysis of Huadian project for power transmission and transformation, due to the comprehensive evaluation of power transmission and transformation project involving multiple factors, analytic hierarchy process (AHP) is used to determine the weight of each evaluation index to make the combination with subjectivity and objectivity, introduces support vector machine (SVM) into comprehensive evaluation of power transmission and transformation and sets Huadian project as an example for empirical study, the project research is used to improve power supply capability and reliability of central Jilin grid.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127870471","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 Improved QPSO Algorithm Based on Entire Search History","authors":"Ji Zhao, Yi Fu, Juan Mei","doi":"10.1109/DCABES.2015.26","DOIUrl":"https://doi.org/10.1109/DCABES.2015.26","url":null,"abstract":"An improved QPSO algorithm based on entire search history (ESH-QPSO) is proposed. ESH-QPSO is an integration of the entire search history scheme and a standard quantum-behaved particle swarm optimization (QPSO). It guarantees that all updated positions are not revisited before, which helps prevent premature convergence. The entire search history scheme partitions the continuous search space into sub-regions by using BSP tree. The partitioned sub-region servers as mutation range such that the corresponding mutation is adaptive and parameter-less. When sub-regions are formulated as which certain overlap exists between adjacent sub-regions, this allows particle move from a sub-region to another with better fitness. Compared with other traditional algorithms, the experiment results on 8 standard testing functions show that the proposed algorithm is superior regarding the optimization of multimodal and unimodal functions, with enhancement in both convergence speed and precision those demonstrate the effectiveness of the algorithm.","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-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121129498","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":"Quantum-Behaved Particle Swarm Optimization with Cooperative Coevolution for Large Scale Optimization","authors":"Na Tian","doi":"10.1109/DCABES.2015.28","DOIUrl":"https://doi.org/10.1109/DCABES.2015.28","url":null,"abstract":"Quantum-behaved particle swarm optimization (QPSO) has successfully been applied to unimodal and multimodal optimization problems. However, with the emerging and popular of big data and deep machine learning, QPSO encounters limitations with high dimensions. In this paper, QPSO with cooperative co evolution (QPSO_CC) is used to decompose the high dimensional problems into several lower dimensional problems and optimize them separately. The numerical experimental results show that QPSO_CC has comparative or even better performance than other algorithms.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121507637","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":"Gender Difference in the Use of Hospitalization Services in Rural China - Evidence from Sichuan Province","authors":"Shaoxia Ye, Yin Cong","doi":"10.1109/DCABES.2015.118","DOIUrl":"https://doi.org/10.1109/DCABES.2015.118","url":null,"abstract":"Gender differences in health use have been documented widely while results differ between studies and countries. We try to explore the differences between gender in rural China employing 669, 000 hospitalization data of rural counties of Sichuan province in 2013. Descriptive statistics were employed to calculate the sums, means and proportions of the admission, length of stay and expenditures of hospitalization. The Chi-square test was used to calculate differences between proportions and the t test was used to test differences between means. Our results suggested that women had more hospital utilization than men while men had higher duration and expenditures of hospitalization. More female were admitted to hospital than male across all age. 25-34 year is a key age range where female/male admission ratio was highest (2.1:1) and male had a longest duration (11.6 days) in all life. Male had higher expenses of hospital than female in all age except infancy and the gap in expenses between genders is rare before adult. The differences of gender in health use does exist and policies and economic support should be taken to rural residents.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127795760","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}