ppxscal/embedding_network huggingface dataset:
Polynomial remainder sequence and approximate GCD
Authors: Tateaki Sasaki, Mutsuko Sasaki
Venue: ACM SIGSAM Bulletin (1997)

Let P1 and P2 be polynomials, univariate or multivariate, and let (P1, P2, P3, hellip;, Pi, hellip;) be a polynomial remainder sequence. Let Ai and Bi (i = 3, 4, hellip;) be polynomials such that AiP1 + BiP2 = Pi, deg(Ai) lt; deg(P2) - deg(Pi), deg(Bi) lt; deg(P1) - deg(Pi), where the degree is for the main variable. We derive relations such as CiP1 = -Bi+1Pi + BiPi+1 and CiP2 = Ai+1Pi - AiPi+1, where Ci is independent of the main variable. Using these relations, we discuss approximate common divisors calculated by polynomial remainder sequence.
A framework for supporting quality-based multimedia presentation in educational digital libraries
Authors: Aidong Zhang, Thomas V. Johnson
Venue: Proceedings of the IEEE international forum on Research and technology advances in digital libraries (1997)

An educational digital library is a specialized digital library containing instructional materials, such as class lectures, seminar presentations, and various training materials. These materials consist of the combination of audio, video and image data. We believe that such an environment has diverse uses, including student training, human resource development, and asynchronous distance learning. In this paper, we investigate a framework for supporting the continuous and synchronized presentation of multimedia streams in educational digital libraries. This framework includes the design of an information infrastructure built on top of a distributed multimedia database environment, the specification and representation of synchronization on media streams, the realization of appropriate synchronization granularity, and the scheduling principles for the presentation of multimedia streams. This investigation will formulate criteria for specifying and scheduling the skipping/pausing of media streams with asynchronous presentations when various delays occur. Adaptability to various quality-of-service requirements are supported in the framework. Synchronization mechanisms at the client side are then proposed to implement the framework. Experimental analysis are conducted using instructional materials. Thus, this framework can be readily used to facilitate various education and training applications.
Highly accurate data value prediction using hybrid predictors
Authors: Kai Wang, Manoj Franklin
Venue: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture (1997)

Data dependences (data flow constraints) present a major hurdle to the amount of instruction-level parallelism that can be exploited from a program. Recent work has suggested that the limits imposed by data dependences can be overcome to some extent with the use of data value prediction. That is, when an instruction is fetched, its result can be predicted so that subsequent instructions that depend on the result can use this predicted value. When the correct result becomes available, all instructions that are data dependent on that prediction can be validated. This paper investigates a variety of techniques to carry out highly accurate data value predictions. The first technique investigates the potential of monitoring the strides by which the results produced by different instances of an instruction change. The second technique investigates the potential of pattern-based two-level prediction schemes. Simulation results of these two schemes show improvements over the existing method of predicting the last outcome. In particular, some benchmarks show improvement with the stride-based predictor and others show improvement with the pattern-based predictor. To do uniformly well across benchmarks, we combine these two predictors to form a hybrid predictor. Simulation analysis of the hybrid predictor shows its overall prediction accuracy to be better than that of the component predictors across all benchmarks.
A block rational Arnoldi algorithm for multipoint passive model-order reduction of multiport RLC networks
Authors: I. M. Elfadel, David D. Ling
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

Recent work in the area of model-order reduction for RLC interconnect networks has been focused on building reduced-order models that preserve the circuit-theoretic properties of the network, such as stability, passivity, and synthesizability. Passivity is the one circuit-theoretic property that is vital for the successful simulation of a large circuit netlist containing reduced-order models of its interconnect networks. Non-passive reduced-order models may lead to instabilities even if they are themselves stable. In this paper, we address the problem of guaranteeing the accuracy and passivity of reduced-order models of multiport RLC networks at any finite number of expansion points. The novel passivity-preserving model-order reduction scheme is a block version of the rational Arnoldi algorithm. The scheme reduces to that of the PRIMA algorithm when applied to a single expansion point at zero frequency. Although the treatment of this paper is restricted to expansion points that are on the negative real axis, it is shown that the resulting passive reduced-order model is superior in accuracy to the one that would result from expanding the original model around a single point. Nyquist plots are used to illustrate both the passivity and the accuracy of the reduced-order models.
Toward a formal theory of extensible software
Authors: Shriram Krishnamurthi, Matthias Felleisen
Venue: ACM SIGSOFT Software Engineering Notes (1998)

