ppxscal/embedding_network huggingface dataset:
The Stack Growth Function: Cache Line Reference Models
Authors: M. Kobayashi, M. H. MacDougall
Venue: IEEE Transactions on Computers (1989)

To model cache behavior in a multiprogramming environment, it is necessary to know the number of distinct lines referenced in an execution interval. The stack growth function (SGF) relates the mean number of references (or instructions) to the number of distinct lines referenced; it can be viewed as the inverse function of the mean working set size. A fast, one-pass algorithm to compute the SGF for a given referenced string is presented. SGFs measured for some 40 real programs show that a simple exponential model fits the SGFs reasonably well over a range of execution intervals. Parameters of the inverse exponential model are presented for several program mixes and cache line sizes of 32 and 64 bytes. Separate instruction and data SGFs also are examined, and execution interval distribution effects are considered.
Set oriented retrieval
Authors: A. Bookstein
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

The broad way in which we look at how an IRS functions influences the types of questions we ask about it and the ways we try to improve performance. In the recent past, retrieval methodologies have been based on retrieving documents one at a time. In this paper we are introducing a set oriented view. We observe that this view is quite consistent with the single-document or sequential methods, and define a precise model to capture the set-oriented approach. We then examine a number consequences of the model, such as the limitations implied by a finite index vocabulary. Finally, we discuss various ways in which the set orientation can influence our thinking about IR.
Combining produce and consume operations in a pipelined shared memory multiprocessor
Authors: B. J. Rodriquez, H. F. Jordan
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

A technique for combining produce and consume operations is proposed. An Omega network was designed to work with a pipelined micro multiprocessor system, and each of its nodes to be implemented on a single chip. Without a significant increase in hardware complexity, the nodes combine produce and consume messages in an unbounded way. The combining technique that was developed guarantees that every produce and consume message that is combined will always succeed, adding a new benefit to combining. Results of several simulation runs are presented.
Using spreadsheet software to support metric's life cycle activities
Authors: P. Kokol
Venue: ACM SIGPLAN Notices (1989)

The application of the spreadsheet software in the field of software measurement technology is disccussed. A model of metric's life cycle is defined and used together with the spreadsheet software to develop a new class of complexity metrics, called Hybrid metrics. Theirs evaluation has shown that they are supperior to most other complexity metrics in estimating development times and allocating testing resources. Finally, the spreadsheet and conventional programming are compared, and it is not unreasonable to state that spreadsheet better supports activities performd during metric's life cycle then conventional programming.
Self-assessment procedure XXI: a self-assessment procedure on concurrency
Authors: Brain A. Rudolph
Venue: Communications of the ACM (1990)

A self-assessment procedure on concurrency
Interface Optimization: An Algorithm for the Detection of Data Path Redundancy and Reconfigurability Towards Obtaining Minimal Bus Interfaces
Authors: S. S. Rao, J. R. Isaac
Venue: IEEE Transactions on Computers (1989)

Interconnections of submodules of digital systems are normally achieved directly by connecting them to a bus through driver/receiver links. The authors present algorithms for the implementation of data transfer requirements of a system through indirect paths. A formal procedure for identifying the possible candidates for indirect path realization is reported. A procedure is proposed for optimizing the interconnections in a digital system using both indirect and direct paths. It serves as an effective design tool in LSI/VLSI realization of digital systems.
Evaluation of mental models and meta models through interactions between users and helpers about software usage problems
Authors: Parto Dehdashti
Venue: ACM SIGCHI Bulletin (1988)

