ppxscal/embedding_network huggingface dataset:
The acquisition of stress: a data-oriented approach
Authors: Walter Daelemans, Steven Gillis, Gert Durieux
Venue: Computational Linguistics (1994)

A data-oriented (empiricist) alternative to the currently pervasive (nativist) Principles and Parameters approach to the acquisition of stress assignment is investigated. A similarity-based algorithm, viz. an augmented version of Instance-Based Learning is used to learn the system of main stress assignment in Dutch. In this nontrivial task a comprehensive lexicon of Dutch monomorphemes is used instead of the idealized and highly simplified description of the empirical data used in previous approaches.It is demonstrated that a similarity-based learning method is effective in learning the complex stress system of Dutch. The task is accomplished without the a priori knowledge assumed to pre-exist in the learner in a Principles and Parameters framework.A comparison of the system's behavior with a consensus linguistic analysis (in the framework of Metrical Phonology) shows that ease of learning correlates with decreasing degrees of markedness of metrcal phenomena. It is also shown that the learning algorithm captures subregularities within the stress system of Dutch that cannot be described without going beyond some of the theoretical assumptions of metrical phonology.
A complete calculus for the multialgebraic and functional semantics of nondeterminism
Authors: Michal Walicki, Sigurd Meldal
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1995)

The current algebraic models for nondeterminism focus on the notion of possibility rather than necessity and consequently equate (nondeterministic) terms that one would intuitively not consider equal. Furthermore, existing models for nondeterminism depart radically from the standard models for (equational) specifications of deterministic operators. One would prefer that a specification language for nondeterministic operators be based on an extension of the standard model concepts, preferably in such a way that the reasoning system for (possibly nondeterministic) operators becomes the standard equational one whenever restricted to the deterministic operators&mdash;the objective should be to minimize the departure from the standard frameworks. In this article we define a specification language for nondeterministic operators and multialgebraic semantics. The first complete reasoning system for such specifications is introduced. We also define a transformation of specifications of nondeterministic operators into derived specifications of deterministic ones, obtaining a &ldquo;computational&rdquo; semantics of nondeterministic specification by adopting the standard semantics of the derived specification as the semantics of the original one. This semantics turns out to be a refinement of multialgebra semantics. The calculus is shown to be sound and complete also with respect to the new semantics.
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
Authors: Masafumi Yamashita, Tsunehiko Kameda
Venue: IEEE Transactions on Parallel and Distributed Systems (1996)

In anonymous networks, the processors do not have identity numbers. We investigate the following representative problems on anonymous networks: (a) the leader election problem, (b) the edge election problem, (c) the spanning tree construction problem, and (d) the topology recognition problem. On a given network, the above problems may or may not be solvable, depending on the amount of information about the attributes of the network made available to the processors. Some possibilities are: (1) no network attribute information at all is available, (2) an upper bound on the number of processors in the network is available, (3) the exact number of processors in the network is available, and (4) the topology of the network is available. In terms of a new graph property called "symmetricity," in each of the four cases (1)-(4) above, we characterize the class of networks on which each of the four problems (a)-(d) is solvable. We then relate the symmetricity of a network to its 1- and 2-factors.
PATHOS&mdash;a paradigmatic approach to high-level object-oriented software development
Authors: Rakesh Agarwal, Patricia Lago
Venue: ACM SIGSOFT Software Engineering Notes (1995)

The growing complexity of information systems and the ensuring problems of their development, maintenance and management have highlighted the inadequacy of formal and informal methods for constructing such systems. These problems manifest themselves in the computer systems which are often unmanageable, unreliable, inflexible and hence difficult to maintain. Users have often demanded for reliable computer systems because they realize that most failures are due to poor specification, and design. This has resulted in the emergence of a number of information systems methodologies together with associated computerized development environments in which the Object-Oriented (OO) approach is one of the most recent.OO is often used for promoting software development and its reuse. Languages like Smalltalk reduce not only development time but also the cost of maintenance, simplifying the creation of new systems and the reuse of old ones. Nevertheless OO is not a panacea i.e. efforts are to put in for its proper use. Thus we consider OO as a paradigm which provides a new image, a new way of conceptualizing the development life cycle. By the help of paradigms, software developers and users are supported in apprehending the development life cycle and means to organize the aspects of the life cycle into a comprehensive method.PATHOS (A Paradigmatic Approach To High-level Object-Oriented Software development) aims to demonstrate an approach to information system development that will lead not only to good information system creation, but also to explicitly represent the maintenance of the business knowledge so as to allow for its more effective and active exploitation at run time.
Designing pseudo-random number assignment strategies for simulation experiments
Authors: Wheyming Tina Song, Chien-Chou Su
Venue: Proceedings of the 27th conference on Winter simulation (1995)

