ppxscal/embedding_network huggingface dataset:
Proceedings of the 30th annual ACM SIGUCCS conference on User services
Venue: User Services Conference (2002)

The Conference Planning Committee and Program Committee are pleased to present the Proceedings of the 30th Annual ACM SIGUCCS Fall Conference, Providence, Rhode Island, November 20-23, 2002. These Proceedings contain an abundance of experiences and ideas from IT service professionals like you who form the heart of our shared profession.Our theme, "Charting Bold Courses: New Worlds in User Services," symbolizes the change the user services world has taken in the past several years. The new User Services environment not only includes the traditional User Services roles, but now also encompasses Instructional Technologists, Media Specialists, Web Designers and Developers, Programmers and System Administrators - everyone providing end-user information technology support in a higher-educational environment. This year's program provides insight into many of these varied realms of information technology support.We wish to thank our authors, panelists, poster presenters, and the individuals on the Program Committee for their hard work and dedication in creating a program that addresses the broad interests of SIGUCCS attendees. We would also like to thank our keynote speakers, tutorial instructors, and session chairs, who help to make this conference successful. We trust that you will find this program enlightening and we hope that it will enable you to further develop your professional skills and share your experiences.
An almost surely optimal combined classification rule
Authors: Majid Mojirsheibani
Venue: Journal of Multivariate Analysis (2002)

We propose a data-based procedure for combining a number of individual classifiers in order to construct more effective classification rules. Under some regularity conditions, the resulting combined classifier turns out to be almost surely superior to each of the individual classifiers. Here, superiority means lower misclassification error rate.
Integrating independent components with on-demand remodularization
Authors: Mira Mezini, Klaus Ostermann
Venue: Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2002)

This paper proposes language concepts that facilitate the separation of an application into independent reusable building blocks and the integration of pre-build generic software components into applications that have been developed by third party vendors. A key element of our approach are on-demand remodularizations, meaning that the abstractions and vocabulary of an existing code base are translated into the vocabulary understood by a set of components that are connected by a common collaboration interface. This general concept allows us to mix-and-match remodularizations and components on demand.
Interfacing the IBM-PC to Medical Development: The Art of Serial Communication, 1st edition
Authors: R. W. Nickalls, R. Ramasubramanian
Venue:  (1995)

:As computerisation in the medical environment has increased, so the advantages of storage and computer analysis of data from various monitoring and measuring equipment have become well recognised. Most medical monitoring and measurement equipment now supports an RS-232 serial interface and therefore allows data to be accessed directly by computer as well as enabling the computer to have control in its turn over the monitoring equipment. This book describes the techniques used for interfacing a PC to a range of medical equipment used internationally in the areas of anaesthesia, intensive care, surgery, respiratory medicine and physiology. This essential practical information constitutes a valuable resource for a very broad audience of PC and measurement equipment users in the medical field.
MCSE: Proxy Server 2 Study Guide
Authors: Erik Rozell, Todd Lammle
Venue:  (1998)

:This Microsoft Certified Professional Approved Study Guide provides full coverage of each objective for the Implementing and Supporting Microsoft Proxy Server 1.0 exam, a popular elective for the MCSE certification. Practical exercises illustrate key procedures both for the exam and for configuring Proxy Server in real life. The book also contains information on Proxy Server 2.0, the new release. The CD includes a practice test for preparing for the MCSE exams and identifying weak areas requiring further study.
Open Source Linux Web Programming
Authors: Christopher A. Jones, Drew Batchelor
Venue:  (1999)

