ppxscal/embedding_network huggingface dataset:
Achieving interoperability for integration of heterogeneous COTS geographic information systems
Authors: Shengru Tu, Liang Xu, Mahdi Abdelguerfi, Jay J. Ratcliff
Venue: Proceedings of the 10th ACM international symposium on Advances in geographic information systems (2002)

Using multiple commercial off-the-shelf (COTS) GIS suites is a common phenomenon, because different COTS products often have different strengths in various applications. On the other hand, deploying heterogeneous GIS software has the tendency to form fragmented data sets and to cause inconsistency. Data consolidation is an effective way to preserve data integrity. To accomplish this, we must achieve interoperability between different GIS tools. While vector spatial data have the standard database models to support interoperability, raster based images have been conventionally managed as files. Compared to the database approach, the file-based management for raster data is disadvantageous in terms of performance and flexibility. We implemented an adapter that allowed the file-based GIS tools to access the raster data storage in databases managed by a COTS software product. To integrate the COTS GIS into the Java 2 Platform Enterprise Edition (J2EE) framework, we have further enhanced this adapter and made it compliant to the J2EE Connector Architecture (J2EE-CA) standard. Using this kind of J2EE-CA adapter, any GIS can be managed by any J2EE server. The J2EE framework is an ideal foundation for building enterprise-wide geographic information systems.
Safe and Secure: Secure Your Home Network and Protect Your Privacy Online
Authors: Arman Danesh, Ali Mehrassa, Felix Wai-Yin Lau
Venue:  (2001)

:Every day the media is filled with stories about threats from the Internet. Large companies have their computer systems invaded by attackers, government Web sites are altered by pranksters, people's credit card information is stolen, and increasingly home Internet users find computers under attack. This book is designed for home Internet users who want to secure their systems and protect their privacy. It will guide you through the nuances of computer security and help you choose the best tools for your needs.
Contact management: identifying contacts to support long-term communication
Authors: Steve Whittaker, Quentin Jones, Loren Terveen
Venue: Proceedings of the 2002 ACM conference on Computer supported cooperative work (2002)

Much of our daily communication activity involves managing interpersonal communications and relationships. Despite its importance, this activity of contact management is poorly understood. We report on field and lab studies that begin to illuminate it.A field study of business professionals confirmed the importance of contact management and revealed a major difficulty: selecting important contacts from the large set of people with whom one communicates. These interviews also showed that communication history is a key resource for this task. Informants identified several history-based criteria that they considered useful.We conducted a lab study to test how well these criteria predict contact importance. Subjects identified important contacts from their email archives. We then analyzed their email to extract features for all contacts. Reciprocity, recency and longevity of email interaction proved to be strong predictors of contact importance. The experiment also identified another contact management problem: removing 'stale' contacts from long term archives. We discuss the design and theoretical implications of these results.
A Beginner's Guide to Discrete Mathematics
Authors: W.D. D. Wallis
Venue:  (2002)

:This introduction to discrete mathematics is aimed primarily at undergraduates in mathematics and computer science at the freshmen and sophomore levels. The text has a distinctly applied orientation and begins with a survey of number systems and elementary set theory. Included are discussions of scientific notation and the representation of numbers in computers. Lists are presented as an example of data structures. An introduction to counting includes the Binomial Theorem and mathematical induction, which serves as a starting point for a brief study of recursion. The basics of probability theory are then covered.Graph study is discussed, including Euler and Hamilton cycles and trees. This is a vehicle for some easy proofs, as well as serving as another example of a data structure. Matrices and vectors are then defined. The book concludes with an introduction to cryptography, including the RSA cryptosystem, together with the necessary elementary number theory, e.g., Euclidean algorithm, Fermat's Little Theorem. Good examples occur throughout. At the end of every section there are two problem sets of equal difficulty. However, solutions are only given to the first set. References and index conclude the work. A math course at the college level is required to handle this text. College algebra would be the most helpful. 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
Unimodular Triangulations and Coverings of Configurations Arising from Root Systems
Authors: Hidefumi Ohsugi, Takayuki Hibi
Venue: Journal of Algebraic Combinatorics: An International Journal (2001)

Existence of a regular unimodular triangulation of the configuration \Phi^+ \cup\,\{ (0, 0,\,{\ldots}\,, 0 ) \} in {\tt R}^n, where &Phi;+ is the collection of the positive roots of a root system \Phi\,{\subset}\,{\tt R}^n and where (0, 0,\,{\ldots}\,, 0 ) is the origin of {\tt R}^n, will be shown for &Phi; &equals; Bi>n, Ci>n, Di>n and BCi>n. Moreover, existence of a unimodular covering of a certain subconfiguration of the configuration Ai>n+1+ will be studied.
Transact-SQL Programming with CDROM, 1st edition
Authors: Kevin Kline, Andrew Zanevsky
Venue:  (1999)

