ppxscal/embedding_network huggingface dataset:
Educators' symposium
Authors: Jutta Eckstein
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

The Educators' Symposium is a unique forum for educators from both academia and industry who have a vested interest in OO education and training. The Educators' Symposium facilitates the exchange of ideas in a number of ways, including featured talks by professionals on the cutting edge of OO education, paper presentations, and activity sessions. Furthermore the successful poster session has been expanded to an exhibition. This exhibition provides the ideal opportunity for exchanging teching and learning techniques, networking with professionals facing similar challenges, and exploring teaching and learning tools. All attendees are invited to actively participate in the exhibition by bringing any related material they would like to share.
Test Cycle Count Reduction in a Parallel Scan BIST Environment
Authors: Bechir Ayari, Prab Varma
Venue: Journal of Electronic Testing: Theory and Applications (2000)

This paper describes a novel method that can be used to reduce test cycle count in a parallel access scan based Built-In-Self-Test (BIST) environment. An algorithm that allows the efficient application of deterministically generated patterns is proposed. This approach allows BIST fault coverage to be increased using deterministic vectors, while minimizing the cost, in terms of test cycles, of applying the vectors.
A Floating Point Vectoring Algorithm Based on Fast Rotations
Authors: K. J. Van Der Kolk, J. A. Lee, E. F. A. Deprettere
Venue: Journal of VLSI Signal Processing Systems (2000)

The idea of approximate rotations has been introduced by J. G&ouml;tze and G. Hekstra. G. Hekstra and E. Deprettere extended the concept to orthogonal fast rotations and formalized the concept by providing a fast rotation theory. In this theory, the emphasish as been on fast rotation, whereas fast rotation-based vectorization has only been considered in an approximating sense in examples published by J. G&ouml;tze and G. Hekstra. The formalization of fast rotation-based vectorization is the subject of this paper. The few known approximate fast vectorization algorithms are special cases of the generic fast rotation-based vectorization algorithm proposed in this paper.
A rule of thumb of icons' visual distinctiveness
Authors: Sri Hastuti Kurniawan
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

Icon's distinctiveness could be divided into physical distinctiveness, which is related to recognition of the objects the icon is comprised of, and perceptual distinctiveness, which is related to the understanding of what the objects in the icon represent. An icon is usually designed in an environment that consists of a set of icons. In this setting, the icon has to be physically and perceptually distinguishable among the other icons in the set. Icons performing similar functions, however, should bear family resemblance to increase family distinctiveness.
Reliable Estimation of Dense Optical Flow Fields with Large Displacements
Authors: Luis Alvarez, Joachim Weickert, Javier Sánchez
Venue: International Journal of Computer Vision (2000)

In this paper we show that a classic optical flow technique by Nagel and Enkelmann (1986, IEEE Trans. Pattern Anal. Mach. Intell., Vol. 8, pp. 565&ndash;593) can be regarded as an early anisotropic diffusion method with a diffusion tensor. We introduce three improvements into the model formulation that (i) avoid inconsistencies caused by centering the brightness term and the smoothness term in different images, (ii) use a linear scale-space focusing strategy from coarse to fine scales for avoiding convergence to physically irrelevant local minima, and (iii) create an energy functional that is invariant under linear brightness changes. Applying a gradient descent method to the resulting energy functional leads to a system of diffusion&ndash;reaction equations. We prove that this system has a unique solution under realistic assumptions on the initial data, and we present an efficient linear implicit numerical scheme in detail. Our method creates flow fields with 100 % density over the entire image domain, it is robust under a large range of parameter variations, and it can recover displacement fields that are far beyond the typical one-pixel limits which are characteristic for many differential methods for determining optical flow. We show that it performs better than the optical flow methods with 100 % density that are evaluated by Barron et al. (1994, Int. J. Comput. Vision, Vol. 12, pp. 43&ndash;47). Our software is available from the Internet.
Parallel Synchronous and Asynchronous Space-Decomposition Algorithms for Large-Scale Minimization Problems
Authors: Chin-Sung Liu, Ching-Huan Tseng
Venue: Computational Optimization and Applications (2000)

Three parallel space-decomposition minimization (PSDM) algorithms, based on the parallel variable transformation (PVT) and the parallel gradient distribution (PGD) algorithms (O.L. Mangasarian, SIMA Journal on Control and Optimization, vol. 33, no. 6, pp. 1916&ndash;1925.), are presented for solving convex or nonconvex unconstrained minimization problems. The PSDM algorithms decompose the variable space into subspaces and distribute these decomposed subproblems among parallel processors. It is shown that if all decomposed subproblems are uncoupled of each other, they can be solved independently. Otherwise, the parallel algorithms presented in this paper can be used. Numerical experiments show that these parallel algorithms can save processor time, particularly for medium and large-scale problems. Up to six parallel processors are connected by Ethernet networks to solve four large-scale minimization problems. The results are compared with those obtained by using sequential algorithms run on a single processor. An application of the PSDM algorithms to the training of multilayer Adaptive Linear Neurons (Madaline) and a new parallel architecture for such parallel training are also presented.
Adding parametric polymorphism to the common object request broker architecture (CORBA) (poster session)
Authors: Wayne L. Bethea
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

