ppxscal/embedding_network huggingface dataset:
Coupling application design and user interface design
Authors: Dennis J. M. J. de Baar, James D. Foley, Kevin E. Mullet
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Building an interactive application involves the design of both a data model and a graphical user interface (GUI) to present that model to the user. These two design activities are typically approached as separate tasks and are frequently undertaken by different individuals or groups. Our apporach eliminated redundant specification work by generating an interface directly from the data model itself. An inference engine using style rules for selecting and placing GUI controls (i.e., widgets) is integrated with an interface design tool to generate a user interface definition. This approach allows a single data model to be mapped onto multiple GUI's by substituting the appropriate rule set and thus represents a step toward a GUI-independent run-time layout facility.
Real-time knowledge-based control systems
Authors: Marcel Schoppers
Venue: Communications of the ACM (1991)

This special section is the outgrowth of a workshop on real-time knowledge-based control systems, held during the 1990 national conference of the American Association for Artificial Intelligence (AAAI). The workshop was motivated by the recognition that constructing robotic systems capable of autonomous, flexible, intelligent behavior is an inherently interdisciplinary task. In particular, professionals from the fields of artificial intelligence (AI), control theory, process control and real-time scheduling were invited. To facilitate communication among these fields, the workshop organizers decided to focus on software design principles for real-time systems, and so sought out those who had built working systems and could express their experiences in terms of techniques they had tested and/or refuted.
Monte Carlo simulation of the Ising model and random number generation on the vector processor
Authors: Nobuyasu Ito, Yasumasa Kanada
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

The Monte Carlo simulation of the Ising model on the vector processor is discussed. This paper includes all the stages to use the vector processor, that is, the development of the vectorizable algorithm, implementation, tuning and several tests necessary to the large scale computations. Our machine is the HITAC S820/80. The maximum simulation speed is 0.93 x 109 spins per second for the ferromagnetic Ising models on a simple cubic lattice. Our algorithms are, however, applicable to other vector processors. The random number generation algorithms are also explained in this paper. Our generator can produce 0.62 x 109 32-bit random integers per second. The results of the randomness tests which uses the two-dimensional Ising model are presented.
Asymptotic Analysis of a Heterogeneous Multiprocessor System in a Randomly Changing Environment
Authors: János Sztrik, Demetres Kouvatsos
Venue: IEEE Transactions on Software Engineering (1991)

An asymptotic queuing theoretic approach is proposed to analyze the performance of an FCFS (first-come, first-served) heterogeneous multiprocessor computer system with a single bus operating in a randomly changing environment. All stochastic times in the system are considered to be exponentially distributed and independent of the random environment, while the access and service rates of the processors are subject to random fluctuations. It is shown under the assumption of 'fast' arrivals that the busy period length of the bus converges weakly, under appropriate normalization, to an exponentially distributed random variable. As a consequence, main steady-state performance measures such as system throughput, mean delay time, expected waiting time, and mean number of active processors can be approximately determined. The reliability of the proposed method is validated by comparing the new approximations with known exact results.
Visualization '91 workshop report: scientific visualization environments
Authors: David M. Butler, Charles Hansen
Venue: ACM SIGGRAPH Computer Graphics (1992)

The Workshop on Scientific Visualization Environments at Visualization '91 was organized with several purposes in mind. First and foremost was to bring together widely dispersed researchers so they could share information in a relatively informal and interactive environment. The organizers believed this would establish working relationships between the participants, which was a second purpose. It was hoped that a workshop could generate a focus and identify important research directions in the field. Finally, we believed the workshop report could provide a useful overview to a broader audience.With these purposes in mind, we established two specific objectives: (i) review the state of the art and (ii) identify key research issues and directions. Reaching these objectives in a short two day workshop would require an effective mechanism for organizing the discussions. The organizing principle we chose was a software design principle suggested by Dijkstra [ 1 ] some twenty years ago: the notion of an abstract machine. We considered a visualization environment as a special purpose, very high level computer ideally suited to the needs of scientific visualization. We then organized the workshop discussions around the questions of what the memory (data types), instruction set (operations) and control mechanisms (programming interfaces) of this machine might be.Using this organizing principle, we established the following agenda: Monday morning: position statements. Each participant presented a ten minute summary of their position paper Monday afternoon: data types and interfaces What are the (abstract) data types on which a visualization environment is based? What are the interfaces for importing and exporting data from the environment? Tuesday morning: control structures and architecture What are the mechanisms for sequencing and combining the primitive operations provided by the data types. What are the interaction and programming interfaces to the environment? Tuesday afternoon early: reference model Do we understand visualization environments well enough to construct a useful general model of their structure and function? Tuesday afternoon late: other issues and summary What issues are not addressed in the other sections? What have we accomplished? For each section we followed a simple procedure. The organizers presented introductory remarks consisting of a brief review of the state of the art and identification of research issues. The introductory remarks served as a starting point for discussions which followed. Participants were given copies of the organizers' remarks and asked to take notes for contribution to the report. The notes were collected at the end of the workshop and collated into this report. In addition, participants reviewed the first draft of the report and made additional contributions.
Stochastic Automata Network of Modeling Parallel Systems
Authors: Brigitte Plateau, Karim Atif
Venue: IEEE Transactions on Software Engineering (1991)

