ppxscal/embedding_network huggingface dataset:
Strategic Testing Environment with Formal Description Techniques
Authors: Kotaro Katsuyama, Fumiaki Sato, Tetsuo Nakakawaji, Tadanori Mizuno
Venue: IEEE Transactions on Computers (1991)

The authors describe the design of a testing environment, called FOREST (formal environment for systematic testing), for communication systems. The proposed method integrates three major strategies: (1) the use of formal description techniques (FDTs), for their formal semantics, which makes them unambiguous; (2) a stepwise approach to generate appropriate test cases for different test stages; and (3) the systematic support of the testing process, from test development to test execution. FOREST consists of four major subsystems. TENT (test sequence generation tool) is a subsystem that generates test cases from the formal specification of the behavior of a given protocol. APRICOT (ASN.1 pre-compiler, coder and test-debugger) is a subsystem that generates test data from the protocol data structures definition. TESPEC (test specification editor) is a tool producing some test specification based on a standardized formalism. The last subsystem, TEXEC (test executor), is a test execution system which consists of an upper tester and a lower tester, and a simulator of the communication medium.
Technologies for low latency interconnection switches
Authors: Thomas F. Knight,  Jr.
Venue: ACM SIGARCH Computer Architecture News (1991)

This paper presents an engineering design for a low latency high bandwidth interconnection network which will form the switching substrate for a multi-model parallel processing system. The performance is enhanced with a variety of approaches covering interconnection protocols, routing, fault tolerance, advanced packaging, and electrical interconnection techniques. The synergistic application of these technologies leads to a high performance design.
Browser-Soar: a computational model of a highly interactive task
Authors: Virginia A. Peck, Bonnie E. John
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Browser-Soar models the perceptual, cognitive, and motor operators of a user searching for information in an on-line help browser. The model accounts for 90% of the browsing behavior observed in ten episodes. This result suggests that much of browsing behavior is a routine cognitive task, describably by GOMS, and extends the boundary of tasks to which GOMS applies to include highly interactive tasks. Further, it also suggests that GOMS analyses can be used to evaluate text-editors and other computer applications, and to help focus design effort.
Invariant Descriptors for 3D Object Recognition and Pose
Authors: David Forsyth, Joseph L. Mundy, Andrew Zisserman, Chris Coelho, Aaron Heller, Charles Rothwell
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

Invariant descriptors are shape descriptors that are unaffected by object pose, by perspective projection, or by the intrinsic parameters of the camera. These descriptors can be constructed using the methods of invariant theory, which are briefly surveyed. A range of applications of invariant descriptors in 3D model-based vision is demonstrated. First, a model-based vision system that recognizes curved plane objects irrespective of their pose is demonstrated. Curves are not reduced to polyhedral approximations but are handled as objects in their own right. Models are generated directly from image data. Once objects have been recognized, their pose can be computed. Invariant descriptors for 3D objects with plane faces are described. All these ideas are demonstrated using images of real scenes. The stability of a range of invariant descriptors to measurement error is treated in detail.
Constructing Protocols with Alternative Functions
Authors: Huai-An Lin
Venue: IEEE Transactions on Computers (1991)

The author describes a method for designing communication protocols which can perform several distinct functions, but are limited to the execution of one function at a time. The construction of such a protocol consists of two steps: (1) developing a component protocol for each function to be included, and (2) integrating the components into the target protocol. The integration involves the resolution of potential component competition and process synchronization problems. A sufficient condition for the safety of the integrated protocol is also discussed. This design method is simple to use and promotes reuse of existing protocols. The construction of two protocols-the call setup phase of a data link control protocol and a portion of the CCITT's X.21 Recommendation-is demonstrated.
Notes on C programming for APL programmers
Authors: Stephen Deerhake
Venue: ACM SIGAPL APL Quote Quad (1991)

