ppxscal/embedding_network huggingface dataset:
A Geometric Approach for Constructing Coteries and k-Coteries
Authors: Yu-Chen Kuo, Shing-Tsaan Huang
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. Recently, some mutual exclusion algorithms successfully use logical structures to construct coteries with small quorums sizes. In this paper, we introduce a geometric approach on dealing with the logical structures and present some useful geometric properties for constructing coteries and k-coteries. Based on those geometric properties, a logical structure named three-sided graph is proposed to provide a new scheme for constructing coteries with small quorums: The smallest quorum size is $O(\sqrt N)$ in a homogeneous system with N nodes and O(1) in a heterogeneous system. In addition, we also extend the three-sided graph to the n-sided graph for constructing k-coteries.
Partial evaluation in aircraft crew planning
Authors: Lennart Augustsson
Venue: ACM SIGPLAN Notices (1997)

In this paper we investigate how partial evaluation and program transformations can be used on a real problem, namely that of speeding up airline crew scheduling.Scheduling of crews is subject to many rules and restrictions. These restrictions are expressed in a rule language. However, in a given planning situation much is known to be fixed, so the rule set can be partially evaluated with respect to this known input.The approach is somewhat novel in that it uses truly static input data as well as static input data where the values are known only to belong to a set of values.The results of the partial evaluation is quite satisfactory: both compilation and running times have decreased by using it. The partial evaluator is now part of the crew scheduling system that Carmen Systems AB markets and which is in use at most of the major European airlines and in daily production.
On the Complexity of Matrix Balancing
Authors: B. Kalantari, L. Khachiyan, A. Shokoufandeh
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

An $n \times n$ matrix with nonnegative entries is said to be $balanced$ if for each $i=1,\dots,n$ the sum of the entries of its $i$th row is equal to the sum of the entries of its $i$th column. An $n \times n$ matrix $A$ with nonnegative entries is said to be $balancable$ $via$ $diagonal$ $similarity$ $scaling$ if there exists a diagonal matrix $X$ with positive diagonal entries such that $XAX^{-1}$ is balanced. We give upper and lower bounds on the entries of $X$ and prove the necessary sensitivity analysis in the required accuracy of the minimization of an associated convex programming problem. These results are used to prove the polynomial-time solvability of computing $X$ to any prescribed accuracy.
Hierarchical algorithms and architectures for parallel scientific computing
Authors: Tony F. Chan
Venue: Proceedings of the 4th international conference on Supercomputing (1990)

There has been a recent emergence of many interesting and highly efficient hierarchical (multilevel) algorithms (e.g. multigrid, domain decomposition, wavelets, multilevel preconditioning, the fast multipole algorithms, etc.) for solving numerical problems in scientific computing. These algorithms derive their efficiency from using a hierarchical approach to capture the sharing of global information which is inherent in the physical processes being modelled. In addition to being computationally efficient, these algorithms also possess relatively high degrees of parallelism. I therefore argue that the architectures of parallel computers (especially massively parallel ones) should be designed to support hierarchical communication and synchronization needs of these algorithms. Hierarchical architectures are also more universal because they go beyond supporting a particular class of algorithms to supporting the underlying physical processes being modelled. Finally, I propose that algorithm designers take a critical look at traditional kernel algorithms and re-examine their cost-effectiveness in a massively parallel computing environment.
Linear Object Classes and Image Synthesis From a Single Example Image
Authors: Thomas Vetter, Tomaso Poggio
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

The need to generate new views of a 3D object from a single real image arises in several fields, including graphics and object recognition. While the traditional approach relies on the use of 3D models, we have recently introduced [1], [2], [3] simpler techniques that are applicable under restricted conditions. The approach exploits image transformations that are specific to the relevant object class, and learnable from example views of other "prototypical" objects of the same class.In this paper, we introduce such a technique by extending the notion of linear class proposed by Poggio and Vetter. For linear object classes, it is shown that linear transformations can be learned exactly from a basis set of 2D prototypical views. We demonstrate the approach on artificial objects and then show preliminary evidence that the technique can effectively "rotate" high-resolution face images from a single 2D view.
An efficient model for DSP code generation: performance, code size, estimated energy
Authors: Catherine H. Gebotys
Venue: Proceedings of the 10th international symposium on System synthesis (1997)

