ppxscal/embedding_network huggingface dataset:
WordNet: a lexical database for English
Authors: George A. Miller
Venue: Communications of the ACM (1995)

Because meaningful sentences are composed of meaningful words, any system that hopes to process natural languages as people do must have information about words and their meanings. This information is traditionally provided through dictionaries, and machine-readable dictionaries are now widely available. But dictionary entries evolved for the convenience of human readers, not for machines. WordNet1 provides a more effective combination of traditional lexicographic information and modern computing. WordNet is an online lexical database designed for use under program control. English nouns, verbs, adjectives, and adverbs are organized into sets of synonyms, each representing a lexicalized concept. Semantic relations link the synonym sets [4].
On Spin Models, Triply Regular Association Schemes, and Duality
Authors: François Jaeger
Venue: Journal of Algebraic Combinatorics: An International Journal (1995)

Motivated by the construction of invariants of links in 3-space, we study spin models on graphs for which all edge weights (considered as matrices) belong to the Bose-Mesner algebra of some association scheme. We show that for series-parallel graphs the computation of the partition function can be performed by using series-parallel reductions of the graph appropriately coupled with operations in the Bose-Mesner algebra. Then we extend this approach to all plane graphs by introducing star-triangle transformations and restricting our attention to a special class of Bose-Mesner algebras which we call exactly triply regular. We also introduce the following two properties for Bose-Mesner algebras. The planar duality property (defined in the self-dual case) expresses the partition function for any plane graph in terms of the partition function for its dual graph, and the planar reversibility property asserts that the partition function for any plane graph is equal to the partition function for the oppositely oriented graph. Both properties hold for any Bose-Mesner algebra if one considers only series-parallel graphs instead of arbitrary plane graphs. We relate these notions to spin models for link invariants, and among other results we show that the Abelian group Bose-Mesner algebras have the planar duality property and that for self-dual Bose-Mesner algebras, planar duality implies planar reversibility. We also prove that for exactly triply regular Bose-Mesner algebras, to check one of the above properties it is sufficient to check it on the complete graph on four vertices. A number of applications, examples and open problems are discussed.
On Monotone Solutions of an Integrodifferential Equation in Linear Viscoelasticity
Authors: Olli Jokinen
Venue: SIAM Journal on Numerical Analysis (1996)

We consider the integrodifferential equation $u(t,x)= \int_0^t{a(t-s)u_{xx}(s,x)}ds$ with initial and boundary conditions corresponding to the Rayleigh problem. The kernel has the form $a(t)=a_0+a_\infty t+\int _0^t {a_1(s)}ds$, where $a_0\geq 0$, $a_\infty\geq 0$, and $a_1\in L_{loc}^1({\bf R}_+)$ is of positive type and satisfies the condition $\int _0^\infty {e^{-\epsilon t} ert a_1(t) ert }dt0$.By solving the equation numerically and performing a careful error analysis, we show that the solution $u(t,x)$ need not be nondecreasing in $t\geq 0$ for fixed $x>0$ if $a_1$ is nonnegative, nonincreasing, and convex. The same result is shown to hold under the assumption that $a_1$ is completely positive. This answers a question that remained unsolved in [J. Prü\ss , {\it Math.\ Ann}., 279 (1987), p. 330]. In the case where $a_1$ is convex, piecewise linear, the solution is shown to be almost everywhere equal to a function which is discontinuous across infinitely many parallel lines.
A multiple-dominance switch-level model for simulation of short faults
Authors: Peter Dahlgren
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

Short faults in CMOS networks frequently give rise to intermediate node voltages. An efficient local algorithm is presented for event-driven switch-level simulation of CMOS networks in which intermediate signal values are common. The proposed model allows multiple dominant signals associated with the state of a node. The strength of several logical low and high signal contributions can thereby be taken into account when the logic state of a node is computed, which means that intermediate voltages can be handled more accurately. To demonstrate the usefulness of the multiple-dominance model in fault simulations, a new fault simulation algorithm is presented. Various common transistor-level fault types were simulated, and the results show that the number of discrepancies from electrical-level simulations is significantly reduced at a low computational cost.
Specification and Validation of a Security Policy Model
Authors: Anthony Boswell
Venue: IEEE Transactions on Software Engineering (1995)

This paper describes the development of a formal security policy model in Z for the NATO Air Command and Control System (ACCS): a large, distributed, multilevel-secure system. The model was subject to manual validation, and some of the issues and lessons in both writing and validating the model are discussed.
Self-Assessment Procedure XXIII: programming languages
Authors: Mitchell H. Clifton
Venue: Communications of the ACM (1995)

