ppxscal/embedding_network huggingface dataset:
ATM Networks
Authors: Othmar Kyas, Gregan Crawford
Venue:  (2002)

From the Book:Over the past decade ATM has become one of the most widely deployed transport technologies for communication networks. With its flexible architecture it is capable of providing the broad variety of transmission properties that modern multiservice networks require. New, advanced service offerings such as third generation (3G) telephony or DSL are built on ATM, expanding its reach from communication backbones out to millions of users. ATM is the most powerful communication transport mechanism, and it is the most complex one at the same time. This book was written to provide an in-depth understanding of all aspects of ATM, while serving as a single complete reference source. With this in mind, the reader should not expect an easy-to-read book. However, the reward for working through it will be an in-depth understanding of one of the most important and fascinating communication technologies today.Gregan Crawford, EdinburghOthmar Kyas, Colorado SpringsApril 2002
1997 IEEE International Personal Wireless Communications
Authors: IEEE Industry Applications Society
Venue:  (1998)

:This conference discusses the future of the telephone in India and other wireless technologies. Wireline, wireless and satellite providers, manufacturers and researchers are among the fields of expertise covered at this conference.
Web Design and Development Black Book, 10th edition
Authors: Scott Jarol, Marisa Pena
Venue:  (1997)

:With so many exciting Web technologies to choose from, busy developers need to zero in on those that will deliver the maximum impact without overburdening their Web sites. The Web Design & Development Black Book is the ultimate cheat sheet. This book's practical problem-solving approach will guide readers through the most compelling new technologies. With its emphasis on Dynamic HTML and Cascading Style Sheets, you'll get up to speed quickly on the use of exciting new visual techniques, including database integration, sound, animation, dynamic styles, dynamic content, interactive lighting effects, and much more. Bridging the gap between technologists and designers, the Web Design & Development Black Book provides detailed instructions, creative examples, and winning strategies for designers who want to create visually exciting interactive Web sites. Web Design & Development Black Book discusses how to use Cascading Styles to design high-quality pages; add rich interactivity to your site with Dynamic HTML; create lively animation without cumbersome downloaded plug-ins; offer extensive sound content with streaming audio; perform visual effects and transitions; incorporate graphical rollover effects and dynamic document expansion; and use Active Server Pages and Dynamic Data Binding to build in easy database connectivity.
Darkstalkers 3: Official Fighting Guide
Authors: Kevin Melloy, Ken Schmidt
Venue:  (1998)

: BradyGames strategy guide includes complete moves lists for each character, including combos and new power-ups Background information on the game for the hard-core gamer Game secrets and character art direct from Capcom, all the special moves, plus secret menus, exclusive fighting strategy for every character, mega-combos, and more.
Net Results: Web Marketing That Works
Authors: Cybernautice, Rick E. Bruner
Venue:  (1998)

:Net Results: Web Marketing That Works reveals the successful strategies and tactics that the leading online development firm USWeb has used to create winning marketing campaigns for prominent clients. Rich in expert advice and real-world case studies, this unique book shows how businesses large and small can work to maximize their internet site's return on investment, develop domain branding, optimize site design, build internet communities, and generate online publicity.
Solid Modeling with I-Deas, 1st edition
Authors: Sheryl A. Sorby, Kim J. Manner
Venue:  (1999)

:Solid Modeling with I-DEAS by Sheryl Sorby teaches students how to use I-DEAS as a powerful tool for design. It takes a true 3-D approach emphasizing how modeling is inherently different from 2-D CAD. Beginning with a brief introduction to the design process in the context of concurrent engineering, this text proceeds to cover topics such as the I-DEAS work environment, file management, sketching, revolution, applying and modeling 3-D constraints, features and feature-based modeling, lofting, sweeping, and extracting data from 3-D models. Sorby encourages students "to learn by doing." Each chapter includes a set of "Guided Tours" that walk students through features of I-DEAS. Chapters conclude with an ample number of drawing problems.
On Stirling Numbers for Complex Arguments and Hankel Contours
Authors: Philippe Flajolet, Helmut Prodinger
Venue: SIAM Journal on Discrete Mathematics (1999)

