ppxscal/embedding_network huggingface dataset:
A brief overview of scalable distributed concurrency services for hierarchical locking
Authors: Nirmit Desai, Frank Mueller
Venue: Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande (2002)

As researchers share computational resources, such as objects in large distributed environments, it becomes difficult to achieve scalability of synchronization, and commonly used concurrency protocols currently lack scalability. Our peer-to-peer protocol enhances middleware concurrency services to provide scalability of synchronization enabling resource sharing and computing with distributed objects in systems with a large number of nodes.
Numerical Computation of Deflating Subspaces of Skew-Hamiltonian/Hamiltonian Pencils
Authors: Peter Benner, Ralph Byers, Volker Mehrmann, Hongguo Xu
Venue: SIAM Journal on Matrix Analysis and Applications (2002)

We discuss the numerical solution of structured generalized eigenvalue problems that arise from linear-quadratic optimal control problems, $H_{\infty}$ optimization, multibody systems, and many other areas of applied mathematics, physics, and chemistry. The classical approach for these problems requires computing invariant and deflating subspaces of matrices and matrix pencils with Hamiltonian and/or skew-Hamiltonian structure. We extend the recently developed methods for Hamiltonian matrices to the general case of skew-Hamiltonian/Hamiltonian pencils. The algorithms circumvent problems with skew-Hamiltonian/Hamiltonian matrix pencils that lack structured Schur forms by embedding them into matrix pencils that always admit a structured Schur form. The rounding error analysis of the resulting algorithms is favorable. For the embedded matrix pencils, the algorithms use structure-preserving unitary matrix computations and are strongly backwards stable, i.e., they compute the exact structured Schur form of a nearby matrix pencil with the same structure.
Effective Multithreading in OS/2
Authors: Len Dorfman, Marc J. Neuberger
Venue:  (1994)

:If you are a C, Windows, or systems programmer ready to unlock the powerful multitasking capabilities of IBM's hot OS/2 2.1 operating system, here is your key. This is the only OS.2 book devoted exclusively to multithreading, presenting all the tools and the ready-to-use source code you'll need to successfully integrate your application program with OS/2. Beginning with the basics of writing multithreaded programs and an overview of the massive OS/2 operating system, Effective Multithreading then moves to more complex demonstration programs and presents the OS/2 programmer's interface. The book then covers topics such as threads, priorities scheduling semaphores, queues, timers, and much more - everything you need for complete understanding! What's more, each topic is thoroughly explained and punctuated with heavily documented C source code. With more than 20 fully documented programs presented and an accompanying disk with complete program listings for all the source code, Effective Multithreading is a must-have for all programmers wishing to tap into OS/2's diversity.
Sams Teach Yourself Photoshop 7 in 24 Hours
Authors: Carla Rose
Venue:  (2002)

:In just 24 lessons of one hour or less, you will be up and running with Adobe Photoshop 7. Using a straightforward, step-by-step approach, each lesson builds upon the previous one, allowing you to learn the essentials of creating and editing images with Photoshop from the ground up.
Aggregation and comparison of trajectories
Authors: Nirvana Meratnia, Rolf A. de By
Venue: Proceedings of the 10th ACM international symposium on Advances in geographic information systems (2002)

Dealing with moving objects necessitates having available complete geographical traces for determining exact or possible locations that objects have had, have or will have. This is where trajectory determination plays an important role, and on which classification, aggregation and comparison methods must be built. The purpose of aggregation is to identify similar trajectories and to represent them by a single trajectory.Although much work has been done in similarity measurements for time series data, they mainly deal with one dimensional time series. On the other hand, they are good for short time series and in absence of noise, which is definitely not the case for moving objects. This paper describes different approaches to aggregate similar trajectories.
Web Wizard's Guide to Php
Authors: David Lash
Venue:  (2002)

:This book is a brief introduction to PHP that shows readers with little or no previous Web programming experience how to empower their Web sites with PHP This book requires no previous programming experience. It provides realistic full-color screen shots and code examples. Demonstrates all the basic PHP language features. Shows how to create surveys and order processing systems. Shows how to write PHP scripts that can save data into files on a Web server. This book is designed for readers with limited programming skills who want to learn to use PHP; as well as students taking a Web design course where PHP is used. 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
Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Venue: International Conference on Management of Data (1981)