:Transact-SQL is a procedural language used on both Microsoft SQL Server and Sybase SQL Server systems. It is a full-featured programming language that dramatically extends the power of SQL (Structured Query Language). The language provides programmers with a broad range of features, including: A rich set of datatypes, including specialized types for identifiers, timestamps, images, and long text fields Local and global variables Fully programmable server objects like views, triggers, stored procedures, and batch command files Conditional processing Exception and error handling Full transaction control System stored procedures that reduce the complexity of many operations, like adding users or automatically generating HTML Web pages In recent years, the versions of Transact-SQL have diverged on Microsoft and Sybase systems; the book explains the differences. It also contains up-to-the-minute information on the latest versions: Microsoft SQL Server versions 6.5 and 7.0 and Sybase version 11.5.
Exchange 2000 .NET Server Black Book
Authors: Evan Benjamin, Cherry Beado
Venue:  (2001)

:Exchange 2000. NET Server Black Book is a comprehensive reference to administering, configuring, and troubleshooting Exchange 2000. Written in the popular Black Book problem-solving format, the book teaches you how to utilize the new features of Exchange 2000 and SMTP. It covers migrations issues and planning for: design and integration, site topology and organization, corporate and user's needs, Exchange Service selection, and disaster recovery. It has detailed coverage of how Exchange 2000 works and explains the relationship between Windows 2000 and Exchange 2000.
Systems Management Server 2 Study Guide with Cdrom, 2nd edition
Authors: Lance Mortensen, William Heldman
Venue:  (1999)

:Here's the book you need to prepare for Exam 70-086, Implementing and Supporting Microsoft Systems Management Server 2.0. This Microsoft Certified Professional Approved Study Guide provides full coverage of every exam objective - all the information you need to know; hundreds of challenging review questions, in the book and on the CD; and practical information on implementing SMS in the real world.
Taking advantage of National Science Foundation funding opportunities
Authors: Andrew Bernat, Jane Prey
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

This session will highlight NSF Division of Undergraduate Education programs of interest to college faculty, discussing the requirements and guidelines. It will include a discussion of the characteristics of a competitive proposal and the proposal process.
Geometric Properties of Runge--Kutta Discretizations for Index 2 Differential Algebraic Equations
Authors: Johannes Schropp
Venue: SIAM Journal on Numerical Analysis (2002)

We analyze Runge--Kutta discretizations applied to index 2 differential algebraic equations (DAEs). The asymptotic features of the numerical and the exact solutions are compared. It is shown that Runge--Kutta methods satisfying the first order constraint condition of the DAE correctly reproduce the geometric properties of the continuous system. The proof combines embedding techniques of index 2 DAEs and ordinary differential equations (ODEs) with some invariant manifolds results of Nipp and Stoffer [Attractive Invariant Manifolds for Maps, SAM Research Report 92-11, ETH, Zurich, Switzerland, 1992]. The results support the favorable behavior of these Runge--Kutta methods applied to index 2 DAEs for $t \ge 0$.
Easy Quicken 99
Authors: Que Corporation, Lisa Bucki
Venue:  (1998)

:The four-color visual approach of this title is guaranteed to get the reader up to speed quickly. The new, updated layout and design appeal to today's fast-paced, "need-to-know-it-quickly" audience that wants to learn visually. Full color.
Degenerate Variance Control of a One-Dimensional Diffusion
Authors: Daniel Ocone, Ananda Weerasinghe
Venue: SIAM Journal on Control and Optimization (2000)

Consider an Itô equation for a scalar-valued process that is controlled through a dynamic and adaptive choice of its diffusion coefficient. Such a control is called a variance control and is said to degenerate when it becomes zero. We consider the problem of choosing a control to minimize a discounted, infinite-horizon cost that penalizes state values close to an equilibrium point of the drift and also imposes a control cost. Admissible controls are required to take values in the closed, bounded interval $[0,\sigma_0]$, where $\sigma_0>0$; in particular, the control can be degenerate. In general, there will be a bang-bang optimal control that takes the value $\sigma_0$ in some open set and is zero otherwise. We discuss the existence and properties of solutions to stochastic differential equations with such controls and characterize the value function and optimal control in more detail, in the case of both linear and nonlinear drift. Employing the Hamilton--Jacobi--Bellman equation and results of [N. V. Krylov, Theory Probab. Appl., 17 (1973), pp. 114--131] and [P.-L. Lions, Comm. Pure Appl. Math., 34 (1981), pp. 121--147], we derive sufficient conditions for the existence of single-region optimal controls, construct examples of multiple-region controls, and provide bounds on the number and size of the regions in which the optimal control is positive.
Making Money in Cyberspace
Authors: Paul Edwards, Linda Rohrbough, Sarah Edwards
Venue:  (1998)

