ppxscal/embedding_network huggingface dataset:
Multirate voice coding for load control on CSMA/CD local computer networks
Authors: Victor S. Frost, Edward M. Friedman, Gary J. Minden
Venue: Proceedings of the 17th conference on Winter simulation (1985)

A study of mixed voice and data on a local area network under the Carrier Sense Multiple Access with Collision Detection (CSMA/CD) is presented. The study determined the feasibility of using multirate voice coding to control the traffic intensity on the network. By decreasing the voice coding rate for short periods of time (and thus the voice quality) when network traffic increases, a larger number of voice users can be realized. The premise is that short term voice quality can be traded for increased throughput on a CSMA/CD network. Collisions per millisecond is found to give a good indication of the traffic on the network. A feedback equation is used to set the voice coding rate, based on the measured collisions per millisecond. The coding rate determined from the feedback equation is rounded to one of four possible coding rates; other rates are clearly possible. The voice coding rates chosen were 48, 40, 32, and 24 kilo-bits-per-second. The simulation results show that approximately 10 additional voice users can be added to a 1 mega-bit-per-second network when the multirate algorithm is used. Results are given relating the packet delay to the collisions per millisecond. A comparison between multirate and non-multirate is given. An indication of the voice quality for the multirate system is also discussed. The multirate load control algorithm provides a way to increase the amount of voice traffic on a CSMA/CD network without increasing the line capacity.
Integration of declarative paradigms: benefits and challenges
Authors: Michael Hanus
Venue: ACM SIGPLAN Notices (1997)

We discuss the benefits of integrating the most important declarative programming paradigms namely functional and logic programming. Although many problems need to be solved to provide a true amalgamation of these paradigms, such an integration seems to be possible and has positive effects on teaching, research and application of declarative languages.
Comments on Esposito et al.
Authors: Jim Kay
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

This note discusses the inferential procedure used by Esposito et al. [1] to compare the performance of methods of classification, makes some links with recent research on resampling methodology, and mentions some alternative approaches.
Proving circuit correctness using formal comparison between expected and extracted behaviour
Authors: Jean-Christophe Madre, Jean-Paul Billon
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper presents a new method for verifying functionality in the design of VLSI circuits. Our method fits naturally in a methodology based on a Hardware Description Language (HDL). Two programs describe the system under design: (1) its specification and (2) the extracted behaviour from its layout. Verifying the design comes down to proving that these programs are correct and equivalent with regard to the HDL semantics. We define a process named Formal Analysis that permits to prove these properties without setting values to the programs inputs. Formal Analysis is based on a new canonical form of Boolean Logic that we name Typed Shannon's canonical form. We implemented this method in PRIAM an efficient circuit prover now used by industrial CPU designers.
YARDS: FPGA/MPU hybrid architecture for telecommunication data processing
Authors: Akihiro Tsutsui, Toshiaki Miyazaki
Venue: Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays (1997)

This paper presents a novel system architecture applicable to high-performance and flexible transport data processing which includes complex protocol operation and a nehvork control algorithm. We developed a new tightly coupled Held Programmable Gate Array (FPGA) and Micro-Processing Unit (MPU) system named. Yet Another Re-Definable System (YARDS). It comprises three programmable devices which equateto high flexibility. These devices are the RISC-type MPU with memories, programmable inter-connection devices, and FPGAs. Using these, this system supports various styles of coupling between the FPGAs and the MPU which are suitable for constructing transport data processing. In this paper, two applications of the systemin the telecommunications field are given. One is an Operation, Administration, and Management (OAM) cell operations on an AsynchronousTransfer Mode (ATM) network. The other is a dynamic configuration protocol enables the updateor changeof the functions of the transport data processing system on-line. This is the first approach applying the FPGA/MPU hybrid system to the telecommunications field.
On the decidability and axiomatization of query finiteness in deductive databases
Authors: Michael Kifer
Venue: Journal of the ACM (JACM) (1998)

