ppxscal/embedding_network huggingface dataset:
Solving grammatical ambiguities within a surface syntactical parser for automatic indexing
Authors: Catherine Berrut, Palmer Palmer
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

This paper describes linguistic tools specifically designed for performant automatic indexing of natural language texts. By performant indexing, we mean the ability of the system to extract noun phrases (considered as main conceptual frames regarding text content) without processing full syntactic analysis of sentences (surface analyzer) both with its ability in learning unknown words. The paper describes the overall principles of this parser, emphasizing the use of syntactic networks and precedence matrix to fulfil the above goals of reducing the analysis cost and infering new vocabularies without interrupting the indexing process.
On-line warehouse view maintenance
Authors: Dallan Quass, Jennifer Widom
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

Data warehouses store materialized views over base data from external sources. Clients typically perform complex read-only queries on the views. The views are refreshed periodically by maintenance transactions, which propagate large batch updates from the base tables. In current warehousing systems, maintenance transactions usually are isolated from client read activity, limiting availability and/or size of the warehouse. We describe an algorithm called 2VNL that allows warehouse maintenance transactions to run concurrently with readers. By logically maintaining two versions of the database, no locking is required and serializability is guaranteed. We present our algorithm, explain its relationship to other multi-version concurrency control algorithms, and describe how it can be implemented on top of a conventional relational DBMS using a query rewrite approach.
Reuse: the two concurrent life cycles paradigm
Authors: Richard Drake, William Ett
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

Since its introduction, Ada has held out the promise of significant productivity gains resulting from the ability to reuse design and code components more effectively. However, these gains will not occur simply because of the powerful features of the language or the good intentions of the Ada software engineers. The search for dramatic productivity increases will require considerable up-front investment and will need to be carefully focused and planned. This paper offers a paradigm of two concurrent life cycles to establish the groundwork for effectively employing reusable products to develop application systems. The model identifies a &ldquo;Generic Product Development Life Cycle&rdquo; to develop reusable products for a selected application domain. This life cycle runs before and concurrently with the &ldquo;Application-Specific Product Development Life Cycle&rdquo; which makes use of general purpose and domain-specific reusable products to develop applications. The &ldquo;Generic Product Development Life Cycle&rdquo; is concerned with creating, reworking and/or acquiring the reusable assets necessary to support application development. The resulting assets would include such things as domain models, specifications of common domain problems to be solved (specification of recurring patterns), generic architectures to address those problems, process models and Ada software components. The motivation for a generic products development process results from the realization that reuse requires a well-defined domain focus [PRIETO-DIAZ-90], careful planning outside the scope of any specific application development and an investment in the domain.
Parallel Signature Analysis Design with Bounds on Aliasing
Authors: Nirmal R. Saxena, Edward J. McCluskey
Venue: IEEE Transactions on Computers (1997)

This paper presents parallel signature design techniques that guarantee the aliasing probability to be less than 2/L, where L is the test length. Using y signature samples, a parallel signature analysis design is proposed that guarantees the aliasing probability to be less than (y/L)y/2. Inaccuracies and incompleteness in previously published bounds on the aliasing probability are discussed. Simple bounds on the aliasing probability are derived for parallel signature designs using primitive polynomials.
Recovery Analysis of Data Sharing Systems under Deferred Dirty Page Propagation Policies
Authors: Asit Dan, Philip S. Yu, Anant Jhingran
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

In a multinode data sharing environment, different buffer coherency control schemes based on various lock retention mechanisms can be designed to exploit the concept of deferring the propagation or writing of dirty pages to disk to improve normal performance. Two types of deferred write polices are considered. One policy only propagates dirty pages to disk at the times when dirty pages are flushed out of the buffer under LRU buffer replacement. The other policy also performs writes at the times when dirty pages are transferred across nodes. The dirty page propagation policy can have significant implications on the database recovery time. In this paper, we provide an analytical modeling framework for the analysis of the recovery times under the two deferred write policies. We demonstrate how these policies can be mapped onto a unified analytic modeling framework. The main challenge in the analysis is to obtain the pending update count distribution which can be used to determine the average numbers of log records and data I/Os needed to be applied during recovery. The analysis goes beyond previous work on modeling buffer hit probability in a data sharing system where only the average buffer composition, not the distribution, needs to be estimated, and recovery analysis in a single node environment where the complexities on tracking the propagation of dirty pages across nodes and the buffer invalidation effect do not appear. A clipping mechanism can be employed to improve recovery time where the number of pending update on a dirty page is limited by forcing a dirty page to disk after the number of updates accumulated on this page exceeds a certain threshold. The analysis captures the effect of clipping also. Finally, we show the sensitivities of the recovery time and normal performance to the clipping count.
An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks
Authors: Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie
Venue: SIAM Journal on Computing (1998)