This is the 23rd Self-Assessment Procedure.1 The purpose of this procedure is to let its readers test their knowledge of some of the more important features of significant programming languages. The features of imperative languages like Fortran, Algol 60, PL/I, Pascal, Modula-2, C, and Ada considered are data types, data structures, control structures, program units, scope of names, and parameter passing. Some of the corresponding features of functional languages like Lisp, logic programming languages like Prolog, and ohject-oriented programming languages like C++ and Smalltalk, are reviewed. Finally brief consideration is given to syntax and semantics, chiefly by reference to the Backus-Naur form, BNF. The features of programming languages affect all aspects of programming, including the ease of writing and maintaining programs, the reliahility of software, and the efficiency and portability of programs. Knowledge of programming language concepts and constructs is of importance to software developers, programmers, and designers of programming languages and compilers. The topic of this procedure should be of interest to any computer science student or practitioner who wishes to test his or her knowledge and learn more about one of the most important and broad areas in the computer field. The language used most often in the questions is Pascal, with Ada, Lisp, and Prolog also featured prominently. A glossary is included which defines some of the terms used in the procedure. The questions are either multiple-choice or short answer. Some of the multiple-choice questions allow for more than one correct answer.
Geometric programming: a programming approach to geometric design
Authors: Alberto Paoluzzi, Valerio Pascucci, Michele Vicentino
Venue: ACM Transactions on Graphics (TOG) (1995)

This article presents a functional programming approach to geometric design with embedded polyhedral complexes. Its main goals are to show the expressive power of the language as well as its usefulness for geometric design. The language, named PLASM (the Programming LAnguage for Solid Modeling), introduces a very high level approach to &ldquo;constructive&rdquo; or &ldquo;generative&rdquo; modeling. Geometrical objects are generated by evaluating some suitable language expressions. Because generating expressions can be easily combined, the language also extends the standard variational geometry approach by supporting classes of geometric objects with varying topology and shape. The design language PLASM can be roughly considered as a geometry-oriented extension of a subset of the functional language FL. The language takes a dimension-independent approach to geometry representation and algorithms. In particular it implements an algebraic calculus over embedded polyhedra of any dimension. The generated objects are always geometrically consistent because the validity of geometry is guaranteed at a syntactical level. Such an approach allows one to use a representation scheme which is weaker than those usually adopted in solid modelers, thus encompassing a broader geometric domain, which contains solids, surfaces, and wire-frames, as well as higher-dimensional objects.
On formal models for object-oriented databases
Authors: Gottfried Vossen
Venue: ACM SIGPLAN OOPS Messenger (1995)

While object-oriented database management systems are already arriving in the marketplace, their formal foundations are still under development. In this paper, one central aspect of such foundations, formal models for object-oriented databases, is considered. It is discussed why a formal model is desirable, what it is supposed to comprise in this context (a structural as well as a behavioral part), and how this can be achieved; to this end, the central ingredients which are shared by many proposed models are presented in some detail. This carries over to design issues for database descriptions in an object-oriented model, for which two distinct strategies are outlined. Finally, the question is discussed whether the modeling concepts described are indeed the ones that the applications which originally triggered the merger of database technology with object-oriented concepts need. Our argument is that this is only partially the case, and two promising directions for future work are sketched.
Treewidth and Pathwidth of Permutation Graphs
Authors: Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
Venue: SIAM Journal on Discrete Mathematics (1995)

In this paper, we show that the treewidth and pathwidth of a permutation graph can be computed in polynomial time. In fact we show that, for permutation graphs, the treewidth and pathwidth are equal. These results make permutation graphs one of the few nontrivial graph classes for which, at the moment, treewidth is known to be computable in polynomial time. Our algorithm, which decides whether the treewidth (pathwidth) is at most some given integer $k$, can be implemented to run in $O(nk)$ time when the matching diagram is given. We show that this algorithm can easily be adapted to compute the pathwidth of a permutation graph in $O(nk)$ time, where $k$ is the pathwidth.
Recursive Automatic Bias Selection for Classifier Construction
Authors: Carla E. Brodley
Venue: Machine Learning (1995)

