ppxscal/embedding_network huggingface dataset:
Asp.Net: A Beginner's Guide
Authors: Dave Mercer
Venue:  (2001)

:Essential skills for first-time programmers! This easy-to-use book explains the fundamentals of ASP. NET and the . NET Framework. You'll learn to create Web Forms and Web Services and program interactive Web sites and distributed applications. The modular approach of this seriesincluding drills,sample projects,and mastery checksmakes it easy to learn to use this powerful programming language quickly and easily. Learn the essentials of ASP. NET programming using the hands-on examples in this accessible guide. Inside,programming instructor Dave Mercer explains how to program interactive Web sites and distributed applications with ASP. NET  from simple responses and server components to complete database manipulation and e-mail applications. You'll also get important details on using HTML,XHTML,XML,JScript,VB. NET,and other related languages and technologies. This is the ideal resource for the first-time ASP. NET user. This Beginner's Guide is Designed for Easy Learning:ModulesEach programming concept is divided into logical modules (chapters),ideal for individualized learning GoalsEach module opens with the specific programming skills you'll have by the end of the module Ask the ExpertsQ&A sections throughout are filled with extra information and interesting commentary 1-Minute DrillsQuick self-assessment sections to check your progress Annotated SyntaxExample code annotated with commentary that points to the particular technique illustrated ProjectsCoding exercises contained in each module showhow to apply what you are learning Mastery ChecksEnd-of-module reviews that test your knowledge using short-answer,multiple-choice,fill-in-the-blank,and simple coding questions
America Online Simplified, 1st edition
Authors: Ruth Maran
Venue:  (1998)

:Browse the Web, send and receive e-mails, share ideas and opinions with people around the world, chat with celebrities, get late-breaking news, weather, sports, and financial information. America Online makes exploring the Internet fun and simple. And now its just as easy to discover all the great benefits of AOL. America Online&reg; Simplified&reg; takes you on a vivid three dimensional tour of the popular online service. Learn how to use AOLs many features and get the most out of your Web surfing experience. The books easy-to-understand terms, step-by-step instructions, and clear, concise visuals will set even the most timid beginner at ease. And the entertaining cartoon illustrations make America Online Simplified ideal for the whole family.
Harnessing AutoCAD: Release 13 for DOS, 1st edition
Authors: Thomas A. Stellman, Robert A. Rhea
Venue:  (1994)

:This book is ideal for the professional who wants to gain command of Release 13. Chapters include customizing AutoCAD, AutoLISP, DOS & File handling, and AutoCAD 3D. Appendices cover error messages, recovery of damaged drawings, AutoCAD menus and a quick reference of key-in commands.
Harvard Business Review on Knowledge Management, 1st edition
Authors: Harvard Business Review
Venue:  (1998)

:The Harvard Business Review paperback series is designed to bring today's managers and professionals the fundamental information they need to stay competitive in a fast-moving world. Here are the landmark ideas that have established the Harvard Business Reviewas required reading for ambitious businesspeople in organizations around the globe. The eight articles in Harvard Business Review on Knowledge Management highlight the leading-edge thinking and practical applications that are defining the field of knowledge management. Includes Peter Drucker's prophetic "The Coming of the New Organization" and Ikujiro Nonaka's "Knowledge-Creating Company." A Harvard Business Review Paperback.
Real time animation of dynamic processes
Authors: G. C. Morris
Venue: Proceedings of the 1st annual conference on Computer graphics and interactive techniques (1974)

Animation and simulation processes are facilitated by the use of high level graphic languages. The results of these processes are not generally available in real time, developing of microfilm delaying the screening of the process until some time after the computer run.A technique is described which overcomes this problem whilst still allowing the use of a high level graphical language.The addition of a single feature to a "static" graphical language has transformed it into a "dynamic" graphical language allowing real time illustration of time varying processes.The technique is not restricted to the language described but may well be employed by other high level graphical languages.
DECnet Phase V: An OSI Implementation
Authors: James Martin, Joe Leben
Venue:  (1991)

