ppxscal/embedding_network huggingface dataset:
Using an adapted grounded theory approach for inductive theory building about virtual team development
Authors: Suprateek Sarker, Francis Lau, Sundeep Sahay
Venue: ACM SIGMIS Database (2000)

This paper outlines how the grounded theory methodology was adapted to develop a process model of collaboration in virtual teams. The data analysis was conducted using an adapted version of open coding, axial coding, and selective coding procedures offered by Strauss and Corbin (1990). In applying the grounded theory procedures, the objective was to stay true to the goals and spirit of each coding procedure, while modifying details of procedural steps that were too mechanistic or impractical. The paper develops a meta-theoretical framework through a synthesis of the data, the symbolic interactionist perspective, and structuration theory. This framework is an alternative to the "paradigm model" during selective coding of data.
Military logistics: simulation-based acquisition: an impetus for change
Authors: Wayne J. Davis
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

The military has recently introduced simulation-based acquisition where simulation technologies would be applied throughout all phases of system design, development, production and deployment. Originally, a four-phase approach was defined to reflect the sequential steps occurring from the initial conceptualization of the system to its eventual deployment. In this paper, the acquisition process is redefined as a collection of concurrent functions that may be iteratively implemented throughout the acquisition process. Potential applications for simulation in this enhanced acquisition process are discussed. In addition, the need for further simulation development is conveyed.
Prototype implementations for a universal remote console specification
Authors: Gottfried Zimmermann, Gregg Vanderheiden, Al Gilman
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

A 'Universal Remote Console' (URC) is a personal device that can be used to control any electronic and information technology device (target device/service), such as thermostats, TVs, or copy machines. The URC renders the user interface (UI) of the target device in a way that accommodates the user's preferences and abilities. This paper introduces the efforts of user groups, industry, government and academia to develop a standard for 'Alternate Interface Access' within the V2 technical committee of the National Committee for Information Technology Standards (NCITS). Some preliminary design aspects of the standard in work are discussed shortly.
Palm OS network programming: writing connected applications for the Palm OS
Venue:  (2001)

The book details all the major concepts needed to develop in the Palm networking area. Examples are provided in both of the two major development environments: Metrowerks CodeWarrior and GCC. Though no network experience is assumed, the book will be most valuable to developers, who have written Palm applications in C. The Palm Net Library is essential to any network application development. This book provides a detailed examination of the Library and offers sample networking applications to illustrate how to make the best of this essential tool.
Analysis of Structural Systems, 1st edition
Authors: John F. Fleming
Venue:  (1996)

:This book is intended to be used in a set of introductory courses dealing with the analysis of statically determinate and statically indeterminate structures. These courses normally consist of a two-term sequence taught at the junior level in most civil engineering programs.
Twenty years of eye typing: systems and design issues
Authors: Päivi Majaranta, Kari-Jouko Räihä
Venue: Proceedings of the 2002 symposium on Eye tracking research & applications (2002)

Eye typing provides a means of communication for severely handicapped people, even those who are only capable of moving their eyes. This paper considers the features, functionality and methods used in the eye typing systems developed in the last twenty years. Primary concerned with text production, the paper also addresses other communication related issues, among them customization and voice output.
An algorithm for optimal decoupling capacitor sizing and placement for standard cell layouts
Authors: Haihua Su, Sachin S. Sapatnekar, Sani R. Nassif
Venue: Proceedings of the 2002 international symposium on Physical design (2002)

With technology scaling, the trend for high performance integrated circuits is towards ever higher operating frequency, lower power supply voltages and higher power dissipation. This causes a dramatic increase in the currents being delivered through the on-chip power grid and is recognized in the International Technology Roadmap for Semiconductors as one of the difficult challenges. The addition of decoupling capacitances (decaps) is arguably the most powerful degree of freedom that a designer has for power-grid noise abatement and is becoming more important as technology scales. In this paper, we propose and demonstrate an algorithm for the automated placement and sizing of decaps in ASIC-like circuits. The adjoint sensitivity method is applied to calculate the first-order sensitivity of the power grid noise with respect to every decap. We propose a fast convolution technique based on piecewise linear (PWL) compressions of the original and adjoint waveforms. Experimental results show that power grid noise can be significantly reduced after a judicious optimization of decap placement, with little change of the total chip area.
Cloning parallel simulations
Authors: Maria Hybinette, Richard M. Fujimoto
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2001)

