ppxscal/embedding_network huggingface dataset:
Zero-Phase Filter Bank and Wavelet Code r Matrices: Properties, Triangular Decompositions, and a Fast Algorithm
Authors: T. G. Marshall
Venue: Multidimensional Systems and Signal Processing (1997)

The class of digital filter banks (DFB&lsquo;s) and wavelets composed of zero-phase filters is particularly useful for image processing because of the desirable filter responses and the possibility of using the McClellan transformation for two-dimensional design. In this paper unimodular polyphase matrices with the identity matrix for Smith canonical form are introduced, and then decomposed to a product of unit upper and lower triangular or block-triangular matrices which define ladder structures. A fundamental approach to obtaining suitable unimodular matrices for one and two dimensions is to focus on the shift (translation) operators, as is done in the harmonic analysis discipline. Several matrix shift operators of different dimensions are introduced and their properties and applications are presented, most notable of which is that the McClellan transformation can be effected by a simple substitution of a 2\times 2 circulant matrix for the polynomial variable, w = (z + z^{-1})/2. Unimodular matrix groups and pertinent subgroups are identified, and these are observed to be subgroups of the special linear group over polynomials,SL(k[w]) . A class of coiflet-like wavelets containing the well-known wavelet, based on the Burt and Adelson filter, is decomposed by these methods and is seen to require only 3/2 multiplications/sample if a scaling property, introduced herein, is satisfied. Making use of certain paraunitary wavelets, coiflets, that are closely comparable to the zero-phase wavelets of this class, it is seen that, in these cases, the zero-phase ladder algorithm is twice as fast as the paraunitary lattice algorithm.
Taming effects with monadic typing
Authors: Richard B. Kieburtz
Venue: Proceedings of the third ACM SIGPLAN international conference on Functional programming (1998)

The familiar Hindley-Milner type system of the ML language family is extended with monad annotations to account for possible side effects of expression evaluation. This also allows effects to be effectively encapsulated by lexical scopes Gamma; with enforcement provided by type checking. A type-and-effects analysis supports type inference. Type soundness and completeness theorems establish the coherence of monadic type inference with the reference semantics of a small ML-style language.
Lessons from Wall Street: case studies in configuration, tuning, and distribution
Authors: Dennis Shasha
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

Consider a setting in which Database speed and reliability can make the difference between prosperity and ruin. Money for information systems is no object. Data must be accessible from many points on the globe with subsecond response. The financial industry is exactly such an environment. This tutorial presents case studies in configuration, tuning, and distribution drawn from financial applications. The cases suggest both research and product issues and so should be of interest to the entire Sigmod community.
Programming combined discrete-continuous simulation models for performance
Authors: J. Frederick Klingener
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Continuous state variables in combined discrete-continuous simulation models (combined models) commonly represent physical quantities, such as fluid levels or temperatures, that are governed by physical laws, and these laws are expressed as differential equations of state. The combined simulation modeling program commonly integrates the differential equations numerically, in step with its computations that describe the evolution of the discrete events. In addition to the pitfalls familiar to numerical integration, special hazards due to the interacting discrete events may confront the analyst seeking high performance in a complex model. This paper first discusses, in the context of discrete event modeling packages, some requirements for obtaining accuracy and speed in the numerical integration of the continuous variables in combined models, and second, it describes approaches that can be used to meet those requirements in selected commercial modeling packages.
STARBIST: scan autocorrelated random pattern generation
Authors: K. H. Tsai, S. Hellebrand, J. Rajski, M. Marek-Sadowska
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

This paper presents a new scan-based BIST schemewhich achieves very high fault coverage without the deficienciesof previously proposed schemes. This approach utilizes scan orderand polarity in scan synthesis, effectively converting the scanchain into a ROM capable of storing some "center" patterns fromwhich the other vectors are derived by randomly complementingsome of their coordinates. Experimental results demonstrate that avery high fault coverage can be obtained without any modificationof the mission logic, no test data to store and very simple BISThardware which does not depend on the size of the circuit.
Linear Steiner Trees for Infinite Spirals
Authors: J. F. Weng
Venue: SIAM Journal on Discrete Mathematics (1997)

A full Steiner tree T for a given set of points P is defined to be linear if all Steiner points lie on one path called the trunk of T. A (nonfull) Steiner tree is linear if it is a degeneracy of a full linear Steiner tree. Suppose P is a simple polygonal line. Roughly speaking, T is similar to P if its trunk turns to the left or right when P does. P is a left-turn (or right-turn) polygonal spiral if it always turns to the left (or right) at its vertices. P is an infinite spiral if n tends to infinity. In this paper we first prove some results on nonminimal paths and the decomposition of Steiner minimal trees, and then, based on these results, we study the case in which an infinite spiral P has a Steiner minimal tree that is linear and similar to P itself.
A behavioral signal path modeling methodology for qualitative insight in and efficient sizing of CMOS opamps
Authors: Francky Leyn, Walter Daems, Georges Gielen, Willy Sansen
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