:A Practical Perspective On OSI Broaden your understanding of how large networks are designed with this introduction to the concepts surrounding Digital Network Architecture. This useful book blends an OSI tutorial with a complete look at how OSI technology is used in a Digital computer network. You'll gain useful insights into OSI and the process of OSI standardization and implementation - all presented in a straightforward, easy-to-follow style.
Stretching at Your Computer or Desk
Authors: Bob Anderson, Jean Anderson
Venue:  (2000)

:From the author of the million-copy bestseller Stretching come quick and easy stretching routines for the workplace to help combat the aches and pains of stiing at a sek or keyboard. Also included are tips for ergonomics and proper posture at the workstation. Line drawings. 96 pp. |
Cluster based routing using a k-tree core backbone for mobile ad hoc networks
Authors: Saurabh Srivastava, R. K. Ghosh
Venue: Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications (2002)

The problem of routing in Mobile Ad hoc Networks is non-trivial because of the dynamic nature of the network topology. In addition to computing shortest paths, as in wire-line networks, any routing scheme must consider that the topology of the network can vary while the packet is being routed.Cluster based schemes have been proposed which segregate the network into manageable sets for maintaining routing information. In this paper we propose a novel method of constructing the clusters and a backbone based on the concept of a k-tree core. We also propose an hierarchical routing scheme using this cluster information and evaluate its performance through extensive simulations.
Practical Network Cabling
Authors: Frank J. Derfler, Les Freed
Venue:  (1999)

:Practical Network Cabling is an excellent reference if you need to learn network cabling or need a unified source of information on any network cabling scheme. This book provides clear and straightforward text explaining all types of network cabling issues from specification to installation to ongoing maintenance. A highlight of this book is the superb quality of the illustrations showing various cable types and connectors. After reading this book you will be able to design the right cabling system for LANs or WANs of any size or complexity, identify all types of cabling and connectors and their advantages and disadvantages, specify the right quality and type of cables and connectors for a given application, install wiring, connectors, closets, terminators, of any cabling type, and prevent, troubleshoot, and fix cabling problems.
High Performance Computing, 2nd edition
Authors: Kevin Dowd, Charles Severance
Venue:  (1998)

:This book is intended for two groups of readers: (a) practicing programmers, who need to acquaint themselves with techniques for optimizing their code on different kinds of hardware, and (b) managers (and others, including programmers) who need to know how to evaluate different kinds of hardware. This new edition of High Performance Computing gives a thorough overview of the latest workstation and PC architectures and the trends that will in?uence the next generation. It pays special attention to memory design, tuning code for the best performance, multiprocessors, and benchmarking.
DB2 Universal Database: Call Level Interface Developer's Guide, 1st edition
Authors: Roger E. Sanders, Rober E. Sanders
Venue:  (1999)

:DB2 has just changed radically--this is the one-stop resource that brings developers up to speed on the new standard. Unique tables illustrate how key commands operate in DB2 versus other database systems, invaluable for readers who must migrate or integrate systems. Shows how to develop DB2 applications using IBM's Call Level Interface.CD-ROM abounds with code with the book, tools, utilities, and the latest version of IBM DB2 Universal Server. Concise yet complete the DB2 Universal Database application developer's definitive guide to IBM's Call Level Interface. This is the only comprehensive reference available for DB2 Universal Database application developers working with IBM's Call Level Interface. Perfect for intermediate- to adviced-level developers, it's your complete, time-saving, at-a-glance guide to mastering CLI, IBM's Call Level Interface for communicating with DB2 Universal Database databases. Inside, you'll find full coverage of core concepts of CLI, including a frank discussion of the advantages and drawbacks of using CLI instead of SQL. This one-of-a-kind guide will also walk you through the basic steps of building, testing, and debugging executable applications that maximize CLI's flexibility. Then it delves deeply into the CLI API functions and offers tested C++ programming examples that will help you maximize the power of CLI without sacrificing hours of trial-and-error programming. And because CLI is closely aligned with ODBC 3.0, this handbook also helps you sort out the differences between CLI, ODBC, and the international standards upon which both CLI and ODBC are based. Rich in practical examples and techniques you can put to work right away, the DB2 Universal Database Call Level Interface Developer's Guide is your shortcut to a new understanding of this incredibly useful interace.
ISDN Explained: Worldwide Network and Applications Technology, 2nd edition
Authors: John M. Griffiths, P. F. Adams
Venue:  (1992)

