ppxscal/embedding_network huggingface dataset:
Interworking of a distributed architecture for wireless PCS networks with conventional networks: issues and illustrations
Authors: R. S. Kalbag, D. Medhi
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1997)

A distributed architecture for wireless PCS networks is appealing due to the separation of call and connection control and the use of operations which run in parallel that can result in reduced data management load, signaling load as well as reduced post-dial delay; the Distributed Architecture for Wireless PCS Networks (DAWN) we have recently developed is such an architecture. On the other hand, centralized architecture such as IS-41 has already been deployed in several wireless networks. Thus, due to imbedded base of conventional architecture such as the IS-41 architecture, the successful deployment of a distributed architecture such as DAWN is highly dependent on the ability to phase in the new architecture and, consequently, to provide seamless interworking capabilities so that a mobile user can move between any two areas where the architectures are different. In this paper, we address the interworking aspects of DAWN with IS-41 based networks. Various IS-41 call scenarios are presented to demonstrate the workings of the interworking function. Interworking with PSTN (public switched telephone network) and handling of intersystem handoffs is also discussed.
Randomness is Hard
Authors: Harry Buhrman, Leen Torenvliet
Venue: SIAM Journal on Computing (2000)

We study the set of incompressible strings for various resource bounded versions of Kolmogorov complexity. The resource bounded versions of Kolmogorov complexity we study are polynomial time CD complexity defined by Sipser, the nondeterministic variant CND due to Buhrman and Fortnow, and the polynomial space bounded Kolmogorov complexity CS introduced by Hartmanis. For all of these measures we define the set of random strings $\mathrm{R}^{\mathit{CD}}_t$, $\mathrm{R}^{\mathit{CND}}_t$, and $\mathrm{R}^{\mathit{CS}}_t$ as the set of strings $x$ such that $\mathit{CD}^t(x)$, $\mathit{CND}^t(x)$, and $\mathit{CS}^s(x)$ is greater than or equal to the length of $x$ for $s$ and $t$ polynomials. We show the following: $\mathrm{MA} \subseteq \mathrm{NP}^{\mathrm{R}^{\mathit{CD}}_t}$, where $\mathrm{MA}$ is the class of Merlin--Arthur games defined by Babai. $\mathrm{AM} \subseteq \mathrm{NP}^{\mathrm{R}^{\mathit{CND}}_t}$, where $\mathrm{AM}$ is the class of Arthur--Merlin games. $\mathrm{PSPACE} \subseteq \mathrm{NP}^{\mathrm{cR}^{\mathit{CS}}_s}$. In the last item $\mathrm{cR}^{\mathit{CS}}_s$ is the set of pairs $\langle x,y \rangle$ so that x is random given y. These results show that the set of random strings for various resource bounds is hard for complexity classes under nondeterministic reductions.This paper contrasts the earlier work of Buhrman and Mayordomo where they show that for polynomial time deterministic reductions the set of exponential time Kolmogorov random strings is not complete for EXP.
QuarkXPress 4 for Dummies, 1st edition
Authors: Barbara Assadi, Galen Gruman
Venue:  (1997)

:Using the tips and techniques offered in QuarkXPress 4 For Dummies, Macintosh and Windows users alike can exploit the full power of QuarkXPress. This book answers your questions about QuarkXPress itself, about desktop publishing, and about layout before you even know you have questions! You'll find shortcuts, tips, and advice from the pros to help you create top-notch newsletters and stunning brochures -- the fun and easy way! Inside, find helpful advice on how to Discover the fundamentals of QuarkXPress and important page layout tricks Find detailed explanations of all the major tools for layout, text editing, special effects, and printing Manipulate your text and graphics files to cut down on extra work Develop your hidden artistry with the new QuarkXPress graphics tools Recognize the best typefaces and layouts for producing a professional look Collaborate easily with colleagues using Windows or Mac versions of QuarkXPress Save time and effort by using shortcuts and automating common tasks Use fancy features like text wrap, free-form text, stripes, and freehand drawing tools
The Opera 5.X Book: Browsing the Web with Speed and Style
Authors: J. S. Lyster
Venue:  (2001)