This paper describes a new modeling methodology that allows to derive systematically behavioral signal path models of operational amplifiers. Combined with symbolic simulation, these models provide high qualitative insight in the small-signal functioning of a circuit. The behavioral signal path model provides compact interpretable expressions for the poles and zeros that constitute the signal path. These expressions show which design parameters have dominant influence on the position of a pole/zero and thus enable a designer to control a manual interactive sizing process. The methodology consists of the application of a sequence of abstractions, so that one gradually progresses from a full device to a full behavior circuit representation. During this translation, qualitative insight and design requirements are obtained. The methodology is implemented in an open tool called \EFtoef. The behavioral signal path model is also used for optimization based sizing in order to achieve pole placement in an efficient way. For optimization based sizing, a new strategy for hierarchical penalty function composition is proposed, which allows sequential pruning of the design space. Combined with an operating point driven \DC formulation and local minimax optimization, a fast sizing method is obtained which can be used for interactive design space exploration. Experimental results of both modeling and sizing are shown.
A new approach for partitioning VLSI circuits on transistor level
Authors: Norbert Fröhlich, Rolf Schlagenhaft, Josef Fleischmann
Venue: ACM SIGSIM Simulation Digest (1997)

For parallel simulation of VLSI circuits on transistor level a sophisticated partitioning of the circuits into subcircuits is crucial. Each net connecting the subcircuits causes additional communication and computation effort. As the slave processors simulating the subcircuits advance synchronously in time, the computation effort for each subcircuit should be approximately the same. In this paper a new approach for partitioning VLSI circuits on transistor level yielding a low number of interconnects between the subcircuits and balanced subcircuit sizes is presented. Simulation of industrial circuits using this partitioning is up to 41% faster than with other known partitioning approaches for parallel analog simulation.
Averaging Theorems for Highly Oscillatory Differential Equations and Iterated Lie Brackets
Authors: Wensheng Liu
Venue: SIAM Journal on Control and Optimization (1997)

Using averaging techniques and developing proper algebraic formalisms, we study the limiting process of ordinary differential equations with highly oscillatory right-hand sides. We give sufficient conditions, generalizing earlier work by Kurzweil and Jarnik, for a sequence $\{u^j=(u_1^j,\ldots,u_m^j)\}\subseteq L^1([0,T], {\Bbb R}^m)$ to be such that, for every choice of smooth vector fields $f_k,k=1,\ldots,m$, on a smooth manifold, the trajectories of $\dot x=\sum_{k=1}^mu_k^j(t)f_k(x)$ converge to the trajectories of an ``extended system'' $\dot x=\sum_{k=1}^{r}v_k(t)f_k(x)$, where the new directions $f_{m+1},\ldots,f_{r}$ are Lie brackets of $f_{1},\ldots,f_{m}$.
Interactive control of the model: a natural companion to animated simulation graphics
Authors: Andrew R. Gilman
Venue: Proceedings of the 17th conference on Winter simulation (1985)

Many recent publications have lauded the value of an animated graphical representation of a simulation model as a boon to communicating model results to decision makers. Recent commercial product developments reflect the importance the simulation community places on graphical representations. This paper suggests that the use of animated graphics is a step in the right direction but leads naturally to another step: interactive control of the model. It is now generally recognized that a decision maker is more comfortable with recommendations based on a simulation model that he has &ldquo;seen&rdquo;. The natural tendency for a manager who sees the manifestation of a problem (e.g. an overflowing WIP buffer) in a simulation animation is to immediately respond &ldquo;what if we &hellip;&rdquo; If the model provides immediate access to his suggested change through interactive facilities, then the flow of ideas from the decision maker is greatly enhanced. The decision maker begins to get a feel for the system's responses. This does not replace the need to perform more controlled experiments to determine long run tendencies of the model. That is a task different from acquiring the confidence of the decision maker. Another benefit of interactive models is explored in this paper. There are times that we would like the manager's input to the model for the model's sake rather than the manager's sake. Many models contain some element of human decision making. The decision function is typically simplified into a series of logical conditions for the sake of coding. An interactive model provides a means for the computer and human to work together to achieve a more realistic model. Rather than going through the trouble of simplifying and coding human decision making, let the real decision maker provide the decision through interactive facilities when the model requires a decision. Let the human do what it does best, and let the computer do what it does best, i.e. repeatedly process the systematic rules of the model. There are several advantages to models that can provide an animated graphical representation of the system being modeled. The modeler often benefits; more important though, the decision making process benefits. The purpose of this paper, however, is not to report claims about graphics and animation. Its purpose is to demonstrate that animated graphics, combined with interactive control of model characteristics, bring benefits that are greater than the sum of these two features considered separately. In particular, this paper will challenge the traditions of batch type models with two valuable uses for interactive model control. The first focuses on the needs of the decision maker whom the modeler seeks to help. The second exploits interactive capabilities as a means to a more realistic, as well as simpler, model.
Regularization of Linear Descriptor Systems with Variable Coefficients
Authors: Ralph Byers, Peter Kunkel, Volker Mehrmann
Venue: SIAM Journal on Control and Optimization (1997)

