ppxscal/embedding_network huggingface dataset:
The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case
Authors: Yefim Dinitz, Alek Vainshtein
Venue: SIAM Journal on Computing (2000)

Let G=(V,E) be an undirected graph, S be a subset of its vertices, ${\frak C}_S$ be the set of minimum edge-cuts partitioning S, and $\lambda_S$ be the cardinality of such a cut. We suggest a graph structure, called the connectivity carcass of S, that represents both cuts in $\frak C_S$ and the partition of V by all these cuts; its size is $O(\min\{|E|,\lambda_S|V|\})$. In this paper we present general constructions and study in detail the case $\lambda_S$ odd; the specifics of the case $\lambda_S$ even are considered elsewhere. For an adequate description of the connectivity carcass we introduce a new type of graph: locally orientable graphs, which generalize digraphs. The connectivity carcass consists of a locally orientable quotient graph of G, a cactus tree (in case $\lambda_S$ odd, just a tree) representing all distinct partitions of S by cuts in ${\frak C}_S$, and a mapping connecting them. One can build it in O(|S|) max-flow computations in G. For an arbitrary sequence of u edge insertions not changing $\lambda_S$, the connectivity carcass can be maintained in time $O(|V|\min\{|E|,\lambda_S|V|\}+u)$. For two vertices of G, queries asking whether they are separated by a cut in $\frak C_S$ are answered in O(1) worst-case time per query. Another possibility is to maintain the carcass in $O(|S|\min\{|E|,\lambda_S|V|\}+u)$ time, but to answer the queries in O(1) time only if at least one of the vertices belongs to S.
Cisco Networking Academy Program (Older Edition)
Authors: Jim Lorenz
Venue:  (2000)

:Cisco Networking Academy Program: Lab Companion, Volume I is the lab companion product to the Cisco Networking Academy Program Semesters 1 and 2. This book saves instructors and students the time and cost of printing out the online materials. Each Lab Companion contains all the labs from Version 2.0 of the online curriculum, along with additional instruction and bonus labs not found anywhere else.
Creating Wealth on the Web with Quixtar
Authors: Cynthia Stewart-Copier, Jennifer Basye Sander
Venue:  (2001)

:The hot new book that shows you how to make big money with e-commerce and network marketing! Let Creating Wealth on the Web with Quixtar lead you on the path to financial success. With the advances in the Internet and e-commerce, network marketing has now taken a giant step forward - onto the Web. The largest of these new Internet companies is Quixtar, an online business venture that already involves millions of people and is ready for you to share in the profits. Don't miss out on this money-making opportunity! Creating Wealth on the Web with Quixtar provides you with the tools you need to build financial success, including: Eight simple steps to eye-popping returns in network marketing How to build your own dream business online Your own motivation manual An exclusive interview with the legendary Dexter Yager, one of Quixtar's founders. And much more!
The phase transition in a random hypergraph
Authors: Michał Karon´ski, Tomasz Łuczak
Venue: Journal of Computational and Applied Mathematics (2002)

We show that in the evolution of the random d-uniform hypergraph Gd(n,M) the phase transition occurs when M = n/d(d - 1) + O(n2/3). We also prove local limit theorems for the distribution of the size of the largest component of Gd(n,M) in the subcritical and in the early supercritical phase.
Discovery in multi-attribute data with user-defined constraints
Authors: Chang-Shing Perng, Haixun Wang, Sheng Ma, Joseph L. Hellerstein
Venue: ACM SIGKDD Explorations Newsletter (2002)

There has been a growing interest in mining frequent itemsets in relational data with multiple attributes. A key step in this approach is to select a set of attributes that group data into transactions and a separate set of attributes that labels data into items. Unsupervised and unrestricted mining, however, is stymied by the combinatorial complexity and the quantity of patterns as the number of attributes grows. In this paper, we focus on leveraging the semantics of the underlying data for mining frequent itemsets. For instance, there are usually taxonomies in the data schema and functional dependencies among the attributes. Domain knowledge and user preferences often have the potential to significantly reduce the exponentially growing mining space. These observations motivate the design of a user-directed data mining framework that allows such domain knowledge to guide the mining process and control the mining strategy. We show examples of tremendous reduction in computation by using domain knowledge in mining relational data with multiple attributes.
On the Identification of Zero Variables in an Interior-Point Framework
Authors: Francisco Facchinei, Andreas Fischer, Christian Kanzow
Venue: SIAM Journal on Optimization (1999)

We consider column sufficient linear complementarity problems and study the problem of identifying those variables that are zero at a solution. To this end we propose a new, computationally inexpensive technique that is based on growth functions. We analyze in detail the theoretical properties of the identification technique and test it numerically. The identification technique is particularly suited to interior-point methods but can be applied to a wider class of methods.
Digimon World II, 2nd edition
Authors: David Cassady
Venue:  (2001)