A methodology for modeling a system composed of parallel activities with synchronization points is proposed. Specifically, an approach based on a modular state-transition representation of a parallel system called the stochastic automata network (SAN) is developed. The state-space explosion is handled by a decomposition technique. The dynamic behavior of the algorithm is analyzed under Markovian assumptions. The transition matrix of the chain is automatically derived using tensor algebra operators, under a format which involves a very limited storage cost.
A Disciplined Approach to Office Analysis
Authors: V. De Antonellis, B. Zonta
Venue: IEEE Transactions on Software Engineering (1990)

To define office requirements, the authors propose a disciplined language in which a good portion of conventionality and known and concrete concepts are associated with a minimum formalism. The language can be used in analyzing an office for the purpose of designing a computer-based office support system. Given the language, the designer can organize information obtained by people working in the office and state the office requirements that will be the basis for developing a suitable system. The features of the language are illustrated and its morphology and syntax are explained.
A Network Flow Approach to the Reconfiguration of VLSI Arrays
Authors: Bruno Codenotti, Roberto Tamassia
Venue: IEEE Transactions on Computers (1991)

A technique for reconfiguring a two-dimensional VLSI array with faulty cells is presented. A network flow model of the problem is used to provide an algorithm for connecting the functional cells of the array so that they simulate a fault-free array of smaller size. The interconnection wires are routed inside horizontal and vertical channels according to the Manhattan model. Experimental results indicate that the algorithm has good performance in practice.
Processor networks and interconnection networks without long wires (extended abstract)
Authors: Richard Beigel, Clydel P. Kruskal
Venue: ACM SIGARCH Computer Architecture News (1991)

One processor network that is especially attractive for parallel processing is the Butterfly network. A very closely related interconnection network is the Bidelta (or Omega) network. It is well known how to lay out these networks with minimal area, but these layouts use long wires. We show how to lay them out with optimal area and short wires. We also introduce the Mesh-Connected Cycles network, which has optimal area (in the sense of AT2) for a broad range of running times when executing "ascend-descend" algorithms. The length of its longest wire is nearly optimal, and its layout area has very modest constants.
A cooperative software development paradigm for content analysis-based psychology research procedures (abstract)
Authors: Rita M. D'Arcangelis, Lynn L. Peterson
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Results from a pilot study of the Worst Event Test (WET), a computer-aided content analysis-based procedure developed jointly by members of The University of Texas Southwestern Medical Center at Dallas Department of Psychiatry and members of The University of Texas at Arlington Department of Computer Science Engineering, suggest that a semi-automated content analysis is feasible for studying the relationship of cognitive distortion to depression, and is preferable to manual procedures. The cooperative, evolutionary software development approach which emerged from the WET may be seen as a paradigm useful in assisting in the development of other initially ill-defined psychology research procedures, and has the potential to benefit psychology researchers who might find manual development tasks prohibitive in terms of time and cost. The development of the WET, a multi-step procedure containing an initially ill-defined information system as well as human reasoning processes to be determined and standardized, was divided into three phases: (1) achievement of component reliability, (2) system prototype testing, and (3) integration. Each phase corresponded to a known psychology research need, and determined both knowledge engineering and information system design activities required. Software design and development were carried on concurrently with cyclic psychology procedure development, facilitating vital interaction between psychology activities, knowledge engineering activities, and information system design. Rapidly prototyped software provided timely development assistance for the psychology researchers at each step, as well as software usable during system prototype testing. Following procedure validation, the kernel software will be integrated with other data-handling processes specified during high-level information system design to create a custom workstation environment for psychology researchers engaged in similar research.
Performance analysis of indoor multipath interfered packet radios at the presence of capture effect
Authors: Michael T. Tang, Jyh-Horng Wen
Venue: ACM SIGCOMM Computer Communication Review (1991)