:ISDN (Integrated Services Digital Network) is a vital element of today's networking environment, thanks to its ability to integrate voice, data, and video information over an extensive network. It has one of the fastest ways to transmit data and so commands a lot of attention in communications circles. This new edition provides an up-to-date overview of the principles and applications of ISDN. It also includes information on Signaling Access Protocols, the format of the messages that control an ISDN connection.
A precise inter-procedural data flow algorithm
Authors: Eugene M. Myers
Venue: Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1981)

Data flow analysis is well understood at the intra-procedural level and efficient algorithms are available. When inter-procedural mechanisms such as recursion, procedure nesting, and pass-by-reference aliasing are introduced, the data flow problems become much more difficult. The avail, live, and must-summary data flow problems are shown to be NP-complete in the presence of aliasing. However, an algorithm is presented with O(SET*EDGE) time performance where EDGE is the size of the program's flow graph and SET is a possible exponential number which reflects the number of aliasing patterns of the program. It is argued that in practice SET is small and on the order of the number of variables of the program.
A Distance-Regular Graph with Strongly Closed Subgraphs
Authors: Akira Hiraki
Venue: Journal of Algebraic Combinatorics: An International Journal (2001)

Let &Gamma; be a distance-regular graph of diameter i>d, valency i>k and i>r :&equals; max&lcub;i>i &verbar; (i>ci,i>bi) &equals; (i>c1,i>b1)&rcub;. Let i>q be an integer with i>r + 1 &le; i>q &le; i>d &minus; 1.In this paper we prove the following results:Theorem 1 i>Suppose for any pair of vertices at distance q there exists a strongly closed subgraph of diameter q containing them. Then for any integer i with 1 &le; i>i &le; i>q i>and for any pair of vertices at distance i there exists a strongly closed subgraph of diameter i containing them.Theorem 2 i>If r &ge; 2, i>then i>c2i>r+3 &ne; 1.As a corollary of Theorem 2 we have i>d &le; i>k2(i>r + 1) if i>r &ge; 2.
Multi-Carrier Digital Communications: Theory and Applications of Ofdm
Authors: Ahmad R. Bahai, Burton R. Saltzberg
Venue:  (1999)

:Multi-carrier modulation, in particular orthogonal frequency division multiplexing (OFDM), has been successfully applied to a wide variety of digital communications applications for several years. Although OFDM has been chosen as the physical layer standard for a diversity of important systems, the theory, algorithms, and implementation techniques remain subjects of current interest. This book is intended to be a concise summary of the present state of the art of the theory and practice of OFDM technology. This book offers a unified presentation of OFDM theory and high speed and wireless applications. In particular, ADSL, wireless LAN, and digital broadcasting technologies are explained. It is hoped that this book will prove valuable both to developers of such systems, and to researchers and graduate students involved in analysis of digital communications, and will remain a valuable summary of the technology, providing an understanding of new advances as well as the present core technology.
Practical Voip Using Vocal
Authors: Luan Dang, David Kelly, Cullen Jennings
Venue:  (2002)

