ppxscal/embedding_network huggingface dataset:
A Survey of Matrix Computations
Authors: Charles V Loan
Venue:  (1990)

This chapter is a three-level introduction to the field of matrix computations. The first section is very informal and is designed to acquaint the reader with the basic tools of the trade. The tools range from the algorithmic (What is a Householder matrix, and how they can be used to solve the least square problem?) to the analytic (What happens to the solution of a least square problem if we perturb the data?). In the second section, we discuss the matrix factorizations that figure heavily in numerical linear algebra. For each factorization, we survey algorithms, associated mathematical properties, and applications. Sprinkled throughout this section are special topics that illustrate the power of the factorization paradigm. In the final section, we use one factorization (Cholesky) to illustrate various aspects of high performance matrix computations. Successful computing nowadays requires the design of codes that pay careful attention to the flow of data during execution. Our goal is to make the reader more aware of these data movement concerns.
Interactive Verification of Game Design and Playing Strategies
Authors: Dimitris Kalles, Eirini Ntoutsi
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Reinforcement learning is considered as one of the most suitable and prominent methods for solving game problems due to its capability to discover good strategies by extended self-training and limited initial knowledge In this paper we elaborate on using reinforcementlearning for verifying game designs and playing strategies. Specifically, we examine a new strategy game that has been trained on self-playing games and analyze the game performance after human interaction. We demonstrate, through selected game instances, the impact of human interference to the learning process, and eventually the game design.
The Architecture and Programming of a Fine-Grain Multicomputer
Authors: Jakov N. Seizovic
Venue:  (1993)

The research presented in this thesis was conducted in the context of the Mosaic C, an experimental, fine-grain multicomputer. The objective of the Mosaic experiment was to develop a concurrent-computing system with maximum performance per unit cost, while still retaining a general-purpose application span. A stipulation of the Mosaic project was that the complexity of a Mosaic node be limited by the silicon complexity available on a single VLSI chip. The two most important original results reported in the thesis are: (1) The design and implementation of C+-, a concurrent, object-oriented programming system. Syntactically, C+- is an extension of C++. The concurrent semantics of C+- are contained within the process concept. A C+- process is analogous to a C++ object, but it is also an autonomous computing agent, and a unit of potential concurrency. Atomic single-process updates that can be individually enabled and disabled are the execution units of the concurrent computation. The limited set of primitives that C+- provides is shown to be sufficient to express a variety of concurrent-programming problems concisely and efficiently. An important design requirement for C+- was that efficient implementations should exist on a variety of concurrent architectures, and, in particular, on the simple and inexpensive hardware of the Mosaic node. The Mosaic runtime system was written entirely in C+-. (2) Pipeline synchronization, a novel, generally- applicable technique for hardware synchronization. This technique is a simple, low-cost, high-bandwidth, high- reliability solution to interfaces between synchronous and asynchronous systems, or between synchronous systems operating from different clocks. The technique can sustain the full communication bandwidth and achieve an arbitrarily low, non-zero probability of synchronization failure, Pf, with the price in both latency and chip area being O(log 1/Pf). Pipeline synchronization has been successfully applied to the highperformance inter-computer communication in Mosaic node ensembles.
Infrared Holography for Optical Communications: Techniques, Materials and Devices
Authors: Marinus T. Vlaardingerbroek
Venue:  (2003)

:The aim of this book is to exploit the advantages of holographic technology, namely the high storage capacity and fast access times, in order to implement optical devices for infrared fiber communication applications. The covered methods range from two-lambda to gated recording techniques, all of which can be applied to a variety of materials such as photorefractive crystals and photopolymers. Both techniques and materials are strictly related to the practical realization of signal processing devices, showing their feasibility and discussing their role in a realistic telecoms network. Research scientists, engineers and graduate students will benefit equally from the combined coverage of technological features, optical communications components, and network perspectives.
Establishing a Data-Mining Environment for Wartime Event Prediction with an Object-Oriented Command and Control Database
Authors: Marion G. Ceruti, S. Joe McCarthy
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

This paper documents progress to date on a research project, the goal of which is wartime-event prediction. It describes the operational concept, the data-mining environment, and data-mining techniques that use Bayesian networks for classification. Key steps in the research plan are as follows: 1) implement machine learning;2) test the trained networks; and3) use the technique to support a battlefield commander by predicting enemy attacks.Data for training and testing the technique can be extracted from the object-oriented database that supports the Integrated Marine Multi-Agent Command and Control System (IMMACCS). These data were derived from message traffic generated during U.S. Marine Corps exercises. The class structure in the IMMACCS data model is especially well suited to support attack classification.
VAV: a program for tidal data processing
Authors: Angel P. Venedikov, José Arnoso, Ricardo Vieira
Venue: Computers Geosciences (2003)