Cauchy coefficient integrals and Hankel contours provide a natural generalization of Stirling numbers for unrestricted complex values of their arguments. Many classical identities survive such an extension.
CCNA for Dummies with Cdrom
Authors: Ron Gilster, Kevin Ulstad, Jeff Bienvenu
Venue:  (2000)

:Here's the CCNA test-prep guide you've been waiting for  a For Dummies book and software package! Prepared by Cisco-certified experts and packed with proven tips and practice exams, it's all you need to get up to speed on routing and switching technology  and pass the test! Discover how to: Review the material, objective by objective Use Cisco software tools Assess what you know  and don't Spot and avoid test traps Answer questions quickly Hone your skills on top test-prep software All this and a BONUS CD-ROM with: Dummies Test Engine, our exclusive, fully customizable test-prep software featuring hundreds of sample questions Demo versions of EtherPeek, TokenPeek, and AGNetTools for Windows from AG Group, Inc. About the Author Ron Gilster, the former director of a Cisco Regional Training Academy, is also the author of For Dummies guides to CompTIA certification.
SAS System for Regression,Third Edition, 3rd edition
Authors: Rudolf Jakob Freund, Ramon C. Littell
Venue:  (2000)

:Learn to perform a wide variety of regression analyses using SAS software with this example-driven revised favorite from SAS Publishing. With this third edition you will learn the basics of performing regression analyses using a wide variety of models including nonlinear models. Other topics include performing linear regression analyses using PROVC REG and diagnosing and providing remedies for data problems, including outliers and multicollinearity. Examples feature numerous SAS procedures including REG, PLOT, GPLOT, NLIN, RSREG, AUTOREG, PRINCOMP, and others. A helpful discussion of theory is supplied where necessary. Some knowledge of both regression and SAS are assumed. The updated third edition includes revisions, updated material, and new material. You'll find information on using SAS/INSIGHT software, regression with a binary response with emphasis on PROC LOGISTIC, and nonparametric regression (smoothing) using moving averages and PROC LOESS. Additionally, updated material throughout the book includes high-resolution PROC REG graphics output, data sets by the OUTEST option described and illustrated, and using PROC SCORE to predict another data set. Supports releases 6.12 and higher of SAS software.Author Biography: Rudolf J. Freund, PhD Rudolf J. Freund, PhD former associate director and cofounder of the Department of Statistics at Texas A&M University, is now professor emeritus. Dr. Freund received an M>A> degree in econonics from the University of Chicago in 1951 and a PhD in statistics at North Carolina State college in 1955. He has coauthored several impressive books including Regression Methods, SAS System for Linear Models, Third Edition, StatisticalMethods, and Regression Analysis. Dr Freund has been a SAS user since 1972 and is a former SUGI chairman. Ramon C. Littell, PhD Ramon C. littell, PhD is Professor of Statistics at the University of Florida, where he teaches applied statistics and serves as consulting statistician in the Institute of Food and Agricultural Sciences. Dr Little is coauthor of the two previous editions of this book with Dr. Freund and is also widely published in statistical and applied journals. Dr. Littell is also coauthor of SAS System for Linear Models, Third Edition, SAS System for Mixed Models, and SAS System for Elementary Statistical Analysis, Second Edition. A SAS user since 1972, Dr Littell has served as SUGI chairman and is a Fellow of the American Statistical Association.
Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semidefinite Program
Authors: Manuel A. Nunez, Robert M. Freund
Venue: SIAM Journal on Optimization (2000)