While many books describe the theory behind Voice over IP, only Practical VoIP Using VOCAL describes how such a phone system was actually built, and how you too can acquire the source code, install it onto a system, connect phones, and make calls.VOCAL (the Vovida Open Communication Application Library) is an open source software project that provides call control, routing, media, policy, billing information and provisioning on a system that can range from a single box in a lab with a few test phones to a large, multi-host carrier grade network supporting hundreds of thousands of users. VOCAL is freely available from the Cisco Systems-sponsored Vovida.org community web site (www.vovida.org).A Silicon Valley start-up called Vovida Networks, Inc (think of VOice, VIdeo, DAta) created VOCAL and invested over one hundred man years into its development. Since Cisco acquired Vovida in 2000, individuals representing every significant telecom company and service provider in the world have downloaded the source code. Today, more and more people are successfully building VOCAL into professional solutions, while contributing fixes and new functionality back to Vovida.org.Because VOCAL is open source, you can look "under the hood" to the base code and protocol stack levels and discover not only how the system works, but also how common problems are being worked out in the development environment. We're hoping that you will be inspired to take this system to another level by implementing a feature or functionality that no one has thought of before.Written by a team from Vovida Networks, Practical VoIP Using VOCAL includes the following topicsInstalling and configuring VOCAL 1.4.0 onto a single host and onto a multi-host network with phones and gatewaysC++, C and Java architecture found within VOCALProvisioning a VoIP systemSIP (Session Initiation Protocol), SDP (Session Description Protocol) and RTP (Real-time Transport Protocol) for call control and mediaTRIP (Telephony Routing over IP), DNS SRV and ENUM for routingMGCP (Media Gateway Control Protocol) and H.323 for call control and translation into SIPCOPS (Common Open Policy Service), OSP (Open Settlement Protocol) and RSVP (Reservation Protocol) for policy and Quality of ServiceRADIUS (Remote Authentication Dial In User Service) for interfacing with billing serversSNMP (Simple Network Management Protocol)If you're interested in VoIP, this is the only book available that focuses on the real issues facing programmers and administrators who need to work with these technologies. :
On the temporal analysis of fairness
Authors: Dov Gabbay, Amir Pnueli, Saharon Shelah, Jonathan Stavi
Venue: Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1980)

The use of the temporal logic formalism for program reasoning is reviewed. Several aspects of responsiveness and fairness are analyzed, leading to the need for an additional temporal operator: the 'until' operator -U. Some general questions involving the 'until' operator are then discussed. It is shown that with the addition of this operator the temporal language becomes expressively complete. Then, two deductive systems DX and DUX are proved to be complete for the languages without and with the new operator respectively.
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
Authors: Steven S. Seiden
Venue: SIAM Journal on Discrete Mathematics (2001)

An online algorithm for variable-sized bin packing, based on the Harmonic algorithm of Lee and Lee,[J. ACM, 32 (1985), pp. 562--572], is investigated. This algorithm was proposed by Csirik, [Acta Inform., 26 (1989), pp. 697--709], who proved that for all sets of bin sizes, 1.69103 upper bounds its performance ratio. The upper bound is improved in the sense that we give a method of calculating the performance ratio to any accuracy for any set of bin sizes. Further, it is shown that the algorithm is optimal among those which use bounded space. An interesting feature of the analysis is that, although it is shown that our algorithm achieves a performance ratio arbitrarily close to the optimum value, it is not known precisely what that value is. The case where bins of capacity 1 and $\alpha \in (0,1)$ are used is studied in greater detail. It is shown that among algorithms which are allowed to choose $\alpha$, the optimal performance ratio lies in [1.37530,1.37532].
Digital Image Analysis of Microbes: Imaging, Morphometry, Fluorometry, and Motility Techniques and Applications, 1st edition
Authors: M.H.F. H. Wilkinson, F. Schut
Venue:  (1998)

:Providing specific knowledge in the theory of image analysis, optics, fluorescence, and imaging devices in biomedical laboratories, this timely and indispensable volume focuses on the theory and applications of detection, morphometry, and motility measurement techniques applied to bacteria, fungi, yeasts and protozoa.
Samba Unleashed
Authors: Steve Litt, Owen Lloyd
Venue:  (2000)

