1979 International Workshop on Managing Requirements Knowledge (MARK)最新文献

{"title":"A modular approach to computer security risk management","authors":"R. Campbell, Gerald A. Sands","doi":"10.1109/MARK.1979.8817285","DOIUrl":"https://doi.org/10.1109/MARK.1979.8817285","url":null,"abstract":"Risk management is concerned with the identification, measurement, control and minimization of impact of uncertain events upon organizations that depend upon automated operations. 11 It is an analytical process with a large number of variables, many of which are unique to the environment under consideration. For this reason, there has not yet been developed within general state-of-the-art a single methodology broadly applicable to all risk management environments. 1 , 10","PeriodicalId":341008,"journal":{"name":"1979 International Workshop on Managing Requirements Knowledge (MARK)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128770024","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}

{"title":"A computer analysis tool for structural decomposition using entropy metrics","authors":"A. N. Silver","doi":"10.1109/MARK.1979.8817137","DOIUrl":"https://doi.org/10.1109/MARK.1979.8817137","url":null,"abstract":"The decomposition of a metric space into successive subregions exhibiting distinctive characteristics is a problem of broad application. In pattern classification, the object is to partition the space such that pattern classes are easily separable; that is, so that each subregion of the partition contains predominantly samples of only one class. In piece-wise-constant approximation the decompositions produced contain samples whose values are sufficiently close to allow approximation with a specified degree of accuracy. In defining software it is quite often necessary to derive a structural model of a computer program which contains modules, i.e., partitions exhibiting the flow relations or connectivities among the elements (statements) in a program. The subsequent analysis and manipulation of the structural model produces useful design alternatives that enhance the operational qualities of the software generated in terms of program control, logic paths, data transfer and other relevant software issues. The basic feasibility of this approach has been demonstrated by numerous investigators. 1 - 5 However, the analytical and diagnostic tools for performing structural decompositions require further refinement and development. For example, the metrics usually used 6 , 7 for defining the topology of a given software structure are primarily single attribute measures. Although the entropy metric proposed in this paper is metrizable in terms of its hypergraph representation, 8 the extension to a multi-attribute unique formulation is, as yet, elusive. This is because an all-purpose problemindependent metric space places unrealizable constraints on the structure it proposes to define. Thus, as Koontz et al. 9 point out, even when a metric is given and a structure well known, the notion of neighboring points can not be rigorously defined for finite point sets from a computational point of view, since the simplest Euclidean distance measure must be scaled by a factor indicating its own respective distance to the nearest neighbor in order to avoid overlapping and ambiguous regions. Although conceptually, the construction of a neighborhood and the determination of the limit point of a sequence of real numbers is a widely used idea, a more fundamental requirement for metrizable hyper-spaces is that of specifying the existence of a limit point of a set. The resultant necessary and sufficient conditions for identifying metrizable spaces is given by Hausdorff. 10 However, equivalent normalizations and the use of discrete semi-metrics over a restricted space have precluded some of these inherent problems in the quest for such a unique, multi-attribute metric. Thus, the primary emphasis is to obtain realizable decompositions using readily-implementable metrics, as well as focus upon suitable partitioning alternatives in terms of identifying mathematically consistent criteria for structural decompositions.","PeriodicalId":341008,"journal":{"name":"1979 International Workshop on Managing Requirements Knowledge (MARK)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129789891","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}

{"title":"Project management through the Accomplishment Value Procedure (AVP)","authors":"Donald J. Aharonian","doi":"10.1109/mark.1979.8817224","DOIUrl":"https://doi.org/10.1109/mark.1979.8817224","url":null,"abstract":"This paper describes a technique called the Accomplishment Value Procedure, AVP, which accurately measures the status of and provides visibility to an information systems development project. It builds upon the foundation of two of R. I. Benjamin’s axioms: 1","PeriodicalId":341008,"journal":{"name":"1979 International Workshop on Managing Requirements Knowledge (MARK)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129843436","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}

{"title":"Computers in judicial administration","authors":"Charles L. Aird, B. H. Todd","doi":"10.1109/MARK.1979.8817243","DOIUrl":"https://doi.org/10.1109/MARK.1979.8817243","url":null,"abstract":"The number of computer installations in the courts has increased rapidly in the past ten years. This trend indicates an enthusiasm in the courts to acquire the scientific and industrial technology that the business community has successfully used. The computer is recognized as being a major tool of technological development and for its tremendous capability for upgrading the quantity and quality of a wide variety of functions and services. However, while looking in ecstasy at the new horizons of computer technology, we must realize the computer’s dependency upon man. Computers are unlike any other machine. Switch on a water pump and water is pumped, but switch on a computer and nothing happens unless precise instructions have been prepared.","PeriodicalId":341008,"journal":{"name":"1979 International Workshop on Managing Requirements Knowledge (MARK)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120956808","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}

{"title":"On the implementation of a conceptual schema model within a three-level DBMS architecture*","authors":"S. Navathe, Johann Lemke","doi":"10.1109/MARK.1979.8817084","DOIUrl":"https://doi.org/10.1109/MARK.1979.8817084","url":null,"abstract":"The ANSI/X3/SPARC study group on database management systems 2 as well as some independent researchers 17 , 10 have proposed a three-level \"coexistence\" architecture to database management systems. Under this approach (see Figure 1 ) a number of different users can be supported by means of different External Schemas, possibly with different data models and languages. It involves construction of a conceptual schema which completely represents the structure and semantics of a particular database. The underlying internal schema must provide a storage representation for the conceptual schema. Although the composition and scope of the conceptual schema is still a matter of controversy, 1 several data models, semantic models (e.g., References 7 , 8 , 9 , 13 , 16 , 20 , 21 ) etc. could be considered as candidates for defining conceptual schema. Given a particular model for the conceptual schema, a number of problems arise in its implementation into a three-level DBMS, particularly regarding the design of an internal schema specification language to specify the mapping of the model into storage.","PeriodicalId":341008,"journal":{"name":"1979 International Workshop on Managing Requirements Knowledge (MARK)","volume":"313 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121844964","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}

{"title":"Transportable image-processing software*","authors":"R. Hamlet, Azriel Rosenfeld","doi":"10.1109/MARK.1979.8817266","DOIUrl":"https://doi.org/10.1109/MARK.1979.8817266","url":null,"abstract":"The computations of image processing, like those of many technical disciplines, require substantial programs to perform. These programs are often organized into \"packages\" with the intent of making them easy for the (computer) novice to use. Access to a package of programs is an important resource, since its creation is beyond the capabilities of all but a few research groups. Unfortunately, while packages are invaluable, they could often be improved in the following ways: 1. They could be easier to use. The intellectual task of communication with the package is too difficult, the commands too peculiar and errors too easy to make. When things go wrong, very little help is available. 2. They could make more efficient use of the underlying machine and its operating system. A package may use very sophisticated algorithms for its discipline-oriented operations, while at the same time using the most cumbersome mechanisms for controlling the resources of the machine. Its authors are seldom systems programming experts. 3. They could be easier to move from machine to machine. In the process of getting the package to work at all, many peculiarities of the programming language (in its local implementation) and the local system become entwined in the code and getting it to run elsewhere may be difficult or impossible. 4. They could be easier to understand, modify and extend. To add a new routine or alter the behavior of an existing one may not be too difficult for the program’s author, but for others it may be impossible. If many changes are made independently, combining them without conflict is difficult.","PeriodicalId":341008,"journal":{"name":"1979 International Workshop on Managing Requirements Knowledge (MARK)","volume":"512 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127581782","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}

{"title":"A Markovian model for reliability and other performance measures of software systems*","authors":"A. Goel, K. Okumoto","doi":"10.1109/MARK.1979.8817248","DOIUrl":"https://doi.org/10.1109/MARK.1979.8817248","url":null,"abstract":"Several studies have been undertaken in recent years to investigate the software failure phenomenon, with the objective of developing analytical models for quantitative assessment of software performance. Most of these studies assume that the times between software failures follow an exponential distribution with a failure rate that depends on the number of errors in the system (see, for example, Jelinski and Moranda, 5 Littlewood and Verrall 6 and Shooman 11 ). A key assumption made in most of these studies is that the errors are removed with certainty when detected. However, as pointed out in Miyamoto 7 and Thayer et al., 12 errors are not always corrected when detected. The existing models do not provide a solution for such situations.","PeriodicalId":341008,"journal":{"name":"1979 International Workshop on Managing Requirements Knowledge (MARK)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117191559","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}

{"title":"A fail-safe distributed local network for data communication*","authors":"J. Liu, I. Suwa, R. Stepp, Sergio M. Hinojosa, Tsutoma Utsuqi","doi":"10.1109/MARK.1979.8817274","DOIUrl":"https://doi.org/10.1109/MARK.1979.8817274","url":null,"abstract":"We are concerned here with the design of an interconnection network for communication between terminals and computers in local distributed computer systems. By a local system, we mean one in which computers and terminals are concentrated in a relatively small area (e.g., with distance between terminals < 100 Km) and interconnected by communication links with relatively large bandwidth (e.g., up to 10 Mb/sec.). By a distributed network, we mean one in which the control of communication network is distributed among the computers and terminals. For our discussions, there is no need to distinguish terminals from computers. Hereafter, we shall refer to them simply as stations.","PeriodicalId":341008,"journal":{"name":"1979 International Workshop on Managing Requirements Knowledge (MARK)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131788130","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}

{"title":"A stochastic state space model for prediction of product demand","authors":"W. Cave, Evelyn Rosenkranz","doi":"10.1109/MARK.1979.8817083","DOIUrl":"https://doi.org/10.1109/MARK.1979.8817083","url":null,"abstract":"This paper is concerned with the development of a fixed price, supply/demand market model which can be used to predict demand for customer premises telephone equipment. A state space approach is used to model system dynamics and a Kalman filter is used for estimation. The model is nonlinear, and provides for nonstationary statistical characterization of the elements. The formulation indicates theoretically that, given perfect input (driving force) data, predictions could be highly inaccurate using linear models (even if they are dynamic) or nonlinear models which assume stationary statistics. The conceptual framework afforded by state space provides a vehicle for structuring more accurate models to predict product demand than do conventional approaches. Finally, the general model is suitable for predicting product demand in a wide range of markets.","PeriodicalId":341008,"journal":{"name":"1979 International Workshop on Managing Requirements Knowledge (MARK)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116352590","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}

{"title":"System considerations for predicting mass storage subsystem behavior","authors":"E. J. McBride, A. B. Tonik, G. R. Finnin","doi":"10.1109/MARK.1979.8817148","DOIUrl":"https://doi.org/10.1109/MARK.1979.8817148","url":null,"abstract":"We are always interested in predicting the performance of systems and/or subsystems. A \"typical\" question is: \"Is the most important component of system performance the way mass storage subsystems behave?\" The answer is yes, most of the time.","PeriodicalId":341008,"journal":{"name":"1979 International Workshop on Managing Requirements Knowledge (MARK)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129632126","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}