{"title":"Clustering algorithm for wireless sensor network to improve the efficiency of acnode","authors":"Youwei Shao","doi":"10.1504/IJRIS.2018.10013285","DOIUrl":"https://doi.org/10.1504/IJRIS.2018.10013285","url":null,"abstract":"In the vehicular ad hoc networks VANETs, the topological structure with high dynamic and frequent cracked link challenge the vehicle to vehicle communication. By taking VANETs city scene as the background, the thesis proposes routing VAC-BNR (vector-angle-cluster and bridge nodes-based routing) protocol based on clustering of direction vector angle and bridge nodes. The VAC-BNR protocol at first divides a road into the intersection area and straight line sections between or among intersections. In the straight line sections, according to the moving direction of vehicles, the vehicles are divided into different clusters, later on, utility value of the nodes in each cluster are calculated and then priority of node forwarding data packages is arranged according to utility values of nodes; In the intersection area, the stability factor of the vehicles is calculated, which includes relative velocity and distance between the vehicle from surrounding vehicles and the most stable vehicle in the intersection area ...","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131366955","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":"Multi-criteria decision making method based on analytic hierarchy process with intuitionistic fuzzy preference information","authors":"C. Liang","doi":"10.1504/IJRIS.2018.10013290","DOIUrl":"https://doi.org/10.1504/IJRIS.2018.10013290","url":null,"abstract":"An extension method of multi-criteria decision making (MCDM) is proposed in the thesis for selection and assessment of parting line in mould design. First of all, linguistic variable is used to express grade of alternative parting line scheme and weight of criterion significance; and then, the membership function of final fuzzy assessed value is determined based on these linguistic values; in the end, a new ordering method of maximum and minimum sets will be adopted for normalisation of weight grading and defuzzification to clear value and for strength and weakness ordering of alternative scheme. The verification and contrast experiment show effectiveness of the method in the thesis and the comparison with traditional fuzzy multi-criteria decision making method shows the method in the thesis is more applicable.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130605492","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":"Dynamic path planning of mobile robot based on ant colony algorithm","authors":"Zhuo-Qun Long","doi":"10.1504/IJRIS.2018.10013293","DOIUrl":"https://doi.org/10.1504/IJRIS.2018.10013293","url":null,"abstract":"The thesis makes vehicle in cross-country environment as research object, and uses improved ant colony algorithm to research and analyse the cross-county path planning. First, improved ant colony algorithm is used to research cross-county path planning of vehicle, then slope table and roughness table are introduced to analyse topographic slope and land surface property's affect on path planning, and path optimisation algorithm is designed considering restriction of slop and roughness. Simulation result shows that this algorithm can realise cross-county path planning with speediness and efficiency. Experimental result demonstrates that the improved ant colony algorithm has stronger feasibility and better searching capability.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117178266","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 Arabic natural language interface for querying relational databases based on natural language processing and graph theory methods","authors":"Hanane Bais, M. Machkour, L. Koutti","doi":"10.1504/IJRIS.2018.10013299","DOIUrl":"https://doi.org/10.1504/IJRIS.2018.10013299","url":null,"abstract":"Nowadays, databases represent a great source of information. To extract information from these databases, the user needs to write queries using database query languages, such as structured query language (SQL). Generally, for using this language, this user must know the database structure. However, this task can be difficult for non-expert users. In that, the use of natural language to extract data from the database can be an important method. The problems in using natural language query are that it does not give any specification about the path access corresponding to the required data. In this paper, a model of a natural language interface for databases is presented. This interface allows the user to extract data from a database by using Arabic language and it obviates the need for users to know the database structure. Also, it can function independently of the database domain and it can to improve its knowledge base through experience.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117267551","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":"Construction of evaluation system of sports talent training scheme based on data mining","authors":"Gong Xun, Lin Suxia","doi":"10.1504/IJRIS.2018.10013294","DOIUrl":"https://doi.org/10.1504/IJRIS.2018.10013294","url":null,"abstract":"In order to improve the effectiveness of the evaluation system construction for sports talent training program, this paper puts forward a kind of evaluation system construction method for sports talent training program based on data mining. It provides the description target of sports talent training program, the problem that the upper bound of itemsets only used by the traditional mining algorithm has unsatisfactory effect on the high-expectation weight and downward closure property of mining algorithm in design hierarchy, and presents the proof process, and this property can effectively reduce the processing capacity of candidate set in the premise of ensuring the accuracy, to construct the two-stage data mining process. By comparing with the training program of 2007 version, the proposed method can eliminate the setting compulsory course equivalent to individual professional elective course, to promote the diverse development of students.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"4 19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115637573","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":"Fuzzy neural network learning based on hierarchical agglomerative T-S fuzzy inference","authors":"Tao Duan, Ang Wang","doi":"10.1504/IJRIS.2018.10013286","DOIUrl":"https://doi.org/10.1504/IJRIS.2018.10013286","url":null,"abstract":"It is well-known that the accuracy of classification prediction is relatively high, but the prediction result is obscure in concept since result is given in two-value form (0 or 1) which says that red tide exists or does not exist. On the other hand, the accuracy of numerical prediction is relatively low, but it can offer density value of plankton which influences red tide. In order to combine characteristics of the above mentioned two methods, a prediction method for red tide which is mixed with integration model of hierarchical agglomerative T-S fuzzy inference is proposed. In the thesis, through using the proposed prediction method mixed with integration model of hierarchical agglomerative T-S fuzzy inference, taking respective advantages of classification prediction and numerical prediction in prediction process for reference, and through experiment and comparison, it is proved that this algorithm is better than LMBP algorithm in prediction accuracy which shows the validity of the proposed algorithm. In the next step, it is mainly to further study the practical application of the algorithm, and to apply this prediction model to red tide warning system, and also to conduct experimental verification for a certain period by using actual marine environment.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117079941","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":"Key data for cloud computing based on ensemble clustering approximate analysis","authors":"Zou Yu, Qin Ping","doi":"10.1504/IJRIS.2018.10013287","DOIUrl":"https://doi.org/10.1504/IJRIS.2018.10013287","url":null,"abstract":"To realise multi-label classification of text and meanwhile reduce calculation complexity and keep classification precision, dimensionality-reduction clustering method for fuzzy association of text multi-label based on cluster classification has been proposed. In text classification, it usually involves enormous feature numbers, which may cause curse of dimensionality. In addition, classification region can not always keep convex characteristics. It can be non-convex region composed of several overlapping or intersecting sub-regions. Above mentioned automatic classification system may require enormous memory requirement or has poor classification performance. Hence, new multi-label text classification method is proposed to overcome these problems in combination with fuzzy association technology. Fuzzy association evaluation is adopted to transform high-dimension text to low-dimension fuzzy association vector, thus avoiding curse of dimensionality. Experiment results show that the proposed method can more effectively classify text multi-label problem.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130006297","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":"Facial feature extraction based on principal component analysis and class independent kernel sparse representation","authors":"Xin Xiong, Liu Kefeng","doi":"10.1504/IJRIS.2018.10013298","DOIUrl":"https://doi.org/10.1504/IJRIS.2018.10013298","url":null,"abstract":"Robust Principal Component Analysis (RPCA) and kernel sparse representation technology which have been proposed in recent years provide a new idea for solving problems of the above three aspects. In this Thesis, classification algorithm of kernel sparse representation has been proposed based on robust principal component analysis by using RPCA technology to generate redundant dictionary and kernel sparse representation to structure classifier, and has been used for face recognition. Basic idea of this algorithm is to generate base dictionary and error dictionary by using RPCA technology, and to realize face recognition through classifier structured by kernel sparse representation. Firstly, each training sample matrix has been decomposed into a low rank matrix and a sparse error matrix by using RPCA technology, so as to structure base dictionary and error dictionary by using the low rank matrix and error matrix respectively, and generate redundancy dictionary of sparse representation of test samples. Then, Kernel regularized Orthogonal Matching Pursuit (KROMP) algorithm has been proposed to get sparse representation coefficient which has been used to complete classification and recognition of test samples. Compared with similar algorithms, algorithm in the Thesis is of a high recognition rate for face recognition, and has a strong ability to adapt to noise and error interference.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"265 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122698665","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":"MapReduce optimisation information query method for file management system","authors":"Xuguang Zhu, Yuzhi Shen","doi":"10.1504/IJRIS.2018.10013291","DOIUrl":"https://doi.org/10.1504/IJRIS.2018.10013291","url":null,"abstract":"MJQO problem is very complicated, query speed influences execution efficiency of database application software. To solve deficiencies such as low rate of convergence, etc., of PSO algorithm and improve optimisation efficiency of database multi-connection query, this thesis proposes a MJQO method adapting to escape momentum particle swarm optimisation aiming at deficiencies of particle swarm optimisation such as early-maturing, partial optimisation, etc., and it verifies effectiveness of SAEV-MPSO via emulation contrasted test, and this algorithm can obtain optimal query scheme of MJQO in relatively short-time. Crossover mechanism is first introduced by this algorithm of genetic algorithm to particle swarm algorithm to maintain diversity of it and prevent early-maturing phenomenon, and then this thesis introduces search track of momentum algorithm smoothness particle to accelerate convergence rate of particle swarm; finally this thesis applies this algorithm to database multi-connection query optimisation solution to achieve optimal database query scheme. Emulation result indicates this algorithm improves database query efficiency and shortens query response time.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129874722","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}
Ye-gang Chen, Jun Luo, Xiao-rong Diao, Xingyan Yao
{"title":"A medical big data analysis algorithm based on access control system","authors":"Ye-gang Chen, Jun Luo, Xiao-rong Diao, Xingyan Yao","doi":"10.1504/IJRIS.2018.10009929","DOIUrl":"https://doi.org/10.1504/IJRIS.2018.10009929","url":null,"abstract":"In the latest progress in healthcare, the continuous creation of digital medical information is an important basis for the analysis of large medical data. This paper proposes a medical big data analysis algorithm based on access control system that provides reliable security protection to big medical data (BMD) by considering various quantitative parameters. The proposed algorithm calculates the reputation values of different users, which correspond to each parameter. Based on the calculated reputation values, the proposed algorithm grants access authority to each user. Simulation results are performed to verify the effectiveness of security system solving protection of the sensitive personal information of patients.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"60 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114003788","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}