We present a cloning mechanism that enables the evaluation of multiple simulated futures. Performance of the mechanism is analyzed and evaluated experimentally on a shared memory multiprocessor. A running parallel discrete event simulation is dynamically cloned at decision points to explore different execution paths concurrently. In this way, what-if and alternative scenario analysis can be performed in applications such as gaming or tactical and strategic battle management. A construct called virtual logical processes avoids repeating common computations among clones and improves efficiency. The advantages of cloning are preserved regardless of the number of clones (or execution paths). Our performance results with a commercial air traffic control simulation demonstrate that cloning can significantly reduce the time required to compute multiple alternate futures.
Workshop: Creating and refining knowledges, identities, and understandings in on-line communities
Authors: Michael J. Muller, David R. Millen
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

This two-day workshop examines the ways that on-line communities create and refine their shared resources, in-cluding both the formal and observable artifacts (docu-ments, chats, threads) and the less tangible conventions, roles, and identities in the community.
When Economics Means Business: The new economics of the information age
Authors: Sultan Kermally
Venue:  (1998)

:There is a need to replace land, labour, capital and enterprise as factors of production by competence, customers and knowledge. In When Economics Means Business, Sultan Kermally drags economics by the scruff of its neck into the Information Age in which we all live. 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 Complete Idiot's Guide to Online Medical Resources
Authors: Joan Price
Venue:  (2000)

:The Complete Idiot's Guide to Online Medical Resources shows readers how to find, evaluate, and productively use medical information in many areas, including: pregnancy, cancer, heart disease, depression, AIDS, prescriptions, surgery, sexuality, alternative medicine, hospitals, and others. Joan Price guides you to discover the best online medical resources. A reoccurring theme steers you away from scams, frauds, misleading advice, and towards respectable, credible resources, by showing you how to tell the difference. 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
MSN.com for Dummies, 1st edition
Authors: Doug Lowe
Venue:  (1999)

:Any Internet user can benefit from Microsoft Network's free search capabilities, e-mail services, and quick links to popular online destinations. In this easy-to-use reference, best-selling technology author Doug Lowe guides readers through the tools and services designed to make msn.com their one-stop resource for almost any online need.
Building efficient wireless sensor networks with low-level naming
Authors: John Heidemann, Fabio Silva, Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin, Deepak Ganesan
Venue: Proceedings of the eighteenth ACM symposium on Operating systems principles (2001)

In most distributed systems, naming of nodes for low-level communication leverages topological location (such as node addresses) and is independent of any application. In this paper, we investigate an emerging class of distributed systems where low-level communication does not rely on network topological location. Rather, low-level communication is based on attributes that are external to the network topology and relevant to the application. When combined with dense deployment of nodes, this kind of named data enables in-network processing for data aggregation, collaborative signal processing, and similar problems. These approaches are essential for emerging applications such as sensor networks where resources such as bandwidth and energy are limited. This paper is the first description of the software architecture that supports named data and in-network processing in an operational, multi-application sensor-network. We show that approaches such as in-network aggregation and nested queries can significantly affect network traffic. In one experiment aggregation reduces traffic by up to 42% and nested queries reduce loss rates by 30%. Although aggregation has been previously studied in simulation, this paper demonstrates nested queries as another form of in-network processing, and it presents the first evaluation of these approaches over an operational testbed.
Professional Style Sheets for HTML and XML
Authors: Frank Boumphrey
Venue:  (1998)

:This book is for the discerning and forward thinking web developer. One who recognises the limitations of plain HTML and wants to take full advantage of technological advancements such as CSS and XSL to create the most attractive, information packed and yet totally user friendly real world web pages. It assumes a basic understanding of HTML but requires no experience of XML.
Taming the wild netfilter
Authors: David A. Bandel
Venue: Linux Journal (2001)

iptables, ipchains--what's the difference?
Electronic Mail, 1st edition
Authors: Jacob Palme
Venue:  (1995)

:This book gives a thorough overview of the historical , technical, and social aspects of electronic mail. It provides instant access to information about group communication via distribution lists, bulletin board systems, and computer conference systems  methods of communication that are profoundly changing office environments and creating new, more efficient ways of doing business. Includes comprehensive coverage of the e-mail market, ethical and legal aspects, the latest research, and X.400 and Internet mail standards.
SmartSuite 97: Fast and Easy
Authors: Sharon Podlin
Venue:  (1997)

