发布求助
文献互助 智能选刊 最新文献

Int. J. Reason. based Intell. Syst.最新文献

筛选
英文 中文
Automatic absence seizure detection and early detection system using CRNN-SVM 基于CRNN-SVM的缺勤检测及早期检测系统
Int. J. Reason. based Intell. Syst. Pub Date : 2019-11-05 DOI: 10.1504/ijris.2019.10025172
Niha Kamal Basha, Aisha Banu Wahab
{"title":"Automatic absence seizure detection and early detection system using CRNN-SVM","authors":"Niha Kamal Basha, Aisha Banu Wahab","doi":"10.1504/ijris.2019.10025172","DOIUrl":"https://doi.org/10.1504/ijris.2019.10025172","url":null,"abstract":"In this paper the new model is proposed to automatically detect and predict absence seizure using hybrid deep learning algorithm [convolutional recurrent neural network (CRNN)] with single channel electroencephalography (EEG) only as input. This model comprises of four steps: 1) single channel segmentation process; 2) extraction of relevant features using convolution network; 3) recurrent network for detection and early detection; 4) SVM have been used as last layer to obtain a result with respect to time. This model enhances the feature extraction by feeding the raw input into convolutional layer, improves the detection with gated recurrent unit (GRU) and reduces the early detection rate with support vector machine (SVM). Our proposed model achieves 100% overall accuracy on seizure detection as normal and absence seizure and detect within three seconds of the overall seizure duration. Also this model can be act as a generic model for classification task with detection and early detection of bio-signal (EEG, ECG and EMG).","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121697270","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}
引用次数: 0
Uyghur short-text classification based on reliable sub-word morphology 基于可靠子词词法的维吾尔语短文本分类
Int. J. Reason. based Intell. Syst. Pub Date : 2019-08-23 DOI: 10.1504/IJRIS.2019.10023443
Sardar Parhat, Mijit Ablimit, A. Hamdulla
{"title":"Uyghur short-text classification based on reliable sub-word morphology","authors":"Sardar Parhat, Mijit Ablimit, A. Hamdulla","doi":"10.1504/IJRIS.2019.10023443","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10023443","url":null,"abstract":"In this paper, we research some short-text classification methods for a low resource language combined with reliable stemming and term extraction methods. Uyghur is a morphologically rich agglutinative language in which words are formed by a stem attached by several suffixes, and this property causes infinite vocabulary in theory. As the stems are the semantic entities, stem based text classification is the promising way for the low resource morphologically derivative languages. And it is also an efficient way in NLP to extract and predict out-of-vocabulary (OOV) and misspellings based on context information. The word (or stem) - vector-based morphological analysis incorporating stem-vector to text classification is a novel approach for the Uyghur language. Our stemming method extracts noisy stems robustly and decrease the particle lexicon to 1/3 of word lexicon and improve the coverage, thus suited for small corpora with high OOV rate resources. And the highest accuracy of 93.5% is obtained in nine categories of short texts based on stem-vector with CHI-2 (x2) feature.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116082354","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}
引用次数: 1
MGA-TSP: modernised genetic algorithm for the travelling salesman problem MGA-TSP:旅行推销员问题的现代遗传算法
Int. J. Reason. based Intell. Syst. Pub Date : 2019-08-23 DOI: 10.1504/ijris.2019.102541
Ra'ed M. Al-Khatib, M. Al-Betar, M. Awadallah, K. Nahar, Mohammed M. Abu Shquier, Ahmad M. Manasrah, Ahmad Bany Doumi
{"title":"MGA-TSP: modernised genetic algorithm for the travelling salesman problem","authors":"Ra'ed M. Al-Khatib, M. Al-Betar, M. Awadallah, K. Nahar, Mohammed M. Abu Shquier, Ahmad M. Manasrah, Ahmad Bany Doumi","doi":"10.1504/ijris.2019.102541","DOIUrl":"https://doi.org/10.1504/ijris.2019.102541","url":null,"abstract":"This paper proposes a new enhanced algorithm called modernised genetic algorithm for solving the travelling salesman problem (MGA-TSP). Recently, the most successful evolutionary algorithm used for TSP problem, is GA algorithm. The main obstacles for GA is building its initial population. Therefore, in this paper, three neighbourhood structures (inverse, insert, and swap) along with 2-opt is utilised to build strong initial population. Additionally, the main operators (i.e., crossover and mutation) of GA during the generation process are also enhanced for TSP. Therefore, powerful crossover operator called EAX is utilised in the proposed MGA-TSP to enhance its convergence. For validation purpose, we used TSP datasets, range from 150 to 33,810 cities. Initially, the impact of each neighbouring structure on the performance of MGA-TSP is studied. In conclusion, MGA-TSP achieved the best results. For comparative evaluation. MGA-TSP is able to outperform six comparative methods in almost all TSP instances used.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"9 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133077427","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}
引用次数: 3
Hybrid neural network with bat approach for smart grid fault location 基于混合神经网络的智能电网故障定位
Int. J. Reason. based Intell. Syst. Pub Date : 2019-08-23 DOI: 10.1504/IJRIS.2019.10023442
M. H. Dhend, Rajan Hari Chile
{"title":"Hybrid neural network with bat approach for smart grid fault location","authors":"M. H. Dhend, Rajan Hari Chile","doi":"10.1504/IJRIS.2019.10023442","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10023442","url":null,"abstract":"This paper proposes identification of fault location in smart distribution grid based on artificial intelligence using currents and voltages measured; with the help of sensor nodes in distribution system. The approach presented here is the hybrid bat algorithm with neural network, implemented on latest smart distribution system which comprises distributed generation. The fault lengths for various types of faults on distribution feeders are recognised using system parameters measured, before and after the occurrence of a fault. For verifying the performance of proposed algorithm, the MATLAB-based coding is developed and executed on sample modified IEEE test feeders. The performance of a proposed technique is compared with the simple neural network method. The proposed method founds more accurate and fast in speed.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133435471","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}
引用次数: 1
Toward an automatic summarisation of Arabic text depending on rhetorical relations 根据修辞关系实现阿拉伯语文本的自动摘要
Int. J. Reason. based Intell. Syst. Pub Date : 2019-08-23 DOI: 10.1504/IJRIS.2019.10023432
Samira Lagrini, Nabiha Azizi, M. Redjimi, M. Aldwairi
{"title":"Toward an automatic summarisation of Arabic text depending on rhetorical relations","authors":"Samira Lagrini, Nabiha Azizi, M. Redjimi, M. Aldwairi","doi":"10.1504/IJRIS.2019.10023432","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10023432","url":null,"abstract":"Rhetorical relations between two text segments are crucial information and have been proven useful for many natural language processing applications. In this paper, we propose a supervised approach for automatic identifying of rhetorical relations in Arabic texts. Our model attempts to identify both implicit and explicit rhetorical relations between elementary discourse units which will be exploited in automatic summarisation of Arabic texts. To carry out this research, we developed a discourse annotated corpus following the rhetorical structure theory framework with high reliability. Relations annotation was done using a set of 23 fine-grained relations enriched with nuclearity annotation. To automatically learn these relations, we reuse some state of the arts features and contribute new lexical and semantics' features. The experimental results on fine-grained and coarse-grained relations show that our model achieved best performance relative to all baselines.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124723406","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}
引用次数: 1
Deep bacteria: robust deep learning data augmentation design for limited bacterial colony dataset 深度细菌:有限细菌菌落数据集的鲁棒深度学习数据增强设计
Int. J. Reason. based Intell. Syst. Pub Date : 2019-08-23 DOI: 10.1504/IJRIS.2019.10023444
Nour Eldeen M. Khalifa, M. Taha, A. Hassanien, A. Hemedan
{"title":"Deep bacteria: robust deep learning data augmentation design for limited bacterial colony dataset","authors":"Nour Eldeen M. Khalifa, M. Taha, A. Hassanien, A. Hemedan","doi":"10.1504/IJRIS.2019.10023444","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10023444","url":null,"abstract":"Bacterial colony classification is an important problem in microbiology. With the advances in computer-aided software's, similar problems have been solved in a speedy and accurate manner during the last decade. In this paper, deep neural network architecture will be presented to solve the bacterial colony classification problem. In addition, the training and testing strategy that relies on the strong use of data augmentation will be introduced. The used dataset was limited as it contains 660 images for 33 classes of a bacterial colony. Any neural network cannot learn from this data directly and in case of learning the neural network will overfit. The adopted training and testing strategy lead to a significant improvement in the training and testing phases. It raised the dataset images to 6,600 images for the training phase and 5,940 images for verification phase. The proposed neural network with the adopted augmentation techniques achieved 98.22% in testing accuracy. A comparative result is presented, and the testing accuracy was compared with those of other related works. The proposed architecture outperformed the other related works in terms of its testing accuracy.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132028870","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}
引用次数: 29
Version.01: design and development soft actuator prototype for surgical lighting system 01版:设计和开发手术照明系统的软执行器原型
Int. J. Reason. based Intell. Syst. Pub Date : 2019-08-23 DOI: 10.1504/IJRIS.2019.10023433
S. Ghate, G. Kulikovskis
{"title":"Version.01: design and development soft actuator prototype for surgical lighting system","authors":"S. Ghate, G. Kulikovskis","doi":"10.1504/IJRIS.2019.10023433","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10023433","url":null,"abstract":"Surgical luminaires are used for illumination of wounds during surgery. For optimal illumination surgical luminaries need to change their orientation several times during surgery. The aim of this project is to simplify and optimise the design of the surgical lighting system to overcome the structural limitation and to reduce singularity. Most of the surgical lighting systems (SLS) are made up of six links - in order to achieve five degree of freedom. This is an attempt to reduce the number of linkages in SLS by introducing a bendable soft actuator. The pneumatic bending actuator which is made of silicone rubber undergoes the desired deformation when each chamber is pressurised. Because of the flexibility soft actuators has the advantage to overcome the mechanical singularity faced in existing surgical lighting systems. A mathematical model has been developed for mapping geometric deformation of soft actuators. A fourth degree polynomial approximation has been used to characterise the behaviour of each chamber of the actuator.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127899780","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}
引用次数: 0
Intelligent control algorithm for USV with input saturation based on RBF network compensation 基于RBF网络补偿的USV输入饱和智能控制算法
Int. J. Reason. based Intell. Syst. Pub Date : 2019-08-23 DOI: 10.1504/IJRIS.2019.10023437
Renqiang Wang, Keyin Miao, Jianming Sun, Jingdong Li, Dawei Chen
{"title":"Intelligent control algorithm for USV with input saturation based on RBF network compensation","authors":"Renqiang Wang, Keyin Miao, Jianming Sun, Jingdong Li, Dawei Chen","doi":"10.1504/IJRIS.2019.10023437","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10023437","url":null,"abstract":"A type of intelligent control algorithm of course tracking for USV was proposed on the basis of RBF network approximation and compensation with input saturation. Firstly, sliding surfaces with integrator were designed on the basis of sliding mode control technology. Secondly, radial basis function neural network was applied to approximate compensating the system input saturation. Thirdly, second-order system observer was introduced to overcome the bounded outside interference. Finally, the control algorithm for USV was deduced by backstepping method with Lyapunov theory. Simulation result indicated that the intelligent control algorithm is suitable for USV.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126150580","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}
引用次数: 4
A hybrid algorithm for efficient task scheduling in cloud computing environment 一种云计算环境下高效任务调度的混合算法
Int. J. Reason. based Intell. Syst. Pub Date : 2019-05-15 DOI: 10.1504/IJRIS.2019.10021325
M. R. Thanka, P. Maheswari, E. Edwin
{"title":"A hybrid algorithm for efficient task scheduling in cloud computing environment","authors":"M. R. Thanka, P. Maheswari, E. Edwin","doi":"10.1504/IJRIS.2019.10021325","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10021325","url":null,"abstract":"Cloud is a boon to the generation which provides services that can reduce the overhead in maintenance and computational complexities. Scheduling the user's job in the cloud resources plays an important role for the better performance. Task scheduling is an NP-hard problem, since it may have more than one solution to fit in. In this paper a hybrid algorithm is proposed by the amalgamation of artificial bee colony Algorithm and particle swarm optimisation named as ABPS algorithm. The proposed ABPS algorithm optimises the task scheduling on the cloud environment by providing minimised makespan, cost, and maximised resource utilisation and to balance the load. The proposed ABPS algorithm compared with ABC and PSO algorithm have been simulated in the CloudSim simulation tool. The proposed ABPS algorithm based on makespan outperforms ABC and PSO algorithms by 22.07% and 28.12%, respectively, also when compared with cost outperforms ABC and PSO algorithms by 32.41% and 44.49% respectively. ABPS algorithm based on resource utilisation outperforms ABC and PSO algorithms by 49.37% and 48.88% respectively and based on degree of imbalance outperforms ABC and PSO algorithms by 16.21% and 20.51% respectively.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115515199","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}
引用次数: 9
Evaluation of worker quality in crowdsourcing system on Hadoop platform Hadoop平台众包系统员工素质评价
Int. J. Reason. based Intell. Syst. Pub Date : 2019-05-15 DOI: 10.1504/IJRIS.2019.10021330
C. Kavitha, R. S. Lakshmi, J. A. Devi, U. Pradheeba
{"title":"Evaluation of worker quality in crowdsourcing system on Hadoop platform","authors":"C. Kavitha, R. S. Lakshmi, J. A. Devi, U. Pradheeba","doi":"10.1504/IJRIS.2019.10021330","DOIUrl":"https://doi.org/10.1504/IJRIS.2019.10021330","url":null,"abstract":"Crowdsourcing is a new emerging distributed computing and problem solving production model on the backdrop of internet. The data size of crowdsources and tasks grows rapidly due to the rapid development of the crowdsourcing system. To evaluate the worker quality, based on the big data technology has become a more complex challenge. In this paper, we propose a general worker quality evaluation algorithm which can be applied to any critical tasks without wasting resources. Realising the evaluation algorithm in the Hadoop platform using MapReduce parallel programming is also involved. Efficiency and accuracy of the algorithm is effectively verified in the wide variety of many big data scenarios.","PeriodicalId":360794,"journal":{"name":"Int. J. Reason. based Intell. Syst.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131667359","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信