ppxscal/embedding_network huggingface dataset:
Bounds for the Structured Backward Errors of Vandermonde Systems
Authors: Ji-guang Sun
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

Consider the primal Vandermonde system V(a)x=b and the dual Vandermonde system V(a)Tx=b, whereV(a) is the Vandermonde matrix defined in terms of the vector a =(\alpha_1, \ldots, \alpha_n)^T$ with distinct scalars $\alpha_1,\ldots, \alpha_n \in {\cal C}$. In view of the special structure of the matrix V(a), we define structured backward errors (SBEs) of the Vandermonde systems and describe a technique for obtaining upper and lower bounds for the SBEs. The results are illustrated by numerical examples.
Ethernet: the definitive guide
Authors: Charles E. Spurgeon
Venue: O'Reilly Series On Designing And Managing Local Area Networks (2000)

Ethernet is a core networking technology used by every high tech business. While the basic protocols have changed little, new options such as Fast Ethernet and Gigabit Ethernet have increased the complexity of the topic. Ethernet has been the flavor of choice for networking administrators since the early 1980s because of its ease of use and scalability. Written by one of the foremost experts on Ethernet standards and configuration, Charles E. Spurgeon, Ethernet: The Definitive Guide includes everything you need to know to set up and maintain an Ethernet network. Ethernet: The Definitive Guide teaches you everything you need to know about the IEEE 802.3 Ethernet standard and its protocols. The book is logically separated into five parts: Introduction to Ethernet provides a tour of basic Ethernet theory and operation, including a description of Ethernet frames, operation of the Media Access Control (MAC) protocol, full-duplex mode and auto-negotiation.Ethernet Media Systems is the heart of the book. This sectionof Ethernet: The Definitive Guide shows you how to build media-specific Ethernet networks, from a basic 10BASE-T Ethernet offering 10 Mbps over twisted-pair cables, to an advanced 1000BASE-X Gigabit Ethernet, providing up to 1 Gbps of data transfer over fiber optic cables.Building Your Ethernet System teaches you how to build twisted-pair and fiber optic media segments, as well as how to build your Ethernet using repeaters and hubs.Performance and Troubleshooting is divided into two chapters. The first describes both the performance of a given Ethernet channel, as well as the performance of the entire network system. The second includes a tutorial on troubleshooting techniques and describes the kinds of problems network administrators are likely to encounter. The last part of the book includes a complete glossary of terms used throughout the book, a resource list, descriptions of thick and thin coax-based Ethernet systems, a guide to AUI equipment installation and configuration, and a listing of troubleshooting numbers. This book is the definitive guide for anyone wanting to build a scalable local area network (LAN) using Ethernet.
The Discrete Cosine Transform
Authors: Gilbert Strang
Venue: SIAM Review (1999)

Each discrete cosine transform (DCT) uses $N$ real basis vectors whose components are cosines. In the DCT-4, for example, the $j$th component of $\boldv_k$ is $\cos (j + \frac{1}{2}) (k + \frac{1}{2}) \frac{\pi}{N}$. These basis vectors are orthogonal and the transform is extremely useful in image processing. If the vector $\boldx$ gives the intensities along a row of pixels, its cosine series $\sum c_k \boldv_k$ has the coefficients $c_k=(\boldx,\boldv_k)/N$. They are quickly computed from a Fast Fourier Transform. But a direct proof of orthogonality, by calculating inner products, does not reveal how natural these cosine vectors are. We prove orthogonality in a different way. Each DCT basis contains the eigenvectors of a symmetric "second difference" matrix. By varying the boundary conditions we get the established transforms DCT-1 through DCT-4. Other combinations lead to four additional cosine transforms. The type of boundary condition (Dirichlet or Neumann, centered at a meshpoint or a midpoint) determines the applications that are appropriate for each transform. The centering also determines the period: $N-1$ or $N$ in the established transforms, $N-\frac{1}{2}$ or $N+ \frac{1}{2}$ in the other four. The key point is that all these "eigenvectors of cosines" come from simple and familiar matrices.
The Internet-based lecture: converging teaching and technology
Authors: J. Mark Pullen
Venue: ACM SIGCSE Bulletin (2000)