:Get the most out of the Opera Web browser with The Opera 5.x Book. Learn how to customize and configure Opera, make it work with plug-ins, save and organize your browsing sessions, work with multiple windows, and even how to use Opera as an interactive kiosk.
N Roots of the Secular Equation in O(N) Operations
Authors: Oren E. Livne, Achi Brandt
Venue: SIAM Journal on Matrix Analysis and Applications (2002)

We present a novel multilevel algorithm which computes N roots of the secular equation in O(C N) computer operations, where C depends on the desired accuracy. Since current methods of solution require O(N2) operations, this algorithm can drastically reduce the computational effort in various applications, including updating the singular value decomposition and symmetric eigenvalue problems and solving constrained least-squares problems. The algorithm is based on the multilevel approach for fast evaluation of integral transforms. It has been adapted for the efficient solution of the secular equation. We have also incorporated discontinuous kernel softening, a technique which improves the implementation of multilevel summation algorithms toward theoretical optimality. We present and discuss numerical results, parallelization, and other related applications of the multilevel approach, including a possible substitute for current symmetric tridiagonal eigenbasis solvers (such as the divide and conquer method).
Vmware 2 for Linux with Cdrom
Authors: Jason Compton, Joshua O. Testerman
Venue:  (2000)

:Are you tired of the "one machine, one operating system" model of computing? VMware 2.0 frees you from this constraint and enables multiple operating systems and applications to run concurrently on a single machine without disk partitioning or rebooting. VMware 2.0 for Linux is written to help you run Windows applications, such as Outlook, while running your favorite flavor of Linux. This reliable reference walks you through installing VMware, editing configuration files, and installing operating systems to run on it. For both corporate and home users, VMware 2.0 for Linux will show you how to increase productivity and save time by using VMware 2.0 to avoid launching the Windows OS every time you want to work with Windows software. The included CD-ROM contains a trial version of VMware, with special pre-installs courtesy of VMware.
Online Text Prediction with Recurrent Neural Networks
Authors: Juan Antonio Pérez-Ortiz, Jorge Calera-Rubio, Mikel L. Forcada
Venue: Neural Processing Letters (2001)

Arithmetic coding is one of the most outstanding techniques for lossless data compression. It attains its good performance with the help of a probability model which indicates at each step the probability of occurrence of each possible input symbol given the current context. The better this model, the greater the compression ratio achieved. This work analyses the use of discrete-time recurrent neural networks and their capability for predicting the next symbol in a sequence in order to implement that model. The focus of this study is on online prediction, a task much harder than the classical offline grammatical inference with neural networks. The results obtained show that recurrent neural networks have no problem when the sequences come from the output of a finite-state machine, easily giving high compression ratios. When compressing real texts, however, the dynamics of the sequences seem to be too complex to be learned online correctly by the net.
Online Communities: Commerce, Community, Action, and the Virtual University, 1st edition
Authors: Chris Werry, Miranda Mowbray
Venue:  (2000)

:Online communities: Understanding them, building them, making them work. A comprehensive guide to online communities-how they develop and how they impact e-commerce, culture, politics, and education Why some online communities thriveand others fail Contributors include Richard Stallman, founder of the Free Software Foundation Whether you're an online community developer, marketer, political activist, or academic, you depend on online communities. In this book, leading community-builders in e-commerce, non-profit, open source, and higher education share their insights on crucial issues such as: How are online communities organized? How do they change? What do their participants expect from them? What makes them work? And how can you make yours work better? Coverage includes: Leading models and key lessons for organizers of online communities. Corporate-sponsored online communities: social impacts and success factors Building alliances between diverse online communities Uses of online communities worldwide: the U.S., Great Britain, Mexico, France, Italy, Bosnia, South Africa, Brazil, Nicaragua, and elsewhere Distance learning: the promise and the reality Richard Stallman on how online communities can democratize universities Randy Connolly on why online communities may actually decrease social cohesion Chris Werry and Miranda Mowbray bring together an extraordinary range of perspectivesand deliver unprecedented insight into the phenomenon and future of online communities. Whether you're a public policymaker or a systemadministrator, a distance learning professional or an e-commerce executive, you'll find this book interesting and useful.
Microsoft Publisher 2002: Introductory Concepts and Techniques, 1st edition
Authors: Gary B. Shelly, Joy Starks, Thomas J. Cashman
Venue:  (2001)

