Pub Date : 1993-11-01DOI: 10.1109/CMPSAC.1993.404191
Su-Yin Hsieh, Carl K. Chang, P. Mongkolwat, Walter W. Pilch, Chiao-Chuan Shih
In a heterogeneous database environment, accessing data across different types of data models requires an integration of conceptual schemas. This conceptual schema can exist in various forms such as relational, object-oriented, hierarchical, or network. This paper provides a mechanism, a mapping function - for the transformation of an object- oriented schema to a relational schema and a query translation to access an object-oriented database for the relational database user.<>
{"title":"Capturing the objected-oriented database model in relational form","authors":"Su-Yin Hsieh, Carl K. Chang, P. Mongkolwat, Walter W. Pilch, Chiao-Chuan Shih","doi":"10.1109/CMPSAC.1993.404191","DOIUrl":"https://doi.org/10.1109/CMPSAC.1993.404191","url":null,"abstract":"In a heterogeneous database environment, accessing data across different types of data models requires an integration of conceptual schemas. This conceptual schema can exist in various forms such as relational, object-oriented, hierarchical, or network. This paper provides a mechanism, a mapping function - for the transformation of an object- oriented schema to a relational schema and a query translation to access an object-oriented database for the relational database user.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122278987","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 : 1993-11-01DOI: 10.1109/CMPSAC.1993.404192
Y. Miyadera, K. Anzai, H. Banba
A tree-structured diagram is considered as a tree in which each node has four attributes: (1) width, (2) depth, (3) horizontal coordinate and (4) vertical coordinate. The placing problem of the tree-structured diagram satisfying certain given eumorphous conditions is called a tidy drawing problem. The eumorphous conditions of tree-structured diagrams, oriented to program diagrams, have been formulated by modifying the eumorphous conditions of trees. formalized eumorphous conditions and corresponding unformalized methods of placement on the integral lattice were developed by Ogura etal. (1992). In this paper, we introduce new eumorphous conditions on the Euclidian plane. We also formulate O(n)-time and O(n/sup 2/)-time practical algorithms to provide placements which satisfy new eumorphous conditions by modifying the former conditions on the integral lattice As a result, we have new relationships among the eurmorphous conditions.<>
{"title":"A method of drawing tree-structured program diagrams on the Euclidian plane","authors":"Y. Miyadera, K. Anzai, H. Banba","doi":"10.1109/CMPSAC.1993.404192","DOIUrl":"https://doi.org/10.1109/CMPSAC.1993.404192","url":null,"abstract":"A tree-structured diagram is considered as a tree in which each node has four attributes: (1) width, (2) depth, (3) horizontal coordinate and (4) vertical coordinate. The placing problem of the tree-structured diagram satisfying certain given eumorphous conditions is called a tidy drawing problem. The eumorphous conditions of tree-structured diagrams, oriented to program diagrams, have been formulated by modifying the eumorphous conditions of trees. formalized eumorphous conditions and corresponding unformalized methods of placement on the integral lattice were developed by Ogura etal. (1992). In this paper, we introduce new eumorphous conditions on the Euclidian plane. We also formulate O(n)-time and O(n/sup 2/)-time practical algorithms to provide placements which satisfy new eumorphous conditions by modifying the former conditions on the integral lattice As a result, we have new relationships among the eurmorphous conditions.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134377884","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 : 1993-11-01DOI: 10.1109/CMPSAC.1993.404240
V. Karamcheti, B. Wah
The scheduling of tasks for applications with dynamic behavior traditionally rely on externally observable metrics such as the number of active processes. This paper presents a new scheduling strategy based on the observation that it may be possible to capture the near-term resource requirements of active tasks by expressions involving task parameters. Run-time evaluation of these expressions yields estimates of task behavior that are valid over a short, future interval of time. The heuristics proposed, which when used in conjunction with information supplied by profiling, can be used to annotate the source program with such expressions. Preliminary simulation results show that the use of near-future estimates in a dynamic scheduling strategy for divide-and-conquer algorithms consistently improves over traditional dynamic strategies. The performance of this strategy approaches that of the best-known deterministic strategy while incurring an overhead of the same order as other dynamic strategies.<>
{"title":"Scheduling of dynamic divide-and-conquer computations on multicomputers","authors":"V. Karamcheti, B. Wah","doi":"10.1109/CMPSAC.1993.404240","DOIUrl":"https://doi.org/10.1109/CMPSAC.1993.404240","url":null,"abstract":"The scheduling of tasks for applications with dynamic behavior traditionally rely on externally observable metrics such as the number of active processes. This paper presents a new scheduling strategy based on the observation that it may be possible to capture the near-term resource requirements of active tasks by expressions involving task parameters. Run-time evaluation of these expressions yields estimates of task behavior that are valid over a short, future interval of time. The heuristics proposed, which when used in conjunction with information supplied by profiling, can be used to annotate the source program with such expressions. Preliminary simulation results show that the use of near-future estimates in a dynamic scheduling strategy for divide-and-conquer algorithms consistently improves over traditional dynamic strategies. The performance of this strategy approaches that of the best-known deterministic strategy while incurring an overhead of the same order as other dynamic strategies.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131126184","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 : 1993-11-01DOI: 10.1109/CMPSAC.1993.404216
Ron Crocker, A. Andrews
The object-oriented (OO) programming paradigm for developing software systems has become more mainstream in the past several years. Existing research into the use of the OO paradigm is heavily biased toward front-end problems: design, programming languages, and development environments. Lost in this has been support for maintenance of OO system, yet maintenance is 80% of the effort for successful software systems. This paper focuses on software tools that support and enhance the software maintenance effort for OO systems. As the industry matures in its use of OO concepts, systems will move along a spectrum of object-oriented-ness, from non-OO systems at one end to fully OO systems at the other. Each end of the spectrum has different maintenance and tools needs.<>
{"title":"Maintenance support needs for object-oriented software","authors":"Ron Crocker, A. Andrews","doi":"10.1109/CMPSAC.1993.404216","DOIUrl":"https://doi.org/10.1109/CMPSAC.1993.404216","url":null,"abstract":"The object-oriented (OO) programming paradigm for developing software systems has become more mainstream in the past several years. Existing research into the use of the OO paradigm is heavily biased toward front-end problems: design, programming languages, and development environments. Lost in this has been support for maintenance of OO system, yet maintenance is 80% of the effort for successful software systems. This paper focuses on software tools that support and enhance the software maintenance effort for OO systems. As the industry matures in its use of OO concepts, systems will move along a spectrum of object-oriented-ness, from non-OO systems at one end to fully OO systems at the other. Each end of the spectrum has different maintenance and tools needs.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130541287","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 : 1993-11-01DOI: 10.1109/CMPSAC.1993.404212
A. Andrews, A. Roeseler
With the advent of process assessment and process improvement as key objectives for many software development organizations, it has become important to provide viable mechanisms to do so. This paper suggests to use production models paired with software metrics that quantify key drivers of productivity. We also show capabilities of production models with two examples. Production models must be used with proper parameterization to be successful. This may mean a new look at which metrics are helpful for process assessment.<>
{"title":"Software process assessment and improvement using production models","authors":"A. Andrews, A. Roeseler","doi":"10.1109/CMPSAC.1993.404212","DOIUrl":"https://doi.org/10.1109/CMPSAC.1993.404212","url":null,"abstract":"With the advent of process assessment and process improvement as key objectives for many software development organizations, it has become important to provide viable mechanisms to do so. This paper suggests to use production models paired with software metrics that quantify key drivers of productivity. We also show capabilities of production models with two examples. Production models must be used with proper parameterization to be successful. This may mean a new look at which metrics are helpful for process assessment.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115248837","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 : 1993-11-01DOI: 10.1109/CMPSAC.1993.404208
Y. Imai, K. Sumiya, Kouichi Yasutake, S. Haruna
This paper describes Visual CASE: a software development system that provides a framework which can be used by the whole development team: product planners, product designers, and software developers. This system includes interactive browsers, editors, and databases to manipulate the object model we designed specifically for the software in home appliances. We apply the object model to an entity that represents the specifications of a home appliance product. In other words, we introduce product specification objects and component objects to represent the characteristics of software in home appliances. As all developers using Visual CASE can discuss the specifications on the same framework, misunderstandings and misconceptions of the specifications seldom occur.<>
{"title":"Visual CASE: A software development system for home appliances","authors":"Y. Imai, K. Sumiya, Kouichi Yasutake, S. Haruna","doi":"10.1109/CMPSAC.1993.404208","DOIUrl":"https://doi.org/10.1109/CMPSAC.1993.404208","url":null,"abstract":"This paper describes Visual CASE: a software development system that provides a framework which can be used by the whole development team: product planners, product designers, and software developers. This system includes interactive browsers, editors, and databases to manipulate the object model we designed specifically for the software in home appliances. We apply the object model to an entity that represents the specifications of a home appliance product. In other words, we introduce product specification objects and component objects to represent the characteristics of software in home appliances. As all developers using Visual CASE can discuss the specifications on the same framework, misunderstandings and misconceptions of the specifications seldom occur.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128320880","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 : 1993-11-01DOI: 10.1109/CMPSAC.1993.404242
K. Romanik, J. Vitter
We examine the complexity of testing different program constructs by defining a measure called VCP-dimension and applying it to classes of programs, where all programs in a class share the same syntactic structure. VCP-dimension gives bounds on the number of test points needed to determine approximate correctness, so it gives insight into the difficulty of testing a program construct represented by a program class. We investigate the VCP-dimension of straight line code, if-then-else statements and for loops, and we compare the VCP-dimension of different combinations of constructs.<>
{"title":"Using computational learning theory to analyze the testing complexity of program segments","authors":"K. Romanik, J. Vitter","doi":"10.1109/CMPSAC.1993.404242","DOIUrl":"https://doi.org/10.1109/CMPSAC.1993.404242","url":null,"abstract":"We examine the complexity of testing different program constructs by defining a measure called VCP-dimension and applying it to classes of programs, where all programs in a class share the same syntactic structure. VCP-dimension gives bounds on the number of test points needed to determine approximate correctness, so it gives insight into the difficulty of testing a program construct represented by a program class. We investigate the VCP-dimension of straight line code, if-then-else statements and for loops, and we compare the VCP-dimension of different combinations of constructs.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125409285","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 : 1993-11-01DOI: 10.1109/CMPSAC.1993.404183
N. Gautier, D. Carver
DELTA, a DEsign Language To Actor, is a formal language used to enhance the design process. DELTA incorporates the concepts of object-oriented design into a design language. Once the preliminary steps of design have been completed, DELTA can be used to bridge the gap between architectural design and a detailed design specification. DELTA can be used to produce a documented design. Rapid prototyping, and reengineering are among the potential benefits to be reaped.<>
{"title":"DELTA-DEsign Language To Actor","authors":"N. Gautier, D. Carver","doi":"10.1109/CMPSAC.1993.404183","DOIUrl":"https://doi.org/10.1109/CMPSAC.1993.404183","url":null,"abstract":"DELTA, a DEsign Language To Actor, is a formal language used to enhance the design process. DELTA incorporates the concepts of object-oriented design into a design language. Once the preliminary steps of design have been completed, DELTA can be used to bridge the gap between architectural design and a detailed design specification. DELTA can be used to produce a documented design. Rapid prototyping, and reengineering are among the potential benefits to be reaped.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114433456","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 : 1993-11-01DOI: 10.1109/CMPSAC.1993.404179
I. S. Chu, M.S. Winslett
The workstation-server model is emerging as the standard computing environment for engineering and scientific applications. Most object-oriented database systems choose either the object-server architecture, in which individual objects are passed between the server and the workstation, or the page-server architecture, in which a disk page is the unit of transport between the server and the workstation. In this paper we extend the work of DeWitt et al. (1990) to consider the advantages and disadvantages of an implementation in which the application has direct access to pages, rather than to objects.<>
{"title":"Choices in database workstation-server architecture","authors":"I. S. Chu, M.S. Winslett","doi":"10.1109/CMPSAC.1993.404179","DOIUrl":"https://doi.org/10.1109/CMPSAC.1993.404179","url":null,"abstract":"The workstation-server model is emerging as the standard computing environment for engineering and scientific applications. Most object-oriented database systems choose either the object-server architecture, in which individual objects are passed between the server and the workstation, or the page-server architecture, in which a disk page is the unit of transport between the server and the workstation. In this paper we extend the work of DeWitt et al. (1990) to consider the advantages and disadvantages of an implementation in which the application has direct access to pages, rather than to objects.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123213286","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 : 1993-11-01DOI: 10.1109/CMPSAC.1993.404223
Kanwalinder Singh
Tool integration frameworks are gaining popularity as a means to provide integrated support for activities across the software development life cycle. Framework-based integrations leverage best-in-class tools and use vendor-neutral interfaces and mechanisms to support relationships between individual tools. This panel brings together framework providers, tool providers, and integrators/end users to provide a snapshot of the state of the art and practice in tool integration frameworks and framework-based integrations.<>
{"title":"Tool integration frameworks-Facts and fiction","authors":"Kanwalinder Singh","doi":"10.1109/CMPSAC.1993.404223","DOIUrl":"https://doi.org/10.1109/CMPSAC.1993.404223","url":null,"abstract":"Tool integration frameworks are gaining popularity as a means to provide integrated support for activities across the software development life cycle. Framework-based integrations leverage best-in-class tools and use vendor-neutral interfaces and mechanisms to support relationships between individual tools. This panel brings together framework providers, tool providers, and integrators/end users to provide a snapshot of the state of the art and practice in tool integration frameworks and framework-based integrations.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128209241","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
扫码关注我们
求助内容：
应助结果提醒方式：