As software projects continue to grow in scale and scope, it becomes important to reuse software. An important kind of reuse is extensibility, i.e., the extension of software without accessing existing code to edit or copy it. In this paper, we propose a rigorous, semantics-based definition of software extensibility. Then we illustrate the utility of our definitions by applying them to several programs. The examination shows how programming style affects extensibility and also drives the creation of a variant of an existing design pattern. We consider programs in both object-oriented and functional languages to prove the robustness of our definitions.
Tertiary storage in multimedia systems: staging or direct access?
Authors: HweeHwa Pang
Venue: Multimedia Systems (1997)

Multimedia applications that are required to manipulate large collections of objects are becoming increasingly common. Moreover, the size of multimedia objects,which are already huge, are getting even bigger as the resolution of output devices improve. As a result, many multimedia storage systems are not likely to be able to keep allof their objects disk-resident. Instead a majority of the lesspopular objects have to be off-loaded to tertiary storage tokeep costs down. The speed at which objects can be accessedfrom tertiary storage is thus an important consideration. Inthis paper, we propose an adaptive data retrieval algorithmthat employs a combination of staging and direct access inservicing tertiary storage retrieval requests. At retrieval time,an object that resides in tertiary storage can either be stagedto and then played back from disks, or the object can beaccessed directly from the tertiary drives. We show that asimplistic policy that adheres strictly to staging or direct access does not exploit the full retrieval capacity of both thetertiary library and the secondary storage. To overcome theproblem, we propose a data retrieval algorithm that dynamically chooses between staging and direct access, based onthe relative load on the tertiary versus secondary devices. Aseries of simulation experiments confirms that the algorithmachieves good access times over a wide range of workloadsand resource configurations. Moreover, the algorithm is veryresponsive to changing load conditions.
Weight Enumerators of Double Circulant Codes and New ExtremalSelf-Dual Codes
Authors: T. Aaron Gulliver, Masaaki Harada
Venue: Designs, Codes and Cryptography (1997)

In this paper it is shown that the weight enumerator of a bordered double circulant self-dual code can be obtained from those of a pure double circulant self-dual code and its shadow through a relationship between bordered and pure double circulant codes. As applications, a restriction on the weight enumerators of some extremal double circulant codes is determined and a uniqueness proof of extremal double circulant self-dual codes of length 46 is given. New extremal singly-even [44,22,8] double circulant codes are constructed. These codes have weight enumerators for which extremal codes were not previously known to exist.
Dense Non-Rigid Motion Estimation in Sequencesof Medical Images Using Differential Constraints
Authors: Serge Benayoun, Nicholas Ayache
Venue: International Journal of Computer Vision (1998)

We describe a new method for computing the displacement vector field in time sequences of 2D or 3D images (4D data). The method is energy-minimizing on the space of correspondence functions; the energy is split into two terms, with one term matching differential singularities in the images, and the other constraining the regularity of the field. In order to reduce the computational time of the motion estimation, we use an adaptive image mesh, the resolution of which depends on the value of the gradient intensity. We solve numerically the minimization problem with the finite element method which gives a continuous approximation of the solution. We present experimental results on synthetic data and on medical images and we show how to use these results for analyzing cardiac deformations.
Simulation for computer science majors: a preliminary report
Authors: Ruth Silverman
Venue: Proceedings of the 28th conference on Winter simulation (1996)

With the support of the NSF Grant listed below, the author is revising and restructuring an existing simulation course designed primarily for senior computer science majors by: 1) developing an integrated set of laboratory exercises based on computer science topics using commercially available software (GPSS/H); 2)incorporating these materials into a formal laboratory manual along with related computer science reference materials and instructions in the use of the software; 3) implementing a pilot course using this manual together with a single text in the theory of simulation; 4) preparing a syllabus and a detailed an notated course outline for the instructor, keyed to the manual and the text. The materials developed will be flexible and highly modular allowing their adoption or adaptation at other institutions.
Codes of Small Defect
Authors: A. Faldum, W. Willems
Venue: Designs, Codes and Cryptography (1997)

The parameters of a linear codeC over GF(q) are given by [n,k,d], where n denotes the length, k the dimension and d the minimum distance of C. The code C is called MDS, or maximum distance separable, if the minimum distance d meets the Singleton bound, i.e. d = n-k+1. Unfortunately, the parameters of an MDS code are severely limited by the size of the field. Thus we look for codes which have minimum distance close to the Singleton bound. Of particular interest is the class of almost MDS codes, i.e. codes for which d=n-k. We will present a condition on the minimum distance of a code to guarantee that the orthogonal code is an almost MDS code. This extends a result of Dodunekov and Landgev Dodunekov. Evaluation of the MacWilliams identities leads to a closed formula for the weight distribution which turns out to be completely determined for almost MDS codes up to one parameter. As a consequence we obtain surprising combinatorial relations in such codes. This leads, among other things, to an answer to a question of Assmus and Mattson 5 on the existence of self-dual [2d,d,d] -codes which have no code words of weight d+1 . Actually there are more codes than Assmus and Mattson expected, but the examples which we know are related to the expected ones.
Dynamic load balancing strategies for conservative parallel simulations
Authors: Azzedine Boukerche, Sajal K. Das
Venue: ACM SIGSIM Simulation Digest (1997)