The results of empirical comparisons of existing learning algorithms illustrate that each algorithm has a selective superiority&semi; each is best for some but not all tasks. Given a data set, it is often not clear beforehand which algorithm will yield the best performance. In this article we present an approach that uses characteristics of the given data set, in the form of feedback from the learning process, to guide a search for a tree-structured hybrid classifier. Heuristic knowledge about the characteristics that indicate one bias is better than another is encoded in the rule base of the Model Class Selection (MCS) system. The approach does not assume that the entire instance space is best learned using a single representation language&semi; for some data sets, choosing to form a hybrid classifier is a better bias, and MCS has the ability to determine these cases. The results of an empirical evaluation illustrate that MCS achieves classification accuracies equal to or higher than the best of its primitive learning components for each data set, demonstrating that the heuristic rules effectively select an appropriate learning bias.
Shifting Vocabulary Bias in Speedup Learning
Authors: Devika Subramanian
Venue: Machine Learning (1995)

In this paper, we describe a domain-independent principle for justified shifts of vocabulary bias in speedup learning. This principle advocates the minimization of wasted computational effort. It explains as well as generates a special class of granularity shifts. We describe its automation for definite as well as stratified Horn theories, and present an implementation for a general class of reachability computations.
Nearest neighbor queries
Authors: Nick Roussopoulos, Stephen Kelley, Frédéric Vincent
Venue: Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)

A frequently encountered type of query in Geographic Information Systems is to find the k nearest neighbor objects to a given point in space. Processing such queries requires substantially different search algorithms than those for location or range queries. In this paper we present an efficient branch-and-bound R-tree traversal algorithm to find the nearest neighbor object to a point, and then generalize it to finding the k nearest neighbors. We also discuss metrics for an optimistic and a pessimistic search ordering strategy as well as for pruning. Finally, we present the results of several experiments obtained using the implementation of our algorithm and examine the behavior of the metrics and the scalability of the algorithm.
An overview of portable GUI software
Authors: Wade Guthrie
Venue: ACM SIGCHI Bulletin (1995)

This article attempts to bring together as much information as possible concerning platform-independent Graphical User Interface (PIGUI) development kits. It is based on a FAQ list (answers to Frequently Answered Questions) maintained and periodically updated as a service to the net by the author.What is presented here is a number of tables summarizing available PlGUI's, followed by descriptions of the individual products, with reviews and users' comments where possible.
Layout Recognition of Multi-Kinds of Table-Form Documents
Authors: Toyohide Watanabe, Qin Luo, Noboru Sugie
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Many approaches have reported that knowledge-based layout recognition methods are very successful to classify the meaningful data from document images automatically. However, these approaches are applicable to only the same kind of documents because they are based on the paradigm that specifies the structure definition information in advance so as to be able to analyze a particular class of documents intelligently. In this paper, we propose a method to recognize the layout structures of multi-kinds of table-form document images. For this purpose, we introduce a classification tree to manage the relationships among different classes of layout structures. Our recognition system has two modes: layout knowledge acquisition and layout structure recognition. In the layout knowledge acquisition mode, table-form document images are distinguished according to this classification tree and then the structure description trees which specify the logical structures of table-form documents are generated automatically. While, in the layout structure recognition mode, individual item fields in the table-form document images are extracted and classified successfully by searching the classification tree and interpreting the structure description tree.
Creating Windows applications using Borland's OWL classes
Authors: Laszlo Szuecs
Venue: Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education (1996)

This paper presents a brief overview of Windows programming in C++ with Borland's OWL classes and describes the planning and organization of a course in graphical user interfaces. It may be helpful to instructors who would like to combine the creation of graphical user interfaces with an intermediate or advanced course in object-oriented programming.
Deterministic on-line routing on area-universal networks
Authors: Paul Bay, Gianfranco Bilardi
Venue: Journal of the ACM (JACM) (1995)

Two deterministic routing networks are presented: the pruned butterfly and the sorting fat-tree. Both networks are area-universal, that is, they can simulate any other routing network fitting in similar area with polylogarithmic slowdown. Previous area-universal networks were either for the off-line problem, where the message set to be routed is known in advance and substantial precomputation is permitted, or involved randomization, yielding results that hold only with high probability. The two networks introduced here are the first that are simultaneously deterministic and on-line, and they use two substantially different routing techniques. The performance of their routing algorithms depends on the difficulty of the problem instance, which is measured by a quantity &lgr; known as the load factor. The pruned butterfly runs in time O(&lgr;log2N), is the number of possible sources and destinations for messages and &lgr; is assumed to be polynomial in N. The sorting fat-tree algorithm runs in O(&lgr; log N + log2 N) time for a restricted class of message sets including partial permutations. Other results of this work include a &ldquo;flexible&rdquo; circuit that is area-time optimal across a range of different input sizes and an area-time lower bound for routers based on wire-length arguments.
Semantic-based visualization for parallel object-oriented programming
Authors: Isabelle Attali, Denis Caromel, Sidi O. Ehmety, Sylvain Lippi
Venue: ACM SIGPLAN Notices (1996)