The research displayed in this poster showcases issues surrounding adding parametric polymorphism to CORBA. The merits of parametric polymorphism are widely published, yet there is no support for the parametric polymorphism paradigm in CORBA. This research should be of special interest to C++ programmers, and other programmers accustomed to generic programming, frustrated by this lack of support.
A nonrecursive list compacting algorithm
Authors: C. J. Cheney
Venue: Communications of the ACM (1970)

A simple nonrecursive list structure compacting scheme or garbage collector suitable for both compact and LISP-like list structures is presented. The algorithm avoids the need for recursion by using the partial structure as it is built up to keep track of those lists that have been copied.
A computational theory of normative positions
Authors: Marek Sergot
Venue: ACM Transactions on Computational Logic (TOCL) (2001)

The Kanger-Lindahl theory of normative positions attempts to use a combination of deontic logic (the logic of obligation and permission) and a logic of action/agency to give a formal account of obligations, duties, rights, and other complex normative concepts. This paper presents a generalization and further development of this theory, together with methods for its automation and application to practical examples. The resulting theory is intended to be applied in the representation and analysis of laws, regulations, and contracts, in the specification of aspects of computer systems, in multiagent systems, and as a contribution to the formal theory of organizations. Particular attention is paid to representations at varying levels of detail and the relationships that hold between them. The last part presents Norman-G, an automated support system intended to facilitate application of the theory to the analysis of practical problems, with a small example to illustrate its use.
A heuristic problem solving design system for equipment or furniture layouts
Authors: Charles E. Pfefferkorn
Venue: Communications of the ACM (1975)

The Designer Problem Solver (DPS) demonstrates that the computer can perform simple design tasks. In particular, it designs furniture and equipment layouts. This task was chosen because it is simple, well defined, and characteristic of many design tasks in architecture, engineering, urban planning, and natural resource management. These space planning tasks usually involve manipulating two-dimensional representations of objects to create feasible or optimal solutions for problems involving topological and metric spatial constraints. The paper describes extensive tests performed on the program. DPS is a heuristic problem solver with a planning phase prefixed to it. It uses the planning process to give it a sense of direction, diagnostic procedures to locate difficulties, and remedial actions to recover from difficulties. It uses a convex polygon representation to accurately describe the objects and the layout. This representation allows topological and metric constraints to be tested and the design to be easily updated. DPS has been applied to 50 problems. While it is slow and limited in scope, the ideas behind it are general. It demonstrates the need for selectivity in controlling search and the methods used to achieve it: task-specific information, planning, diagnostic procedures, remedial actions, and selective alternative generators.
The AppLeS parameter sweep template: user-level middleware for the grid
Authors: Henri Casanova, Graziano Obertelli, Francine Berman, Rich Wolski
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

The Computational Grid is a promising platform for the efficient execution of parameter sweep applications over large parameter spaces. To achieve performance on the Grid, such applications must be scheduled so that shared data files are strategically placed to maximize re-use, and so that the application execution can adapt to the deliverable performance potential of target heterogeneous, distributed and shared resources. Parameter sweep applications are an important class of applications and would greatly benefit from the development of Grid middleware that embeds a scheduler for performance and targets Grid resources transparently. In this paper we describe a user-level Grid middleware project, the AppLeS Parameter Sweep Template (APST), that uses application-level scheduling techniques and various Grid technologies to allow the efficient deployment of parameter sweep applications over the Grid. We discuss several possible scheduling algorithms and detail our software design. We then describe our current implementation of APST using systems like Globus, NetSolve and Network Weather Service, and present experimental results.
Computation of minimal generators of ideals of fat points
Authors: Francesca Cioffi, Ferruccio Orecchia
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

We present an implementation of an algorithm for computing minimal homogeneous generators and Hilbert functions of ideals of fat points. First we construct a set of generators by an interpolating method which is based on the Hermite interpolation and generalizes the algorithm of [20] to projective space. Then, we minimalize the generators by the same algorithm which has been developed in [6] by exploiting results of [23] and [19] and which has been already successfully applied to ideals of points, to ideals of rational curves [3] and to ideals of general parametric varieties [22].
Reasoning about commitments and penalties for coordination between autonomous agents
Authors: Cora B. Excelente-Toledo, Rachel A. Bourne, Nicholas R. Jennings
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

