ppxscal/embedding_network huggingface dataset:
Computer Simulated Experiments for Electric Circuits Using Electronic Workbench
Authors: Richard H. Berube
Venue:  (1996)

:Computer Simulated Experiments for Electric Circuits using Electronics Workbench to stimulate actual laboratory experiments on a computer. 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
Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
Authors: Venkatesan Guruswami, Piotr Indyk
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

We present an explicit construction of linear-time encodable and decodable codes of rate r which can correct a fraction (1&mdash:r&egr;)/2 of errors over an alphabet of constant size depending only on &egr;, for every 0 < r < 1 and arbitrarily small &egr;> 0. The error-correction performance of these codes is optimal as seen by the Singleton bound (these are "near-MDS" codes). Such near-MDS linear-time codes were known for the decoding from erasures [2]; our construction generalizes this to handle errors as well. Concatenating these codes with good, constant-sized binary codes gives a construction of linear-time binary codes which meet the so-called "Zyablov bound". In a nutshell, our results match the performance of the previously known explicit constructions of codes that had polynomial time encoding and decoding, but in addition have linear time encoding and decoding algorithms.We also obtain some results for list decoding targeted at the situation when the fraction of errors is very large, namely (1&mdash;&egr;) for an arbitrarily small constant &egr; > 0. The previously known constructions of such codes of good rate over constant-sized alphabets either used algebraic-geometric codes and thus suffered from complicated constructions and slow decoding, or as in the recent work of the authors [9], had fast encoding/decoding, but suffered from an alphabet size that was exponential in 1/&egr;. We present two constructions of such codes with rate close to &OHgr;(&egr;2) over an alphabet of size quasi-polynomial in 1/&egr;. One of the constructions, at the expense of a slight worsening of the rate, can achieve an alphabet size which is polynomial in 1/&egr;. It also yields constructions of codes for list decoding from erasures which achieve new trade-offs. In particular, we construct codes of rate close to the optimal &OHgr;(&egr;) rate which can be efficiently list decoded from a fraction (1&mdash;&egr;) of erasures.
Protecting Business Information: A Manager's Guide, 1st edition
Authors: James A. Schweitzer
Venue:  (1995)

:Protecting Business Information: A Manager's Guide is an introduction to the information resource, its sensitivity, value and susceptibility is risk. This text provides an outline for a business information security program and provides clear answers to the why and how of information protection. * A valuable guide based on the author's fifteen year's experience in building and implementing information security programs for large, worldwide businesses. * Provides a basis for the reasoning behind information protection processes. * Suggests practical means for aligning an information security investment with business needs. Protecting Business Information provides detailed processes for analysis, leading to a complete and adequate information protection program. It includes a thorough description of the methods for information classification.
AutoCAD LT 2000 For Dummies, 1st edition
Authors: Mark Middlebrook
Venue:  (1999)

:For those who need a functional two-dimensional CAD tool but don't want to spend a lot of money on it, AutoCAD LT is the ideal program - and AutoCAD LT for Dummies is their ideal guide. This easy-to-understand reference lets designers get acquainted with the interface and drawing features - and start using the built-in learnablity functions that help AutoCAD LT novices get up to speed. In no time at all, new users will be turning their ideas in CAD files - and even sharing files with the full AutoCAD program.
F. Scott Barker's Microsoft Access 2000 Power Programming
Authors: F. Scott Barker
Venue:  (1999)

:Access 2000 Power Programming gives many practical techniques for the corporate and independent developer. New features of Access 2000 are covered thoroughly and useful examples which will be implemented by programmers in their everyday applications. New topics include a chapter devoted to Data Pages, Microsoft's way of bringing the Web interface into everyday office solutions. Also, a new chapter clarifies the confusion over ADP/MDB and DAO/ADO, including when and where to use each. The book covers a number of new additions to VBA which developers will need good exposure to in order to take advantage of them. 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
Variance reduction techniques for value-at-risk with heavy-tailed risk factors
Authors: Paul Glasserman, Philip Heidelberger, Perwez Shahabuddin
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