As the domain of "callable" languages from APL increases, it is quite likely that APL programmers will find an increasing need for the ability to program in other languages as part of their support activities for APL programming. This is already becoming prevalent in mainframe APL2 (APL2/370), where it is not uncommon to find hybrid systems consisting of APL2, REXX, and/or FORTRAN.Since most "external language" activity in APL-based systems centers on manipulating APL arrays, it is appropriate to examine the programming techniques in callable languages from the standpoint of facilitating APL array manipulation. Specifically, C language programming techniques for handling APL2/PC arrays are reviewed. The techniques discussed emphasize isolation of the application code from the underlying array structure, thus maximizing application code portability. While immediately applicable to the management of APL2/PC arrays, the programming techniques and tips offered are applicable to other APL array implementations as well.
CAD-Based Computer Vision: From CAD Models to Relational Graphs
Authors: Patrick J. Flynn, Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The topic of model-building for 3-D objects is examined. Most 3-D object recognition systems construct models either manually or by training. Neither approach has been very satisfactory, particularly in designing object recognition systems which can handle a large number of objects. Recent interest in integrating mechanical CAD systems and vision systems has led to a third type of model building for vision: adaptation of preexisting CAD models of objects for recognition. If a solid model of an object to be recognized is already available in a manufacturing database, then it should be possible to infer automatically a model appropriate for vision tasks from the manufacturing model. Such a system has been developed. It uses 3-D object descriptions created on a commercial CAD system and expressed in both the industry-standard IGES form and a polyhedral approximation and performs geometric inferencing to obtain a relational graph representation of the object which can be stored in a database of models for object recognition. Relational graph models contain both view-independent information extracted from the IGES description and view-dependent information (patch areas) extracted from synthetic views of the object. It is argued that such a system is needed to efficiently create a large database (more than 100 objects) of 3-D models to evaluate matching strategies.
The Partial Line Digraph Technique in the Design of Large Interconnection Networks
Authors: Miguel A. Fiol, Anna S. Lladó
Venue: IEEE Transactions on Computers (1992)

The following problem arises in the design of some interconnection networks for distributed systems. Namely, to construct digraphs with given maximum out-degree, reduced diameter, easy routing, good connectivity, and good expandability. To this end, a method based on the concept of partial line digraph is presented. This proposal, which turns out to be a generalization of the so-called line digraph technique, allows digraphs that satisfy all the above-mentioned requirements to be obtained. In particular, it is shown that the partial line digraphs of Kautz digraphs solve the (d, N) digraph problem, i.e. to minimize the diameter D in a digraph of maximum out-degree d and number of vertices N, for any N in the range d/sup D-1/+d/sup D-2/+. . .+1>or=N>or=d/sup D/+d/sup D-1/.
Size-depth tradeoffs for algebraic formulae
Authors: Nader H. Bshouty, Richard Cleve, Wayne Eberly
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

Some tradeoffs between the size and depth of algebraic formulas are proved. It is shown that, for any fixed in >0, any algebraic formula of size S can be converted into an equivalent formula of depth O(log S) and size O(S/sup 1+ in /). This result is an improvement over previously known results where, to obtain the same depth bound, the formula size is Omega (S/sup alpha /), with alpha >or=2.
Synthesis of application-specific heterogeneous multiprocessor systems (abstract)
Authors: Shiv Prakash, Alice C. Parker
Venue: ACM SIGARCH Computer Architecture News (1992)

Heterogeneous systems can achieve enhanced performance and/or cost-effectiveness over homogeneous systems. SOS, a formal method to synthesize optimal heterogeneous systems for given applications, involves creation and solution of a mixed integer-linear programming model. A primary component of the model is the set of relations to be satisfied to ensure proper ordering of various events in the task execution, and completeness and correctness. Experiments indicate SOS can be useful in designing heterogeneous systems.
Modern client-server DBMS architectures
Authors: Nick Roussopoulos, Alexis Delis
Venue: ACM SIGMOD Record (1991)

In this paper, we describe three Client-Server DBMS architectures. We discuss their functional components and provide an overview of their performance characteristics.
Standard Music Description Language
Authors: Steven R. Newcomb
Venue: Computer (1991)

The Standard Music Description Language (SMDL), an application of the HyTime Hypermedia/Time-based document structuring facilities, is described. The discussion covers the domains of information that SMDL associates with any piece of music, the timing of cantus events, pitch in cantus events, gamut-based pitches, just-intoned pitches, user-defined functions for pitches, chords and chord symbols, instrumental and vocal sounds, and nonwestern music.
Auditory speech preprocessors
Authors: George Zweig
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

A nonlinear transmission line model of the cochlea (Zweig 1988) is proposed as the basis for a novel speech preprocessor. Sounds of different intensities, such as voiced and unvoiced speech, are preprocessed in radically different ways. The <i>Q</i>'s of the preprocessor's nonlinear filters vary with input amplitude, higher <i>Q</i>'s (longer integration times) corresponding to quieter sounds. Like the cochlea, the preprocessor acts as a "subthreshold laser" that traps and amplifies low level signals, thereby aiding in their detection and analysis.
The CLASSIC knowledge representation system: guiding principles and implementation rationale
Authors: Peter F. Patel-Schneider, Deborah L. McGuinness, Ronald J. Brachman, Lori Alperin Resnick
Venue: ACM SIGART Bulletin (1991)

