ppxscal/embedding_network huggingface dataset:
Case study: parallelizing a sequential simulation model
Authors: Lokesh Bajaj, Rajive Bargrodia, Richard Meyer
Venue: Proceedings of the thirteenth workshop on Parallel and distributed simulation (1999)

Most successful examples of parallel simulation models were developed for parallel execution, from the beginning. A number of simulation models are designed only for sequential simulation, even in languages like PARSEC, that support both sequential and parallel simulation algorithms. Converting such simulation models to a form that yields good performance with a parallel implementation can be non-trivial. In this paper we describe a case study showing this conversion process for a simulation model of replicated file systems. The details of the major steps taken in converting the simulation into a parallel simulation are presented: correctness changes; performance changes such as communication topology simplification and lookahead specification; and modeling changes to eliminate performance bottlenecks. The details and performance improvements of each step are presented in this paper.
Performance Analysis of Maximum Likelihood Estimator for Recovery of Depth from Defocused Images and Optimal Selection ofCamera Parameters
Authors: A. N. Rajagopalan, S. Chaudhuri
Venue: International Journal of Computer Vision (1998)

The recovery of depth from defocused images involves calculating the depth of various points in a scene by modeling the effect that the focal parameters of the camera have on images acquired with a small depth of field. In the existing methods on depth from defocus (DFD), two defocused images of a scene are obtained by capturing the scene with different sets of camera parameters. Although the DFD technique is computationally simple, the accuracy is somewhat limited compared to the stereo algorithms. Further, an arbitrary selection of the camera settings can result in observed images whose relative blurring is insufficient to yield a good estimate of the depth. In this paper, we address the DFD problem as a maximum likelihood (ML) based blur identification problem. We carry out performance analysis of the ML estimator and study the effect of the degree of relative blurring on the accuracy of the estimate of the depth. We propose a criterion for optimal selection of camera parameters to obtain an improved estimate of the depth. The optimality criterion is based on the Cramer-Rao bound of the variance of the error in the estimate of blur. A number of simulations as well as experimental results on real images are presented to substantiate our claims.
Voltage dependent gate capacitance and its impact in estimating power and delay of CMOS digital circuits with low supply voltage (poster session)
Authors: Koichi Nose, Soo-Ik Chae, Takayasu Sakurai
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Gate capacitance has complex voltage dependency on terminal voltages but the impact of this voltage dependency of gate capacitance on power and delay has not been fully investigated, especially, in low-voltage, low-power designs. Introducing an effective gate capacitance, CG, effit is shown that the power and delay of CMOS digital circuit can be estimated accurately. CG, effis a strong function of VTH/VDDand VTH/VDDtends to increase in low-voltage region. Hence, the effective capacitance (relative to oxide capacitance, CG, eff, is decreasing in low-voltage low-power designs. Therefore, considering CG, effin accurate power and delay) estimation becomes more important in the future.
Noise-aware power optimization for on-chip interconnect
Authors: Ki-Wook Kim, Seong-Ook Jung, Unni Narayanan, C. L. Liu, Sung-Mo Kang
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Realization of high-performance domino logic depends strongly on energy-efficient and noise-tolerant interconnect design in ultra deep sub-micron processes. We characterize the cycle-averaged power model for interconnects accounting for switching statistics and dynamic behaviors. For the sake of signal integrity, cross-coupling effects are also characterized which reflect logical correlation between adjacent wires. Based on the new models for interconnect power and capacitive crosstalk, we optimize the coupling power consumed by interconnects with crosstalk constraints. Experimental results show that optimized designs save the power consumption significantly.
Extended design reuse trade-offs in hardware-software architecture mapping
Authors: F. Vermeulen, F. Catthoor, D. Verkest, H. De Man
Venue: Proceedings of the eighth international workshop on Hardware/software codesign (2000)

In the design of embedded systems-on-chip, the success of a product generation depends on the flexibility to accommodate future design changes. This requirement influences the hardware-software partitioning strategy Therefore we propose a novel hardware-software architecture and mapping methodology, which provide new trade-off opportunities for cost-effective component reuse.
Sequential abstract-state machines capture sequential algorithms
Authors: Yuri Gurevich
Venue: ACM Transactions on Computational Logic (TOCL) (2000)

We examine sequential algorithms and formulate a sequential-time postulate, an abstract-state postulate, and a bounded-exploration postulate . Analysis of the postulates leads us to the notion of sequential abstract-state machine and to the theorem in the title. First we treat sequential algorithms that are deterministic and noninteractive. Then we consider sequential algorithms that may be nondeterministic and that may interact with their environments.
Token-Templates and Logic Programs for Intelligent Web Search
Authors: Bernd Thomas
Venue: Journal of Intelligent Information Systems (2000)