:Open Source Linux® Web Programming This complete toolbox of techniques shows you how to harness the open-source power of Linux  and create world-class Internet applications. Offering a step-by-step approach to building an e-commerce site, a human resources site, bringing corporate data online, and more, expert Web developers Christopher Jones and Drew Batchelor explain the complexities of 3-tier Web applications, distributed architecture, and object-oriented programming  and demonstrate how to use open source tools such as Perl, XML, and Java to build scalability, flexibility, and performance into your internet site. Working Solutions for Programming ChallengesGet an introduction to the complex Web architecture used in distributed systemsConfigure the Apache Web server for CGI useMaster Perl CGI libraries and modules  and their cross-platform capabilitiesSeparate HTML display content from CGI application logicOptimize the functionality of your Web applications with XMLModularize a Web site for hands-off administration by linking Perl componentsExpand your application by using Java Applets as a client-side resourceCreate an XML chat server for real-time collaborationAnalyze the deployment of a Linux application  including load-balancing hardware and scalability concernsOn the CD-ROM:XML Application ServerMicrostar Ælfred ParserKaffe Open Source Java Virtual MachinePostgreSQL 6.5And all sample codewww.idgbooks.comAuthor Biography: About the Authors Christopher A. Jones is the author of Unix Shell Objects. A seasoned Internet development consultant, hespecializes in interface development. His clients include Boeing, AT&T, Microsoft, and Planet 7 Technologies. Drew Batchelor is co-owner of Onstage Media, Inc., an Internet consulting company based in Pennsylvania, where he designs and develops commercial Web sites for corporations such as Harley Davidson, Analytical Graphics, and the Mudcat Café.
A New Merit Function and A Successive Quadratic Programming Algorithm for Variational Inequality Problems
Authors: Kouichi Taji, Masao Fukushima
Venue: SIAM Journal on Optimization (1996)

Recently, various merit functions for variational inequality problems have been proposed and their properties have been studied. Unfortunately, these functions may not be easy to evaluate unless the constraints of the problem have a relatively simple structure. In this paper, a new merit function for variational inequality problems with general convex constraints is proposed. At each point, the proposed function is defined as an optimal value of a quadratic programming problem whose constraints consist of a linear approximation of the given nonlinear constraints. It is shown that the set of constrained minima of the proposed merit function coincides with the set of solutions to the original variational inequality problem. It is also shown that this function is directionally differentiable in all directions and, under suitable assumptions, any stationary point of the function over the constraint set actually solves the original variational inequality problem. Finally, a descent method for solving the variational inequality problem is proposed and its convergence is proved. The method is closely related to a successive quadratic programming method for solving nonlinear programming problems.
Planning and information foraging theories and their value to the novice technical communicator
Authors: Lyn F. Gattis
Venue: Proceedings of the 20th annual international conference on Computer documentation (2002)

Two complementary cognitive theories help to explain how novice technical communicators learn effective search methods: information foraging theory, a model of information-seeking behavior that combines human-computer interaction with anthropological constructs; and strategic planning theory, a communication model of how humans plan and achieve social goals. The paper includes an extended example of how a new technical communicator might learn to use both models on the job.
Power conserving and access efficient indexes for wireless computing
Authors: Dik Lun Lee, Qinglong Hu, Wang-Chien Lee
Venue: Information organization and databases: foundations of data organization (2000)

In this paper, we introduce our research on power conserving and access efficient indexing techniques for wireless computing and revisit some of the pioneering work in this area. These indexing methods show that battery power consumption in mobile clients can be significantly reduced with some access time overhead. Among them, hybrid index is the best choice for improving power efficiency under both scenarios of single and multiple attributes based queries. Moreover, we introduce two access efficient indexing methods, cache schedule and integrated signature, for a wireless data dissemination system that incorporates both of broadcast and on-demand services.
Turing's World 3.0: An Introduction to Computability Theory
Authors: Jon Barwise, John Etchemendy
Venue:  (1993)

:A self-contained introduction to Turing machines, one of the fundamental notions of logic and computer science. The text and accompanying diskette allow the user to build, debug, and run sophisticated Turing machines in a graphical environment,
Unlocking OLAP with SQL Server 7 and Excel 2000 with CDROM, 1st edition
Authors: Wayne S. Freeze, Bill Ray
Venue:  (2000)