The calculation of value-at-risk (VAR) for large portfolios of complex instruments is among the most demanding and widespread computational challenges facing the financial industry. Current methods for calculating VAR include comparatively fast numerical approximations---especially the linear and quadratic (delta-gamma) approximations---and more robust but more computationally demanding Monte Carlo simulation. The linear and delta-gamma methods typically rely on an assumption that the underlying market risk factors have a Gaussian distribution over the VAR horizon. But there is ample empirical evidence that market data is more accurately described by heavy-tailed distributions. Capturing heavy tails in VAR calculations has to date required highly time-consuming Monte Carlo simulation. We describe two methods for computationally efficient calculation of VAR in the presence of heavy-tailed risk factors, specifically when risk factors have a multivariate t distribution. The first method uses transform inversion to develop a fast numerical algorithm for computing the distribution of the heavy-tailed delta-gamma approximation. For greater accuracy, the second method uses the numerical approximation to guide in the design of an effective Monte Carlo variance reduction technique; the algorithm combines importance sampling and stratified sampling. This method can produce enormous speed-ups compared with standard Monte Carlo.
Prototype mobility tools for visually impaired surfers
Authors: Simon Harper, Carole Goble, Robert Stevens
Venue: Proceedings of the 12th ACM conference on Hypertext and Hypermedia (2001)

In [1] we extended the notion of travel to include environment, feedback and the purpose of the current travel task. Specifically, we likened web use to travelling in a virtual space, compared it to travelling in a physical space, and introduced the idea of mobility - the ease of travel - as opposed to travel opportunity. This paper describes our continuing work in building a prototype mobility tool to address some of these issues.
MCSE Readiness Review -- Exam 70-098: Implementing and Supporting Microsoft Windows 98
Authors: Dave Perkovich
Venue:  (1999)

:Developed exclusively for Microsoft Press by Self Test Software, this electronic assessment tool delivers a set of randomly generated, 60-question practice exams covering real MCP objectives. You can test and retest with different question sets each time - and with automated scoring you get immediate Pass/Fail feedback. More importantly, you'll get answers to these four critical questions: What do MCP exam questions look like? In what topic and skill areas am I proficient/deficient? How should I focus my studies? Am I ready for the real exam?.
Batching methods for simulation output analysis: a stopping procedure based on phi-mixing conditions
Authors: E. Jack Chen, W. David Kelton
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

The use of batch means is a well-known technique for estimating the variance of mean point estimators computed from a simulation experiment. This paper discusses implementation of a sequential procedure to determine the batch size for constructing confidence intervals for a simulation estimator of the steady-state mean of a stochastic process. Our quasi-independent (QI) procedure increases the batch size progressively until a certain number of essentially i.i.d. samples are obtained. We show that our sequential procedure gives valid confidence intervals. The only (mild) assumption is that the correlations of the stochastic process output sequence die off. An experimental performance evaluation demonstrates the validity of the QI procedure.
High-Performance Computer Architecture, 3rd edition
Authors: Harold S. Stone
Venue:  (1992)

:design ideas embodied in many high-performance machines and stresses techniques for evaluating them. Stone develops a proper understanding of the design process by treating the various trade-offs that exist in designing choices, and shows how good designs make efficient use of technology. Features Teaches techniques for the design and analysis of high-performance machines Develops students' intuition for design by treating various tradeoffs that exist in design choices Discusses many important topics: RISC architectures, interconnection meshes, Cache coherent and multiprocessors, and Cache Memory. Includes enhanced descriptions of RISC Processors Expands material on Cache Memory Analysis Current technology in RISC with a focused look on super scalar Additional memory models and techniques for doing Cache design New porposals for coherent memory systems in System C parallel processors Both design and thought problems and problems with limiting parameters are provided
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
Authors: Jens-Peter Dittrich, Bernhard Seeger
Venue: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining (2001)

The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a distance &egr;.One of the most efficient algorithms for processing similarity-joins is the Multidimensional-Spatial Join (MSJ) by Koudas and Sevcik. In our previous work --- pursued for the two-dimensional case --- we found however that MSJ has several performance shortcomings in terms of CPU and I/O cost as well as memory-requirements. Therefore, MSJ is not generally applicable to high-dimensional data.In this paper, we propose a new algorithm named Generic External Space Sweep (GESS). GESS introduces a modest rate of data replication to reduce the number of expensive distance computations. We present a new cost-model for replication, an I/O model, and an inexpensive method for duplicate removal. The principal component of our algorithm is a highly flexible replication engine.Our analytical model predicts a tremendous reduction of the number of expensive distance computations by several orders of magnitude in comparison to MSJ (factor 107). In addition, the memory requirements of GESS are shown to be lower by several orders of magnitude. Furthermore, the I/O cost of our algorithm is by factor 2 better (independent from the fact whether replication occurs or not). Our analytical results are confirmed by a large series of simulations and experiments with synthetic and real high-dimensional data sets.
Image processing projects for introductory students
Authors: Myron L. Nack, Hayden S. Porter
Venue: Proceedings of the 18th annual Southeast regional conference (1980)