We present a general framework for the information extraction from web pages based on a special wrapper language, called token-templates. By using token-templates in conjunction with logic programs we are able to reason about web page contents, search and collect facts and derive new facts from various web pages. We give a formal definition for the semantics of logic programs extended by token-templates and define a general answer-complete calculus for these extended programs. These methods and techniques are used to build intelligent mediators and web information systems.
Dynamic Domain Decomposition in Approximate and Exact Boundary Control in Problems of Transmission for Wave Equations
Authors: J. E. Lagnese, G. Leugering
Venue: SIAM Journal on Control and Optimization (2000)

This paper is concerned with dynamic domain decomposition for optimal boundary control and for approximate and exact boundary controllability of wave propagation in heterogeneous media. We consider a cost functional which penalizes the deviation of the final state of the solution of the global problem from a specified target state. For any fixed value of the penalty parameter, optimality conditions are derived for both the global optimal control problem and for local optimal control problems obtained by a domain decomposition and a saddle-point--type iteration. Convergence of the iterations to the solution of the global optimality system is established. We then pass to the limit in the iterations as the penalty parameter increases without bound and show that the limiting local iterations converge to the solution of the optimality system associated with the problem of finding the minimum norm control that drives the solution of the global problem to a specified target state.
Roadmap for successful information technology transfer for small businesses
Authors: Mike Chesher, Walter Skok
Venue: Proceedings of the 2000 ACM SIGCPR conference on Computer personnel research (2000)

It is recognised that information and communications technologies (ICT) have the potential to radically transform company operations [4], particularly when the company belongs to the set of small/medium enterprises (SMEs) [9]. However, one of the major obstacles in effecting a successful transformation is the lack of knowledge, on the part of SME management and staff, regarding the best way to undertake the transformation. This knowledge is becoming harder to acquire, particularly in the fast moving electronic commerce sector [4], [7], [8], [10]. This paper is concerned with how SMEs in the United Kingdom can acquire the knowledge to make use of Internet technology. It reviews a number of national and local initiatives, both private and government sponsored that are currently in place to assist SMEs in making best use of the Internet. The paper demonstrates that new opportunities are becoming available for small businesses to develop important new IT-based applications that make use of lnternet technologies. Furthermore, by adopting open Internet technologies that are increasingly becoming the business norm, SMEs are able to 'future proof' themselves against obsolescence and 'throw away' development. The authors conclude by proposing a roadmap that an SME could follow when planning and managing such major programmes.
Descents, Quasi-Symmetric Functions, Robinson-Schensted for Posets, and the Chromatic Symmetric Function
Authors: Timothy Y. Chow
Venue: Journal of Algebraic Combinatorics: An International Journal (1999)

We investigate an apparent hodgepodge of topics: a Robinson-Schensted algorithm for (3 + 1)-free posets, Chung and Graham&lsquo;s G-descent expansion of the chromatic polynomial, a quasi-symmetric expansion of the path-cycle symmetric function, and an expansion of Stanley&lsquo;s chromatic symmetric function X_G in terms of a new symmetric function basis. We show how the theory of P-partitions (in particular, Stanley&lsquo;s quasi-symmetric function expansion of the chromatic symmetric function X_G) unifies them all, subsuming two old results and implying two new ones. Perhaps our most interesting result relates to the still-open problem of finding a Robinson-Schensted algorithm for (3 + 1)-free posets. (Magid has announced a solution but it appears to be incorrect.) We show that such an algorithm ought to &ldquo;respect descents,&rdquo; and that the best partial algorithm so far&mdash;due to Sundquist, Wagner, and West&mdash;respects descents if it avoids a certain induced subposet.
Front-Tracking Finite Difference Methods for the Valuation of American Options
Authors: K. N. Pantazopoulos, E. N. Houstis, S. Kortesis
Venue: Computational Economics (1998)

This paper is concerned with the numerical solution of the American option valuation problem formulated as a parabolic free boundary/initial value model. We introduce and analyze a front-tracking finite difference method and compare it with other commonly used techniques. The numerical experiments performed indicate that the front-tracking method considered is an efficient alternative for approximating simultaneously the option value and free boundary functions associated with the valuation problem.
Preconditioning of Indefinite and Almost Singular Finite Element Elliptic Equations
Authors: Maya G. Neytcheva, Panayot S. Vassilevski
Venue: SIAM Journal on Scientific Computing (1998)