This paper presents a model for simultaneous instruction selection, compaction, and register allocation. An arc mapping model along with logical propositions is used to create an optimization model. Code is generated in fast cpu times and is optimized for minimum code size, maximum performance or estimated energy dissipation. Code generated for realistic DSP applications provide performance and code size improvements from 1.09 up to 2.18 times for the TMS320C2x processor compared to previous research and a commercial compiler. In all examples up to 106 instructions are generated in under one cpu minute. This research is important for industry since DSP code can be efficiently generated with constraints on code size, performance, energy dissipation.
Slotted ALOHA and CDPA: a comparison of channel access performance in cellular systems
Authors: Flaminio Borgonovo, Michele Zorzi
Venue: Wireless Networks (1997)

The paper compares the performance of two channel-access schemes suitable for the cellular environment, which, in particular, allow the packet capture and can deal with inter-cell interference. The first scheme is the well known S-ALOHA while the second one is the Capture Division Packet Access, recently proposed. The comparison is analytically performed over a common system with a common analytical model. Despite the many analyses appeared on S-ALOHA, the one we develop is new because a throughput density uniformly distributed on the plane is considered in a multiple cell environment. The analysis clearly shows the effect of intra-cell and inter-cell interference on the ALOHA system and quantifies the throughput gain achieved by CDPA, which completely avoids intra-cell interference. Our analysis also provides insight about the effectiveness of power control on both systems.
GMRES vs. Ideal GMRES
Authors: Kim-Chuan Toh
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

The GMRES algorithm minimizes $\norm{p(A)b}$ over polynomials $p$ of degree $n$ normalized at $z=0$. The ideal GMRES problem is obtained if one considers minimization of $\norm{p(A)}$ instead. The ideal problem forms an upper bound for the worst-case true problem, where the GMRES norm $\norm{p_b(A)b}$ is maximized over $b$. In work not yet published, Faber, Joubert, Knill, and Manteuffel have shown that this upper bound need not be attained, constructing a $4 \times 4$ example in which the ratio of the true to ideal GMRES norms is $0.9999$. Here, we present a simpler $4 \times 4$ example in which the ratio approaches zero when a certain parameter tends to zero. The same example also leads to the same conclusion for Arnoldi vs. ideal Arnoldi norms.
APL and robotics
Authors: A. Martin Euredjian
Venue: ACM SIGAPL APL Quote Quad (1985)

Program execution speeds on today's general purpose APL running computers do not allow APL to be used as a Robot control language, this execution speed problem will go away with faster and better processors. This paper presents an attempt to make APL work for Robotics with today's technology. The basic concept is quite simple: Leave to APL what it can do in real time and have another computer running a faster language do the rest. This allows for APL program development until the other computer with the faster language can be replaced with a very fast APL running system. The auxiliary computer is an eighth processor parallel computer running FORTH. Except for the IBM-PC used to run STSC corporation's APL*PLUS/PC SYSTEM all of the hardware for this project has been designed and built by the author from the ground up.
In black and white: an integrated approach to class-level testing of object-oriented programs
Authors: Huo Yan Chen, T. H. Tse, F. T. Chan, T. Y. Chen
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1998)

Because of the growing importance of object-oriented programming, a number of testing strategies have been proposed. They are based either on pure black-box or white-box techniques. We propose in this article a methodology to integrate the black- and white-box techniques. The black-box technique is used to select test cases. The white-box technique is mainly applied to determine whether two objects resulting from the program execution of a test care are observationally equivalent. It is also used to select test cases in some situations. We define the concept of a fundamental pair as a pair of equivalent terms that are formed by replacing all the variables on both sides of an axiom by normal forms. We prove that an implementation is consistent with respect to all equivalent terms if and only if it is consistent with respect to all fundamental pairs. In other words, the testing coverage of fundamental pairs is as good as that of all possible term rewritings, and hence we need only concentrate on the testing of fundamental pairs. Our strategy is based on mathematical theorems. According to the strategy, we propose an algorithm for selecting a finite set of fundamental pairs as test cases. Given a pair of equivalent terms as a test case, we should then determine whether the objects that result from executing the implemented program are observationally equivalent. We prove, however, that the observational equivalence of objects cannot be determined using a finite set of observable contexts (which are operation sequences ending with an observer function) derived from any black-box technique. Hence we supplement our approach with a &ldquo;relevant observable context&rdquo; technique, which is a heuristic white-box technique to select a relevant finite subset of the set of observable contexts for determining the observational equivalence. The relevant observable contezxts are constructed from a data member relevance graph (DRG), which is an abstraction of the given implementation for a given specificatin. A semiautomatic tool hass been developed to support this technique.
Embedding the Linear Structure of Planar Spaces into ProjectiveSpaces
Authors: Klaus Metsch
Venue: Designs, Codes and Cryptography (1997)

