ppxscal/embedding_network huggingface dataset:
Five principles for the formal validation of models of software metrics
Authors: Lem O. Ejiogu
Venue: ACM SIGPLAN Notices (1993)

The goal of software metrics is the improvement of the software process. Five principles are fundamental to the formal validation of models of software metrics:--Attribute Type--what attribute(s) of software behavior are we measuring?;The mathematical postulates of a measure function--a model must have the utility for comparison; this unique criterion must be passed by every effective model of measure;Metrical Vindication--applying the model directly to measure actual software module(s); how consistent and reliable are the results of the measures?;Feedback Effect--how does the metric help us to identify faults and errors (of design) or improve testing and maintenance; what is a metric if it is just a number?;Units of Measure--what are we measuring with respect to dimensions: size, length/depth, extent, degree of variation, degradation, etc.?; a measure without unit(s) is like a building without a roof.Without principles, there is nothing to validate. Every good science is a body of relevant principles. Some worked examples on some of these principles are presented. Some of these examples in a way, expose the failures or frustrations resulting from the applications of some models of measure presently being used in industry and science. Not every mathematical function can be used as a model of measurement.
Domain decomposition methods for circuit simulation
Authors: U. Kleis, O. Wallat, U. Wever, Q. Zheng
Venue: Proceedings of the eighth workshop on Parallel and distributed simulation (1994)

In this paper we discuss the application of domain decomposition methods to circuit simulation. This coarse grain parallelization guarantees a minimum of communication and thus achieves good speedup results on a workstation cluster. Our results show that with a cluster of ten powerful RISC workstations comparable turn around times to a supercomputer can be achieved. Furthermore a workstation cluster offers the possibility to simulate electric circuits with a size of new magnitude. On a cluster of 27 workstations we succeeded in simulating a circuit with 135000 transistors, while we failed to simulate the same circuit on our supercomputer because of a lack of memory.
A direct algorithm for type inference in the rank-2 fragment of the second-order &lgr;-calculus
Authors: A. J. Kfoury, J. B. Wells
Venue: Proceedings of the 1994 ACM conference on LISP and functional programming (1994)

We examine the problem of type inference for a family of polymorphic type systems containing the power of Core-ML. This family comprises the levels of the stratification of the second-order &lgr;-calculus (system F) by &ldquo;rank&rdquo; of types. We show that typability is an undecidable problem at every rank k&ge;3. While it was already known that typability is decidable at rank 2, no direct and easy-to-implement algorithm was available. We develop a new notion of &lgr;-term reduction and use it to prove that the problem of typability at rank 2 is reducible to the problem of acyclic semi-unification. We also describe a simple procedure for solving acyclic semi-unification. Issues related to principle types are discussed.
Alternating Sign Matrices and Some Deformations of Weyl's Denominator Formulas
Authors: Soichi Okada
Venue: Journal of Algebraic Combinatorics: An International Journal (1993)

An alternating sign matrix is a square matrix whose entries are 1, 0, or &minus;1, and which satisfies certain conditions. Permutation matrices are alternating sign matrices. In this paper, we use the (generalized) Littlewood's formulas to expand the products \prod \limits _{i=1}^n (1-tx_i)\ \prod \limits_{1 \le i \lt j \le n}\ (1-t^2 x_i x_j)(1-t^2x_i x_j^{-1}) \quad \rm and and \prod \limits _{i=1}^n (1-tx_i)(1+t^2x_i)\ \prod \limits_{1 \le i \lt j \le n}\ (1-t^2 x_i x_j)(1-t^2x_i x_i^{-1}) \quad as sums indexed by sets of alternating sign matrices invariant under a 180&deg; rotation. If we put t &equals; 1, these expansion formulas reduce to the Weyl's denominator formulas for the root systems of type Bn and Cn. A similar deformation of the denominator formula for type Dn is also given.
Interfaces and extended ML
Authors: Stefan Kahrs, Donald Sannella, Andrzej Tarlecki
Venue: ACM SIGPLAN Notices (1994)