:Complete walkthroughs for all of the Digi-DomainsComprehensive coverage on digivolving your DigimonSecrets of DNA digivolvingLists of all Digimon and Digi-Beetle ItemsBattle tactics for all Domain Bosses 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
AutoCAD for Interior Design and Space Planning: Using AutoCAD 2000, 1st edition
Authors: Beverly L. Kirkpatrick, James M. Kirkpatrick
Venue:  (2000)

:Using a non-technical writing style and hands-on PROMPT/RESPONSE tutorial approach this text helps readers learn AutoCAD by actually using it in planning and designing a wide variety of realistic interiors. The text takes readers step-by-step through the creation of all of the drawings necessary for a space planning project (Tenant Space Project)  from floor plans, elevations, and furniture planning, through power and lighting plans, to isometric and three-dimensional drawings. Includes new Startup Dialog Box, using Start from Scratch, Templates, and Wizards. Uses a Computer PROMPT/User RESPONSE format that leads readers through each new AutoCAD command which allows the text to be used as either a self-paced tutorial or in a lecture-lab situation. Features exercises that are geared to interior designers and space planners. Features Margin Menus that show how to locate each new AutoCAD command within the AutoCAD menus and toolbars. Contains Learning Objectives and Review Questions in every chapter. Includes both fill-in-the-blank and multiple-choice items. Appropriate for interior designers.
National Science Foundation Graduate Research Fellowship Program
Authors: Jeffrey Johnson
Venue: ACM SIGCSE Bulletin (2002)

The objective of the Graduate Research Fellowship Program (GRFP) of the National Science Foundation (NSF) is to support the vitality of the human resource base of science, mathematics, and engineering in the United States and to reinforce its diversity. Oak Ridge Associated Universities (ORAU) manages the GRFP application and review processes under contract to NSF.
DiaSketches
Authors: Michael Anderson, Chris Armen
Venue: Proceedings of the 2nd international symposium on Smart graphics (2002)

The fields of sketch understanding and diagrammatic reasoning share some goals and motivations. We propose that both fields can benefit from a research agenda that addresses these common goals, leveraging techniques from one field to address questions in the other. We present the diaSketch as an example of such synergy.
Sale must end: should discount methods be cleared off HCI's shelves?
Authors: Gilbert Cockton, Alan Woolrych
Venue: interactions (2002)

If you ask someone outside the Human-Computer Interaction (HCI) field about usability, many will mention the "classic" discount methods popularized by Jakob Nielsen and others. Discount methods have the appeal of seeming easy to do, and, more importantly for business, being inexpensive. This is especially attractive to smaller startup companies with low budgets. But are discount methods really too risky to justify the "low" cost? This month's business column authors think so, based on their research and experience. Indeed, they believe that these discount methods may actually backfire and end up discrediting the field. Following a lively discussion on the CHI-WEB listserv, we asked them to explain what they see the risks to be, and what they believe we, as a profession, can and should do about it.<BR>--- David Siegel and Susan Dray
An IDL to Ada95 mapping to support propagation modeling
Authors: D. Needham, S. Demurjian, T. Peters
Venue: ACM SIGAda Ada Letters (2000)

Representing dynamic interdependencies between design objects is an essential part of modeling the critical software communications found in complex software systems. This paper investigates the modeling of propagations (our term for dynamic interdependencies), which are captured using design-level triggers for specifying dynamic behavior across object types. We focus on the CORBA-compliant utilization of our propagation model to support distributed, propagation-focused applications. We develop a propagation-specific interface in IDL, and examine Ada 95 source code that meets the requirements specified by the IDL design. An example of the CORBA-compliant propagations involved in the maintenance of topological invariance in the industrial domain is examined.
Comments on "On the Applicability of Weyuker Property 9 to Object-Oriented Structural Inheritance Complexity Metrics"
Authors: Lu Zhang, Dan Xie
Venue: IEEE Transactions on Software Engineering (2002)

In this correspondence, we point out some discrepancies in a correspondence published in this journal recently by Gursaran and Roy. Due to the discrepancies, the central two theorems and two corollaries claimed in that correspondence may not be held true in some extreme circumstances and, therefore, its main conclusion cannot be drawn for all the possible cases.
How Stringent Is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
Authors: Stefan Scholtes, Michael Stöhr
Venue: Mathematics of Operations Research (2001)