This research investigates the concept of mental models by concentrating on the conversations between student users who as a result of encountering a problem on a software ask for assistance from student helpers who are assigned to support computer use. The research question is whether a human helper provides appropriate help for the user (problem solved in user's mind) if the helper understands the problem and the software from the user's view in addition to his/her own. A user's understanding of a software, user's mental model, and a helper's understanding of a user's understanding of that software, helper's meta model, are compared through software characteristics: objects, syntax, semantics, and actions.
PRECOMAS an implementation of constructive matching methodology
Authors: M. Franová
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

The system PRECOMAS (PRoofs Educed by COnstructive MAtching for Synthesis) implements the Constructive Matching methodology for automatic constructions of programs from formal specifications. In this paper we describe briefly the goal of PRECOMAS, its logical background and the CM method applied to proving atomic formulae. We show how the user of our system is involved in solving a program synthesis problem. We show that this interaction does not concern the problem of guiding the program synthesis process, this being solved by CM. Our experimental version serves to confirm that the system is worth to be developed.
First experimental results of an E-beam tester with dispersive secondary electron energy analyzer
Authors: Luc Dubbeldam, Pieter Kruit
Venue: Microelectronic Engineering (1988)

The experimental results with a new spectrometer for e-beam testing are presented. This spectrometer does not only detect the electrons transmitted through a retarding grid in one channel but it also detects the by that grid reflected electrons in another channel. From these two signals the topographical information and the voltage information can be separated. The secondary electrons are guided by the magnetic field of the immersion objective lens to an energy analyser between the condensor lenses and the objective lens. The electron energies are analysed by a combination trochoidal motion - retarding field analyser. We will present the signal of the two channels as function of the sample potential and we will demonstrate the voltage contrast isolation in a simple experiment.
AMp: a highly parallel atomic multicast protocol
Authors: P. Veríssimo, L. Rodrigues, M. Baptista
Venue: ACM SIGCOMM Computer Communication Review (1989)

This paper deals with the problem of reliable group communication for distributed applications, in the context of the Reliable Broadcast class of protocols. An atomic multicast protocol for token passing Lans is presented. The actual implementation is on an 8802/4 Token-bus, although it is applicable to 8802/5 Token-rings and the FDDI Fibre-Optic network. The simplicity and efficiency of reliable broadcast protocols may be considerably improved, if the system fault model is restricted or convenient architectures are used. Fail-controlled communication components are used here to build an efficient reliable multicast protocol on top of the exposed MAC interface of a VLSI Lan controller. The architecture is built on standard Lans, in view of taking advantage of the availability of communications hardware and the possibility of coexistence with standard stations, in the same network. The service offered allows transparent multicasting inside logical groups, which are dynamically created and updated. The primitive is highly parallel and provides atomic agreement and consistent delivery order, respecting logical precedence. These features are an important contribution for the implementation of high performance distributed computing systems.
The Sigma network
Authors: K. Saito
Venue: ACM SIGCOMM Computer Communication Review (1987)

The Sigma network is one of the most important element of the Sigma system which is designed to improve productivity of a software. The Sigma network has been developed in order to establish a infrastructure which acts as development environment provided by logically integrated Sigma workstations spread over various companies and inside the companies which approve the concept of the Sigma system. It is also included in the scope of its development to enrich application programs mainly for message communication required by network community. The network supports IEEE802.3, digital packet exchange (X.25) and serial line under the TCP/IP layer and realizes end-to-end immediate communication. Sigma network is a name oriented virtual network defined by hierarchical name space (domain) and named objects placed under the domains. Its key feature lies in the network management mechanism, i.e. Name Server.
The complexity of planar compliant motion planning under uncertainty
Authors: B. R. Donald
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

We consider the computational complexity of planning compliant motions in the plane, given geometric bounds on the uncertainty in sensing and control. We can give efficient algorithms for generating and verifying compliant motion strategies that are guaranteed to succeed as long as the sensing and control uncertainties lie within the specified bounds. We also consider the case where a compliant motion plan is required to succeed over some parametric family of geometries. While these problems are known to be intractable in 3D, we identify tractable subclasses in the plane.
Object-oriented configuration control
Authors: V. Ambriola, L. Bendix
Venue: Proceedings of the 2nd International Workshop on Software configuration management (1989)

In this paper we show how configuration management and version control can be integrated and automated. Our approach is to use an object-oriented paradigm for the environment and to consider dependencies between modules to be a property local to every single version rather than a global property of the whole version group. In our proposed model configuration control depends on the dynamic evolution of the system rather than on a static description.
Temporal logic programming is complete and expressive
Authors: M. Baudinet
Venue: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1989)

This paper addresses semantic and expressiveness issues for temporal logic programming and in particular for the TEMPLOG language proposed by Abadi and Manna. Two equivalent formulations of TEMPLOG's declarative semantics are given: in terms of a minimal Herbrand model and in terms of a least fixpoint. By relating these semantics to TEMPLOG's operational semantics, we prove the completeness of the resolution proof system underlying TEMPLOG's execution mechanism. To study TEMPLOG's expressiveness, we consider its propositional version. We show how propositional TEMPLOG programs can be translated into a temporal fixpoint calculus and prove that they can express essentially all regular properties of sequences.
Computerization, productivity, and quality of work-life
Authors: Robert E. Kraut, Susan T. Dumais, Susan Koch
Venue: Communications of the ACM (1989)

