ppxscal/embedding_network huggingface dataset:
Architectural Synthesis of Computational Engines for Subband Adaptive Filtering
Authors: S. Ramanathan, V. Visvanathan, S. K. Nandy
Venue: Journal of VLSI Signal Processing Systems (1999)

Architectural synthesis of low-power computational engines (hardware accelerators) for a subband-based adaptive filtering algorithm is presented. The full-band least mean square (LMS) adaptive filtering algorithm, widely used in various applications, is confronted by two problems, viz., slow convergence when the input correlation matrix is ill-conditioned, and increased computational complexity for applications involving use of large adaptive filter orders. Both of these problems can be overcome by the use of a subband-based normalized LMS (NLMS) adaptive filtering algorithm. Since this algorithm is not amenable to pipelining, delayed coefficient adaptation in the NLMS updation is used, which provides the required delays for pipelining. However, the convergence speed of this subband-based delayed NLMS (DNLMS) algorithm degrades with increase in the adaptation delay. We first present a pipelined subband DNLMS adaptive filtering architecture with minimal adaptation delay for any given sampling rate. The architecture is synthesized by using a number of function preserving transformations on the signal flow graph (SFG) representation of the subband DNLMS algorithm. With the use of carry-save arithmetic, the pipelined architecture can support high sampling rates limited only by the delay of two full adders and a 2-to-1 multiplexer. We then extend this synthesis methodology to synthesize a pipelined subband DNLMS architecture whose power dissipation meets a specified budget. This low-power architecture exploits the parallelism in the subband DNLMS algorithm to meet the required computational throughput. The architecture exhibits a novel tradeoff between algorithmic performance (convergence speed) and power dissipation. Finally, we incorporate configurability for filter order, sample period, power reduction factor, number of subbands and decimation/interpolation factor in the low-power architecture, thus resulting in a low-power subband computational engine for adaptive filtering.
The CAM-Brain Machine (CBM): Real Time Evolution andUpdate of a 75 Million Neuron FPGA-Based Artificial Brain
Authors: Hugo De Garis, Michael Korkin
Venue: Journal of VLSI Signal Processing Systems (2000)

This article introduces ATR's &ldquo;CAM-Brain Machine&rdquo; (CBM), an FPGA based piece of hardware which implements a genetic algorithm (GA) to evolve a cellular automata (CA) based neural network circuit module, of approximately 1,000 neurons, in about a second, i.e. a complete run of a GA, with 10,000 s of circuit growths and performance evaluations. Up to 65,000 of these modules, each of which is evolved with a humanly specified function, can be downloaded into a large RAM space, and interconnected according to humanly specified artificial brain architectures. This RAM, containing an artificial brain with up to 75 million neurons, is then updated by the CBM at a rate of 130 billion CA cells per second. Such speeds should enable real time control of robots and hopefully the birth of a new research field that we call &ldquo;brain building&rdquo;. The first such artificial brain, to be built by ATR starting in 2000, will be used to control the behaviors of a life sized robot kitten called &ldquo;Robokoneko&rdquo;.
Instruction Set Extensions for MPEG-4 Video
Authors: Mladen Berekovic, Hans-Joachim Stolberg, Mark B. Kulaczewski, Peter Pirsch, Henning Möller, Holger Runge, Johannes Kneip, Benno Stabernack
Venue: Journal of VLSI Signal Processing Systems (1999)

This paper describes instruction set extensions for the acceleration of MPEG-4 algorithms on programmable (RISC-) CPUs. MPEG-4 standardizes audio and video compression schemes for a variety of bit rates and scenarios. As MPEG-4 targets a much broader range of different applications than previously defined hybrid video coding standards like H.263 or MPEG-2, it employs a much higher number of different algorithms and coding modes. Therefore, MPEG-4 implementations will require a more software-oriented approach to be efficient. However, the total computational load for an optimized implementation of an MPEG-4 video codec is expected to exceed the performance levels of today's multimedia signal processors, making further hardware acceleration a necessity. For that purpose, we propose a number of instruction set extensions that add function-specific blocks to the data path of a CPU. These dedicated modules are highly adapted to the most computation-intensive processing schemes of MPEG-4, such as DCT, motion compensation, padding, shape coding, or bitstream parsing. The increased functionality of basic instructions results in a significant speed-up over standard RISC instruction sets, thus making MPEG-4 implementations feasible on programmable processor platforms. Possible target architectures include VLIW multimedia processors, MIMD-style multiprocessors, or coprocessor architectures
Patching Catmull-Clark meshes
Authors: Jörg Peters
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

