ppxscal/embedding_network huggingface dataset:
Partial Cubes and Crossing Graphs
Authors: Sandi Klavzar, Henry Martyn Mulder
Venue: SIAM Journal on Discrete Mathematics (2002)

Partial cubes are defined as isometric subgraphs of hypercubes. For a partial cube G, its crossing graph G# is introduced as the graph whose vertices are the equivalence classes of the Djokovi&cacute;--Winkler relation $\Theta$, two vertices being adjacent if they cross on a common cycle. It is shown that every graph is the crossing graph of some median graph and that a partial cube G is 2-connected if and only if G# is connected. A partial cube G has a triangle-free crossing graph if and only if G is a cube-free median graph. This result is used to characterize the partial cubes having a tree or a forest as its crossing graph. An expansion theorem is given for the partial cubes with complete crossing graphs. Cartesian products are also considered. In particular, it is proved that G# is a complete bipartite graph if and only if G is the Cartesian product of two trees.
Fundamentals of Computing I: Logic, Problem-Solving, Programs and Computers, C++ Edition, 2nd edition
Authors: Allen B. Tucker, Robert D. Cupper, Andrew Bernat
Venue:  (1995)

:Fundamentals of Computing is a series of four texts and accompanying laboratory manuals that provide the basis for a four-semester breadth-first introduction to the discipline of computing. This series is motivated by both the comprehensive definition of the discipline and the pedagogical principles developed in the reports Computing as a Discipline and Computing Curricula 1991. In addition to its comprehensive treatment of the discipline, this series provides another important dimension for the introductory courses an option to integrate the topics of discrete mathematics with those subjects in computing where they are used. While this series does not require discrete mathematics to be integrated in all courses that use it, many instructors will choose to include that material directly in those courses. Such a choice is mainly justified on the grounds that students can see more clearly the fundamental mathematical dimensions of the discipline where these topics are integrated rather than taught in a separate mathematics course.
Novell's Guide to Integrating Intranetware and NT, 1st edition
Authors: J. D. Marymee, Sandy Stevens
Venue:  (1997)

:Explore the networking wonders of a mixed environment with Novells Guide to Integrating intraNetWare and NT, your how-to guide for combining intraNetWare/NetWare&reg; 4.11 servers and Windows NT&reg; servers and workstations. Novells Guide to Integrating intraNetWare and NT has everything youll need to successfully synthesize the speed and scalability of intraNetWare with the raw productivity of NT Servers BackOffice&reg; applications. Certified Novell professionals J.D. Marymee and Sandy Stevens provide a thorough overview of the Windows NT Server 4.0, Novell Directory Services, Novell and Microsoft integration utilities, intraNetWare Client, Novell Workstation Manager, and Novell Application Launcher. On the bonus CD-ROM youll find exclusive Novell software including NetWare Administrator, Novell Administrator for Windows NT, Novell Application Launcher, and ManageWise&reg; 2.1. Novells exclusive CD also features NDS for NT, intraNetWare Client Suite, SAMBA for NetWare, and much more.
Mobile Robotics: A Practical Introduction: History, Design, Analysis and Examples, 1st edition
Authors: Ulrich Nehmzow
Venue:  (2000)

:Mobile Robotics: A Practical Introduction is an excellent introduction to the foundations and methods used for designing completely autonomous mobile robots. A fascinating, cutting-edge research topic, autonomous mobile robotics is now taught in more and more universities. In this book you are introduced to the fundamental concepts of this complex field via twelve detailed case studies which show how to build and program real working robots. Topics covered include learning, autonomous navigation in unmodified, noisy and unpredictable environments, and high fidelity mobile robot simulation. This book provides a very practical introduction to mobile robotics for a general scientific audience, and is essential reading for final year undergraduate students and postgraduate students studying Robotics, Artificial Intelligence, Cognitive Science and Robot Engineering. Its update and overview of core concepts in mobile robotics will assist and encourage practitioners of the field, and set challenges to explore new avenues of research in this exciting field.
VB6 Uml Design and Development
Authors: Jake Sturm
Venue:  (1999)