The impact of a computerized record system on the work lives of customer service representatives in a large utility company is examined. The results suggest alternate methods for thinking about and measuring technological impact.
Robust transaction routing in distributed database systems
Authors: Y. H. Lee, P. S. Yu, A. Leff
Venue: Proceedings of the first international symposium on Databases in parallel and distributed systems (2000)

In this paper, we examine the issue of robust transaction routing in distributed database systems. A class of dynamic routing strategies which use estimated response times to make routing decisions is studied in details. Since response time estimation and decision making depend on the assumed transaction model and parameters, it is important to examine the robustness or sensitivity to the inaccuracy in the assumptions and parameter values. Through simulations, we find that the dynamic routing strategy based strictly on response time is too aggressive in sharing loads and makes too many non-preferred system routings. It is robust with respect to change in the number of database calls per transaction, but is relatively sensitive to the distribution of database calls. Two refinements are proposed which improve system performance as well as robustness of routing decisions.
A hybrid expert system combining AI techniques with a neural-net
Authors: M. E. Ulug
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

This paper proposes an architecture for hybrid expert systems that combines AI techniques with a neural-net. These interactive hybrid expert systems are more powerful than existing systems because they can have a premise the veracity of which depends on the recognition of an object/curve/pattern.The operation of a hybrid expert system using a neural-net is described. This expert system is intended to be a diagnostic tool in a nuclear energy generation application. The architecture of a special neural-net designed for curve/object recognition is discussed.
A DEVS-scheme simulation of an electronic meeting system
Authors: M. W. Aiken, G. Hayes
Venue: ACM SIGSIM Simulation Digest (1989)

Electronic Meeting Systems (EMS) facilitate group meetings by providing automated support for communicating, decison-making, and consensus-building. This paper presents an approach for building EMS through a quantitative description of two well-known approaches: Electronic Brainstorming and the Nominal Group Technique. A DEVS-Scheme simulation of these two tools provides an additional conceptual foundation for the construction of EMS tools.
A modeling perspective for meteor burst communication
Authors: B. C. Healy, W. H. Shaw, J. R. Litko
Venue: Proceedings of the 21st conference on Winter simulation (1989)

This paper describes the design and development of a methodology to analyze Meteor Burst Communication (MBC) networks. A decision support system was developed that provides a simulation model for any single or multiple-link MBC network. This model runs on a micro-computer and consists of two distinct components. The first component uses engineering parameters to compute intermediate queueing characteristics used by a discrete event simulation component. The simulation component provides point estimates for throughput, message delay, and resource utilization in tabular and graphical form. The MBC process is shown to be a M/G/1 queue with server vacations. Analytical equations and empirical data were both used to validate the MBC performance model. The modeling perspective presented in this research represents a new and robust method for analyzing MBC networks. Adaptive message routing, flood routing, and priority message traffic are discussed. By separating the engineering parameters of the MBC network from the simulation code, portability, ease of use, and conceptual simplicity was achieved. This research demonstrates the successful marriage of complex communication system engineering with queueing theory and simulation models to produce a highly productive analysis tool.
GERTIS: a Dempster-Shafer approach to diagnosing hierarchical hypotheses
Authors: John Yen
Venue: Communications of the ACM (1989)

Gertis&mdash;a prototype expert system&mdash;not only demonstrates the feasibility of applying the Dempster-Shafer-based reasoning model to diagnosing hierarchically related hypotheses, but also suggests ways to generate better explanations by using knowledge about the structure of the hypothesis space and knowledge about the intended effects of the rules.
Non-singular concepts in natural language discourse
Authors: Tomek Strzalkowski, Nick Cercone
Venue: Computational Linguistics (1989)