We present bounds on various quantities of interest regarding the central trajectory of a semidefinite program, where the bounds are functions of Renegar's condition number ${\cal C}(d)$ and other naturally occurring quantities such as the dimensions n and m. The condition number ${\cal C}(d)$ is defined in terms of the data instance d=(A,b,C) for a semidefinite program; it is the inverse of a relative measure of the distance of the data instance to the set of ill-posed data instances, that is, data instances for which arbitrary perturbations would make the corresponding semidefinite program either feasible or infeasible. We provide upper and lower bounds on the solutions along the central trajectory, and upper bounds on changes in solutions and objective function values along the central trajectory when the data instance is perturbed and/or when the path parameter defining the central trajectory is changed. Based on these bounds, we prove that the solutions along the central trajectory grow at most linearly and at a rate proportional to the inverse of the distance to ill-posedness, and grow at least linearly and at a rate proportional to the inverse of ${\cal C}(d)^2$, as the trajectory approaches an optimal solution to the semidefinite program. Furthermore, the change in solutions and in objective function values along the central trajectory is at most linear in the size of the changes in the data. All such bounds involve polynomial functions of ${\cal C}(d)$, the size of the data, the distance to ill-posedness of the data, and the dimensions n and m of the semidefinite program.
Egoless writing: improving quality by replacing artistic impulse with engineering discipline
Authors: Edmond H. Weiss
Venue: ACM Journal of Computer Documentation (JCD) (2002)

When technical communicators have a strong personal attachment to the publication they are preparing, this attachment may interfere with the design and testing of the publication itself. Documents developed by solo authors tend to be late, buggy, and exceedingly difficult for others to maintain. "Ego-less" methods---collaborative and structured---break the proprietary connection between the writer and the book; in so doing they permit the most powerful tools of engineering and testing to be used. But they also reduce the satisfactions of the communicator's job.
Microsoft Office XP: 10 Minute Guide
Authors: Joe Habraken
Venue:  (2001)

:10 Minute Guide to Microsoft Office XP offers simple, practical help for busy people who need results fast. Through goal-oriented, 10-minute lessons, you'll learn essential tasks to getting productive with Microsoft Office XP.
Easy Lotus Notes R5
Authors: Cate McCoy, Christopher Will Editor
Venue:  (1999)

:Easy Lotus Notes R5 shows the beginning Notes R5 user just what you need to know to become productive with the software in the shortest time possible. Designed for the end user in a corporate environment who uses the R5 client both on and off-campus, this book teaches how to process email, manage a schedule and address book, manage your database Learn to use the software with speed, security, and confidence.
Edge coloring of bipartite graphs with constraints
Authors: Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
Venue: Theoretical Computer Science (2002)

A classical result from graph theory states that the edges of an l-regular bipartite graph can be colored using exactly l colors so that edges that share an endpoint are assigned different colors. In this paper, we study two constrained versions of the bipartite edge coloring problem. Some of the edges adjacent to a specific pair of opposite vertices of an l-regular bipartite graph are already colored with S colors that appear only on one edge (single colors) and D colors that appear on two edges (double colors). We show that the rest of the edges can be colored using at most max{min{l+D,3l/2},l+(S+D)/2} total colors. We also show that this bound is tight by constructing instances in which max{min{l+D,3l/2},l+(S+D)/2} colors are indeed necessary. - Some of the edges of an l-regular bipartite graph are already colored with S colors that appear only on one edge. We show that the rest of the edges can be colored using at most max{l+S/2,S} total colors. We also show that this bound is tight by constructing instances in which max{l+S/2,S} total colors are necessary.
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
Authors: Alexander Barg, Gérard Cohen, Sylvia Encheva, Gregory Kabatiansky, Gilles Zémor
Venue: SIAM Journal on Discrete Mathematics (2001)

Let C be a code of length n over an alphabet of q letters. An n-word y is called a descendant of a set of t codewords x1, . . . ,xt if $y_i\in\{x^1_i,\dots,x^t_i\}$ for all i=1, . . . ,n. A code is said to have the t-identifying parent property if for any n-word that is a descendant of at most t parents it is possible to identify at least one of them. We prove that for any $t\le q-1$ there exist sequences of such codes with asymptotically nonvanishing rate.
Succinct Representation of Balanced Parentheses and Static Trees
Authors: J. Ian Munro, Venkatesh Raman
Venue: SIAM Journal on Computing (2002)

