ppxscal/embedding_network huggingface dataset:
Microcomputer Hardware, Software, and Troubleshooting for Engineering and Technology with Cdrom, 1st edition
Authors: James L. Antonakos, Kenneth C. Mansfield
Venue:  (2000)

:This book provides a detailed, yet straightforward treatment of all facets of microcomputer hardware, software, and troubleshooting. Features Joe Tekk situational examples that demonstrate how a typical computer technician encounters many types of microcomputer-related problems and applications. An accompanying CD-ROM provides examples. Using the Instructional System. Laboratory Familiarization. Electrical and Mechanical Safety. Hand Tool Identification and Usage. Microcomputer Familiarization. Electrical Component Identification. Integrated Circuit Insertion and Removal. Soldering and Desoldering Techniques. Computer Environments. System Teardown and Assembly. Power Supplies. Floppy Disk Drives. The Motherboard Microprocessor and Coprocessor. The Motherboard Memory. Motherboard Expansion Slots. Power On Self-Test (POST). Motherboard Replacement and Setup. Hard Disk Fundamentals. Hard Drive Backup. Hard Disk Replacement and File Recovery. Video Monitors and Video Adapters. The Computer Printer. Keyboards and Mice. Telephone Modems. CDROM and Sound Card Operation. Multimedia Devices. Network Hardware. An Overview of Windows 3.x. An Introduction to Windows. The Windows Desktop. The Control Panel. Windows Explorer. Managing Printers. Accessories. An Introduction to Networking with Windows. Installing New Software. Installing New Hardware. Windows NT Domains. A Typical Windows Computer. Intel Pentium Processor Architecture. An Introduction to Assembly Language. Hardware and Software Interrupts. The Advanced Intel Microprocessors. A Detailed Look at the System BIOS. Windows Internal Architecture. Computer Viruses. Setting up a Repair Shop. For any technology-oriented readerwho wants to learn about the intricacies of computers.
All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
Authors: Wai-Kau Lo, Vassos Hadzilacos
Venue: SIAM Journal on Computing (2000)

A wait-free hierarchy ACM Transactions on Programming Languages and Systems, 11 (1991), pp. 124--149; Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, 1993, pp. 145--158] classifies object types on the basis of their strength in supporting wait-free implementations of other types. Such a hierarchy is robust if it is impossible to implement objects of types that it classifies as "strong" by combining objects of types that it classifies as "weak." We prove that if nondeterministic types are allowed, the only wait-free hierarchy that is robust is the trivial one, which lumps all types into a single level. In particular, the consensus hierarchy (the most closely studied wait-free hierarchy) is not robust. Our result implies that, in general, it is not possible to determine the power of a concurrent system that supports a given set of primitive object types by reasoning about the power of each primitive type in isolation.
Lessons from the Cyberspace Classroom: Realities of Online Teaching, 1st edition
Authors: Rena M. Palloff, H. Keith Pratt
Venue:  (2001)

:While there are many guidebooks available on distance learning, there are still few credible resources for developing an effective online course. In Lessons from the Cyberspace Classroom, authors Rena Palloff and Keith Pratt--both acknowledged experts in the field of developing online learning communities--provide an easy-to-use reference to nearly every aspect of online teaching and learning.
Managing undergraduate CS research
Authors: James W. McGuffee, Herbert L. Dershem, Linda B. Lankewicz, Gary Lewandowski, Dian Lopez, Oberta A. Slotterbeck
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

The focus of this panel is the role of computer science faculty in the undergraduate research process. The panel participants will share their personal experiences to highlight different approaches in developing and encouraging undergraduate computer science research.
Understanding Object-Oriented Programming with Java, 2nd edition
Authors: Timothy Budd
Venue:  (1998)

