ppxscal/embedding_network huggingface dataset:
Simulation of Hardware Support for OpenGL Graphics Architecture
Authors: Timour Paltashev, Gheni Abla, Navin Govind
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The growing number of applications for 3D graphics and imaging systems in the mass market requires the customized approach to the design of high-performance 3D graphics & imaging system architectures. That fact coupled with the strong trends to industrial standardization of graphics API, such as OpenGL, leads to enhanced portability for imaging and graphics applications. The progress on the hardware support of API functionality gives a real possibility to use a top-down approach in the design of custom graphics/imaging systems based on the mixed hardware/software implementation of OpenGL architecture.Software simulation is relatively cheap and fast way for initial graphics architecture template development and evaluation to acquire the structure and parameters that can be used later for HDL elaboration and simulation. This paper discusses a 3D graphics & imaging system architecture model implementation based on OpenGL API hardware support simulation. The object-oriented approach has been used for this development of analytic and software models simulating hardware units on different stages of graphics pipeline. The Interactive Imaging System Architecture Composer has been developed in this project for fast run-time simulation management, data acquisition and interpretation. The expandable set of architecture templates uses a reconfigurable-shared library of ¿Virtual Hardware Units¿ simulating the different hardware structures for graphics & image processing.
Hybrid fuzzy-linear programming approach for multi criteria decision making problems
Authors: Sonja Petrovic-Lazarevic, Ajith Abraham
Venue: Neural, Parallel Scientific Computations (2003)

The purpose of this paper is to point to the usefulness of applying a linear mathematical formulation of fuzzy multiple criteria objective decision methods in organising business activities. In this respect fuzzy parameters of linear programming are modelled by preference-based membership functions. This paper begins with an introduction and some related research followed by some fundamentals of fuzzy set theory and technical concepts of fuzzy multiple objective decision models. Further a real case study of a manufacturing plant and the implementation of the proposed technique is presented. Empirical results clearly show the superiority of the fuzzy technique in optimising individual objective functions when compared to non-fuzzy approach. Furthermore, for the problem considered, the optimal solution helps to infer that by incorporating fuzziness in a linear programming model either in constraints, or both in objective functions and constraints, provides a similar (or even better) level of satisfaction for obtained results compared to non-fuzzy linear programming.
Networks-On-Chip: The Quest for On-Chip Fault-Tolerant Communication
Authors: Radu Marculescu
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

In this paper, we discuss the possibility of achieving on-chip fault-tolerant communication based on a newcommunication paradigm called stochasticcommunication.Specifically, for a generic tile-basedarchitecture, we present a randomized algorithm whichnot only separates computation from communication, butalso provides the required fault-tolerance to on-chipfailures.This new technique is easy and cheap toimplement in SoCs that integrate a large number ofcommunicating IP cores.
Steady-State Computations of Granular Flow in an Axisymmetric Hopper
Authors: Feng Wang, L C Gardner, G D Schaeffer
Venue:  (1991)