Our work on the CLASSIC knowledge representation system covers a broad range from theory to practice. While CLASSIC was implemented primarily to provide a simple, easy to learn and use, locally available tool for a relatively limited set of applications, it has a substantial theoretical foundation, based on a formal "terminological" logic. The logical foundation provides the semantics of a term description language, which is used to define structured concepts and make assertions about individuals in a knowledge base. These concepts and individuals are organized into a generalization hierarchy by classification and subsumption algorithms. The CLASSIC system explores the expressiveness vs. tractability tradeoff, driven by concerns of usefulness and usability in several real applications. Within this context, it embodies our views of what a knowledge representation system should
Matching Two Perspective Views
Authors: Juyang Weng, Narendra Ahuja, Thomas S. Huang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A computational approach to image matching is described. It uses multiple attributes associated with each image point to yield a generally overdetermined system of constraints, taking into account possible structural discontinuities and occlusions. In the algorithm implemented, intensity, edgeness, and cornerness attributes are used in conjunction with the constraints arising from intraregional smoothness, field continuity and discontinuity, and occlusions to compute dense displacement fields and occlusion maps along the pixel grids. The intensity, edgeness, and cornerness are invariant under rigid motion in the image plane. In order to cope with large disparities, a multiresolution multigrid structure is employed. Coarser level edgeness and cornerness measures are obtained by blurring the finer level measures. The algorithm has been tested on real-world scenes with depth discontinuities and occlusions. A special case of two-view matching is stereo matching, where the motion between two images is known. The algorithm can be easily specialized to perform stereo matching using the epipolar constraint.
Experiments in automatic statistical thesaurus construction
Authors: Carolyn J. Crouch, Bokyung Yang
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

A well constructed thesaurus has long been recognized as a valuable tool in the effective operation of an information retrieval system. This paper reports the results of experiments designed to determine the validity of an approach to the automatic construction of global thesauri (described originally by Crouch in [1] and [2] based on a clustering of the document collection. The authors validate the approach by showing that the use of thesauri generated by this method results in substantial improvements in retrieval effectiveness in four test collections. The term discrimination value theory, used in the thesaurus generation algorithm to determine a term's membership in a particular thesaurus class, is found not to be useful in distinguishing a &ldquo;good&rdquo; from an &ldquo;indifferent&rdquo; or &ldquo;poor&rdquo; thesaurus class). In conclusion, the authors suggest an alternate approach to automatic thesaurus construction which greatly simplifies the work of producing viable thesaurus classes. Experimental results show that the alternate approach described herein in some cases produces thesauri which are comparable in retrieval effectiveness to those produced by the first method at much lower cost.
Using focusing search algorithms and a strong heuristic to solve the findpath problem in robotics
Authors: Jim Wang, Verlynda S. Dobbs, Henry W. Davis
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Two problems are associated with the seeking of good solutions to the find path problem (Find Path) in robotics. First, the use of artificial intelligence searching techniques is limited to the A* algorithm. Secondly, simple and poor heuristics are employed in this best-first search. To speed up the search, two approaches are taken in this paper: i) using two A*-based focusing search algorithms, A+ and A&dgr;, for FindPath; ii) constructing a problem-tailored strong heuristic, h2, under the configuration space representation chosen (2-D with rotation). These approaches are compared with the use of A* and a standard heuristic. Experimental evidence indicates that each of the new approaches improves speed considerably and solution quality in each case is very close to the optimal. When combined, the new approaches speed up the search by more than 40%. We conclude that A&dgr; is, among the three search algorithms studied, the fastest and most suitable one for high branching-factor problems such as FindPath, especially when a strong heuristic (such as h2) is employed.
Providing a laboratory for instruction set design
Authors: Rosalee Nerheim-Wolfe
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

Computer architecture classes do not provide students with laboratory experience in the design of instruction set architectures. Projects that compare designs have not been possible due to a lack of support software. The design and evaluation of a new instruction set requires an assembler, a symbolic debugger, and a statistics gatherer. Every new instruction set requires changes to all three programs. It would be unrealistic to expect that either students or instructor would (re)write such software in order to evaluate each new design. A new, flexible software package called the Instruction Set Testbed (IST) provides for the comparison of instruction set architectures without writing any of the support software. IST's table-driven assembler uses a student-supplied architecture definition to assemble programs. IST's interactive debugger and a statistics gatherer also have access to the architecture definition. This allows symbolic debugging of the assembly language programs and automatic histogramming of instruction usage in the student-defined architecture. IST has been used in both undergraduate and graduate architecture classes to investigate such topics as orthogonality, choice and number of operands, addressing modes, and RISC philosophy.
Writing about programming in CS1
Authors: L. A. Curl
Venue: ACM SIGCSE Bulletin (1992)

Students in CS1 were assigned to groups that met during class time to study one member's work on one complex programming problem. When the program was complete, each student wrote a paper describing various aspects of the program. The class response to the writing project was varied and intense.
An O(nlog log n) learning algorithm for DNF under the uniform distribution
Authors: Yishay Mansour
Venue: Proceedings of the fifth annual workshop on Computational learning theory (1992)

