ppxscal/embedding_network huggingface dataset:
An effective congestion control scheme for ATM networks
Authors: Mohsen H. Guizani
Venue: International Journal of Network Management (1998)

Congestion control is considered one of the most challenging issues of ATM. Simulation results are presented which show the performance superiority of the proposed scheme as compared to the conventional leaky bucket scheme. &copy; 1998 John Wiley & Sons, Ltd.
Approximate Feedback Linearisation Using Multilayer Neural Networks
Authors: Shouling He, Rolf Unbehauen
Venue: Neural Processing Letters (1998)

In this paper we introduce the approximate feedback linearisation using multilayer feedforward neural networks. We propose to approximate a basis of the one-dimensional codistribution of an affine nonlinear system with the derivative of a multilayer neural network [6] and form a change of coordinates with n multilayer neural networks [5]. In this paper we will prove that the transformation can define a local diffeomorphism, with which a local stabilising feedback law can be designed for a kind of non-linearisable nonlinear systems.
Present and future directions in data warehousing
Authors: Paul Gray, Hugh J. Watson
Venue: ACM SIGMIS Database (1998)

Many large organizations have developed data warehouses to support decision making. The data in a warehouse are subject oriented, integrated, time variant, and nonvolatile. A data warehouse contains five types of data: current detail data, older detail data, lightly summarized data, highly summarized data, and metadata. The architecture of a data warehouse includes a backend process (the extraction of data from source systems), the warehouse, and the front-end use (the accessing of data from the warehouse). A data mart is a smaller version of a data warehouse that supports the narrower set of requirements of a single business unit. Data marts should be developed in an integrated manner in order to avoid repeating the "silos of information" problem.An operational data store is a database for transaction processing systems that uses the data warehouse approach to provide clean data. Data warehousing is constantly changing, with the associated opportunities for practice and research, such as the potential for knowledge management using the warehouse.
Continuous Dependence with Respect to the Input of Trajectories of Control-Affine Systems
Authors: Wensheng Liu, Héctor J. Sussmann
Venue: SIAM Journal on Control and Optimization (1999)

We study the continuous dependence on the input of trajectories of control-affine systems belonging to the class C0(m) of all systems $\Sigma$ of the form $$\Sigma: \ \ \ \ \ \ \dot{x}=f_0(x)+\sum_{i=1}^m u_i(t)f_i(x),$$ where f0,. . . fm are continuous vector fields on some open subset of $\mathbb{R}^n$ and the control functions belong to $L^1([0,T],\mathbb{R}^m)$. We give a simple necessary and sufficient condition for a control sequence $\{u^j\}_{j=1}^{\infty}$ to "${\cal T}^0$-converge" to a control $u^\infty$, i.e., to be such that, for every system $\Sigma$ in C0, the trajectories generated by the uj converge as $j\rightarrow\infty$ to the trajectories generated by $u^\infty$. We also characterize ${\cal T}^k$-convergence (the concept of control convergence that arises when we use, instead of C0(m), the class Ck(m) of systems $\Sigma$ where the fi are of class Ck) for $k\ge 1$ in the scalar input case, and we explain how the analogous characterization for the multi-input case fails to be true, unless one restricts oneself to the class $C^k_{comm}(m)$ of systems for which the vector fields f0,. . . fm commute. As a preliminary, we define a "topology of trajectory convergence" (or "T-convergence") on the set of all time-varying vector fields $\Omega\times I\ni (x,t)\mapsto f(x,t)\in\mathbb{R}^n$, where $\Omega$ is an open subset of $\mathbb{R}^n$ and I is an interval, and we study some of its properties. This enables us to make the definition of ${\cal T}^k$-convergence precise for sequences and, more generally, for nets, by saying that a net $\{u^\alpha\}_{\alpha\in A}$ in $L^1([0,T],\mathbb{R}^m)$ ${\cal T}^k$-converges to a limit $u^\infty$ if for every system $\Sigma$ in C0(m) the time-varying vector fields $(x,t)\mapsto f_0(x)+\sum_{i=1}^m u_i^\alpha(t)f_i(x)$ ${\cal T}^k$-converge to $(x,t)\mapsto f_0(x)+\sum_{i=1}^m u_i^\infty(t)f_i(x)$.
Integer Programming and Conway's Game of Life
Authors: Robert A. Bosch
Venue: SIAM Review (1999)

