ppxscal/embedding_network huggingface dataset:
Requirements for high performance group support in distributed systems
Authors: Werner Vogels, Paulo Veríssimo, Luís Rodrigues
Venue: Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring (1992)

Although the use of groups and group communication is becoming more and more accepted as an important tool for implementing distributed applications and algorithms, there is still much controversy about the way the group paradigm should actually be implemented. In this paper the authors identify some of the areas in which these controversies still exist and express their views on the matters causing the disagreements.
A framework for call graph construction algorithms
Authors: David Grove, Craig Chambers
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2001)

A large number of call graph construction algorithms for object-oriented and functional languages have been proposed, each embodying different tradeoffs between analysis cost and call graph precision. In this article we present a unifying framework for understanding call graph construction algorithms and an empirical comparison of a representative set of algorithms. We first present a general parameterized algorithm that encompasses many well-known and novel call graph construction algorithms. We have implemented this general algorithm in the Vortex compiler infrastructure, a mature, multilanguage, optimizing compiler. The Vortex implementation provides a "level playing field" for meaningful cross-algorithm performance comparisons. The costs and benefits of a number of call graph construction algorithms are empirically assessed by applying their Vortex implementation to a suite of sizeable (5,000 to 50,000 lines of code) Cecil and Java programs. For many of these applications, interprocedural analysis enabled substantial speed-ups over an already highly optimized baseline. Furthermore, a significant fraction of these speed-ups can be obtained through the use of a scalable, near-linear time call graph construction algorithm.
Technical system for collaborative work
Authors: Andreas M. Kunz, Christian P. Spagno
Venue: Proceedings of the workshop on Virtual environments 2002 (2002)

Virtual reality makes it possible to realize distributed collaborative teamwork. In this case objects can be represented three-dimensionally in different visualization installations which are connected with each other over a network [7]. Up to now the user remains mostly without consideration. For distributed collaborative teamwork the user should be visualized three-dimensionally together with the other virtual objects [14]. In the presented paper a special projection installation is described which allows simultaneous projection and acquisition of images of the users.
Basic Circuit Analysis
Authors: David R. Cunningham
Venue:  (1994)

:This substantially revised edition retains its distinctive organizational format which uses the full range of fundamental concepts for each type of circuit before progressing to the next. This building block approach applies three basic concepts--resistance, inductance, capacitance--to a series of circuits, beginning with simple designs and gradually increasing in complexity. Extensive "remember" statements facilitate review by highlighting key concepts at the end of every section. The abundant problem sets have been updated--several completely new, others with novel variables.
The Complete Idiot's Guide to XML with CD-ROM
Authors: David Gulbransen
Venue:  (2000)

:Author David Gulbransen explains the evolution of XML, the concepts behind the XML technology, and the reasons why you might consider XML for applications within your organization. Learn the historical background on XML and how it came into being, including its relationships to other Web technologies such as HTML. See explanations of the building blocks of XML, which allow you to create and use XML based documents and solutions. Coverage of advanced XML topics is included, which will provide you with the direction for more complex XML solutions. Also included is an overview of the related technologies which are helping XML become firmly entrenched in data management issues relating to the Internet.
Electronic Resumes and Online Networking: How to Use the Internet to Do a Better Job Search, Including a Complete, up-to-Date Resource Guide
Authors: Rebecca Smith
Venue:  (1998)

:With the advent of the Internet, job searching and resume development will never be the same. In the old days, it wasn't what you knew, but who you knew. The focus used to be on building relationships with people who had inside knowledge of potential job leads. The Internet changes all that. Now it's not just who you know, but where you go online to let people know about you and your skills...and how you communicate those skills most effectively. And that's where Electronic Resumes and Online Networking can help. This practical and accessible new guide convincingly shows you how the printed word is just as valuabel as face-to-face interaction for uncovering job leads. Rebecca Smith shows you how easy it is to become a remote insider...to gather and use information you never before thought possible. And she goes on to demonstrate how to use the information you gahter to tailor and distribute a resume that gets noticed in a variety of electronic situations. You'll probably still need to do some face-to-face networking and put your resume on paper, but the strategies and tips you'l find in Electronic Resumes and Online Networking will give you a powerful edge in staying on top of your industry in an increasingly wired world. Best of all, Electronic Resumes and Online Networking is easy to understand and designed so you can put it to good use right away. Vast amounts of technical data and information are concentrated and simplified into the form of useful advice and step-by-step tutorials in a chatty, easy-to-understand style. There are no guarantees that you'll find the job of your dreams, but this comprehensive primer could well be the best start you can make toward the careful planning, strategic resume placement, and routine monitoring that are your best hope in securing sontinuous employment and career growth in a constantly evolving job marketplace. 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
Chameleon tables: using context information in everyday objects
Authors: Ted Selker, Ernesto Arroyo, Win Burleson
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