:Part of the highly successful Shelly Cashman series, this text offers a clear, step-by-step, screen-by-screen approach to learning basic Microsoft Publisher 2002 skills.
Running Microsoft Word 2000, 1st edition
Authors: Charles Rubin, B. Russell
Venue:  (1999)

:A reference that takes readers through the most used tasks and functions of the latest version of Word. It's a comprehensive book packed with examples and loaded with tips from the software experts on how to get the most from Microsoft Word 2000.
Algebraic Mesh Quality Metrics
Authors: Patrick M. Knupp
Venue: SIAM Journal on Scientific Computing (2001)

Quality metrics for structured and unstructured mesh generation are placed within an algebraic framework to form a mathematical theory of mesh quality metrics. The theory, based on the Jacobian and related matrices, provides a means of constructing, classifying, and evaluating mesh quality metrics. The Jacobian matrix is factored into geometrically meaningful parts. A nodally invariant Jacobian matrix can be defined for simplicial elements using a weight matrix derived from the Jacobian matrix of an ideal reference element. Scale and orientation-invariant algebraic mesh quality metrics are defined. The singular value decomposition is used to study relationships between metrics. Equivalence of the element condition number and mean ratio metrics is proved. The condition number is shown to measure the distance of an element to the set of degenerate elements. Algebraic measures for skew, length ratio, shape, volume, and orientation are defined abstractly, with specific examples given. Two combined metrics, shape-volume and shape-volume orientation, are algebraically defined and examples of such metrics are given. Algebraic mesh quality metrics are extended to nonsimplicial elements. A series of numerical tests verifies the theoretical properties of the metrics defined.
Solaris and LDAP Naming Services: Deploying LDAP in the Enterprise, 1st edition
Authors: Tom Bialaski, Michael Haines
Venue:  (2001)

:Solaris and LDAP Naming Services is a practical guide to implementing Solaris 8 native LDAP on clients and servers. Basic LDAP concepts are covered, as well as naming and authentication architectural details. This BluePrint outlines strategies for consolidating legacy directory services using LDAP technology.
An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
Authors: Zhi-Quan Luo, Jie Sun
Venue: SIAM Journal on Optimization (1998)

We consider the analytic center based column generation algorithm for the problem of finding a feasible point in a set defined by a finite number of convex quadratic inequalities. At each iteration the algorithm computes an approximate analytic center of the set defined by the intersection of quadratic inequalities generated in the previous iterations. If this approximate analytic center is a solution, then the algorithm terminates; otherwise a quadratic inequality violated at the current center is selected and a new quadratic cut (defined by a convex quadratic inequality) is placed near the approximate center. As the number of cuts increases, the set defined by their intersection shrinks and the algorithm eventually finds a solution to the problem. Previously, similar analytic center based column generation algorithms were studied first for the linear feasibility problem and later for the general convex feasibility problem. Our method differs from these early methods in that we use "quadratic cuts" in the computation instead of linear cuts. Moreover, our method has a polynomial worst case complexity of $O(n\ln \frac{1}{\varepsilon})$ on the total number of cuts to be used, where $n$ is the number of convex quadratic polynomial inequalities in the problem and $\varepsilon$ is the radius of the largest ball contained in the feasible set. In contrast, the early column generation methods using linear cuts can only solve the convex quadratic feasibility problem in pseudopolynomial time.
How to Do Everything with Your Scanner
Authors: Jill Gilbert
Venue:  (2001)