The paper deals with a new computer program, named VAV, for the analysis of any kind of tidal data. VAV can be applied on unevenly spaced data without interpolation. The basic algorithm consists in a transformation of the data from the time domain into a time/frequency domain. This is done through filtration of data intervals without overlapping, whose operation eliminates a rather flexible model of the drift. The filters used are orthogonal and in the situation of unevenly spaced data, they are adaptable in the time domain. After the transformation, the tidal parameters are estimated through the method of the least squares that is applied in the time/frequency domain. Since the noise of the data is correlated (colored noise), VAV provides frequency-dependent estimates of the precision. The program is specially orientated towards the search of various anomalies of the data, which may be useful, eventually, for earthquake and volcano monitoring.
Approximation algorithms and relaxations for a service provision problem on a telecommunication network
Authors: Shane Dye, Leen Stougie, Asgeir Tomasgard
Venue: Discrete Applied Mathematics (2003)

Modern distributed telecommunication networks have widely extended the possibilities of the telecommunication industry for offering a wide variety of services, directly or indirectly by facilitating them for other service providers. As new services are often processing based there is a need for a shift of focus in research from traditional transportation of information to processing of information. This paper considers the problem of installing software applications for services at the computing nodes of the distributed network, in order to maximize the service provider's profit when meeting demand. The service provision problem is formulated as an integer linear programming model and is shown to be NP-hard.We exploit similarities to the well-known (multiple) knapsack problem in devising approximation algorithms and analysing their performance from a worst-case point of view. Among others, a fully polynomial-time approximation scheme is presented for the case with one computing node. The other main results of the paper concern the derivation of upper bounds on the optimal solution via LP.
Approximation of grad-div operator in non-convex domains
Authors: Daniele Boffi, Claudia Chinosi, Lucia Gastaldi
Venue:  (1999)

In this paper we are dealing with the approximation of the grad-div operator in non-convex polygonal domains. A penalization strategy is considered in order to obtain a formulation of the original eigenproblem which is associated with an elliptic operator. However the presence of singular eigensolutions, in the case of non-convex domains, is the origin of major troubles in the numerical approximation of the problem. A mixed-type approximation, based on an under-integrated scheme, is introduced and analyzed from the theoretical and numerical point of view. Several numerical experiments confirm that in presence of singularities the under-integrated scheme is needed in order to reproduce the feautures of the continuous problem.
On Perfect Matchings and Hamiltonian Cycles in Sums of Random Trees
Authors: Alan Frieze, Michal Karonski, Lubos Thoma
Venue:  (1996)

We prove that the sum of two random trees almost surely possesses a perfect matching and the sum of five random trees almost surely possesses a Hamiltonian cycle.
On an equivalence between PLSI and LDA
Authors: Mark Girolami, Ata Kabán
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Latent Dirichlet Allocation (LDA) is a fully generative approach to language modelling which overcomes the inconsistent generative semantics of Probabilistic Latent Semantic Indexing (PLSI). This paper shows that PLSI is a maximum a posteriori estimated LDA model under a uniform Dirichlet prior, therefore the perceived shortcomings of PLSI can be resolved and elucidated within the LDA framework.
Mastering Mac OS X, Second Edition, 2 edition
Authors: Todd Stauffer
Venue:  (2002)