We present a graphical environment for parallel object-oriented programming. It provides visual tools to develop and debug object-oriented programs as well as parallel or concurrent systems. This environment was derived from a structural operational semantics of an extension of the Eiffel language, Eiffel//. Object-related features of the language (inheritance, polymorphism) are formalized using a big-step semantics, while the interleaving model of concurrency is expressed with small-step semantics.Without user instrumentation, the interactive environment proposes features such as step-by-step animated executions, graphical visualization of object and process topology, futures and pending requests, control of interleaving, deadlock detection.
An efficient, fully adaptive deadlock recovery scheme: DISHA
Authors: K. V. Anjan, Timothy Mark Pinkston
Venue: Proceedings of the 22nd annual international symposium on Computer architecture (1995)

This paper presents a simple, efficient and cost effective routing strategy that considers deadlock recovery as opposed to prevention. Performance is optimized in the absence of deadlocks by allowing maximum flexibility in routing. Disha supports true fully adaptive routing where all virtual channels at each node are available to packets without regard for deadlocks. Deadlock cycles, upon forming, are efficiently broken by progressively routing one of the blocked packets through a deadlock-free lane. This lane is implemented using a central "floating" deadlock buffer resource in routers which is accessible to all neighboring routers along the path. Simulations show that the Disha scheme results in superior performance and is extremely simple, ensuring quick recovery from deadlocks and enabling the design of fast routers.
A General Approach to Removing Degeneracies
Authors: Ioannis Z. Emiris, John F. Canny
Venue: SIAM Journal on Computing (1995)

We wish to increase the power of an arbitrary algorithm designed for nondegenerate input, by allowing it to execute on all inputs. We concentrate on infinitesimal symbolic perturbations that do not affect the output for inputs in general position. Otherwise, if the problem mapping is continuous, the input and output space topology are at least as coarse as the real euclidean one and the output space is connected, then our perturbations make the algorithm produce an output arbitrarily close or identical to the correct one. For a special class of algorithms, which includes several important algorithms in computational geometry, we describe a deterministic method that requires no symbolic computation. Ignoring polylogarithmic factors, this method increases only the worst-case bit complexity by a multiplicative factor which is linear in the dimension of the geometric space. For general algorithms, a randomized scheme with arbitrarily high probability of success is proposed; the bit complexity is then bounded by a small-degree polynomial in the original worst-case complexity. In addition to being simpler than previous ones, these are the first efficient perturbation methods.
The practical management of computer ethics problems
Authors: John W. Smith
Venue: ACM SIGUCCS Newsletter (1995)

Power, its use and abuse, is a major topic of discussion in ethics. In the context of ethical problems in information technology, we will look at it as a tool, rather than as a subject. If you have been given the responsibility for some aspect of your school's computing environment, it can be assumed that you have a corresponding amount of authority. [If not, that should be immediately rectified.] This authority translates into a force that can be used in dealing with ethical problems.
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs
Authors: Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
Venue: SIAM Journal on Computing (1995)

Drawing graphs is an important problem that combines elements of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows: We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. We present efficient dynamic drawing algorithms for trees and series-parallel digraphs. As further applications of the model, we give dynamic drawing algorithms for planar st-digraphs and planar graphs. Our algorithms adopt a variety of representations (e.g., straight line, polyline, visibility) and update the drawing in a smooth way.
High availability of commercial applications
Authors: Kestutis Ivinskis
Venue: Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)

The increased performance capabilities of UNIX server systems have led to their acceptance as the server of choice for medium-sized and large organizations. But performance is just one facet. Another facet is the end user perception of the availability of an information system.Traditional mainframe based IS shops have a long experience in supplying computing services to their commercial end users. The ultimate goal of the end user is to have no downtimes for his work at his PC or workstation terminal. Key issues related to system availability in client/server based information systems remain the same as in the mainframe based world, e.g. system responsiveness, maximum downtime per year and maximum number of system outages per year. But there are also new aspects, which have been introduced into the discussion.In a multi-tiered client/server based information system the OLTP workload is distributed on different servers. Hence one can ask: Why should a failure of one server automatically imply downtime for the whole system ? Can't most of the system continue to operate ? Redistribution of the workload on the remaining active servers can be used to attack this problem. Workload balancing can be applied for replicated system services. Other techniques have to be applied for non-replicated system services.This paper considers client/server based applications running in a local or wide area network of computers in a distributed system.