This paper studies the problem of load balancing for conservative parallel simulations for execution on a multicomputer. The synchronization protocol makes use of Chandy-Misra null-messages. We propose a dynamic load balancing algorithm which assumes no compile time knowledge about the workload parameters. It is based upon a process migration mechanism, and the notion of CPU-queue length, which indicates the workload at each processor.We examine two variations for the algorithm which we refer to as centralized and multi-level hierarchical methods, in the context of queueing network simulation of a torus. The torus was chosen because it of its many cycles aid in the formation of deadlock making it a stress test for any conservative synchronization protocols. Our experiments indicate that our dynamic load balancing schemes significantly reduce the run time of an optimized version of Chandy-Misra null message approach, and decreases by 30-40\% the synchronization overhead when compared to the use of a static partitioning algorithm. Significantly, the results obtained also indicate that the multi-level scheme always outperforms both the centralized load balancing approach and the static partitioning algorithm.
The utility of exploiting idle workstations for parallel computation
Authors: Anurag Acharya, Guy Edjlali, Joel Saltz
Venue: Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (1997)

In this paper, we examine the utility of exploiting idle workstations for parallel computation. We attempt to answer the following questions. First, given a workstation pool, for what fraction of time can we expect to find a cluster of k workstations available? This provides an estimate of the opportunity for parallel computation. Second, how stable is a cluster of free machines and how does the stability vary with the size of the cluster? This indicates how frequently a parallel computation might have to stop for adapting to changes in processor availability. Third, what is the distribution of workstation idle-times? This information is useful for selecting workstations to place computation on. Fourth, how much benefit can a user expect? To state this in concrete terms, if I have a pool of size S, how big a parallel machine should I expect to get for free by harvesting idle machines. Finally, how much benefit can be achieved on a real machine and how hard does a parallel programmer have to work to make this happen? To answer the workstation-availability questions, we have analyzed 14-day traces from three workstation pools. To determine the equivalent parallel machine, we have simulated the execution of a group of well-known parallel programs on these workstation pools. To gain an understanding of the practical problems, we have developed the system support required for adaptive parallel programs and have used it to build an adaptive parallel computational fluid dynamics application.
A Fast Adaptive Numerical Method for Stiff Two-Point Boundary Value Problems
Authors: June-Yub Lee, Leslie Greengard
Venue: SIAM Journal on Scientific Computing (1997)

We describe a robust, adaptive algorithm for the solution of singularly perturbed two-point boundary value problems. Many different phenomena can arise in such problems, including boundary layers, dense oscillations, and complicated or ill-conditioned internal transition regions. Working with an integral equation reformulation of the original differential equation, we introduce a method for error analysis which can be used for mesh refinement even when the solution computed on the current mesh is underresolved. Based on this method, we have constructed a black-box code for stiff problems which automatically generates an adaptive mesh resolving all features of the solution. The solver is direct and of arbitrarily high-order accuracy and requires an amount of time proportional to the number of grid points.
Automatic Model Construction and Pose Estimation From Photographs Using Triangular Splines
Authors: Steve Sullivan, Jean Ponce
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

This paper addresses the automatic construction of complex spline object models from a few photographs. Our approach combines silhouettes from registered images to construct a G1-continuous triangular spline approximation of an object with unknown topology. We apply a similar optimization procedure to estimate the pose of a modeled object from a single image. Experimental examples of model construction and pose estimation are presented for several complex objects.
Using simulation to craft a national organ transplantation policy
Authors: A. Alan B. Pritsker
Venue: Proceedings of the 28th conference on Winter simulation (1996)

For many years, we have been able to use simulations for studying manufacturing and service systems, resulting in the ability to make better managerial decisions. As simulation methods have become more sophisticated, we have talked about the benefits of conducting large-scale simulations to support the selections of alternative public and corporate policies. This paper presents a description and analysis of what can be accomplished when simulations are used to support policy analysis and selection. The National Liver Allocation and Distribution Policy is used as the vehicle for presenting specific details of how simulation can be used to support policy selection.
Designing &ldquo;Dual Personality&rdquo; IEEE 1149.1 Compliant Multi-Chip Modules
Authors: Najmi Jarwala
Venue: Journal of Electronic Testing: Theory and Applications (1997)