This article presents integer programming formulations for finding interesting patterns in Conway's game of Life, with accompanying exercises and solutions.
Efficient Database Updates with Independent Schemes
Authors: Riccardo Torlone, Paolo Atzeni
Venue: SIAM Journal on Computing (1999)

The weak instance model is a framework for considering the relations in a database as a whole, regardless of the way attributes are grouped in the individual relations. Queries and updates can be performed for any set of attributes. The management of updates is based on a lattice structure on the set of legal states, and inconsistencies and ambiguities can arise.In the general case, the test for consistency and determinism may involve the whole database. In this paper it is shown how, for the highly significant class of independent schemes, updates can be handled efficiently, considering only the relevant portion of the database.
Modeling and simulation of the interference due to digital switching in mixed-signal ICs
Authors: Alper Demir, Peter Feldmann
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

The paper introduces a methodology for the evaluation of the interference noise, caused by digital switching activity, in sensitive circuits of a mixed-digital-analog chip. The digital switching activity is modeled stochastically as functions defined on Markov chains. The actual interference signal is obtained through the modulation of this discrete stochastic signal with real current injection patterns stored a priori in a pre-characterized library. The interference noise results from the propagations of these continuous stochastic signals through the linear network that models the chip power grid, substrate and relevant package parasitics. The interference noise power spectral density is computed by linear frequency-domain analysis. The methodology is implemented using advanced numerical techniques capable of tackling very large problems.
ICCQ: A Test Method for Analogue VLSI Using Local Current Sensors
Authors: Joop P. M. Van Lammeren
Venue: Journal of Electronic Testing: Theory and Applications (1999)

This paper describes a test method for analogue (parts of) ICs that determines whether an IC is good or not by measuring the currents flowing through its constituent circuits. The ICCQ test method is not a full functional test. It is aimed primarily at finding faulty circuits during wafer testing. Both static and dynamic currents can be tested with this test method.
Complexity estimates depending on condition and round-off error
Authors: Felipe Cucker, Steve Smale
Venue: Journal of the ACM (JACM) (1999)

This paper has two agendas. One is to develop the foundations of round-off in computation. The other is to describe an algorithm for deciding feasibility for polynomial systems of equations and inequalities together with its complexity analysis and its round-off properties. Each role reinforces the other.
Data management issues for large scale, distributed workflow systems on the Internet
Authors: J. Leon Zhao, Akhil Kumar
Venue: ACM SIGMIS Database (1998)

The Internet is providing worldwide connectivity for business organizations and has created a much greater opportunity for people to collaborate remotely in an automated workflow setting. However, the speed of delivery of workflow data on the Internet can be unpredictable due to variability in traffic and limited bandwidth. Further, the issue of data management becomes more complex when the system consists of various clients with different system and networking settings. In this paper, we investigate several data management problems in distributed workflow management on the Internet and propose solutions for improving workflow efficiency. More specifically, we explore research issues with respect to system architectures and various data delivery techniques. Our study indicates that it is possible to improve performance considerably by selecting the right combinations of data delivery techniques and system characteristics.
Re-targetability in software tools
Authors: Premkumar T. Devanbu
Venue: ACM SIGAPP Applied Computing Review (1999)

Software tool construction is a risky business, with uncertain rewards. Many tools never get used. This is a truism: software tools, however brilliantly conceived, well-designed, and meticulously constructed, have little impact unless they are actually adopted by real programmers. While there are no sure-fire ways of ensuring that a tool will be used, experience indicates that retargetability is an important enabler for wide adoption. In this paper, we elaborate on the need for retargetability in software tools, describe some mechanisms that have proven useful in our experience, and outline our future research in the broader area of inter-operability and retargetability.
The Tutte Polynomial as a Growth Function
Authors: Norman Biggs
Venue: Journal of Algebraic Combinatorics: An International Journal (1999)