The Chameleon Table project created a set of hexagonal tables. They are modular and are able to snap together. The design portrays some goals that can be achieved by having a table that is aware of changes in its surroundings and includes this as part of its technology. By creating this infastructure, we have been able to make several scenarios including musical instruments, sending messages between tables, and menus that change with apparent use in a food scenario. This paper also shows the use of a network for broadcasting context information.
Digital Video on the PC
Authors: Tom Bunzel
Venue:  (1997)

:Most Windows users can now enter the exciting world of digital video production with only a few changes to their existing PCs. This book covers what the PC user can reasonably accomplish on this desktop computer platform, without having to obtain a completely dedicated--and expensive--digital video system. The author also includes extensive troubleshooting tips and techniques, and information on related Web sites.
A scalable mark-sweep garbage collector on large-scale shared-memory machines
Authors: Toshio Endo, Kenjiro Taura, Akinori Yonezawa
Venue: Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM) (1997)

This work describes implementation of a mark-sweep garbage collector (GC) for shared-memory machines and reports its performance. It is a simple ''parallel'' collector in which all processors cooperatively traverse objects in the global shared heap. The collector stops the application program during a collection and assumes a uniform access cost to all locations in the shared heap. Implementation is based on the Boehm-Demers-Weiser conservative GC (Boehm GC). Experiments have been done on Ultra Enterprise 10000 (Ultra Sparc processor 250 MHz, 64 processors). We wrote two applications, BH (an N-body problem solver) and CKY (a context free grammar parser) in a parallel extension to C++.Through the experiments, We observe that load balancing is the key to achieving scalability. A naive collector without load redistribution hardly exhibits speed-up (at most fourfold speed-up on 64 processors). Performance can be improved by dynamic load balancing, which exchanges objects to be scanned between processors, but we still observe that straightforward implementation severely limits performance. First, large objects become a source of significant load imbalance, because the unit of load redistribution is a single object. Performance is improved by splitting a large object into small pieces before pushing it onto the mark stack. Next, processors spend a significant amount of time uselessly because of serializing method for termination detection using a shared counter. This problem suddenly appeared on more than 32 processors. By implementing non-serializing method for termination detection, the idle time is eliminated and performance is improved. With all these careful implementation, we achieved average speed-up of 28.0 in BH and 28.6 in CKY on 64 processors.
An algorithm for piecewise linear approximations
Authors: James C. Pleasant
Venue: Proceedings of the 18th annual Southeast regional conference (1980)

An algorithm is described for approximating a function F(x) on a finite interval [a,b] whose second derivative is of constant sign on (a,b) by a continuous piecewise linear function, with any desired accuracy. Given a positive number &epsilon;, the algorithm finds a continuous piecewise linear functionL(x) = mi x + bi, xi-l &le; &times; &le; xi,i = 1,2 ...,nwhere a = xo < xl < ... < xn = b, such thatmax {|L(x) - F(x)|: xi-l &le; x &le; xi} &asymp; = &epsilon;for i = 1,2,...,n-l, and|L(x) - F(x)| &le; &epsilon;for xn-l &le; &times; &le; xn. In contrast to a method described by Phillips (1968), the derivative of F(x) is not used in the calculation of L(x). A computer implementation of the algorithm is discussed and an example of its use is provided.
Simply Simulation: an interactive CD-ROM-based approach for learning simulation concepts
Authors: Connie Nott, Graham Nott, C. Christopher Lee
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

The purpose of this paper is to introduce a new approach to teaching an introductory simulation course using an interactive CD-ROM titled "Simply Simulation". This method utilizes several multimedia tools and a hypertext based web format. The simulation literature currently shows no studies on this proposed new teaching method. Course structure, requirements, and benefits of Simply Simulation are described in this paper. Simply Simulation gives detailed explanations on simulation concepts and easy-to-follow instructions in five modules. The student uses Taylor II process simulation software to model and analyze progressively more complex real life situations. Competencies gained are measured via a pretest at the beginning of each module and a quiz at the end of each module. This paper and Simply Simulation contribute to the simulation education literature by exemplifying how to enhance the learning effectiveness by utilizing various information technologies and teaching methods.
Artificial neural network-based image pattern recognition
Authors: Hong Zhang, Jian Guan, Gwong C. Sun
Venue: Proceedings of the 30th annual Southeast regional conference (1992)