:UML (Unified Modeling Language) is a powerful notational approach to object-oriented analysis, design and implementation. If you understand and can utilize UML, your object-oriented Visual Basic programming becomes much more logical and effective. UML allows you to design, plan and implement great Visual Basic programs. The ease of learning the fundamentals of Visual Basic often misleads VB programmers - there is a common misperception that effective VB programs can be built in an ad-hoc fashion, without thinking through the full ramifications of the programs being created. Object-oriented programming, and UML in particular, empowers VB programmers with a system of thinking, designing and implementing their programs in a more professional, robust manner. UML is a route to successful VB programming.This initiative started with the Wrox book, Beginning VB5/6 Objects, which introduced the object-oriented methodology itself. Now, VB6 UML takes that initiative a stage further, to more professional design and implemention. Because UML abstracts the design process, it also allows programmers to see some of the abstract patterns that occur when they are programming. This more abstract view, and some of the emergent patterns that become visible, will allow VB programmers to grasp their fundamental programming activities at an important and fundamental level. VB and UML make great partners. This book teaches VB programmers how to become better programmers, better thinkers, and more successful creators of VB applications, using UML to help design and then create professional VB programs.
Oracle PL/SQL Developer's Workbook, 1st edition
Authors: Steven Feuerstein
Venue:  (2000)