This is a position paper giving our views on the uses and makeup of module interfaces. The position espoused is inspired by our work on the Extended ML (EML) formal software development framework and by ideas in the algebraic foundations of specification and formal development. The present state of interfaces in EML is outlined and set in the context of plans for a more general EML-like framework with axioms in interfaces taken from an arbitrary logical system formulated as an institution. Some more speculative plans are sketched concerning the simultaneous use of multiple institutions in specification and development.
On the perceptron learning algorithm on data with high precision
Authors: Kai-Yeung Siu, Amir Dembo, Thomas Kailath
Venue: Journal of Computer and System Sciences (1994)

We investigate the convergence rate of the perceptron algorithm when the patterns are given with high precision. In particular, using the result of A. Dembo (Quart. Appl. Math.47 (1989), 185-195), we show that when the n pattern vectors are independent and uniformly distributed over {+1, -1}^n^l^o^g^n, as n -> ~, with high probability, the patterns can be classified into all 2^n possible ways using perceptron algorithm with O(n log n) iteration. Further, the storage of parameters requires only O(n log^2n) bits. We also indicate some interesting mathematical connections with the theory of random matrices.
The cost structure of sensemaking
Authors: Daniel M. Russell, Mark J. Stefik, Peter Pirolli, Stuart K. Card
Venue: Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems (1993)

Making sense of a body of data is a common activity in any kind of analysis. Sensemaking is the process of searching for a representation and encoding data in that representation to answer task-specific questions. Different operations during sensemaking require different cognitive and external resources. Representations are chosen and changed to reduce the cost of operations in an information processing task. The power of these representational shifts is generally under-appreciated as is the relation between sensemaking and information retrieval. We analyze sensemaking tasks and develop a model of the cost structure of sensemaking. We discuss implications for the integrated design of user interfaces, representational tools, and information retrieval systems.
Management of interface design in humanoid
Authors: Ping Luo, Pedro Szekely, Robert Neches
Venue: Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems (1993)

Today's interface design tools either force designers to handle a tremendous number of design details, or limit their control over design decisions. Neither of these approaches taps the true strengths of either human designers or computers in the design process. This paper presents a human-computer collaborative system that uses a model-based approach for interface design to help designers on decision making, and utilizes the bookkeeping capabilities of computers for regular and tedious tasks. We describe (a) the underlying modeling technique and an execution environment that allows even incompletely-specified designs to be executed for evaluation and testing purposes, and (b) a tool that decomposes high-level design goals into the necessary implementation steps, and helps designers manage the myriad of details that arise during design.
Object-oriented approach to interconnecting trusted database management systems
Authors: Bhavani Thuraisingham, Harvey Rubinovitz
Venue: ACM SIGSAC Review (1993)

This position paper describes an object-oriented approach to connecting trusted database management systems. In particular, an object model of the heterogeneous environment, the operation of the system, and a possible approach to simulating the environment using object-oriented technology are discussed.
A Diffusion Mechanism for Obstacle Detection from Size-Change Information
Authors: Dario L. Ringach, Yoram Baram
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

A mechanism fur the visual detection of obstacles is presented. A new immediacy measure, representing the imminence of collision between an object and a moving observer, is defined. A diffusion process on the image domain, whose initial condition is determined by the motion field normal to the object's boundary, is shown to converge asymptotically to the immediacy measure. A network of locally connected cells, derived from a finite-difference approximation of the diffusion equation, estimates the immediacy measure from normal velocity and boundary information provided by a motion measurement and segmentation stage. The algorithm's performance on real image sequences is demonstrated.
Partial Difference Triples
Authors: Ka Hin Leung, Siu Lun Ma
Venue: Journal of Algebraic Combinatorics: An International Journal (1993)

