ppxscal/embedding_network huggingface dataset:
Embedded software in real-time signal processing systems: design technologies
Authors: Gert Goossens, Johan Van Praet, Dirk Lanneer, Werner Geurts, Augusli Kifli, Clifford Liem, Pierre G. Paulin
Venue: Readings in hardware/software co-design (2001)

The increasing use of embedded software, often implemented on a core processor in a single-chip system, is a clear trend in the telecommunications, multimedia, and consumer electronics industries. A companion paper in this issue (1) presents a survey of application and architecture trends for embedded systems in these growth markets. However, the lack of suitable design technology remains a significant obstacle in the development of such systems. One of the key requirements is more efficient software compilation technology. Especially in the case of fixed-point digital signal processor (DSP) cores, it is often cited that commercially available compilers are unable to take full advantage of the architectural features of the processor. Moreover, due to the shorter lifetimes and the architectural specialization of many processor cores, processor designers are often compelled to neglect the issue of compiler support.
Quaternary Codes
Authors: Zhe-Xian X. Wan, Che-Hsien Wan
Venue:  (1998)

:In recent years quaternary codes have attracted the attention of the coding community as several notorious binary nonlinear codes containing more codewords than any known linear codes were found to be binary images under the Gray map of linear codes over Z 4 This discovery opens the way for a broader study of quaternary codes, which constitute a rapidly growing area of coding theory. This book is based on the author's lectures in Xi'an, China and Lurid, Sweden and covets the most recent developments of this theory.
ColdFusion 4 for Dummies, 1st edition
Authors: Alexis D. Gutzman, John Paul Ashenfelter, Charlie Arehart, Charles Arehart
Venue:  (1999)

:Develop sophisticated Web applications with this reference on the award-winning ColdFusion development studio. Gutzman helps readers get up to speed on how to use this amazing product to quickly implement easy-to-write scripts into their Web site. The CD-ROM includes sample scripts, ready-to-use applets, and useful Web authoring tools.
On the Optimality of General Lower Bounds for Broadcasting and Gossiping
Authors: Michele Flammini, Stéphane Pérennès
Venue: SIAM Journal on Discrete Mathematics (2001)

In this paper we show that many general lower bounds on the broadcasting and gossiping time are optimal. In particular, let b(G) be the broadcasting time of a network G under the basic one-port model. The only lower bound on b(G) holding for every n vertices graph G is max$(\log_2 n, Diam(G))$, but the $\log_2 n$ factor cannot be achieved in bounded degree networks. In fact, let the parameter d be defined in undirected graphs as the maximum degree minus one and for directed graphs as the maximum out-degree. Then, in [ SIAM J. Discrete Math., 1 (1998), pp. 531--540; SIAM J. Discrete Math., 5 (1992), pp. 10--24] it has been proved that, for any graph G of parameter d, b(G) \geq \frac{\log_2 n}{\log_2 \xi}$, where $\xi$ is the largest real number such that $\xi^{d} -\xi^{d-1} - \xi^{d-2} -\cdots - \xi-1=0$. Since then many papers have proposed constructions of bounded degree networks having a small broadcast time [Proceedings of the 2nd International Euro-Par Conference (EUROPAR), Lecture Notes in Comput. Sci. 1123, Springer-Verlag, New York, 1996, pp. 313--324; IEEE Trans. Comput., 33 (1984), pp. 190--194], but so far the optimality of [SIAM J. Discrete Math., 1 (1998), pp. 531--540; {SIAM J. Discrete Math.}, 5 (1992), pp. 10--24] was still an open question.In this paper we prove that the above lower bound is tight, improving all the existing upper bounds by means of probabilistic methods. Namely, we show that for n arbitrarily large there exist families of n vertices graphs in which a uniformly drawn graph has broadcasting time as predicted by [SIAM J. Discrete Math., 1 (1998), pp. 531--540; SIAM J. Discrete Math., 5 (1992), pp. 10--24] with probability converging to 1. Moreover, we show that [SIAM J. Discrete Math., 1 (1998), pp. 531--540; SIAM J. Discrete Math., 5 (1992), pp. 10--24] is attained even in the case of gossiping and systolic gossiping in the full-duplex mode.Finally, new upper bounds on bounded-degree and systolic gossiping are also determined in the directed and half-duplex modes. While the systolic construction is tight and matches the lower bound of [Inform and Comput., to appear], we strongly conjecture that the bounded-degree result is optimal and that a corresponding matching lower bound is still to be proven.
A P1 - P1 Finite Element Method for a Phase Relaxation Model II: Adaptively Refined Meshes
Authors: Xun Jiang, Ricardo H. Nochetto, Claudio Verdi
Venue: SIAM Journal on Numerical Analysis (1999)