In this paper, the effect of indoor multipath interference on the performance of a random access technique, viz., slotted ALOHA is studied. Key performance measures channel throughput and mean packet delay are derived via minislot approximation. These results turn out to be very accurate and have been verified by means of computer simulations. Signal capture effect is taken into consideration in evaluating the successful packet reception probability for the purpose of practical application. Examples are also given to demonstrate the actual effect of the technique.
The information grid: a framework for information retrieval and retrieval-centered applications
Authors: Ramana Rao, Stuart K. Card, Herbert D. Jellinek, Jock D. Mackinlay, George G. Robertson
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

The Information Grid (InfoGrid) is a framework for building information access applications that provides a user interface design and an interaction model. It focuses on retrieval of application objects as its top level mechanism for accessing user information, documents, or services. We have embodied the InfoGrid design in an object-oriented application framework that supports rapid construction of applications. This application framework has been used to build a number of applications, some that are classically characterized as information retrieval applications, others that are more typically viewed as personal work tools.
What information systems graduates are really doing: an update
Authors: Catherine M. Beise, Thomas C. Padgett, Fred J. Ganoe
Venue: ACM SIGCPR Computer Personnel (1991)

This paper reports results from a survey of IS graduates of twenty-two bachelor's level IS programs across the United States. The survey asked the graduates about their current positions: type of organization, type of work, major duties, salary, and certification. In addition, the survey asked about specific courses and their relevance to the respondents' current work. The results of the study should help human resource professionals in evaluating prospective IS employees and in career development for IS professionals.
Simulation of enhanced injection split gate flash EEPROM device programming
Authors: S. Keeney, J. Van Houdt, G. Groeseneken, A. Mathewson
Venue: Microelectronic Engineering (1992)

The recent trend of mixed technology processes for versatile chip design has prompted the need for 5 V only CMOS compatible non-volatile memory devices. However, for high-speed applications flash EEPROM devices are generally used but often require external power supplies for the writing cycles. The High Injection MOS (HIMOS) cell can be programmed at high speed with a 5 V power supply and so is promising for low-density high-speed applications where only a single power supply is available. To aid in the design and optimisation of the HIMOS device a 2-D numerical device simulator HFIELDS has been adapted to simulate the hot-electron injection currents. This is the first time that numerical simulations of a split gate type flash EEPROM device have been reported and comparisons with measured data show good agreement.
An annotated bibliography on object-orientation and deduction
Authors: Stefan Conrad, Martin Gogolla
Venue: ACM SIGMOD Record (1992)

This note tries to briefly survey research activities and results on the integration of object-oriented concepts and deductive database languages.
The Lincoln Continuous Speech Recognition system: recent developments and results
Authors: Douglas B. Paul
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

The Lincoln stress-resistant HMM CSR has been extended to large vocabulary continuous speech for both speaker-dependent (SD) and speaker-independent (SI) tasks. Performance on the DARPA Resource Management task (991 word vocabulary, perplexity 60 word-pair grammar) [1] is 3.4% word error rate for SD training of word-context-dependent triphone models and 12.6% word error rate for SI training of (word-context-free) tied mixture triphone models.
SDE: Incremental Specification and Development of Communications Software
Authors: Haruhisa Ichikawa, Masaki Itoh, June Kato, Akira Takura, Masashi Shibasaki
Venue: IEEE Transactions on Computers (1991)

A technique for applying formal message sequence specifications to the full definition of systems is presented. The technique supports automatic transformation of message sequence descriptions into communicating process descriptions that implement the sequences. It also supports hierarchical verification of protocols in the message sequences and process descriptions. Both a language for message sequence description, SAL, and a design support environment, SDE, have been developed based on the proposed technique. To collectively and hierarchically describe message sequences, SAL can compose message sequences from message sequence elements. By adding SAL descriptions, SDE supports the incremental specification and development of communications software: consistency between the added sequences and existing software is verified, and the existing software is automatically updated. This support especially contributes to the efficient maintenance of communications software. The feasibility and usefulness of the proposed technique are demonstrated by experimental application of SDE to PBX.
Pattern-based tree attribution
Authors: Charles Farnum
Venue: Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1992)