Named after the title, the PCCM transformation is a simple, explicit algorithm that creates large, smoothly joining bicubic Nurbs patches from a refined Catmull-Clark subdivision mesh. The resulting patches are maximally large in the sense that one patch corresponds to one quadrilateral facet of the initial, coarsest quadrilateral mesh before subdivision. The patches join parametrically C2 and agree with the Catmull-Clark limit surface except in the immediate neighborhood of extraordinary mesh nodes; in such a neighborhood they join at least with tangent continuity and interpolate the limit of the extraordinary mesh node. The PCCM transformation integrates naturally with array-based implementations of subdivision surfaces.
Architecture of a Memory Manager for an MPEG-2 Video Decoding Circuit
Authors: Olivier Cantineau, Laurent Petit, Jean-Didiero Legat
Venue: Journal of VLSI Signal Processing Systems (1998)

A study of the MPEG-2 video decoding standard in Main Profile @ Main Level has been performed, comparing the different solutions existing for the VLSI implementation of the basic functions (Huffman decoding, IDCT...) included in the standard. Afterwards, a new dynamically configurable architecture is proposed for the memory manager, which is necessary to deal with the large data flow inside the decoder. It is aimed at interfacing the external memory, arbitrating the access requests coming from the different decoding units and allowing generic memory requests through the definition of virtual addresses. It is shown that, by means of a particular data organization, the circuit requires an external memory, which is a 2-MB DRAM in fast page or EDO mode, accessible via a 64-bit bus. The memory manager works at 27 MHz and allows a real-time decoding for MP @ ML bitstreams. It has been synthesized in a 0.8-&mu;m two-metal CMOS technology and presents a total area of 5.4 mm2 for 6500 gates.
Topology Optimization of Trusses&mdash;Random Cost Method Versus Evolutionary Algorithms
Authors: Bernd Baumann, Bernd Kost
Venue: Computational Optimization and Applications (1999)

The recently proposed random cost method is applied to the topology optimization of trusses. Its performance is compared to previous genetic algorithm and evolution strategy simulations. Random cost turns out to be an optimization method with attractive features. In comparison to the genetic algorithm approach of Hajela, Lee and Lin, random cost turns out to be simpler and more efficient. Furthermore it is found that in contrast to evolution strategy, the random cost strategy&lsquo;s ability to find optima, is independent of the initial structure. This characteristic is related to the important capacity of escaping from local optima.
Fully Lagrangian and Lattice Boltzmann Methods for the Advection-Diffusion Equation
Authors: Z. L. Guo, B. C. Shi, N. C. Wang
Venue: Journal of Scientific Computing (1999)

In the last decade or so, the Lattice&ndash;Boltzmann method (LBM) has achieved great success in computational fluid dynamics. The Fully&ndash;Lagrangian method (FLM) is the generalization of LBM for conservation systems. LBM can also be developed from FLM. In this paper a FL model and a LB model are developed for D-dimensional advection-diffusion equation. The LB model can be viewed as an improved version of the FL model. Numerical results of simulation of 1-dimensional advection-diffusion equation are presented. The numerical results are found to be in good agreement with the analytic solution.
Stable Methods for Vortex Sheet Motion in the Presence of Surface Tension
Authors: Gregory Baker, André Nachbin
Venue: SIAM Journal on Scientific Computing (1998)

Boundary integral techniques provide a convenient way to study the evolution of an interface between inviscid liquids. Several studies have revealed that standard numerical approximations tend to lead to unstable methods, and various remedies have been introduced and tested. In this paper, we conduct a stability analysis of the linearized equations with a particular objective in mind---the determination of how the discrete system fails to capture the physical dispersion relation precisely for the available discrete modes. We discover two reasons for the typical failure in numerical discretizations: one is the inability of the mesh to represent the vorticity created by surface tension effects on the finest scale; and the other is the inaccuracies in the evaluation of the boundary integral for the velocity. With the insight gained from our linear analysis, we propose a new method that is spectrally accurate and linearly stable. Further, the exact dispersion relation is obtained for all the available discrete modes. Numerical tests suggest that the method is also stable in the nonlinear regime. However, our method runs into difficulties generic to methods based on Lagrangian motion. The markers accumulate near a stagnation point on the interface, forcing us to use an ever decreasing time step in our explicit method. We introduce a redistribution of markers to overcome this difficulty. When we redistribute according to equal arclength, we find excellent agreement with a method based on preserving equal spacing in arclength.
Characterizing processor architectures for programmable network interfaces
Authors: Patrick Crowley, Marc E. Fluczynski, Jean-Loup Baer, Brian N. Bershad
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