We examine the effect of adaptively generated refined meshes on the P1 - P1 finite element method with semi-explicit time stepping of part I, which applies to a phase relaxation model with small parameter $\ep>0$. A typical mesh is highly graded in the so-called refined region, which exhibits a local meshsize proportional to the time step $\tau$, and is coarse in the remaining parabolic region where the meshsize is of order $\sqrt\tau$. Three admissibility tests guarantee mesh quality and, upon failure, lead to remeshing and so to incompatible consecutive meshes. The most severe test checks whether the transition region, where phase changes take place, belongs to the refined region. The other two tests monitor equidistribution of pointwise interpolation errors. The resulting adaptive scheme is shown to be stable in various Sobolev norms and to converge with a rate of order $\Or(\tau/\sqrt\ep)$ in the natural energy spaces. Several numerical experiments illustrate the scheme's efficiency and enhanced performance as compared with those of part I.
On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
Authors: Alexander Shapiro, Tito Homem-de-Mello
Venue: SIAM Journal on Optimization (2000)

In this paper we discuss Monte Carlo simulation based approximations of a stochastic programming problem. We show that if the corresponding random functions are convex piecewise linear and the distribution is discrete, then an optimal solution of the approximating problem provides an exact optimal solution of the true problem with probability one for sufficiently large sample size. Moreover, by using the theory of large deviations, we show that the probability of such an event approaches one exponentially fast with increase of the sample size. In particular, this happens in the case of linear two- (or multi-) stage stochastic programming with recourse if the corresponding distributions are discrete. The obtained results suggest that, in such cases, Monte Carlo simulation based methods could be very efficient. We present some numerical examples to illustrate the ideas involved.
Inverted file search algorithms for collaborative filtering
Authors: Rickard Cöster, Martin Svensson
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

This paper explores the possibility of using a disk based inverted file structure for collaborative filtering. Our hypothesis is that this allows for faster calculation of predictions and also that early termination heuristics may be used to further speed up the filtering process and perhaps even improve the quality of the predictions. In an experiment on the EachMovie dataset this was tested. Our results indicate that searching the inverted file structure is many times faster than general in-memory vector search, even for very large profiles. The Continue termination heuristics produces the best ranked predictions in our experiments, and Quit is the top performer in terms of speed.
Internet nuggets
Authors: Mark Thorson
Venue: ACM SIGARCH Computer Architecture News (2001)

This column consists of selected traffic from the comp.arch newsgroup, a forum for discussion of computer architecture on Internet---an international computer network.
The C Workbook, 1st edition
Authors: Sathis Menon
Venue:  (1993)

:This practical guide gives a clear,concise introduction to C for programmers. Designed for students and professionals who need a quick and direct introduction to ANSI C. Intended as a companion to courses in operating systems,compilers,programming languages,et al.,where C is a necessary vehicle for communication.
VS.: Official Game Secrets
Authors: Anthony James, Christian Kenney
Venue:  (1997)

:Defend your turf with this official guide book that gives you complete moves lists, the best combos to help you kick butt, personal stats for each fighter, and keys to unlock secret characters you didnÆt even know existed.
An APL ompiler
Authors: Tilman P. Otto
Venue: Proceedings of the international conference on APL-Berlin-2000 conference (2000)