:Timothy Budd, leading author, educator and researcher in the object-oriented programming community, provides a deep understanding of object-oriented programming and Java. Understanding Object-Oriented Programming with Java teaches readers why the Java language works the way it does, as opposed to many other books that focus on how Java works. Readers learn about the development decisions that went into making the Java language, and leave with a more sophisticated knowledge of Java and how it fits in the context of object-oriented programming. Throughout the text, the focus remains on teaching readers to master the necessary object-oriented programming concepts. Dr. Budd explains to the reader in clear and simple terms the fundamental principles of object-oriented programming, illustrating these principles with extensive examples from the Java standard library. In short, he thoughtfully created this book, not as a reference manual for the Java language, but as a tool for understanding Java and the object-oriented programming philosophy. Highlights: Provides several graduated example programs in Part II (i.e., cannon and pinball games) for readers to work through and successively learn object-oriented programming features.Includes extensive examples from the Java standard library so that readers can better understand the many design patterns found in the AWT, the multiple purposes for which inheritance is used in the standard classes, and more. Discusses features of Java in Part V that are important for students to understand, but not necessarily notable for their object-oriented features. Instructors have the flexibility to omit altogether, or introduce in parallel with earlier material.
LabVIEW Signal Processing with Cdrom, 1st edition
Authors: Mahesh L. Chugani, A. Samant, Michael Cerna
Venue:  (1998)

:This practical guide to LabVIEW's signal processing, control system and mathematical capabilities is designed to help you get results fast. You'll understand LabVIEW's extensive analysis capabilities and learn to identity and use the best LabVIEW tool for each application. You'll review classical DSP and other essential topics, including control system theory, curve fitting, and linear algebra. Along the way, you'll use LabVIEW's tools to construct practical applications that illuminate.
Uniform Convergence and Mesh Independence of Newton's Method for Discretized Variational Problems
Authors: A. L. Dontchev, W. W. Hager, V. M. Veliov
Venue: SIAM Journal on Control and Optimization (2000)

In an abstract framework, we study local convergence properties of Newton's method for a sequence of generalized equations which models a discretized variational inequality. We identify conditions under which the method is locally quadratically convergent, uniformly in the discretization. Moreover, we show that the distance between the Newton sequence for the continuous problem and the Newton sequence for the discretized problem is bounded by the norm of a residual. As an application, we present mesh-independence results for an optimal control problem with control constraints.
New Perspectives on Microsoft Project 2000, 1st edition
Authors: Rachel B. Bunin, Lisa Friedrichsen
Venue:  (2000)

:Part of our New Perspectives Series, this text offers a case-oriented, problem-solving approach to teaching students about Microsoft Project 2000. It's a perfect add-on for any Project Management course.
Microsensors, Mems and Smart Devices
Authors: Julian W. Gardner, Vijay K. Varadan
Venue:  (2001)

:From the electronic nose and the intelligent ear to the modern ink jet nozzle, the applications of smart devices incorporating microsensors are increasing rapidly. Microsensors are miniature devices that convert a non-electrical quantity into an electrical signal. By integrating a microsensor with a microprocessor, a smart sensor is produced. Further integration with a microactuator produces a microsystem with multifunctional electrical and mechanical components known as micro-electrical mechanical systems (MEMS).
Subscriber-assisted handoff support in multimedia PCS
Authors: Shengming Jiang, Danny H. K. Tsang, Bo Li
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1997)

Handoff support is one of the key elements in cellular Personal Communication Systems (PCS). Traditional approaches hide handoff support from the subscriber. However, the main difficulty in handoff support stems from terminal mobility which can only be controlled by the subscriber, who may again have different requirements of mobility support under different environments. Therefore, we suggest that the subscriber should participate in handoff support in the following manner: first, the subscriber is encouraged to declare the requirement of mobility support at call setup time; second, when a handoff cannot be supported, the subscriber should be informed in advance so that (s)he can decide whether or not to control movement since a subscriber may sacrifice mobility for maintaining communication in progress. This approach can reduce call dropping rate and improve resource utilization. We will describe this approach and propose a service classification for mobility support in this paper.
Overview of the Sun Java Community Process's Real-Time Expert Group specification of RT-Java: Session Summary
Authors: Brian Dobbing
Venue: ACM SIGAda Ada Letters (2001)