Network-based distributed education is a reality today. At George Mason University, we have been pursuing a capability beyond the widespread practice of supporting courses with webpages: delivering lectures and seminars in real time, over the Internet. This paper describes the range of distributed education technologies available today, focusing on issues of instructor presentation, student participation, and temporal qualities of response to student questions. The analysis supports our selection of desktop audiographics for synchronous Internet-based course delivery. Courses that have been presented in this mode are described, along with factors influencing their success and factors in student participation.
A Note on Asset Proportions, Stochastic Dominance, and the 50% Rule
Authors: Ephraim Clark, Octave Jokung
Venue: Management Science (1999)

In this note we analyze the composition of an optimal portfolio by considering the cumulative conditional expected outcome of two dependent assets. We develop a conditional stochastic dominance relation and show that for any concave von Neumann-Morgenstern utility function, the proportion of wealth invested in the dominant asset will be greater than 50%.
Optimal Control of Continuous Casting by Nondifferentiable Multiobjective Optimization
Authors: Kaisa Miettinen, Marko M. Mäkelä, Timo Männikkö
Venue: Computational Optimization and Applications (1998)

A new version of an interactive NIMBUS method for nondifferentiable multiobjective optimization is described. It is based on the reference point idea and the classification of the objective functions. The original problem is transformed into a single objective form according to the classification information. NIMBUS has been designed especially to be able to handle complicated real-life problems in a user-friendly way.The NIMBUS method is used for solving an optimal control problem related to the continuous casting of steel. The main goal is to minimize the defects in the final product. Conflicting objective functions are constructed according to certain metallurgical criteria and some technological constraints. Due to the phase changes during the cooling process there exist discontinuities in the derivative of the temperature distribution. Thus, the problem is nondifferentiable.Like many real-life problems, the casting model is large and complicated and numerically demanding. NIMBUS provides an efficient way of handling the difficulties and, at the same time, aids the user in finding a satisficing solution. In the end, some numerical experiments are reported and compared with earlier results.
i3: intelligent, interactive investigation of OLAP data cubes
Authors: Sunita Sarawagi, Gayatri Sathe
Venue: ACM SIGMOD Record (2000)

