Pub Date : 2012-10-04DOI: 10.1109/URKE.2012.6319527
Cai Ying-fang, Qiu Wanghua
The purpose of this paper is to improve retrieval efficiency to muli-attribute instance knowledge. The paper expressed multi-attribute instance knowledge as a model with multi-attribute and tree structure, which synthetically apply similarity calculation method of value type attribute and of imprecise value type attribute and of word type attribute, which optimized step of calculation and order of calculation, and improved retrieval efficiency.
{"title":"Research on retrieval of multi- attribute instance knowledge based on ontology","authors":"Cai Ying-fang, Qiu Wanghua","doi":"10.1109/URKE.2012.6319527","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319527","url":null,"abstract":"The purpose of this paper is to improve retrieval efficiency to muli-attribute instance knowledge. The paper expressed multi-attribute instance knowledge as a model with multi-attribute and tree structure, which synthetically apply similarity calculation method of value type attribute and of imprecise value type attribute and of word type attribute, which optimized step of calculation and order of calculation, and improved retrieval efficiency.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131491639","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}
Pub Date : 2012-10-04DOI: 10.1109/URKE.2012.6319529
J. Suzuki
We consider estimation of Bayesian network structures given a finite number of examples when both discrete and continuous random variables are present in a Bayesian network.
在给定有限数量的贝叶斯网络中同时存在离散和连续随机变量的情况下，研究贝叶斯网络结构的估计问题。
{"title":"Bayesian network structure learning for discrete and continuous variables","authors":"J. Suzuki","doi":"10.1109/URKE.2012.6319529","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319529","url":null,"abstract":"We consider estimation of Bayesian network structures given a finite number of examples when both discrete and continuous random variables are present in a Bayesian network.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"2 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114396247","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}
Pub Date : 2012-10-04DOI: 10.1109/URKE.2012.6319547
Xiangli Wang, La-yuan Li
For the energy consumption problem of wireless sensor networks, a mobile agent routing based on improved genetic algorithm (MARIGA) is proposed in this paper. This algorithm introduces a new crossover strategy and mutation operator to effectively control the premature stagnation in the convergence process. The simulation results indicate that the MARIGA algorithm can effectively improve the routing quality of mobile agent and the energy consumption of network.
{"title":"A mobile agent routing algorithm based on improved genetic algorithm for wireless sensor networks","authors":"Xiangli Wang, La-yuan Li","doi":"10.1109/URKE.2012.6319547","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319547","url":null,"abstract":"For the energy consumption problem of wireless sensor networks, a mobile agent routing based on improved genetic algorithm (MARIGA) is proposed in this paper. This algorithm introduces a new crossover strategy and mutation operator to effectively control the premature stagnation in the convergence process. The simulation results indicate that the MARIGA algorithm can effectively improve the routing quality of mobile agent and the energy consumption of network.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127195044","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}
Pub Date : 2012-10-04DOI: 10.1109/URKE.2012.6319556
Guoqi Li, Si-jing Liu
The multi-layer urban logistics facilities location is not only influenced by service radius, but also be readily influenced by the capacity of the facilities and the relationship of different demand points. Therefore, considering the constraints of capacity and correlation, the multi-level urban logistics infrastructures location model with constraints of capacity and correlation is developed based on some modifications and extension for the classical model with constraints of service radius. The solving strategy including genetic algorithm (GA) and Partical Swarm Optimization (PSO) is proposed to obtain the location-distribution solutions. Finally, a numerical research is done, and the results are compared with the situation of classical model with constraints of service radius which show the effectiveness of the proposed method and explain the stability and dynamics of multi-layer urban logistics facilities location, these provide theory support of logistics location for decision makers.
{"title":"A location model for multi-layer urban logistics facility with the constraints of capacity and correlation","authors":"Guoqi Li, Si-jing Liu","doi":"10.1109/URKE.2012.6319556","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319556","url":null,"abstract":"The multi-layer urban logistics facilities location is not only influenced by service radius, but also be readily influenced by the capacity of the facilities and the relationship of different demand points. Therefore, considering the constraints of capacity and correlation, the multi-level urban logistics infrastructures location model with constraints of capacity and correlation is developed based on some modifications and extension for the classical model with constraints of service radius. The solving strategy including genetic algorithm (GA) and Partical Swarm Optimization (PSO) is proposed to obtain the location-distribution solutions. Finally, a numerical research is done, and the results are compared with the situation of classical model with constraints of service radius which show the effectiveness of the proposed method and explain the stability and dynamics of multi-layer urban logistics facilities location, these provide theory support of logistics location for decision makers.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126348653","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}
Pub Date : 2012-10-04DOI: 10.1109/URKE.2012.6319565
Qi Bo, Diao Aixia
In order to control the traffic network reasonably, the multi-objective programming model is established, which takes the maximum capacity of the traffic network and the minimum construction funds as objectives, and takes the prospect traffic demand, the efficiency and the road occupancy ratio as restraints. Then, the effective solution method is put forward. Finally, an example is studied and the study results show the model and the algorithm for the traffic network are feasible. The active management and control method may carry on the reasonable control to the urban traffic network, and effectively avoid a series of traffic problems caused by the unreasonable traffic network structure.
{"title":"Active management and control method for traffic network","authors":"Qi Bo, Diao Aixia","doi":"10.1109/URKE.2012.6319565","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319565","url":null,"abstract":"In order to control the traffic network reasonably, the multi-objective programming model is established, which takes the maximum capacity of the traffic network and the minimum construction funds as objectives, and takes the prospect traffic demand, the efficiency and the road occupancy ratio as restraints. Then, the effective solution method is put forward. Finally, an example is studied and the study results show the model and the algorithm for the traffic network are feasible. The active management and control method may carry on the reasonable control to the urban traffic network, and effectively avoid a series of traffic problems caused by the unreasonable traffic network structure.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"316 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131211145","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}
Pub Date : 2012-10-04DOI: 10.1109/URKE.2012.6319541
Jingyu Yang, Guo-ping Chen
Optimal design of the orientations and locations of collocated piezoelectric actuators/sensors pairs for a plate-like structure under bending load uncertainty are determined with the objective of minimizing the deformation and electrical input under any sort of loading. The bending moments generated by the piezoelectric actuator actuators are used for deformation control, i.e., to minimize the deformation. The plate-like structure is subjected to an arbitrary load which lies in an uncertainty domain with regard to its magnitude and direction. The uncertain loading studied in the present paper involves a load of unknown magnitude and direction, which should be determined to produce the arbitrary deformation. Two optimization variables are considered for each piezoelectric actuator/sensor device: the location of its center and its orientation. An optimal control algorithm and three types of artificial intelligence algorithms (PSOOOL algorithm-particle swarm optimization algorithm for optimization of orientations and locations of actuators; SAOOL algorithm-Simulated Annealing algorithm for optimization of orientations and locations of actuators; EMOOL algorithm-Electromagnetism-like Method for optimization of orientations and locations of actuators; optimal control algorithm) are presented for the determination of the orientation and location of piezoelectric actuators/sensors in the application to shape control of plate-like structures. Numerical results show that simultaneous optimization of both orientations and locations can lead to optimum configurations that consume less electrical energy and minimizing the deflection. SAOOL algorithm can handle the optimization of orientations and locations of actuators/sensors better than PSOOOL algorithm and EMOOL algorithm. The different algorithms exhibit similar performance. However, exhaustive EMOOL algorithm and PSOOOL algorithm require significantly higher computational effort.
{"title":"Simultaneous optimization of orientations and locations of actuators and sensors for morphing structural shapes","authors":"Jingyu Yang, Guo-ping Chen","doi":"10.1109/URKE.2012.6319541","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319541","url":null,"abstract":"Optimal design of the orientations and locations of collocated piezoelectric actuators/sensors pairs for a plate-like structure under bending load uncertainty are determined with the objective of minimizing the deformation and electrical input under any sort of loading. The bending moments generated by the piezoelectric actuator actuators are used for deformation control, i.e., to minimize the deformation. The plate-like structure is subjected to an arbitrary load which lies in an uncertainty domain with regard to its magnitude and direction. The uncertain loading studied in the present paper involves a load of unknown magnitude and direction, which should be determined to produce the arbitrary deformation. Two optimization variables are considered for each piezoelectric actuator/sensor device: the location of its center and its orientation. An optimal control algorithm and three types of artificial intelligence algorithms (PSOOOL algorithm-particle swarm optimization algorithm for optimization of orientations and locations of actuators; SAOOL algorithm-Simulated Annealing algorithm for optimization of orientations and locations of actuators; EMOOL algorithm-Electromagnetism-like Method for optimization of orientations and locations of actuators; optimal control algorithm) are presented for the determination of the orientation and location of piezoelectric actuators/sensors in the application to shape control of plate-like structures. Numerical results show that simultaneous optimization of both orientations and locations can lead to optimum configurations that consume less electrical energy and minimizing the deflection. SAOOL algorithm can handle the optimization of orientations and locations of actuators/sensors better than PSOOOL algorithm and EMOOL algorithm. The different algorithms exhibit similar performance. However, exhaustive EMOOL algorithm and PSOOOL algorithm require significantly higher computational effort.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131237879","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}
Pub Date : 2012-10-04DOI: 10.1109/URKE.2012.6319569
Yining Xia, Li Zuhua
Molodtsov introduced the theory of soft sets, which can be seen as a new mathematical approach to vagueness. In this paper, we first recall several operations on soft sets introduced by Maji et al. in a previous paper. Furthermore, we give some new operations such as the product, the anty-product of two soft sets, the inverse, the image and the preimage of a soft set. Moreover, we obtain the basic properties of the various operations of soft sets.
{"title":"Some new operations of soft sets","authors":"Yining Xia, Li Zuhua","doi":"10.1109/URKE.2012.6319569","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319569","url":null,"abstract":"Molodtsov introduced the theory of soft sets, which can be seen as a new mathematical approach to vagueness. In this paper, we first recall several operations on soft sets introduced by Maji et al. in a previous paper. Furthermore, we give some new operations such as the product, the anty-product of two soft sets, the inverse, the image and the preimage of a soft set. Moreover, we obtain the basic properties of the various operations of soft sets.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115265877","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}
Pub Date : 2012-10-04DOI: 10.1109/URKE.2012.6319531
T. Hashimoto, Y. Shirota
The paper describes our web publication of visual teaching materials for business mathematics. The objective of the web site is to familiarize students with our visual approach for business mathematics at early stage. The significant advantage of visualization is that seeing the materials leads to better understanding of the mathematical process. Even if the students cannot understand the algebraic calculation process, they can intuitively understand the essence, only seeing the visual materials. The feature of our developed teaching materials is utilization of three-dimensional graphics and its animations. Just watching the animation, students can see the points, even if they have no idea about operations on the web. In the paper, we will illustrate the typical economics problem named the Marshallian demand function.
{"title":"Web publication of visual teaching materials for business mathematics","authors":"T. Hashimoto, Y. Shirota","doi":"10.1109/URKE.2012.6319531","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319531","url":null,"abstract":"The paper describes our web publication of visual teaching materials for business mathematics. The objective of the web site is to familiarize students with our visual approach for business mathematics at early stage. The significant advantage of visualization is that seeing the materials leads to better understanding of the mathematical process. Even if the students cannot understand the algebraic calculation process, they can intuitively understand the essence, only seeing the visual materials. The feature of our developed teaching materials is utilization of three-dimensional graphics and its animations. Just watching the animation, students can see the points, even if they have no idea about operations on the web. In the paper, we will illustrate the typical economics problem named the Marshallian demand function.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131563371","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}
According to “Software processes are software too” proposed by L.Osterweil, we define a software process model with independent functions as a component. This paper focused on the area of component retrieval during the course of a software evolution process which is defined by model of ESDDM. When component retrieving happens, generally a number of similar components are returned as a result set form the component library. This paper propose a comprehensive evaluation algorithm based on fuzzy theories to assess each component in the result set for the purpose of choosing out the most appropriate ones from the component library.
{"title":"An evaluation algorithm of component retrieval based on fuzzy theories","authors":"Na Zhao, Jian Wang, Yong Yu, Fei Dai, Zhongwen Xie, Jianglong Qin","doi":"10.1109/URKE.2012.6319549","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319549","url":null,"abstract":"According to “Software processes are software too” proposed by L.Osterweil, we define a software process model with independent functions as a component. This paper focused on the area of component retrieval during the course of a software evolution process which is defined by model of ESDDM. When component retrieving happens, generally a number of similar components are returned as a result set form the component library. This paper propose a comprehensive evaluation algorithm based on fuzzy theories to assess each component in the result set for the purpose of choosing out the most appropriate ones from the component library.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132606224","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}
Pub Date : 2012-10-04DOI: 10.1109/URKE.2012.6319593
Ashutosh Kumar Singh, K. P. Ravi, A. G. K. Leng
Continuous growth of hanging pages with Web makes a significant problem for ranking in the information retrieval. Exclusion of these pages in ranking calculation can give biased/inconsistent result. On the other hand inclusion of these pages will reduce the speed significantly. However most of the IR ranking algorithms exclude the hanging pages. But there are relevant and important hanging pages on the Web and they cannot be ignored because of the complexity in computation and time. In our proposed method, we include the relevant hanging pages in the ranking. Relevancy or non-relevancy of hanging pages is achieved by application of Genetic Algorithm (GA).
{"title":"Solving hanging relevancy using genetic algorithm","authors":"Ashutosh Kumar Singh, K. P. Ravi, A. G. K. Leng","doi":"10.1109/URKE.2012.6319593","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319593","url":null,"abstract":"Continuous growth of hanging pages with Web makes a significant problem for ranking in the information retrieval. Exclusion of these pages in ranking calculation can give biased/inconsistent result. On the other hand inclusion of these pages will reduce the speed significantly. However most of the IR ranking algorithms exclude the hanging pages. But there are relevant and important hanging pages on the Web and they cannot be ignored because of the complexity in computation and time. In our proposed method, we include the relevant hanging pages in the ranking. Relevancy or non-relevancy of hanging pages is achieved by application of Genetic Algorithm (GA).","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126697249","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
扫码关注我们
求助内容：
应助结果提醒方式：