Pub Date : 1992-09-21DOI: 10.1109/CMPSAC.1992.217597
P. Hu, S. Wilbur
The widely used performance measures for replicated file systems are file availability and reliability. The authors compare such measures for the dynamic supporting algorithm, the dynamic supporting (G) algorithm, and other algorithms, e.g., the available copies and the majority voting algorithms. Since replicas and votes are conceptually separated, the two dynamic supporting algorithms could achieve very high availability and reliability while still keeping storage cost very low, especially with only two replicas. Both stochastic analysis and simulation results are reported. The performance improvement of the dynamic supporting algorithms is demonstrated by the results.<>
{"title":"Performance evaluation of dynamic supporting algorithms","authors":"P. Hu, S. Wilbur","doi":"10.1109/CMPSAC.1992.217597","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217597","url":null,"abstract":"The widely used performance measures for replicated file systems are file availability and reliability. The authors compare such measures for the dynamic supporting algorithm, the dynamic supporting (G) algorithm, and other algorithms, e.g., the available copies and the majority voting algorithms. Since replicas and votes are conceptually separated, the two dynamic supporting algorithms could achieve very high availability and reliability while still keeping storage cost very low, especially with only two replicas. Both stochastic analysis and simulation results are reported. The performance improvement of the dynamic supporting algorithms is demonstrated by the results.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"86 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":"125389270","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.217554
R. Collet
Public data Internets (PDIs) provide the capability for their customers to exchange information with other firms, government agencies, and research institutions throughout the world via the Internet. The author provides an overview of the PDI industry and current status. Although the percentage of PDI traffic over the Internet is small, PDI use will grow as more and more corporations and institutions discover the benefits of internetworking with their customers and collaborators across the globe. The TCP/IP protocol, PDI interconnections, and network information service centers available to assist users in locating and obtaining information throughout the Internet are discussed.<>
{"title":"What does a public data Internet do?","authors":"R. Collet","doi":"10.1109/CMPSAC.1992.217554","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217554","url":null,"abstract":"Public data Internets (PDIs) provide the capability for their customers to exchange information with other firms, government agencies, and research institutions throughout the world via the Internet. The author provides an overview of the PDI industry and current status. Although the percentage of PDI traffic over the Internet is small, PDI use will grow as more and more corporations and institutions discover the benefits of internetworking with their customers and collaborators across the globe. The TCP/IP protocol, PDI interconnections, and network information service centers available to assist users in locating and obtaining information throughout the Internet are discussed.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"1109 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":"123342115","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.217566
Xudong He, C.-H. Yang
In previous work, a methodology for constructing hierarchical and structured high-level Petri net specifications has been developed. The authors further explore and refine the methodology for using hierarchical high-level Petri nets in systems analysis. The approach has adapted the results from the data flow diagram method and its application to modern systems analysis. The major steps and the associated techniques of the approach are presented and demonstrated through a library system.<>
{"title":"Structured analysis using hierarchical predicate transition nets","authors":"Xudong He, C.-H. Yang","doi":"10.1109/CMPSAC.1992.217566","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217566","url":null,"abstract":"In previous work, a methodology for constructing hierarchical and structured high-level Petri net specifications has been developed. The authors further explore and refine the methodology for using hierarchical high-level Petri nets in systems analysis. The approach has adapted the results from the data flow diagram method and its application to modern systems analysis. The major steps and the associated techniques of the approach are presented and demonstrated through a library system.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"6 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":"124307592","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.217583
Hui Liu, Maung T. Nyeu, D. Yun, Woei Lin
The authors present an animation tool for visualizing the complex, dynamic behavior of parallel algorithms. The key idea behind this tool design is to abstract run-time activities and turn them into graphical representations that move and vary in location, size, and color. With proper abstractions, it establishes a technical foundation for monitoring, analyzing, and improving complex parallel algorithms. It represents animated views in an informative and coherent manner. There are two unique attributes that distinguish the animation tool from others: (1) it provides a general simulation environment for analyzing parallel algorithms with arbitrary program structures and sizes; and (2) it allows the visualization for computation status of parallel processes and their run-time interactions.<>
{"title":"VATPA: a simulation environment for message-passing concurrent systems","authors":"Hui Liu, Maung T. Nyeu, D. Yun, Woei Lin","doi":"10.1109/CMPSAC.1992.217583","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217583","url":null,"abstract":"The authors present an animation tool for visualizing the complex, dynamic behavior of parallel algorithms. The key idea behind this tool design is to abstract run-time activities and turn them into graphical representations that move and vary in location, size, and color. With proper abstractions, it establishes a technical foundation for monitoring, analyzing, and improving complex parallel algorithms. It represents animated views in an informative and coherent manner. There are two unique attributes that distinguish the animation tool from others: (1) it provides a general simulation environment for analyzing parallel algorithms with arbitrary program structures and sizes; and (2) it allows the visualization for computation status of parallel processes and their run-time interactions.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"8 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":"127980063","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.217579
J. Dobson, A. Blyth, J. Chudge, R. Strens
The authors describe the ORDIT approach to requirements identification and expression within the context of organization change. ORDIT focuses on the representation of organizational requirements in the design of socio-technical systems which are intended to emphasize the relationships between organizational structure and information technology (IT) systems. The five main components of the ORDIT methodology are discussed, with a focus on the process model and the enterprise model. A process model is a model of the process of eliciting and modeling requirements. One of the main characteristics of the ORDIT process model is the way it has separated these two functions and has shown the relation between them. The ORDIT project has devised an enterprise modeling language to represent the structure of the organization to serve two related but distinct purposes: to determine the requirements owners and their positions and roles within the organization; and to determine the users and their roles and responsibilities within the organization.<>
{"title":"The ORDIT approach to requirements identification","authors":"J. Dobson, A. Blyth, J. Chudge, R. Strens","doi":"10.1109/CMPSAC.1992.217579","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217579","url":null,"abstract":"The authors describe the ORDIT approach to requirements identification and expression within the context of organization change. ORDIT focuses on the representation of organizational requirements in the design of socio-technical systems which are intended to emphasize the relationships between organizational structure and information technology (IT) systems. The five main components of the ORDIT methodology are discussed, with a focus on the process model and the enterprise model. A process model is a model of the process of eliciting and modeling requirements. One of the main characteristics of the ORDIT process model is the way it has separated these two functions and has shown the relation between them. The ORDIT project has devised an enterprise modeling language to represent the structure of the organization to serve two related but distinct purposes: to determine the requirements owners and their positions and roles within the organization; and to determine the users and their roles and responsibilities within the organization.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"99 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":"134158120","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.217610
R. G. Crespo
The identification of the properties that users require computer applications to hold is essential for the development of software systems. The author analyzes how properties are related amongst each other and proposes one method to identify collections of properties and relationships between properties. He advocates that prior to the development of computer-based systems, it is necessary to identify the properties of the system development and the relationships between the properties. From an initial list of properties, the required set of properties of the software development can be selected and refined. An extract of one survey of properties is presented. The survey is a particular application of the method presented.<>
{"title":"The identification and use of properties and relationships between properties of the software development","authors":"R. G. Crespo","doi":"10.1109/CMPSAC.1992.217610","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217610","url":null,"abstract":"The identification of the properties that users require computer applications to hold is essential for the development of software systems. The author analyzes how properties are related amongst each other and proposes one method to identify collections of properties and relationships between properties. He advocates that prior to the development of computer-based systems, it is necessary to identify the properties of the system development and the relationships between the properties. From an initial list of properties, the required set of properties of the software development can be selected and refined. An extract of one survey of properties is presented. The survey is a particular application of the method presented.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"281 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":"132694144","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.217588
S. Edirisooriya, G. Edirisooriya
In distributed systems files are replicated to enhance availability and reliability. The authors provide an algorithm based on coding theory to significantly reduce the number of signatures needed to precisely diagnose differing pages in remotely located file copies. The method needs only one message transmission. A unique feature of this method is the ability to precisely diagnose up to t differing pages with just 2t signatures, independent of the files size. The maximum number of pages in a file is determined only by the number of bits in a signature. If a signature has m bits, the proposed technique can precisely identify t(t<2/sup m-1/ page differences in a file that has up to 2/sup m/-1 pages.<>
{"title":"A signature efficient solution for remote file comparison","authors":"S. Edirisooriya, G. Edirisooriya","doi":"10.1109/CMPSAC.1992.217588","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217588","url":null,"abstract":"In distributed systems files are replicated to enhance availability and reliability. The authors provide an algorithm based on coding theory to significantly reduce the number of signatures needed to precisely diagnose differing pages in remotely located file copies. The method needs only one message transmission. A unique feature of this method is the ability to precisely diagnose up to t differing pages with just 2t signatures, independent of the files size. The maximum number of pages in a file is determined only by the number of bits in a signature. If a signature has m bits, the proposed technique can precisely identify t(t<2/sup m-1/ page differences in a file that has up to 2/sup m/-1 pages.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"11 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":"115900052","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.217586
Karen L. Petersen
The author provides an overview of the IDA (intrusion detection alert) knowledge-based system project. This project involves the development of a prototype knowledge based system to analyze mainframe security audit trail data. Various aspects of the IDA knowledge-based system prototyping effort, including project management, design, and development are discussed. Highlights of IDA features are described. The use of knowledge based system technology to address the increased importance of securing corporate data and information systems, a critical and valuable company asset, is the primary focus.<>
{"title":"IDA-intrusion detection alert","authors":"Karen L. Petersen","doi":"10.1109/CMPSAC.1992.217586","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217586","url":null,"abstract":"The author provides an overview of the IDA (intrusion detection alert) knowledge-based system project. This project involves the development of a prototype knowledge based system to analyze mainframe security audit trail data. Various aspects of the IDA knowledge-based system prototyping effort, including project management, design, and development are discussed. Highlights of IDA features are described. The use of knowledge based system technology to address the increased importance of securing corporate data and information systems, a critical and valuable company asset, is the primary focus.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"29 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":"131589640","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.217558
Y. Jiang, A. Makinouchi
The authors propose an object-oriented programming language called WARASA for writing concurrent object-oriented program on Mach-based shared memory multiprocessor computers. WARASA is an extension to C/sup ++/ to allow a programmer to develop concurrent programming. In designing WARASA, the parallel mechanisms on the Mach operating system are combined with the object-oriented paradigm. It enables users to develop concurrent programs easily and efficiently, because some implementation details such as locking and unlocking which programmers would have to know to write parallel programs are hidden. An overview of WARASA is given. The features of WARASA class models are discussed. Some applications are shown to demonstrate WARASA's expressive power.<>
{"title":"WARASA: an enhanced C++ for concurrent programming on shared memory multiprocessor computers","authors":"Y. Jiang, A. Makinouchi","doi":"10.1109/CMPSAC.1992.217558","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217558","url":null,"abstract":"The authors propose an object-oriented programming language called WARASA for writing concurrent object-oriented program on Mach-based shared memory multiprocessor computers. WARASA is an extension to C/sup ++/ to allow a programmer to develop concurrent programming. In designing WARASA, the parallel mechanisms on the Mach operating system are combined with the object-oriented paradigm. It enables users to develop concurrent programs easily and efficiently, because some implementation details such as locking and unlocking which programmers would have to know to write parallel programs are hidden. An overview of WARASA is given. The features of WARASA class models are discussed. Some applications are shown to demonstrate WARASA's expressive power.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"1 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":"130388440","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.217577
K. S. Kumar, M. Sparancia, A. Unnikrishnan
The authors discuss a framework where fast inferences could be made from a fuzzy knowledge base of examples using neural networks. They sketch a scheme for defuzzifying the example base into a set of similarity vectors using a trait-adjusted similarity measure between a pair of fuzzy terms, and then training a neural network with these similarity vectors. A multilayer feedforward neural network with backpropagation learning rule was used.<>
{"title":"A neural network for fast inferencing on a fuzzy knowledge base","authors":"K. S. Kumar, M. Sparancia, A. Unnikrishnan","doi":"10.1109/CMPSAC.1992.217577","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217577","url":null,"abstract":"The authors discuss a framework where fast inferences could be made from a fuzzy knowledge base of examples using neural networks. They sketch a scheme for defuzzifying the example base into a set of similarity vectors using a trait-adjusted similarity measure between a pair of fuzzy terms, and then training a neural network with these similarity vectors. A multilayer feedforward neural network with backpropagation learning rule was used.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"29 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":"115636139","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
扫码关注我们
求助内容：
应助结果提醒方式：