Two image processing projects are presented for introductory students that require only minimal computer facilities. The first produces a binary (black or white pixel) image and introduces signal processing concepts. The second project extends these ideas to the production of a grey level image.
Constraint solving for bounded-process cryptographic protocol analysis
Authors: Jonathan Millen, Vitaly Shmatikov
Venue: Proceedings of the 8th ACM conference on Computer and Communications Security (2001)

The reachability problem for cryptographic protocols with non-atomic keys can be solved via a simple constraint satisfaction procedure.
Stereoscopic video system with embedded high spatial resolution images using two channels for transmission
Authors: Takafumi Ienaga, Katsuya Matsunaga, Kazunori Shidoji, Kazuaki Goshi, Yuji Matsuki, Hiroki Nagata
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2001)

Teleoperation requires both wide vision to recognize a whole workspace and fine vision to recognize the precise structure of objects which an operator wants to see. In order to achieve high operational efficiency in teleoperation, we have developed the Q stereoscopic video system which is constructed of four sets of video cameras and monitors. It requires four video channels to transmit video signals. However, four channels are not always available for a video system because of the limitation of the number of radio channels when multiple systems are used at the same time. Therefore we have tried to reduce the number of channels on this system by sending images from the right and left cameras alternately by field. In experiment 1, we compared the acuity of depth perception under three kinds of stereoscopic video systems, the original Q stereoscopic video system, the Q stereoscopic video system with two channel transmission, and the conventional stereoscopic video system. As the result of the experiment, the original Q stereoscopic video system enabled us to perceive depth most precisely, the Q stereoscopic video system with two channel transmission less so, and the conventional stereoscopic video system even less. In experiment 2, we compared the Q stereoscopic video system with two channel transmission to the original Q stereoscopic video system. The result showed that the operators were able to work more efficiently under the original Q stereoscopic video system than under the Q stereoscopic video system with two channel transmissions. In experiment 3, we compared the Q stereoscopic video system with two channel transmission to the conventional stereoscopic video system. It was found out in this study that the new stereoscopic video system we developed enabled operators to work more efficiently and to perceive depth more precisely than the conventional stereoscopic video system, although the number of channels for image transmission of this system was equal to that of the conventional stereoscopic video system.
Topology-reducing surface simplification using a discrete solid representation
Authors: Carlos Andújar, Pere Brunet, Dolors Ayala
Venue: ACM Transactions on Graphics (TOG) (2002)

This paper presents a new approach for generating coarse-level approximations of topologically complex models. Dramatic topology reduction is achieved by converting a 3D model to and from a volumetric representation. Our approach produces valid, error-bounded models and supports the creation of approximations that do not interpenetrate the original model, either being completely contained in the input solid or bounding it. Several simple to implement versions of our approach are presented and discussed. We show that these methods perform significantly better than other surface-based approaches when simplifying topologically-rich models such as scene parts and complex mechanical assemblies.
The Physical Principles of Magneto-Optical Recording
Authors: Masud Mansuripur
Venue:  (1995)

:This book covers the physics of magneto-optical recording, beginning with first principles and working through to contemporary state-of-the-art topics. Both optics and magnetism are broad subjects, each with many applications in modern technology. This book prepares the reader for advanced work in either field. The first half of the book teaches the theory of diffraction using an original unified approach. It also covers the optics of multilayers (including dielectric, metal, birefringent and magnetic layers), polarization optics, noise in photodetection, and thermal aspects. The second half of the book describes the basics of magnetism and magnetic materials, magneto-static field calculations, domains and domain walls, the mean-field theory of magnetism, magnetization dynamics, the theory of coercivity, and the process of thermomagnetic recording. In each chapter, throughout the book, after coverage of the fundamentals the author explains the relevance of the topic to magneto-optical recording, and examples are given that emphasize this particular connection. Numerous examples based on real-world problems encountered in the engineering design of magneto-optical media and systems will give the reader valuable insights into the science and technology of optical recording. In addition, there are extensive problem sets at the ends of the chapters. This book may be used as an advanced textbook on optical recording in both physics and engineering departments, and also as a reference work for scientists and engineers in industrial and academic laboratories.
The Concept of Intelligence: A Philosophical Analysis
Authors: Ira Altman
Venue:  (1997)