The &lsquo;dollar game&rsquo; represents a kind of diffusion process on a graph. Under the rules of the game some cofigurations are both stable and recurrent, and these are known as critical cofigurations. The set of critical configurations can be given the structure of an abelian group, and it turns out that the order of the group is the tree-number of the graph. Each critical configuration can be assigned a positive weight, and the generating function that enumerates critical configurations according to weight is a partial evaluation of the Tutte polynomial of the graph. It is shown that the weight enumerator can also be interpreted as a growth function, which leads to the conclusion that the (partial) Tutte polynomial itself is a growth function.
The Public Health Care Planning Problem: A Case Study using Geographic Information Systems
Authors: Sophie D. Lapierre, Justin A. Myrick, Gail Russell
Venue: Journal of Medical Systems (1999)

We address the problem of designing new networks for the delivery of public health care services in the United States. The paper is based on a case study design conducted with the Fulton County Health Department (Atlanta, GA). The research contribution this paper makes is twofold. First, it presents a planning methodology to deliver health care services through a mix of fixed health centers, satellite facilities, and mobile facilities. Second, it gives insights on how to use geographic information systems to design new health care service networks.
Comparing presentation summaries: slides vs. reading vs. listening
Authors: Liwei He, Elizabeth Sanocki, Anoop Gupta, Jonathan Grudin
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

As more audio and video technical presentations go online, it becomes imperative to give users effective summarization and skimming tools so that they can find the presentation they want and browse through it quickly. In a previous study, we reported three automated methods for generating audio-video summaries and a user evaluation of those methods. An open question remained about how well various text/image only techniques will compare to the audio-video summarizations. This study attempts to fill that gap. This paper reports a user study that compares four possible ways of allowing a user to skim a presentation: 1) PowerPoint slides used by the speaker during the presentation, 2) the text transcript created by professional transcribers from the presentation, 3) the transcript with important points highlighted by the speaker, and 4) a audio-video summary created by the speaker. Results show that although some text-only conditions can match the audio-video summary, users have a marginal preference for audio-video (ANOVA f=3.067, p=0.087). Furthermore, different styles of slide-authoring (e.g., detailed vs. big-points only) can have a big impact on their effectiveness as summaries, raising a dilemma for some speakers in authoring for on-demand previewing versus that for live audiences.
High-definition true-colour television for use in minimally invasive medical procedures
Authors: A. von Orelli, Y. Lehareinger, P. Rol, P. Niederer, D. Doswald, N. Felber
Venue: Technology and Health Care (1999)

Endoscopes are key elements in the application of minimally invasive medical procedures. Thereby, image quality, ease of application and safety are of decisive importance for the user. This communication is primarily concerned with aspects relating to image quality. Standard television technology is presently used in endoscopes for image presentation purposes. It is however shown, that the inherent optical quality of most endoscopes exceeds the performance of standard TV. Accordingly, a special purpose advanced digital television system exhibiting true colour performance has been developed. Since endoscopic images usually are circular, its aspect ratio is quadratic with a spatial resolution of 1000 \times 1000 pixels. It has furthermore a temporal resolution of 1 to 30 Hz noninterlaced and a contrast resolution of 56.6 dB. The design and performance of the system is documented.
The Softmap Algorithm
Authors: Steven Raekelboom, Marc M. Van Hulle
Venue: Neural Processing Letters (1998)

A new unsupervised competitive learning rule is introduced, called the Self-organizing free-topology map (Softmap) algorithm, for nonparametric density estimation. The receptive fields of the formal neurons are overlapping, radially-symmetric kernels, the radii of which are adapted to the local input density together with the weight vectors which define the kernel centers. A fuzzy code membership function is introduced in order to encompass, in a novel way, the presence of overlapping receptive fields in the competitive learning scheme. Furthermore, a computationally simple heuristic is introduced for determining the overall degree of smoothness of the resulting density estimate. Finally, the density estimation performance is compared to that of the variable kernel method, VBAR and Kohonen&lsquo;s SOM algorithm.
Oracle distributed systems
Authors: Charles Dye
Venue:  (1999)