The session was chaired by Ben Brosgol of Ada Core Technologies.Ben presented an overview of the main points of the specification. He pointed out that during the production of the reference implementation and conformance test suite, further modifications are possible and that the final definition would include all three components (specification, reference implementation and test suite). Andy Wellings presented some comments on the scheduling support offered by the Sun specification.
Network Programming for Microsoft Windows
Authors: Anthony Jones, Jim Ohlund
Venue:  (1999)

:This updated edition provides the latest information about how to write applications that take advantage of the advanced networking protocols and technologies that Microsoft Windows XP supportsInternet Protocol (IP) versions 4 and 6, Pragmatic General Multicasting (PGM) protocol, Internet Group Management Protocol 3 (IGMPv3), IPv6 multicasting, the Network Location Awareness (NLA) namespace provider, the Winsock Provider Interface, 64-bit Winsock APIs, and Microsoft .NET. The book includes code samples in the Microsoft Visual Basic&reg;, Microsoft Visual C++&reg;, and Microsoft Visual C# development systems. The clear, concise, authoritative guide to writing high-performance, scalable Winsock applications using Microsoft's networking APIs plus IPv4 and IPv6 Internet protocols. * Discusses Winsock APIs and earlier versions of Windows networking APIs, plus advanced features of Winsock Direct for building massive, datacenter-scale applications * Dissects IPv4 and IPv6 protocolswith code samples and performance comparisonsalong with new IP multicasting features such as the PGM, IGMPv3 and ICMP6 protocols * Looks at advanced features of Winsock Direct for building large, datacenter scale applications, plus important networking facilities built into Microsoft Visual C#
Nonatomic mutual exclusion with local spinning
Authors: James H. Anderson, Yong-Jik Kim
Venue: Proceedings of the twenty-first annual symposium on Principles of distributed computing (2002)

We present an N-process local-spin mutual exclusion algorithm, based on nonatomic reads and writes, in which each process performs &Theta;(log N) remote memory references to enter and exit its critical section. No atomic read/write algorithm with better asymptotic worst-case time complexity is currently known. This suggests that atomic memory is not fundamentally required if one is interested in worst-case time complexity. The same cannot be said if one is interested in fast-path or adaptive algorithms. We show that such algorithms fundamentally require memory accesses to be atomic. In particular, we show that for any N-process nonatomic algorithm, there exists a single-process execution in which the lone competing process executes &Omega;(log N/log log N) remote operations to enter its critical section. Moreover, these operations must access &Omega;(&radic;log N/log log N) distinct variables.
Some Extended Explicit Bel'tyukov Pairs for Volterra Integral Equations of the Second Kind
Authors: P. W. Sharp, J. H. Verner
Venue: SIAM Journal on Numerical Analysis (2000)

We derive and investigate a family of pairs of extended explicit Bel'tyukov Runge--Kutta (EBVRK) formulas to treat Volterra integral equations of the second kind. Each pair uses six stages and consists of an order 3 formula completely embedded in an order 4 formula. We examine the structure of EBVRK pairs to facilitate their derivation, and in particular, we show that at least six stages are needed to form such pairs. This design is motivated to allow a variable stepsize in order to satisfy a prescribed error tolerance with a minimum of computation. Some numerical examples illustrate the procedures.
A New Finite Continuation Algorithm for Linear Programming
Authors: Kaj Madsen, Hans Bruun Nielsen, Mustafa Ç. Pinar
Venue: SIAM Journal on Optimization (1996)

We describe a new finite continuation algorithm for linear programming. The dual of the linear programming problem with unit lower and upper bounds is formulated as an $\ell_1$ minimization problem augmented with the addition of a linear term. This nondifferentiable problem is approximated by a smooth problem. It is shown that the minimizers of the smooth problem define a family of piecewise-linear paths as a function of a smoothing parameter. Based on this property, a finite algorithm that traces these paths to arrive at an optimal solution of the linear program is developed. The smooth problems are solved by a Newton-type algorithm. Preliminary numerical results indicate that the new algorithm is promising.
Core MCSE, 1st edition
Authors: Thomas Dell, Dan Goldberg
Venue:  (1998)