It is known that a strongly regular semi-Cayley graph (with respect to a group G) corresponds to a triple of subsets (C, D, D&prime;) of G. Such a triple (C, D, D&prime;) is called a partial difference triple. First, we study the case when D &cup; D&prime; is contained in a proper normal subgroup of G. We basically determine all possible partial difference triples in this case. In fact, when \vert G\vert \neq 8 nor 25, all partial difference triples come from a certain family of partial difference triples. Second, we investigate partial difference triples over cyclic group. We find a few nontrivial examples of strongly regular semi-Cayley graphs when &verbar;G&verbar; is even. This gives a negative answer to a problem raised by de Resmini and Jungnickel. Furthermore, we determine all possible parameters when G is cyclic. Last, as an application of the theory of partial difference triples, we prove some results concerned with strongly regular Cayley graphs.
Design and implementation of the glue-nail database system
Authors: Marcia A. Derr, Shinichi Morishita, Geoffrey Phipps
Venue: ACM SIGMOD Record (1993)

We describe the design and implementation of the Glue-Nail database system. The Nail language is a purely declarative query language; Glue is a procedural language used for non-query activities. The two languages combined are sufficient to write a complete application. Nail and Glue code both compile into the target language IGlue. The Nail compiler uses variants of the magic sets algorithm, and supports well-founded models. Static optimization is performed by the Glue compiler using techniques that include peephole methods and data flow analysis. The IGlue code is executed by the IGlue interpreter, which features a run-time adaptive optimizer. The three optimizers each deal with separate optimization domains, and experiments indicate that an effective synergism is achieved. The Glue-Nail system is largely complete and has been tested using a suite of representative applications.
Routing reserved bandwith multi-point connections
Authors: Dinesh C. Verma, P. M. Gopal
Venue: Conference proceedings on Communications architectures, protocols and applications (1993)

Some important classes of multi-point bandwidth-intensive applications like video-conferencing with mixing and the distributed classroom can be characterized as consisting of a broadcast from a source node to several destinations nodes, and point-to-point flows from the destination nodes to the source node. Determining a tree in an arbitrary mesh network which satisfies the bandwidth constraints and minimizes the cost of reserved bandwidth is a NP-hard problem. In this paper, we look at some heuristics that can be used to solve the problem of routing these multi-point connections. The heuristics are based on finding the capacity-constrained minimum cost tree which minimizes the cost of bandwidth reserved for point-to-point communication from destinations to the source, and weights are assigned to minimize the number of extra nodes in the tree which increase the cost of bandwidth reserved from the source to the destination. A theoretical bound on the performance of some of the heuristics, as well as simulation results comparing their performance to that of the optimum solution are presented. The results are encouraging, the heuristics find a tree with a cost within 2% of the optimum on the average, and with a cost within 10% of the optimum in those cases when the heuristic fails to find the optimum tree.
A microcomputer implementation of an ER query and update interface
Authors: Bogdan D. Czejdo
Venue: ACM SIGSMALL/PC Notes (1993)

Several query languages have been proposed in which users graphically manipulate Entity-Relationship (ER) diagrams to formulate queries. In this paper we present a method of implementing an ER query and update language as an interface for a relational Database Management System. The approach is based on interactive manipulation of ER database schemas and generation of SQL expressions for an underlying relational database. The graphical query and update formulation process is formally defined. We assume that the information reflecting the current state of the query and update formulation process is maintained in a formal model. The model described in other publications is significantly modified and extended. The information included in the extended model allows an ER diagram corresponding to the current state of the query to be displayed on the terminal screen. It is also used to generate an equivalent SQL expression for a relational database. The integrity constraints for the formal model are specified.
Tutorial database mining
Authors: Rakesh Agrawal
Venue: Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1994)

