Hang Yu, Huisheng Zhu, Huiqin Chen, Dongbao Jia, Yang Yu, Shangce Gao
{"title":"Gravitational search algorithm combined with modified differential evolution learning for planarization in graph drawing","authors":"Hang Yu, Huisheng Zhu, Huiqin Chen, Dongbao Jia, Yang Yu, Shangce Gao","doi":"10.1109/PIC.2017.8359504","DOIUrl":"https://doi.org/10.1109/PIC.2017.8359504","url":null,"abstract":"Gravitational search algorithm (GSA) is one of the powerful population based meta-heuristics. It has achieved many successes in various applications derived from optimization, data mining, information security, etc. However, it still suffers from the local optima trapping problem and cannot obtain promising solutions especially for practical problems. Graph planarization arises from many practical applications of VLSI circuit design, automatic graph drawing, etc, and is proved to be NP-hard. To solve this problem, this study proposes a hybrid GSA by combined with a differential evolution operator. The proposed method GSADE is used to acquire optimal planar subgraphs for a given graph. Experimental results based on thirty graph instances show that GSADE is a very competitive method in comparison with previous state-of-the-art methods.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","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":"123933393","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}
Guimin Huang, Jing Ye, Zhenglin Sun, Ya Zhou, Yan Shen, Ruyu Mo
{"title":"English mispronunciation detection based on improved GOP methods for Chinese students","authors":"Guimin Huang, Jing Ye, Zhenglin Sun, Ya Zhou, Yan Shen, Ruyu Mo","doi":"10.1109/PIC.2017.8359585","DOIUrl":"https://doi.org/10.1109/PIC.2017.8359585","url":null,"abstract":"In this paper, we proposed two approaches to detect mispronunciation in spoken English for Chinese Students which is based on improved Goodness Of Pronunciation (GOP) algorithm. We adopted a modified Maximum Likelihood Linear Regression (MLLR) to adjust the acoustic model which can reduce the mismatch between native original model and adaptive data from non-native speakers. Then we could calculate the ameliorated GOP value to improve the performance of phone-level pronunciation error detection. Besides, as Chinese students are likely to be influenced by their mother tongue in their oral English training, we collected the common pronunciation error patterns of Chinese students by introducing priori linguistic knowledge and established a phonemes set that are easy to confuse for optimizing the GOP probability space. The mispronunciation detection system with the above ways could review input speech and detect the flawed phone to allow the non-native learners to correct the mispronunciation duly. The experimental results suggested that the modified GOP method reached good effect of English pronunciation error detection for Chinese students.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","volume":"104 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":"124062688","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":"3D model reconstruction based on plantar image's feature segmentation","authors":"M. Zhang, Zhenning Zhang, Weiqing Li","doi":"10.1109/PIC.2017.8359535","DOIUrl":"https://doi.org/10.1109/PIC.2017.8359535","url":null,"abstract":"The 3D reconstruction of sole based on laser scanning is costly and time-consuming, the 3D reconstruction based on structured light is susceptible to ambient light. A 3D reconstruction method of sole based on the plantar image's feature segmentation is proposed. The sole is segmented into two regions by the morphological features in the image. One is the arch part touching the glass, another is the un-touching camber part. And an experiment is designed to summarize the law between the plantar height and gray value in each region. Then we reconstruct the two regions' shapes separately on the basis of the regulation. Finally, we implement the plantar reconstruction by merging the two point cloud models. Experimental evaluation demonstrates that the system can do the classification and reconstruction effectively.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","volume":"41 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":"128841208","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":"Maximizing bichromatic reverse k nearest neighbor with multi-level tags queries in spatial-textual databases","authors":"Chengyuan Zhao, Yongli Wang, Xiaohui Jiang, Chi Yuan, Yanchao Li, Isma Masood","doi":"10.1109/PIC.2017.8359553","DOIUrl":"https://doi.org/10.1109/PIC.2017.8359553","url":null,"abstract":"With the popularity of mobile smart devices, location-based services have been more widely used. Bichromatic Reverse k Nearest Neighbor (BRkNN) queries have become a hotspot in spatial-textual databases domain. In this paper, we extend the concept of traditional BRkNN method to process the object with multi-level tags in some specific scenes, and we propose a new type of query, called Maximized Bichromatic Reverse k Nearest Neighbor with Multi-Level Tags queries (MaxBRkNN-MLT), to find the optimal position of object with multi-level tags in the spatial-textual database. Unlike traditional methods, the number of the results of the MaxBRkNN-MLT query is maximized, which can cross the great divide between space and text. The query method proposed in this paper has a wide range of application scenes. For example, in the advertising industry, advertisers expect to find an optimal position, so that the ads with a given tag can attract the most users. Finally, experiments show that the MLT method has better query precision and execution efficiency than the baseline approach.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","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":"129146542","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 random chemical reaction algorithm based on double containers for robot path planning","authors":"Qing Yang, Zhong Yang, Guoxiong Hu, Wei Du","doi":"10.1109/PIC.2017.8359581","DOIUrl":"https://doi.org/10.1109/PIC.2017.8359581","url":null,"abstract":"Aiming at the path planning problem of mobile robots in unknown environment, a random chemical reaction algorithm based on double containers is proposed. The new algorithm is inspired by the bacterial foraging algorithm and applies a strategy based on randomly distributed chemical molecules around the robot, these molecules search the best path to the target location, while relying on the robot's own sensors to avoid obstacles. The selection criterion of the optimal path depends on the potential energy error and the distance error of the molecules on the detected obstacles or targets, and guides the robot to move in this direction. In order to evaluate the effectiveness of the algorithm, a series of simulations were made in three different scenarios and the results were compared. The results show that the algorithm can effectively avoid falling into local minimum. At the same time, the algorithm proposed can provide a shorter and smoother path, and the operation is more simple.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","volume":"13 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":"117239115","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}
Xingguang Yang, Huiqun Yu, Jianmei Guo, Guisheng Fan, Kai Shi
{"title":"Underfloor heating users prediction based on SVDD","authors":"Xingguang Yang, Huiqun Yu, Jianmei Guo, Guisheng Fan, Kai Shi","doi":"10.1109/PIC.2017.8359587","DOIUrl":"https://doi.org/10.1109/PIC.2017.8359587","url":null,"abstract":"Data analysis and utilization play an important role in the development of enterprises. How to extract valuable information from existing data is the focus of current research. Prediction of underfloor heating users is an important and urgent research topic of Gas Co. This paper constructs a prediction model to analyze whether the gas users are underfloor heating users or not based on the gas data sets. Because the training set we obtained only contains one class of data, we adopt the SVDD algorithm, which can effectively solve the one-class classification problem. In the experiment, we construct the prediction model effectively and estimate the proportion of underfloor heating users in gas users. Considering the sensitivity of the parameters in the SVDD algorithm to the prediction model, we obtained the relationship between the proportion of underfloor heating users and the values of parameters through the parameter tuning, which could provide the reference for Gas Co to select parameters.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","volume":"7 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":"128759730","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}
Jun Wang, Yuanyun Wang, Chengzhi Deng, Shengqian Wang
{"title":"Kernelized convex hull for visual tracking","authors":"Jun Wang, Yuanyun Wang, Chengzhi Deng, Shengqian Wang","doi":"10.1109/PIC.2017.8359534","DOIUrl":"https://doi.org/10.1109/PIC.2017.8359534","url":null,"abstract":"In visual tracking, developing a robust appearance model is a challenging task due to variations of object appearances such as background clutter, illumination variation and partial occlusion. In existing tracking algorithms, a target candidate is represented by linear combinations of target templates. However, the relationship between a target candidate and the corresponding target templates is nonlinear because of appearance variations. In this paper, we propose a kernelized convex hull based target representation for visual tracking. Namely, a target is represented by a nonlinear combination of target templates in a mapped higher dimensional feature space. The convex hull model can covers the target appearances that do not appear in the target templates. Experimental results demonstrate the robustness and effectiveness of the proposed tracking algorithm against several state-of-the-art tracking algorithms.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","volume":"51 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":"115385520","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":"Scalable stream Bayes classification based on Dirichlet prior","authors":"O. Bina, Yuan Yanhua","doi":"10.1109/PIC.2017.8359593","DOIUrl":"https://doi.org/10.1109/PIC.2017.8359593","url":null,"abstract":"Learning from fast data stream is one of the most challenging tasks in data stream mining. The fact that data streams are unbounded sequences, highlights exclusive challenges in contrast to classifiers from batch data. Most of methods aren't naturally parallel and thus their scalability is limited. This paper proposes a scalable data stream Bayes classifier utilizing a new estimation(DIB). The new estimation takes conjugate Dirichlet prior as parameter's prior distribution and thus improves the predictive accuracy. Meanwhile, this paper proposes a new distributed implementation of DIB on Flink. Experiments show that DIB classifier significantly outperforms Naïve Bayes in terms of accuracy. Also, the experiment proves parallel DIB running on Flink enhances the throughput and reduces execution time.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","volume":"159 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":"123131518","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 comparison study of outpatient visits forecasting effect between ARIMA with seasonal index and SARIMA","authors":"Zhang Xinxiang, Zhou Bo, Fu Huijuan","doi":"10.1109/PIC.2017.8359573","DOIUrl":"https://doi.org/10.1109/PIC.2017.8359573","url":null,"abstract":"This paper delineates a case study analyzing and forecasting of the outpatient visits frequency of a hospital in Zhengzhou, China. By evaluating the annual out-patient data throughout the year of 2015, this paper applies the “Day” as timescale and carries out the experiment so as to forecast the number of visiting patients with the impact of the “Week” taken into consideration. Two models are used separately: the Autoregressive Integrated Moving Average (ARIMA) with seasonal index and the Seasonal Autoregressive Integrated Moving Average (SARIMA). Based on the empirical findings from the comparison of the fitting effect and forecasting effect of the above two models, it is clear that SARIMA reaches a satisfactory outcome: it displays optimum indexes. Therefore it is preferable to deploy the SARIMA model to proceed a forecasting of outpatient visits for medical institutions. Meanwhile the paper also aims to provide management of medical institution with theory grounds of working and personnel arrangement and insight so as to make a prompt and reasonable contingency plan when it comes to sudden disease.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","volume":"23 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":"121957656","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":"Pseudo-inverse locality preserving iterative hashing","authors":"Zhong-Hua Du, Yongli Wang, H. Sun","doi":"10.1109/PIC.2017.8359569","DOIUrl":"https://doi.org/10.1109/PIC.2017.8359569","url":null,"abstract":"Hashing learning has attracted increasing attention these years with the rapid increase of data. Some high-dimensional data have caused the ‘dimension disaster’ which make traditional methods ineffective. In this paper, we propose a method to find the nearest neighbor quickly from the high-dimensional data, named pseudo-inverse locality preserving iterative hashing(PLIH). We use pseudo-inverse to replace the inverse matrix in order to solve the problem of matrix singularity. We construct adjacency graphs and minimize the distance of the neighbors in the subspace to make the projected matrix maintain the neighborhood relations of high dimension, which solves the problem that the locality sensitive hashing cannot preserve the high-dimensional neighborhood relations effectively. Because different bit with different weight has more discriminating power than the same weight, Loss of the projection matrix in the quantization process is minimized by weighted iterative quantization. Experiments on public datasets Cnn_4096d_Caltech and Gist_512d_Caltech demonstrated that accuracy and recall of the PLIPH are both better than the traditional hashing algorithms.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","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":"126633480","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}