The papers in these proceedings were contributed for presentation at the 1981 ACM International Conference on Management of Data, Ann Arbor, Michigan, April 29-May 1. The conference was sponsored by the Special Interest Group for Management of Data (SIGMOD) of the Association for Computing Machinery.In response to our call for papers, 93 full-length papers were submitted. Each paper was referred by at least two members of the program committee and evaluated according to its originality, readability, significance of contribution and relevance to the area of database management. The full program committee and the conference chairman met on January 17, 1981 and selected 25 papers based on the referee reports.The conference program also includes nine panel sessions. For future references, we list the titles and the chairpersons at the end of this volume.
Using QBASIC
Authors: Phil Feldman, Tom Rugg
Venue:  (1991)

:The perfect tutorial and reference for all levels of QBasic programmers!Hands-on instruction and practical programming samplesStep-by-step tutorials introduce essential QBasic conceptsIncludes a comprehensive reference and a keyword chart
Novell's ZENworks for Servers 2 Administrator's Handbook
Authors: Ron Tanner, Brad Dayley
Venue:  (2000)

:ZENworks for Servers is a new product from Novell that allows network administrators to manage all of the servers on a network from a single point of administration. This book shows how to install the product, configure it for specific networking needs, and troubleshoot it.
Addressing blocking and scalability in critical channel traversing
Authors: Rob Simmonds, Cameron Kiddle, Brian Unger
Venue: Proceedings of the sixteenth workshop on Parallel and distributed simulation (2002)

This paper presents two new versions of the Critical Channel Traversing (CCT) algorithm. CCT is a conservative parallel discrete event simulation algorithm that has been shown to achieve very high performance when used in a wide area computer network simulator. The first of the new algorithms called simple sender side CCT is similar to the original, but busy waiting is eliminated. Results presented show that simple sender side CCT avoids performance problems that can be caused by busy waiting.The second new algorithm called receive side CCT employs a different strategy for updating channel clocks and determining which objects should be scheduled on critical channels. Performance results show that this version provides better scaling with respect to the connectivity of the model, at the expense of some added complexity.
Computer graphics around the world: computer graphics in Hong Kong
Authors: Zhigeng Pan, Pheng-ann Heng, Rynson W. H. Lau
Venue: ACM SIGGRAPH Computer Graphics (2000)

Computer graphics has evolved to become an important discipline in both academia and industry, and an enabling technology for a broad variety of applications such as engineering (CAD, CAE and CAM), GIS, publishing and office applications. It can no longer be regarded as a confined discipline devoted solely to graphics standards or traditional techniques of 3D representations and rendering. The influence of computer graphics can be felt in almost all of today's key industrial areas, wherever computers are employed.Computer graphics has been a subject of interest in Hong Kong in recent years. Overviews of activities in China were presented in [18, 19] and in a special journal on computer graphics [20]. However, computer graphics activities in Hong Kong were not included in these materials, since all the papers mentioned above were published before July 1, 1997, when Hong Kong returned to China. Therefore, we present this article as a supplementary part to the two overviews, and try to give people an overall picture of computer graphics activities in China.
Hierarchical geometric models for visible-surface algorithms
Authors: James H. Clark
Venue: ACM SIGGRAPH Computer Graphics (1976)

The research described in this paper addresses the problems associated with the design of systems for efficiently producing computer-generated pictures and picture sequences of very complex, three-dimensional environments. The thesis of the research is that the geometric structure inherent in the definition of the shapes of three-dimensional objects and environments must be used not just to define their relative motion and placement but also to assist in solving many other problems of systems for producing pictures by computer.The implications are that by using an extension of traditional structure information, or a geometric hierarchy, five significant improvements to current techniques are possible. First, the range of complexity of an environment is greatly increased while the visible complexity of any given scene is kept within a fixed upper limit. Second, a meaningful way is provided to vary the amount of detail presented in a scene both according to the screen area occupied by the objects in the scene and according to camera and object motions. Third, by using the geometric hierarchy, "clipping" becomes a very fast logarithmic search for the resolvable parts of the environment within the field-of-view. Fourth, by using this positional hierarchy in conjunction with a storage hierarchy of the sort used in virtual memory computing systems, frame-to-frame coherence and clipping define a graphical "working set", or fraction of the total structure that should be present in primary store for immediate access by the visible-surface algorithms. Finally, the proposed structural framework suggests a new recursive descent visible-surface algorithm in which the computation time grows almost linearly with a scene's visible complexity rather than as a worse than linear function of its object-space complexity.
The Quattro Pro for Windows Book, 1st edition
Authors: Yvonne Johnson, Steven Cobb, Bryan Pfaffenberger
Venue:  (1993)