:Learn how to plan for deployment, develop security strategies, work with system policies and user profiles, install and configure servers and workstations, and much more. Master the basics of Windows networking; file, printer, and resource sharing; backups; disk management; and the Windows registries. Discover how to monitor and maximize system performance, troubleshoot problems, integrate with NetWare - even plan for domains and directory services. You'll find tough, insightful test questions (and answers) at the end of every chapter, plus a complete sample exam at the back of the book. If you're going after MCSE certification, Core MCSE is the total learning solution you're searching for.
A Multiresolution Tensor Spline Method for Fitting Functions on the Sphere
Authors: Tom Lyche, Larry L. Schumaker
Venue: SIAM Journal on Scientific Computing (2000)

We present the details of a multiresolution method which we proposed at the Taormina Wavelet Conference in 1993 (see "L-spline wavelets" in Wavelets: Theory, Algorithms, and Applications, C. Chui, L. Montefusco, and L. Puccio, eds., Academic Press, New York, pp. 197--212) which is suitable for fitting functions or data on the sphere. The method is based on tensor products of polynomial splines and trigonometric splines and can be adapted to produce surfaces that are either tangent plane continuous or almost tangent plane continuous. The result is a convenient compression algorithm for dealing with large amounts of data on the sphere. We give full details of a computer implementation that is highly efficient with respect to both storage and computational cost. We also demonstrate the performance of the method on several test examples.
A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
Authors: J. E. Dennis,  Jr., Mahmoud El-Alem, Maria C. Maciel
Venue: SIAM Journal on Optimization (1997)

This work presents a global convergence theory for a broad class of trust-region algorithms for the smooth nonlinear programming problem with equality constraints. The main result generalizes Powell's 1975 result for unconstrained trust-region algorithms.The trial step is characterized by very mild conditions on its normal and tangential components. The normal component need not be computed accurately. The theory requires a quasi-normal component to satisfy a fraction of Cauchy decrease condition on the quadratic model of the linearized constraints. The tangential component then must satisfy a fraction of Cauchy decrease condition on a quadratic model of the Lagrangian function in the translated tangent space of the constraints determined by the quasi-normal component. Estimates of the Lagrange multipliers and the Hessians are assumed only to be bounded.The other main characteristic of this class of algorithms is that the step is evaluated by using the augmented Lagrangian as a merit function with the penalty parameter updated using the El-Alem scheme. The properties of the step and the way that the penalty parameter is chosen are sufficient to establish global convergence.As an example, an algorithm is presented that can be viewed as a generalization of the Steihaug--Toint dogleg algorithm for the unconstrained case. It is based on a quadratic programming algorithm that uses a step in a quasi-normal direction to the tangent space of the constraints and then takes feasible conjugate reduced-gradient steps to solve the reduced quadratic program. This algorithm should cope quite well with large problems for which effective preconditioners are known.
Building Distributed Applications with Visual Basic.Net, 1st edition
Authors: Dan Fox
Venue:  (2001)

: Building Distributed Applications with Visual Basic.NET provides corporate developers with the .NET Framework techniques necessary to build distributed and reusable business systems in VB.NET. Covered topics include: VB.NET and the .NET Framework architecture and language concepts; building distributed applications with VB.NET using ADO.NET, XML, ASP.NET, SOAP, and COM+; and enterprise integration using the Services Framework.
Prioritized sequencing for efficient query on broadcast geographical information in mobile-computing
Authors: Jianting Zhang, Le Gruenwald
Venue: Proceedings of the 10th ACM international symposium on Advances in geographic information systems (2002)