Attribute grammars have been used for many language-oriented tasks, including the formal description of semantics and the implementation of compilation tasks from simple type checking through code generation. Despite their successful use, attribute grammars have some disadvantages, including the monolithic nature of the grammar and the fixed factoring of all attribute descriptions by a single set of grammar productions. Attribute pattern sets provide a more expressive attribution system by using pattern matching, instead of grammar productions, to perform case analysis. Attribute pattern sets can be implemented in terms of attribute grammars in a way that maintains the dependency structure of the attribute system, making it straightforward to convert many of the practical results from attribute grammar theory to similar results for attribute pattern sets.
The competitiveness of on-line assignments
Authors: Yossi Azar, Joseph (Seffi) Naor, Raphael Rom
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

Consider the on-line problem where a number of servers are ready to provide service to a set of customers. Each customer's job can be handled by any of a subset of the servers. Customers arrive one-by-one and the problem is to assign each customer to an appropriate server in a manner that will balance the load on the servers. This problem can be modeled in a natural way by a bipartite graph where the vertices of one side (customers) appear one at a time and the vertices of the other side (servers) are known in advance. We derive tight bounds on the competitive ratio in both deterministic and randomized cases. Let n denote the number of servers. In the deterministic case we provide an on-line algorithm that achieves a competitive ratio of k = [log2 n] (up to an additive 1) and prove that this is the best competitive ratio that can be achieved by any deterministic on-line algorithm. In a similar way we prove that the competitive ratio for the randomized case is k=ln(n) (up to an additive 1). We conclude that for this problem, randomized algorithms differ from deterministic ones by precisely a constant factor.
Performance comparison of routing protocols under dynamic and static file transfer connections
Authors: A. Udaya Shakar, Cengiz Alaettinoğlu, Klaudia Dussa-Zieger, Ibrahim Matta
Venue: ACM SIGCOMM Computer Communication Review (1992)

We compare the performance of two recently proposed distance-vector algorithms (Merlin-Segall and Extended Bellman-Ford) with a link-state algorithm (SPF), under varying file transfer workload. (Unlike the traditional distance-vector algorithms, these new distance-vector algorithms do not suffer from long-lived loops.) Our comparison is done using a recently developed network simulator. MaRS. We consider both dynamic and static file transfer connections, and both uniform and hotspot distributions of source-sink pairs. Our conclusion is that Extended Bellman-Ford performs as well as SPF in terms of delay and throughput. This suggests that distance-vector algorithms are appropriate for very large wide-area networks, since their space requirements are less than that of link-state algorithms.
Algebraic Description of Curve Structure
Authors: Hirobumi Nishida, Shunji Mori
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The authors propose a compact and concise method of describing curves in terms of the quasi-topological features and the structure of each singular point. The quasi-topological features are the convexity, loop, and connectivity. The quasi-topological structure is analyzed in a hierarchical way, and algebraic structure is presented explicitly for each representation level. The lower-level representations are integrated into the higher-level one in a systematic way. When a curve has singular points (branch points), the curve is decomposed into components, where each is a simple arc or a simple closed curve, by decomposing each singular point. The description scheme is applied to character recognition.
The design and maintenance of the Andrew help system: providing a large set of information to a large community of users
Authors: Ayami Ogura, Terilyn Gillespie
Venue: ACM SIGCHI Bulletin (1991)

In developing the Andrew Help System, we considered the following design goals: bull; The Help System must access a very large set of information quickly and easily bull; The Help System must be flexible and accomodate all levels of usersThe system must be easy to use for beginnersThe system must be robust enough for experts bull; The Help System must display multiple document formats on different terminal types bull; The Help System must be hypermedia-based, with links, cross-references, and multiple windows, displaying both text and graphics
Applications of a poset representation to edge connectivity and graph rigidity
Authors: Harold N. Gabow
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

A poset representation for a family of sets defined by a labeling algorithm is investigated. Poset representations are given for the family of minimum cuts of a graph, and it is shown how to compute them quickly. The representations are the starting point for algorithms that increase the edge connectivity of a graph, from lambda to a given target tau = lambda + delta , adding the fewest edges possible. For undirected graphs the time bound is essentially the best-known bound to test tau -edge connectivity; for directed graphs the time bound is roughly a factor delta more. Also constructed are poset representations for the family of rigid subgraphs of a graph, when graphs model structures constructed from rigid bars. The link between these problems is that they all deal with graphic matroids.
Quantifying knowledge complexity
Authors: Oded Goldreich, Erez Petrank
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

Several alternative ways of defining knowledge complexity are presented, and the relationships between them are explored. The discussion covers inclusion results, separation results, properties of knowledge complexity of languages in the Hint sense, and the knowledge complexity of constant round AM proofs.