Pub Date : 1992-09-21DOI: 10.1109/CMPSAC.1992.217587
J. E. Urban, R. Frye, A. Miller, A. Rao
Includes presentations on industry training programs for software engineers and project managers that range from new hires through continuing education programs. Software engineering education in an academic setting is addressed as a precursor to a discussion of three approaches in industry to software engineering training. The introduction of a cross-functional technical training team and a project management training team at the Bull Worldwide Information Systems organization in Phoenix, Arizona is addressed. An overview of software engineering training within a Strategic Business Unit of Motorola, Inc. is presented. The training program includes corporate initiatives, general software engineering training, and applications specific training, utilizing a mix of Motorola training, local universities, vendor-supplied training, and internally developed workshops. The experience gained by Tata Consultancy Services training group is discussed regarding designing, organizing, and conducting software engineering training programs, initially on an experimental basis, and subsequently as a regular feature.<>
包括针对软件工程师和项目经理的行业培训计划的演示，范围从新员工到继续教育计划。学术背景下的软件工程教育是讨论工业中软件工程培训的三种方法的先驱。在亚利桑那州凤凰城的Bull Worldwide Information Systems组织中介绍了一个跨职能的技术培训团队和一个项目管理培训团队。介绍了摩托罗拉公司战略业务部门软件工程培训的概况。该培训计划包括公司倡议、通用软件工程培训和应用特定培训，利用摩托罗拉培训、当地大学、供应商提供的培训和内部开发的研讨会。本文讨论了塔塔咨询服务培训小组在设计、组织和实施软件工程培训计划方面所获得的经验，最初是在实验基础上，随后作为常规特征。
{"title":"Industrial strength software engineering training programs","authors":"J. E. Urban, R. Frye, A. Miller, A. Rao","doi":"10.1109/CMPSAC.1992.217587","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217587","url":null,"abstract":"Includes presentations on industry training programs for software engineers and project managers that range from new hires through continuing education programs. Software engineering education in an academic setting is addressed as a precursor to a discussion of three approaches in industry to software engineering training. The introduction of a cross-functional technical training team and a project management training team at the Bull Worldwide Information Systems organization in Phoenix, Arizona is addressed. An overview of software engineering training within a Strategic Business Unit of Motorola, Inc. is presented. The training program includes corporate initiatives, general software engineering training, and applications specific training, utilizing a mix of Motorola training, local universities, vendor-supplied training, and internally developed workshops. The experience gained by Tata Consultancy Services training group is discussed regarding designing, organizing, and conducting software engineering training programs, initially on an experimental basis, and subsequently as a regular feature.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128245011","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 : 1992-09-21DOI: 10.1109/CMPSAC.1992.217589
Ting-Yu Cheng, Jen-Yao Chung, Kwei-Jay Lin
The authors study dynamic load balancing algorithms in loosely coupled hard-real-time systems. The gradient model, focused addressing and the bidding methods are used. The gradient model entails transferring backlogged tasks to nearby idle processors according to pressure gradient indirectly established by request from idle processors. The focused addressing node uses network-wide surplus information in determining the target node to send excessive tasks to. Busy nodes in the bidding method send out requests for bids to migrate tasks that are not to be completed. In the model, each job is divided into a hard task and a soft task. All hard tasks must be finished by their deadlines and will not be migrated to other nodes. If a soft task cannot be completed by its deadline, it can be migrated to a neighboring node with less load or more surplus CPU time. Three load-balancing algorithms were evaluated.<>
{"title":"Dynamic load balancing algorithms in loosely-coupled real-time systems","authors":"Ting-Yu Cheng, Jen-Yao Chung, Kwei-Jay Lin","doi":"10.1109/CMPSAC.1992.217589","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217589","url":null,"abstract":"The authors study dynamic load balancing algorithms in loosely coupled hard-real-time systems. The gradient model, focused addressing and the bidding methods are used. The gradient model entails transferring backlogged tasks to nearby idle processors according to pressure gradient indirectly established by request from idle processors. The focused addressing node uses network-wide surplus information in determining the target node to send excessive tasks to. Busy nodes in the bidding method send out requests for bids to migrate tasks that are not to be completed. In the model, each job is divided into a hard task and a soft task. All hard tasks must be finished by their deadlines and will not be migrated to other nodes. If a soft task cannot be completed by its deadline, it can be migrated to a neighboring node with less load or more surplus CPU time. Three load-balancing algorithms were evaluated.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132127704","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 : 1992-09-21DOI: 10.1109/CMPSAC.1992.217585
H. Shimakawa, Y. Sugitani, K. Kikkawa, T. Watanabe
A practical distributed artificial intelligence (AI) system is proposed for the guidance of plant operations in a steel galvanizing plant. The system includes three autonomous agents for guidance. Each agent records data sampled every moment in an appropriate form for a task assigned to it. The data correspond to states of a monitored entity. Each agent recognizes not only a current state but also a state transition in the course of time to select the best moment for a plant operation. An experiment in a real plant has proved that the plant-operation-supporting system can guide plant operations in much the same way as an experienced operator.<>
{"title":"Agents to guide operators with recognition of time series","authors":"H. Shimakawa, Y. Sugitani, K. Kikkawa, T. Watanabe","doi":"10.1109/CMPSAC.1992.217585","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217585","url":null,"abstract":"A practical distributed artificial intelligence (AI) system is proposed for the guidance of plant operations in a steel galvanizing plant. The system includes three autonomous agents for guidance. Each agent records data sampled every moment in an appropriate form for a task assigned to it. The data correspond to states of a monitored entity. Each agent recognizes not only a current state but also a state transition in the course of time to select the best moment for a plant operation. An experiment in a real plant has proved that the plant-operation-supporting system can guide plant operations in much the same way as an experienced operator.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132972412","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 : 1992-09-21DOI: 10.1109/CMPSAC.1992.217609
Pablo A. Straub, M. Zelkowitz
Implementation bias in a specification is an arbitrary constraint in the solution space. The authors describe the problem of bias and then present a model of the specification and design processes describing individual subprocesses in terms of precision/detail programs, and a model of bias in multi-attribute software specifications. While studying how bias is introduced into a specification it was realized that software defects and bias are dual problems of a single phenomenon. This has been used to explain the large proportion of faults found during the coding phase at the Software Engineering Laboratory at NASA Goddard Space Flight Center.<>
{"title":"On the nature of bias and defects in the software specification process","authors":"Pablo A. Straub, M. Zelkowitz","doi":"10.1109/CMPSAC.1992.217609","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217609","url":null,"abstract":"Implementation bias in a specification is an arbitrary constraint in the solution space. The authors describe the problem of bias and then present a model of the specification and design processes describing individual subprocesses in terms of precision/detail programs, and a model of bias in multi-attribute software specifications. While studying how bias is introduced into a specification it was realized that software defects and bias are dual problems of a single phenomenon. This has been used to explain the large proportion of faults found during the coding phase at the Software Engineering Laboratory at NASA Goddard Space Flight Center.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"294 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124225509","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 : 1992-09-21DOI: 10.1109/CMPSAC.1992.217599
Colin Ashford
A comparison of the object model underpinning open systems interconnection (OSI) network management standards with that being developed for object-oriented software development systems indicates a close alignment between the models. But the OSI object-model goes further: it supports notions of asynchronously occurring events, concurrency, and optionality of implementation. These features are not found in the OMG object-model, but neither are they precluded. Consequently, the way is paved for network-management product suppliers to use OMG-conformant software-development systems.<>
{"title":"Object modelling for open network management","authors":"Colin Ashford","doi":"10.1109/CMPSAC.1992.217599","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217599","url":null,"abstract":"A comparison of the object model underpinning open systems interconnection (OSI) network management standards with that being developed for object-oriented software development systems indicates a close alignment between the models. But the OSI object-model goes further: it supports notions of asynchronously occurring events, concurrency, and optionality of implementation. These features are not found in the OMG object-model, but neither are they precluded. Consequently, the way is paved for network-management product suppliers to use OMG-conformant software-development systems.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121920191","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 : 1992-09-21DOI: 10.1109/CMPSAC.1992.217568
G. Grosz
The author presents generic knowledge to speed up the construction of information system requirements and, more importantly, the behavioral part of entities. The solution is based on the hypothesis that generic structures independent of a particular application can be associated to classes of real-world phenomena. These structures can be reused in the development of different projects. The hypothesis is that there exists classes of similar real-world phenomena which are described using identical structures. A generic structure describes either the static and behavioral properties of a class of phenomena. Designing an application can be seen as the recognition of these phenomena and the instantiation of the associated generic structures. The formalism used to express the generic knowledge is presented, namely the triple . A presentation of generic knowledge with examples is given. The use of such knowledge is illustrated through an example.<>
{"title":"Building information system requirements using generic structures","authors":"G. Grosz","doi":"10.1109/CMPSAC.1992.217568","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217568","url":null,"abstract":"The author presents generic knowledge to speed up the construction of information system requirements and, more importantly, the behavioral part of entities. The solution is based on the hypothesis that generic structures independent of a particular application can be associated to classes of real-world phenomena. These structures can be reused in the development of different projects. The hypothesis is that there exists classes of similar real-world phenomena which are described using identical structures. A generic structure describes either the static and behavioral properties of a class of phenomena. Designing an application can be seen as the recognition of these phenomena and the instantiation of the associated generic structures. The formalism used to express the generic knowledge is presented, namely the triple . A presentation of generic knowledge with examples is given. The use of such knowledge is illustrated through an example.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"16 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116407480","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 : 1992-09-21DOI: 10.1109/CMPSAC.1992.217606
Shih-Kun Huang, Deng-Jyi Chen
In object-oriented systems, heavy message sending has slowed down the execution efficiency. Most of the current solutions are based on message tables according to a class-hierarchy to develop more efficient method searching algorithms. An approach with little space overhead and constant dispatch time is proposed. The general strategy is called the two-way coloring technique. The algorithm can be applied in both typed and untyped object-oriented languages. For typed languages, the space overhead is not greater than the conventional approaches, but it can dispatch methods in the same situations as untyped languages. For untyped languages, the constraint for dispatch is not decreased and the space overhead is not much higher, but it can dispatch methods in constant time. Based on the comparison with conventional approaches, the proposed approach demonstrates its advantages on space overhead, dispatching speed, and applicability. Several case studies are presented as a comparison with existing run time dispatch mechanisms.<>
{"title":"Two-way coloring approaches for method dispatching in object-oriented programming systems","authors":"Shih-Kun Huang, Deng-Jyi Chen","doi":"10.1109/CMPSAC.1992.217606","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217606","url":null,"abstract":"In object-oriented systems, heavy message sending has slowed down the execution efficiency. Most of the current solutions are based on message tables according to a class-hierarchy to develop more efficient method searching algorithms. An approach with little space overhead and constant dispatch time is proposed. The general strategy is called the two-way coloring technique. The algorithm can be applied in both typed and untyped object-oriented languages. For typed languages, the space overhead is not greater than the conventional approaches, but it can dispatch methods in the same situations as untyped languages. For untyped languages, the constraint for dispatch is not decreased and the space overhead is not much higher, but it can dispatch methods in constant time. Based on the comparison with conventional approaches, the proposed approach demonstrates its advantages on space overhead, dispatching speed, and applicability. Several case studies are presented as a comparison with existing run time dispatch mechanisms.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128370672","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 : 1992-09-21DOI: 10.1109/CMPSAC.1992.217578
J. Börstler, T. Janning
Modern computer-aided software engineering (CASE) tools raise the need for traceability, i.e. the ability to control the consistency between software documents produced at different stages of the software life-cycle. The authors describe the transformation between an integrated requirements engineering language based on structured analysis and the entity relationship model, and a modern design language. The transformation works incrementally and is sensitive to changes to already transformed parts. The authors outline the transformation algorithm and compare the approach to those found in the literature. A tool which implements the proposed algorithm and supports the proposed traceability is described. The potential and the limits of this approach are highlighted.<>
{"title":"Traceability between requirements and design: a transformational approach","authors":"J. Börstler, T. Janning","doi":"10.1109/CMPSAC.1992.217578","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217578","url":null,"abstract":"Modern computer-aided software engineering (CASE) tools raise the need for traceability, i.e. the ability to control the consistency between software documents produced at different stages of the software life-cycle. The authors describe the transformation between an integrated requirements engineering language based on structured analysis and the entity relationship model, and a modern design language. The transformation works incrementally and is sensitive to changes to already transformed parts. The authors outline the transformation algorithm and compare the approach to those found in the literature. A tool which implements the proposed algorithm and supports the proposed traceability is described. The potential and the limits of this approach are highlighted.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122500609","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 : 1992-09-21DOI: 10.1109/CMPSAC.1992.217550
D. Wilson, G. Sullivan, G. Masson
The authors report on an attempt to assess the performance of algorithms utilizing certification trails on abstract data types. Specifically, they have applied this method to the following problems: heapsort, Huffman tree, shortest path, and skyline. Previous results used certification trails specific to a particular problem and implementation. The approach allows certification trails to be localized to data structure modules making the use of this technique transparent to the user of such modules.<>
{"title":"Experimental evaluation of certification trails using abstract data type validation","authors":"D. Wilson, G. Sullivan, G. Masson","doi":"10.1109/CMPSAC.1992.217550","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217550","url":null,"abstract":"The authors report on an attempt to assess the performance of algorithms utilizing certification trails on abstract data types. Specifically, they have applied this method to the following problems: heapsort, Huffman tree, shortest path, and skyline. Previous results used certification trails specific to a particular problem and implementation. The approach allows certification trails to be localized to data structure modules making the use of this technique transparent to the user of such modules.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122587107","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 : 1992-09-21DOI: 10.1109/CMPSAC.1992.217571
H. Lutfiyya, Aggie Y. Sun, B. McMillin
One approach for providing fault tolerance is through examining the behavior and properties of the application and deriving executable assertions that detect faults. This paper focuses on transforming the assertions of a verification proof of a program to executable assertions. These executable assertions may be embedded in the program to create a fault-tolerant program. It is also shown how the natural redundancy of the program variables can be used to reduce the number of executable assertions needed. While this approach has been applied to the sequential programming environment, the distributed programming environment presents special challenges. The authors discuss the application of concurrent programming axiomatic proof systems to generate executable assertions in a distributed environment using distributed branch and bound as a model problem.<>
{"title":"Fault-tolerant concurrent branch and bound algorithms derived from program verification","authors":"H. Lutfiyya, Aggie Y. Sun, B. McMillin","doi":"10.1109/CMPSAC.1992.217571","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217571","url":null,"abstract":"One approach for providing fault tolerance is through examining the behavior and properties of the application and deriving executable assertions that detect faults. This paper focuses on transforming the assertions of a verification proof of a program to executable assertions. These executable assertions may be embedded in the program to create a fault-tolerant program. It is also shown how the natural redundancy of the program variables can be used to reduce the number of executable assertions needed. While this approach has been applied to the sequential programming environment, the distributed programming environment presents special challenges. The authors discuss the application of concurrent programming axiomatic proof systems to generate executable assertions in a distributed environment using distributed branch and bound as a model problem.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124118787","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
扫码关注我们
求助内容：
应助结果提醒方式：