This book describes how you can use multiple databases and both Oracle8 and Oracle7 distributed system features to best advantage. It covers design, configuration of SQL*Net/Net8, security, and Oracle's distributed options (advanced replication, snapshots, multi-master replication, updateable snapshots, procedural replication, and conflict resolution). Includes a complete API reference for built-in packages and a diskette with many helpful scripts and utilities.
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
Authors: Hans Kellerer, T. Tautenhahn, G. Woeginger
Venue: SIAM Journal on Computing (1999)

We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total flow time. This problem is well known to be NP-complete, and the best polynomial-time approximation algorithms constructed so far had (more or less trivial) worst-case performance guarantees of O(n). In this paper, we present one positive and one negative result on polynomial-time approximations for the minimum total flow time problem: The positive result is the first approximation algorithm with a sublinear worst-case performance guarantee of $O(\sqrt{n})$. This algorithm is based on resolving the preemptions of the corresponding optimum preemptive schedule. The performance guarantee of our approximation algorithm is not far from best possible, as our second, negative result demonstrates: Unless P=NP, no polynomial-time approximation algorithm for minimum total flow time can have a worst-case performance guarantee of $O(n^{1/2-\eps})$ for any $\eps>0$.
LEOPARD: a Logical Effort-based fanout OPtimizer for ARea and Delay
Authors: Peyman Rezvani, Amir H. Ajami, Massoud Pedram, Hamid Savoj
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

We present LEOPARD, a fanout optimization algorithm based on the effort delay model for near-continuous size buffer libraries. Our algorithm minimizes area under required timing and input capacitance constraints by finding the tree topology and assigning different gains to each buffer to minimize the total buffer area. Experimental results show that the new algorithm achieves significant buffer area improvement compared to previous approaches.
Overlap and Covering Polynomials with Applications to Designs and Self-Dual Codes
Authors: Gerald J. Janusz
Venue: SIAM Journal on Discrete Mathematics (2000)

For a binary linear code ${\cal C}$ and a vector u, we define and study the overlap polynomial $F^{(u)}_{{\cal C}}(Z,X,D)$ which is a sum over the words in ${\cal C}$ of terms that takes into account the weight of the element of ${\cal C}$ and its overlap with the vector $u$. We obtain a generalized MacWilliams relation between $F^{(u)}_{{\cal C}}(Z,X,D)$ and $F^{(u)}_{{\cal C}^{\perp}}(Z,X,D)$ and a recursion equation for determining the overlap polynomials of a self-dual code in terms of overlap polynomials corresponding to vectors of lower weight. We apply the recursion to determine the weight enumerators of the cosets of the (putative) [72,36,16] self-dual code of Type II, up to a small number of parameters.The overlap polynomials are expressed in terms of covering polynomials $g^{(u)}_{{\cal C}}(Z,X)$ that are sums over the elements of ${\cal C}$ that cover $u$. The design strength $\delta({\cal C})$ is closely related to the covering polynomials and we use them to get a sharpened version of the Assmus--Mattson theorem. In many cases we are able to conclude that certain codes hold $\delta({\cal C})$-designs but no weight class holds a $1+\delta({\cal C})$-design. We study the design strength of self-dual, doubly even extremal codes and, in the case of length divisible by 24, improve the well-known estimate $\delta({\cal C})\geq 5$ to state that either $\delta({\cal C})\geq 7$ or $\delta({\cal C})=5$ and no weight class holds a 6-design; similar results hold in the case of other lengths. Examples are given using a self-dual code [32,16,8], certain cyclic subcodes of the punctured Reed--Muller code ${\cal R}(2,m)^*$, the first order RM-code, and a [16,9,4] code in which all six of the weight classes hold 2-designs but one nontrivial weight class also holds a 3-design.
Improving Resource Management in Distributed Systems using Language-Level Structuring Concepts
Authors: C. Eckert, M. Pizka
Venue: The Journal of Supercomputing (1999)