The linear independence constraint qualifications (LICQ) plays an important role in the analysis of mathematical programs with complementarity constraints (MPCCs) and is a vital ingredient to convergence analyses of SQP-type or smoothing methods, cf., e.g., Fukushima and Pang (1999), Luo et al. (1996), Scholtes and StÃ¶hr (1999), Scholtes (2001), StÃ¶hr (2000). We will argue in this paper that LICQ is not a particularly stringent assumption for MPCCs. Our arguments are based on an extension of Jongen's (1977) genericity analysis to MPCCs. His definitions of nondegenerate critical points and regular programs extend naturally to MPCCs and his genericity results generalize straightforwardly to MPCCs in standard form. An extension is not as straightforward for MPCCs with the particular structure induced by lower-level stationarity conditions for variational inequalities or optimization problems. We show that LICQ remains a generic property for this class of MPCCs.
Discovering Microsoft Works 2.0 for the IBM Personal Computer
Authors: Babette Kronstadt, David Sachs
Venue:  (1993)

:Features coverage of word processing, spreadsheets, database management, graphics and telecommunications. ``Projects'' help students through practical, real-world exercises. Students benefit by learning only one command set as well as being able to access different applications easily. Contains scores of screen dumps, end-of-chapter command charts, short drill-and-practice exercises and lists of key terms. Also includes information on how to use a mouse effectively; discusses Works' thesaurus, dictionary, help, search, footnote and bookmark functions.
Array form representation of idiom recognition system for numerical programs
Authors: Sato Hiroyuki
Venue: Proceedings of the 2001 conference on APL: an arrays odyssey (2001)

Today, PSE emerges as a promising approach for providing programmers with high-level abstract functions Particularly for numerical programs which essentially handle large arrays, abstract representation of array-handling functions is very important. Idiom recognition can be a bridge between abstract source programs and concrete architectures. It can remove obstacles of gaps between the two that cannot be bridged by today's state of the art compilers. A major problem in idiom recognition is intermediate representation. This paper applies term rewriting theory---a very general framework --- to an idiom recognition system. Specifically, we apply it to the idiom recognition problem of Fortran90/95 matrix manipulations, and show that the Fortran90/95 system is never a trivial system. Straight forms are introduced to make the idiom recognition system more powerful. We make a completion procedure based on this Fortran90/95 system, and show some non-trivial idiom recognition using our theory.
Telecommunications Network Management: Technologies and Implementations, 1st edition
Authors: Thomas Plevyak
Venue:  (1997)

:"This volume brings together the full range of topics in telecommunications network management, including the evolution of management techniques and first-hand accounts of management experiences in new technologies and services. The reader will understand how information modeling and distributed management help in simplifying network representation, introducing computing platforms, where necessary, and offsetting operations costs.Telecommunications Network Management is key to successfully keeping up with the increasingly market-driven telecommunications field. It covers a wide range of topics from the evolution of management techniques to the experiences of management in new technologies and services. Where the authors' previous book, NETWORK MANAGEMENT INTO THE 21st CENTURY, introduced network management techniques, standards, and applications, this book covers the implementation of these concepts in today's telecommunications industry. Foremost experts in the field have contributed all original material for this important book that will provide the reader with experiences in implementing management infrastructures for information networking."Sponsored by:IEEE Communications Society.
Robust treatment of collisions, contact and friction for cloth animation
Authors: Robert Bridson, Ronald Fedkiw, John Anderson
Venue: Proceedings of the 29th annual conference on Computer graphics and interactive techniques (2002)

We present an algorithm to efficiently and robustly process collisions, contact and friction in cloth simulation. It works with any technique for simulating the internal dynamics of the cloth, and allows true modeling of cloth thickness. We also show how our simulation data can be post-processed with a collision-aware subdivision scheme to produce smooth and interference free data for rendering.
Special Ultrametric Matrices and Graphs
Authors: Miroslav Fiedler
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

Special ultrametric matrices are, in a sense, extremal matrices in the boundary of the set of ultrametric matrices introduced by Mart&iacute;nez, Michon, and San Mart&iacute;n [ SIAM J. Matrix Anal. Appl., 15 (1994), pp. 98--106]. We show a simple construction of these matrices, if of order n, from nonnegatively edge-weighted trees on n vertices, or, equivalently, from nonnegatively edge-weighted paths. A general ultrametric matrix is then the sum of a nonnegative diagonal matrix and a special ultrametric matrix, with certain conditions fulfilled. The rank of a special ultrametric matrix is also recognized and it is shown that its Moore--Penrose inverse is a generalized diagonally dominant M-matrix. Some results on the nonsymmetric case are included.
Constant bounds on the moments of the height of binary search trees
Authors: J. M. Robson
Venue: Theoretical Computer Science (2002)