This paper develops and evaluates a new decision theoretic framework in which autonomous agents can make rational choices about coordinating their actions. The framework covers the decisions that are involved in determining when and how to coordinate, when to respond to requests for coordination and when it is profitable to drop contracts in order to exploit better opportunities. Our motivating hypothesis is that enabling agents to dynamically set and re-assess both their degree of commitment to one another and the sanctions for decommitment according to their prevailing circumstances will make coordination more effective. This hypothesis is evaluated, empirically, in a grid-world scenario, taking into account three levels of commitments (total, partial and loose) and three kinds of sanctions (fixed, partially sanctioned and sunk cost).
Adaptive interaction for enabling pervasive services
Authors: Michael Samulowitz, Florian Michahelles, Claudia Linnhoff-Popien
Venue: Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access (2001)

We describe an architecture that allows mobile users to access a variety of services provided by pervasive computing environments. Novel to our approach is that the system selects and executes services taking into account arbitrary contextual information (e.g. location or preferences). Our architecture is based on an adaptive service interaction scheme; individual service requests are attributed by context constraints, which specify the adaption policy. Context constraints may relate to spatial or temporal concerns. We propose a document-based approach; so called Context-Aware Packets (CAPs) contain context constraints and data for describing an entire service request. Intermediary network nodes route and apply the data to services, which match the embedded constraints. Services are identified by characterizing attributes, rather then explicit network addresses. The execution of selected services may be deferred, and triggered by a specific event. Service requests carry the context of their use, therefore our system works well in environments with intermitted connectivity, less interaction with the issuing requester is required.
Continued operation notation for symbol manipulation and array processing
Authors: M. P. Barnett
Venue: Communications of the ACM (1963)

A brief account is given of a notational device that is very useful in the formal representation of syntaxes, string relationships and string transformation procedures and also of computing procedures that deal with arrays of functions of many variables. The device consists of the use of certain &ldquo;continued operation&rdquo; or &ldquo;collective&rdquo; symbols that are analogous to the summation symbol &sum; and continued multiplication symbol &prod; of conventional mathematics.
An Analog Correlator for a WCDMA Receiver
Authors: M. Neitola, T. Rahkonen
Venue: Analog Integrated Circuits and Signal Processing (2001)

A prototype analog correlator structure suitable for a WCDMA receiver was implemented. The advantages of this correlator are low power consumption compared to a digital correlator and small chip area. The target is to use such correlator as parallel correlators (fingers) of a RAKE receiver. The analog baseband correlator utilizes passive MOS-multipliers, a first-order low-pass continuous-time oversampling sigma&ndash;delta analog-to-digital converter and a second-order sinc type of decimation filter (for both I and Q input paths). The modulator sampling rate is twice the chip rate with oversampling ratios of 8&ndash;512 depending of the PN code length. The circuit was implemented in 0.8 &mu;m CMOS-technology with a supply voltage of 2.8 V. The layout size is 345 &mu;m&times;686 &mu;m and the current drain is approximately 370 &mu;A.
Permutation Based Design of Orthogonal Block Transformsand Filter Banks
Authors: Hakan Caglar, Sinan G\" Unt\" Urk, Emin Anarim, B\" Ulent Sankur
Venue: Multidimensional Systems and Signal Processing (2001)

In this work, a new efficient design technique for orthogonal block transforms, lapped orthogonal transforms and 4-channel perfect reconstruction subband filter banks is developed. The technique consists of permutation and sign change operations on a reference vector. This approach can be thought of as a generalization of the Hadamard transform in the sense that the reference vector {\mbox{ h }}_{0} (which will be a prototype low-pass filter also forming one of the basis functions of the transform) will in general have components that are not identically 1's. The design technique, a constructive method based on Hadamard arrays, provides a convenient means to explore new transforms. The merit of our method is that the number of unknowns and equality constraints are both reduced significantly which render the design procedure much more feasible while guaranteeing at the same time linear phase.
On the use of on-demand layer addition (ODL) with mutli-layer multicast transmission techniques
Authors: Vincent Roca
Venue: Proceedings of NGC 2000 on Networked group communication (2000)

This work deals with the multicast transmission of data using multiple multicast groups. One reason to use multiple groups is to address the potential heterogeneity of receivers. But there is a risk that some of the groups are not used and sending data to a group with no receiver has many costs that are often underestimated. As IP multicast becomes widely deployed and used, these issues may well compromise its scalability. In this paper we introduce a new protocol, ODL (On Demand Layer Addition), which enables a source to use only the layers that are actually required by the current set of receivers. We describe its behavior when used with several kinds of packet scheduling schemes (cumulative or not) and different scenarios (one-to-many versus many-to-many). We have implemented the ODL protocol, integrated it in the MCL multicast library and we report several experiments that assess its benefits.
Productivity of multiprogrammed computers&mdash;progress in developing an analytic prediction method
Authors: Daniel J. Lasser
Venue: Communications of the ACM (1969)