Optical communication is likely to significantly speed up parallel computation because the vast bandwidth of the optical medium can be divided to produce communication networks of very high degree. However, the problem of contention in high-degree networks makes the routing problem in these networks theoretically (and practically) difficult. In this paper we examine Valiant's h-relation routing problem, which is a fundamental problem in the theory of parallel computing. The h-relation routing problem arises both in the direct implementation of specific parallel algorithms on distributed-memory machines and in the general simulation of shared-memory models such as the PRAM on distributed-memory machines. In an h-relation routing problem each processor has up to h messages that it wishes to send to other processors and each processor is the destination of at most h messages. We present a lower bound for routing an h-relation (for any h > 1) on a complete optical network of size n. Our lower bound applies to any randomized distributed algorithm for this task. Specifically, we show that the expected number of communication steps required to route an arbitrary h-relation is $\Omega(h + \sqrt{\,\log\log n}\,)$. This is the first known lower bound for this problem which does not restrict the class of algorithms under consideration.
An Efficient Partition of Training Data Set Improves Speed andAccuracy of Cascade-correlation Algorithm
Authors: Igor V. Tetko, Alessandro E. P. Villa
Venue: Neural Processing Letters (1997)

This study extends an application of efficient partition algorithm (EPA) for artificial neural network ensemble trained according to Cascade Correlation Algorithm. We show that EPA allows to decrease the number of cases in learning and validated data sets. The predictive ability of the ensemble calculated using the whole data set is not affected and in some cases it is even improved. It is shown that a distribution of cases selected by this method is proportional to the second derivative of the analyzed function.
Database buffer size investigation for OLTP workloads
Authors: Thin-Fong Tsuei, Allan N. Packer, Keng-Tai Ko
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

It is generally accepted that On-Line Transaction Processing (OLTP) systems benefit from large database memory buffers. As enterprise database systems become larger and more complex, hardware vendors are building increasingly large systems capable of supporting huge memory configurations. Database vendors in turn are developing buffer schemes to exploit this physical memory. How much will these developments benefit OLTP workloads? Through empirical studies on databases sized comparably to those seen in the real-world, this paper presents the characteristics of an industry-standard OLTP benchmark as memory buffer size changes. We design the experiments to investigate how the database size, the buffer size and the number of CPUs impact performance, in particular the throughput and the buffer hit rate on Symmetric Multiprocessor Systems. The relationships of these major database attributes are plotted and key observations are summarized. We discuss how these relationships change as the number of CPUs changes. We further quantify the relationships: 1) between database buffer data hit rate, buffer size and database size, 2) between throughput, buffer data hit rate and database size and 3) between throughput and number of CPUs. Algorithms, rules-of-thumb and examples are presented for predicting performance, sizing memory and making trade-offs between adding more memory and increasing the number of CPUs.
Output-Induced Subspaces, Invariant Directions, and Interpolation in Linear Discrete-Time Stochastic Systems
Authors: Anders Lindquist, György Michaletzky
Venue: SIAM Journal on Control and Optimization (1997)

In this paper we analyze the structure of the class of discrete-time linear stochastic systems in terms of the geometric theory of stochastic realization. We discuss the role of invariant directions, zeros of spectral factors, and output-induced subspaces in determining the systems-theoretical properties of the stochastic systems. A prototype interpolation problem for recovering lost state information is discussed, and it is shown how it can be solved via Kalman filtering recursions tying together the state processes of a family of totally ordered splitting subspaces.
Accelerated reliability analysis for self-healing SONET networks
Authors: Hakki C. Cankaya, V. S. S. Nair
Venue: ACM SIGCOMM Computer Communication Review (1998)

Recently, a parametric State Reward Markov Model (SRMM/p) has been developed for the reliability and availability analysis of self-healing SONET mesh networks [2]. In this paper, we investigate the factors that affect the run-time complexity of the model presented in [2]. In order to accelerate the reliability and availability analysis, we present an approach that aggregates a set of states in the model based on 2-phase hypoexponential distribution. A comparison of the original and the reduced model, with respect to runtime complexity and accuracy, is carried out by applying the models for the analysis of few complex networks.
Computing Accumulated Delays in Real-time Systems
Authors: Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger
Venue: Formal Methods in System Design (1997)