:There's no need to feel overwhelmed by the many features of SmartSuite 97. From creating a simple document to creating a database, users feel comfortable with Prima's SmartSuite97 Fast & Easy guide.
Windows 2000 Server Architecture and Design
Authors: Morten Strunge Nielsen
Venue:  (1999)

:Teaches how to set up Server 2000 from scratch or how to fit it into an existing infrastructure, plus how to test it once it's ready to go. Details how to work with Active Directory features such as domains, replication, namespace, directory schema, LDAP, naming conventions, and more! Provides real-life examples from the design phase to actual implementation. Covers DNS interoperability, security, physical infrastructure, directory synchronization, and traffic load. Highlights features of the migration to Windows Server 2000 from other environments, such as Netware and past versions of NT. Written by the author of (and as a follow-up to) the highly acclaimed NT 5: The Next Revolution (isbn: 1-57610-288-2). Dives headfirst into the messy details behind this much anticipated server and helps to prepare managers and administrators to actually use it. Provides an in-depth, objective, and independent perspective of leading industry operating systems issuesnot the Microsoft view. Handy charts, check lists, and tables to help readers find information quickly and easily. 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
Fair Circulation of a Token
Authors: Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Suppose that a distributed system is modeled by an undirected graph G = (V,E), where V and E, respectively, are the sets of processes and communication links. Israeli and Jalfon proposed a simple self-stabilizing mutual exclusion algorithm: A token is circulated among the processes (i.e., vertices) and a process can access the critical section only when it holds the token. In order to guarantee equal access chance to all processes, the token circulation is desired to be fair in the sense that all processes have the same probability of holding the token. However, the Israeli-Jalfon token circulation scheme does not meet the requirement. This paper proposes a new scheme for making it fair. We evaluate the average of the longest waiting times in terms of the cover time and show an O({\rm deg}(G)n^2) upper bound on the cover time for our scheme, where n and {\rm deg}(G) are the number of processes and the maximum degree of G, respectively. The same (tight) upper bound is known for the Israeli-Jalfon scheme.
S-HARP: a scalable parallel dynamic partitioner for adaptive mesh-based computations
Authors: Andrew Sohn, Horst Simon
Venue: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM) (1998)

Computational science problems with adaptive meshes involve dynamic load balancing when implemented on parallel machines. This dynamic load balancing requires fast partitioning of computational meshes at run time. We present in this report a scalable parallel dynamic partitioner, called S-HARP. The underlying principles of S-HARP are the fast feature of inertial partitioning and the quality feature of spectral partitioning. S-HARP is a universal dynamic partitioner with three distinctive features: (a) fast partitioning from scratch with a global view, requiring no information from the previous iterations, (b) no restriction on the issue of one partition per processor, (c) no imbalance factor issue because of precise bisection using sorting. Two types of parallelism have been exploited in S-HARP, fine-grain loop-level parallelism and coarse-grain recursive parallelism. The parallel partitioner has been implemented in Message Passing Interface on Cray T3E and IBM SP2 for portability. Experimental results indicate that S-HARP can partition a mesh of over 100,000 vertices into 256 partitions in 0.18 seconds on a 64-processor Cray T3E. S-HARP is much more scalable than other dynamic partitioners, giving over 17-fold speedup on 64 processors while ParaMeTiS1.0 gives a few-fold speedup. Experimental results demonstrate that S-HARP is three to 15 times faster than the other dynamic partitioners on computational meshes of size over 100,000 vertices while giving comparable edge cuts.
Computer graphics animation of the Tellico Reservoir water temperature simulation
Authors: William L. Reid,  III, Dalpha R. Stubblefield
Venue: Proceedings of the 20th annual Southeast regional conference (1982)

A color computer graphics animation movie was developed to illustrate simulated water temperatures in Tellico Reservoir. Movie depicts March through October of a typical annual cycle in five minutes of animation. A FORTRAN program used DISSPLA software and an Information International FR 80 graphic recorder to produce a 16 mm color, silent movie. Displayed data were taken from the results of a two-dimensional hydrodynamic computer model.
Outlook 98 - Win 95/NT
Authors: Barcharts
Venue:  (1999)

