Task scheduling problem in cloud computing environment is NP-hard problem, which is difficult to obtain exact optimal solution and is suitable for using intelligent optimization algorithms to approximate the optimal solution. Meanwhile, quality of service (QoS) is an important indicator to measure the performance of task scheduling. In this paper, a novel task scheduling algorithm MQoS-GAAC with multi-QoS constraints is proposed, considering the time-consuming, expenditure, security and reliability in the scheduling process. The algorithm integrates ant colony optimization algorithm (ACO) with genetic algorithm (GA). To generate the initial pheromone efficiently for ACO, GA is invoked. With the designed fitness function, 4-dimensional QoS objectives are evaluated. Then, ACO is utilized to seek out the optimum resource. The experiment indicates that the proposed algorithm has preferable performance both in balancing resources and guaranteeing QoS.
{"title":"A Task Scheduling Algorithm Based on Genetic Algorithm and Ant Colony Optimization Algorithm with Multi-QoS Constraints in Cloud Computing","authors":"Yan-hong Dai, Yuansheng Lou, Xin Lu","doi":"10.1109/IHMSC.2015.186","DOIUrl":"https://doi.org/10.1109/IHMSC.2015.186","url":null,"abstract":"Task scheduling problem in cloud computing environment is NP-hard problem, which is difficult to obtain exact optimal solution and is suitable for using intelligent optimization algorithms to approximate the optimal solution. Meanwhile, quality of service (QoS) is an important indicator to measure the performance of task scheduling. In this paper, a novel task scheduling algorithm MQoS-GAAC with multi-QoS constraints is proposed, considering the time-consuming, expenditure, security and reliability in the scheduling process. The algorithm integrates ant colony optimization algorithm (ACO) with genetic algorithm (GA). To generate the initial pheromone efficiently for ACO, GA is invoked. With the designed fitness function, 4-dimensional QoS objectives are evaluated. Then, ACO is utilized to seek out the optimum resource. The experiment indicates that the proposed algorithm has preferable performance both in balancing resources and guaranteeing QoS.","PeriodicalId":6592,"journal":{"name":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"31 3 1","pages":"428-431"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75803923","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}
The quasi-sliding-mode control based on non-linear surface which has variable damping characteristic is proposed for discrete-time systems with uncertainty which is boundary or slow time-variant. The strategy could ensure reduce the region of quasi-sliding mode, improve dynamic quality. The control chattering and steady-states chattering are avoided. Dynamic performance and steady-state behavior get improved comparing with quasi-sliding mode control based on linear sliding surface.
{"title":"Quasi-Sliding-Mode Control Based on Non-linear Surface","authors":"Tao Liu, Hengliang Tang, Xiangqin Wei","doi":"10.1109/IHMSC.2015.132","DOIUrl":"https://doi.org/10.1109/IHMSC.2015.132","url":null,"abstract":"The quasi-sliding-mode control based on non-linear surface which has variable damping characteristic is proposed for discrete-time systems with uncertainty which is boundary or slow time-variant. The strategy could ensure reduce the region of quasi-sliding mode, improve dynamic quality. The control chattering and steady-states chattering are avoided. Dynamic performance and steady-state behavior get improved comparing with quasi-sliding mode control based on linear sliding surface.","PeriodicalId":6592,"journal":{"name":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"82 1","pages":"476-479"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78323135","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}
A two-dimensional axisymmetric finite element model of metal multi-convolution ring was established by using FEM analysis software ANSYS. Influence on mechanical properties and sealing performance in working condition resulted from changes of structure parameters such as the thickness, wave height, crest radius, trough radius were analyzed by orthogonal design, put forward some suggestions for the structural parameters design of metallic multi-convolution ring by taking manufacturing condition and actual demand into consideration.
{"title":"Analysis of Structural Parameters of Metal Multi-convolution Ring","authors":"Yang Jie, Suo Shuangfu, Wang Chenxi","doi":"10.1109/IHMSC.2015.249","DOIUrl":"https://doi.org/10.1109/IHMSC.2015.249","url":null,"abstract":"A two-dimensional axisymmetric finite element model of metal multi-convolution ring was established by using FEM analysis software ANSYS. Influence on mechanical properties and sealing performance in working condition resulted from changes of structure parameters such as the thickness, wave height, crest radius, trough radius were analyzed by orthogonal design, put forward some suggestions for the structural parameters design of metallic multi-convolution ring by taking manufacturing condition and actual demand into consideration.","PeriodicalId":6592,"journal":{"name":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"14 1","pages":"136-140"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72943849","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}
The combinatorial optimization problem of assigning cooperating unmanned aerial vehicles to multiple tasks is posed by a shared model. A discrete particle swarm optimization algorithm for solving such a problem is proposed. A matrix representation of the algorithm's position vector spaces is employed. A new update strategy for the position and speed of particle is applied in this algorithm. The performance of the algorithm is compared to that of particle swarm optimization algorithm and genetic algorithm for two different cost functions. Simulation results demonstrated the effectiveness and feasibility of the proposed approach.
{"title":"UAV Cooperative Multiple Task Assignment Based on Discrete Particle Swarm Optimization","authors":"Shaolei Zhou, Gao-yang Yin, Qingpo Wu","doi":"10.1109/IHMSC.2015.206","DOIUrl":"https://doi.org/10.1109/IHMSC.2015.206","url":null,"abstract":"The combinatorial optimization problem of assigning cooperating unmanned aerial vehicles to multiple tasks is posed by a shared model. A discrete particle swarm optimization algorithm for solving such a problem is proposed. A matrix representation of the algorithm's position vector spaces is employed. A new update strategy for the position and speed of particle is applied in this algorithm. The performance of the algorithm is compared to that of particle swarm optimization algorithm and genetic algorithm for two different cost functions. Simulation results demonstrated the effectiveness and feasibility of the proposed approach.","PeriodicalId":6592,"journal":{"name":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"9 1","pages":"81-86"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75216102","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}
In this paper we applied a Histogram Intersection Kernel (HIK) method for categorization of the Caltech101 dataset. We analyzed the principles of HIK and propose an optimal linear combination of kernels used in Spatial Pyramid model (SPM). Sift algorithm is utilized to detect and describe image features based on Bag of Words model. The performance is compared between HIK and general RBF using SVM for the classification. The experimental results show that, based on the same image dataset, HIK outperforms RBF. Furthermore, HIK-SVM's performance is improved with the increasing layers of SPM. On the contrary, RBF-SVM's performance worsens when the layers of SPM increase.
本文采用直方图交叉核(HIK)方法对Caltech101数据集进行分类。本文分析了空间金字塔模型的基本原理，提出了空间金字塔模型(SPM)的最优线性组合。基于Bag of Words模型，利用Sift算法对图像特征进行检测和描述。利用支持向量机进行分类，比较了HIK和一般RBF的性能。实验结果表明，在相同的图像数据集上，HIK算法优于RBF算法。此外，HIK-SVM的性能随着SPM层数的增加而提高。相反，随着SPM层数的增加，RBF-SVM的性能反而变差。
{"title":"An Improved HIK for Object Categorization","authors":"Lu Wu, Quan Liu, Qin Wei","doi":"10.1109/IHMSC.2015.257","DOIUrl":"https://doi.org/10.1109/IHMSC.2015.257","url":null,"abstract":"In this paper we applied a Histogram Intersection Kernel (HIK) method for categorization of the Caltech101 dataset. We analyzed the principles of HIK and propose an optimal linear combination of kernels used in Spatial Pyramid model (SPM). Sift algorithm is utilized to detect and describe image features based on Bag of Words model. The performance is compared between HIK and general RBF using SVM for the classification. The experimental results show that, based on the same image dataset, HIK outperforms RBF. Furthermore, HIK-SVM's performance is improved with the increasing layers of SPM. On the contrary, RBF-SVM's performance worsens when the layers of SPM increase.","PeriodicalId":6592,"journal":{"name":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"125 1","pages":"412-415"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86061569","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}
This paper studies the project network diagram drawing algorithm, and uses Scalable Vector Graphics (SVG) technology to achieve drawing project network diagram on a Web page dynamically. As a result, reduce the amount of network data transmission and the burden on the server, as well as effectively improve the response speed of the project network diagram drawing. At the same time, SVG technology supports scripting language, such enhances the dynamics and interaction of project network diagram. Through dragging nodes using the mouse, optimize the display of project network diagram.
{"title":"Study on the Drawing Method of Project Network Diagram","authors":"Wu Ke-he, Wu Tingting, An Yanwen, Zeng Wenjing","doi":"10.1109/IHMSC.2015.245","DOIUrl":"https://doi.org/10.1109/IHMSC.2015.245","url":null,"abstract":"This paper studies the project network diagram drawing algorithm, and uses Scalable Vector Graphics (SVG) technology to achieve drawing project network diagram on a Web page dynamically. As a result, reduce the amount of network data transmission and the burden on the server, as well as effectively improve the response speed of the project network diagram drawing. At the same time, SVG technology supports scripting language, such enhances the dynamics and interaction of project network diagram. Through dragging nodes using the mouse, optimize the display of project network diagram.","PeriodicalId":6592,"journal":{"name":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"40 1","pages":"95-98"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82194529","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}
There are many artificial intelligent applications. Some of them focus on the financial market. They often use a nature language processing method, e.g., To predict stock prices. However, most of them are inaccurate. There are two reasons. For one thing, computer programs are more effective in the syntax analysis than semantic analysis. For another, accurately predicting stock prices is beyond our knowledge and ability today. However, there are many valuable experiences in existing studies. Therefore, we propose a unified view and procedure to facilitate using these experiences. This procedure is based on the common knowledge, which is primarily expressed as keywords in this paper. It first recognizes name entities and then learns rules with the common knowledge and last inferences crucial features. These features, with other quantitative features in the stock market, may make the prediction more accurate. As a result, this view and process can be a framework for many (but not all) nature language processing applications in stock predicting.
{"title":"Qualitative Stock Market Predicting with Common Knowledge Based Nature Language Processing: A Unified View and Procedure","authors":"Dongning Rao, Fudong Deng, Zhihua Jiang, Gansen Zhao","doi":"10.1109/IHMSC.2015.114","DOIUrl":"https://doi.org/10.1109/IHMSC.2015.114","url":null,"abstract":"There are many artificial intelligent applications. Some of them focus on the financial market. They often use a nature language processing method, e.g., To predict stock prices. However, most of them are inaccurate. There are two reasons. For one thing, computer programs are more effective in the syntax analysis than semantic analysis. For another, accurately predicting stock prices is beyond our knowledge and ability today. However, there are many valuable experiences in existing studies. Therefore, we propose a unified view and procedure to facilitate using these experiences. This procedure is based on the common knowledge, which is primarily expressed as keywords in this paper. It first recognizes name entities and then learns rules with the common knowledge and last inferences crucial features. These features, with other quantitative features in the stock market, may make the prediction more accurate. As a result, this view and process can be a framework for many (but not all) nature language processing applications in stock predicting.","PeriodicalId":6592,"journal":{"name":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"6 1","pages":"381-384"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75760246","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}
Underwater communication plays an important role in communication field. As underwater communication has very special scenario, traditional communication technologists can not be transplant directly, blue-green laser communication has been used in underwater wireless communication system for many years. In this paper, we analyze the relationship between output laser intensity and forward scattering coefficient. Monte Carlo simulation mechanism is used in this paper as a tool to simulate a specific environment. Simulation results show that with increasing of forward scattering coefficient the value of biggest output laser intensity will enhance step by step. We also find that the forward scattering coefficient under the rule of Poisson distribution with the biggest output laser intensity.
{"title":"Using Monte Carlo Methods to Simulate Relay Function of Particles in Underwater Communication","authors":"Dong'Ang Li, Yanbo Zhang, Shuai Ren, Jiashun Huang","doi":"10.1109/IHMSC.2015.204","DOIUrl":"https://doi.org/10.1109/IHMSC.2015.204","url":null,"abstract":"Underwater communication plays an important role in communication field. As underwater communication has very special scenario, traditional communication technologists can not be transplant directly, blue-green laser communication has been used in underwater wireless communication system for many years. In this paper, we analyze the relationship between output laser intensity and forward scattering coefficient. Monte Carlo simulation mechanism is used in this paper as a tool to simulate a specific environment. Simulation results show that with increasing of forward scattering coefficient the value of biggest output laser intensity will enhance step by step. We also find that the forward scattering coefficient under the rule of Poisson distribution with the biggest output laser intensity.","PeriodicalId":6592,"journal":{"name":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"80 1","pages":"513-516"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78979507","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}
Aged care is becoming serious social problem in our world, community service for the elderly is an important part and informationalization is an inevitable trend in the future. While the existing information systems for it is not scalable enough for the increasing number of aged population. Cloud computing promises low cost, high scalability, availability and disaster recoverability which can be a natural solution for some of the problems faced in aged care information systems. After examining the advantages of cloud computing on improving aged care services and exploring the requirements of aged care at home with community service, this paper propose an cloud computing based aged-care at home with community service information system. It details the functional and architecture design as well as the experimental deployment. The proposed model introduced in this paper offers a flexible and portable platform for aged care system.
{"title":"Research on an Aged-Care Service Information System Based on Cloud Computing","authors":"Xiaoqing Li, Xiaosheng Huang","doi":"10.1109/IHMSC.2015.193","DOIUrl":"https://doi.org/10.1109/IHMSC.2015.193","url":null,"abstract":"Aged care is becoming serious social problem in our world, community service for the elderly is an important part and informationalization is an inevitable trend in the future. While the existing information systems for it is not scalable enough for the increasing number of aged population. Cloud computing promises low cost, high scalability, availability and disaster recoverability which can be a natural solution for some of the problems faced in aged care information systems. After examining the advantages of cloud computing on improving aged care services and exploring the requirements of aged care at home with community service, this paper propose an cloud computing based aged-care at home with community service information system. It details the functional and architecture design as well as the experimental deployment. The proposed model introduced in this paper offers a flexible and portable platform for aged care system.","PeriodicalId":6592,"journal":{"name":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"83 1","pages":"315-318"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77648509","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}
This paper develops two blind estimation algorithms based on the tensor for the time-variant channel of uplink relaying cooperative system. Compared with the traditional blind estimation of matrix-based, the proposed adaptive tracking parallel factor (PARAFAC) decomposition based on the high order tensor model not only has the characteristics of simple calculation and the flexible parameter selection, but also simplify the uniqueness of the blind channel estimation. In this system, receive signal is represent the third order tensor model firstly, and then the initial estimate update variables according to PARAFAC with the Least Mean Squares (LMS) and Recursive Least Squares (RLS). It is shown that, this method has the lower complexity and better robustness for time-varying channel. Simulation results reveal that the proposed algorithms can significantly improve the BER performance when compared to the existing research.
{"title":"Tensor-Based Blind Time-Variant Channel Estimation for Uplink Relaying Cooperative Systems","authors":"Xiaofeng Liu, Yinghui Zhang","doi":"10.1109/IHMSC.2015.235","DOIUrl":"https://doi.org/10.1109/IHMSC.2015.235","url":null,"abstract":"This paper develops two blind estimation algorithms based on the tensor for the time-variant channel of uplink relaying cooperative system. Compared with the traditional blind estimation of matrix-based, the proposed adaptive tracking parallel factor (PARAFAC) decomposition based on the high order tensor model not only has the characteristics of simple calculation and the flexible parameter selection, but also simplify the uniqueness of the blind channel estimation. In this system, receive signal is represent the third order tensor model firstly, and then the initial estimate update variables according to PARAFAC with the Least Mean Squares (LMS) and Recursive Least Squares (RLS). It is shown that, this method has the lower complexity and better robustness for time-varying channel. Simulation results reveal that the proposed algorithms can significantly improve the BER performance when compared to the existing research.","PeriodicalId":6592,"journal":{"name":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"21 1","pages":"153-156"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89326036","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：