:This readable and concise guide teaches database administrators and power-user business professionals how to unlock the business intelligence buried in organizational databases using the latest data warehousing and decision support features of SQL Server 7 and Excel 2000. The CD-ROM includes a complete sample database and a 60-day trial version of SQL Server 7.
A Particle-Partition of Unity Method--Part II: Efficient Cover Construction and Reliable Integration
Authors: Michael Griebel, Marc Alexander Schweitzer
Venue: SIAM Journal on Scientific Computing (2001)

In this paper we present a meshfree discretization technique based only on a set of irregularly spaced points $x_i \in \mathbb R^d$ and the partition of unity approach. In this sequel to [M. Griebel and M. A. Schweitzer, SIAM J. Sci. Comput., 22 (2000), pp. 853--890] we focus on the cover construction and its interplay with the integration problem arising in a Galerkin discretization. We present a hierarchical cover construction algorithm and a reliable decomposition quadrature scheme. Here, we decompose the integration domains into disjoint cells on which we employ local sparse grid quadrature rules to improve computational efficiency. The use of these two schemes already reduces the operation count for the assembly of the stiffness matrix significantly. Now the overall computational costs are dominated by the number of the integration cells. We present a regularized version of the hierarchical cover construction algorithm which reduces the number of integration cells even further and subsequently improves the computational efficiency. In fact, the computational costs during the integration of the nonzeros of the stiffness matrix are comparable to that of a finite element method, yet the presented method is completely independent of a mesh. Moreover, our method is applicable to general domains and allows for the construction of approximations of any order and regularity.
Intelligent Agents for Telecommunications Applications: Basics, Tools, Languages and Applications, 1st edition
Authors: H. Veldhuijsen, Sahin Albayrak
Venue:  (1998)

:Intelligent agent and distributed AI (DAI) approaches attach specific conditions to cooperative exchanges between intelligent systems, that go far beyond simple functional interoperability. Ideally, systems that pursue local or global goals, coordinate their actions, share knowledge, and resolve conflicts during their interactions within groups of similar or dissimilar agents can be viewed as cooperative coarse-grained systems. The infrastructure of telecommunications is a world in transition. There are a number of trends that contribute to this: convergence of traditional telephony and data network worlds, blurring of boundaries between public and private networks, complementary evolution of wireline, wireless, and cable network infrastructures, the emergence of integrated broadband multimedia networks and, of course, the information superhighway. Up to now, despite the effort that has gone into this area, the field of intelligent agents research has not yet led to many fielded systems. Telecommunications applications pose strong requirements to agents such as: reliability, real-time performance, openness, security management and other integrated management, and mobility. In order to fulfil their promise, intelligent agents need to be fully dependable and typically require an integrated set of capabilities. This is the challenge that exists for intelligent agents technology in this application domain.
A new heavy-tailed discrete distribution for LRD M/G/&#x221E; sample generation
Authors: A. Su&#x00E1;rez-Gonz&#x00E1;lez J. C. L&#x00F3;pez-Ardao C. L&#x00F3;pez-Garc&#x00ED;a M. Fern&#x00E1;ndez-Veiga R. Rodr&#x00ED;guez-Rubio M. E. Sousa-Vieira
Venue: Performance Evaluation (2002)

Several traffic measurement reports have convincingly shown the presence of self-similarity at the packet level in current networks, inducing as a result a revolution in the stochastic modeling of traffic. The essence of this behavior can be adequately captured by several classes of self-similar stochastic processes. But the use of these in performance analysis has opened new problems and research issues, also in simulation studies where the efficient generation of synthetic sample paths with self-similar properties is one of the fundamental concerns. In this paper, we present a flexible and efficient generator of self-similar traces, based on a simple M/G/∞ model which uses a new heavy-tailed discrete distribution.
Math Fun with a Pocket Calculator
Authors: Rose Wyler, Mary Elting
Venue:  (1992)