This paper addresses the use of a multi-layer fully-connected perceptron neural network for implementing a pattern recognizer. The input of the neural network is a set of seven standardized invariant moments in both the training procedure and recognition procedure. This standardization results in significantly increasing the accuracy of recognition. The neural network in this paper can recognize the shape of patterns regardless of the size, location or brightness. Images are captured and transformed to binary images through a global threshold technique. The weights of the network are computed using the back propagation algorithm. An example is given to demonstrate this neural network pattern recognizer.
The Enterprize Organization: Organizing Software Projects for Accountability and Success
Authors: Neal Whitten
Venue:  (1999)

In his latest book, Neal Whitten presents a highly practical guide to software project management, using a model that builds on the strengths of functional projectized and matrix organizations, while reducing or eliminating their weaknesses. You will recognize proven and familiar ways to define key roles and responsibilities, while also discovering exciting new organizational ideas for software projects. Throughout the book, Whitten shares lessons that have a profound impact on your ability to draw out project members and help them realize their full potential - while performing the same valuable function for yourself as project leader.
On category theory as a (meta) ontology for information systems research
Authors: Michael Johnson, C. N. G. Dampney
Venue: Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001 (2001)

Category theory is a branch of mathematics that is renowned for its semantic power despite its very simple axiom set. The use of category theory as a meta-ontology for abstract algebra via the highly developed field of universal algebra has suggested that it be used as a foundation for research in computing. To date it has been widely used in, inter alia, the definition of abstract data types, the semantics of programming languages, and the design of functional programming languages. This paper illustrates the use of category theory as a meta-ontology for information systems research. It is based on the authors' extensive consultancy work using category theory to solve real problems in industrial applications involving information systems. In addition to discussing the role of category theory as an ontological tool for information systems research, the paper illustrates its use with a number of examples including system specification, the definitions of views and view updates, and system interoperations.
Strategic warfare in cyberspace
Authors: Gregory J. Rattray
Venue:  (2001)

Rattray begins by analyzing salient features of information infrastructures and distinguishing strategic information warfare from other types of information-based competition, such as financial crime and economic espionage. He then establishes a conceptual framework for the successful conduct of strategic warfare in general, and of strategic information warfare in particular. Taking a historical perspective, he examines U.S. efforts to develop air bombardment capabilities in the period between World Wars I and II and compares them to U.S. efforts in the 1990s to develop the capability to conduct strategic information warfare. He concludes with recommendations for strengthening U.S. strategic information warfare defenses
Configurable development processes
Authors: John Cameron
Venue: Communications of the ACM (2002)

Keeping the focus on what is being produced.
Data Structures, Alorithms, and Applications in C++, 1st edition
Authors: Sartaj Sahni
Venue:  (1997)

:With several hundred exercises, examples, and applications, this is the algorithm analysis and code development handbook. Its a one-stop shop for reviews of performance measurement, C++ specific constructs, data structures, algorithm design methods and applications, and much more. 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
A case study in the performance and scalability of optimization algorithms
Authors: Steven J. Benson, Lois Curfman McInnes, Jorge J. Moré
Venue: ACM Transactions on Mathematical Software (TOMS) (2001)

We analyze the performance and scalabilty of algorithms for the solution of large optimization problems on high-performance parallel architectures. Our case study uses the GPCG (gradient projection, conjugate gradient) algorithm for solving bound-constrained convex quadratic problems. Our implementation of the GPCG algorithm within the Toolkit for Advanced Optimization (TAO) is available for a wide range of high-performance architectures and has been tested on problems with over 2.5 million variables. We analyze the performance as a function of the number of variables, the number of free variables, and the preconditioner. In addition, we discuss how the software design facilitates algorithmic comparisons.
Hypertext in the semantic web
Authors: Timothy Miles-Board, Simon Kampa, Leslie Carr, Wendy Hall
Venue: Proceedings of the 12th ACM conference on Hypertext and Hypermedia (2001)

The Semantic Web extends the current state of the Web with well-defined meaning. We advocate the use of ontological hypertext as an application of the Semantic Web to provide a principled and structured approach to navigating the resources on the Web. This paper demonstrates how we have applied this concept to two real-world scenarios.
VSE/SP and VSE/Esa: A Guide to Performance Tuning
Authors: Eugene S. Hudders
Venue:  (1993)