We study linear descriptor control systems with rectangular variable coefficient matrices. We introduce condensed forms for such systems under equivalence transformations and use these forms to detect whether the system can be transformed to a uniquely solvable closed loop system via state or derivative feedback. We show that under some mild assumptions every such system consists of an underlying square subsystem that behaves essentially like a standard state space system, plus some solution components that are constrained to be zero.
A Theory of Fault-Tolerant Routing in Wormhole Networks
Authors: José Duato
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

Fault-tolerant systems aim at providing continuous operation in the presence of faults. Multicomputers rely on an interconnection network between processors to support the message-passing mechanism. Therefore, the reliability of the interconnection network is very important for the reliability of the whole system.This paper analyzes the effective redundancy available in a wormhole network by combining connectivity and deadlock freedom. Redundancy is defined at the channel level. We propose a sufficient condition for channel redundancy, also computing the set of redundant channels. The redundancy level of the network is also defined, proposing a theorem that supplies its value. This theory is developed on top of our necessary and sufficient condition for deadlock-free adaptive routing. The new theory also considers the failure of physical channels when virtual channels are used. Finally, we propose a methodology for the design of fault-tolerant routing algorithms, showing its application to n-dimensional meshes.
On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds
Authors: A. R. Conn, N. Gould, Ph. L. Toint
Venue: Computational Optimization and Applications (1997)

This paper considers the number of inner iterations required per outer iteration for the algorithm proposed by Conn et al. [9]. We show that asymptotically, under suitable reasonable assumptions, a single inner iteration suffices.
Multivariate input modeling with Johnson distributions
Authors: Paul M. Stanfield, James R. Wilson, Gary A. Mirka, Naomi F. Glasscock, Jennie P. Psihogios, Joseph R. Davis
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper introduces a new method for multivariate simulation input modeling based on the Johnson translation system of probability distributions. This technique matches the first four marginal moments and the correlation structure of a given set of sample data, allowing computationally efficient parameter estimation and random-vector generation. Applications of the technique in ergonomics and production scheduling are discussed. The proposed method is compared to traditional multivariate input-modeling techniques based on the Johnson translation system.
A codesign experiment in acoustic echo cancellation: GMDFα
Authors: L. Freund, M. Israel, F. Rousseau, J. M. Bergé, M. Auguin, C. Belleudy, G. Gogniat
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (1997)

Continuous advances in processor and ASIC technologies enable the integration of more and more complex embedded systems. Embedded systems have become commonplace in recent years. Since their implementations generally require the use of heterogeneous resources (e.g., processor cores, ASICs) in one system with hard design constraints, the importance of hardware/software codesign methodologies increases steadily. HW/SW codesign approaches consist generally of HW/SW partitioning and scheduling, constrained code generation, and hardware and interface synthesis. This article presents the codesign of an industrial experiment in acoustic echo cancellation (GMDF&agr; algorithm); and emphasizes the partitioning and communication synthesis steps. This experiment brings to light interesting problems such as data and program distribution between system memories and the modeling of communications in the partitioning process
Finding Even Cycles Even Faster
Authors: Raphael Yuster, Uri Zwick
Venue: SIAM Journal on Discrete Mathematics (1997)

We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every $k \geq 2$, there is an $O(V^2)$ time algorithm that decides whether an undirected graph $G=(V,E)$ contains a simple cycle of length $2k$, and finds one if it does. (ii) There is an $O(V^2)$ time algorithm that finds a shortest even cycle in an undirected graph $G=(V,E)$.
Computing Least Area Hypersurfaces Spanning Arbitrary Boundaries
Authors: Harold R. Parks, Jon T. Pitts
Venue: SIAM Journal on Scientific Computing (1997)