We show that every non-degenerate planar space with v points and &pi; planes can be embedded as a linear space into PG(3,q) for some prime power q provided that 1000(&pi; - v) &le; v^&frac56;
Size separation spatial join
Authors: Nick Koudas, Kenneth C. Sevcik
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

We introduce a new algorithm to compute the spatial join of two or more spatial data sets, when indexes are not available on them. Size Separation Spatial Join (S3J) imposes a hierarchical decomposition of the data space and, in contrast with previous approaches, requires no replication of entities from the input data sets. Thus its execution time depends only on the sizes of the joined data sets. We describe S3J and present an analytical evaluation of its I/O and processor requirements comparing them with those of previously proposed algorithms for the same problem. We show that S3J has relatively simple cost estimation formulas that can be exploited by a query optimizer. S3J can be efficiently implemented using software already present in many relational systems. In addition, we introduce Dynamic Spatial Bitmaps (DSB), a new technique that enables S3J to dynamically or statically exploit bitmap query processing techniques. Finally, we present experimental results for a prototype implementation of S3J involving real and synthetic data sets for a variety of data distributions. Our experimental results are consistent with our analytical observations and demonstrate the performance benefits of S3J over alternative approaches that have been proposed recently.
Evolving the VV A process for the ALSP Joint Training Confederation
Authors: John A. Tufarolo, Ernest H. Page
Venue: Proceedings of the 28th conference on Winter simulation (1996)

The Aggregate Level Simulation Protocol (ALSP) Joint Training Confederation (JTC) provides the environment for several large-scale computer-assisted command post exercises (CPXs) each year. The JTC consists of a collection of Service simulations and evolves according to an annual development cycle. The JTC environment poses several challenges to simulation model verification, validation and accreditation (VV&A). Some of these challenges are of a technical or fundamental nature, others are more programmatic. We briefly describe several of these challenges and the efforts currently underway to address them.
A Neural Network for PCA and Beyond
Authors: Colin Fyfe
Venue: Neural Processing Letters (1997)

Principal Component Analysis (PCA) has been implemented by several neural methods. We discuss a Network which has previously been shown to find the Principal Component subspace though not the actual Principal Components themselves. By introducing a constraint to the learning rule (we do not allow the weights to become negative) we cause the same network to find the actual Principal Components. We then use the network to identify individual independent sources when the signals from such sources are ORed together.
Generating Cuts from Surrogate Constraint Analysis for Zero-Oneand Multiple Choice Programming
Authors: Fred Glover, Hanif D. Sherali, Youngho Lee
Venue: Computational Optimization and Applications (1997)

This paper presents a new surrogate constraint analysis that gives rise to a family of strong valid inequalities called surrogate-knapsack (S-K) cuts. The analytical procedure presented provides a strong S-K cut subject to constraining the values of selected cut coefficients, including the right-hand side. Our approach is applicable to both zero-one integer problems and problems having multiple choice (generalized upper bound) constraints. We also develop a strengthening process that further tightens the S-K cut obtained via the surrogate analysis. Building on this, we develop a polynomial-time separation procedure that successfully generates an S-K cut that renders a given non-integer extreme point infeasible. We show how sequential lifting processes can be viewed in our framework, and demonstrate that our approach can obtain facets that are not available to standard lifting methods. We also provide a related analysis for generating &ldquo;fast cuts&rdquo;. Finally, we present computational results of the new S-K cuts for solving 0-1 integer programming problems. Our outcomes disclose that the new cuts are capable of reducing the duality gap between optimal continuous and integer feasible solutions more effectively than standard lifted cover inequalities, as used in modern codes such as the CPLEX mixed 0-1 integer programming solver.
CMOS PLL Design in a Digital Chip Environment
Authors: Delvan A. Ramey
Venue: Analog Integrated Circuits and Signal Processing (1997)