We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree, and a balanced sequence of parentheses. Our representations use an amount of space within a lower order term of the information theoretic minimum and support, in constant time, a richer set of navigational operations than has previously been considered in similar work. In the case of binary trees, for instance, we can move from a node to its left or right child or to the parent in constant time while retaining knowledge of the size of the subtree at which we are positioned. The approach is applied to produce a succinct representation of planar graphs in which one can test adjacency in constant time.
Faculty training initiative at the indiana university school of education: a participative effort
Authors: Carol Rhodes, William Goveia
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

Studies show that for university faculty members, the effort to keep pace with new technology has created a significant rise in stress, and this technology-induced strain can contribute to increased exhaustion and reduced workplace satisfaction. Studies also show that professors are more satisfied with technology if they have received training. In addition, professors are more likely to accept technology training if provided with an incentive.During the fall semester of 2001, the Dean of the Indiana University (IU) School of Education proposed a laptop-for-training project for School of Education faculty. Participants-who must be full-time faculty-would take possession of a new laptop computer after completion of a prescribed course of technology training. In conjunction with an advisory group, the IU School of Education Technology Services and Instructional Consulting decided on 16 hours as a requirement and began offering a multitude of technology training sessions. Of 197 professors in the IU Bloomington School of Education, 60 applied in the first round. (Enrollment will be offered once per semester.In addition to the workshops offered by the two technology services, the training committee has identified faculty participants who would be able and willing to teach workshops. The targeted instructors are offered two hours of laptop credit for every hour spent in the classroom. Faculty response has been positive; thus far, of the 33 internally-produced workshops, faculty members have taught 18. All Laptop Initiative participants have been given a choice of enrolling in offerings in-house or elsewhere in the University.The Faculty Laptop Training Initiative continues to be in full operation as of this writing. With the assistance of the committee members, faculty participants are continuing to enroll in technology workshops. Given the enthusiasm for training, and considering the rapidly developing technology environment, committee members hope to make the training effort an ongoing program that outlasts the immediate laptop initiative project.
A Mathematical Theory of Design: Foundations, Algorithms and Applications
Authors: Dan Braha, Oded Z. Maimon
Venue:  (1998)

:There are four major aspects that make the book unique: 1) The book develops a formal systems approach to design (including theorems, analysis of principles of design and information theory). 2) Methods for efficient design are rigorously derived from the theory, based on AI and optimization. 3) The scope of the book covers many engineering disciplines under a unified framework, including mechanical, electrical, civil, industrial, manufacturing systems, and apparel industry. Thus, it applies to readers from various disciplines, theoreticians and practitioners. DFM and DFA are also covered. 4) The book provides the methodology for developing the next generation computer software for advanced intelligent CAD (Computer Aided Design). Especially appropriate for courses in engineering (mechanical, industrial, electrical, and civil), the book is also a useful reference for practicing engineers interested in design and optimization, and for applied mathematicians and computer software developers engaged in smart CAD applications.
CCNA Routing and Switching Exam Cram: Master the Fundamentals of Cisco Routers and Switches, 2nd edition
Authors: Jeffrey T. Coe, Matthew Rees
Venue:  (2000)

:Covers the installation, configuration, and operation of simple-routed LAN, WAN, and switched LAN networks. Discusses remote access and integrating dial-up connectivity with traditional, remote LAN to LAN access, as well as supporting the high levels of performance required for new applications such as Internet commerce and multimedia. Demonstrates ways to optimize WAN through Internet solutions that reduce bandwidth and WAN cost.
Empirical Study of a 3D Visualization for Information Retrieval Tasks
Authors: Gregory B. Newby
Venue: Journal of Intelligent Information Systems (2002)