The numerical least area problem for oriented hypersurfaces seeks algorithms which approximate area-minimizing hypersurfaces spanning a given boundary in Euclidean n-dimensional space. A mathematical model and numerical implementation are presented for finding the solution to the general least area problem for oriented surfaces in Euclidean three-dimensional space. (The mathematical model is valid for hypersurfaces of arbitrary Euclidean n-dimensional spaces.) There are no a priori restrictions on either the topological complexity of the given boundary or the topological type of the surfaces considered. As an example which illustrates the power of the method, the algorithm is applied to a boundary consisting of a pair of square-shaped linked curves. The resulting numerical surface is compared with an actual physical area-minimizing spanning surface (soap film).
Longitudinal Studies to Determine the Effect of Body Fat Rate Reduction on Blood Pressure
Authors: Takashi Wada, Yoshio Ikeda
Venue: Journal of Medical Systems (1998)

Body constitution is estimated by weight as a quantity index and percent body fat (%BF) as a quality index. Obesity is one of the risk factors in hypertension. High blood pressure drops by body weight reduction. The relationship between %BF change and blood pressure change during 1 year, and whether blood pressure changed in subjects whose %BF decreased without body weight reduction, were investigated. %BF was measured with bioelectrical impedance analysis. The changes of body weight, %BF and blood pressure in the decreased %BF group that decreased more than 2 points of %BF, and in the no body weight change group which body weight had not changed in the decreased %BF group, were studied. In the decreased %BF group, average blood pressures fell significantly from 149/92 to 141/86 mm Hg in the subjects in hypertensive state at baseline. In the no weight change group, average blood pressures also fell significantly from 151/93 to 140/87 mm Hg. Even if the body weight had not changed, blood pressure had decreased significantly when %BF had decreased significantly.
RED-VBR: a renegotiation-based approach to support delay-sensitive VBR video
Authors: Hui Zhang, Edward W. Knightly
Venue: Multimedia Systems (1997)

Previous approaches to supporting video on packet-switched networks include deterministic service, statistical service, predicted service, and feedback-based schemes. These schemes represent different tradeoffs in quality of service (QOS), achievable network utilization, and method of dealing with overload. In this paper, we propose a new service called REnegotiated Deterministic Variable Bit Rate Service (RED-VBR) that attempts to strike an efficient balance with the above tradeoffs. The approach is based on deterministic guarantees with client-controlled renegotiation of traffic and QOS parameters and graceful adaptation during overload periods. We introduce a connection admission control algorithm for RED-VBR which bounds the renegotiation failure probability. We evaluate the scheme using two traces of MPEG-compressed video and show that, even with simple renegotiation polices and relatively low renegotiation frequencies, high network utilization in the range of 50-80% can be achieved. For traffic that is bursty over long intervals, this represents a 100-150% improvement in network utilization compared to deterministic service. Compared to statistical and predicted service, our approach allows more graceful and client-controlled QOS degradation during overload periods.
Perspectives on program analysis
Authors: Flemming Nielson
Venue: ACM SIGPLAN Notices (1997)

To guide the research efforts in the area of program analysis it is necessary to provide a taxonomy of the various approaches (identifying strengths and weaknesses), and to explore the links to programming languages and theoretical computer science.
Developing Java beans
Authors: Robert Englander
Venue:  (1997)

Developing Java Beans is a complete introduction to Java's component architecture. It describes how to write Beans, which are software components that can be used in visual programming environments. This book discusses event adapters, serialization, introspection, property editors, and customizers, and shows how to use Beans within ActiveX controls.
Five simple principle of modelling
Authors: Mike Pidd
Venue: Proceedings of the 28th conference on Winter simulation (1996)

As discrete simulation software gets easier to use it is tempting to assume that modelling also gets easier, unfortunately this is not the case. This paper suggests some simple principles of modelling that can be easily applied in discrete simulation, whether the model is implemented in a visual interactive modelling system or in a programming language. The modelling principles are used to suggest desirable features that might be included in simulation software.
Determining the Epipolar Geometry and its Uncertainty: A Review
Authors: Zhengyou Zhang
Venue: International Journal of Computer Vision (1998)

Two images of a single scene/object are related by the epipolar geometry, which can be described by a 3&times;3 singular matrix called the essential matrix if images&lsquo; internal parameters are known, or the fundamental matrix otherwise. It captures all geometric information contained in two images, and its determination is very important in many applications such as scene modeling and vehicle navigation. This paper gives an introduction to the epipolar geometry, and provides a complete review of the current techniques for estimating the fundamental matrix and its uncertainty. A well-founded measure is proposed to compare these techniques. Projective reconstruction is also reviewed. The software which we have developed for this review is available on the Internet.