The Truck backer-upper problem is a typical problem in the domain of fuzzy control and being a highly nonlinear control problem .This paper present control strategy of fuzzy control based on the Line of Sight (LOS) ,and according to the experience of driver ,and simulation experiment for the problem of backing up truck, simply the fuzzy control rule ,the control of this fuzzy controller is successful to achieve the specified point control problem of backing up truck, control sensitively and without overshoot .The simulation experiment results show that the designed fuzzy controller based on LOS is very useful in backing up truck.
{"title":"Backing up Truck Control Automatically Based on LOS","authors":"Jing Wang, Yong Zhang","doi":"10.1109/HIS.2009.134","DOIUrl":"https://doi.org/10.1109/HIS.2009.134","url":null,"abstract":"The Truck backer-upper problem is a typical problem in the domain of fuzzy control and being a highly nonlinear control problem .This paper present control strategy of fuzzy control based on the Line of Sight (LOS) ,and according to the experience of driver ,and simulation experiment for the problem of backing up truck, simply the fuzzy control rule ,the control of this fuzzy controller is successful to achieve the specified point control problem of backing up truck, control sensitively and without overshoot .The simulation experiment results show that the designed fuzzy controller based on LOS is very useful in backing up truck.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127505839","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}
Authorization takes a significant role in grid security, and the function of the agent is more and more obvious in the grid environment. However, some popular grid toolkits (e.g., Globus) do not support agent technology. In order to enhance the real-time validity of the authorization process, lighten the users’ burden, reduce the cost of management and apply intelligent authorization, this paper introduces intelligent agent technology to Grid authorization. This paper also proposes a framework for a new intelligent authorization agent model, which composed of five modules: a communication module, an analysis module, a task scheduler module, a reaction module and an authorization database module. In addition, the paper describes the agent structure and the new authorization policy. Finally, the paper presents a comparison between the proposed model and the Globus model.
{"title":"A New Intelligent Authorization Agent Model in Grid","authors":"Zhi-Hui Wang, Mingchu Li, Mao-Hua Chen, Chinchen Chang","doi":"10.1109/HIS.2009.83","DOIUrl":"https://doi.org/10.1109/HIS.2009.83","url":null,"abstract":"Authorization takes a significant role in grid security, and the function of the agent is more and more obvious in the grid environment. However, some popular grid toolkits (e.g., Globus) do not support agent technology. In order to enhance the real-time validity of the authorization process, lighten the users’ burden, reduce the cost of management and apply intelligent authorization, this paper introduces intelligent agent technology to Grid authorization. This paper also proposes a framework for a new intelligent authorization agent model, which composed of five modules: a communication module, an analysis module, a task scheduler module, a reaction module and an authorization database module. In addition, the paper describes the agent structure and the new authorization policy. Finally, the paper presents a comparison between the proposed model and the Globus model.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116966749","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 most popular routing algorithm in p2p network is that every node keeps a route table which records a certain number of other nodes. Such algorithm selects neighbor nodes at random, and this reduces routing efficiency. In this paper a new algorithm of optimizing p2p overlay network topology is proposed, which is based on minimum maximum k-means principle. According to the communication history, the division presents a steady network topology with k clusters and k cluster center nodes. This optimized p2p network topology presents a high performance of routing efficiency. The minimum maximum principle makes the division more appropriate, so that there will be less probability of being unsteady for the p2p network. The conclusions show that this algorithm is an efficient p2p network topology optimized algorithm.
{"title":"A P2P Network Topology Optimized Algorithm Based on Minimum Maximum K-Means Principle","authors":"Y. Ma, Zhenhua Tan, G. Chang, Xiaoxing Gao","doi":"10.1109/HIS.2009.193","DOIUrl":"https://doi.org/10.1109/HIS.2009.193","url":null,"abstract":"The most popular routing algorithm in p2p network is that every node keeps a route table which records a certain number of other nodes. Such algorithm selects neighbor nodes at random, and this reduces routing efficiency. In this paper a new algorithm of optimizing p2p overlay network topology is proposed, which is based on minimum maximum k-means principle. According to the communication history, the division presents a steady network topology with k clusters and k cluster center nodes. This optimized p2p network topology presents a high performance of routing efficiency. The minimum maximum principle makes the division more appropriate, so that there will be less probability of being unsteady for the p2p network. The conclusions show that this algorithm is an efficient p2p network topology optimized algorithm.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"52 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115343948","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}
Zhang Haohua, Deng Yufu, Qi Weiyi, Feng Wenjiang, Zhang Liqing
The networks of interdependencies in large-scale software systems are complex, understand and measurement become a key problem for developer. we propose that OO design structure can be quantitative analyzed and better understood via Core-shell decomposition based on complex networks. The k-core analysis allows to characterize networks beyond the degree distribution and uncover structural hierarchies , centrality and evolution due to the specific architecture of the system. we analyze the Core-shell structure of some popular open source software and discuss the differences and similarities, get some noticeable properties, the result show the k-core analysis provides an interesting characterization helping to understand the underlying structure and improve development.
{"title":"Mining Topology Characteristics and Evolution of Large-Scale Software from Core-Shell Structure","authors":"Zhang Haohua, Deng Yufu, Qi Weiyi, Feng Wenjiang, Zhang Liqing","doi":"10.1109/HIS.2009.140","DOIUrl":"https://doi.org/10.1109/HIS.2009.140","url":null,"abstract":"The networks of interdependencies in large-scale software systems are complex, understand and measurement become a key problem for developer. we propose that OO design structure can be quantitative analyzed and better understood via Core-shell decomposition based on complex networks. The k-core analysis allows to characterize networks beyond the degree distribution and uncover structural hierarchies , centrality and evolution due to the specific architecture of the system. we analyze the Core-shell structure of some popular open source software and discuss the differences and similarities, get some noticeable properties, the result show the k-core analysis provides an interesting characterization helping to understand the underlying structure and improve development.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121311320","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, a general decision layer classificationfusion model, based on information fusion for improving classification precision, is proposed, that is, different multi -classification algorithms as the feature layer doing respective classification, and the results of classification algorithms are input into decision level, the last classification result is output.This model is applied into improving precision of text classification. And the model is used to the Computer Center of some department. Through the experiment, the text classification fusion model can improve the classification precision effectively
{"title":"Study on Decision Classification Fusion Model","authors":"Xiao-dan Zhang, Zhendong Niu","doi":"10.1109/HIS.2009.234","DOIUrl":"https://doi.org/10.1109/HIS.2009.234","url":null,"abstract":"In this paper, a general decision layer classificationfusion model, based on information fusion for improving classification precision, is proposed, that is, different multi -classification algorithms as the feature layer doing respective classification, and the results of classification algorithms are input into decision level, the last classification result is output.This model is applied into improving precision of text classification. And the model is used to the Computer Center of some department. Through the experiment, the text classification fusion model can improve the classification precision effectively","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125300553","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 proposed a new method of news summarization based on semantic similarity measure. It used Latent semantic indexing (LSI) to measure sentence similarity, then it used Singular Value Decomposition (SVD) to reduce the dimension of the word-sentence matrix, it used new clustering algorithm to cluster all the sentences. It ordered all the sentences according to their relevant positions in the original document. Experimental result shows that the proposed method can improve the performance of summary.
{"title":"News Summarization Based on Semantic Similarity Measure","authors":"Hui Yu","doi":"10.1109/HIS.2009.43","DOIUrl":"https://doi.org/10.1109/HIS.2009.43","url":null,"abstract":"This paper proposed a new method of news summarization based on semantic similarity measure. It used Latent semantic indexing (LSI) to measure sentence similarity, then it used Singular Value Decomposition (SVD) to reduce the dimension of the word-sentence matrix, it used new clustering algorithm to cluster all the sentences. It ordered all the sentences according to their relevant positions in the original document. Experimental result shows that the proposed method can improve the performance of summary.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125514262","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 distributed security MIPv6 model based on dynamic policies is presented to solve the security compatible problem between MIPv6 nodes and the access network. We combine the distributed defensive structure and MIPv6 to build a distributed secure MIPv6 structure based on policies, and implement the dynamic transference of secure policies during mobile nodes’ movement, thus to make the model has appreciable and self-adapting defensive capability against the change of network structure and enhance the security of access network as well as the mobile nodes’ availability.
{"title":"A Distributed Security MIPv6 Model Based on Dynamic Policies","authors":"Tianhan Gao, Nan Guo, Zhiliang Zhu","doi":"10.1109/HIS.2009.200","DOIUrl":"https://doi.org/10.1109/HIS.2009.200","url":null,"abstract":"A distributed security MIPv6 model based on dynamic policies is presented to solve the security compatible problem between MIPv6 nodes and the access network. We combine the distributed defensive structure and MIPv6 to build a distributed secure MIPv6 structure based on policies, and implement the dynamic transference of secure policies during mobile nodes’ movement, thus to make the model has appreciable and self-adapting defensive capability against the change of network structure and enhance the security of access network as well as the mobile nodes’ availability.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127018717","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}
Traditional collaborative filtering recommendation algorithms face the cold-start problem. A collaborative filtering recommendation algorithm based on the implicit information of the new users and multi-attribute rating matrix is proposed to solve the problem. The implicit information of the new users is collected as the first-hand interest information. It is combined with other rating information to create a User-Item Rating Matrix (UIRM). Singular Value Decomposition is used to reduce the dimensionality of the UIRM, resulting in the initial neighbor set for target users and a new user-item rating matrix. The user ratings are mapped to the relevant item attributes and the user attributes respectively to generate a User-Item Attribute Rating Matrix and a User Attribute-Item Attribute Rating Matrix (UAIARM). The attributes of new items and UAIARM are matched to find the N users with the highest match degrees as the target of the new items. The attributes of the new users are matched with UAIARM to find the N items with the highest match degrees as the recommended items. Experiment results validate the feasibility of the algorithm.
{"title":"A Cold-Start Recommendation Algorithm Based on New User's Implicit Information and Multi-attribute Rating Matrix","authors":"Hang Yin, G. Chang, Xingwei Wang","doi":"10.1109/HIS.2009.184","DOIUrl":"https://doi.org/10.1109/HIS.2009.184","url":null,"abstract":"Traditional collaborative filtering recommendation algorithms face the cold-start problem. A collaborative filtering recommendation algorithm based on the implicit information of the new users and multi-attribute rating matrix is proposed to solve the problem. The implicit information of the new users is collected as the first-hand interest information. It is combined with other rating information to create a User-Item Rating Matrix (UIRM). Singular Value Decomposition is used to reduce the dimensionality of the UIRM, resulting in the initial neighbor set for target users and a new user-item rating matrix. The user ratings are mapped to the relevant item attributes and the user attributes respectively to generate a User-Item Attribute Rating Matrix and a User Attribute-Item Attribute Rating Matrix (UAIARM). The attributes of new items and UAIARM are matched to find the N users with the highest match degrees as the target of the new items. The attributes of the new users are matched with UAIARM to find the N items with the highest match degrees as the recommended items. Experiment results validate the feasibility of the algorithm.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122483635","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}
Kai-Yi Chin, Jim-Min Lin, Zeng-Wei Hong, K. Lin, Wei-Tsong Lee
A number of researches have explored the effect of embodied pedagogical agents in multimedia learning environments. Embodied pedagogical agents have been regarded as practical and powerful tools for instructions in these researches. However, it is hard to find a development kits that support the instructor or teacher to create interactive learning applications together with animated pedagogical agents. Therefore, in order to facilitate the instructor or teacher to generate the content materials of digital learning, we proposed an IDML-based embodied pedagogical agent system(IDML-based EPAS). The system provides the opportunity for teachers to integrate their teaching contents into multimedia presentations and to create embodied pedagogical agents for attracting learners' attention. Moreover, learners can interact with digital learning materials for facilitating the knowledge acquirement. Finally, we utilized the instruction of traffic safety as the interactive learning materials in the IDML-based EPAS for assisting learners to gain more positive attitudes and better achievement.
{"title":"Developing an IDML-Based Embodied Pedagogical Agent System for Multimedia Learning","authors":"Kai-Yi Chin, Jim-Min Lin, Zeng-Wei Hong, K. Lin, Wei-Tsong Lee","doi":"10.1109/HIS.2009.15","DOIUrl":"https://doi.org/10.1109/HIS.2009.15","url":null,"abstract":"A number of researches have explored the effect of embodied pedagogical agents in multimedia learning environments. Embodied pedagogical agents have been regarded as practical and powerful tools for instructions in these researches. However, it is hard to find a development kits that support the instructor or teacher to create interactive learning applications together with animated pedagogical agents. Therefore, in order to facilitate the instructor or teacher to generate the content materials of digital learning, we proposed an IDML-based embodied pedagogical agent system(IDML-based EPAS). The system provides the opportunity for teachers to integrate their teaching contents into multimedia presentations and to create embodied pedagogical agents for attracting learners' attention. Moreover, learners can interact with digital learning materials for facilitating the knowledge acquirement. Finally, we utilized the instruction of traffic safety as the interactive learning materials in the IDML-based EPAS for assisting learners to gain more positive attitudes and better achievement.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114480943","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 heat source of waste heat power generation of cement plant is the waste heat gas of cement rotary kiln. Influenced by the impact of cement production, the control system is complex, so the existing control scheme cannot make the satisfactory effect. Based on a thorough analysis of the existing control scheme and the reference to manual operation experience of on-site skilled operator, the paper puts forward an improved fuzzy three impulses control scheme that comes from the drum level control of waste heat boiler. The scheme reflects the smoke temperature of the interference change in the heat source side and the exhaust fan’s rotational speed in the kiln inlet. According to the waste heat power generation technology and control characteristics, we design a set of advanced DCS with the redundancy controllers. The practice shows that the scheme has a satisfactory effect.
{"title":"The DCS of Waste Heat Power Generation of Cement Plant Based on Fuzzy Control","authors":"Shaoyun Wang, Qingjin Meng, Jingjian Wu","doi":"10.1109/HIS.2009.265","DOIUrl":"https://doi.org/10.1109/HIS.2009.265","url":null,"abstract":"The heat source of waste heat power generation of cement plant is the waste heat gas of cement rotary kiln. Influenced by the impact of cement production, the control system is complex, so the existing control scheme cannot make the satisfactory effect. Based on a thorough analysis of the existing control scheme and the reference to manual operation experience of on-site skilled operator, the paper puts forward an improved fuzzy three impulses control scheme that comes from the drum level control of waste heat boiler. The scheme reflects the smoke temperature of the interference change in the heat source side and the exhaust fan’s rotational speed in the kiln inlet. According to the waste heat power generation technology and control characteristics, we design a set of advanced DCS with the redundancy controllers. The practice shows that the scheme has a satisfactory effect.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129530924","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
扫码关注我们
求助内容：
应助结果提醒方式：