We introduce a new approach to representing and manipulating various types of non-singular concepts in natural language discourse. The representation we describe is based on a partially ordered structure of levels in which the objects of the same relative singularity are assigned to the same level. Our choice of the representation has been motivated by the following main concerns: 1. The representation should systematically distinguish between those language terms that are used to refer to objects of different singularity, that is, those classified within different but related levels of the model; 2. The representation should capture certain types of inter-sentential dependencies in discourse, most notably anaphoric-type cohesive links; 3. Finally, the representation should serve as a basis for defining a formal semantics of discourse paragraphs that would allow for capturing the exact truth conditions of sentences involving non-singular terms, and for computing interlevel inferences. In this paper we discuss (1) and (2) only. (3) is currently under investigation and will be the topic of a forthcoming article. We believe that our approach promotes computational feasibility, because we avoid the identification of general terms, like "temperature," "water," etc., with intensions, that is, functions over possible worlds. In our theory, the concept of non-singularity has a local (often subjective) character.
Male/female programmer and systems analyst Job performance
Authors: T. C. Willoughby, J. A. Hughes
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

Differential psychologists have long reported that there are some male/female performance differences. For reasons that are not so well established, males tend to have better quantitative skills while females have better language and social skills (Anastasia, 1958). The various tests that have been developed over the years to select programmers have centered upon quantitative skills as a significant predictor of programmer success (Willoughby, 1972). Shrout, 1971, found that written, oral and social communication skills were the most important skills of a systems analyst. Therefore, it was our hypothesis that males should perform better as programmers and females better as systems analysts. A Fortune 100 company made available the performance ratings of its programmers and systems analysts. The data is summarized in Table 1. One doesn't need an elaborate statistical argument to conclude that the expected differences did not occur. The hypothesis was rejected. The possible reasons for these results include: The populations of programmers and systems analysts are self selected in such a manner that male/female differences no longer occur. Willoughby (1971) reported that younger women data processors had interests very like males. This company's selection process could have eliminated the differences that might exist in the population. However, this organization used no tests in its selection process so any such result would be either accidental or perhaps based upon stereotypes. This alternative seems unlikely. Therefore, we believe the population of programmers and systems analysts are now so homogeneous in their skills so that selection, promotion or assignment based upon any differences that might exist in the general population is inappropriate. There is no reason to believe that selection based upon presumed male/female differences would result in superior performance.
Statemate: a working environment for the development of complex reactive systems
Authors: D. Harel, H. Lachover, A. Naamad, A. Pnueli, M. Politi, R. Sherman, a. Shtul-Trauring
Venue: Proceedings of the 10th international conference on Software engineering (1988)

This paper provides a brief overview of the STATEMATE system, constructed over the past three years by i-Logix Inc., and Ad Cad Ltd. STATEMATE is a graphical working environment, intended for the specification, analysis, design and documentation of large and complex reactive systems, such as real-time embedded systems, control and communication systems, and interactive software. It enables a user to prepare, analyze and debug diagrammatic, yet precise, descriptions of the system under development from three inter-related points of view, capturing, structure, functionality and behavior. These views are represented by three graphical languages, the most intricate of which is the language of statecharts used to depict reactive behavior over time. In addition to the use of state-charts, the main novelty of STATEMATE is in the fact that it `understands` the entire descriptions perfectly, to the point of being able to analyze them for crucial dynamic properties, to carry out rigorous animated executions and simulations of the described system, and to create running code automatically. These features are invaluable when it comes to the quality and reliability of the final outcome.
Tailoring object descriptions to a user's level of expertise
Authors: Cécile L. Paris
Venue: Computational Linguistics (1988)

A question answering program providing access to a large amount of data will be most useful if it can tailor its answers to each individual user. In particular, a user's level of knowledge about the domain of discourse is an important factor in this tailoring if the answer provided is to be both informative and understandable to the user. In this research, we address the issue of how the user's domain knowledge can affect an answer. By studying texts, we found that the user's level of domain knowledge affected the kind of information provided and not just the amount of information, as was previously assumed. Depending on the user's assumed domain knowledge, a description can be either parts-oriented or process-oriented. Thus the user's level of expertise in a domain can guide a system in choosing the appropriate facts from the knowledge base to include in an answer. We propose two distinct descriptive strategies that can be used in a question answering program, and show how they can be mixed to include the appropriate information from the knowledge base, given the user's domain knowledge. We have implemented these strategies in TAILOR, a computer system that generates descriptions of devices. TAILOR uses one of the two discourse strategies identified in texts to construct a description for either a novice or an expert. It can merge the strategies automatically to produce a wide range of different descriptions to users who fall between the extremes of novice or expert, without requiring an a priori set of user stereotypes.