The IEEE 1149.1 Test Access Port and Boundary-Scan Architecture Standard can be used at many different levels in the integration hierarchy of a product. However there is one level where using the standard poses some difficulty. Multi-Chip Modules (MCM) belong to this level. This paper explores the problem and proposes a set of solutions for various classes of MCMs.
Partial Exact Controllability for Spherical Membranes
Authors: Paola Loreti, Vanda Valente
Venue: SIAM Journal on Control and Optimization (1997)

In this paper the partial exact controllability of an elastic spherical membrane is proved. The reachability problem for the integrodifferential equation, introduced for the vibrations of the meridional displacement, is solved. The main result is a generalization of a Ingham's theorem on nonharmonic Fourier series.
Analog VLSI Circuits for Competitive Learning Networks
Authors: H. C. Card, D. K. McNeill, C. R. Schneider
Venue: Analog Integrated Circuits and Signal Processing (1998)

An investigation is made concerning implementations of competitive learning algorithms in analog VLSI circuits and systems. Analog and low power digital circuits for competitive learning are currently important for their applications in computationally-efficient speech and image compression by vector quantization, as required for example in portable multi-media terminals. A summary of competitive learning models is presented to indicate the type of VLSI computations required, and the effects of weight quantization are discussed. Analog circuit representations of computational primitives for learning and evaluation of distortion metrics are discussed. The present state of VLSI implementations of hard and soft competitive learning algorithms are described, as well as those for topological feature maps. Tolerance of learning algorithms to observed analog circuit properties is reported. New results are also presented from simulations of frequency-sensitive and soft competitive learning concerning sensitivity of these algorithms to precision in VLSI learning computations. Applications of these learning algorithms to unsupervised feature extraction and to vector quantization of speech and images are also described.
Program analysis for software engineering: new applications, new requirements, new tools
Authors: Daniel Le Métayer
Venue: ACM SIGPLAN Notices (1997)

In order to play a bigger role in software engineering tools, static analysis techniques must take into account the specific needs of this application area, in particular in terms of interaction with the user and scalability. This new perspective requires a reexamination of the field of static program analysis both internally and in connection with related areas like theorem proving and debugging.
Computational Complexity and Knowledge Complexity
Authors: Oded Goldreich, Rafail Ostrovsky, Erez Petrank
Venue: SIAM Journal on Computing (1998)

We study the computational complexity of languages which have interactive proofs of logarithmic knowledge complexity. We show that all such languages can be recognized in ${\cal BPP}^{\cal NP}$. Prior to this work, for languages with greater-than-zero knowledge complexity only trivial computational complexity bounds were known. In the course of our proof, we relate statistical knowledge complexity to perfect knowledge complexity; specifically, we show that, for the honest verifier, these hierarchies coincide up to a logarithmic additive term.
Neural fuzzy agents that learn a user's preference map
Authors: Sanya Mitaim, Bart Kosko
Venue: Proceedings of the IEEE international forum on Research and technology advances in digital libraries (1997)

This paper models an intelligent agent that helps a user search or filter images in the database. Database search depends on the user's profile of likes and dislikes and how the user ranks similar images. A neural fuzzy system can help learn an agent profile of a user. The fuzzy system uses if-then rules that store and compress the agent's knowledge of the user's likes and dislikes. A neural system uses training data to form and tune the rules. The profile is a preference map or a bumpy utility surface over the space of search objects. Rules define fuzzy patches that cover the bumps as learning unfolds and as the fuzzy agent system gives a finer approximation of the profile. The agent system searches for preferred objects with the learned profile and a new fuzzy measure of similarity. We derive a new supervised learning law that tunes this matching measure with new sample data. Then we test the fuzzy agent profile system on object spaces of flowers and sunsets and test the fuzzy agent matching system on an object space of sunset images.
Understanding the sources of variation in software inspections
Authors: Adam Porter, Harvey Siy, Audris Mockus, Lawrence Votta
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1998)

In a previous experiment, we determined how various changes in three structural elements of the software inspection process (team size and the number and sequencing of sessions) altered effectiveness and interval. Our results showed that such changes did not significantly influence the defect detection rate, but that certain combinations of changes dramatically increased the inspection interval. We also observed a large amount of unexplained variance in the data, indicating that other factors must be affecting inspection performance. The nature and extent of these other factors now have to be determined to ensure that they had not biased our earlier results. Also, identifying these other factors might suggest additional ways to improve the efficiency of inspections. Acting on the hypothesis that the &ldquo;inputs&rdquo; into the inspection process (reviewers, authors, and code units) were significant sources of variation, we modeled their effects on inspection performance. We found that they were responsible for much more variation in detect detection than was process structure. This leads us to conclude that better defect detection techniques, not better process structures, are the key to improving inspection effectiveness. The combined effects of process inputs and process structure on the inspection interval accounted for only a small percentage of the variance in inspection interval. Therefore, there must be other factors which need to be identified.