:Isn't It Time You Made the Most of Mac OS X? Don't let the fact that Mac OS X boasts over 150 new features, is based on Unix, and is also called Jaguar scare you off. This essential guide will help you get all you can out of it. Mastering Mac OS X, Second Edition shows you how to take advantage of every aspect of Apple's powerhouse operating system. Whether you're a Mac newbie or old-timer or you're converting from Windows or Unix, this book will answer all your current questions and equip you with the knowledge you need to keep moving forward. Over 900 pages of coverage includes: Personalizing Mac OS X: Dock, Desktop, and Finder Using the Classic environment and Classic applications Encrypting data, storing passwords, and using built-in applications Configuring user permissions and settings Connecting to the Internet Troubleshooting and securing your Internet connection Using, automating, and securing e-mail from viruses Using QuickTime 6, QuickTime Pro, and iMovie to play, edit, and export movie files Burning audio and data CDs and playing MP3s, Internet radio, and DVD movies Importing, exporting, and editing digital images Building a secure network and sharing files locally and over the Internet Using Windows and Unix documents, networking protocols, and applications Working with Terminal and Darwin command lines and Darwin applications Backing up and recovering data, managing your disks and peripherals Configuring and tweaking Apache, FTP serving, PHP, MySQL, and QuickTime streaming Quickly diagnosing and solving common system-level problems Troubleshooting Classic and native applications About the Author Todd Stauffer is the author or co-author of over 25 books covering topics such as Web publishing, upgrading Macintoshes, and using the iMac. He's a contributor to MacAddict and a writer for a number of other publications, a humor columnist, car reviewer, speaker and the publisher of a news and entertainment magazine. He can be reached via his website at www.mac-upgrade.com.
Padé approximants and complex high order Toda lattices
Authors: A. I. Aptekarev, A. Branquinho
Venue: Journal of Computational and Applied Mathematics (2003)

Tridiagonal operators with complex coefficients are considered. The correspondence between dynamics of high order Toda equations for the coefficients of the operator and its resolvent function is established. It gives a method to solve an inverse problem--integration of high order Toda equations with complex initial data--based on Padé approximants and continued fractions for the resolvent function.
On Effective Speed-up and Long Proofs of Trivial Theorems in Formal Theories
Authors: Juris Hartmanis
Venue:  (1975)

In this note we give a very simple proof which shows that in many interesting formal mathematical theories, axiomatizable as well as decidable ones, for every given formalization we can effectively find infinite subsets of trivially true theorems which require as long proofs in the given formalism as the hardest theorems of the theory. Thus showing that for these theories every formalism is doomed to be blind to the triviality of infinite sets of theorems, which can be found effectively. Furthermore, it follows that for all (sufficiently large) constructable tape and time bounds there exists sets whose recognition can be effectively speeded up on infinite subsets and that such sets appear naturally, thus showing that for many concrete problems, every algorithm can be effectively sped-up on infinite subsets.
Transformation Based Insertion of On-Line Testing Resources in a High-Level Synthesis Environment
Authors: Petros Oikonomakos, Mark Zwolinski
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

On-line testability is essential in designs with high reliability requirements. High-level synthesis reduces time-to-market and enables efficient design space exploration. In our work, we implement on-line testable designs in a high-level synthesis context. We refer to our new technique (inversion testing) and exploit its features, in an attempt to reduce hardware penalties.
Specification and Analysis of System Level Inter-Component Communication
Authors: Mats P. E. Heimdahl, Jeffrey M. Thompson
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

In embedded systems the interfaces between software and its embedding environment are a major source of costly errors. For example, Lutz reported that 20% - 35% of the safety related errors discovered during integration and system testing of two spacecraft were related to the interfaces between the software and the embedding hardware. Also, the software's operating environment is likely to change over time further complicating the issues related to system level inter-component communication. In this paper we discussed a formal approach to the specification and analysis of inter-component communication using a revised version of the RSML (Requirements State Machine Language) specification language. The formalism allows rigorous specification of the physical aspects of the inter-component communication and enables encapsulation of communication related properties in well defined interface specifications. This allows us to both analyze a system design and detect incompatibilities between connected components and use the interface specifications as simple safety kernels to enforce safety and simple liveness constraints.
Generating, Visualizing and Evaluating High Quality Clusters for Information Organization
Authors: J. Aslam, K. Pelekhov, Daniela Rus
Venue:  (1997)