:There's no question that the Internet is an increasingly effective place to sell goods or services; yet small and home-based businesspeople are without consulting giants to navigate the frontier of cyberspace for them. With Making Money in Cyberspace, the authors of The Best Home Businesses for the 90s now offer a comprehensive guide that tells you all you need to know about starting and maintaining a successful on-line business from scratch--or taking your current business into cyberspace. This complete guide to cyber-business includes such features as: *the four types of goods that really sell on-line; *what you need to know to design and promote web sites; *selling services in cyberspace; *how to take your existing business on-line--and whether you should; *revealing "case studies" of successful cyber-entrepreneurs; *the biggest mistakes businesses make in cyberspace; and *the best ways to get paid on-line. Packed with stimulating step-by-step instructions, Making Money in Cyberspace is a vital resource for any small business- person who is considering starting or taking a business on-line.
Discrete-Time Orthogonal Spline Collocation Methods for Vibration Problems
Authors: Bingkun Li, Graeme Fairweather, Bernard Bialecki
Venue: SIAM Journal on Numerical Analysis (2001)

Discrete-time orthogonal spline collocation schemes are formulated and analyzed for vibration problems involving various boundary conditions. Each problem is written as a Schrödinger-type system, which is then approximated by Crank--Nicolson and/or alternating direction implicit orthogonal spline collocation schemes. These schemes are shown to be second-order accurate in time and of optimal order accuracy in space in the Hm-norm, m=1,2.
Entity-Relationship Modeling: Foundations of Database Technology, 1st edition
Authors: Bernhard Thalheim
Venue:  (2000)

:Database technology and entity-relationship (ER) modeling have meanwhile reached the level of an established technology. This book presents the achievements of research in this field in a comprehensive survey. It deals with the ER model and its extensions with regard to an integrated development and modeling of database applications and, consequently, the specification of structures, behavior, and interaction." "Apart from research on the ER model and the syntax, semantics, and pragmatics of database modeling the book also presents techniques for the translation of the ER model into classical database models and languages such as relational, hierarchical, and network models and languages, and also into object-oriented models." "The book is of interest for all database theoreticians as well as practitioners who are provided with the relevant fundamentals of database modeling.
Query-by-critique: spoken language access to large lists
Authors: Dan R. Olsen, Jon R. Peachey
Venue: Proceedings of the 15th annual ACM symposium on User interface software and technology (2002)

Spoken language interfaces provide highly mobile, small form-factor, hands-free, eyes-free interaction with information. Uniform access to large lists of information using spoken interfaces is highly desirable, but problematic due to inherent limitations of speech. A speech widget for lists of attributed objects is described that provides for approximate queries to retrieve desired items. User tests demonstrate that this is an effective technique for accessing information using speech.
Saving energy with architectural and frequency adaptations for multimedia applications
Authors: Christopher J. Hughes, Jayanth Srinivasan, Sarita V. Adve
Venue: Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture (2001)

General-purpose processors are expected to be increasingly employed for multimedia workloads on systems where reducing energy consumption is an important goal. Researchers have proposed the use of two forms of hardware adaptation - architectural adaptation and dynamic voltage (and frequency) scaling or DVS - to reduce energy. This paper develops and evaluates an integrated algorithm to control both architectural adaptation and DVS targeted to multimedia applications. It also examines the interaction between the two forms of adaptation, identifying when each will perform better in isolation and when the addition of architectural adaptation will benefit DVS.Our adaptation control algorithm is effective in saving energy and exploits most of the available potential. For the applications and systems studied, DVS is consistently better than architectural adaptation in isolation. The addition of architectural adaptation to DVS benefits some applications, but not all. Finally, in a seemingly counter-intuitive result, we find that while less aggressive architectures reduce energy for fixed frequency hardware, with DVS, more aggressive architectures are often more energy efficient.
Official Microsoft HTML Help Authoring Kit with Cdrom
Authors: Steve Wexler, Brett Foster
Venue:  (1997)

:If you are a developer or a Web site administrator, the Official Microsoft HTML Help Authoring Kit will make it easy for you to provide integrated Help systems that can be delivered via the World Wide Web or a corporate intranet. This book also contains essential Microsoft tools for software developers who are moving Help systems to distributed environments and those who need to maintain their Help systems in a central location. The Official Microsoft HTML Help Authoring Kit gives you a crash course in authoring with HTML Help and then provides the details you need to refine your system. If you already have experience with Help systems, such as those created with Windows Help, the book provides valuable contextual clues and parallel procedures to help you convert Windows Help files to HTML Help.
Illustrated SNA
Authors: Mark Pataky
Venue:  (1998)