:This guide describes all the newest features of this popular spreadsheet for Windows. The author presents step-by-step instructions to give readers a fast start. There are plenty of clear examples that take readers from the basics to advanced commands and macros.
Differential Equations with Maple V with Cdrom, 2nd edition
Authors: Martha L. Abell, James P. Braselton
Venue:  (1999)

:This book is an indespensable tool for anyone using Maple V in computing ordinary and partial differential equations. Features: Updated to be completely compatible with Maple V, Release 5 Complete coverage of constructing and numerically computing ordinary and partial differential equations using Maple V New applications from engineering, physics, and biology Presentation of Maple V with respect to popular applications of mathematics Step-by-step instructions for all Maple V implementations Includes CD-ROM with all Maple V example code from book
Surviving without e-mail: effectively communicating & managing information during technology crises
Authors: Todd Krupa
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

Technology users continue perceiving telecommunications and computing systems as utilities. Just like water and electrical service, computer networks, e-mail and Web sites are expected to be available 24 hours a day, seven days a week without interruption. Although an uninterrupted expectation is unreasonable because system demands and requirements differ widely and maintenance is needed to ensure reliable operation, the reality remains that users demand services they have become reliant on. Underappreciated when operating flawlessly and over criticized when briefly unavailable, users' lack of understanding about how technology systems operate often results in speculation and uninformed commentary.When a critical failure beyond the control of Information & Access Technology Services struck the faculty and staff e-mail system at the University of Missouri-Columbia, restoring service wasn't the only challenge. About 7,000 users were affected by the service interruption, requiring a carefully coordinated and managed crisis communication effort. Tenuously opposed to IAT Services' commitment to restoring service as soon as possible was avoiding finger-pointing by revealing that the error resided with and was the responsibility of the e-mail system manufacturer. Regardless of the details, the campus community generally perceived and placed blame for the failure on IAT Services. Fixing the problem quickly was the remedy for easing flagging confidence and a tarnished image, however much of the solution was beyond the control of IAT Services.
Management Information Systems for the Information Age
Authors: Stephen Haag, Maeve Cummings, James Dawkins
Venue:  (1999)

:This text will fit best in an MIS course where students have to do a lot of hands-on,problem-solving projects,especially on the Internet. Haag works well for professors who want an interactive,engaging experience. If a professor has large classes or wants a way to get everyone involved (bus/non-business majors),this is the book for them. The overall content and organization of the book has been retained,providing a clearly focused overview of Information Systems. The Second Edition continues to cover Management Information Systems concepts with a different approach and organization of topics compared to traditional introductory I. S. books for example. Electronic Commerce and its effect on organizations is a major theme in this text,threaded through each chapter. The authors assume that students know a little about hardware and software and focus more on the way organizations use information systems. There are many sidebars,boxes,and examples pulled from real-world organizations and many individual and group projects for students to work on-tying theory to practice. This is perhaps our most practical,hands-on text.
Adaptive load control algorithms for 3rd generation mobile networks
Authors: Simin Nadjm-Tehrani, Kayvan Najarian, Calin Curescu, Tomas Lingvall, Teresa A. Dahlberg
Venue: Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems (2002)

In this paper we present strategies to deal with inherent load uncertainties in future generation mobile networks. We address the interplay between user differentiation and resource allocation, and specifically the problem of CPU load control in a radio network controller (RNC).The algorithms we present distinguish between two types of uncertainty: the resource needs for arriving requests and the variation over time with respect to user service policies. We use feedback mechanisms inspired by automatic control techniques for the first type, and policy-dependent deterministic algorithms for the second type. We test alternative strategies in overload situations. One approach combines feedback control with a pool allocation mechanism, and a second is based on a rejection-ratio-minimising algorithm together with a state estimator.A simulation environment and traffic models for users with voice, mail, SMS and web browsing sessions were built for the purpose of evaluation of the above strategies. Our load control architectures were tested in comparison with an existing algorithm based on the leaky bucket principle. The studies show a superior behaviour with respect to load control in presence of relative user priorities, and minimal rejection criteria. Moreover, our architecture can be tuned to future developments with respect to user differentiation policy.
Exact Boundary Controllability for the Linear Korteweg--de Vries Equation on the Half-Line
Authors: Lionel Rosier
Venue: SIAM Journal on Control and Optimization (2000)