The paper investigates the use of an effective pseudo-random number assignment strategy, which we call maximum-blocks strategy, for simulation experiments involving the estimation of quadratic response surface metamodel in 3/sup k/ factorial designs. The maximum-blocks strategy is shown to perform better than well-known existing quadratic-metamodel assignment strategies, such as the IR, CR, and modified-AR strategies.
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Authors: Ariel Orda, Raphael Rom
Venue: Journal of the ACM (JACM) (1990)

In this paper the shortest-path problem in networks in which the delay (or weight) of the edges changes with time according to arbitrary functions is considered. Algorithms for finding the shortest path and minimum delay under various waiting constraints are presented and the properties of the derived path are investigated. It is shown that if departure time from the source node is unrestricted, then a shortest path can be found that is simple and achieves a delay as short as the most unrestricted path. In the case of restricted transit, it is shown that there exist cases in which the minimum delay is finite, but the path that achieves it is infinite.
Byning the earth
Authors: Robert G. Chamberlain, Jay E. Braun, Paul J. Firnett
Venue: Proceedings of the 27th conference on Winter simulation (1995)

The Corps Battle Simulation (CBS) simulates ground and air battles between modern military forces. It runs in real time, modeling the interactions of tens of thousands of units in support of U.S. Army training exercises, typically involving several sites at geographically separated locations around the world. Through Version 1.5.2, the CBS terrain database associated terrain characteristics with a regular grid of three-kilometer hexagons tiling an appropriate map projection of the playbox. The hexagons also served as bins for other location-dependent information to simplify the search for what's nearby. This paper presents a new way to describe locations: Bynary latitudes and longitudes define patches of various sizes that completely cover the globe. Large patches, not necessarily all the same size, can serve as bins. Medium-sized patches can be assumed to have uniform terrain characteristics throughout. (That assumption, however, has not been used in CBS Version 1.5.3.) Tiny patches are suitable descriptors of locations. Spherical coordinates (latitudes and longitudes) are used for fundamental specification of locations, so playboxes are not limited by the characteristics of a map projection. The natural data structure is a quadtree, which facilitates storing terrain (and other location-dependent) data in variable size bins. If desired, huge bins can be used for areas remote from the primary theater of operations and smaller bins can be used in battle zones.
A network approach to probabilistic information retrieval
Authors: K. L. Kwok
Venue: ACM Transactions on Information Systems (TOIS) (1995)

In this article we show how probabilistic information retrieval based on document components may be implemented as a feedforward (feedbackward) artificial neural network. The network supports adaptation of connection weights as well as the growing of new edges between queries and terms based on user relevance feedback data for training, and it reflects query modification and expansion in information retrieval. A learning rule is applied that can also be viewed as supporting sequential learning using a harmonic sequence learning rate. Experimental results with four standard small collections and a large Wall Street Journal collection (173,219 documents) show that performance of feedback improves substantially over no feedback, and further gains are obtained when queries are expanded with terms from the feedback documents. The effect is much more pronounced in small collections than in the large collection. Query expansion may be considered as a tool for both precision and recall enhancement. In particular, small query expansion levels of about 30 terms can achieve most of the gains at the low-recall high-precision region, while larger expansion levels continue to provide gains at the high-recall low-precision region of a precision recall curve.
On Fault Simulation for Synchronous Sequential Circuits
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: IEEE Transactions on Computers (1995)

We investigate the considerations to be employed in designing a fault simulator for synchronous sequential circuits described at the gate-level. Three testing strategies and three methods of handling unknown state variable values are considered. Every combination of a test strategy and a method of handling unknown state variable values defines a different fault simulation procedure. Experimental results are presented to demonstrate the different fault coverage levels achievable by the various procedures. Based on these results, a fault simulation procedure that combines the various considerations is proposed.Index Terms¿Fault simulation, Multiple observation time test strategy, Single observation time test strategy, Synchronous sequential circuits, Three-value logic.
Analysis and Implementation of Hybrid Switching
Authors: Kang G. Shin, Stuart W. Daniel
Venue: IEEE Transactions on Computers (1996)