: This workbook is a companion to Steven Feuerstein's bestselling books, Oracle PL/SQL Programming (considered the bible for PL/SQL developers), Oracle Built-in Packages, and Advanced Oracle PL/SQL: Programming with Packages. The workbook provides a carefully constructed set of exercises that test PL/SQL developers' language skills and help them become better programmers. Exercises are provided at three levels: beginner, intermediate, and advanced; in this way, the book is suitable for complete beginners, yet continues to be useful as readers gain mastery of the PL/SQL language. The workbook exercises cover all of the major features of PL/SQL, including: Variables and program data Conditional and sequential control and looping Database interaction and cursors Exception handling PL/SQL records and tables Functions, procedures, packages, and modular programming Object features (e.g., object types, nested tables and VARRAYs, object views, and external procedures) Debugging, tuning, and tracing features Exercises also cover the new PL/SQL features available in Oracle8i, the "Internet database," (e.g., autonomous transactions, invoker's rights, bulk binds, and native dynamic SQL), as well as the use of Java and the Web via PL/SQL. In addition to the exercises, the workbook provides a primer to the PL/SQL language and a collection of Feuerstein's best practices for PL/SQL programming.
Hewlett-Packard Official Printer Handbook: The Ultimate Guide to Buying, Using, and Troubleshooting Your Printer, No Matter What Brand You Own, 1st edition
Authors: Mark L. Chambers, Crowder
Venue:  (1999)

:The up-to-date, definitive guide on how to choose, set up, and even network an inkjet, laserjet, or multifunction printer. Expert coverage is given of memory, postscript. PCL, fonts, SCSI, USB, parallel ports, printer switches, printer buffers, and cartridge installation.
The Complete Uml Training Course with Book
Authors: Grady Booch, Ivar Jacobson, James Rumbaugh
Venue:  (2000)

:The all-in-one multimedia UML training coursepowerful integrated training straight from UML's inventors. Includes the "UML Multimedia Cyber Classroom"powerful interactive training with over 200 digital animations of UML diagrams and over two hours of detailed audio explanations of key concepts; a completely searchable version of "The Unified Modeling Language User Guide"; and "The Unified Modeling Language Reference Guide."
Traveling Salesman-Based Curve Reconstruction in Polynomial Time
Authors: Ernst Althaus, Kurt Mehlhorn
Venue: SIAM Journal on Computing (2002)

An instance of the curve reconstruction problem is a finite sample set V of an unknown collection of curves $\gamma$. The task is to connect the points in V in the order in which they lie on $\gamma$. Giesen [Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SCG '99), 1999, pp. 207--216] showed recently that the traveling salesman tour of V solves the reconstruction problem for single closed curves under otherwise weak assumptions on $\gamma$ and V; $\gamma$ must be a single closed curve. We extend his result along several directions: we weaken the assumptions on the sample; we show that traveling salesman-based reconstruction also works for single open curves (with and without specified endpoints) and for collections of closed curves; we give alternative proofs; and we show that in the context of curve reconstruction, the traveling salesman tour can be constructed in polynomial time.
A finite buffer queue with priorities
Authors: Vinod Sharma, Jorma T. Virtamo
Venue: Performance Evaluation (2002)

We consider a queue with finite buffer where the buffer size limits the amount of work that can be stored in the queue. The arrival process is a Poisson or a Markov modulated Poisson process. The service times (packet lengths) are i.i.d. with a general distribution. Our queue models the systems in the Internet more realistically than the usual M/GI/1/K queue which restricts the number of packets in the buffer rather than the buffer content (the number of bits). We obtain the stability, the rates of convergence to the stationary distribution and functional limit theorems for this system. In addition, we also obtain algorithms to compute the stationary density of the workload process, the waiting times and the probability of packet loss. Next, we study the queue with two priority classes. The higher priority traffic has preemptive-resume priority. For sharing the buffer, we consider two cases. In the first case, the buffer is shared by both the classes without any priority. In the second case, the buffer is partitioned into two groups, one reserved for each class. For this system also we obtain all the results mentioned for the single class traffic.
DB2: The Complete Reference
Authors: Paul C. Zikopoulos, Roman B. Melnyk
Venue:  (2001)

:Design and manage well-organized DB2 databases and applications using this comprehensive resource. Including details on the new features of version 7.2, this guide covers commands, SQL keywords, administration, data replication, performance tuning, and much more. Find out how to embed SQL in your applications, recover data, and troubleshoot DB2. Also covered are IBM's business intelligence features including data warehousing and OLAP. Written by members of the DB2 development team, this thorough guide gives you an inside look at this powerful and efficient database management system. Whether you're a DB2 application developer or an administrator, this hands-on guide belongs on your desk.
Troubleshooting Local Area Networks, 1st edition
Authors: Othmar Kyas, Thomas Heim
Venue:  (1994)

:Designed for network managers and administrators, Troubleshooting Local Area Networks provides practical guidance in detecting, eliminating and preventing problems in local area networks. Logically structured, Troubleshooting LANs begins by outlining a variety of systematic approaches which can be used to identify faults. Describing the methods and diagnostic tools that can be used, this practical reference shows how to efficiently test and analyse the results. The book then goes on to deal with faults in different network components, from hardware to software, including interface cards, ring distributors, star hubs and bridges and routers. An appendix sets out the ISO standards and performance criteria to which networks conform.
"Ask before you search": peer support and community building with reachout
Authors: Amnon Ribak, Michal Jacovi, Vladimir Soroka
Venue: Proceedings of the 2002 ACM conference on Computer supported cooperative work (2002)

This paper presents ReachOut, a chat-based tool for peer support, collaboration, and community building. We describe the philosophy behind the tool and explain how posting questions in the open directly benefits the creation, distribution, and use of organizational knowledge, in addition to enhancing the cohesion of the community involved. ReachOut proposes new methods of handling problems that include locating, selecting, and approaching the right set of potential advisers. We discuss the advantages of public discussions over private, one-on-one sessions, and how this is enhanced by our unique combination of synchronous and asynchronous communication. We present and analyze results from a pilot of ReachOut and conclude with plans for future research and development.
On the cyclic to acyclic scheme transformation and solving cyclic queries
Authors: Z. Meral Ozsoyoglu, Elarbi Choukhmane
Venue: Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems (1984)

Relational database schemes can be partitioned into acyclic (tree) schemes and cyclic schemes. This partitioning also classifies the natural join queries into tree queries and cyclic queries. The problems of determining the minimum number of joins needed (i) to transform a cyclic scheme into an acyclic one, and (ii) to solve a cyclic query are shown [GS1 82, GS2 82] to be two different NP-complete problems. We consider a class of database schemes, called simple schemes. We show that the two problems above are equivalent but remain to be NP-complete when they are restricted to simple schemes. We give a polynomial time algorithm for both problems on simple schemes whose qual graphs are chordal. As a by-product, we also show that an edge contraction problem on undirected graphs is NP-complete and it is polynomial when the graph is chordal.
Computational Principles of Mobile Robotics
Authors: Gregory Dudek, Michael Jenkin
Venue:  (2000)

:Unlike the robots of Isaac Asimov and other popular writers of science fiction, actual autonomous robots must negotiate the reality of moving, sensing, and reasoning out their environment. This book approaches these three tasks and describes the way in which existing robotic systems have addressed them." "Computational Principles of Mobile Robotics emphasizes the computational methods of programming robotics rather than the methods of constructing the hardware. Advanced undergraduate and graduate students and researchers in the field of mobile robotics will find this book useful as a comprehensive treatment of the range of issues in the field.
Application-Driven Architecture Synthesis
Authors: Lars Svensson
Venue:  (1993)

:Application-Driven Architecture Synthesis describes the state-of-the-art in architectural synthesis for complex real-time processing. In order to deal with the stringent timing requirements and the intricacies of complex real-time signal and data processing, target architecture styles and target application domains have been adopted to make the synthesis approach feasible. These approaches are also heavily application-driven which is illustrated by many realistic demonstrations, used as examples throughout the book. The focus is on domains where application-specific solutions are attractive such as significant parts of audio, telecom, instrumentation, speech, robotics, medical and automotive processing, image and video processing, TV, multi-media, radar, and sonar. Application-Driven Architecture Synthesis is of interest to both academia and to senior design engineers and CAD managers in industry. It provides an excellent overview of what capabilities to expect from future practical design tools and includes an extensive bibliography.
Windows 98 Visual Pocketguide
Authors: Maran Graphics
Venue:  (1998)

:Whoever said that good things come in small packages must have been thinking of Ruth Maran and her cutting edge Visual Pocket guides. Windows&reg; 98 Visual PocketGuide delivers the acclaimed IDG Books 3-D Visual approach to Windows 98 in a handy directory. Now you can reference essential Windows 98 tasks and commands instantly by simply flipping through your copy of Windows 98 Visual PocketGuide and browsing the headers prominently displayed at the top of every page. Despite its compact size, Windows 98 Visual PocketGuide still features dynamic two-page illustrated spreads and straightforward step-by-step instructions that have become the maranGraphics hallmark. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
WordPerfect for Windows 5.2 Made Easy, 1st edition
Authors: Katie Layman, Lavaughn Hart
Venue:  (1993)

:Part of the Word Processing Made Easy Series, WordPerfect for Windows Made Easy discusses and describes each program function within the context of a real-world application. Authors Katie Layman and LaVaughn Hart reinforce language arts skills by supplying the appropriate vocabulary words / punctuation / capitalization / grammar rules in each chapter, and explain and illustrate proper document format as procedures are given-providing a visual guide to the formatting of letters, memos, tables, reports, and more.
Undocumented Windows NT
Authors: Prasad Dabak, Sandeep Phadke, Milind Borate
Venue:  (1999)

:Get the Inside Story on Windows NT APIs: Use the interfaces underlying the Win32 interface to invent new ways to solve problems Discover how to "hook" system services not documented in the Microsoft Windows NT SDK Learn about security holes inherent in the design of Windows NT and how you can address them Master techniques for analyzing Windows NT yourself Get a better understanding of the Memory Management architecture Modify and administer Windows NT systems to make them more fault tolerant Compare and contrast popular Win32 implementations
Enterprise Systems Integration, 1st edition
Authors: John Wyzalek
Venue:  (1999)

:Featuring critical technology tips, strategies, and assessments from some of the most highly respected consultants and developers in the field, Enterprise Systems Integration is a one-of-a-kind resource. The result of many thousands of hours of actual hands-on work in the field, it gives you a rich blend of researched knowledge and practical experience. It delivers proven, successful, economical solutions to real-world problems associated with the host of systems integration technologies and methodologies. It brings you coverage of those issues that plague you most: enabling technologies, such as Middleware, CORBA, COM, and Enterprise Java; integrated databases of all types - legacy, relational, and object; data warehousing, including Web-enabled data warehouses; enterprise resource packages, networking, electronic messaging; and the Internet and the Web, including e-commerce.
An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
Authors: F. Leibfritz, E. M. E. Mostafa
Venue: SIAM Journal on Optimization (2002)

In this paper, an interior point trust region algorithm for the solution of a class of nonlinear semidefinite programming (SDP) problems is described and analyzed. Such nonlinear and nonconvex programs arise, e.g., in the design of optimal static or reduced order output feedback control laws and have the structure of abstract optimal control problems in a finite dimensional Hilbert space. The algorithm treats the abstract states and controls as independent variables. In particular, an algorithm for minimizing a nonlinear matrix objective functional subject to a nonlinear SDP-condition, a positive definiteness condition, and a nonlinear matrix equation is considered. The algorithm is designed to take advantage of the structure of the problem. It is an extension of an interior point trust region method to nonlinear and nonconvex SDPs, with a special structure which applies sequential quadratic programming techniques to a sequence of barrier problems and uses trust regions to ensure robustness of the iteration. Some convergence results are given, and, finally, several numerical examples demonstrate the applicability of the considered algorithm.
Testing the Schedulability of Synchronous Traffic for the Timed Token Medium Access Control Protocol
Authors: Sijing Zhang, Alan Burns, Ahmed Mehaoua, E. Stewart Lee, Hongji Yang
Venue: Real-Time Systems (2002)

One of the key issues related to guaranteeing synchronous message deadlines in a timed token network (such as fiber distributed data interface) where the timed token medium access control protocol is used is the schedulability test of synchronous traffic (i.e., testing whether or not all synchronous messages can be transmitted before their deadlines, under a given setting of network parameters). Much work has been done on how to assign network parameters appropriately in order to guarantee timely transmission of synchronous traffic. As a result quite a few synchronous bandwidth allocation schemes and some good guidelines on selection of the target token rotation time have been proposed. In contrast, limited research has been conducted on how to effectively test whether or not given network parameters can guarantee timely transmission of all synchronous messages (of a considered synchronous message set) before their deadlines. The previous testing methods for synchronous message schedulability only provide a sufficient (but not necessary) test and therefore fail to always keep effective for any synchronous message set considered. In this paper, we propose two testing methods for determining the schedulability of a synchronous message set with message deadlines no longer than periods. The proposed tests perform better than any previous test in the sense that they are both sufficient and necessary. Some numerical examples are given to compare different testing methods, all of which have demonstrated the superiority of the proposed tests to other existing testing methods.
Neural Networks in Transport Applications
Authors: Veli Himanen, Juha Ratio, Peter Nijkamp, Aura Reggiani
Venue:  (1998)

:The analysis of human behavior from the viewpoint of network developments has gained much scientific attention in the past decade. Especially in a spatial context, many network models have been designed. Network models center their analysis around the spatial behavior of individuals or groups in an organized pattern of nodes and links. Since the seventies, a wide variety of of such models has been developed and applied. Examples are linear programming models, gravity models, spatial interaction and entropy models, discrete spatial choice models, chaos models, spatial competition models and many others. Some of these models were mated in behavioral foundations of social or economic choice, others were based on analogous interpretabons from the natural sciences. Some of these models are based on macro cost minimizing principles. There is thus a great variety of approaches to the analysis of network behavior. This volume aims to offer an overview of the great potential of neural network analysis for research applications in the transportation sector. It does not only focus on engineering types of approaches, but also on social science applications in the transport systems, organized at VIT in Finland.