We view database mining as the efficient construction and verification of models of patterns embedded in large databases. Many of the database mining problems have been motivated by the practical decision support problems faced by most large retail organizations. In the Quest project at the IBM Almaden Research center, we have focussed on three classes of database mining problems involving classification, associations, and sequences. In this tutorial, I will draw upon my Quest experience to present my perspective of database mining, describe current work, and present some open problems.
Algorithm 724; Program to calculate F-Percentiles
Authors: Roger W. Abernathy, Robert P. Smith
Venue: ACM Transactions on Mathematical Software (TOMS) (1993)

Let 0&larr; p &larr;1 be given and let F be the cumulative distribution function of the F-Distribution with (M, N,) degrees of freedom. This FORTRAN 77 routine is a complement to [1] where a method was presented to find the inverse of the F-Distribution function, FINV(M, N, P), using a series expansion technique to find the inverse for the Beta Distribution function.
Science, computational science, and computer science: at a crossroads
Authors: D. E. Stevenson
Venue: Proceedings of the 1993 ACM conference on Computer science (1993)

We describe computational science as an interdisciplinary approach to doing science on computers. Our purpose is to introduce computational science as a legitimate interest of computer scientists. We present a possible foundation for computational science. These foundations show that there is a need to consider computational aspects of science at the scientific level. We next present some obstacles to computer scientists' participation in computational science. We see a cultural bias in computer science that inhibits participation. Finally, we indicate areas of mutual interests between computational science and computer science.
Ring-connected hypercubes and their relationship to cubical ring connected cycles and dynamic redundancy networks
Authors: Isaac Yi-Yuan Lee, Sheng-De Wang
Venue: Proceedings of the 1993 ACM conference on Computer science (1993)

In this paper, we first present a 1-fault-tolerant (1-ft) hypercube model with degree 2r, the ring-connected hypercube (RCH), which has the lowest degree among all 1-ft, one spare node, r-dimensional hypercube architecture yet discovered. Then we propose a zero-time reconfiguration algorithm via an add-and-modulo automorphism. Furthermore, by introducing the equivalence from hypercubes to cube-connected cycles (CCC's) and to butterflies (BF's), we find there is also a corresponding equivalence from RCH's to cubical ring connected cycles (CRCC) and to dynamic redundancy networks (DRN's). From this fact, we find out that once a symmetric fault-tolerant structure has been discovered for one of the three models, then it can apply directly to the other hypercubic networks. Applying the technique, we find a degree 6, 1-ft Benes network. Another point is we think that the strong relationship between hypercubes, CCC's and BF's should be paid more attention, and finally from this equivalence relationship to the RCH's we propose three new bounded-degree k-ft models: k-ft CCC's, k-ft BF's, and k-ft Benes networks.
A systematic approach to multiple inheritance implementation
Authors: J. Templ
Venue: ACM SIGPLAN Notices (1993)

Multiple inheritance is commonly believed to increase the expressive power of a programming language, but to slow down efficiency of message sends even in case of single inheritance. This paper shows that none of these arguments hold. First, a technique to express the effect of multiple inheritance in terms of single inheritance is described. Based on this technique an efficient implementation of multiple inheritance is constructed. The resulting implementation does not slow down single inheritance and, in case of multiple inheritance, is more efficient than widely used implementations.
The complexity of connectivity problems on context-free graph languages
Authors: Egon Wanke
Venue: Journal of Computer and System Sciences (1994)

In a very general frame, we analyze the complexity of connectivity problems on sets of graphs defined by context-free graph rewriting systems under various restrictions. In particular, we show the following results: If L is the set of all context-free graph rewriting systems that define at least one disconnected graph (connected graph, respectively), then L is DEXPTIME-complete. For linear systems or systems that define only finite sets of graphs, L is PSPACE-complete. For linear systems that define finite sets of graphs, L is NP-complete. For deterministic systems the complexity class of L depends on the used graph grammar model. L is P-complete for simple context-free graph rewriting systems as for example hyperedge replacement systems, but NP-complete (co-NP-complete, respectively), for boundary node label controlled graph grammars and more powerful systems.
Searching for unity among diversity: exploring the &ldquo;interface&rdquo; concept
Authors: Kari Kuutti, Liam J. Bannon
Venue: Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems (1993)