The rapid advancements of networking technology have boosted potential bandwidth to the point that the cabling is no longer the bottleneck. Rather, the bottlenecks lie at the crossing points, the nodes of the network, where data traffic is intercepted or forwarded. As a result, there has been tremendous interest in speeding those nodes, making the equipment run faster by means of specialized chips to handle data trafficking. The Network Processor is the blanket name thrown over such chips in their varied forms. To date, no performance data exist to aid in the decision of what processor architecture to use in next generation network processor. Our goal is to remedy this situation. In this study, we characterize both the application workloads that network processors need to support as well as emerging applications that we anticipate may be supported in the future. Then, we consider the performance of three sample benchmarks drawn from these workloads on several state-of-the-art processor architectures, including: an aggressive, out-of-order, speculative super-scalar processor, a fine-grained multithreaded processor, a single chip multiprocessor, and a simultaneous multithreaded processor (SMT). The network interface environment is simulated in detail, and our results indicate that SMT is the architecture best suited to this environment.
The social life of small graphical chat spaces
Authors: Marc A. Smith, Shelly D. Farnham, Steven M. Drucker
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

This paper provides a unique quantitative analysis of the social dynamics of three chat rooms in the Microsoft V-Chat graphical chat system. Survey and behavioral data were used to study user experience and activity. 150 V-Chat participants completed a web-based survey, and data logs were collected from three V-Chat rooms over the course of 119 days. This data illustrates the usage patterns of graphical chat systems, and highlights the ways physical proxemics are translated into social interactions in online environments. V-Chat participants actively used gestures, avatars, and movement as part of their social interactions. Analyses of clustering patterns and movement data show that avatars were used to provide nonverbal cues similar to those found in face-to-face interactions. However, use of some graphical features, in particular gestures, declined as users became more experienced with the system. These findings have implications for the design and study of online interactive environments.
Using Path Induction to Evaluate Sequential Allocation Procedures
Authors: Janis P. Hardwick, Quentin F. Stout
Venue: SIAM Journal on Scientific Computing (1999)

Path induction is a technique used to speed the process of making multiple exact evaluations of a sequential allocation procedure, where the options are discrete and their outcomes follow a discrete distribution. Multiple evaluations are needed for determining criteria such as maxima or minima over parameter regions (where the location of the extremal value is unknown in advance), for visualizing characteristics such as robustness, or for obtaining the distribution of a statistic rather than just its mean. By using an initial phase to determine the number of paths reaching each terminal state, the subsequent evaluations are far faster than repeated use of standard evaluation techniques. Algorithms are given for fully sequential and staged sequential procedures, and the procedures can be either deterministic or random. The procedures can be generated by any technique (including dynamic programming or ad hoc approaches), and the evaluations performed can be quite flexible and need not be related to the method of obtaining the procedure. While the emphasis is on path induction, the techniques used to speed up the analyses of staged allocation procedures can also be used to improve backward induction for such procedures. If multiple evaluations need to be carried out, however, path induction will still be far superior. For each parameter configuration to be evaluated, one reduces the time by a factor of n, where n is the size of the experiment, by using path induction rather than the standard technique of backward induction. In some settings the savings is significantly greater than n.
A user-centered interface for querying distributed multimedia databases
Authors: Isabel F. Cruz, Kimberly M. James
Venue: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (1999)

Facilitating information retrieval in the vastly growing realm of digital media has become increasingly difficult. DelaunayMM seeks to assist all users in finding relevant information through an interactive interface that supports pre- and post-query refinement, and a customizable multimedia information display. This project leverages the strengths of visual query languages with a resourceful framework to provide users with a single intuitive interface. The interface and its supporting framework are described in this paper.
Extrapolation of Nystrom Solution for Two-Dimensional Nonlinear Fredholm Integral Equations
Authors: Han Guoqiang, Wang Jiong
Venue: Journal of Scientific Computing (1999)

In this paper, we analyze the existence of asymptotic error expansion of Nystrom solution for two-dimensional nonlinear Fredholm integral of the second kind. We show that the Nystrom solution admits an error expansion in powers of the step-size h and the step-size k. For a special choice of the numerical quadrature, the leading terms in the error expansion for the Nystrom solution contain only even powers of h and k, beginning with terms h2p and k2q. These expansions are useful for the application of Richardson extrapolation and for obtaining sharper error bounds. Numerical examples show that how Richardson extrapolation gives a remarkable increase of precision, in addition to faster convergence.
A Framework for Automatic Landmark Identification Using a New Method of Nonrigid Correspondence
Authors: Andrew Hill, Chris J. Taylor, Alan D. Brett
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

