Software development cost estimation is an indispensable component of software development process, accurate assessment of development cost is an important guarantee for the success project. However, there are many insufficient in current assessment methods. This paper analyses software development cost estimation methods, and makes full use of COCOMO2 Function Point Analysis method and COCOMO2 with Fuzzy Delphi method to put developments and applications of a decision support system for software project cost estimation forward. Experimental application implies that the system is viable, result of development cost estimation is accuracy, and can effectively support the analysis of development cost.
{"title":"Development of the Decision Support System for Software Project Cost Estimation","authors":"Q. Chen, Shuojin Fang, W. Wang","doi":"10.1109/WCSE.2009.269","DOIUrl":"https://doi.org/10.1109/WCSE.2009.269","url":null,"abstract":"Software development cost estimation is an indispensable component of software development process, accurate assessment of development cost is an important guarantee for the success project. However, there are many insufficient in current assessment methods. This paper analyses software development cost estimation methods, and makes full use of COCOMO2 Function Point Analysis method and COCOMO2 with Fuzzy Delphi method to put developments and applications of a decision support system for software project cost estimation forward. Experimental application implies that the system is viable, result of development cost estimation is accuracy, and can effectively support the analysis of development cost.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128732465","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}
To dynamically integrate the complex enterprise software system on the internet, construct autonomous, dynamic evolved, large granularity software entity is recent trend. With formal method, this article further analyzes the dynamic characters of the enterprise intelligence component model. A dynamic formal model is established, which provides new approach for large granularity software component.
{"title":"Dynamic Modeling of Enterprise Intelligent Component","authors":"R. Fan, Xiaohui Liu","doi":"10.1109/WCSE.2009.146","DOIUrl":"https://doi.org/10.1109/WCSE.2009.146","url":null,"abstract":"To dynamically integrate the complex enterprise software system on the internet, construct autonomous, dynamic evolved, large granularity software entity is recent trend. With formal method, this article further analyzes the dynamic characters of the enterprise intelligence component model. A dynamic formal model is established, which provides new approach for large granularity software component.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129306068","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 solve the problem of information sharing, updating, maintaining and interacting of agricultural land grading of the test area in Hubei Province, China , we discuss the innovative software solutions based on the Asp.Net technique and ArcIMS platform in this paper. Consequently, this paper focuses on the design and implementation of Information Publication System of Agricultural Land Grading (IPS-ALG). This application utilizes ArcIMS server to deliver a spatially enabled Internet solution for the tracking and management of land grading, facilitating access to up-to-date spatial data and map service for the end-users and providing decision support for the regional government.
{"title":"Design and Research of Agricultural Land Grading Information Publishing System Based on .NET and ArcIMS","authors":"Guangmin Li, Wu Dong, Yong Zhou","doi":"10.1109/WCSE.2009.56","DOIUrl":"https://doi.org/10.1109/WCSE.2009.56","url":null,"abstract":"In order to solve the problem of information sharing, updating, maintaining and interacting of agricultural land grading of the test area in Hubei Province, China , we discuss the innovative software solutions based on the Asp.Net technique and ArcIMS platform in this paper. Consequently, this paper focuses on the design and implementation of Information Publication System of Agricultural Land Grading (IPS-ALG). This application utilizes ArcIMS server to deliver a spatially enabled Internet solution for the tracking and management of land grading, facilitating access to up-to-date spatial data and map service for the end-users and providing decision support for the regional government.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129339755","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}
Influencing factors on task group choosing in dynamic environment of multiple tasks were analyzed. A random descriptive model of robot behavior in task group choosing was proposed and experimentally validated. In establishment of the model, the time evolving rule in task group selection and the influence of dynamic task information on the evolving rule have been studied from general point of view, so the proposed model could not only qualitatively but also quantitatively monitor and forecast the behavior of individual robot and the dynamic evolving process of robot system.
{"title":"An Analytical Model of Robot Behavior in Choosing Task Group","authors":"L. Shuqin, Y. Xiaohua","doi":"10.1109/WCSE.2009.154","DOIUrl":"https://doi.org/10.1109/WCSE.2009.154","url":null,"abstract":"Influencing factors on task group choosing in dynamic environment of multiple tasks were analyzed. A random descriptive model of robot behavior in task group choosing was proposed and experimentally validated. In establishment of the model, the time evolving rule in task group selection and the influence of dynamic task information on the evolving rule have been studied from general point of view, so the proposed model could not only qualitatively but also quantitatively monitor and forecast the behavior of individual robot and the dynamic evolving process of robot system.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129909115","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}
Yuyan Jiang, Quanhang Chen, Gouzheng Xing, Jie Li, Xiaoyan Pi
Use clustering methods to discover the individual consumer’s most adaptive products, which can support to make better decisions of marketing service. First, oriented from the consumer’s transactional data that we will mine and targeted by finding some consumer’s most adaptive products, we present a simple and efficient cluster algorithm to put the most similar data into the same group. Then we can find the mined consumer’s most adaptive products from the cluster. Moreover, we propose a Boolean algorithm to improve the performance of the previous.
{"title":"Efficient Clustering Algorithm of Mining Consumers' Most Adaptive Products","authors":"Yuyan Jiang, Quanhang Chen, Gouzheng Xing, Jie Li, Xiaoyan Pi","doi":"10.1109/WCSE.2009.353","DOIUrl":"https://doi.org/10.1109/WCSE.2009.353","url":null,"abstract":"Use clustering methods to discover the individual consumer’s most adaptive products, which can support to make better decisions of marketing service. First, oriented from the consumer’s transactional data that we will mine and targeted by finding some consumer’s most adaptive products, we present a simple and efficient cluster algorithm to put the most similar data into the same group. Then we can find the mined consumer’s most adaptive products from the cluster. Moreover, we propose a Boolean algorithm to improve the performance of the previous.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130675609","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}
With the development of Service Oriented Architecture (SOA), Web services have been adopted as the system integration solution by more and more enterprises. The greatest value that SOA brings to these enterprises is increased business agility. Thus, it is a key issue of successful SOA solutions to provide a dynamic Web service composition approach to facilitate business innovation and adapt IT to today’s fast changing markets. In this paper, we propose a model-driven approach for dynamic Web service composition. First, we define two UML models to modeling Web services and business processes, as well as describing the semantics of Web service functionalities and business process requirements. Then, we generate Web service and business process implementations from these two models automatically by following our predefined mapping patterns and transformation rules. Finally, by performing ontology-based semantic matchmaking, the qualified web services can be dynamically selected and bound into the business processes. A prototype system has been developed and is also delivered to demonstrate the effectiveness of our approach.
{"title":"A Model-Driven Approach for Dynamic Web Service Composition","authors":"Chenting Zhao, Zhenhua Duan, Man Zhang","doi":"10.1109/WCSE.2009.394","DOIUrl":"https://doi.org/10.1109/WCSE.2009.394","url":null,"abstract":"With the development of Service Oriented Architecture (SOA), Web services have been adopted as the system integration solution by more and more enterprises. The greatest value that SOA brings to these enterprises is increased business agility. Thus, it is a key issue of successful SOA solutions to provide a dynamic Web service composition approach to facilitate business innovation and adapt IT to today’s fast changing markets. In this paper, we propose a model-driven approach for dynamic Web service composition. First, we define two UML models to modeling Web services and business processes, as well as describing the semantics of Web service functionalities and business process requirements. Then, we generate Web service and business process implementations from these two models automatically by following our predefined mapping patterns and transformation rules. Finally, by performing ontology-based semantic matchmaking, the qualified web services can be dynamically selected and bound into the business processes. A prototype system has been developed and is also delivered to demonstrate the effectiveness of our approach.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123903000","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}
Failure probability calculation is what the large dam risk evaluation is based on. The computer simulation method can solve the difficulty in linearizing the state function, normalizing the nonnormal random variable equivalent and transforming the relevant random variables during the calculation of dam failure probability by means of First Order Second Moment method . On the basis of the analysis of the major dam failure modes, a probe is made into the computer simulation method and its procedures for direct calculation of the failure probability; while considering the dam shear-slipping collapse mode, a study is made of the state function and the distribution regularities of the random variables under this mode and the formula is deduced out for generating the random numbers for random variables of Pierson III Distribution, Extreme-value I Distribution and Logarithmic Normal Distribution; by programming, repeated simulations are conducted to the dam shear-slipping failure mode and through statistics and analysis of the results of the simulation, the mean value, the standard deviation and a 95% confidence interval of the shear-slipping failure probability are obtained.
{"title":"Computer Analog Computation of Large Dam Shear-Slipping Failure Probability","authors":"Chen Zaitie, S. Hui, Wu Zufu","doi":"10.1109/WCSE.2009.400","DOIUrl":"https://doi.org/10.1109/WCSE.2009.400","url":null,"abstract":"Failure probability calculation is what the large dam risk evaluation is based on. The computer simulation method can solve the difficulty in linearizing the state function, normalizing the nonnormal random variable equivalent and transforming the relevant random variables during the calculation of dam failure probability by means of First Order Second Moment method . On the basis of the analysis of the major dam failure modes, a probe is made into the computer simulation method and its procedures for direct calculation of the failure probability; while considering the dam shear-slipping collapse mode, a study is made of the state function and the distribution regularities of the random variables under this mode and the formula is deduced out for generating the random numbers for random variables of Pierson III Distribution, Extreme-value I Distribution and Logarithmic Normal Distribution; by programming, repeated simulations are conducted to the dam shear-slipping failure mode and through statistics and analysis of the results of the simulation, the mean value, the standard deviation and a 95% confidence interval of the shear-slipping failure probability are obtained.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124229918","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 the simulation of wind loads, it is mostly hypothesized that wind loads are stationary Gaussian stochastic processes. But, inasmuch as the wind pressure fluctuations measured at corners as well as other separation flow regions of roofs of buildings are found to be highly non-Gaussian, the Gaussian assumption is not appropriate for the generation of the wind pressure time history in these local regions. In order to simulate the non-Gaussian fluctuating wind pressure, a new framework is proposed in the present paper. In addition, the power spectral density function of fluctuating wind pressure is deduced rigorously by resorting to the relationship between the wind pressure and velocity in this paper. In order to corroborate the feasibility and correctness of the present methodology, a numerical example of simulating one-dimensional univariate non-Gaussian fluctuating wind pressure is taken into consideration.
{"title":"Simulation of Non-Gaussian Fluctuating Wind Pressure through Spectral Representation Method","authors":"Chunxiang Li, Jin-hua Li, Jian-hong Shen","doi":"10.1109/WCSE.2009.11","DOIUrl":"https://doi.org/10.1109/WCSE.2009.11","url":null,"abstract":"In the simulation of wind loads, it is mostly hypothesized that wind loads are stationary Gaussian stochastic processes. But, inasmuch as the wind pressure fluctuations measured at corners as well as other separation flow regions of roofs of buildings are found to be highly non-Gaussian, the Gaussian assumption is not appropriate for the generation of the wind pressure time history in these local regions. In order to simulate the non-Gaussian fluctuating wind pressure, a new framework is proposed in the present paper. In addition, the power spectral density function of fluctuating wind pressure is deduced rigorously by resorting to the relationship between the wind pressure and velocity in this paper. In order to corroborate the feasibility and correctness of the present methodology, a numerical example of simulating one-dimensional univariate non-Gaussian fluctuating wind pressure is taken into consideration.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123140112","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 implement the balanced distribution of the Service Grid system and to improve the utilization ratio of the resource as well as handling up rate of the system, the system of dynamic dispatching system basing on the Grid service has been designed and implemented after the study on the Grid service. Firstly, a layered loading balancing scheduling mode has been proposed, providing the structure of the dispatching service system. Secondly, a comprehensive service distribution algorithm has been designed and implemented in consideration of respective local service counts, each join points’ performance and current load distribution. Finally, the result of the experiment indicates that the scheduling system can improve the efficiency of dispatching service and the utilization ratio of distributed Grid resource.
{"title":"Research on a Dynamic Dispatching System of Service Grid","authors":"Z. Hongwei, Song Baoyan, Zhang Yu","doi":"10.1109/WCSE.2009.411","DOIUrl":"https://doi.org/10.1109/WCSE.2009.411","url":null,"abstract":"In order to implement the balanced distribution of the Service Grid system and to improve the utilization ratio of the resource as well as handling up rate of the system, the system of dynamic dispatching system basing on the Grid service has been designed and implemented after the study on the Grid service. Firstly, a layered loading balancing scheduling mode has been proposed, providing the structure of the dispatching service system. Secondly, a comprehensive service distribution algorithm has been designed and implemented in consideration of respective local service counts, each join points’ performance and current load distribution. Finally, the result of the experiment indicates that the scheduling system can improve the efficiency of dispatching service and the utilization ratio of distributed Grid resource.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121189419","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}
Prefix scheme is popular to label XML tree. In order to overcome the defect of rapidly the code size increasing with the depth increment, we propose a novel prefix labeling scheme based on layered structure. In our scheme, the XML document tree firstly is partitioned into some subtrees according to the segment granularity, whose roots are uniquely labeled by prefix codes as an outer code identifying all the nodes in the subtrees. And then the nodes inside the subtrees are also labeled by prefix codes as node’s inner codes. Finally, it is necessary to establish a linear table to link the root-of-subtree outer code and the code as a leaf node in the upper level subtree, which can help to restore the layered code to the complete one in the whole tree. Extensive theoretic analysis and experimental results show that the proposed prefix labeling scheme has relatively smaller mean code size, which is not increased with the increment of XML document, and shorter query response time for the smaller code size.
{"title":"BiLCLP: Storage Efficient Prefix Labeling Scheme","authors":"Juan Xu, Zhanhuai Li, Y. Lou","doi":"10.1109/WCSE.2009.32","DOIUrl":"https://doi.org/10.1109/WCSE.2009.32","url":null,"abstract":"Prefix scheme is popular to label XML tree. In order to overcome the defect of rapidly the code size increasing with the depth increment, we propose a novel prefix labeling scheme based on layered structure. In our scheme, the XML document tree firstly is partitioned into some subtrees according to the segment granularity, whose roots are uniquely labeled by prefix codes as an outer code identifying all the nodes in the subtrees. And then the nodes inside the subtrees are also labeled by prefix codes as node’s inner codes. Finally, it is necessary to establish a linear table to link the root-of-subtree outer code and the code as a leaf node in the upper level subtree, which can help to restore the layered code to the complete one in the whole tree. Extensive theoretic analysis and experimental results show that the proposed prefix labeling scheme has relatively smaller mean code size, which is not increased with the increment of XML document, and shorter query response time for the smaller code size.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"115 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114094481","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
扫码关注我们
求助内容：
应助结果提醒方式：