There are many challenges to visualizing information including choosing between 2D and 3D interfaces, navigation and interaction methods, and selecting an appropriate level of detail. Visualizing information retrieval (IR) search results, including Web search engine results, poses additional challenges, notably the determination of appropriate relative locations for terms and document in a visual display. Latent Semantic Indexing (LSI) and related techniques offer approaches to visualizing relations among terms and documents. In this work, &ldquo;information space&rdquo; is presented as a framework for discussing relations among terms and documents, and a technique related to LSI is utilized to generate information spaces from IR search results. This paper provides an overview of more than three decades of work on information visualization, identifying several trends and some relatively unexplored areas. An experimental evaluation of a prototype interface for visualizing IR results is described. Results indicate that the 3D navigation interface for IR search results was usable, but that subjects had difficulty with some aspects. Further study and development of 2D and 3D methods for interacting with retrieval search results is suggested.
Stability of Planar Switched Systems: The Linear Single Input Case
Authors: Ugo Boscain
Venue: SIAM Journal on Control and Optimization (2002)

We study the stability of the origin for the dynamical system $\dot x(t)=u(t)Ax(t)+(1-u(t))Bx(t),$ where A and B are two 2 &times; 2 real matrices with eigenvalues having strictly negative real part, $x\in {\mbox{{\bf R}}}^2$, and $u(.):[0,\infty[\to[0,1]$ is a completely random measurable function. More precisely, we find a (coordinates invariant) necessary and sufficient condition on A and B for the origin to be asymptotically stable for each function u(.).The result is obtained without looking for a common Lyapunov function but studying the locus in which the two vector fields Ax and Bx are collinear. There are only three relevant parameters: the first depends only on the eigenvalues of A, the second depends only on the eigenvalues of B, and the third contains the interrelation among the two systems, and it is the cross ratio of the four eigenvectors of A and B in the projective line CP1. In the space of these parameters, the shape and the convexity of the region in which there is stability are studied.This bidimensional problem assumes particular interest since linear systems of higher dimensions can be reduced to our situation.
On modeling real-time mobile processes
Authors: Jeremy Y. Lee, John Zic
Venue: Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4 (2002)

This paper introduces an algebra for modeling the real-time aspect of systems in a mobile environment. Our model makes use of many familiar concepts and properties from previous works on static, real-time process algebra, and incorporates these into Milner's dynamic &pi;-calculus. The extended algebra allows both time values as well as names to be transmitted between processes, thereby allowing the modeling of, and reasoning about, dynamic temporal behaviour and dynamic configurations of systems. Further, conventional labeled transition system (LTS) semantics are found to be inadequately expressive for use with our algebra. We therefore propose a timed labeled transition system (TLTS) semantics. Finally, we illustrate the modeling power of our algebra with a comprehensive but simple example of a mobile streaming video player.
D'Agents: applications and performance of a mobile-agent system
Authors: Robert S. Gray, George Cybenko, David Kotz, Ronald A. Peterson, Daniela Rus
Venue: Software&mdash;Practice Experience (2002)

D'Agents is a general-purpose mobile-agent system that has been used in several information-retrieval applications. In this paper, we first examine one such application, operational support for military field personnel, where D'Agents greatly simplifies the task of providing efficient, application-specific access to remote information resources. After describing the application, we discuss the key differences between D'Agents and most other mobile-agent systems, notably its support for strong mobility and multiple agent languages. Finally, we derive a small, simple application that is representative of many information-retrieval tasks, including those in the example application, and use this application to compare the scalability of mobile agents and traditional client/server approaches. The results confirm and quantify the usefulness of mobile code, and perhaps more importantly, confirm that intuition about when to use mobile code is usually correct. Although significant additional experiments are required to fully characterize the complex mobile-agent performance space, the results presented here help to answer the basic question of when mobile agents should be considered at all, particularly for information-retrieval applications.