We show that binary search trees of a given size tend to have smaller height when the root division is into two subtrees of more balanced sizes. We deduce that the expectation of the absolute value of the difference in height of two binary search trees of the same number of nodes is less than 3.135 infinitely often. We also deduce strong upper bounds on the probability of large deviations from the median. Putting together these two conclusions and a simple and plausible conjecture on critical nodes leads to O(1) bounds on all moments of binary search tree heights.
LabVIEW Advanced Programming Techniques, 1st edition
Authors: Rick Bitter
Venue:  (2000)

:The graphical nature of LabVIEW makes it ideal for test and measurement applications and its use brings significant improvements in productivity over conventional programming languages. However, comprehensive treatments of the more advanced topics have been scattered and difficult to find-until now. LabVIEW Advanced Programming Techniques offers in-depth coverage of the subjects that move you to the next level of programming-the level that allows full exploitation of LabVIEW's power and utility. These topics include: Active X: Gain the background needed to use Active X in your LabVIEW applications. Object-Oriented Technologies: Get a clear description of object analysis and see examples of how it can apply to LabVIEW applications. Application structure: Discover a three-tiered architecture that results in robust, flexible, and easy to maintain code. State machines: Get extensive coverage of several types of state machines-arguably the most useful programming tool available. Exception handling: Learn how to detect, process, and resolve exceptions in your code. Instrument drivers: See the value drivers bring to code readability and maintenance -Learn the techniques for constructing reusable drivers. Multi-threading: Learn how to look at a LabVIEW code diagram to determine how many threads your application can use, then optimize the performance of the application.
A constraint-based architecture for local search
Authors: Laurent Michel, Pascal Van Hentenryck
Venue: Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2002)

Combinatorial optimization problems are ubiquitous in numerous practical applications. Yet most of them are challenging, both from computational complexity and programming standpoints. Local search is one of the main approaches to address these problems. However, it often requires sophisticated incremental algorithms and data structures, and considerable experimentation. This paper proposes a constraint-based, object-oriented, architecture to reduce the development time of local search algorithms significantly. The architecture consists of declarative and search components. The declarative component includes invariants, which maintain complex expressions incrementally, and differentiable objects, which maintain properties that can be queried to evaluate the effect of local moves. Differentiable objects are high-level modeling concepts, such as constraints and functions, that capture combinatorial substructures arising in many applications. The search component supports various abstractions to specify heuristics and meta-heuristics. We illustrate the architecture with the language Comet and several applications, such as car sequencing and the progressive party problem. The applications indicate that the architecture allows for very high-level modeling of local search algorithms, while preserving excellent performance.
Zope: Web Application Construction Kit
Authors: Martina Brockmann, Mark Pratt, Katrin Kirchner
Venue:  (2001)

:Zope is a powerful application server and content management system, but because it is an open-source technology there is a tremendous need for reliable, practical documentation showing developers how to leverage Zope to its fullest.Written by developers at Beehive Electronic Media Inc., one of the world's leading Zope consulting firms, Zope Web Application Construction Kit provides readers with a practical, straightforward guide  along with all the needed software  to setting up and developing powerful Web applications using Zope.
Multiresolution Analysis and Supercompact Multiwavelets
Authors: Richard M. Beam, Robert F. Warming
Venue: SIAM Journal on Scientific Computing (2000)

The Haar wavelets can represent exactly any piecewise constant function. The motivation for the present development is Alpert's family of compact orthogonal multiwavelets that can represent exactly any piecewise polynomial function. We choose to derive the algorithm in the style and notation of Harten's multiresolution analysis as extended to multiwavelets by the authors. We begin with a description of the nested grid hierarchy. Next comes the decomposition, which is the heart of the algorithm, and finally the reconstruction. The basis functions (which are nonfractal) retain the spatial compactness of the Haar basis functions, which enhances the algorithm application to nonperiodic and piecewise continuous data.
Inside MacIntosh: QuickTime
Authors: Apple Computer Inc., Apple Computer Inc Staff
Venue:  (1993)

:sophisticated and diverse Mac OS that developers work with today. Apple is meticulous in its documentation of the Mac OS, and the result is the Inside Macintosh series. Apple and A-W make this documentation available to you in a variety of formats: Individual bound books (paper! how novel!) Electronic full text in DocViewer format: Inside Mac CD-ROM Electronic quick reference: Macintosh Programmer's Toolbox Assistant The complete list of 27 titles is pretty daunting, but take heart. You can think of Inside Mac topics in two groups: those that are common to all Macs, and those that are specific to your application. The core technology topics: The Macintosh Toolbox Interapplication Communication Text Imaging with QuickDraw Memory, Processes, Files, Operating System Utilities, Devices Specialized technology topics: QuickTime PowerPC System Software, PowerPC Numerics Sound Networking AOCE QuickDraw GX