We present a verification algorithm for duration properties of real-time systems. While simple real-time properties constrain the total elapsed time between events, duration properties constrain the accumulated satisfaction time of state predicates. We formalize the concept of durations by introducing duration measures for timed automata. A duration measure assigns to each finite run of a timed automaton a real number &mdash;the duration of the run&mdash; which may be the accumulated satisfaction time of a state predicate along the run. Given a timed automaton with a duration measure, an initial and a final state, and an arithmetic constraint, the duration-bounded reachability problem asks if there is a run of the automaton from the initial state to the final state such that the duration of the run satisfies the constraint. Our main result is an (optimal) PSPACE decision procedure for the duration-bounded reachability problem.
Split Orthogonal Arrays and Maximum Independent ResilientSystems of Functions
Authors: Vladimir I. Levenshtein
Venue: Designs, Codes and Cryptography (1997)

A system of (Boolean) functions in n variables is called randomized if the functions preserve the property of their variables to be independent and uniformly distributed random variables. Such a system is referred to as t-resilient if for any substitution of constants for any i variables, where 0 &le; i &le; t, the derived system of functions in n-i variables will be also randomized. We investigate the problem of finding the maximum number N(n,t,T) of functions in n variables of which any T form a t-resilient system. This problem is reduced to the minimization of the size of certain combinatorial designs, which we call split orthogonal arrays. We extend some results of design and coding theory, in particular, a duality in bounding the optimal sizes of codes and designs, in order to obtain upper and lower bounds on N(n,t,T). In some cases, these bounds turn out to be very tight. In particular, for some infinite subsequences of integers n they allow us to prove that N(n,3,3)=\frac{2^{n-2}}{n},N(n,3,5)=\sqrt{\frac{2^{n-1}}n} ,N(n,3,\frac n2-1)=n , N(n,\frac n2-1,3)=n, N(n,\frac n2-1,5)=\sqrt{2n}. We also find a connection of the problem considered with the construction of unequal-error-protection codes and superimposed codes for multiple access in the Hamming channel.
Unitals and Unitary Polarities in Symmetric Designs
Authors: Rudolf Mathon, Tran Van Trung
Venue: Designs, Codes and Cryptography (1997)

We extend the notion of unital as well as unitary polarity from finite projective planes to arbitrary symmetric designs. The existence of unitals in several families of symmetric designs has been proved. It is shown that if a unital in a point-hyperplane design PG_{d-1}(d,q) exists, then d = 2 or 3; in particular, unitals and ovoids are equivalent in case d = 3. Moreover, unitals have been found in two designs having the same parameters as thePG_4(5,2) , although the latter does not have a unital. It had been not known whether or not a nonclassical design exists, which has a unitary polarity. Fortunately, we have discovered a unitary polarity in a symmetric 2-(45,12,3) design. To a certain extent this example seems to be exceptional for designs with these parameters.
Data warehousing and OLAP for decision support
Authors: Surajit Chaudhuri, Umeshwar Dayal
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

On-Line Analytical Processing (OLAP) and Data Warehousing are decision support technologies. Their goal is to enable enterprises to gain competitive advantage by exploiting the ever-growing amount of data that is collected and stored in corporate databases and files for better and faster decision making. Over the past few years, these technologies have experienced explosive growth, both in the number of products and services offered, and in the extent of coverage in the trade press. Vendors, including all database companies, are paying increasing attention to all aspects of decision support.
Low Bit-Rate Design Considerations for Wavelet-Based ImageCoding
Authors: Michael Lightstone, Eric Majani, Sanjit K. Mitra
Venue: Multidimensional Systems and Signal Processing (1997)

Biorthogonal and orthogonal filter pairs derived from the family of binomial product filters are considered for wavelet transform implementation with the goal of high performance lossy image compression. Using experimental rate-distortion performance as the final measure of comparison, a number of new and existing filters are presented with excellent image coding capabilities. In addition, numerous filter attributes such as orthonormality, transition band sharpness, coding gain, low-band reconstruction error, regularity, and vanishing moments are assessed to determine their importance with regards to the fidelity of the decoded images. While image data compression is specifically addressed, many of the proposed techniques are applicable to other coding applications.
Circuit noise evaluation by Pad&eacute; approximation based model-reduction techniques
Authors: Peter Feldmann, Roland W. Freund
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