:How to Do Everything with Your Scanner contains projects, resources, ideas, and simple instructions to help you get the most from your scanner for home or business use. Learn to use all your scanner's features, as well as professional-caliber image-editing tools that enable you to do everything from colorizing black-and-white photos to switching heads, bodies and backgrounds. Explore graphic concepts including color correction, resolution, and image optimizing--plus scanner repair, troubleshooting, and more. Let this great resource show you how to enhance and preserve your family memories, and create state-of-the-art, professional images--all with your scanner! Pick the best scanner, features, and applications for you Organize and repair forgotten and damaged photos Easily create calendars, greeting cards, and gift items Learn to use sophisticated image-editing tools formerly available only to professional photographers Digitally cut, paste, and combine multiple scanned photos into a single scene or collage Copy and send scanned photos by e-mail, and post them on the Web for friends and family Create your own Web site featuring scanned photos, even if you have no prior experience with Web design Design and create business cards, stationary, brochures, and slide presentations using scanned images Scan negatives, slides, magazines, 3D items, and more Includes 16 full-color pages of scanning and photo-editing projects you can do yourself.
Microsoft Visual J# .Net (Core Reference), 1st edition
Authors: John Sharp, Andy Longshaw
Venue:  (2002)

:This comprehensive reference book is packed with information Java developers need to take full advantage of the Microsoft .NET Framework and Visual Studio-while using the language of their choice! Presented in an easy-to-use, easy-to-browse format, this CORE REFERENCE gives developers the authoritative technical detail they need to leverage the richness of the .NET Framework-all in a single volume and straight from the source!
Combining topological and size information for spatial reasoning
Authors: Alfonso Gerevini, Jochen Renz
Venue: Artificial Intelligence (2002)

Information about the size of spatial regions is often easily accessible and, when combined with other types of spatial information, it can be practically very useful. In this paper we introduce four classes of qualitative and metric size constraints, and we study their integration with the Region Connection Calculus RCC-8, a well-known approach to qualitative spatial reasoning with topological relations. We propose a new path-consistency algorithm for combining RCC-8 relations and qualitative size relations. The algorithm is complete for deciding satisfiability of an input set of topological constraints over one of the three maximal tractable subclasses of RCC-8 containing all the basic relations. Moreover, its time complexity is cubic and is the same as the complexity of the best-known method for deciding satisfiability when only these topological relations are considered. We also provide results on finding a consistent scenario in cubic time for these combined classes. Regarding metric size constraints, we first study their combination with RCC-8 and we show that deciding satisfiability for the combined sets of constraints is NP-hard, even when only the RCC-8 basic relations are used. Then we introduce RCC-7, a subalgebra of RCC-8 that can be used for applications where spatial regions cannot partially overlap. We show that reasoning with the seven RCC-7 basic relations and the universal relation is intractable, but that reasoning with the RCC-7 basic relations combined with metric size information is tractable. Finally, we give a polynomial algorithm for the latter case and a backtracking algorithm for the general case.
Virtual artefacts to support negotiation within an augmented collaborative environment for alternate dispute resolution
Authors: Peter Dew, Aphrodite Galata, John Maxfield, Daniela Romano
Venue: Proceedings of the 4th international conference on Collaborative virtual environments (2002)

Commercial organisations that are in dispute will sometimes seek to settle their differences without resorting to legal proceedings through a process of structured and facilitated negotiation called Alternate Dispute Resolution (ADR). Traditionally ADR negotiations are conducted by co-locating the mediator, witnesses, supporting evidence and representatives of each party. This paper describes a novel experiment that has been conducted at the University of Leeds to investigate whether an augmented collaborative environment could provide a realistic alternative to co-locating individuals for ADR negotiations. The individuals that took part in the experiment included an experienced mediator and practising legal representatives. The augmented collaborative environment was based on a video conferencing system that was enhanced to enable virtual artefacts representing items of evidence to be blended directly into the video streams. This experiment sits within the framework of the Court 21 Project, that is seeking to identify how new technology can be used to improve the different aspects of the legal system [10].
Kolmogorov random graphs only have trivial stable colorings
Authors: Qi Cheng, Fang Fang
Venue: Information Processing Letters (2002)