The goal of the i3(eye cube) project is to enhance multidimensional database products with a suite of advanced operators to automate data analysis tasks that are currently handled through manual exploration. Most OLAP products are rather simplistic and rely heavily on the user's intuition to manually drive the discovery process. Such ad hoc user-driven exploration gets tedious and error-prone as data dimensionality and size increases. We first investigated how and why analysts currently explore the data cube and then automated them using advanced operators that can be invoked interactively like existing simple operators. Our proposed suite of extensions appear in the form of a toolkit attached with a OLAP product. At this demo we will present three such operators: DIFF, RELAX and INFORM with illustrations from real-life datasets.
Open Signaling for ATM, INTERNET and Mobile Networks (OPENSIG'98)
Authors: Andrew T. Campbell, Irene Katzela, Kazuho Miki, John Vicente
Venue: ACM SIGOPS Operating Systems Review (1999)

The ability to rapidly create and deploy new transport, control and management architectures in response to new service demands is a key factor driving the programmable networking community. Competition between service providers may hinge on the speed at which one provider can respond to new market demands over another. The notion of open programmable networks is having broad impact on service providers and vendors across a range of telecommunication sectors calling for major advances in open network control architecture, network programmability and distributed systems technology. In this paper we discuss the origins of the Open Signalling Working Group (OPENSIG) and present a summary of the fifth Workshop on Open Signaling for ATM, Internet and Mobile Networks (OPENSIG'98), which was held at the University of Toronto, Ontario, October, 1998. We also discuss a number of new initiatives in the area of open programmable networks that have recently emerged.
Solution of Nonlinear Rational Expectations Models with Applications toFinite-Horizon Life-Cycle Models of Consumption
Authors: Michael Binder, M. Hashem Pesaran, S. Hossein Samiei
Venue: Computational Economics (2000)

This paper considers the solution of nonlinear rational expectations models resulting from the optimality conditions of a finite-horizon intertemporal optimization problem satisfying Bellman's principle of optimality (and possibly involving inequality constraints). A backward recursive procedure is used to characterize and solve the time-varying optimal decision rules generally associated with these models. At each stage of these backward recursions, either an analytical or numerical solution of the optimality conditions is required. When an analytical solution is not possible, a minimum weighted residual approach is used. The solution technique is illustrated using a life-cycle model of consumption under labor income and interest rate uncertainties (and possibly involving liquidity constraints). Approximate numerical solutions are provided and compared with certainty-equivalent solutions and, when possible, with exact solutions.
Debugging via run-time type checking
Authors: Susan Horwitz
Venue: ACM SIGSOFT Software Engineering Notes (2000)

Java programmers have the security of knowing that errors like out-of-bounds array indexes or attempts to dereference a null pointer will be detected and reported at run time. C and C++ programmers count on tools like Purify to achieve a similar level of confidence. The run-time checks provided by Purify have proved to be extremely useful to programmers in debugging their programs.Java also provides security via its strong type system. For example: bull; There are no union types in Java, so it is not possible for a program to write into a field of one type and then access that value via a field of a different type. bull; Only very restricted kinds of casting are allowed; for example, it is not possible to treat a pointer as if it were an integer or vice versa. bull; When an object is down-cast to a subtype, a run-time check will be performed to ensure that the actual type of the object is consistent with the cast.However, tools like Purify do not provide similar checks for C/C++ programs. This research involves the design and implementation of a tool to provide new kinds of run-time checks based on type information. That is, the goal of the tool is to help C/C++ programmers find errors in their programs that manifest themselves as bad run-time types, in the same way that Purify helps programmers find errors in their programs that manifest themselves as bad run-time memory accesses.The basic idea is to associate a run-time type with every piece of data. Whenever data is used by some operation, a check is performed to ensure that its run-time type is consistent with the type expected by the operation. For example, when a pointer is dereferenced, its run-time type must be "pointer" (not "int", "float", "uninitialized", etc). When an integer multiplication is performed, the operands' run-time types must be "int" (not "pointer", "float", "uninitialized", etc).
A novel feedback scheme to increase throughput in multiple access radio systems
Authors: Richard O. LaMaire, Arvind Krishna
Venue: Wireless Networks (2000)

To enhance the throughput of a slotted ALOHA control channel in a radio communication system, we present and analyze a method for estimating the number of remote stations that are attempting to transmit to a central base station. Each of the contending remote stations randomly chooses to transmit with probability p. Our novel contribution is the use of information concerning the number of successful packet transmissions that arrive without retransmission &lpar;i.e., that are successfully received on their first transmission attempt&rpar;, as a metric for accurately and robustly estimating the number of contending remote stations. This estimate is determined at the base station and then used to compute the optimal transmission probability p that is used as feedback to the remote stations for their use. The proposed estimation method is analyzed and shown to provide good steady&dash;state performance for a variety of system models, including situations with noise and idling remote stations. The scheme is also shown to provide good tracking capabilities.
Efficient materialization and use of views in data warehouses
Authors: Márcio Farias de Souza, Marcus Costa Sampaio
Venue: ACM SIGMOD Record (1999)

Given the complexity of many queries over a Data Warehouse (DW), it is interesting to precompute and store in the DW the answer sets of some demanding operations, so called materialized views. In this paper, we present an algorithm, including its experimental evaluation, which allows the materialization of several views simultaneously without losing sight of processing costs for queries using these materialized views.
Technology Scaling Effects on Multipliers
Authors: Hesham A. Al-Twaijry, Michael J. Flynn
Venue: IEEE Transactions on Computers (1998)

Since integrated circuits were invented, fabrication engineers have been able to steadily decrease the dimensions of the devices (transistors). These reductions in the minimum feature sizes have resulted in improved performance. In addition, the dimensions of the interconnect used to connect the active transistors have also scaled. The decreasing dimensions of the physical devices causes the capacitance and resistances of the different parts of the multiplier to change. Therefore, the relative delay due to each part of the multiplier changes. In addition, the different encoding schemes used to generate the partial products and the different topologies used in the reduction of the partial products effect the total latency of the multiplier. This paper examines the effects of the smaller device dimensions on multipliers. It shows that the interconnect is becoming more important and that automatic generation of partial products provides the minimum latency for small feature sizes.
Trajectory Triangulation: 3D Reconstruction of Moving Points from a Monocular Image Sequence
Authors: Shai Avidan, Amnon Shashua
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

We consider the problem of reconstructing the 3D coordinates of a moving point seen from a monocular moving camera, i.e., to reconstruct moving objects from line-of-sight measurements only. The task is feasible only when some constraints are placed on the shape of the trajectory of the moving point. We coin the family of such tasks as ¿trajectory triangulation.¿ We investigate the solutions for points moving along a straight-line and along conic-section trajectories. We show that if the point is moving along a straight line, then the parameters of the line (and, hence, the 3D position of the point at each time instant) can be uniquely recovered, and by linear methods, from at least five views. For the case of conic-shaped trajectory, we show that generally nine views are sufficient for a unique reconstruction of the moving point and fewer views when the conic is of a known type (like a circle in 3D Euclidean space for which seven views are sufficient). The paradigm of trajectory triangulation, in general, pushes the envelope of processing dynamic scenes forward. Thus static scenes become a particular case of a more general task of reconstructing scenes rich with moving objects (where an object could be a single point).
A Tangent Algorithm for Computing the Generalized Singular Value Decomposition
Authors: Zlatko Drmac
Venue: SIAM Journal on Numerical Analysis (1998)

We present two new algorithms for floating-point computation of the generalized singular values of a real pair $(A,B)$ of full column rank matrices and for floating-point solution of the generalized eigenvalue problem $Hx=\lambda Mx$ with symmetric, positive definite matrices $H$ and $M$. The pair $(A,B)$ is replaced with an equivalent pair $(A',B')$, and the generalized singular values are computed as the singular values of the explicitly computed matrix $F=A' B'^{-1}$. The singular values of $F$ are computed using the Jacobi method. The relative accuracy of the computed singular value approximations does not depend on column scalings of $A$ and $B$; that is, the accuracy is nearly the same for all pairs $(AD_1,BD_2)$, with $D_1$, $D_2$ arbitrary diagonal, nonsingular matrices. Similarly, the pencil $H-\lambda M$ is replaced with an equivalent pencil $H'-\lambda M'$, and the eigenvalues of $H-\lambda M$ are computed as the squares of the singular values of $G=L_H L_M^{-1}$, where $L_H$, $L_M$ are the Cholesky factors of $H'$, $M'$, respectively, and the matrix $G$ is explicitly computed as the solution of a linear system of equations. For the computed approximation $\lambda+\delta\lambda$ of any exact eigenvalue $\lambda$, the relative error $|\delta\lambda|/\lambda$ is of order $p(n) {\mbox{\boldmath$\varepsilon$}} \max\{\min_{\Delta\in{\cal D}}\kappa_2(\Delta H\Delta), \min_{\Delta\in{\cal D}}\kappa_2(\Delta M\Delta)\}$, where $p(n)$ is a modestly growing polynomial of the dimension of the problem, {\mbox{\boldmath$\varepsilon$}} is the round-off unit of floating-point arithmetic, ${\cal D}$ denotes the set of diagonal nonsingular matrices, and $\kappa_2(\cdot)$ is the spectral condition number. Furthermore, floating-point computation corresponds to an exact computation with $H+\delta H$, $M+\delta M$, where, for all $i$, $j$, $|\delta H_{ij}|/\sqrt{H_{ii}H_{jj}}$ and $|\delta M_{ij}|/\sqrt{M_{ii}M_{jj}}$ are of order of {\mbox{\boldmath$\varepsilon$}} times a modest function of $n$.
Synthesis of Log-Domain Filters from First-Order Building Blocks
Authors: R. Timothy Edwards, Gert Cauwenberghs
Venue: Analog Integrated Circuits and Signal Processing (2000)

Log-domain filters are an important class of current-mode circuits having large-signal linearity and increased tuning range over voltage-mode filter circuits of similar complexity. In this paper we describe synthesis of a single-ended, first-order filter circuit from static and dynamic translinear circuit principles, and show how higher-order filters can be easily constructed from the first-order building block. We address additional issues related to low-frequency (audio-frequency) filter design and present results measured from test circuits and a complete 15-channel filterbank system fabricated in 2 &mu;m and 1.2 &mu;m BiCMOS processes.
Fast techniques for the optimal smoothing of stored video
Authors: Sanjay G. Rao, S. V. Raghavan
Venue: Multimedia Systems (1999)

Work-ahead smoothing is a technique whereby a server, transmitting stored compressed video to a client, utilizes client buffer space to reduce the rate variability of the transmitted stream. The technique requires the server to compute a schedule of transfer under the constraints that the client buffer neither overflows nor underflows. Recent work established an optimal off-line algorithm (which minimizes peak, variance and rate variability of the transmitted stream) under the assumptions of fixed client buffer size, known worst case network jitter, and strict playback of the client video. In this paper, we examine the practical considerations of heterogeneous and dynamically variable client buffer sizes, variable worst case network jitter estimates, and client interactivity. These conditions require on-line computation of the optimal transfer schedule. We focus on techniques for reducing on-line computation time. Specifically, (i) we present an algorithm for precomputing and storing the optimal schedules for all possible client buffer sizes in a compact manner; (ii) we show that it is theoretically possible to precompute and store compactly the optimal schedules for all possible estimates of worst case network jitter; (iii) in the context of playback resumption after client interactivity, we show convergence of the recomputed schedule with the original schedule, implying greatly reduced on-line computation time; and (iv) we propose and empirically evaluate an "approximation scheme" that produces a schedule close to optimal but takes much less computation time.
An IEEE 1149.1 Compliant Test Control Architecture
Authors: Debaditya Mukherjee, Melvin A. Breuer
Venue: Journal of Electronic Testing: Theory and Applications (1998)

This paper deals with a design methodology and associated architecture to support the control of on-chip DFT and BIST hardware. The work is general in that it supports numerous test methods, such as partial and full scan, multiple and reconfigurable scan chains, and both test per clock BIST and scan BIST. The results presented here are compatible with the IEEE 1149.1 boundary scan architecture. The work is based on a hierarchical control methodology that includes systems, PCBs and MCMs. Various options for assigning control functions to be on-chip or off-chip are described. A new, partially distributed test control architecture is introduced that includes an internal test bus and distributed local controllers. There are three main modes of control of test resources, namely local static control, dynamic control and global static control. We show how the control mechanism can be implemented together with the IEEE 1149.1 test protocol. The synthesis of the on-chip test control hardware has been automated in a system called CONSYST.
Heterogeneous modeling and simulation of embedded systems in El Greco
Authors: Joseph Buck, Radha Vaidyanathan
Venue: Proceedings of the eighth international workshop on Hardware/software codesign (2000)

This paper describes the functional specification and verification portions of El Greco, a system for high-level, heterogeneous functional specification, efficient compiled simulation, and software and hardware implementation. Specifications in the form of dataflow graphs, hierarchical finite state machines, or a mixture, are supported. These specifications can be arbitrarily nested, as in Ptolemy [1]. When dataflow graphs are placed in a control context, the graph execution is fully controllable; its execution can be restarted or suspended and parameters can be changed. We describe system modeling and simulation generation in El Greco and compare to other approaches.