A database query is finite if its result consists of a finite sets tuples. For queries formulated as sets of pure Horn rules, the problem of determining finiteness is, in general, undecidable.In this paper, we consider superfiniteness&mdash;a stronger kind of finiteness, which applies to Horn queries whose function symbols are replaced by the abstraction of infinite relations with finiteness constraints (abbr., FC's). We show that superfiniteness is not only decidable but also axiomatizable, and the axiomatization yields an effective decision procedure. Although there are finite queries that are not superfinite, we demonstrate that superfinite queries represent an interesting and nontrivial subclass within the class of all finite queries.The we turn to the issue of inference of finiteness constraints&mdash;an important practical problem that is instrumental in deciding if a query is evaluable by a bottom-up algorithm. Although it is not known whether FC-entailment is decidable for sets of function-free Horn rules, we show that super-entailment, a stronger form of entailment, is decidable. We also show how a decision procedure for super-entailment can be used to enhance tests for query finiteness.
Sociological concerns about Ada in the 1990s
Authors: Mark S. Gerhardt
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

Numerous meetings and papers have been written about the state of Ada use and adoption in our industry today. Much discussion has centered around particular technical questions and perceived technical Ada deficiencies. I will not dwell on those, but rather assert that they are in fact second order concerns to the more pressing sociological concerns about Ada insertion. The symptoms surrounding Ada acceptance reflect the typical teenage view about anything. Three obstacles to change of any sort come to mind: the &ldquo;Eat your vegetables&rdquo; problem the &ldquo;I don't want to move&rdquo; problem the &ldquo;Do you know how much work this is?&rdquo; problem
The Minimum Covering l_pb-Hypersphere Problem
Authors: B. Pelegrín, L. Cánovas
Venue: Computational Optimization and Applications (1998)

The minimu vering hypersphere problem is defined as to find a hypersphere of minimum radius enclosing a finite set of given points in R^n. A hypersphere is a setS(c,r)={x &isin; R^n : d(x,c) &le; r} , where c is the center of S, r is the radius of S and d(x,c) is the Euclidean distance between x and c, i.e.,d(x,c)=l_2(x-c) . We consider the extension of this problem when d(x, c) is given by anyl_pb -norm, where 1<p &infin; andb=(b_1,...,b_n) with b_j>0,j=1,...,n , then S(c,r) is called anl_pb -hypersphere, in particular for p=2 and b_j=1, j=1,...,n, we obtain thel_2 -norm. We study some properties and propose some primal and dual algorithms for the extended problem , which are based on the feasible directions method and on the Wolfe duality theory. By computational experiments, we compare the proposed algorithms and show that they can be used to approximate the smallestl_pb -hypersphere enclosing a large set of points inR^n .
Safe metaclass programming
Authors: Noury M. N. Bouraqadi-Saâdani, Thomas Ledoux, Fred Rivard
Venue: ACM SIGPLAN Notices (1998)

In a system where classes are treated as first class objects, classes are defined as instances of other classes called metaclasses. An important benefit of using metaclasses is the ability to assign properties to classes (e.g. being abstract, being final, tracing particular messages, supporting multiple inheritance), independently from the base-level code. However, when both inheritance and instantiation are explicitly and simultaneously involved, communication between classes and their instances raises the metaclass compatibility issue. Some languages (such as SMALLTALK) address this issue but do not easily allow the assignment of specific properties to classes. In contrast, other languages (such as CLOS) allow the assignment of specific properties to classes but do not tackle the compatibility issue well.In this paper, we describe a new model of metalevel organization, called the compatibility model, which overcomes this difficulty. It allows safe metaclass programming since it makes it possible to assign specific properties to classes while ensuring metaclass compatibility. Therefore, we can take advantage of the expressive power of metaclasses to build reliable software. We extend this compatibility model in order to enable safe reuse and composition of class specific properties. This extension is implemented in NEOCLASSTALK, a fully reflective SMALLTALK.
A comparison of experiences with the maintenance of object-oriented systems: Ada vs. C++
Authors: Frederic H. Wild,  III
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

This paper discusses the relative ease with which systems are maintained using the mechanisms supported by Ada versus those supported by C++. The paper opens with a discussion of significant aspects of object-oriented development, followed by comments about relevant support mechanisms supplied by each language. Qualitative comments are used freely regarding issues of object inter-relationship complexities, object construction and reuse paradigms, readability aspects, and others.
Optical Clock Distribution in Electronic Systems
Authors: Stuart K. Tewksbury, Lawrence A. Hornak
Venue: Journal of VLSI Signal Processing Systems (1997)

Techniques for distribution of optical signals, both free space and guided, within electronic systems has been extensively investigated over more than a decade. Particularly at the lower levels of packaging (intra-chip and chip-to-chip), miniaturized optical elements including diffractive optics and micro-refractive optics have received considerable attention. In the case of optical distribution of data, there is the need for a source of optical power and a need for a means of modulating the optical beam to achieve data communications. As the number of optical data interconnections increases, the technical challenges of providing an efficient realization of the optical data interconnections also increases. Among the system signals which might be transmitted optically, clock distribution represents a substantially simplified problem from the perspective of the optical sources required. In particular, a single optical source, modulated to provide the clock signal, replaces the multitude of optical sources/modulators which would be needed for extensive optical data interconnections. Using this single optical clock source, the technical problem reduces largely to splitting of the optical clock beam into a multiplicity of optical clock beams and distribution of the individual clocks to the several portions of the system requiring synchronized clocks. The distribution problem allows exploitation of a wide variety of passive, miniaturized optical elements (with diffractive optics playing a substantial role). This article reviews many of the approaches which have been explored for optical clock distribution, ranging from optical clock distribution within lower levels of the system packaging hierarchy through optical clock distribution among separate boards of a complex system. Although optical clock distribution has not yet seen significant practical application, it is evident that the technical foundation for such clock distribution is well established. As clock rates increase to 1 GHz and higher, the practical advantages of optical clock distribution will also increase, limited primarily by the cost of the optical components used and the manufacturability of an overall electronic system in which optical clock distribution has been selectively inserted.
Polynomial Liftings on a Tetrahedron and Applications to the h-p Version of the Finite Element Method in Three Dimensions
Authors: Rafael Muñoz-Sola
Venue: SIAM Journal on Numerical Analysis (1997)

We construct a stable polynomial lifting on a tetrahedron, given polynomial traces defined on its faces satisfying continuity conditions along the edges. We apply this result to establish the optimal convergence rate of the h-p version of the finite element method in dimension three assuming the solution to be regular.
Partial Evaluation of the Euclidian Algorithm
Authors: Olivier Danvy, Mayer Goldberg
Venue: Lisp and Symbolic Computation (1997)

Some programs are easily amenable to partial evaluation because their control flow clearly depends on one of their parameters. Specializing such programs with respect to this parameter eliminates the associated interpretive overhead. Some other programs, however, do not exhibit this interpreter-like behavior. Each of them presents a challenge for partial evaluation. The Euclidian algorithm is one of them, and in this article, we make it amenable to partial evaluation.We observe that the number of iterations in the Euclidian algorithm is bounded by a number that can be computed given either of the two arguments. We thus rephrase this algorithm using bounded recursion. The resulting program is better suited for automatic unfolding and thus for partial evaluation. Its specialization is efficient.
Multidimensional Two-channel Linear Phase FIR Filter Banksand Wavelet Bases with Vanishing Moments
Authors: Todor Cooklev, Akinori Nishihara, Toshiyuki Yoshida, Mike Sablatash
Venue: Multidimensional Systems and Signal Processing (1998)

In the paper new design methods for multidimensional two-channel perfect reconstruction (PR) FIR filter banks are described. The filters have linear phase, achieve an arbitrarily high number of vanishing moments and can be used to obtain biorthogonal wavelet bases. Two-dimensional wavelet bases with square, rectangular, and hexagonal support are constructed. A design method that trades off vanishing moments and frequency selectivity is described. These two properties are both important in subband coding, but they each require a share of the degrees of freedom available from the total number of filter coefficients. Novel analytic formulae are derived and are applied to provide illustrative examples.
Spectra and Pseudospectra of Waveform Relaxation Operators
Authors: Andrew Lumsdaine, Deyun Wu
Venue: SIAM Journal on Scientific Computing (1997)

We describe the spectra and pseudospectra of continuous time and discrete time waveform relaxation operators. Since the spectrum of the finite-interval waveform relaxation operator is only a singleton, the spectrum of the infinite-interval operator is typically used to describe the behavior of waveform relaxation algorithms. Here, we show that the pseudospectrum is a more useful tool for analyzing convergence of waveform iterations on finite intervals and prove that the pseudospectrum of the infinite-interval operator is in fact the limit of the pseudospectra of the finite-interval operators.
Applying design patterns to decision tree learning system
Authors: Gou Masuda, Norihiro Sakamoto, Kazuo Ushijima
Venue: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering (1998)

In this paper we describe an application of design patterns to the development of a decision tree learning system. A decision tree learning system constructs a classifier as a form of tree from a given data set. It is required to be as flexible as possible when used in real application domains. Design patterns help us construct reusable software components and construct flexible and extensible systems. The approach employed in this study is as follows. First we examine several decision tree learning systems and identify hot-spots in the systems at points we anticipate future demand for modification and extension of the system. Second we determine which design pattern to apply to each hot-spot. We evaluate the extensibility of the system experimentally. Our experience shows that using design patterns in object-oriented software design allows the easy construction of flexible systems.
A reflection on call-by-value
Authors: Amr Sabry, Philip Wadler
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1997)