In this paper, we prove that random graphs only have trivial stable colorings. Our result improves Theorem 4.1 in [Proc. 20th IEEE Symp. on Foundations of Comput. Sci., 1979, pp. 39-46]. It can be viewed as an effective version of Corollary 2.13 in [SIAM J. Comput. 29 (2) (2000) 590-599]. As a byproduct, we also give an upper bound of the size of induced regular subgraphs in random graphs.
First order programming logic
Authors: Robert Cartwright, John McCarthy
Venue: Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1979)

First Order Programming Logic is a simple, yet powerful formal system for reasoning about recursive programs. In its simplest form, it has one major limitation: it cannot establish any property of the least fixed point of a recursive program which is false for some other fixed point. To rectify this weakness, we present two intuitively distinct approaches to strengthening First Order Programming Logic and prove that either extension makes the logic relatively complete. In the process, we prove that the two approaches are formally equivalent. The relative completeness of the extended logic is significant because it suggests it can establish all "ordinary" properties (obviously we cannot escape the Godelian incompleteness inherent in any programming logic) of recursive programs including those which compute partial functions.The second contribution of this paper is to establish that First Order Programming Logic is applicable to iterative programs as well. In particular, we show that the intermittent assertions method--an informal proof method for iterative programs which has not been formalized--is conveniently formalized simply as sugared First Order Programming Logic applied to the recursive translations of iterative programs.
Making variables abstract: an equational theory for Russell
Authors: Alan Demers, James Donahue
Venue: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1983)

One of the fundamental notions of programming, and thus of programming languages, is the variable. Recently, the variable has come under attack. The proponents of "functional programming" have argued that variables are at the root of all our problems in programming. They claim that we must rid our languages of all manifestations of the "vonNeumann bottleneck" and learn to live in the changeless world of functional combinators.While we may not, believe all the claims of the functional programming advocates, there is evidence that the treatment of variables in most programming languages leaves much to be desired. In this paper we discuss how to make variables "abstract", i.e., how to introduce the notion of variable in to a language so that variables have reasonable mathematical properties. This paper includes:--- a discussion of language design principles that allow a more mathematical treatment of variables in programming language, and--- a description of an equational logic for the programming language Russell [Boehm80]. Although this logic follows much of the development of abstract data types (cf. [Guttag78]), it is novel in its treatment of a language in which expressions not only produce values but also can have effects. We discuss the over all structure of the logic and present in detail the rules particularly relevant to the semantics of variables. A complete presentation of the logic appears in [Demers82], and the rule numbers in this paper agree with the numbers used there.In the next section, we discuss the underlying language principles needed to make an equational specification of variables possible. In the sections that follow, we present a logic that does so for Russell.
Tangled Web: Tales of Digital Crime from the Shadows of Cyberspace
Authors: Richard Power
Venue:  (2000)

:With the intense growth of e-business, we hear about an increase in hacking and technology-based criminal incidents. Institutions such as Citibank and Ebay have faced intrusions that have cost them millions of dollars in damages. With the onset of these criminal attacks, there is an increase in demand for products and services that provide more information for people. Tangled Web: Tales of Digital Crime from the Shadows of Cyberspace portrays the shadow side of cyberspace by taking you into the lairs of hackers, crackers, researchers, private investigators, law enforcement agents and intelligence officers. The book covers what kinds of cyber-crimes are going to affect business on the Internet, their cost, how they are investigated, and the motivation of hackers and virus writers. Also covered are the problems faced by law enforcement, corporate cyber security professionals, and real-world examples of cyber crimes and lessons learned.