Currently, a shift of paradigm from sequential to distributed computing can be observed. Tremendous efforts are needed to cope with the challenging demands that are inherent to this transition. The two most important issues concern programming support for developing large-scale distributed applications and the efficient execution of such applications on top of a distributed hardware configuration. This paper presents a new language and object-based approach called MoDiS to cope with these demands. Distributed systems are developed and transformed into executables following a systematic, top-down driven method. Language-level is intended to mean that a high-level programming language is used to develop operating system services as well as user-level applications. The language-level concepts employed are based on objects and support advanced structuring features. Structural dependencies between objects are implicitly determined at the application level and exploited by the distributed resource management system to transform applications into efficient executables.
Teaching J as a computer notation for secondary mathematics
Authors: Howard A. Peelle
Venue: Proceedings of the conference on APL '99 : On track to the 21st century: On track to the 21st century (1999)

This article summarizes a teacher-education course which introduces J as a computer notation well-suited for teaching secondary mathematics. This one-semester course is designed as a series of workshops with accompanying discussions. The first workshop is described here in detail; the others are sketched. Teachers' experiences and reactions to using J are reported informally throughout.
A PseudoSpectral Procedure for the Solution of Nonlinear Wave Equations with Examples from Free-Surface Flows
Authors: Paul A. Milewski, Esteban G. Tabak
Venue: SIAM Journal on Scientific Computing (1999)

An algorithm for the solution of general isotropic nonlinear wave equations is presented. The algorithm is based on a symmetric factorization of the linear part of the wave operator, followed by its exact integration through an integrating factor in spectral space. The remaining nonlinear and forcing terms can be handled with any standard pseudospectral procedure. Solving the linear part of the wave operator exactly effectively eliminates the stiffness of the original problem, characterized by a wide range of temporal scales. The algorithm is tested and applied to several problems of three-dimensional long surface waves: solitary wave propagation, interaction, diffraction, and the generation of waves by flow over slowly varying bottom topography. Other potential applications include waves in rotating and stratified flows and wave interaction with more pronounced topographic features.
Learning the shape of information: a longitudinal study of Web-news reading
Authors: Misha W. Vaughan, Andrew Dillon
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

A concept called shape is proposed to experimentally examine the development of users' mental representations of information spaces over time. Twenty five novice users are exposed to two differently designed news web sites over five sessions. The longitudinal impacts on users' comprehension, usability, and navigation are examined.
Antidromic Spikes Drive Hebbian Learning in an Artificial Dendritic Tree
Authors: Wayne C. Westerman, David P. M. Northmore, John. G. Elias
Venue: Analog Integrated Circuits and Signal Processing (1999)

Hebbian learning using the timing between pre-synaptic and post-synaptic spiking allows a network of silicon neuromorphs to learn and playback complex spatiotemporal input patterns. Learning occurred dynamically and in a stimulus dependent manner by potentiating active synapses that contributed to post-synaptic spike production and depressing active synapses that were anti-causal. Active synapses that were neither causal nor anti-causal remained at their pre-activated efficacy. The network used to evaluate hebbian synaptic plasticity was fully connected with each neuromorph making a prescribed number of connections to the dendrites of all the other neuromorphs. To enable learning of spatiotemporal spiking activity, efferents from each neuromorph had to make connections along the entire length of their target dendrites so as to produce a temporally distributed response. Upon repetitive presentation of an input pattern those synapses that had appropriate causal timing were strengthened while those that were anti-causal were depressed.
Approximate Controllability of a Semilinear Heat Equation in $\Bbb R^N$
Authors: Luz de Teresa
Venue: SIAM Journal on Control and Optimization (1998)

We prove the approximate controllability of the semilinear heat equation in ${\Bbb R}^N$. We introduce the weighted Sobolev spaces of Escobedo and Kavian and in that functional setting we adapt the technique introduced by Fabre, Puel, and Zuazua for the problem in bounded domains. That is, we first prove the approximate controllability of the linear equation and by a fixed-point method obtain the main result.