One way to model a sound and complete translation from a source calculus into a target calculus is with an adjoint or a Galois connection. In the special case of a reflection, one also has that the target calculus is isomorphic to a subset of the source. We show that three widely studied translations form reflections. We use as our source language Moggi's computational lambda calculus, which is an extension of Plotkin's call-by-value calculus. We show that Plotkin's CPS translation, Moggi's monad translation, and Girard's translation to linear logic can all be regarded as reflections form this source language, and we put forward the computational lambda calculus as a model of call-by-value computation that improves on the traditional call-by-value calculus. Our work strengthens Plotkin's and Moggi's original results and improves on recent work based on equational correspondence, which uses equations rather than reductions.
Improved Analysis for Distortion in Emitter-Driven Variable Gain Pairs
Authors: Muhammad Taher Abuelma’atti, Sofian Mustafa Abed
Venue: Analog Integrated Circuits and Signal Processing (1998)

This article presents an improved analysis for the distortion in emitter-driven variable-gain pairs owing to the Early-voltage effect. The analysis shows that, by careful design, it is possible to reduce the second-order distortion components resulting from the Early-voltage effect. The analysis shows also that, under large signal conditions, the value of the normalized input amplitude at which the second-harmonic distortion is minimum is different from the value of the normalized input amplitude at which the second-order intermodulation distortion is minimum.
Executable workflows: a paradigm for collaborative design on the Internet
Authors: Hemang Lavana, Amit Khetawat, Franc Brglez, Krzysztof Kozminski
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

