In this article, we propose a stochastic model called the Gompertz software reliability model based on the familiar non-homogeneous Poisson process. It is shown that the proposed model can be derived from the well-known statistical theory of extreme-value and has the quite similar asymptotic property to the classical Gompertz curve. In a numerical example with the software failure data observed in a real software development project, we apply the Gompertz software reliability model to assess the software reliability and to predict the number of initial fault contents. We empirically conclude that our new model may function better than the existing models and is attractive in terms of goodness-of-fit test based on information criteria and mean squared error.
{"title":"Gompertz software reliability model and its application","authors":"Koji Ohishi, H. Okamura, T. Dohi","doi":"10.1109/COMPSAC.2005.82","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.82","url":null,"abstract":"In this article, we propose a stochastic model called the Gompertz software reliability model based on the familiar non-homogeneous Poisson process. It is shown that the proposed model can be derived from the well-known statistical theory of extreme-value and has the quite similar asymptotic property to the classical Gompertz curve. In a numerical example with the software failure data observed in a real software development project, we apply the Gompertz software reliability model to assess the software reliability and to predict the number of initial fault contents. We empirically conclude that our new model may function better than the existing models and is attractive in terms of goodness-of-fit test based on information criteria and mean squared error.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"480 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123394508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A data collection and grooming tool named DIG is reported. The tool allows the management of a software process to be able to extract data from a variety of project repositories, groom the data, and generate reports. The reports are aimed at assisting the management in the control of the software development process. DIG allows management to build a complete representation of the productivity data in order to better tease out the parameters and understand the causes of variation in the data. In addition, the data obtained and groomed by DIG may be used to calibrate and apply process control models.
{"title":"DIG: a tool for software process data extraction and grooming","authors":"Scott D. Miller, A. Mathur, R. Decarlo","doi":"10.1109/COMPSAC.2005.70","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.70","url":null,"abstract":"A data collection and grooming tool named DIG is reported. The tool allows the management of a software process to be able to extract data from a variety of project repositories, groom the data, and generate reports. The reports are aimed at assisting the management in the control of the software development process. DIG allows management to build a complete representation of the productivity data in order to better tease out the parameters and understand the causes of variation in the data. In addition, the data obtained and groomed by DIG may be used to calibrate and apply process control models.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128319146","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 : 2005-07-26DOI: 10.1109/COMPSAC.2005.167
M. Grechanik, D. Perry, D. Batory
Monitoring is a task of collecting measurements that reflect the state of a system. Administration is a collection of tasks for control and manipulation of computer systems. Monitoring and Administering computer Resources (MARS) in a distributed grid computing environment (i.e. a distributed environment for coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations) is an important, expensive, and critical task. We present a novel solution based on applying crosscuts using binary rewriters and an event-based model that allows developers to create non-trivial MARS programs easily and uniformly. Our approach converts low-level API resource calls into system-wide events that MARS programs can monitor. This is accomplished by introducing advice that contains event-generating code at join points in programs that represent computer resources. We categorize low-level resource APIs by imposing a transactional metaphor to simplify the complexity of interactions between resources and to enable reasoning about MARS programs. We report both a case study and simulation that supports the viability of our approach.
{"title":"Using AOP to monitor and administer software for grid computing environments","authors":"M. Grechanik, D. Perry, D. Batory","doi":"10.1109/COMPSAC.2005.167","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.167","url":null,"abstract":"Monitoring is a task of collecting measurements that reflect the state of a system. Administration is a collection of tasks for control and manipulation of computer systems. Monitoring and Administering computer Resources (MARS) in a distributed grid computing environment (i.e. a distributed environment for coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations) is an important, expensive, and critical task. We present a novel solution based on applying crosscuts using binary rewriters and an event-based model that allows developers to create non-trivial MARS programs easily and uniformly. Our approach converts low-level API resource calls into system-wide events that MARS programs can monitor. This is accomplished by introducing advice that contains event-generating code at join points in programs that represent computer resources. We categorize low-level resource APIs by imposing a transactional metaphor to simplify the complexity of interactions between resources and to enable reasoning about MARS programs. We report both a case study and simulation that supports the viability of our approach.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126231290","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}
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs. goal-oriented methods). In both cases, several approaches based on constraint solving exist, but in the presence of pointer variables only path-oriented methods have been proposed. This paper proposes to extend an existing goal-oriented test data generation technique to deal with multi-level pointer variables. The approach exploits the results of an intraprocedural flow-sensitive points-to analysis to automatically generate goal-oriented test data at the unit testing level. Implementation is in progress and a few examples are presented.
{"title":"Goal-oriented test data generation for programs with pointer variables","authors":"A. Gotlieb, Tristan Denmat, Bernard Botella","doi":"10.1109/COMPSAC.2005.81","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.81","url":null,"abstract":"Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs. goal-oriented methods). In both cases, several approaches based on constraint solving exist, but in the presence of pointer variables only path-oriented methods have been proposed. This paper proposes to extend an existing goal-oriented test data generation technique to deal with multi-level pointer variables. The approach exploits the results of an intraprocedural flow-sensitive points-to analysis to automatically generate goal-oriented test data at the unit testing level. Implementation is in progress and a few examples are presented.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125171864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A data extraction model, named the browser-oriented data extraction (BODE) model, was proposed by I-Chen Wu et al. (2005) to extract Web contents with script functions. In this model, the system built on top of browsers accesses pages by simulating users' operations on browsers. Based on this model, this paper defines a scripting language, named the BODED (browser-oriented data extraction description) language, which instructs the system how to do data extraction. This paper proposes a technique, called indirect browser replication to implement a BODE system, and also optimize the performance of this technique.
{"title":"A Web data extraction description language and its implementation","authors":"I-Chen Wu, J. Su, Loon-Been Chen","doi":"10.1109/COMPSAC.2005.38","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.38","url":null,"abstract":"A data extraction model, named the browser-oriented data extraction (BODE) model, was proposed by I-Chen Wu et al. (2005) to extract Web contents with script functions. In this model, the system built on top of browsers accesses pages by simulating users' operations on browsers. Based on this model, this paper defines a scripting language, named the BODED (browser-oriented data extraction description) language, which instructs the system how to do data extraction. This paper proposes a technique, called indirect browser replication to implement a BODE system, and also optimize the performance of this technique.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130559063","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}
Software reuse is widely believed as a feasible way to improve both the productivity and quality of software development. The developers must be capable to acquire enough desired components before developing with reuse. Many Internet-enabled reuse repositories exist to provide access to reusable resources. It is necessary to eliminate the semantic gaps of the repositories to enable users to access resources from multiple repositories via a single representation view. In some sense, the only usable information to mine the semantics of the terms representing the resources is the mutual components stored in the repositories. In this paper, the extended improved relevancy matching and ranking (EIRMR) method is proposed to enhance the semantic interoperability of reuse repositories, based on our previous work (IRMR) and the mutual components in the third-party repositories. Experimental results on the data sets from the real repositories demonstrated an improvement in terms of searching effectiveness.
{"title":"An extended approach to improving the semantic interoperation among reuse epositories","authors":"Y. Pan, Lei Wang, Lu Zhang, Bing Xie, Fuqing Yang","doi":"10.1109/COMPSAC.2005.45","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.45","url":null,"abstract":"Software reuse is widely believed as a feasible way to improve both the productivity and quality of software development. The developers must be capable to acquire enough desired components before developing with reuse. Many Internet-enabled reuse repositories exist to provide access to reusable resources. It is necessary to eliminate the semantic gaps of the repositories to enable users to access resources from multiple repositories via a single representation view. In some sense, the only usable information to mine the semantics of the terms representing the resources is the mutual components stored in the repositories. In this paper, the extended improved relevancy matching and ranking (EIRMR) method is proposed to enhance the semantic interoperability of reuse repositories, based on our previous work (IRMR) and the mutual components in the third-party repositories. Experimental results on the data sets from the real repositories demonstrated an improvement in terms of searching effectiveness.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"64 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134126902","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}
It is difficult to provide significant insight into any hybrid intelligent system design. We offer an informative account of the basic ideas underlying hybrid intelligent systems. We propose a balanced approach to constructing a hybrid intelligent system for a medical domain, along with arguments in favor of this balance and mechanisms for achieving a proper balance. This first of a series of contributions to hybrid intelligent systems design focuses on selecting attributes for soft-computing analysis. One part of this first contribution in our system is developed. Two definitions, probe and probe reducts, are introduced. Our CDispro algorithm can produce the core attribute and reducts that are essential condition attributes in data sets. Our initial study tests data from the UCI repository and geriatric data from DalMedix. The performance and utility of generated reducts are evaluated by 3-fold cross-validation that illustrates reduced dimensionality and complexity of data sets and processes.
{"title":"Hybrid intelligent systems: selecting attributes for soft-computing analysis","authors":"P. Pattaraintakorn, N. Cercone, K. Naruedomkul","doi":"10.1109/COMPSAC.2005.87","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.87","url":null,"abstract":"It is difficult to provide significant insight into any hybrid intelligent system design. We offer an informative account of the basic ideas underlying hybrid intelligent systems. We propose a balanced approach to constructing a hybrid intelligent system for a medical domain, along with arguments in favor of this balance and mechanisms for achieving a proper balance. This first of a series of contributions to hybrid intelligent systems design focuses on selecting attributes for soft-computing analysis. One part of this first contribution in our system is developed. Two definitions, probe and probe reducts, are introduced. Our CDispro algorithm can produce the core attribute and reducts that are essential condition attributes in data sets. Our initial study tests data from the UCI repository and geriatric data from DalMedix. The performance and utility of generated reducts are evaluated by 3-fold cross-validation that illustrates reduced dimensionality and complexity of data sets and processes.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132873007","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 propose a context-conflict management scheme for group-aware ubiquitous computing environments that allows context-aware applications to serve multiple users without distracting and sacrificing each other. The proposed scheme can detect semantic conflicts without explicit descriptions of the conflicts between different applications. Conflicts are resolved by a dynamically generated adaptation policy based on the weight value of user preference on each service. Individual context-aware applications can be reused without modification since middleware components for the context-conflict management take charge of detecting and resolving conflicts. Thus, the complicated context-conflict situation becomes more transparent to application programmers.
{"title":"A dynamic context-conflict management scheme for group-aware ubiquitous computing environments","authors":"Insuk Park, Dongman Lee, S. Hyun","doi":"10.1109/COMPSAC.2005.21","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.21","url":null,"abstract":"In this paper, we propose a context-conflict management scheme for group-aware ubiquitous computing environments that allows context-aware applications to serve multiple users without distracting and sacrificing each other. The proposed scheme can detect semantic conflicts without explicit descriptions of the conflicts between different applications. Conflicts are resolved by a dynamically generated adaptation policy based on the weight value of user preference on each service. Individual context-aware applications can be reused without modification since middleware components for the context-conflict management take charge of detecting and resolving conflicts. Thus, the complicated context-conflict situation becomes more transparent to application programmers.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115308149","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}
BDI is one of the models in agent systems. Currently; most of BDI agents' researches are focused on the ability for agents to dynamically select plans to achieve a goal. There are fewer discussions on intention scheduling, the order in which the selected plans are executed. Agents must adapt to dynamical and unpredictable changes. Without a proper scheduling scheme, an agent may repeat unnecessary works, waste valuable resource or even fail the users' expect altogether. In this paper, we present an effective intention-scheduling scheme in BDI reasoning process.
{"title":"Intention scheduling for BDI agent systems","authors":"Zu-Nien Lin, Hsun-Jen Hsu, Feng-Jian Wang","doi":"10.1109/ITCC.2005.177","DOIUrl":"https://doi.org/10.1109/ITCC.2005.177","url":null,"abstract":"BDI is one of the models in agent systems. Currently; most of BDI agents' researches are focused on the ability for agents to dynamically select plans to achieve a goal. There are fewer discussions on intention scheduling, the order in which the selected plans are executed. Agents must adapt to dynamical and unpredictable changes. Without a proper scheduling scheme, an agent may repeat unnecessary works, waste valuable resource or even fail the users' expect altogether. In this paper, we present an effective intention-scheduling scheme in BDI reasoning process.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124106487","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}
Monitoring of sensitive events is a key step for controlling the behavior of software. Specifying a sufficient set of constraints prior to software deployment is necessary for detecting the presence of such events during execution. Here we focus on issues related to service level constraints including types of constraints, the runtime structure of constraints and the related entities. An experiment to assess the feasibility of the proposed approach is also reported.
{"title":"Constraint violation detection: a fundamental part of software cybernetics","authors":"Qianxiang Wang","doi":"10.1109/COMPSAC.2005.64","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.64","url":null,"abstract":"Monitoring of sensitive events is a key step for controlling the behavior of software. Specifying a sufficient set of constraints prior to software deployment is necessary for detecting the presence of such events during execution. Here we focus on issues related to service level constraints including types of constraints, the runtime structure of constraints and the related entities. An experiment to assess the feasibility of the proposed approach is also reported.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116371032","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
扫码关注我们
求助内容：
应助结果提醒方式：