Broadcasting is an effective and efficient way to disseminate public geographical information to massive users. In this paper, we use R-tree to index broadcast geographical data. Based on our observation that geographical data and their accesses are often concentrated (clustered) in real applications, we propose a novel prioritized sequencing method by considering access frequencies based on application semantics to reduce average access time (latency). The key idea is to put "hot" data items ahead of "cold" ones in the broadcast sequence while still maintain R-Tree indexing structure.We evaluate our method using MapInfo Census 2000 data sample with 576 service locations and 111 of them are hot data items. The average reduction percentages of access time are reduced by 60% for both point queries and range queries based on 10 rounds experiments, each consists 10 hot data items and 5 cold items that are randomly selected. We conclude that our simple method is very effective in improving query efficiency in geographical information broadcast systems.We also proved the linear relationship between wait time and the Aggregate Data Affinity (ADA) (Lee, 2000), a parameter measuring the "eagerness" for data experienced by a client during a query process in broadcast wireless mobile computing environment. Thus our conclusion also holds when using ADA for evaluating broadcast system performance.
Find It Online: The Complete Guide to Online Research, 3rd edition
Authors: Alan M. Schlein
Venue:  (2002)

:The third edition of this title provides the tools and techniques you need to master online research.
Human Services Online: A New Arena for Service Delivery
Authors: Jerry Finn, Gary Holden
Venue:  (2000)

:Human Services Online: A New Arena for Service Delivery provides guidelines and specific suggestions for agencies considering developing online services. The book examines model programs and their effectiveness so that other agencies can replicate them in their own areas, describes cutting-edge online services that today's human services students will need to be aware of as they enter the job market, and provides information for agencies that will enhance their ability to solicit volunteers and contributions on the Internet. FINALLY! A BOOK THAT IS 100% FOCUSED ON COMPUTER NETWORKING IN THE HUMAN SERVICES! Here is the first detailed look inside the front door of network-driven agencies, providers, and services. I recommend this collection to practitioners, administrators, scholars, students, planners, and, yes, consumers of human services. (Tom Hanna, Director, The Child Abuse Prevention Network, Ithaca, New York)
Digital Imaging, 1st edition
Authors: Sally Weiner, Daniel Grotta
Venue:  (1993)

:Digital imaging has revolutionized the world of visual arts more dramatically than anything since the invention of the camera. Digital illustration and computerized manipulation of photographs have become the mark of quality in magazines,movie posters,and advertisements. Until recently,the equipment needed to produce such superb results cost hundreds of thousands of dollars. Now,affordable prices and easy accessibility have made digital imaging possible for almost everyone involved in visual communications. Photographers,artists,and illustrators need all the help they can get sorting through the technobabble and salesmanship surrounding this important new technology,and they'll find it in Digital Imaging. This is the first sourcebook to ease all the technical,financial,legal,and ethical issues readers need to understand. Filled with advice from leading experts in the field,Digital Imaging provides a vital overview of terms and concepts,professional techniques,computer hardware and software,and sources of information and assistance.
Cutting 3D freeform objects with genus-n into single boundary surfaces using topological graphs
Authors: Dvir Steiner, Anath Fischer
Venue: Proceedings of the seventh ACM symposium on Solid modeling and applications (2002)

In reverse engineering, surface reconstruction methods for freeform objects are based mainly on geometrical criteria, while topological factors are neglected. Current methods use a bottom-up approach based on local parameterization to reconstruct the object from points to a dense mesh and finally to smooth connected patches. This type of reconstruction, however, can have topological problems that might lead to parameterization difficulties, noisy surface behavior and texture anomalies. Such problems are particularly common with concave objects and shapes with complex topology of genus-n. To avoid the above problems, a new global topological approach for cutting objects with genus-n was developed and implemented. The proposed process is based on two main stages: (1) computing iso-curves on the mesh and extracting the topological graph, and (2) cutting the mesh according to the curve cutting guidelines that are calculated from the topological graph. The resulting mesh is a single boundary mesh and therefore can be flattened onto a disk. The time complexity of the algorithm is O(n log(n)). To demonstrate the feasibility of the cutting process, the mesh was also flattened. The flattened mesh can then be used for global parameterization, surface fitting and texture mapping. The robustness of the cutting process is demonstrated on several examples using sculptured freeform objects with genus-n.