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

Int. J. Intell. Syst. Technol. Appl.最新文献

筛选
英文 中文
A game-based virtual machine pricing mechanism in federated clouds 联邦云中基于游戏的虚拟机定价机制
Int. J. Intell. Syst. Technol. Appl. Pub Date : 2019-07-24 DOI: 10.1504/IJISTA.2019.10022754
Ying Hu
{"title":"A game-based virtual machine pricing mechanism in federated clouds","authors":"Ying Hu","doi":"10.1504/IJISTA.2019.10022754","DOIUrl":"https://doi.org/10.1504/IJISTA.2019.10022754","url":null,"abstract":"In a federated cloud environment, diverse pricing schemes among different IaaS service providers (ISPs) form a complex economic landscape that nurtures the market of cloud brokers. Although pricing mechanisms have been proposed in the past few years, few of them address the issue of competitive and cooperative behaviours among different ISPs. In this paper, we employ the learning curve to model the operation cost of ISPs, and introduce a novel algorithm that determines the cooperative pricing mechanism among different ISPs. The cooperation decision algorithm uses the operation cost computed based on the learning curve model and price policies obtained from the competition part as parameters to calculate the final revenue when outsourcing or locally satisfying users' resource requests. Extensive experiments are conducted in a real-world federated cloud platform, and the experimental results are compared with three existing pricing mechanisms. Our experimental results show that the proposed pricing mechanism is effective to improve resource utilisation as well as reduce the profit loss caused by request rejection.","PeriodicalId":420808,"journal":{"name":"Int. J. Intell. Syst. Technol. Appl.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121002326","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
Modelling and simulation of fuzzy-based MPPT control of grid connected PV system under variable load and irradiance 变负荷、变辐照度下并网光伏系统模糊MPPT控制建模与仿真
Int. J. Intell. Syst. Technol. Appl. Pub Date : 2019-07-24 DOI: 10.1504/IJISTA.2019.10022742
S. Choudhury, P. Rout
{"title":"Modelling and simulation of fuzzy-based MPPT control of grid connected PV system under variable load and irradiance","authors":"S. Choudhury, P. Rout","doi":"10.1504/IJISTA.2019.10022742","DOIUrl":"https://doi.org/10.1504/IJISTA.2019.10022742","url":null,"abstract":"The photovoltaic (PV)-based distribution generation system has a nonlinear power characteristic curve under random variation in solar irradiance, ambient temperature and electric load. As a result, for the accurate detection and tracking of the maximum power points (MPPs), it is necessary to design an optimal controller with dynamic control capability. As solution to the above issue, this paper presents an intelligent Mamdani-based fuzzy logic controller (M-FLC) for maximum power point tracking (MPPT) of a PV system. Different test cases with respect to different possible load and irradiance variations in grid connected mode of operation are investigated. To confirm the power quality indices within IEEE standards specification, fast Fourier transform (FFT) analysis of voltage and current at the point of common coupling has been done. A detailed comparison has been made in between PV without MPPT, with incremental conductance and proposed fuzzy logic control (FLC). The results show an enhance efficiency of energy production from PV and reflects the effectiveness of the proposed scheme justifying its real time application.","PeriodicalId":420808,"journal":{"name":"Int. J. Intell. Syst. Technol. Appl.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131211566","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
Interest emotion recognition approach using self-organising map and motion estimation 基于自组织地图和运动估计的兴趣情绪识别方法
Int. J. Intell. Syst. Technol. Appl. Pub Date : 2019-07-10 DOI: 10.1504/IJISTA.2019.10022616
Kenza Belhouchette, M. Berkane, H. Belhadef
{"title":"Interest emotion recognition approach using self-organising map and motion estimation","authors":"Kenza Belhouchette, M. Berkane, H. Belhadef","doi":"10.1504/IJISTA.2019.10022616","DOIUrl":"https://doi.org/10.1504/IJISTA.2019.10022616","url":null,"abstract":"Recognising human facial emotions by computer is an interesting problem. Although several approaches have been proposed the recognition rate, amount of used resources and calculation time remain factors for improvement. Our work presents a new approach for recognising basic emotions (joy, sadness, anger, disgust, surprise and fear) in image sequences. We introduced interest emotion and created its corresponding action units (AUs) based on psychological foundations. Our approach is mainly characterised by minimising used data and consequently optimising the computing time and improving the recognition rate. The proposed approach was divided into three steps: face detection using the Viola and Jones method, the extraction of facial features: here we exploited the facial action coding system, which is based on AUs. To detect AUs, we extracted face strategic points using an active appearance model and a block-matching approach. At the last, we classified the results by using the Kohonen self-organising map (SOM).","PeriodicalId":420808,"journal":{"name":"Int. J. Intell. Syst. Technol. Appl.","volume":"421 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122910964","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
Data stream management system for video on demand hybrid storage server 视频点播混合存储服务器数据流管理系统
Int. J. Intell. Syst. Technol. Appl. Pub Date : 2019-07-10 DOI: 10.1504/IJISTA.2019.10022619
O. A. Al-wesabi, P. Sumari, Nibras Abdullah
{"title":"Data stream management system for video on demand hybrid storage server","authors":"O. A. Al-wesabi, P. Sumari, Nibras Abdullah","doi":"10.1504/IJISTA.2019.10022619","DOIUrl":"https://doi.org/10.1504/IJISTA.2019.10022619","url":null,"abstract":"Video on demand (VOD) server requires a large storage capacity and rapid video retrieval from this storage to quickly stream these videos to users. The hybrid storage system, which combines HDDs and SSD in the server, has become popular because of such requirements. The combination of both storage modes is relatively weak in terms of optimising fast access prior and in supporting the production of a high number of simultaneous streams. This paper presents an enhanced hybrid storage system (EHSS)-based VOD server to improve the performance of the VOD server. The design of the EHSS and its streaming management scheme produce high performance and satisfy the performance requirements of a VOD server in terms of I/O throughput and access latency. The experimental results show that the proposed work provides better performance than the VOD server-based FADM because it enhances the average response times for the various scales of intensive workload by 69.89%.","PeriodicalId":420808,"journal":{"name":"Int. J. Intell. Syst. Technol. Appl.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116434704","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
Arabic sign language recognition using vision and hand tracking features with HMM 阿拉伯手语识别使用视觉和手跟踪特征与HMM
Int. J. Intell. Syst. Technol. Appl. Pub Date : 2019-07-10 DOI: 10.1504/IJISTA.2019.10022617
A. A. I. Sidig, H. Luqman, S. Mahmoud
{"title":"Arabic sign language recognition using vision and hand tracking features with HMM","authors":"A. A. I. Sidig, H. Luqman, S. Mahmoud","doi":"10.1504/IJISTA.2019.10022617","DOIUrl":"https://doi.org/10.1504/IJISTA.2019.10022617","url":null,"abstract":"Sign language employs signs made by hands and facial expressions to convey meaning. Sign language recognition facilitates the communication between community and hearing-impaired people. This work proposes a recognition system for Arabic sign language using four types of features, namely modified Fourier transform, local binary pattern, histogram of oriented gradients, and a combination of histogram of oriented gradients and histogram of optical flow. These features are evaluated using hidden Markov model on two databases. The best performance is achieved with modified Fourier transform and histogram of oriented gradients features with 99.11% and 99.33% accuracies, respectively. In addition, two algorithms are proposed, one for segmenting sign video streams captured by Microsoft Kinect V2 into signs and the second for hand detection in video streams. The obtained results show that our algorithms are efficient in segmenting sign video streams and detecting hands in video streams.","PeriodicalId":420808,"journal":{"name":"Int. J. Intell. Syst. Technol. Appl.","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127238768","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
Quality of service task scheduling algorithm for time-cost trade off scheduling problem in cloud computing environment 针对云计算环境下时间成本权衡调度问题的服务质量任务调度算法
Int. J. Intell. Syst. Technol. Appl. Pub Date : 2019-07-10 DOI: 10.1504/IJISTA.2019.10022618
Danlami Gabi, A. Ismail, A. Zainal, Z. Zakaria
{"title":"Quality of service task scheduling algorithm for time-cost trade off scheduling problem in cloud computing environment","authors":"Danlami Gabi, A. Ismail, A. Zainal, Z. Zakaria","doi":"10.1504/IJISTA.2019.10022618","DOIUrl":"https://doi.org/10.1504/IJISTA.2019.10022618","url":null,"abstract":"In cloud computing environment, managing trade-offs between time and cost when executing large-scale tasks to guarantee customers minimum running time and cost of computation is not always feasible. Metaheuristics scheduling algorithms are considered as potential solutions but however, exhibit local trapping and imbalance between its global and local search. In this study, a multi-objective task scheduling model is first developed upon which a dynamic multi-objective orthogonal Taguchi-based cat swarm optimisation (dMOOTC) task scheduling algorithm is proposed to solve the model. In the developed dMOOTC algorithm, the Taguchi orthogonal approach and Pareto-optimisation strategy are used to reduced local trapping and balances between the global and local search which possibly increases its speed of convergence. Thirty independent simulation runs were conducted on CloudSim simulator tool. The results of the simulation showed that the dMOOTC scheduling algorithm showed a remarkable performance in minimising the time and cost compared to the benchmarked algorithms.","PeriodicalId":420808,"journal":{"name":"Int. J. Intell. Syst. Technol. Appl.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126354427","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
Similarity searching in ligand-based virtual screening using different fingerprints and different similarity coefficients 基于配体的虚拟筛选中不同指纹和不同相似系数的相似性搜索
Int. J. Intell. Syst. Technol. Appl. Pub Date : 2019-06-03 DOI: 10.1504/IJISTA.2019.10021692
Berrhail Fouaz, H. Belhadef, Hamza Hentabli, Faisal Saeed
{"title":"Similarity searching in ligand-based virtual screening using different fingerprints and different similarity coefficients","authors":"Berrhail Fouaz, H. Belhadef, Hamza Hentabli, Faisal Saeed","doi":"10.1504/IJISTA.2019.10021692","DOIUrl":"https://doi.org/10.1504/IJISTA.2019.10021692","url":null,"abstract":"Similarity searching plays an increasingly important role in virtual screening. It is a screening technique that works by comparing the features of the target compound with the features of each compound in the database of compounds. This comparison can be described in three steps. The first step involves the representation of the target compound and the database compounds with an equivalent representation, which is set of binary elements describing the presence or the absence of attributes of compounds (fingerprint). The second step uses similarity coefficient to calculate the score of similarity between two compounds representation. The third step is to rank the database compounds in appropriate order of the similarity score, in order to determine the actives compounds. Many approaches and techniques have been introduced in literature to enhancing and improving similarity-based virtual screening. In this work, our primary interests are to investigate the effect of using different combinations of fingerprint and similarity coefficient in ligand-based virtual screening (LBVS). We use in this investigation the MDDR (drug data report database) to evaluate the different combinations descriptor-coefficient. Some obtained results of combinations with some coefficients demonstrate superiority in performances to these obtained in combination with Tanimoto coefficient.","PeriodicalId":420808,"journal":{"name":"Int. J. Intell. Syst. Technol. Appl.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124314215","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}
引用次数: 2
Unsupervised generation of Arabic words 阿拉伯语单词的无监督生成
Int. J. Intell. Syst. Technol. Appl. Pub Date : 2019-06-03 DOI: 10.1504/IJISTA.2019.10021684
A. Khorsi, A. Alsheddi
{"title":"Unsupervised generation of Arabic words","authors":"A. Khorsi, A. Alsheddi","doi":"10.1504/IJISTA.2019.10021684","DOIUrl":"https://doi.org/10.1504/IJISTA.2019.10021684","url":null,"abstract":"Automated word generation might be seen as the reverse process of morphology learning. The aim is to automatically coin valid words in the targeted language. As many other challenges in the field of natural language processing (NLP), the building of the generation engine might be carried out using a supervised or unsupervised approach. The former requires a clean learning data set of a decent size whereas the later needs no more than a plain text. Nonetheless, the unsupervised approaches are usually blamed for their low accuracy. The present article reports the results of an investigation on a context free generation of classical Arabic words. Unsupervised and relatively simple, The proposed approach reached easily an accuracy of 90%.","PeriodicalId":420808,"journal":{"name":"Int. J. Intell. Syst. Technol. Appl.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120949709","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
Local search-based recommender system for computing the similarity matrix 基于局部搜索的推荐系统中相似矩阵的计算
Int. J. Intell. Syst. Technol. Appl. Pub Date : 2019-06-03 DOI: 10.1504/IJISTA.2019.10019366
Y. Kilani, A. Alsarhan, Mohammad Bsoul, Subhieh M. El-Salhi
{"title":"Local search-based recommender system for computing the similarity matrix","authors":"Y. Kilani, A. Alsarhan, Mohammad Bsoul, Subhieh M. El-Salhi","doi":"10.1504/IJISTA.2019.10019366","DOIUrl":"https://doi.org/10.1504/IJISTA.2019.10019366","url":null,"abstract":"Recommender systems reduce the users' effort in finding their favourite items among a great number of items. In collaborative-based RSs, there are different similarity measures like: genetic algorithms, Pearson and cosine-based similarity techniques. The number of items and personal attributes (e.g., environment, sex, job, religion, age, county, education, etc.) that are used by the similarity metric algorithms are increasing significantly which makes the recommendation task more difficult. In our project, we introduce a new RS that uses the local search algorithms to compute the similarity matrix. As far as we know, we have not found any work in the RS literature that uses local search algorithms techniques. We show that our new RS computes the similarity matrix and outperforms the other techniques like the Pearson correlation and cosine similarity and some of the recent genetic-based recommender systems.","PeriodicalId":420808,"journal":{"name":"Int. J. Intell. Syst. Technol. Appl.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127774336","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}
引用次数: 2
Neural network-based adaptive selection CFAR for radar target detection in various environments 基于神经网络的自适应选择CFAR在各种环境下的雷达目标检测
Int. J. Intell. Syst. Technol. Appl. Pub Date : 2019-06-03 DOI: 10.1504/IJISTA.2019.10021691
B. Rohman, D. Kurniawan
{"title":"Neural network-based adaptive selection CFAR for radar target detection in various environments","authors":"B. Rohman, D. Kurniawan","doi":"10.1504/IJISTA.2019.10021691","DOIUrl":"https://doi.org/10.1504/IJISTA.2019.10021691","url":null,"abstract":"Constant false alarm rate (CFAR), a target detection method commonly used in the radar systems, has an inconsistent performance against various environments. For improving the radar detectability, this paper proposes a novel scheme of radar target detection using neural network-based adaptive selection CFAR. The proposed method employs cell-averaging, ordered-statistic, greatest-of and smallest-of CFAR thresholds as the basis of references. The pattern of those threshold values combined with the cell under test signal value will be identified and classified by the neural network to compute the raw threshold. Then, the final threshold is selected depending on the nearest value between raw and four referenced CFARs. The performance of the proposed method is examined against three possible cases of the radar systems including homogeneous background, multiple targets and clutter boundary. The result of this research shows that the proposed method outperforms the classical CFARs due to the adaptive selection algorithm can select properly among referenced CFARs against the given cases particularly in the homogeneous and multiple target environments.","PeriodicalId":420808,"journal":{"name":"Int. J. Intell. Syst. Technol. Appl.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130169466","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信