This paper is concerned with the controllability of the linear Korteweg--de Vries equation on the domain $\O =(0,+\infty )$, the control being applied at the left endpoint x=0. It is shown that the {\em exact} boundary controllability holds true in $L^2(0,+\infty )$ provided that the solutions are not required to be in $L^{\infty }(0,T,L^2(0,+\infty ))$. The proof rests on a Carleman's estimate and an approximation theorem. A similar result is obtained for the heat equation and for the Schrödinger equation.
The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
Authors: Marcos Raydan
Venue: SIAM Journal on Optimization (1997)

The Barzilai and Borwein gradient method for the solution of large scale unconstrained minimization problems is considered. This method requires few storage locations and very inexpensive computations. Furthermore, it does not guarantee descent in the objective function and no line search is required. Recently, the global convergence for the convex quadratic case has been established. However, for the nonquadratic case, the method needs to be incorporated in a globalization scheme. In this work, a nonmonotone line search strategy that guarantees global convergence is combined with the Barzilai and Borwein method. This strategy is based on the nonmonotone line search technique proposed by Grippo, Lampariello, and Lucidi [SIAM J. Numer. Anal., 23 (1986), pp. 707--716]. Numerical results to compare the behavior of this method with recent implementations of the conjugate gradient method are presented. These results indicate that the global Barzilai and Borwein method may allow some significant reduction in the number of line searches and also in the number of gradient evaluations.
Building thematic lexical resources by term categorization
Authors: Alberto Lavelli, Bernardo Magnini, Fabrizio Sebastiani
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

We discuss the automatic generation of thematic lexicons by means of term categorization, a novel task employing techniques from information retrieval (IR) and machine learning (ML). Specifically, we view the generation of such lexicons as an iterative process of learning previously unknown associations between terms and themes (i.e. disciplines, or fields of activity). The process is iterative, in that it generates, for each ci in a set C = {c1,...,cm} of themes, a sequence Li0&sube; Li1&sube; ... &sube; Lin of lexicons, bootstrapping from an initial lexicon Li0 and a set of text corpora &THgr; = {&thgr;0,...,&thgr;n-1} given as input. The method is inspired by text categorization, the discipline concerned with labelling natural language texts with labels from a predefined set of themes, or categories. However, while text categorization deals with documents represented as vectors in a space of terms, term categorization deals (dually) with terms represented as vectors in a space of documents, and labels terms (instead of documents) with themes. As a learning device we adopt boosting, since (a) it has demonstrated state-of-the-art effectiveness in a variety of text categorization applications, and (b) it naturally allows for a form of "data cleaning", thereby making the process of generating a thematic lexicon an iteration of generate-and-test steps.
Fitting of a closed planar curve representing a profile of an archaeological fragment
Authors: Kateřina Hlaváčková-Schindler, Martin Kampel, Robert Sablatnig
Venue: Proceedings of the 2001 conference on Virtual reality, archeology, and cultural heritage (2001)

Motivated by the requirements of the present archaeology, we are developing an automated system for archaeological classification of ceramics. The basis for classification and reconstruction of ceramics is the profile, which is the cross-section of the fragment in the direction of the rotational axis of symmetry, and can be represented by a closed curve in the plane. This paper compares and combines several methods for interpolation and approximation of a closed curve by B--splines in the plane. The closed curve, representing the profile, is divided into several parts for which the most accurate method is selected. All the interpolation and approximation methods are compared on the provided data with respect to the achieved precision and 'complexity' of the curve description. The graphical output of the program suggests to the archaeologists, which combination of these methods gives the best representation of the reconstructed profile from the data under the smallest possible error and the simplest possible spline representation.
Networking Essentials MCSE Study Guide with Cdrom, 1st edition
Authors: Greg Bulette, Jason Nash
Venue:  (1998)

:Covers Exam 70-58 The Networking Essentials MCSE Study Guide is the ideal jumping-off point for aspiring network pros embarking on their Microsoft certification journey. Intended for MCSE candidates, as well as people simply looking for a better understanding of current network technology, Networking Essentials MCSE Study Guide focuses on the four pillars of modern networking - theoretical networks, network media and topology, connectivity, and administration and troubleshooting. The Networking Essentials MCSE Study Guide also has a comprehensive Resources section with supplemental information such as exam preparation tips, a guide to building your own network, and a Mini-Lab Manual. Plus, the exclusive CD-ROM features the Microsoft Professionals Key Tools for Success such as 30 sample exam questions handpicked by author and MCSE/MCT certified professional Jason Nash Microsoft Training and Certification Offline A complete, searchable, electronic version of the book Excerpts from MCSE Career Microsoft&reg;! and Windows NT&reg; 4.0 MCSE Study Guide An evaluation copy of Micro House Technical Library