This paper deals with two ways of solving discretized finite element elliptic equations with indefinite and almost singular matrices. Such problems typically arise when applying the shifted inverse power iteration (SIPI) method to the generalized eigenvalue problem $A{\bf u}=\lambda\,B{\bf u}$ where A is defined from some discretized equation by a finite element self-adjoint coercive second-order elliptic operator and B is a mass-matrix operator. Both methods explore two-by-two block partitioning of the given matrices. One of the main matrix blocks corresponds to a coarse space (or, equivalently, to coarse-grid degrees of freedom) and contains the main singularity of the original problem. The other major block, possibly indefinite, is not as close to singular as the original matrix and is inverted by a preconditioned minimal residual (MINRES) method in the first method. The second method, which we use for comparison, exploits preconditioned MINRES iterations for the reduced problem obtained by eliminating the block unknowns that correspond to the coarse discretization space. Here each iteration involves solving a coarse-grid problem. Numerical examples are presented that demonstrate the various aspects of both approaches for solving generalized eigenvalue problems applied to second-order finite element elliptic equations.
Building database-driven electronic catalogs
Authors: Sherif Danish
Venue: ACM SIGMOD Record (1998)

This paper describes issues and solutions related to the creation of a product information database in the enterprise, and using this database as a foundation for deploying an electronic catalog. Today, product information is typically managed in document composition systems and communicated on paper. In the new wired world, these processes are undertaking fundamental changes to cope with the time to market pressure and the need for accurate, complete, and structured presentation of product information. Electronic catalogs are the answer.
Is your degree quality endorsed?
Authors: Isaac Balbin
Venue: ACM SIGCSE Bulletin (1999)

Defining what we mean by a quality degree is a difficult enough undertaking. Having to demonstrate that a degree program is adhering to this definition is at least as challenging. Academics already "know" that they are doing a good job with the teaching and learning aspects of their courses and so any suggestion that the processes involved need monitoring and auditing commonly meet with a combination of disdain, calls of "time-wasting" and "meddling" and general derision. At the same time, there is increasing pressure on Universities around the world to not only be accountable for the quality of their products but to also demonstrate that processes that reflect the efforts to achieve quality be visible and in place.In this paper we describe a new web-based database system which has been developed to monitor and track aspects of the quality of our degree offerings. Particular attention has been paid to ensuring that the important facets which define or demonstrate quality are both highlighted and managed easily.
A Note on Relative Perturbation Bounds
Authors: Tristan Londré, Noah H. Rhee
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

In this paper we provide an actual bound for the distance between the original and the perturbed right singular vector subspaces of a general matrix with full column rank. We also provide actual relative componentwise bounds for perturbed eigenvectors of a positive definite matrix.
Solving Index-1 DAEs in MATLAB and Simulink
Authors: Lawrence F. Shampine, Mark W. Reichelt, Jacek A. Kierzenka
Venue: SIAM Review (1999)

This paper describes mathematical and software developments needed for the effective solution of differential algebraic equations of index 1 in the integrated computing environment MATLAB and the dynamic simulation package Simulink. The developments are applicable to other problem-solving environments and some are applicable to general scientific computation.
On Improvements to the Analytic Center Cutting Plane Method
Authors: O. Du Merle, J.-L. Goffin, J.-P. Vial
Venue: Computational Optimization and Applications (1998)

In this paper, we explore a weakness of a specific implementation of the analytic center cutting plane method applied to convex optimization problems, which may lead to weaker results than Kelley&lsquo;s cutting plane method. Improvements to the analytic center cutting plane method are suggested, and tested on some example problems.
Fast Iterative Methods for Fractal Image Compression
Authors: Raouf Hamzaoui
Venue: Journal of Mathematical Imaging and Vision (1999)

In fractal image compression, a digital image is approximated by the unique fixed point of a contractive affine mapping. The decoding consists of iterating the affine mapping starting from an arbitrary image until convergence to the fixed point. We show that the decoding can be accelerated by using the new pixel intensities of an image iterate as soon as they become available. We provide a mathematical formulation of the proposed decoding and prove its convergence in a general setting. We show that under some mild restrictions the asymptotic rate of convergence of the proposed method is greater than or equal to that of the conventional method. We also discuss the use of standard iterative methods for the decoding. Finally, we show that the convergence of the proposed method can be enhanced by an ordering technique.
Counting methods for cyclic relations
Authors: Ramsey W. Haddad, Jeffrey F. Naughton
Venue: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1988)

In this paper we consider selections of the form &ldquo;column = constant&rdquo; on relations defined by linear recursive, two rule datalog programs. In general, counting methods perform well on such queries. However, counting methods fail in the presence of cycles in the database. We present an algorithm in the spirit of counting methods that correctly deals with cyclic data and has the same asymptotic running time as counting methods. The algorithm, which is based on reducing a query on a database to a question about intersections of semi-linear sets, works by using efficient methods to construct the appropriate semi-linear sets from the database and query constant.
TCP splice application layer proxy performance
Authors: David A. Maltz, Pravin Bhagwat
Venue: Journal of High Speed Networks (2000)