:This is a completely new title for Microsoft's hot new update to the popular Outlook 97 e-mail, contact and appointment manager. Every topic covered in our Outlook 97 chart is also included in this one; plus working with the Outlook Today feature, keyboard shortcuts, and working with the Outlook Journal. 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
Administrative scope and role hierarchy operations
Authors: Jason Crampton
Venue: Proceedings of the seventh ACM symposium on Access control models and technologies (2002)

The ARBAC97 model makes an important contribution to the understanding and modeling of administration in role-based access control. However, there are several features of the model which we believe could be improved. We introduce the concept of administrative scope in a role hierarchy and show how this can be used to control updates to the hierarchy. We then incrementally develop a model for administering the role hierarchy and compare it to the RRA97 sub-model of ARBAC97. We conclude that our model offers significant advantages over RRA97.
Switching Theory for Logic Synthesis, 1st edition
Authors: Tsutomu Sasao
Venue:  (1999)

:Switching Theory for Logic Synthesis covers the basic topics of switching theory and logic synthesis in fourteen chapters. Chapters 1 through 5 provide the mathematical foundation. Chapters 6 through 8 include an introduction to sequential circuits, optimization of sequential machines and asynchronous sequential circuits. Chapters 9 through 14 are the main feature of the book. These chapters introduce and explain various topics that make up the subject of logic synthesis: multi-valued input two-valued output function, logic design for PLDs/FPGAs, EXOR-based design, and complexity theories of logic networks.An appendix providing a history of switching theory is included. The reference list consists of over four hundred entries.Switching Theory for Logic Synthesis is based on the author's lectures at Kyushu Institute of Technology as well as seminars for CAD engineers from various Japanese technology companies.Switching Theory for Logic Synthesis will be of interest to CAD professionals and students at the advanced level. It is also useful as a textbook, as each chapter contains examples, illustrations, and exercises.
Defending AI Research: A Collection of Essays and Reviews
Authors: John McCarthy
Venue:  (1996)

:John McCarthy is known for the invention of LISP and time-sharing as well as the coining of Artificial Intelligence and the founding of the AI laboratory at Stanford University. He staunchly defends the importance of Artificial Intelligence research in this collection of reviews. 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 End of Patience: Cautionary Notes on the Information Revolution
Authors: David Shenk
Venue:  (1999)

:In this new collection of essays, David Shenk expands his enlightened skepticism to include thoughts on the dangers of online journalism, the ethical implications of digital photography, and the misguided hopes for computers in the classroom.. "Is Shenk just another neo-Luddite determined to bash all things digital? Hardly. This self-described technology enthusiast - and avid fan of the Internet - is simply interested in clear-eyed analysis of how machines we use actually affect our lives. As one of the founders of the Technorealism movement, he insists that new technologies must be appraised for their ability to achieve traditional human ends, rather than embraced merely for novelty's sake. 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
Applying high-level language paradigms to distributed systems
Authors: Ellen H. Siegel
Venue: Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring (1992)

We demonstrate the benefits of applying high-level language paradigms to the design and implementation of communications software for distributed systems. We focus on a set of language mechanisms including modularity and first class functions. We discuss three case studies: a remote procedure call system, a distributed Linda system, and a protocol processing system. The qualitative and quantitative benefits of such a structured use of high-level language mechanisms are analyzed and applied as the basis of a programming methodology for distributed systems,
PC Graphics Unleashed, 1st edition
Authors: Brad Pillow
Venue:  (1994)

:This book offers tips and strategies for producing impressive graphic effects using the PC. With the 16-page full-color insert, readers can see the captivating graphics that can be created.Demonstrates various graphics programming techniques, including advanced morphing, 3-D modeling, and digital image manipulationTeaches general algorithms used by professional graphics programmersCD-ROM contains various graphics images featured in the book 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
Query localization techniques for on-demand routing protocols in ad hoc networks
Authors: Robert Castañeda, Samir R. Das, Mahesh K. Marina
Venue: Wireless Networks (2002)

Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. We propose a technique that can reduce the routing overhead even further. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Our technique utilizes prior routing histories to localize the query flood to a limited region of the network. Simulation results demonstrate excellent reduction of routing overheads with this mechanism. This also contributes to a reduced level of network congestion and better end-to-end delay performance of data packets.