The switching scheme of a point-to-point network determines how packets flow through each node, and is a primary element in determining the network's performance. In this paper, we present and evaluate a new switching scheme called hybrid switching. Hybrid switching dynamically combines both virtual cut-through and wormhole switching to provide higher achievable throughput than wormhole alone, while significantly reducing the buffer space required at intermediate nodes when compared to virtual cut-through. This scheme is motivated by a comparison of virtual cut-through and wormhole switching through cycle-level simulations, and then evaluated using the same methods. To show the feasibility of hybrid switching, as well as to provide a common base for simulating and implementing a variety of routing and switching schemes, we have designed SPIDER, a communication adapter built around a custom ASIC called the Programmable Routing Controller (PRC).
Requirements-driven software test: a process-oriented approach
Authors: Muthu Ramachandran
Venue: ACM SIGSOFT Software Engineering Notes (1996)

Testing is essential for proving the quality of all products. It is expensive and hard to test interactive multimedia systems. This paper proposes a model for the test process, and investigates the possibility of deriving test cases from system models and requirement analysis techniques such as requirements definition and specification. We believe this will allow early detection of errors thereby reducing the cost for testing. These test cases can also be used as guidelines on design for testability. Effectiveness of the test tools depends on the careful selection of test cases.
Improvements and extensions to simulation interval procedures
Authors: Frank J. Matejcik
Venue: Proceedings of the 27th conference on Winter simulation (1995)

The paper presents improvements to two common confidence interval procedures: the two stage Student's t intervals and the paired t intervals. Further, we provide a conservative extension to the paired t intervals to deal with any finite number of alternatives. Also, we include an approximate procedure that performs better with large numbers of alternatives. These procedures have been presented previously (F.J. Matejcik and B.L. Nelson, 1993), but special elementary cases, revised notation, and comparison to common methods should make these procedures accessible to a broader audience. Numerical examples are included.
Advanced simulation, battle managers, and visualization
Authors: Joseph J. Molitoris, Thomas D. Taylor
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Advanced modeling, visualization, and simulation is of growing utility for the military, e.g., the Navy and Marine Corps. Potential uses are for situational awareness displays, analysis, assessment, doctrine, mission support, rehearsal and replay, tactics, and training. Advanced technology platforms can be assessed using simulation. New sensors and systems can be evaluated. A battle or simulation manager (BM or SM) is a flexible piece of software that commands, controls, and displays the simulation of a group of objects. It is an environment or toolkit for analysis, assessment, training, and wargaming. Current doctrine and tactics can be tested and missions planned with this type of software. The objects (military platforms) propagate and interact in space over the course of time through well-defined object-oriented processes. Features of a good BM include graphical two and three dimensional displays, database access, sensor and weapon models, and networking (via DIS or Distributed Interactive Simulation). A BM should be easy to use, fast, useful to the user, readily available, and widely used. It should be portable cross computer platforms. Today, there is a wide assortment of BMs, none of which satisfies these criteria.
Self-Orthogonal Greedy Codes
Authors: Laura Monroe
Venue: Designs, Codes and Cryptography (1996)

In this paper, we examine greedily generated self-orthogonal codes. We show that they are linear, and discuss several properties which they possess. We also look at specific examples of these codes.
Register allocation using lazy saves, eager restores, and greedy shuffling
Authors: Robert G. Burger, Oscar Waddell, R. Kent Dybvig
Venue: Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation (1995)

This paper presents a fast and effective linear intraprocedural register allocation strategy that optimizes register usage across procedure calls. It capitalizes on our observation that while procedures that do not contain calls (syntactic leaf routines) account for under one third of all procedure activations, procedures that actually make no calls (effective leaf routines) account for over two thirds of all procedure activations. Well-suited for both caller-and calle-save registers, our strategy employs a &ldquo;lazy&rdquo; save mechanism that avoids saves for all effective leaf routines, an &ldquo;eager&rdquo; restore mechanism that reduces the effect of memory latency, and a &ldquo;greedy&rdquo; register shuffling algorithm that does a remarkbly good job of minimizing the need for temporaries in setting up procedure calls.
Multidimensional Divide-and-Conquer Maximin Recurrences
Authors: Laurent Alonso, Edward M. Reingold, Rene Schott
Venue: SIAM Journal on Discrete Mathematics (1995)

Bounds are obtained for the solution to the divide-and-conquer recurrence \[M(n) = \max_{k_1 + \cdots + k_p = n} (M(k_1) + M(k_2) +\cdots + M(k_p) + \min (f(k_1), \cdots, f(k_p))),\] for nondecreasing functions $f$. Similar bounds are found for the recurrence with "min" replaced by "sum-of-all-but-the-max." Such recurrences appear in the analysis of various algorithms. The bounds follow from analyses of partition trees.
Consistency of transactions and random batch
Authors: Rudolf Bayer
Venue: ACM Transactions on Database Systems (TODS) (1986)