:SNA (Systems Network Architecture) is the IBM protocol which has long dominated the mainframe environment. This book explains the complicated architecture in practical terms, laying out network design guidelines for multiprotocol SNA. Disk contains PowerPoint slides drawn from the book for use in reader presentations, seminars, or reports.
The NetWare 5: The Complete Reference
Authors: Tom Sheldon, Bill Payne
Venue:  (1998)

:Install and configure NetWare 5 and build a super-efficient, easily manageable internetwork environment. The Complete Reference to NetWare 5 shows you how to take full advantage of the many new features NetWare 5 has to offer - from pure IP support to Z.E.N. works to the enhanced Novell Directory Services (NDS). You'll get step-by-step instructions on how to upgrade your existing network or set up a new network, install network protocols, build a secure Internet server, and manage storage and print services.
A graphical programming system with speech input
Authors: Chacko C. Neroth
Venue: Proceedings of the 1st annual conference on Computer graphics and interactive techniques (1974)

An interactive programming system is described where human speech commands and computer graphic input-output facilities are used for the exchange of information between man and machine. The experimental problem solving environment is one of formulating, specifying, debugging and executing (algebraic) procedures interactively on a small processor. The speech recognition system is a real time, syntax directed, limited vocabulary, highly cost effective scheme specifically tailored to this environment. The data transformation operations of the language are verbally specified and the control flow is specified graphically as a two dimensional directed graph. The semantics of the latter structure is independent of the time sequence of its input. An input restricted (conditional input) pseudo-finite state machine model is used for the continuous syntax checking of the input on an atomic token basis and for directing the speech recognizer. The system has been successfully implemented on a small processor at the University of California, Berkeley. 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
Intelligent Robotic Planning Systems
Authors: Phillip C.-Y Sheu, Q. Xue
Venue:  (1993)

:This volume focuses on the problem of planning in the context of robotics. Unlike most books on robotics planning which are either too abstract or too specific, this one extends the techniques developed for generic planning problems with robotics-specified considerations so that the task of planning can be discussed in a more uniform way. It also includes the latest results in reconfigurable (mobile) robot planning, multiple robot planning, plan recovery, and planning in uncertain environments. This is probably the very first book that provides a theoretical foundation for planning techniques and their applications. It also bridges the gap that has been existing for a long time between computer scientists and application engineers. It will be of interest to senior and graduate students in engineering and computer science, Al researchers and professionals. Readership: Computer scientists and engineers.
Ado: Activex Data Objects
Authors: Jason T. Roff
Venue:  (2001)

:ADO: ActiveX Data Objects provides essential information on ADO through Version 2.6, including practical code examples along the way. This book is an indispensable guide and comprehensive reference to ADO objects, collections, methods, and properties for developers who want to get up to speed and master ADO.
Dreamweaver 4 (Inside Macromedia Series), 1st edition
Authors: Julia Pryor Belinski, Charles F. Belinski
Venue:  (2001)

:Bring your expertise as a web developer to the next level! Author Scott J. Wilson takes the mystery out of professional Web site design and production by introducing you to the most frequently used features and functions of Dreamweaver 4. Following an introduction to the interface and tools, and review of the practical aspects of Web page development, you'll be ready to jump right into developing your own learning applications with confidence.Exercises and examples in Dreamweaver 4: Inside Macromedia will direct you in the use of frames, tables, forms, links, animation and other frequently used Dreamweaver functions. Coverage of Attain Objects will equip you with the ability to add highly interactive structures, scoring and tracking features to your web-based learning applications.
Hamiltonicity of planar cubic multigraphs
Authors: Zdzislaw Skupien
Venue: Discrete Mathematics (2002)

Hamiltonicity of connected cubic planar general graphs G is characterized in terms of partitioning any dual graph G* into two trees. Thus tree-tree triangulations become involved. The related Stein theorem is corrected and extended. Moreover, it follows that a maximal planar graph G can be partitioned into two forests if and only if G can be partitioned into two trees.
Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation
Authors: Samuel Burer, Renato D. C. Monteiro, Yin Zhang
Venue: Computational Optimization and Applications (2002)

Recently in Burer et al. (Mathematical Programming A, submitted), the authors of this paper introduced a nonlinear transformation to convert the positive definiteness constraint on an n &times; n matrix-valued function of a certain form into the positivity constraint on n scalar variables while keeping the number of variables unchanged. Based on this transformation, they proposed a first-order interior-point algorithm for solving a special class of linear semidefinite programs. In this paper, we extend this approach and apply the transformation to general linear semidefinite programs, producing nonlinear programs that have not only the n positivity constraints, but also n additional nonlinear inequality constraints. Despite this complication, the transformed problems still retain most of the desirable properties. We propose first-order and second-order interior-point algorithms for this type of nonlinear program and establish their global convergence. Computational results demonstrating the effectiveness of the first-order method are also presented.