:This book is about the concept of intelligence which derives virtually all of its significance from an occurrence use of mental conduct adverbs. But an occurrence or episodic use of mental concepts does not open the way toward viewing mental events as "ghostly processes," for as far as the concept of intelligence is concerned, the occurrences are publicly observable; the significance of "intelligence" is predicted on outward criteria. "The Concept of Intelligence" provides an episodic rather than a dispositional analysis, while at the same time, agreeing that intelligence has "outer criteria" of meaning. It reinforces the "nature" as opposed to the "nurture" side of the popular debate on intelligence by showing what the concept signifies in ordinary language, and so, dovetails with the controversial "The Bell Curve&agrave;". "The book is intended for courses in the philosophy of mind, philosophical psychology, cognitive science, analytic philosophy, psychology, psychometrics, and artificial intelligence.Author Biography: Ira Altman is Adjunct Professor of Philosophy at Queensborough Community College, Touro College, and Suffolk Community College, all in New York. 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
Will it be upper-case or will it be lower-case: can a prompt for text be a mode signal?
Authors: Hokyoung Ryu
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

The new forms of interaction being devised for small mobile devices have required designers to re-visit basic principles for user interface design. One of these is the notion of mode. For example, when a key is pressed how will the user know whether the letter displayed will be in upper- or lower-case. An experiment is described in which users have to learn to use a new device where this is an issue. Results show that users are influenced by the case of letters in the prompt.
An Access Path Specification Language for restructuring network databases
Authors: Donald Swartwout
Venue: Proceedings of the 1977 ACM SIGMOD international conference on Management of data (1977)

The Access Path Specification Language (APSL) is a high-level essentially nonprocedural language for specifying restructuring transformations of network databases. It does so in terms of application-oriented concepts such as access strategies and selection criteria. APSL's approach to restructuring emphasizes description of the source structures from which target data is to be retrieved, rather than the operations needed to convert source constructs to target constructs. The latter approach is used by most current systems to restructure hierarchical data.APSL is based on the Relational Interface Model (RIM) of data, which permits a suitably restricted network database to be viewed simultaneously as a relational database in first normal form. Any restructuring of a RIM database which can be performed by the relational algebra operations Join, Select, Project, and Union can be described in APSL.APSL has been implemented as the restructuring specifications language in the Michigan Data Translator.
A hierarchical load-balancing framework for dynamic multithreaded computations
Authors: Vijay Karamcheti, Andrew A. Chien
Venue: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM) (1998)

High-level parallel programming models that support dynamic fine-grained threads in a global object space, are becoming increasingly popular for expressing irregular applications based on sophisticated adaptive algorithms and pointer-based data structures. However, implementing these multithreaded computations on scalable parallel machines poses significant challenges, particularly with respect to load-balancing. Load-balancing techniques must simultaneously incur low overhead to support fine-grained threads as well as be sophisticated enough to preserve data locality and thread execution priority.This paper presents a hierarchical framework which addresses these conflicting goals by viewing the computation as being made up of different thread subsets, each of which are load-balanced independently. In contrast to previous processor-centric approaches that have advocated the use of a uniform policy for load-balancing all threads in a computation, our framework allows each thread subset to be load-balanced using a policy most suited to its characteristics (e.g., locality or priority sensitivity). The framework consists of two parts: (i) language support which permits a programmer or the compiler to tag different thread subsets with appropriate policies, and (ii) run-time support which synthesizes overall application load-balance by composing these individual policies.This framework has been implemented in the Illinois Concert runtime system, an implementation platform for fine-grained concurrent object-oriented languages. Results for four large irregular applications on the Cray T3D and the SGI Origin 2000 demonstrate advantages of the hierarchical framework: performance improves by up to an order of magnitude as compared to using a uniform load-balancing policy.
Designing attentive cell phone using wearable eyecontact sensors
Authors: Roel Vertegaal, Connor Dickie, Changuk Sohn, Myron Flickner
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

We present a prototype attentive cell phone that uses a low-cost EyeContact sensor and speech analysis to detect whether its user is in a face-to-face conversation. We discuss how this information can be communicated to callers to allow them to employ basic social rules of interrruption.