A framework for automatic landmark indentification is presented based on an algorithm for corresponding the boundaries of two shapes. The auto-landmarking framework employs a binary tree of corresponded pairs of shapes to generate landmarks automatically on each of a set of example shapes. The landmarks are used to train statistical shape models known as Point Distribution Models. The correspondence algorithm locates a matching pair of sparse polygonal approximations, one for each of a pair of boundaries by minimizing a cost function, using a greedy algorithm. The cost function expresses the dissimilarity in both the shape and representation error (with respect to the defining boundary) of the sparse polygons. Results are presented for three classes of shape which exhibit various types of nonrigid deformation.
Relative Perturbation Theory: II. Eigenspace and Singular Subspace Variations
Authors: Ren-Cang Li
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

The classical perturbation theory for Hermitian matrix eigenvalue and singular value problems provides bounds on invariant subspace variations that are proportional to the reciprocals of absolute gaps between subsets of spectra or subsets of singular values. These bounds may be bad news for invariant subspaces corresponding to clustered eigenvalues or clustered singular values of much smaller magnitudes than the norms of matrices under considerations. In this paper, we consider how eigenspaces of a Hermitian matrix A change when it is perturbed to $\widetilde A=D^*AD$ and how singular spaces of a (nonsquare) matrix B change when it is perturbed to $\widetilde B=D_1^*BD_2$, where D, D1, and D2 are nonsingular. It is proved that under these kinds of perturbations, the changes of invariant subspaces are proportional to the reciprocals of relative gaps between subsets of spectra or subsets of singular values. The classical Davis--Kahan $\sin\theta$ theorems and Wedin $\sin\theta$ theorems are extended.
Algorithms for Parameter Selection in the Weeks Method for Inverting the Laplace Transform
Authors: J. A. C. Weideman
Venue: SIAM Journal on Scientific Computing (1999)

The Weeks method is one of the most efficient numerical techniques for inverting the Laplace transform, provided two free parameters in the Laguerre expansion on which the method is based are chosen judiciously. However, there appear to be no theoretical estimates or numerical algorithms for computing these parameters. The two algorithms presented in this paper fill that gap. Both algorithms aim to minimize a theoretical error estimate, and both are implemented with the FFT. The first algorithm is restricted to a certain class of transforms and the user is expected to provide information on the singularities of the transform. The second algorithm, though more expensive, is completely general---no singularity information is required. In challenging numerical tests, both algorithms successfully predicted values of the parameters that are near optimal.
Donor-funded information technology transfer projects: evaluating the life-cycle approach in four Chinese science and technology projects
Authors: Erick Baark, Richard Heeks
Venue: Information Technology for Development (1999)

Information technology (IT) forms an increasingly important component of donor-funded development projects, yet there has been very little structured analysis of the IT transfer process. This paper presents and evaluates a structured framework for analysis of IT transfer - the information technology transfer life-cycle - based on a study of four Chinese technology projects. The life-cycle framework helps to structure both data-gathering and analysis, and it is used to highlight a number of shortcomings within the Chinese projects. However, several broader project and environmental issues are also identified that impinge on the technology transfer process. The life-cycle framework must therefore be viewed within a broader contextual model, which is presented in the paper.
Process algebras are getting mature for performance evaluation?!
Authors: Ulrich Herzog
Venue: ACM SIGMETRICS Performance Evaluation Review (1999)

Designing hardware/software systems in the traditional way we clearly separate methods for the functional design and performance evaluation. Beside many merits the well known insularity-problem is one of the consequences. Therefore, in system engineering we see a clear trend towards an integral treatment of both aspects.We briefly summarize research results obtained during the last decade by embedding stochastic processes into process algebras, an advanced concept for the design of parallel and distributed systems. The central objective of these Stochastic Process Algebras is the modular and hierarchical modelling and analysis of complex systems. A general introduction and related references from different research groups may be found in [1, 2].
Integrated TMN Service Management
Authors: Graham Chen, Qinzheng Kong, Jaon Etheridge, Paul Foster
Venue: Journal of Network and Systems Management (1999)

The deregulation of the global telecommunication industry has seen a change in the business and operational environment in which services are deployed and managed. The requirements have intensified to provide a management framework for telecommunication networks and services across multiple technology domains and using multiple management technologies. This paper describes an integrated TMN service management architecture that provides an environment for different service management functions and different management domains to be integrated. To further substantiate this architecture, a system was built to demonstrate the integration concepts. The research and development work reported in this paper focuses on the following two aspects of integration: first the integration between TMN network and service management functions; and next the integration between different service management functions. A proof of concept system was developed to demonstrate such integration. It consists of the following components: Generic service ordering and provisioning; connection management based on a generic network model concept; and service management based upon service level agreement management and customer service management concepts. This paper reports this work and the experiences gained from this research.