A synchronization technique and scheduling strategy is described, which allows us to run a batch process simultaneously with on-line transactions. The batch process and the transactions are serialized in such a way that consistency level 3 is achieved.
The computation of elementary unitary matrices
Authors: R. B. Lehoucq
Venue: ACM Transactions on Mathematical Software (TOMS) (1996)

The construction of elementary unitary matrices that transform a complex vector to a multiple of e1, the first column of the identity matrix, is studied. We present four variants and their software implementation, including a discussion onthe LAPACK subroutine CLARFG. Comparisons are also given.
Efficient validity checking for processor verification
Authors: Robert B. Jones, David L. Dill, Jerry R. Burch
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

We describe an efficient validity checker for the quantifier-free logic of equality with uninterpreted functions. This logic is well suited for verifying microprocessor control circuitry since it allows the abstraction of datapath values and operations. Our validity checker uses special data structures to speed up case splitting, and powerful heuristics to reduce the number of case splits needed. In addition, we present experimental results and show that this implementation has enabled the automatic verification of an actual high-level microprocessor description.
An important factor for optimistic protocol on distributed systems: granularity
Authors: Eunmi Choi, Moon Jung Chung
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Grain size, the amount of computations between communication points, is a quantity to be tuned appropriately depending on the characteristics of the underlying parallel and distributed machines, application problems, and simulation protocols. As target machines for optimistic protocol, the architectural characteristics of a cluster of DEC Alpha workstations are compared to the MasPar MP-2's in view of parallel logic simulation. We study the effects of varying grain size on several performance metrics when more than one logical processes are assigned to a physical processor on distributed systems. We obtain analytic formulas for the total number of simulation cycles and the total execution time, and find the optimal grain sizes for several benchmark circuits when the number of processors varies. Our experimental results show that the grain size greatly affects the performance of parallel logic simulation on distributed systems, and the effects vary depending on the machine independent factors.
An algebraic framework to represent finite state machines in single-layer recurrent neural networks
Authors: R. Alquézar, A. Sanfeliu
Venue: Neural Computation (1995)

In this paper we present an algebraic framework to represent finite state machines (FSMs) in single-layer recurrent neural networks (SLRNNs), which unifies and generalizes some of the previous proposals. This framework is based on the formulation of both the state transition function and the output function of an FSM as a linear system of equations, and it permits an analytical explanation of the representational capabilities of first-order and higher-order SLRNNs. The framework can be used to insert symbolic knowledge in RNNs prior to learning from examples and to keep this knowledge while training the network. This approach is valid for a wide range of activation functions, whenever some stability conditions are met. The framework has already been used in practice in a hybrid method for grammatical inference reported elsewhere (Sanfeliu and Alqu&eacute;zar 1994).
Ordered and Unordered Tree Inclusion
Authors: Pekka Kilpelainen, Heikki Mannila
Venue: SIAM Journal on Computing (1995)

The following tree-matching problem is considered: Given labeled trees $P$ and $T$, can $P$ be obtained from $T$ by deleting nodes? Deleting a node $u$ entails removing all edges incident to $u$ and, if $u$ has a parent $v$, replacing the edge from $v$ to $u$ by edges from $v$ to the children of $u$. The problem is motivated by the study of query languages for structured text databases. Simple solutions to this problem require exponential time. For ordered trees an algorithm is presented that requires $O(|P| |T|)$ time and space. The corresponding problem for unordered trees is also considered and a proof of its NP-completeness is given. An algorithm is presented for the unordered problem. This algorithm works in $O(|P| |T|)$ time if the out-degrees of the nodes in $P$ are bounded by a constant, and in polynomial time if they are $O(\log |T|)$.
Indirect distributed garbage collection: handling object migration
Authors: José M. Piquer
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1996)

In new distributed systems, object mobility is usually allowed and is sometimes used by the underlying object manager system to benefit from object access locality. On the other hand, in-transit references to objects can exist at any moment in asynchronous distributed systems. In the presence of object mobility and in-transit references, many garbage collector (GC) algorithms fail to operate correctly. Others need to use the system's object finder to find the objects while performing their work. As a general principle, a GC should never interfere with object manager polices (such as forcing migration or fixing an object to a given processor). However, if the GC uses the object finder, it will change the access pattern of the system, and eventually it could foul the global allocation policy. In this article we propose a new GC family, Indirect Garbage Collectors, allowing to separate the problems of object management (placement, replication, and retrieval) from garbage collection. This property allows our algorithms to be implemented on top of almost any existent distributed object system, without having to use the object finder.