Even if APL is the best-suited programming language for multi-dimensional data, nowadays computer applications additionally require complex graphical user interfaces, internet and database access. Combining software written in C, C++ or Java with interpreted APL programs is difficult. A homogeneous solution has been found by automatically converting APL programs into native C code. A complete APL2 like system including interpreter and session manager has been implemented in ISO C from scratch based on the standard C library. It is the property of the author and not yet commercially available. It has been successfully compiled on several operating systems. The built in system call APL2C allows one to compile any APL function including all referenced functions or operators within the workspace into native C code and completely removes the interpreter using direct calls to the C coded APL primitives. Only obvious restrictions (no runtime execution of character arrays or dynamic creation of functions via FX) apply. In addition, a makefile is created to enable the simple build of standalone executable files. The C files, generated by APL2C, can be easily mixed with other C/C++ source files and compiled on any platform provided that the required library for the APL primitives is available.
MCSE Windows 2000 Accelerated Exam Prep
Authors: Lance Cockcroft, Ron Kauffman, Erik Eckel
Venue:  (2000)

:Covers all curriculum objectives for the Microsoft Windows 2000 Accelerated exam (70-240). Offers a proven method for in-depth study, review, and real-life practice. Provides all of the overviews, concepts, and terminology necessary to help candidates get up to speed on the new certification as quickly as possible. Compares all changes between the Windows NT system and the new features of the Microsoft operating system to provide the reader with the experience necessary to upgrade to the new system.
Neural Network Method for Solving Partial Differential Equations
Authors: Lucie P. Aarts, Peter Van Der Veer
Venue: Neural Processing Letters (2001)