:Discusses performance areas and issues, VSE features available for tuning, adjusting the network (VTAM) and online program (CICS), VSAM tuning for batch and online data sets, input/output and virtual and control storage tuning. Packed with examples. 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
Remote Sensing Digital Image Analysis: An Introduction, 2nd edition
Authors: John A. Richards
Venue:  (1994)

:The book provides the non-specialist with an introduction to quantitative evaluation of satellite and aircraft derived from remotely retrieved data. Each chapter covers the pros and cons of digital remotely sensed data, without detailed mathematical treatment of computer based algorithms, but in a manner conductive to an understanding of their capabilities and limitations. Problems conclude each chapter.
Systems Architecture: Hardware and Software in Information Systems, 2nd edition
Authors: Stephen D. Burd
Venue:  (1998)

:This title offers a broad technical description of computer hardware and software for information systems (IS) students and professionals.
Dictionary of Computer and Internet Terms, 5th edition
Authors: Douglas D. Downing
Venue:  (1996)

:Approximately 1,700 key computer terms and their definitions are included in this edition with hundreds of words and expressins that apply specifically to the Internet. This pocket-sized reference offers help to prospective buyers who are mystified by hi-tech jargon. It also explains what computers do and how they work.
Resource usage analysis
Authors: Atsushi Igarashi, Naoki Kobayashi
Venue: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2002)

It is an important criterion of program correctness that a program accesses resources in a valid manner. For example, a memory region that has been allocated should be eventually deallocated, and after the deallocation, the region should no longer be accessed. A file that has been opened should be eventually closed. So far, most of the methods to analyze this kind of property have been proposed in rather specific contexts (like studies of memory management and verification of usage of lock primitives), and it was not so clear what is the essence of those methods or how methods proposed for individual problems are related. To remedy this situation, we formalize a general problem of analyzing resource usage as a resource usage analysis problem, and propose a type-based method as a solution to the problem.
Cache-oblivious priority queue and graph algorithm applications
Authors: Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

(MATH) In this paper we develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and deletemin operations in O(1 \over B logM/BN \over B) amortized memory transfers, where M and B are the memory and block transfer sizes of any two consecutive levels of a multilevel memory hierarchy. In a cache-oblivious data structure, M and B are not used in the description of the structure. The bounds match the bounds of several previously developed external-memory (cache-aware) priority queue data structures, which all rely crucially on knowledge about M and B. Priority queues are a critical component in many of the best known external- memory graph algorithms, and using our cache-oblivious priority queue we develop several cache- oblivious graph algorithms.
The Linux cookbook: tips and tecniques for everyday use
Authors: Michael Stutz
Venue:  (2001)

In the Linux Cookbook, you'll learn the best ways to use all the free software that comes with Linux to accomplish everyday tasks. The step-by-step recipes make it easy to use Linux to get things done.
Slaves of the Machine: The Quickening of Computer Technology
Authors: Gregory J. E. Rawlins
Venue:  (1997)

:In Moths to the Flame, Gregory J. E. Rawlins took lay readers on a tour of the exciting and sometimes scary world to which computers are leading us. His second book is for those who are new to computers and want to know what is "under the hood." It shows what computers can do for us and to us. Each of the six chapters asks a simple question: What are computers? How do we build them? How do we talk to them? How do we program them? What can't they do? Could they think? Written in an accessible, anecdotal form, Slaves of the Machine successfully demystifies the computer. Rawlins presents the birth of the computer, charts its evolution, and envisions its development in terms of the state of the art as of 1997 and into the future.
MPP solution of Rayleigh - B&eacute;nard - Marangoni flows
Authors: Graham F. Carey, Christophe Harle, Robert Mclay, Spencer Swift
Venue: Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM) (1997)

A domain decomposition strategy and parallel gradient-type iterative solution scheme have been developed and implemented for computation of complex 3D viscous flow problems involving heat transfer and surface tension effects. Special attention has been paid to the kernels for the computationally intensive matrix-vector products and dot products, to memory management, and to overlapping communication and computation. Details of these implementation issues are described together with associated performance and scalability studies. Representative Rayleigh- B&eacute;nard and microgravity Marangoni flow calculations on the Cray T3D are presented, and performance results verifying a sustained rate in excess of 16 gigaflops on 512 nodes of the T3D have been obtained. The work is currently being extended to the T3E and we have begun carrying out further performance benchmarks and scalability studies on this platform. Preliminary performance studies have recently been carried out and sustained rates above 50 gigaflops and 100 gigaflops have been achieved on the 512 node T3E-600 and 1024 node T3E-900 configurations respectively.