We show that a DNF with terms of size at most d can be approximated by a function with at most dO(d log 1/&egr;))non zero Fourier coefficients such that the expected error squared, with respect to the uniform distribution, is at most &egr;. This property is used to derive a learning algorithm for DNF, under the uniform distribution. The learning algorithm uses queries and learns, with respect to the uniform distribution, a DNF with terms of size at most d in time polynomial in n and dO(d log 1/egr;). The interesting implications are for the case when &egr; is constant. In this case our algorithm learns a DNF with a polynomial number of terms in time nO(log log n), and a DNF with terms of size at most O(log n/log log n) in polynomial time.
Detection of version features in distributed systems
Authors: K. C. Wong
Venue: ACM SIGPLAN Notices (1991)

In this paper we demonstrate how version features can be defined, detected, and used to determine language versions. Using the BNF notation, distinct features can be conveniently specified in the context-free grammar global to all of the versions. A feature matrix specifying the relationship maintained by terminal features is proposed to implement the global grammar, on which determining language versions is based.
Data encapsulation using Fortran 77 modules
Authors: Lewis L. DeLong, David B. Thompson, Janice M. Fulford
Venue: ACM SIGPLAN Fortran Forum (1992)

Traditionally, the preferred method for developing numerical models in the Fortran language, as standardized in 1977, has been the top-down structured approach. This method emphasizes the relation between procedures necessary to solve a particular programming problem. An alternative perspective is to consider data and manipulation of data fundamental to solution of a programming problem. A programming construct arising from this perspective may be termed a module. A module is comprised of a set of procedures and data they manipulate. Modules may be used to encapsulate data, that is, hide module data from and prevent their direct use by routines outside the module. Information computed from module data is obtained indirectly through invocation of module procedures. Modules, comprised of associated groups of data and respective procedures, provide program structure beyond that available using procedural-oriented practices alone. Construction and use of modules potentially improves program clarity, reduces argument passing, and encapsulates data at the level where they are manipulated. Use of Fortran 77 modules, like the use of top-down structured programming, is a programming technique allowed but not supported or enforced by the Fortran 77 language. Consequently, successful implementation of modules with Fortran 77 and realization of potential benefits depend on voluntary adherence to the programming technique. Use of other computer languages (such as Modula-2, Ada, C++, and Fortran 90) which, to varying degrees, support or enforce programming techniques similar to the use of Fortran 77 modules might significantly increase programming efficiency and realization of potential benefits.
Analytical models of combining Banyan networks
Authors: Arif Merchant
Venue: Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems (1992)

We present in this paper an analytical model of a multistage combining Banyan network with output buffered switches, in hot-sport traffic. In a combining network, packets bound for the same destination are combined into one if they meet at a switch; this alleviates the problem of tree-saturation caused by hot-spot traffic. We model the flow processes in the network as Markov chains and recursively approximate the departure processes of each stage of the network in terms of the departure processes of the preceding stage. This model is used to predict the throughput of the combining network, and comparison with simulation results shows the prediction to be accurate. A modified combining scheme based on low priorites for hot packets is proposed and analyzed. It is shown that this scheme yields substantial improvements in throughput over the standard combining scheme.
A conceptual model for megaprogramming
Authors: Will Tracz
Venue: ACM SIGSOFT Software Engineering Notes (1991)

"Currently, software is put together one statement at a time. What we need is to put software together one component at a time." --- Barry Boehm, at the Domain Specific Software Architecture (DSSA) Workshop, July 11--12, 1990.Megaprogramming, as defined at the first ISTO Software Technology Community Meeting, June 27-29, 1990, by Barry Boehm, director of DARPA/ISTO, is component-based software engineering and life-cycle management. The goal of this paper is to place megaprogramming in perspective with research in other areas of software engineering (i.e., formal methods and rapid prototyping) and to describe the author's experience developing a system to support megaprogramming.The paper, first, analyzes megaprogramming and its relationship to other DARPA research initiatives (CPS/CPL --- Common Prototyping System/Common Prototyping Language, DSSA --- Domain Specific Software Architectures, and SWU --- Software Understanding). Next, the desirable attributes of megaprogramming software components are identified and a software development model (The 3C Model) and resulting prototype megaprogramming system (LILEANNA --- Library Interconnection Language Extended by Annotated Ada) are described.
A type system for object-oriented database programming and querying languages
Authors: Yves Caseau, Laurent Perron
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

In this paper we present an extended type system for an object-oriented database language, based uniquely on the set interpretation of objects classes. We show that this system has the same expressive power as more complex approaches and is well suited to type inference for programming or querying database languages.