This paper introduces a new circuit noise analysis and modeling method. The noise analysis method computes an analytic expression of frequency, in rational form, which represents the Pad\'e approximation of the noise power spectral density. The approximation can be carried out efficiently, to the required accuracy, using a variant of the PVL~\cite{FelF95} or MPVL~\cite{FelF95b} algorithms. The new method is significantly more efficient than traditional methods for noise computation at numerous frequency points. In addition, it allows for a compact and cascadable modeling of noise that can be used in system level simulations.
A fast method of moments solver for efficient parameter extraction of MCMs
Authors: Sharad Kapur, Jinsong Zhao
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

The Method of Moments (MoM) is often effectively used inthe extraction of passive components in modeling integratedcircuits and MCM packaging. MoM extraction, however,involves solving a dense system of linear equations, and using direct factorization methods can be prohibitive for large problems. In this paper, we present a Fast Method of Moments Solver (FMMS) for the rapid solution of such linear systems. Our algorithm exploits the fact that the integral equation kernels are locally "smooth" and can be dramatically compressed via the singular value decomposition(SVD). This greatly speeds up the matrix-vector products ina Krylov-subspace iterative algorithm (e.g., GMRES). Wedemonstrate the efficiency and exibility of our scheme forthe modeling of embedded inductors in MCM-D. Results arepresented to show that the method isaccurate and can betwo orders of magnitude faster than Gaussian eliminationand one order of magnitude faster than standard iterative schemes.
Computation of Pseudospectra by Continuation
Authors: S. H. Lui
Venue: SIAM Journal on Scientific Computing (1997)

The concept of pseudospectrum was introduced by Trefethen to explain the behavior of nonnormal operators. Many phenomena (for example, hydrodynamic instability and convergence of iterative methods for linear systems) cannot be accounted for by eigenvalue analysis but are more understandable by examining the pseudospectra. The straightforward way to compute pseudospectra involves many applications of the singular value decomposition (SVD). This paper presents several fast continuation methods to calculate pseudospectra of different types of matrices.
Motivation and framework for using genetic algorithms for microcode compaction
Authors: Steven Beaty, Darrell Whitley, Gearold Johnson
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered pool of strings that represent regions in the search space. New strings are produced from existing strings using the genetic-based operators of recombination and mutation. Combining these operators with natural selection results in the efficient use of hyperplane information found in the problem to guide the search. The searches are not greatly influenced by local optima or non-continuous functions. Genetic algorithms have been successfully used in problems such as the traveling salesperson and scheduling job shops. Microcode compaction can be modeled as these same types of problems, which motivates the application of genetic algorithms in this domain.
Integration of Sequential Scenarios
Authors: Jules Desharnais, Marc Frappier, Ridha Khédri, Ali Mili
Venue: IEEE Transactions on Software Engineering (1998)

We give a formal relation-based definition of scenarios and we show how different scenarios can be integrated to obtain a more global view of user-system interactions. We restrict ourselves to the sequential case, meaning that we suppose that there is only one user (thus, the scenarios we wish to integrate cannot occur concurrently). Our view of scenarios is state-based, rather than event-based, like most of the other approaches, and can be grafted to the well-established specification language Z. Also, the end product of scenario integration, the specification of the functional aspects of the system, is given as a relation; this specification can be refined using independently developed methods. Our formal description is coupled with a diagram-based, transition-system like, presentation of scenarios, which is better suited to communication between clients and specifiers.
Quadratic and Superlinear Convergence of the Huschens Method for NonlinearLeast Squares Problems
Authors: Hiroshi Yabe, Hideho Ogasawara
Venue: Computational Optimization and Applications (1998)

This paper is concerned with quadratic and superlinear convergence of structured quasi-Newton methods for solving nonlinear least squares problems. These methods make use of a special structure of the Hessian matrix of the objective function. Recently, Huschens proposed a new kind of structured quasi-Newton methods and dealt with the convex class of the structured Broyden family, and showed its quadratic and superlinear convergence properties for zero and nonzero residual problems, respectively. In this paper, we extend the results by Huschens to a wider class of the structured Broyden family. We prove local convergence properties of the method in a way different from the proof by Huschens.
Performance driven floorplanning for FPGA based designs
Authors: Jianzhong Shi, Dinesh Bhatia
Venue: Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays (1997)

Increasing design densities on large FPGAs and greater demand for performance, has calledfor special purpose tools like floorplanner, performance driven router, and more. In this paper we present a floorplanning based design mapping solution that is capable of mapping macro cell based designs as well as hierarchicaldesigns on FPGAs. The mapping solution has been tested extensively on a large collection of designs. We not only outperform state of the art CAE tools from industry in terms of execution time but also achieve much better performance in terms of timing. These methods are especially suitable for mapping designs on very large FPGAs.