\indent Axisymmetric steady-state computations of plastic incompressible granular flow in a converging hopper are presented. The granular flow equations are solved as a first-order system of conservation laws plus a set of constitutive relations, using a conservative finite difference method. Newton''s method is used to solve the nonlinear PDEs. The steady-state granular flow equations may change type from elliptic to hyperbolic. In this investigation, we choose flow parameters and boundary conditions to insure that the PDE system is elliptic. We analyze the transition from a ``radial solution'''' similarity flow at the top of the hopper to a more general flow involving a boundary layer near the exit of the hopper.
Formalizing Constructive Real Analysis
Authors: Max B. Forester
Venue:  (1993)

This paper arises from a project with the Nuprl Proof Development System which involved formalizing parts of real analysis, up through the intermediate value theorem. Extensive development of the rational library was required as the real library was being built, resulting in the addition of about 125 rational theorems. The real library now contains about 150 theorems and includes enough basic results that further extensions of the library should be quite feasible. This paper aims to illustrate how higher mathematics can be implemented in a system like Nuprl, and also to introduce system users to the library. 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
Quality of EDA CAD Tools: Definitions, Metrics and Directions
Authors: A. H. Farrahi, D. J. Hathaway, M. Wang, M. Sarrafzadeh
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

In this paper we survey major problems faced by EDA tools in tackling submicron (DSM) design challenges like: crosstalk, reliability, power, and interconnect dominated delay. We discuss the need for rethinking quality models used in EDA tools to allow early and reliable planning, estimation, analysis, and optimization. Key design quality metrics from a CAD tool perspective are surveyed, and methodologies and directions are proposed for the next generation design automation tools, intended to meet the challenges ahead. Ideas such as forward synthesis, incremental synthesis, system-level interconnect prediction and planning, and their implications on design quality, design tool architecture, and design methodology are explored.
Planar Graph Coloring is Not Self-Reducible Assuming $P \neq NP$
Authors: Samir Khuller, Vijay V. Vazirani
Venue:  (1989)

No abstract is available.
A Chordal Preconditioner for Large Scale Optimization
Authors: Thomas F. Coleman
Venue:  (1986)

We propose an automatic preconditioning scheme for large sparse numerical optimization. The strategy is based on an examination of the sparsity pattern of the Hessian matrix: using a graph-theoretic heuristic, a block diagonal approximation to the Hessian matrix is induced. The blocks are submatrices of the Hessian matrix; furthermore, each block is chordal. That is, under a positive definiteness assumption, each block can be Cholesky factored without creating new nonzeroes (fill). Therefore the preconditioner is space efficient. We conduct a number of numerical experiments to determine the effectiveness of the preconditioner in the context of a linear conjugate gradient algorithm for optimization.
Implementing File Systems and Object Databases in a Microstorage Architecture
Authors: Dawson Dean, Richard Zippel
Venue:  (1993)

A microstorage architecture consists of a microstorage kernel and several storage servers. Each storage server implements a storage model that defines a client''s view of all the data in the system, how it is stored, retrieved and manipulated. The storage servers are built on top of the microstorage kernel and rely on it to perform the actual data storage and retrieval. The microstorage kernel implements a mechanism and the storage servers each implement specific policies defined by their storage models. Several different storage servers, each implementing a different storage model, may run concurrently over the microstorage kernel and all data in the system is concurrently visible to all the different storage servers. Different application programs, or different parts of the same application program, can use different storage models to manipulate the same data. Microstorage architectures provide a flexible interface and a smooth transition from traditional file systems to more powerful object oriented storage models. Existing applications continue to work correctly unchanged because they use a storage server that implements a traditional file model while new applications may gradually adopt more powerful storage models.
Using the Boundary Scan Delay Chain for Cross-Chip Delay Measurement and Characterization of Delay Modeling Flow
Authors: Christoph Smalla
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

For ASICs/SOCs/ICs it is often very important to have an easy accessible delay measurement path for several reasons. The delay of a long path running across the whole chip through lots of instances (inverters, MUXes) makes it possible to measure the final process parameters of an ASIC/IC within the best and worst case production process window. This information is very important for production testing and assembly at the vendor site. But very often this information is also necessary at circuit pack level, system test level and even in the field - when in case of problems (functionality, timing, debugging) it should be known which "quality level" the ASIC/IC device has reached. Also for characterization of the delay modeling during the different design phases (estimation, floorplanning, trial and final layout) such a dedicated delay path may help in qualifying the delay models together with the topological information of the database. We propose to use a new standard methodology to address these issues by definition of a dedicated delay path. It is called "Boundary Scan Delay Chain" (BSDC). We use the Boundary Scan data register according IEEE1149.1 to get a delay chain across the chip. Only a slight modification of the boundary scan cells (e.g. BC_1, BC_4) is necessary. The resulting new functionality is still IEEE1149.1 conform. 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
The Solution of Singular Value Problems Using Systolic Arrays
Authors: Richard P. Brent, Franklin T. Luk
Venue:  (1984)

This paper contains the computation of the singular value decomposition using systolic arrays. Two different linear time algorithms are presented.
Resource Discovery for Dynamic Clusters in Computational Grids
Authors: Omer F. Rana, Daniel Bunford-Jones, David W. Walker, Matthew Addis, Mike Surridge, Ken Hawich
Venue: Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2 (2001)

We describe a de-centralised approach to resource management and discovery, based on a community of interacting software agents. Each agent either represents a user application, a resource, or a MatchMaking service. The proposed approach can support dynamic registration of resources and user tasks, facilitating the establishment of dynamic clusters. Resource capability and task requirements are described using an object based data model, enabling new types of devices or new features in existing devices to be identified. A comparison with the Discovery and LookUp services in Jini and TSpaces is also provided.
Visual Presentation of Software Specifications and Designs
Authors: Gruia-Catalin Roman, Delbert Hart, Charles Calkins
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

Formal methods hold the promise for high dependability in the design of critical software. However, software engineers who employ formal methods need to communicate their design decisions to users, customers, managers, and colleagues who may not be in a position to acquire a full understanding of the formal notation being used. Visualizations derived from formal specifications and designs must be able convey the required information precisely and reliably without the use of formal notation. This paper discusses an attempt to integrate a design methodology based upon specification and program refinement with a state-of-the-art approach to rapid visualization of program executions. The emphasis is placed on how to convey graphically various kinds of formally-stated program properties. The illustrations are extracted from a case study involving the formal derivation of a message router. The ultimate goal is to identify issues fundamental to the use of visualization in conjunction with formal methods and to catalog methods which achieve effective visual communication without compromising formal reasoning.
An Effective Method for Generating Multiple Linear Regression Rules from Artificial Neural Networks
Authors: Rudy Setiono, Arnulfo Azcarraga
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

We describe a method for multivariate function approximation which combines neural network learning, clustering and multiple regression. Neural networks with a single hidden layer are universal function approximators. However, due to the complexity of the network topology and the nonlinear transfer function used in computing the activation of the hidden units, the predictions of a trained network are difficult to comprehend. On the other hand, predictions from a multiple linear regression equation are easy to understand but not accurate when the underlying relationship between the input variables and the output variable is nonlinear. The method presented in this paper generates a set of multiple linear regression equations using neural networks. The number of regression equations is determined by clustering the weighted input variables. The predictions for samples in the same cluster are computed by the same regression equation. Experimental results on real-world data demonstrate that the new method generates relatively few regression equations from the training data samples. The errors in prediction using these equations are comparable to or lower than those achieved by existing function approximation methods.
Multi-View Subspace Constraints on Homographies
Authors: Lihi Zelnik-Manor, Michal Irani
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

The motion of a planar surface between two camera views induces a homography. The homography depends on the camera intrinsic and extrinsic parameters, as well as on the 3D plane parameters. While camera parameters vary across different views, the plane geometry remains the same. Based on this fact, we derive linear subspace constraints on the relative motion of multiple (\math) planes across multiple views.The paper has three main contributions: (i) We show that the collection of all "relative homographies" of a pair of planes (homologies) across multiple views, spans a 4-dimensional linear subspace. (ii) We show how this constraint can be extended to the case of multiple planes across multiple views. (iii) We suggest two potential application areas which can benefit from these constraints: (a) The accuracy of homography estimation can be improved by enforcing the multi-view subspace constraints. (b) Violations of these multi-view constraints can be used as a cue for moving object detection. All the results derived in this paper are true for uncalibrated cameras.
Lower Bounds on String-Matching
Authors: Ming Li
Venue:  (1984)

New techniques for obtaining lower bounds on string-matching problems are developed and we prove the following new results. String-matching cannot be performed by a three-head one-way deterministic finite automaton. This answers the $k=3$ case of the open question, due to Galil and Seiferas [GS], whether a $k$-head one-way deterministic finite automaton can perform string-matching. String-matching by a k-head two-way DFA with k-1 heads blind (can only see two end symbols) is studied, tight upper and lower bounds are provided. Probabilistically moving a string on one tape (requiring $n^{2}$ time) is harder than probabilistically matching two strings on 1 tape. Notice that this is not true for deterministic or even nondeterministic TMs. This is the first result showing that checking is easier than generating.
Global existence of a solution to a phase field model for supercooling
Authors: Pierluigi Colli, Michel Fremond, Olaf Klein
Venue:  (1999)

In this work, we will derive a macroscopic model of phase field type for supercooling. The phase transition process is described by the evolution of the temperature and the volume fraction of the liquid phase. This phase field model can also be interpreted as the approximation of some generalized Stefan problem. We will prove the existence of solutions to an initial--boundary value problem for the resulting system by using a time discrete scheme.
Upson''s Familiar Quotations Second Edition 1974-1981
Authors: Hugh Nicks
Venue:  (1981)

This report is a compilation of several hundred examples of context-free language and very irregular expressions. Contributions were submitted over the last five years by numerous computer science graduate students who collected these now immortal words in classes and seminars. We wish to express our gratitude to the faculty, guest lecturers, and students who provided the bulk of this work.
Structure and Efficient Jacobian Calculation
Authors: Thomas F. Coleman, Arun Verma
Venue:  (1996)

Many computational tasks require the determination of the Jacobian matrix, at a given argument, for a large nonlinear system of equations. Calculation or approximation of a Newton step is a related task. The development of robust automatic differentiation (AD) software allows for "painless" and accurate calculation of these quantities; however, straightforward application of AD software on large-scale problems can require an inordinate amount of computation. Fortunately, large-scale systems of nonlinear equations typically exhibit either sparsity or structure in their Jacobian matrices. In this paper we proffer general approaches for exploiting sparsity and structure to yield efficient ways to determine Jacobian matrices (and Newton steps) via automatic differentiation.
Client-Server Interactions in Multi-Server Operating Systems: The Mach-US Approach
Authors: J. M Stevenson, Daniel P. Julin
Venue:  (1994)

This paper describes requirements placed upon client-server interaction in a multi-server operating system and how to answer those requirements. Addressed are the problems of binding maintenance in the face of: remote method invocation, forking, binding transfer, authentication, asynchronous interruption, and client crashes. Design and implementation choices are analyzed. The solutions, used by the CMU Mach-US multi-server UNIX 4.3BSD emulation on the Mach3.0 kernel, are described. The lessons learned are applicable to multi-server OS design and should be applicable to object based systems that must resolve these binding problems in a "micro" kernel environment.
Odd perfect numbers have a prime factor exceeding 107
Authors: Paul M. Jenkins
Venue: Mathematics of Computation (2003)

It is proved that every odd perfect number is divisible by a prime greater than 107.
Exploiting Trade-Offs in the Design of Fault-Tolerant Distributed Databases
Authors: Amitabh Shah
Venue:  (1990)

In a fault-tolerant distributed database, data replication can improve the availability of data as well as the response times of transactions, but only to a point. More replication can limit concurrency of transaction execution in the events of communication failures that partition the database. It can also increase the execution time of the replica management protocols. In fact, there are trade-offs involved between the amount of replication, the availability of data, and the transaction response times; the trade-offs are a function of the failure characteristics and the transaction access patterns. This work focuses on analyzing the nature of these trade-offs and develops strategies for exploiting them to enhance system performance. First, the trade-offs between replication and availability are statically analyzed where it is assumed that the underlying communication network has partitioned into several groups-and upper bounds on availability are derived for different cases of data replication and data access patterns. It is shown that partial replication can improve availability despite partition failures, if the partitioned database satisfies a particular property of data access. To ensure that a database indeed satisfies this property with a high probability, a network design strategy is developed. This is done by first identifying the most desirable partition of the set of sites-one characterized by high transaction access within every group of the partition, and low access across the groups-for a given cost of connecting the database sites, and then defining the connectivity of the database in a hierarchical manner. While the problem of finding the most desirable partition is shown to be NP-hard under most natural definitions of desirability, excellent approximation algorithms exist for finding such a partition. The resulting parameterized network, called a Harary Network, can support a wide spectrum of database assumptions and behaviors. Finally, to analyze the dynamic performance of such a database, in particular the trade-offs between availability and response times, a stochastic tool is developed. This tool enables a database designer to perform an analysis of the expected system performance and fine-tune the system parameters for improved performance. As an example, we extend Thomas''s majority consensus protocol to tolerate both site and link failures and analyze its performance using our stochastic tool.
MCSE Training Guide (70-221): Windows 2000 Network Infrastructure Design
Authors: Dave Bixler
Venue:  (2002)

:Exam 70-221, Windows 2000 Network Infrastructure Design, measures your ability to analyze the business requirements for a Windows 2000 network and design a network infrastructure that meets those business requirements. Network infrastructure elements include network topology, routing, IP addressing, name resolution, virtual private networks, remote access, and telephony solutions. Que Certification has again partnered with some of the most experienced authors and instructors to bring you the best information available to help you pass this core exam and become Microsoft certified. Designed for current MCPs or MCSEs and networking professionals with at least a year of experience, the Training Guide series has what certification candidates need to pass the tough Windows 2000 exams. Our books undergo a stringent review process, ensuring each book is accurate, comprehensive, and the ultimate resource for your exam-preparation needs.
Professional Software Development: Shorter Schedules, Higher Quality Products, More Successful Projects, Enhanced Careers
Authors: Steve McConnell
Venue:  (2003)

Can you deliver 90% of your software on time, within budget, and fully meet the user's real requirements? Would you like to? Best-selling author Steve McConnell provides a compelling argument for turning software success into an everyday habit by advancing the software profession itself-at the individual, organizational, and industry levels. Expanding on the contents of his previous book After the Gold Rush, the author dispels common myths of software development.