Multiprogramming as it is discussed here is a mode of computer operation in which two or more programs are concurrently in processor memory and proceeding, each using the same central processor unit (CPU) and input-output (I/O) channels. These programs are actually proceeding intermittently and singly, according to eligibility (readiness to proceed) and priority. It is useful to be able to represent them as proceeding continuously and simultaneously, each at an effective rate, which may be a fraction of that which it would enjoy in the absence of the other programs. The effective progress rate of each program is sensitive to many detailed characteristics of itself and its co-residents; and simulation has been the best available method of predicting it. This paper presents the results of progress in developing an alternative to simulation, a simulation-tested iterative computation of these rates under certain situations. The algorithm is sensitive to most of the factors that control the phenomenon, including nonquantitative or topological features of the programs' structures.
A language for describing the functions of synchronous systems
Authors: David L. Parnas
Venue: Communications of the ACM (1966)

Before the design of a system is started, the exact function desired of it should be specified. It is suggested that a computer-oriented language be used for this purpose. The inadequacies of the standard programming languages for the description of systems are discussed, and a dialect of ALGOL which is suitable for describing synchronous systems is introduced. These descriptions can be used for simulation and automatic design of the system described, in addition to communicating system specifications.
Algorithm 807: The SBR Toolbox&mdash;software for successive band reduction
Authors: Christian H. Bischof, Bruno Lang, Xiaobai Sun
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

We present a software toolbox for symmetric band reduction via orthogonal transformations, together with a testing and timing program. The toolbox contains drivers and computational routines for the reduction of full symmetric matrices to banded form and the reduction of banded matrices to narrower banded or tridiagonal form, with optional accumulation of the orthogonal transformations, as well as repacking routines for storage rearrangement. The functionality and the calling sequences of the routines are described, with a detailed discussion of the &ldquo;control&rdquo; parameters that allow adaptation of the codes to particular machine and matrix characteristics. We also briefly describe the testing and timing program included in the toolbox.
On the Generation of Some Embeddable GF(2) Geometries
Authors: B. N. Cooperstein
Venue: Journal of Algebraic Combinatorics: An International Journal (2001)

The generating rank is determined for several GF(2)-embeddable geometries and it is demonstrated that their generating and embedding ranks are equal. Specifically, we prove that each of the two generalized hexagons of order (2, 2) has generating rank 14, that the central involution geometry of the Hall-Janko sporadic group has generating rank 28, and that the dual polar space DU(6,2) has generating rank 22. We also include a survey of all instances in which either the generating or embedding rank of an embeddable GF(2) geometry is known.
Analytical cache models with applications to cache partitioning
Authors: G. Edward Suh, Srinivas Devadas, Larry Rudolph
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

An accurate, tractable, analytic cache model for time-shared systems is presented, which estimates the overall cache miss-rate of a multiprocessing system with any cache size and time quanta. The input to the model consists of the isolated miss-rate curves for each process, the time quanta for each of the executing processes, and the total cache size. The output is the overall miss-rate. Trace-driven simulations demonstrate that the estimated miss-rate is very accurate. Since the model provides a fast and accurate way to estimate the effect of context switching, it is useful for both understanding the effect of context switching on caches and optimizing cache performance for time-shared systems. A cache partitioning mechanism is also presented and is shown to improve the cache miss-rate up to 25% over the normal LRU replacement policy.
Convergence of the Gradient Projection Method for Generalized Convex Minimization
Authors: Changyu Wang, Naihua Xiu
Venue: Computational Optimization and Applications (2000)

This paper develops convergence theory of the gradient projection method by Calamai and Mor&eacute; (Math. Programming, vol. 39, 93&ndash;116, 1987) which, for minimizing a continuously differentiable optimization problem min&lcub;f(x) : x &isin; &Omega;&rcub; where &Omega; is a nonempty closed convex set, generates a sequence x_k+1 &equals; P(x_k &minus; &alpha;_k &nabla; f(x_k)) where the stepsize &alpha;_k > 0 is chosen suitably. It is shown that, when f(x) is a pseudo-convex (quasi-convex) function, this method has strong convergence results: either x_k &rarr; x^&ast; and x^&ast; is a minimizer (stationary point)&semi; or &Verbar;x_k&Verbar; &rarr; &infin; arg min&lcub;f(x) : x &isin; &Omega;&rcub; &equals; &empty;, and f(x_k) &darr; inf&lcub;f(x) : x &isin; &Omega;&rcub;.