The traditional scheduling theory can only get the approximate optimal solution of the problem, and most is to consider algorithms on a single task or independent multitask scheduling. It presents a particle swarm algorithm to solve the task scheduling problem of computational grid. It builds a task scheduling model of computational grid, changes the particle swarm algorithm in continuous space searching to an integer space searching, selects the appropriate inertia weight value, and enhances the searching capabilities of the algorithm. Through comparison with genetic algorithm, hybrid algorithm, and ant algorithm, the results show that the grid task scheduling algorithm has some advantages.
{"title":"Task Scheduling of Computational Grid Based on Particle Swarm Algorithm","authors":"Hui Li, Lifeng Wang, Jianhong Liu","doi":"10.1109/CSO.2010.34","DOIUrl":"https://doi.org/10.1109/CSO.2010.34","url":null,"abstract":"The traditional scheduling theory can only get the approximate optimal solution of the problem, and most is to consider algorithms on a single task or independent multitask scheduling. It presents a particle swarm algorithm to solve the task scheduling problem of computational grid. It builds a task scheduling model of computational grid, changes the particle swarm algorithm in continuous space searching to an integer space searching, selects the appropriate inertia weight value, and enhances the searching capabilities of the algorithm. Through comparison with genetic algorithm, hybrid algorithm, and ant algorithm, the results show that the grid task scheduling algorithm has some advantages.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130776701","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 wireless sensor network provides neighbor discovery (ND) mechanism to build the dynamic route path. However, it makes attacks against easy: An adversary can simply replay or relay (wormhole) packets across the network and mislead disconnected nodes into believing that they communicate directly. Prior works on secure ND are to verify the neighbor is trustful. However, they either rely on specialized hardware or infrastructure, or offer limited security. In this paper, we announce a semantic architecture of secure agent verification model, which provides a challenge protocol against the classic 2-end wormhole attack. Also, the experiment results are discussed for the performance and accuracy.
{"title":"A Secure Virtual Verification Model for Wireless Sensor Network","authors":"Yang Li, Yingjie Xia, Guo-hua Zhan","doi":"10.1109/CSO.2010.78","DOIUrl":"https://doi.org/10.1109/CSO.2010.78","url":null,"abstract":"the wireless sensor network provides neighbor discovery (ND) mechanism to build the dynamic route path. However, it makes attacks against easy: An adversary can simply replay or relay (wormhole) packets across the network and mislead disconnected nodes into believing that they communicate directly. Prior works on secure ND are to verify the neighbor is trustful. However, they either rely on specialized hardware or infrastructure, or offer limited security. In this paper, we announce a semantic architecture of secure agent verification model, which provides a challenge protocol against the classic 2-end wormhole attack. Also, the experiment results are discussed for the performance and accuracy.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131347865","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}
Many optimal fuzzy random decision making problems often involve fuzzy random inequalities in the constraints, which makes the process of optimization’s solution more complicatedly. How to transform fuzzy random inequalities to the simple equivalents, will be of great significance for simplifying the solution process. Based on the credibility measure, we discuss the problem that fuzzy random inequalities are converted into deterministic ones under the certain level of satisfaction measure. In the meantime, we give the chance measure’s expressive formula of deterministic equivalents when the random variable is normally distributes.
{"title":"The Simple Deterministic Equivalents of Fuzzy Random Inequality Based on Chance Measure","authors":"Hui Wang, Hong-tao Zhang, Zhixiang Yin","doi":"10.1109/CSO.2010.224","DOIUrl":"https://doi.org/10.1109/CSO.2010.224","url":null,"abstract":"Many optimal fuzzy random decision making problems often involve fuzzy random inequalities in the constraints, which makes the process of optimization’s solution more complicatedly. How to transform fuzzy random inequalities to the simple equivalents, will be of great significance for simplifying the solution process. Based on the credibility measure, we discuss the problem that fuzzy random inequalities are converted into deterministic ones under the certain level of satisfaction measure. In the meantime, we give the chance measure’s expressive formula of deterministic equivalents when the random variable is normally distributes.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131349583","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}
Aiming in the data interoperation such as access and sharing of heterogeneous spatial data in distributed system, grid technology was brought into spatial information service, and a complete architecture of spatial data interoperability in Grid environment was proposed. We analyzed and designed spatial data management, access and interoperability in the architecture, and offered possible ways for spatial data user to share, analyze and process the distributed data resources. In the end, a prototype system is built based on Globus Toolkit and OGSA-DAI, proving the architecture and methods brought up above are practical.
{"title":"Research on Spatial Data Interoperability in Spatial DATA Grid Environment","authors":"Qidong Yin, Qi Li, Xi Wu","doi":"10.1109/CSO.2010.243","DOIUrl":"https://doi.org/10.1109/CSO.2010.243","url":null,"abstract":"Aiming in the data interoperation such as access and sharing of heterogeneous spatial data in distributed system, grid technology was brought into spatial information service, and a complete architecture of spatial data interoperability in Grid environment was proposed. We analyzed and designed spatial data management, access and interoperability in the architecture, and offered possible ways for spatial data user to share, analyze and process the distributed data resources. In the end, a prototype system is built based on Globus Toolkit and OGSA-DAI, proving the architecture and methods brought up above are practical.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121896276","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 develop an option valuation model in the context of a discrete-time multivariate Markov chain model using the Esscher transform. The multivariate Markov chain provides a flexible way to incorporate the dependency of the underlying asset price processes and price multi-state options written on several dependent underlying assets. In our model, the price of an individual asset can take finitely many values. The market described by our model is incomplete in general, hence there are more than one equivalent martingale pricing measures. We adopt conditional Esscher transform to determine an equivalent martingale measure for option valuation. We also document consequences for option prices of the dependency of the underlying asset prices described by the multivariate Markov chain model.
{"title":"Option Valuation under a Multivariate Markov Chain Model","authors":"Na Song, W. Ching, T. Siu, E. Fung, M. Ng","doi":"10.1109/CSO.2010.73","DOIUrl":"https://doi.org/10.1109/CSO.2010.73","url":null,"abstract":"In this paper, we develop an option valuation model in the context of a discrete-time multivariate Markov chain model using the Esscher transform. The multivariate Markov chain provides a flexible way to incorporate the dependency of the underlying asset price processes and price multi-state options written on several dependent underlying assets. In our model, the price of an individual asset can take finitely many values. The market described by our model is incomplete in general, hence there are more than one equivalent martingale pricing measures. We adopt conditional Esscher transform to determine an equivalent martingale measure for option valuation. We also document consequences for option prices of the dependency of the underlying asset prices described by the multivariate Markov chain model.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116506484","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}
For the mechanical properties of reinforced concrete under high temperature with large deterioration, the reliability of reinforced concrete beams have been largely discounted. The plastic zone resistance of concrete under high temperature has been considered in this paper. A simple and feasible time-variant model of the resistance of reinforced concrete beams has been given under fire and a reliability index analysis method of reinforced concrete beams under fire. The action of ISO834 temperature rising curve on the reliability index of different specifications of concrete beams at different time has been analyzed. The action of main parameters on the reliability index changes with time has been shown. The results have shown that the increase the reinforcement ratio and concrete cover thickness appropriately is an effective measure to improve the fire resistance limit of reinforced concrete beams.
{"title":"The Reliability Analysis of Reinforced Concrete Beams under High Temperature","authors":"Zhenqing Wang, M. Qiao, Dalei Zhu, Y. Han","doi":"10.1109/CSO.2010.24","DOIUrl":"https://doi.org/10.1109/CSO.2010.24","url":null,"abstract":"For the mechanical properties of reinforced concrete under high temperature with large deterioration, the reliability of reinforced concrete beams have been largely discounted. The plastic zone resistance of concrete under high temperature has been considered in this paper. A simple and feasible time-variant model of the resistance of reinforced concrete beams has been given under fire and a reliability index analysis method of reinforced concrete beams under fire. The action of ISO834 temperature rising curve on the reliability index of different specifications of concrete beams at different time has been analyzed. The action of main parameters on the reliability index changes with time has been shown. The results have shown that the increase the reinforcement ratio and concrete cover thickness appropriately is an effective measure to improve the fire resistance limit of reinforced concrete beams.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121503659","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 Bayesian knowledge reasoning network based on CBR is introduced, and a hybrid recommendation algorithm integrated CBR with Bayesian network is proposed, which can be applied to ITS. The hybrid algorithm filters the candidates case using CBR, calculates the similarity between students’ characters terminology and learning resources as well as the similarity between students’ characters terminology and teaching methods by the collaborative filtering technology based on users’ score, and then calculates the posterior probabilities between the users and the users’ characters by Bayesian probability calculation formula and Bayesian knowledge reasoning network, extracts the appropriate learning resources and teaching methods from the existing learning resources pool and teaching methods base, then recommends them to the students. Thus, the intelligent recommendation function of ITS is achieved. Empirical results show that the search space is reduced and the search efficiency is also improved.
{"title":"Application of Bayesian Network Knowledge Reasoning Based on CBR in ITS","authors":"Jihong Ding, Huazhong Liu, Anyuan Deng","doi":"10.1109/CSO.2010.113","DOIUrl":"https://doi.org/10.1109/CSO.2010.113","url":null,"abstract":"In this paper, a Bayesian knowledge reasoning network based on CBR is introduced, and a hybrid recommendation algorithm integrated CBR with Bayesian network is proposed, which can be applied to ITS. The hybrid algorithm filters the candidates case using CBR, calculates the similarity between students’ characters terminology and learning resources as well as the similarity between students’ characters terminology and teaching methods by the collaborative filtering technology based on users’ score, and then calculates the posterior probabilities between the users and the users’ characters by Bayesian probability calculation formula and Bayesian knowledge reasoning network, extracts the appropriate learning resources and teaching methods from the existing learning resources pool and teaching methods base, then recommends them to the students. Thus, the intelligent recommendation function of ITS is achieved. Empirical results show that the search space is reduced and the search efficiency is also improved.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129010949","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}
We propose particle swarm optimization (PSO) algorithm for solving transport continuous network design problems (CNDP), and give sensitivity analysis for the parameters used in PSO. The CNDP is formulated as a bi-level programming model. The sensitivity analysis method, one-at-a-time designs (OATD), is used to analyze the effects of parameters. Numerical example demonstrates that PSO is an effective algorithm for solving CNDP with proper parameters setting. The choice of swarm size has a clear effect to the implementation time and with small swarm size may fail to the optimal solution. Furthermore, inertia weight and maximum velocity has clear effects to the solution searching.
{"title":"Particle Swarm Optimization Algorithm in Transport Continuous Network Design Problems","authors":"Meng Xu, Jin Yang, Ziyou Gao","doi":"10.1109/CSO.2010.53","DOIUrl":"https://doi.org/10.1109/CSO.2010.53","url":null,"abstract":"We propose particle swarm optimization (PSO) algorithm for solving transport continuous network design problems (CNDP), and give sensitivity analysis for the parameters used in PSO. The CNDP is formulated as a bi-level programming model. The sensitivity analysis method, one-at-a-time designs (OATD), is used to analyze the effects of parameters. Numerical example demonstrates that PSO is an effective algorithm for solving CNDP with proper parameters setting. The choice of swarm size has a clear effect to the implementation time and with small swarm size may fail to the optimal solution. Furthermore, inertia weight and maximum velocity has clear effects to the solution searching.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126991716","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 order to increase the computing efficiency of the structural fatigue life in optimization cycles, the metamodels of the structural fatigue life are researched systematically. Three kinds of metamodels, the polynomial response surface model, the Kriging model and the radial basis function model constructed by the central composition design and the Latin hypercube design were compared. It is found that the radial basis function model constructed by the Latin hypercube has the highest fitting precision and higher fitting efficiency. As an example, the forward strut of an aircraft’s nose gear is optimized by using the radial basis functions of the fatigue life. The research results offer a guidance for selection and construction of the metamodel of the structural fatigue life.
{"title":"Structural Fatigue Life Optimization Based on Metamodels","authors":"Y. Deng, Caijun Xue, Yuan Xu","doi":"10.1109/CSO.2010.42","DOIUrl":"https://doi.org/10.1109/CSO.2010.42","url":null,"abstract":"In order to increase the computing efficiency of the structural fatigue life in optimization cycles, the metamodels of the structural fatigue life are researched systematically. Three kinds of metamodels, the polynomial response surface model, the Kriging model and the radial basis function model constructed by the central composition design and the Latin hypercube design were compared. It is found that the radial basis function model constructed by the Latin hypercube has the highest fitting precision and higher fitting efficiency. As an example, the forward strut of an aircraft’s nose gear is optimized by using the radial basis functions of the fatigue life. The research results offer a guidance for selection and construction of the metamodel of the structural fatigue life.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131016267","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}
Sequential systems of linear equations methods(SSLE) are proposed mainly to solve the inconsistency and computation problems existed in the classical SQP method. In this paper, a new algorithm for inequality constrained optimization problems is presented. The attractive feature of the new algorithm is that only one system of linear equations is required to obtain the revised feasible descent direction. In order to void the Maratos effect, combined the generalized projection technique, a height-order correction direction is computed by an explicit formula, and it plays a important role in avoiding the strict complementarity. Furthermore, its global and superlinear convergence rate are obtained under some suitable conditions.
{"title":"A Modified Feasible SSLE Algorithm for Nonlinearly Constrained Optimization","authors":"Zhijun Luo, Guohua Chen, Zhibin Zhu","doi":"10.1109/CSO.2010.182","DOIUrl":"https://doi.org/10.1109/CSO.2010.182","url":null,"abstract":"Sequential systems of linear equations methods(SSLE) are proposed mainly to solve the inconsistency and computation problems existed in the classical SQP method. In this paper, a new algorithm for inequality constrained optimization problems is presented. The attractive feature of the new algorithm is that only one system of linear equations is required to obtain the revised feasible descent direction. In order to void the Maratos effect, combined the generalized projection technique, a height-order correction direction is computed by an explicit formula, and it plays a important role in avoiding the strict complementarity. Furthermore, its global and superlinear convergence rate are obtained under some suitable conditions.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128389623","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
扫码关注我们
求助内容：
应助结果提醒方式：