:Calculators are not just for solving homework problems--they are an invention for having fun! Spiced with riddles, down-side uppers, and teasing tidbits from history, this book and your calculator are sure to give you hours of fun--math fun, that is!
Resource-adaptive interactive 3D maps
Authors: Volker Coors
Venue: Proceedings of the 2nd international symposium on Smart graphics (2002)

This paper describes the concept of using importance information of objects in order to enable a resource-adaptive visualization of interactive three-dimensional maps in a distributed environment. The map will be automatically created from a spatial database taking into account the rendering capabilities of the client, the available bandwidth and the users interest.
Blocking Semiovals of Type (1,m+1,n+1)
Authors: Lynn M. Batten, Jeremy M. Dover
Venue: SIAM Journal on Discrete Mathematics (2001)

We consider the existence of blocking semiovals in finite projective planes which have intersection sizes 1, m+1 or n+1 with the lines of the plane for $1 \leq m < n$. For those prime powers $q \leq 1024$, in almost all cases, we are able to show that, apart from a trivial example, no such blocking semioval exists in a projective plane of order q. We are also able to prove, for general q, that if q2+q+1 is a prime or three times a prime, then only the same trivial example can exist in a projective plane of order q.
A graphics editor for labanotation
Authors: Maxine D. Brown, Stephen W. Smoliar
Venue: ACM SIGGRAPH Computer Graphics (1976)

There is a need for a simple mechanized way to design, update and produce final copies of scores of Labanotation, a symbolic, graphical language for the recording of body movement used by choreographers, anthropologists, psychologists and therapists. This paper discusses the design and implementation of a machine-independent data structure for Labanotation and its application in an interactive storage, retrieval and editing system.
Reinventing support services: transcending the centralized-decentralized support model debate
Authors: Kathleen Cummings
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

Over the course of seven years, Tufts University alternated between a centralized and decentralized IT model. The centralized model seemed to produce charges that the IT organization was not responsive to local needs; alternately, the decentralized model produced redundancies and inefficiencies. This year Tufts moved away from the centralized-decentralized dilemma. Accepting that any model would have drawbacks, Tufts reinvented support--not as a structure--but as a collaborative service. Building bridges among IT organizations and levels of support, Tufts has transcended the old dilemma with a new support paradigm. A seven-person support team is funded by the central IT organization but 'lives' in the University's local units. Each member reports in each week, collaborating on projects and sharing information. A technical support manager oversees the group, insuring that University-wide services are rolled out with attention to local needs and with consistent deadlines. Each team member also serves as a liaison to a third-tier support group, facilitating the exchange of information and often identifying potential support quagmires before they occur. Text pagers and the University's enterprise help desk software application connect the team when they are in the field. The group also takes part in, and often leads, educational programs for local IT support personnel. The result is a collaborative support team that appreciates local interest and facilities broad University IT needs.
Symplectic Balancing of Hamiltonian Matrices
Authors: Peter Benner
Venue: SIAM Journal on Scientific Computing (2000)

We discuss the balancing of Hamiltonian matrices by structure preserving similarity transformations. The method is closely related to balancing nonsymmetric matrices for eigenvalue computations as proposed by Osborne [J. ACM, 7 (1960), pp. 338--345]and Parlett and Reinsch [Numer. Math., 13 (1969), pp. 296--304] and implemented in most linear algebra software packages. It is shown that isolated eigenvalues can be deflated using similarity transformations with symplectic permutation matrices. Balancing is then based on equilibrating row and column norms of the Hamiltonian matrix using symplectic scaling matrices. Due to the given structure, it is sufficient to deal with the leading half rows and columns of the matrix. Numerical examples show that the method improves eigenvalue calculations of Hamiltonian matrices as well as numerical methods for solving continuous-time algebraic Riccati equations.
Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects
Authors: Immanuel M. Bomze
Venue: SIAM Review (2002)