CMOS PLL&lsquo;s are becoming increasingly useful for clock synthesis and recovery in CPU and other digital chip designs. However, the packaging and process are defined to meet the requirements of the digital chip, not the analog portions of the PLL. The environment defined by the digital requirements includes the package, the process and the dominant noise source. Packages for complex digital chips are larger and have more complex frequency and signal integrity characteristics than smaller packages that are appropriate for dedicated analog chips. Digital CMOS processes lack the quality capacitors, resistors and possible variety of devices that may be found in a process developed specifically for analog purposes. Digital switching causes significant noise that dominates the spectrum that the circuit designer must worry about. This paper considers a typical CMOS PLL design from the digital chip design viewpoint.
Improved query performance with variant indexes
Authors: Patrick O'Neil, Dallan Quass
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updates are present. The current paper presents a short review of current indexing technology, including row-set representation by Bitmaps, and then introduces two approaches we call Bit-Sliced indexing and Projection indexing. A Projection index materializes all values of a column in RID order, and a Bit-Sliced index essentially takes an orthogonal bit-by-bit view of the same data. While some of these concepts started with the MODEL 204 product, and both Bit-Sliced and Projection indexing are now fully realized in Sybase IQ, this is the first rigorous examination of such indexing capabilities in the literature. We compare algorithms that become feasible with these variant index types against algorithms using more conventional indexes. The analysis demonstrates important performance advantages for variant indexes in some types of SQL aggregation, predicate evaluation, and grouping. The paper concludes by introducing a new method whereby multi-dimensional group-by queries, reminiscent of OLAP/Datacube queries but with more flexibility, can be very efficiently performed.
How to rate numerical packages? Foundations of ratings, and their possible use in numerical mathematics, in education, and in military design
Authors: Raúl Antonio Trejo Ramírez, Vladik Kreinovich
Venue: ACM SIGNUM Newsletter (1997)

One of the major human activities is solving problems. It is desirable to be able to predict whether a problem will be solved or not or, more precisely, the probability that a person can solve a problem. This probability can be estimated based on previous experience of people solving similar problems.Then, it is necessary to somehow describe the ability of the problem-solvers as well as the difficulty of the problems. This can be done by assigning to each problem or problem solver a rating, i.e., a number that represents the skill of the problem solver or the difficulty of the problem.In this paper, we propose to use a rating system developed in sports to other real-life problems, including rating of numerical packages.
Object-relational database systems (tutorial): principles, products and challenges
Authors: Michael J. Carey, Nelson M. Mattos, Anil K. Nori
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

Object-relational database systems, a.k.a. &ldquo;universal servers,&rdquo; are emerging as the next major generation of commercial database system technology. Products from relational DBMS vendors including IBM, Informix, Oracle, UniSQL, and others, include object-relational features today, and all of the major vendors appear to be on course to delivering full object-relational support in their products over the next few years. In addition, the SQL3 standard is rapidly solidifying in this area. The goal of this tutorial is to explain what the key features are of object-relational database systems, review what today's products provide, and then look ahead to where these systems are heading. The presentation will be aimed at general SIGMOD audience, and should therefore be appropriate for users, practitioners, and/or researchers who want to learn about object-relational database systems.
Efficient module-based modeling for a large-scale AS/RS-AGV system
Authors: Soemon Takakuwa
Venue: Proceedings of the 28th conference on Winter simulation (1996)

A method of modeling large-scale AS/RS-AGV systems is proposed in an attempt to describe the AS/RS precisely and flexibly in which a lot of items are stored and retrieved. The system considered in this study consists of the large-scale AS/RS with stacker cranes, the looped track AGV system, aisle conveyors connecting these two systems, and incoming and outgoing conveyors. There are two major stages to model large-scale AS/RS-AGV systems efficiently and to execute simulation experiments. The first stage is to generate a simulation program by placing appropriate modules and inputting the selected parameters such as the number of banks, the number of bays, the number of levels of AS/RS, and the number of AGVs. The second stage is to perform simulation experiments. In the proposed model, every item number puts on each rack, the corresponding number of cases for each item, the time of arriving in the warehouse, and the time of departing from the system are stored and recorded. Generally, it takes a lot of time to build a complex program for a particular type of large-scale AS/RS-AGV system. It is found that simulation/ animation models can be made quickly, by using a module-based modeling method developed in this study.
The ARCHIMEDES Network System: a system for searching and accessing information in multiplemultimedia sources
Authors: Jan L. G. Dietz, Ruud Van Der Pol, Floris Wiesman
Venue: Journal of Intelligent Information Systems (1997)

The amount of information available to information workers recently has become overwhelming. This confronts information workers with two major problems: finding the information needed, and accessing it; they are called the search problem and the access problem, respectively. As the main result of our research an architecture is specified of an automated tool that provides integrated support for searching and accessing multimedia documents that may be located at arbitrary places. The architecture contains a database with information about the documents and with thesaurus-like information. The architecture also contains a browse mechanism and a query mechanism for inspecting the database. In the design process of the architecture, several fundamental questions arose, like &ldquo;What is a document?&rdquo; and &ldquo; What is a medium kind?&rdquo;. The developed answers to some of these questions are considered to have a general character and thus to be useful also outside the scope of the research at hand. The paper concludes with an overview of the current status of the project and a discussion of future work.