Application layer proxies already play an important role in todays networks, serving as firewalls and HTTP caches - and their role is being expanded to include encryption, compression, and mobility support services. Current application layer proxies suffer major performance penalties as they spend most of their time moving data back and forth between connections semi; context switching and crossing protection boundaries for each chunk of data they handle. We present a technique called TCP Splice that provides kernel support for data relaying operations which runs at near router speeds. In our lab testing, we find SOCKS firewalls using TCP Splice can sustain a data throughput twice that of normal firewalls, with an average packet forwarding latency 30 times less.
A Note on P1- and Lipschitzian Matrices
Authors: G. S. R. Murthy, S. K. Neogy, F. Thuijsman
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

The linear complementarity problem (q, A) with data $A \in R^{n \times n}$ and $q \in R^n$ involves finding a nonnegative $z \in R^n$ such that $Az + q \geq 0$ and $z^t(Az + q) = 0$. Cottle and Stone introduced the class of P1-matrices and showed that if A is in P1\Q, then K(A) (the set of all q for which (q, A) has a solution) is a half-space and (q, A) has a unique solution for every q in the interior of K(A). Extending the results of Murthy, Parthasarathy, and Sriparna [ Ann. Dynamic Games, to appear], we present a number of equivalent characterizations of P1\Q. Also, we present yet another characterization of P-matrices. This widens the range of matrix classes for which a conjecture raised by Murthy, Parthasarathy, and Sriparna [SIAM J. Matrix Anal. Appl., 19 (1998), pp. 898--905] characterizing the class of Lipschitzian matrices is true.
Some APL defined functions for fast analysis of innovations in food science and human nutrition
Authors: B. Makeev, A. Zoueva
Venue: ACM SIGAPL APL Quote Quad (1999)

This paper describes the methods of using the Expert System "Forecaster" for information intelligence, information support of managers' decisions and fast analysis of innovations.
Learned Models for Estimation of Rigid and ArticulatedHuman Motion from Stationary or Moving Camera
Authors: Yaser Yacoob, Larry S. Davis
Venue: International Journal of Computer Vision (2000)

We propose an approach for modeling, measurement and tracking of rigid and articulated motion as viewed from a stationary or moving camera. We first propose an approach for learning temporal-flow models from exemplar image sequences. The temporal-flow models are represented as a set of orthogonal temporal-flow bases that are learned using principal component analysis of instantaneous flow measurements. Spatial constraints on the temporal-flow are then incorporated to model the movement of regions of rigid or articulated objects. These spatio-temporal flow models are subsequently used as the basis for simultaneous measurement and tracking of brightness motion in image sequences. Then we address the problem of estimating composite independent object and camera image motions. We employ the spatio-temporal flow models learned through observing typical movements of the object from a stationary camera to decompose image motion into independent object and camera motions. The performance of the algorithms is demonstrated on several long image sequences of rigid and articulated bodies in motion.
Distributed Print on Demand Systems in the Xpect Framework
Authors: Jean-Marc Andreoli, François Pacull
Venue: Distributed and Parallel Databases (1999)

The Internet is an extremely rich source of online information and services. However, complex client requests, involving and combining several types of services, are difficult to handle without some form of support. This is particularly true in the case of electronic commerce, where complex transactions may involve several independent good providers, bankers, delivery services, etc. Hence the need for &ldquo;brokering&rdquo; services, whose offers combine in the best possible way offers coming from existing, specialized services publicly available on the Net, in order to match customers&lsquo; constraints. The Xpect framework for electronic commerce has been developed for that purpose. In this paper, we illustrate it through a case study in the context of distributed print-on-demand. We propose an architecture and implementation of the case study based on CLF, a distributed application development tool relying on a rich object model and its corresponding coordination scripting facility.
The reader's helper: a personalized document reading environment
Authors: Jamey Graham
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Over the last two centuries, reading styles have shifted away from the reading of documents from beginning to end and toward the skimming of documents in search of relevant information. This trend continues today where readers, often confronted with an insurmountable amount of text, seek more efficient methods of extracting relevant information from documents. In this paper, a new document reading environment is introduced called the Readers HelperTM, which supports the reading of electronic and paper documents. The Readers Helper analyzes documents and produces a relevance score for each of the readers topics of interest, thereby helping the reader decide whether the document is actually worth skimming or reading. Moreover, during the analysis process, topic of interest phrases are automatically annotated to help the reader quickly locate relevant information. A new information visualization tool, called the ThumbarTM, is used in conjunction with relevancy scoring and automatic annotation to portray a continuous, dynamic thumb-nail representation of the document. This further supports rapid navigation of the text.