A method is presented to solve partial differential equations (pde's) and its boundary and/or initial conditions by using neural networks. It uses the fact that multiple input, single output, single hidden layer feedforward networks with a linear output layer with no bias are capable of arbitrarily well approximating arbitrary functions and its derivatives, which is proven by a number of authors and well known in literature. Knowledge about the pde and its boundary and/or initial conditions is incorporated into the structures and the training sets of several neural networks. In this way we obtain networks of which some are specifically structured. To find the solution of the pde and its boundary and/or initial conditions we have to train all obtained networks simultaneously. Therefore we use an evolutionary algorithm to train the networks. We demonstrate the working of our method by applying it to two problems.
Computing in totally anonymous asynchronous shared memory systems
Authors: Hagit Attiya, Alla Gorbach, Shlomo Moran
Venue: Information and Computation (2002)

In the totally anonymous shared memory model of asynchronous distributed computing, processes have no identifiers and run identical programs. Moreover, processes have identical interface to the shared memory, and in particular, there are no single-writer registers. This paper assumes that process do not fail, and the shared memory consists only of read/write registers, which are initialized default value. A complete characterization of the functions and agreement tasks that can be solved in this model is presented. Furthermore, it is shown that if a function is computable, then two registers are sufficient for some algorithm to compute it. Consensus is an important agreement task that can be computed. The paper proves logarithmic lower bounds on the number of registers and rounds needed for solving consensus in this model. A consensus protocol using a linear number of shared registers and rounds is also presented.
Impossibility of distributed consensus with one faulty process
Authors: Michael J. Fischer, Nancy A. Lynch, Michael S. Paterson
Venue: Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems (1983)

The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the "Byzantine Generals" problem.
A Finer Aspect of Eigenvalue Distribution of Selfadjoint Band Toeplitz Matrices
Authors: Peter Zizler, Rob A. Zuidwijk, Keith F. Taylor, Shigeru Arimoto
Venue: SIAM Journal on Matrix Analysis and Applications (2002)

The asymptotics of eigenvalues of Toeplitz operators has received a lot of attention in the mathematical literature and has been applied in several disciplines. This paper describes two such application disciplines and provides refinements of existing asymptotic results using new methods of proof. The following result is typical: Let $T(\varphi)$ be a selfadjoint band limited Toeplitz operator with a (real valued) symbol $\varphi$, which is a nonconstant trigonometric polynomial. Consider finite truncations $T_n(\varphi)$ of $T(\varphi)$, and a finite union of finite intervals of real numbers $E$. We prove a refinement of the Szegö asymptotic formula \[ \lim_{n\rightarrow \infty }\frac{N_n(E)}n=\frac 1{2 \pi}m(F). \] Indeed, we show that \[ N_n(E) - \frac 1{2\pi}m(F)n = {\it O}(1). \] Here $m(F)$ denotes the measure of $F = \varphi^{-1}(E)$ on the unit circle, and $N_n(E)$ denotes the number of eigenvalues of $T_n(\varphi)$ inside $E$. We prove similar results for singular values of general Toeplitz operators involving a refinement of the Avram--Parter theorem.
Achieving undo in bitmap-based collaborative graphics editing systems
Authors: Xueyi Wang, Jiajun Bu, Chun Chen
Venue: Proceedings of the 2002 ACM conference on Computer supported cooperative work (2002)

Bitmap-based collaborative graphics editing systems are a special class of real-time collaborative editing systems. Undo is an important and difficult problem in these systems. Existing solutions show low efficiency because additional space cost should be added to achieve the function of undo. In this paper, we propose a new solution to resolve the undo problem. The basic idea is to reduce space cost through exploring relations among operations. The algorithm given in the paper can undo any operation at any time, and can greatly reduce the space cost while increasing a few time cost. The issues about undo scope and undo mode are also discussed in the paper.
Math into Latex: An Introduction to Latex and AMS-Latex, 2nd edition
Authors: George Gratzer
Venue:  (1995)

:Gr&auml;tzer's book provides the beginner with a simple, direct approach. Using numerous examples, a formula gallery, sample files, and templates, a short course, Part I, guides the reader through typing text, math formulas, equations, and an article template making it possible to start typing an article with only a few hours time. The rest of this book provides systematic discussion of all aspects of LaTeX and the AMS packages, customization, and introduces two major tools to help compile long bibliographies and indexes.
Digital Signal Processing: A Laboratory Approach Using PC-DSP, 2nd edition
Authors: Oktay Alkin
Venue:  (1994)

:This innovative text/disk package enables users to explore a variety of digital signal processing concepts through hands-on, interactive computer exercises. Paralleling the coverage of most undergraduate-level DSP texts, Digital Signal Processing begins the discussion of each topic with a brief introduction to its theory. This is followed by multi-part exercises - over 140 in all - that can be solved using the accompanying software. Each exercise was designed to explore a fundamental concept in digital signal processing. The accompanying software helps you generate, analyze, and process signals, compute transforms, as well as design and analyze filters. Features the student edition of PC-DSP version 2 (for MSDOS); emphasizes the use of computer graphics to illustrate signal processing concepts that may otherwise be difficult to grasp; uses an easy-to-learn interactive user interface, complete with context-sensitive on-line help features. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Texturing and Modeling: A Procedural Approach, 3rd edition
Authors: David S. Ebert, F. Kenton Musgrave, Darwyn Peachey, Ken Perlin, Steven Worley
Venue:  (2002)

:This the classic text/tutorial/reference introducing and defining the procedural approach to texturing and modeling and computer graphics in general. This Second Edition is completely revised and updated to the current computer graphics marketplace. It contains a toolbox of procedures upon which programmers can build a library of textures and objects, and includes extensive explanations of how these functions work and how to design new functions. New chapters include: Cellular Texture Generation, Volumetric Cloud Modeling with Implicit Functions, Interacting with Virtual Actors, and Rendering with Adaptive Level of Detail.
Relational Database Writings 1994-1997, 1st edition
Authors: C.J. J. Date, Hugh Darwen, D. Mcgoveran
Venue:  (1998)

:This book is the fifth in Chris Date's well known Relational Database Writings series. Like its precursors, the book consists of a collection of papers on various aspects of relational technology. It is divided into four parts: I. Theory is Practical II. Relational Database Management III. The Problem of Missing Information IV. Relational vs. Nonrelational Systems This unique collection combines practical advice on how to solve real world implementation problems with more thought-provoking and sometimes controversial articles. The first part consists of installments from Chris Date's regular column in Database Programming and Design magazine in which he takes a variety of theoretical aspects of relational technology and explains, in a non-academic way, just why those aspects are important and why they should be of interest to the database practitioner. In Part II, Hugh Darwen and David McGoveran comment on the true nature of databases and on the status of attempts to implement the relational model in the industry. There is also a detailed introduction to the ideas behind The Third Manifesto - the log ical foundation for object/relational databases - something every database professional will want to read. Part III addresses the much discussed but serious issue of missing information and provides a well argued case for why many-valued logics are u nsuitable as a basis for addressing the problem. Finally, Part IV provides a critical and sometimes controversial analysis of object databases. In addition, an appendix contains the transcript for a live presentation entitled "Database Graffiti". Relational Database Writings 1994-1997 continues the tradition established by its predecessors and will need no further recommendation for readers familiar with them. It is essential reading for all serious database students and professionals. * The fifth in the series of books written by Chris Date on the general topic of database technology * Chris Date is renowned for his ability to explain complex technical material in a clear and understandable fashion * Should appeal to anyone working in the area of database technology from professional to academic * Covers articles he has written from 1994-1997 that he feels are worth preserving
Wireless Network Deployments
Authors: Rajamani Ganesh, Kaveh Pahlavan
Venue:  (2000)

:An important aspect of wireless networks is the deployment of their infrastructure. In this book, the Editors have invited a number of experts from industry to write on a variety of topics associated with deployment of digital wireless networks. The first part of the book consists of an overview of systems design and engineering integration, comparison of polarization and space diversity antenna systems, and the performance of deploying smart antenna architectures in cellular and PCS networks. The second part addresses deployment of CDMA networks, based on IS-95 standards. Here the authors discuss issues related to optimization of overlaid dual model CDMA networks, embedding microcells to improve hot-spot capacity, and mitigation of intermodulation distortion in handsets. Part III deals with deployment of TDMA- based networks. The issues presented include developing hierarchical systems, reconfigurable transceivers, and deploying the GSM frequency hopping feature for enhancing existing traffic capacity. The last part, on Wireless Data Networks, is comprised of issues related to the performance of GPRS systems deployed as an upgrade on current networks and deployment of wireless LANs. Critical issues for deploying an IEEE 802.11-based WLAN are examined. Wireless Network Deployments provides practical engineering guidance for wireless and cellular engineers, researchers, technicians, and managers working in second and third generation digital wireless networks.
The application of the intercolor 8000 terminal to thematic cartography
Authors: James R. Carter, David J. Icove
Venue: ACM SIGGRAPH Computer Graphics (1976)

The Intercolor 8000 color video terminal is used in conjunction with a timesharing computer system for applications in thematic cartography. The version of the terminal discussed can resolve the screen into a matrix of 25 rows by 80 columns with colored characters on colored backgrounds. Using the plot mode, the screen can be further resolved into single-color cells of 100 rows by 160 columns. The value and limitations of the terminal are discussed in terms of the selection and brightness of the eight colors, the dimensions of the cells and the ability to mix colors in small cells. The possibilities of using the terminal for dot, choropleth and isarithmic maps are explored. Acetate overlays can be used to add base lines such as boundaries and rivers and the composite images can be recorded on standard slide film.
A Note on Preconditioning Nonsymmetric Matrices
Authors: Ilse C. F. Ipsen
Venue: SIAM Journal on Scientific Computing (2001)

The preconditioners for indefinite matrices of KKT form in [M. F. Murphy, G. H. Golub, and A. J. Wathen, SIAM J. Sci. Comput., 21 (2000), pp. 1969--1972] are extended to general nonsymmetric matrices.