Despite widespread interest in the human-computer interaction (HCI) field, there remains much debate as to appropriate conceptual frameworks for the field, and even confusion surrounding the meaning of basic terms in the field. HCI is seen by many as focusing on the design of interfaces to computer systems, yet exactly what is implied by this focus on &ldquo;interfaces&rdquo; is unclear. In this paper we show how a better understanding of what is meant by the interface is possible via the concept of abstraction levels. We show how this levels approach can clarify some ambiguities, and also how it can be related to different phases in the evolution of the human-computer interaction field itself. In this context, we are able to account for the recent interest in activity theory as a possible alternative framework for HCI work, while stressing the need for HCI research and design to consider each of the separate, but related, levels.
Database compression
Authors: Mark A. Roth, Scott J. Van Horn
Venue: ACM SIGMOD Record (1993)

Despite the fact that computer memory costs have decreased dramatically over the past few years, data storage still remains, and will probably always remain, an important cost factor for many large scale database applications. Compressing data in a database system is attractive for two reasons: data storage reduction and performance improvement. Storage reduction is a direct and obvious benefit, while performance improves because smaller amounts of physical data need to be moved for any particular operation on the database. We address several aspects of reversible data compression and compression techniques: general concepts of data compression; a number of compression techniques; a comparison of the effects of compression on common data types; advantages and disadvantages of compressing data; and future research needs.
EOS: an object-oriented operating system for embedded real-time applications
Authors: David Langan
Venue: Proceedings of the 1993 ACM conference on Computer science (1993)

Increases in hardware availability and capability have caused microprocessor based real-time embedded systems to become increasingly pervasive [8,9]. With this popularity, however, has come an increase in the size and complexity of embedded applications. Dealing with this complexity typically involves runtime support for interprocess communication and synchronization, memory sharing, device management [9], and, less typically, for error recovery and debugging [4,8]. Most real-time embedded operating systems provide this support through an interface consisting of a complex collection of subroutine calls. Basing this interface on an object-oriented model provides encapsulation and extensibility features to the application programmer. Although some work has been done using this approach, those systems generally use proprietary languages (e.g. ARTS) and are too large to be used in embedded systems [9]. This paper describes a high level object-oriented design for a real-time embedded operating system, called EOS, and for the EOS application program interface. EOS is intended to be compact enough to be used in embedded systems, yet provide standard capabilities such as message handling, memory sharing, device management, and direct support for error tracking and recovery.
Canvass committee members sought for ANSI/HFS 100 revision
Authors: Pat Billingsley
Venue: ACM SIGCHI Bulletin (1993)

The first revision of the Human Factors and Ergonomics Society's American National Standard for Human Factors Engineering of Visual Display Terminal Workstations (ANSI/HFS 100-1988) is expected to be available for public review and comment in fall 1993. According to ANSI policy, all persons who are materially and directly affected by the standard may comment on the revised document, which must receive majority approval by the canvass committee before it is accepted as a U.S. national standard. The topics covered by the standard include: keyboard and non-keyboard input devices, CRT and flat-panel output devices, the ambient environment of office computer workstations, and office furniture used with computers.
Numerical conditioning of a system of algebraic equations with a finite number of solutions using Gröbner bases
Authors: Antonio Montes
Venue: ACM SIGSAM Bulletin (1993)

It is known that Gr ouml;bner bases approach can be useful to solve systems of algebraic equations with a finite number of solutions. Nevertheless, as stated in [Bu], numerical accuracy attainable when using floating point arithmetic is not yet studied. In this paper we discuss numerical approach, defining conveniently the condition number of every root, and the numerical g.c.d.'s of Buchberger's algorithm. With these instruments we are able to compute confidence-intervals for the roots. We complete the study with two illustrative examples. We also give some insight about the best order of the variables when pure lexicographical order is concerned.