We present and analyze the star clustering algorithm. We discuss an implementation of this algorithm that supports browsing and document retrieval through information organization. We define three parameters for evaluating a clustering algorithm to measure the topic separation and topic aggregation achieved by the algorithm. In the absence of benchmarks, we present a method for randomly generating clustering data. Data from our user study shows evidence that the star algorithm is effective for organizing information.
Lightweight Version Vectors for Pervasive Computing Devices
Authors: Yun-Wu Huang, Philip S. Yu
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Traditional version vectors can be used to optimize peer-to-peer synchronization for pervasive computing devices. However, their storage overhead may be a prohibitive factor in scalability in an environment with typically low communication bandwidth and relatively small storage memory. We present a dynamic version vector design that allows small data sizes for version vector items. We call it lightweight version vector approach (LVV) and argue that a step-increase method of LVV can be an effective solution for peer-to-peer synchronization of pervasive computing devices.
A Proposal for Routing-Based Timing-Driven Scan Chain Ordering
Authors: Puneet Gupta, Andrew B. Kahng, Stefanus Mantik
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Scan chain insertion can have large impact on routability,wirelength and timing. We propose a routing-driven andtiming-aware methodology for scan insertion with minimumwirelength. We take into account timing slacks at all sinksthat are affected by scan insertion, to achieve a scan chainordering that meets timing and has smallest wirelength. Forthe case where sink timing is not met, we also propose abuffer insertion methodology with minimum wirelength objective.The key contribution of this paper is a method tocompute a timing-driven incremental connection suited toscan insertion; this has possible applications in general incrementalrouting.
On-line Detection and Compensation of Transient Errors in Processor Pipeline-Structures
Authors: C. Galke, M. Pflanz, H. T. Vierhaus
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

Based on strategies for on-line error detection in data and control path structures in simple microprocessors, this approach proposes techniques for the control- and component-error detection in high-performance processors. Detected errors are classified on-line with respect to their impact on the control and data flow. A compensation of detected errors is performed by micro rollback with different rollback distances according to predefined priority classes of error handling.
Information Retrieval Models for Recovering Traceability Links between Code and Documentation
Authors: G. Antoniol, G. Canfora, A. de Lucia, G. Casazza
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

The research described in this paper is concerned with the application of information retrieval to software maintenance, and in particular to the problem of recovering trace-ability links between the source code of a system and its free text documentation. We introduce a method based on the general idea of vector space information retrieval and apply it in two case studies to trace C++ source code onto manual pages and Java code onto functional requirements. The case studies discussed in this paper replicate the studies presented in references [3] and [2], respectively, where a probabilistic information retrieval model was applied. We compare the results of vector space and probabilistic models and formulate hypotheses to explain the differences.
A Survey of Graduate Programs in Computer Science
Authors: Richard W. Conway
Venue:  (1978)

NO SUPPLIED
Unusual Stabilized Finite Element Methods for Second Order Linear Differential Equations
Authors: Michel Lesoinne, Leopoldo P. Franca
Venue:  (1995)

Unusual stabilized finite element methods are introduced here for linear second order equations. The method consists in subtracting to the standard Galerkin method a mesh dependent term composed by the adjoint operator applied to the test function multiplied by the residual of the Euler-Lagrange equation. The method is numerically tested for advective dominated and zero order dominated regimes, when the equation presents singular behavior.
A product-based assurance model for mixed-integrity markets
Authors: Brenton Atchison, Alena Griffiths
Venue: Proceedings of the seventh Australian workshop conference on Safety critical systems and software 2002 - Volume 15 (2003)

Many markets use a Commerial-Off-The-Shelf (COTS) or product-based approach to engineering in order to reduce project cost, schedule and risk, take advantage of product maturity and secure long-term support. The product-based approach presents challenges for both product developers and project engineers when applied to safety-related applications. Project engineers are obliged to present evidence of product integrity to support the overall safety argument.In such cases, the safety integrity requirements for a product may not be known until a safety analysis of a specific system architecture in its target environment is performed. One determined, evidence of integrity needs to be obtained and presented to suit the customer requirements and industry standards. Concurrently, product developers need to engineer products and assurance evidence to support the requirements of high-integrity markets in the face of constant product change and the competing demands of different markets.This paper discusses the issues involved in engineering products for use in Supervisory Control and Data Aquisition (SCADA) systems in a diverse range of applications, both safety-related and non-safety-related. In particular, we address the issue of how to provide a base level of product assurance that can be used, if it ultimately proves necessary, to support system safety cases.
Diminishing Head-Mounted Display for Shared Mixed Reality
Authors: Masayuki Takemura, Yuichi Ohta
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

We propose a new scheme to recover the eye-contact between multiple users in a Shared Mixed-Reality Space. The eye-contact in a shared mixed-reality space is lost as the side effect of wearing head-mounted displays. We synthesize facial images in real-time with arbitrary poses and eye expressions by using several photographs of the user. The face images are overlaid in order to diminish the HMD in his partner's view for the recovery of eye-contact. The basic idea, facial image synthesis, and an experimental system to diminish HMD are presented in this paper.
A Unified View of Semantics
Authors: Mila E. Majster
Venue:  (1979)

NO SUPPLIED 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