In this paper, links are established between optimality conditions for quadratic optimization problems, qualitative properties in the nonlinear selection replicator dynamics, and central solution concepts of evolutionary game theory, with particular emphasis on several regularity conditions that are desirable in any of the three fields mentioned above: as strictness conditions for locally optimal solutions, as hyperbolicity conditions for fixed points, and as quasi-strictness conditions for game equilibria.
e-Learning: making it happen now
Authors: Stephen Tucker, Andrew Pigou, Thom D. Zaugg
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

In this paper, we describe how to get started using e-learning on a limited budget and with limited know how, where to find content and how to meet your learners needs.
Building Cisco Remote Access Networks
Authors: Cisco Systems
Venue:  (1999)

:Building Cisco Remote Access Networks offers detailed and concise solutions for working with remote access networks. Configuration examples demonstrate management and troubleshooting techniques. Step-by-step configuration and troubleshooting lists walk you though remote access network set-up and management. In-depth discussions teach you how to maintain and scale a remote access network. Finally, chapter-ending questions help you assess your understanding of key concepts and start you down the path for attaining your CCNP certification.
Microsoft Visual Basic: Developer's Workshop with Cdrom, 5th edition
Authors: John Clark Craig, Jeff Webb
Venue:  (1998)

:In Microsoft Visual Basic 6.0 Developer's Workshop, Fifth Edition, you'll find a concise introduction to version 6.0 right up front - learning how these new capabilities can power up projects with greater efficiency and functionality. You'll also discover smart solutions to a wide range of specific, How do I do that? questions. Plus, you get a toolbox full of ready-to-use source code, projects, forms, and files on CD-ROM.
ERQ: controlled inference and instruction techniques for DBMS query languages
Authors: J Longstaff
Venue: Proceedings of the 1982 ACM SIGMOD international conference on Management of data (1982)

This paper describes certain aspects of the Entity Relationship Query Interface (ERQ) which is being implemented as part of a Distributed Data-base Research programme. A major objective of ERQ is to teach naive users the fundamental concepts of the Entity Relationship (ER) and Relational Data Models, and also how to use a Relational Query Language. This is achieved by providing a range of user modes, with progression through the modes as the user gains in experience. The methods used to teach system facilities (namely teaching displays, help messages) and discovering database semantics (using functional decomposition --- ER descriptions) are presented. We also discuss the ERQ Controlled Inference facility, by which the user instructs the system to make limited inferences connected with the ER model description during query formulation. The results of inferences are displayed as system generated Natural Language sentences, which are used to validate query specifications.
OOP: Building Reusable Components with Microsoft® Visual Basic® .Net
Authors: Kenneth L. Spencer, Tom Eberhard, Rick Culpepper
Venue:  (2002)

Discover how to design and build powerful, component-based applications quickly with Visual Basic .NET! The Microsoft .NET Framework collection of classes and technologies dramatically shortens development cycles and reduces development costs. Find out how to take advantage of this new development environment with this hands-on primer about writing Visual Basic .NET components, using the principles of object-oriented programming. It's full of proven, real-world strategies that'll help you get more out of your scarce coding resources. You'll discover how to design and build powerful applications of almost any size quickly from reusable, shared components that you can create with Visual Basic .NET-or adapt from the samples included with the book. You'll learn about the latest changes to the language as well as the features that .NET brings to the development process. You'll also learn how to construct a rich, object-oriented architecture that simplifies the creation of complex business applications from reusable components.
XML programming: Web applications and Web services with JSP and ASP
Venue:  (2002)

XML Programming: Web Applications and Web Services with JSP and ASP provides a fast-moving introduction to the XML family of technologies for programmers. Although written with a focus upon JSP- and ASP-based XML solutions, the book presents the material from a language-independent point of view that benefits all developers, whatever their language. The code is written to be readable by all.