It is a complicated systemic work since the informatization is carried into Chinese construction enterprises for its huge investments,long periods and high risks. It is necessary to supervise them in order to reduce and disperse the project risks of construction enterprises’ informatization. The thesis puts forward several effective solutions after analyzing the necessities, status
{"title":"Current Status Analysis and Countermeasures on Supervising Informatization of Chinese Construction Enterprises","authors":"Lianbo Zhu, Lin Wang","doi":"10.1109/CSO.2010.45","DOIUrl":"https://doi.org/10.1109/CSO.2010.45","url":null,"abstract":"It is a complicated systemic work since the informatization is carried into Chinese construction enterprises for its huge investments,long periods and high risks. It is necessary to supervise them in order to reduce and disperse the project risks of construction enterprises’ informatization. The thesis puts forward several effective solutions after analyzing the necessities, status","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":"129278659","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}
As a dynamic development process, informationization involves a development process from immaturity to maturity and from imperfection to perfection. Constant improvement of the informationization process is a must to make the final achievement. This paper, which focuses on the extension and expansion of the content and measurement system of the Enterprise Informationization Capability Maturity Model (EICMM), discusses the measurement analysis from the dimensions of the development level, development quality, development capacity and suitability of enterprise informationization based on the hierarchical framework for the enterprise informationization maturity. This paper analyzes in detail the concrete concepts and contents of the EICMM, provides corresponding measurement paths, and helps enterprises identify the problems behind informationization construction to achieve the process and level upgrade of informationized enterprises.
{"title":"The Measurement Model for Enterprise Informationization Capability Maturity","authors":"Yiping Yang, Hui Ma, Li-da Dai, Eli Zhang","doi":"10.1109/CSO.2010.206","DOIUrl":"https://doi.org/10.1109/CSO.2010.206","url":null,"abstract":"As a dynamic development process, informationization involves a development process from immaturity to maturity and from imperfection to perfection. Constant improvement of the informationization process is a must to make the final achievement. This paper, which focuses on the extension and expansion of the content and measurement system of the Enterprise Informationization Capability Maturity Model (EICMM), discusses the measurement analysis from the dimensions of the development level, development quality, development capacity and suitability of enterprise informationization based on the hierarchical framework for the enterprise informationization maturity. This paper analyzes in detail the concrete concepts and contents of the EICMM, provides corresponding measurement paths, and helps enterprises identify the problems behind informationization construction to achieve the process and level upgrade of informationized enterprises.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"33 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":"130557447","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}
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}
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}
During the production of PET bottles, we must detect the roundness and flaws of the bottle mouth in order to prolong the guarantee period of the drink. After obtaining the images from the product line, we used both common and morphologic method to denoise. Then we extracted the region of interest by enhancing the contrast and binary. We scan from the horizontal and vertical direction to form a grid. And Scan from another two perpendicular axes to form a new grid. We located the centre of the bottle mouth and check whether it is round enough by these multi-direction grids. At last, we used radial scanning to detect the scratches. We calculated the points in each of the sweep intervals and recognized the scratches by choosing a reasonable threshold. Comparing to the core method and Hough Transform method [1], the method to locate the centre of the round is simpler and faster. And we can check the roundness and detect the flaws efficiently. In experiments, we can detect the scratch in size of 0.15mm which can meet the demand of the industrial production.
{"title":"A PET Bottle Mouth Detection Method Based on Morphologic","authors":"Z. Lv, Liqun Lin, Taisong Jin, Yuan Li","doi":"10.1109/CSO.2010.211","DOIUrl":"https://doi.org/10.1109/CSO.2010.211","url":null,"abstract":"During the production of PET bottles, we must detect the roundness and flaws of the bottle mouth in order to prolong the guarantee period of the drink. After obtaining the images from the product line, we used both common and morphologic method to denoise. Then we extracted the region of interest by enhancing the contrast and binary. We scan from the horizontal and vertical direction to form a grid. And Scan from another two perpendicular axes to form a new grid. We located the centre of the bottle mouth and check whether it is round enough by these multi-direction grids. At last, we used radial scanning to detect the scratches. We calculated the points in each of the sweep intervals and recognized the scratches by choosing a reasonable threshold. Comparing to the core method and Hough Transform method [1], the method to locate the centre of the round is simpler and faster. And we can check the roundness and detect the flaws efficiently. In experiments, we can detect the scratch in size of 0.15mm which can meet the demand of the industrial production.","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":"125898747","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}
Artificial Tribe Algorithm (ATA) is a novel intelligent optimization algorithm based on the simulation of bionic intelligent optimization algorithm. This work discusses the main factors which influence the performance of ATA, and compares the performance of ATA with that of genetic algorithm (GA), particle swarm optimization (PSO), and artificial fish-swarm algorithm (AFSA) for optimization multivariable functions. The simulation results showed that ATA outperforms the mentioned algorithms in global optimization problems.
{"title":"On the Analysis of Performance of the Artificial Tribe Algorithm","authors":"Tanggong Chen, Xiaowei Wei, Wenhui Jia, Zhi Liu","doi":"10.1109/CSO.2010.112","DOIUrl":"https://doi.org/10.1109/CSO.2010.112","url":null,"abstract":"Artificial Tribe Algorithm (ATA) is a novel intelligent optimization algorithm based on the simulation of bionic intelligent optimization algorithm. This work discusses the main factors which influence the performance of ATA, and compares the performance of ATA with that of genetic algorithm (GA), particle swarm optimization (PSO), and artificial fish-swarm algorithm (AFSA) for optimization multivariable functions. The simulation results showed that ATA outperforms the mentioned algorithms in global optimization problems.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"66 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":"114166349","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}
Matching pursuit algorithm extracting the time-frequency characteristics of signal has been applied in many fields. High computer complexity is a bottle-neck, especially in the high dimensions of the search space. In this paper, genetic algorithm and particle swarm optimization is used to solve this problem. Two decomposition methods named particle swarm optimization matching pursuit (PSO-MP) and genetic algorithm matching pursuit (GA-MP) are proposed for time-frequency analysis of frequency hopping signals. Experiment results proved the validity and feasibility of the approaches. Compared to GA-MP algorithm, PSO-MP algorithm could choose more precise atom parameters and has higher convergent speed as to the average process time.
{"title":"Adaptive Time-Frequency Parameterization of Frequency-Hopping Signals Based on Evolutionary Algorithm","authors":"Jiantao Guo","doi":"10.1109/CSO.2010.203","DOIUrl":"https://doi.org/10.1109/CSO.2010.203","url":null,"abstract":"Matching pursuit algorithm extracting the time-frequency characteristics of signal has been applied in many fields. High computer complexity is a bottle-neck, especially in the high dimensions of the search space. In this paper, genetic algorithm and particle swarm optimization is used to solve this problem. Two decomposition methods named particle swarm optimization matching pursuit (PSO-MP) and genetic algorithm matching pursuit (GA-MP) are proposed for time-frequency analysis of frequency hopping signals. Experiment results proved the validity and feasibility of the approaches. Compared to GA-MP algorithm, PSO-MP algorithm could choose more precise atom parameters and has higher convergent speed as to the average process time.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"58 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":"114495444","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 price some exotic options in the presence of transaction costs, the new type of reset option is considered. By incorporating the random stopping property of the American option, we propose some pricing theorems. The specific reset option pricing is within the framework of portfolio optimization problems. Utility functions are defined so as to derive the utility indifference prices for the reset option buyers. Detailed numerical procedures are proposed for computing reset option prices and the corresponding optimal trading strategies. We also elaborate on the practical procedures of implementing our numerical algorithms and some direction of the future work.
{"title":"Reset Put Option Pricing with Transaction Costs","authors":"J. Shen, Chuan Qin, Zhe Chen, Shenghong Li","doi":"10.1109/CSO.2010.153","DOIUrl":"https://doi.org/10.1109/CSO.2010.153","url":null,"abstract":"In order to price some exotic options in the presence of transaction costs, the new type of reset option is considered. By incorporating the random stopping property of the American option, we propose some pricing theorems. The specific reset option pricing is within the framework of portfolio optimization problems. Utility functions are defined so as to derive the utility indifference prices for the reset option buyers. Detailed numerical procedures are proposed for computing reset option prices and the corresponding optimal trading strategies. We also elaborate on the practical procedures of implementing our numerical algorithms and some direction of the future work.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"28 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":"122681415","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
扫码关注我们
求助内容：
应助结果提醒方式：