:Samba Unleashed shows you how to install, configure, and maintain Samba on a wide variety of platforms. You will learn pratical, focused solutions and strategies so you can seamlessly get Samba working on your network. The main section of the book covers the topics every system administrator needs to know, including configuring custom file share, configuring custom printer share, using server side automation, Samba security, optimizing Samba performance, routed networks, and browsing.
Audio on the Web: The Official IUMA Guide
Authors: Jeff Patterson, Ryan Melcher
Venue:  (1998)

:This book guides you through the process of producing sound files and building Web pages that present them for maximum impact.
A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})
Authors: A. Reyhani-Masoleh, M. A. Hasan
Venue: IEEE Transactions on Computers (2002)

The Massey-Omura multiplier of GF(2^{m}) uses a normal basis and its bit parallel version is usually implemented using m identical combinational logic blocks whose inputs are cyclically shifted from one another. In the past, it was shown that, for a class of finite fields defined by irreducible all-one polynomials, the parallel Massey-Omura multiplier had redundancy and a modified architecture of lower circuit complexity was proposed. In this article, it is shown that, not only does this type of multipliers contain redundancy in that special class of finite fields, but it also has redundancy in fields GF(2^{m}) defined by any irreducible polynomial. By removing the redundancy, we propose a new architecture for the normal basis parallel multiplier, which is applicable to any arbitrary finite field and has significantly lower circuit complexity compared to the original Massey-Omura normal basis parallel multiplier. The proposed multiplier structure is also modular and, hence, suitable for VLSI realization. When applied to fields defined by the irreducible all-one polynomials, the multiplier's circuit complexity matches the best result available in the open literature.
Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Venue: Symposium on Principles of Database Systems (1983)

The papers in this volume were presented at the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems at the Colony Square Hotel, Atlanta, Georgia, March 21-23, 1983, sponsored jointly by the ACM Special Interest Group for Automata and Computability Theory and the ACM Spcial Interest Group for the Management of Data.The articles in this proceedings were selected on November 30, 1982 at a meeting of the program committee from 118 abstracts submitted in response to the call for papers. The articles generally represent preliminary reports of ongoing research and it is anticipated that many of these articles will appear in more polished form in scientific journals.
Shockwave 3D
Authors: Jason Wolfe
Venue:  (2002)

:Jason Wolf, a co-creator of Shockwave technology, gets you up to speed with this clearly written and practical book. Shockwave 3D gives you a software overview and then gets you quickly up to speed with accessible step-by-step instructions. Even traditional 3D designer new to Lingo programming will quickly learn how to export 3D scenes into Director, add interactive behavior, and publish content on the Internet. More advanced developers will appreciate the extensive Havok Lingo chapter and ray-casting examples, in addition to the numerous best practices.
Conker's Bad Fur Day
Authors: Tim Bogenn, Doug Walsh
Venue:  (2001)

:BradyGames Conker's Bad Fur Day Official Strategy Guide features a comprehensive walkthrough to give gamers step-by-step strategy. Expert boss fighting tactics give you the most efficient ways to defeat every boss! Complete multiplayer coverage including maps, tactics, and commentary for every multiplayer mode. Detailed level maps allow you to pinpoint key items and locations.
Performance of Discontinuous Galerkin Methods for Elliptic PDEs
Authors: Paul Castillo
Venue: SIAM Journal on Scientific Computing (2002)

In this paper, we compare the performance of several discontinuous Galerkin (DG) methods for elliptic partial differential equations (PDEs) on a model problem. Theoretical estimates of the condition number of the stiffness matrix are given for DG methods whose bilinear form is symmetric and which are shown to be numerically sharp. Then the efficiency of the methods in the computation of both the potential and its gradient is tested on unstructured triangular meshes.
Computer science accessibility for students with visual disabilities
Authors: Joan M. Francioni, Ann C. Smith
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

Students with visual disabilities face unique challenges in learning to be computer scientists. These challenges can be overcome, however, with the use of specialized software tools and hardware equipment, collectively called assistive technology. In this paper, we discuss the environment we are using for three students with visual disabilities who are starting in our programs this year. This environment includes a collection of commercial assistive technology and a programming tool that we have developed in-house.