This paper introduces a directed hypergraph modelthat supports (1) workflow composition and reconfigurationwhile accessing and executing programs, data, and computingresources across the Internet, (2) synchronous and asynchronouspeer-to-peer interaction between members of anyteam during workflow composition and execution, (3) synchronousand asynchronous peer-to-workflow interaction betweenany team member and any object in the workflow.Given a library of program and data nodes, editing theworkflow and its execution is as intuitive as the hierarchicalschematic design capture and simulation.Examples of multi-sitemulti-user applications demonstrate that the proposedworkflow implementation provides a user-friendly paradigmfor distracted and collaborative team design.
Mesh refinement via bidirected flows: modeling, complexity, and computational results
Authors: Rolf H. Höhring, Matthias Müller-Hannemann, Karsten Wiehe
Venue: Journal of the ACM (JACM) (1997)

We investigate a problem arising in the computer-aided design of cars, planes, ships, trains, and other motor vehicles and machines: refine a mesh of curved polygons, which approximates the surface of a workpiece, into quadrilaterals so that the resulting mesh is suitable for a numerical analysis. This mesh refinement problem turns out to be strongly NP-hard In commercial CAD systems, this problem is usually solved using a gree dy approach. However, these algorithms leave the user a lot of patchwork to do afterwards. We introduce a new global approach, which is based on network flow techniques. Abstracting from all geometric and numerical aspects, we obtain an undirected graph with upper and lower capacities on the edges and some additional node constraints. We reduce this problem to a sequence of bidirected flwo problems (or, equivalently, to b-matching problems). For the first time, network flow techniques are applied to a mesh refinement problem. This approach avoids the local traps of greedy approaches and yields solutions that require significantly less additional patchwork.
Investigating data quality problems in the PSP
Authors: Anne M. Disney, Philip M. Johnson
Venue: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering (1998)

The Personal Software Process (PSP) is used by software engineers to gather and analyze data about their work. Published studies typically use data collected using the PSP to draw quantitative conclusions about its impact upon programmer behavior and product quality. However, our experience using PSP in both industrial and academic settings revealed problems both in collection of data and its later analysis. We hypothesized that these two kinds of data quality problems could make a significant impact upon the value of PSP measures. To test this hypothesis, we built a tool to automate the PSP and then examined 89 projects completed by ten subjects using the PSP manually in an educational setting. We discovered 1539 primary errors and categorized them by type, subtype, severity, and age. To examine the collection problem we looked at the 90 errors that represented impossible combinations of data and at other less concrete anomalies in Time Recording Logs and Defect Recording Logs. To examine the analysis problem we developed a rule set, corrected the errors as far as possible, and compared the original and corrected data. This resulted in significant differences for measures such as yield and the cost-performance ratio, confirming our hypothesis. Our results raise questions about the accuracy of manually collected and analyzed PSP data, indicate that integrated tool support may be required for high quality PSP data analysis, and suggest that external measures should be used when attempting to evaluate the impact of the PSP upon programmer behavior and product quality.
Memory data organization for improved cache performance in embedded processor applications
Authors: Preeti Ranjan Panda, Nikil D. Dutt, Alexandru Nicolau
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (1997)

Code generation for embedded processors opens up the possibility for several performance optimization techniques that have been ignored by traditional compilers due to compilation time constraints. We present techniques that take into account the parameters of the data caches for organizing scalar and array variables declared in embedded code into memory, with the objective of improving data cache performance. We present techniques for clustering variables to minimize compulsory cache misses, and for solving the memory assignment problem to minimize conflict cache misses. Our experiments with benchmark code kernels from DSP and other domains on the CW4001 embedded processor from LSI Logic indicate significant improvements in data cache performance by the application of our memory organization technique.