ppxscal/embedding_network huggingface dataset:
Firewalls for Dummies
Authors: Brian Komar, Ronald Beekelaar, Joern Wettern
Venue:  (2001)

:Protect yourself now - whether you have a home office or run an enterprise network. Get savvy tips using today's firewall technologies. Hackers. Script kiddies. Disgruntled employees. A lot of people out there may want to invade your system and kick up some trouble. Firewalls can help protect you. But how do you select and set up the right firewall solution? Relax! This friendly guide shows you step by step how to lock out the bad guys. ABOUT THE AUTHORS: Brian Komar is a leading computer security consultant and speaker. Ronald Beekelaar writes about computer security and provides security training. Joern Wettern is coauthor of Inside TCP/IP.
Internet Communication and Qualitative Research
Authors: Chris Mann, Fiona Stewart
Venue:  (2001)

:Communication and Qualitative Research is the first textbook to examine the impact of Internet technology on qualitative research methods. Drawing on many pioneering studies using computer-mediated communication (CMC), the authors show how online researchers can employ Internet-based qualitative methods to collect rich, descriptive, contextually-situated data. They discuss the methodological, practical and theoretical considerations associated with such methods as in-depth online interviewing, virtual focus groups, and participant observation in virtual communities. This is a comprehensive and practical guide that:-Reviews online research practice and basic Internet technology-Looks in detail at the skills required by the online researcher -Examines the ethical, confidentiality, security, and legal issues involved in online research-Considers the theoretical challenges surrounding data collected in a "virtual venue"-Addresses the social and cultural impact of researching online through a discussion of power, gender, and identity issues in the virtual worldInternet Communication and Qualitative Research will be an indispensable guide for all students and researchers working in the digital age.
Pipelined Processor Farms: Structured Design for Embedded Parallel Systems
Authors: Andy C. Downton, Martin Fleury
Venue:  (2001)

:A pipeline is a computer network communication channel that provides a means of transporting data packets between destinations. A pipelined processor farm refers to a structured design method for mapping sequential embedded applications.
Mobile Communications
Authors: A. Jagoda, M. De Villepin
Venue:  (1993)

:Covers the entire field of mobile communications including pager, cellular, cordless, trunk, satellite and maritime communications. Opens with a discussion of the technology, the regulations and the standards which have influenced its development and studies specific products and services. Each chapter reviews the current status of a particular service and analyzes the future of each field.
Learn AutoCAD LT 2000 for Architects
Authors: James Padgett
Venue:  (2000)

:Learn AutoCAD LT 2000i for Architects is a complete learning system for professional architects who are new to AutoCAD LT. The author focuses on the features that apply to architectural drawing in order to get users up and running as quickly as possible. The book begins with an overview of AutoCAD LT basics, including how to set up the program whether you're using version 98, 2000, or 2000i. A floor plan tutorial follows, along with chapters on developing sections, drawing elevations, and adding details. The author concludes with a lesson on using Real Architect LITE, the architectural drafting application included on the companion CD. Additional topics include using layers, modifying templates, scaling viewports, and adding dimensions. The companion CD contains a free 30-day trial version of AutoCAD LT 2000i, the Real Architect LITE program, and PDF files of the architectural drawings used in the example drawings. Author Biography: James Padgett is the developer of Straight Forward Software's Real Architect products for AutoCAD LT, as well as Archillustrator and other architectural programs for full AutoCAD. He specializes in the use of AutoCAD and AutoCAD LT in his architectural consulting business in Hawaii. END.
Shape distributions
Authors: Robert Osada, Thomas Funkhouser, Bernard Chazelle, David Dobkin
Venue: ACM Transactions on Graphics (TOG) (2002)

Measuring the similarity between 3D shapes is a fundamental problem, with applications in computer graphics, computer vision, molecular biology, and a variety of other fields. A challenging aspect of this problem is to find a suitable shape signature that can be constructed and compared quickly, while still discriminating between similar and dissimilar shapes.In this paper, we propose and analyze a method for computing shape signatures for arbitrary (possibly degenerate) 3D polygonal models. The key idea is to represent the signature of an object as a shape distribution sampled from a shape function measuring global geometric properties of an object. The primary motivation for this approach is to reduce the shape matching problem to the comparison of probability distributions, which is simpler than traditional shape matching methods that require pose registration, feature correspondence, or model fitting.We find that the dissimilarities between sampled distributions of simple shape functions (e.g., the distance between two random points on a surface) provide a robust method for discriminating between classes of objects (e.g., cars versus airplanes) in a moderately sized database, despite the presence of arbitrary translations, rotations, scales, mirrors, tessellations, simplifications, and model degeneracies. They can be evaluated quickly, and thus the proposed method could be applied as a pre-classifier in a complete shape-based retrieval or analysis system concerned with finding similar whole objects. The paper describes our early experiences using shape distributions for object classification and for interactive web-based retrieval of 3D models.
Edge-Disjoint Paths in Expander Graphs
Authors: Alan M. Frieze
Venue: SIAM Journal on Computing (2001)

Given a graph G=(V,E)and a set of $\kappa$ pairs of vertices in V, we are interested in finding, for each pair (ai, bi), a path connecting ai to bi such that the set of $\kappa$ paths so found is edge-disjoint. For arbitrary graphs the problem is ${\cal NP}$-complete, although it is in ${\cal P}$ if $\kappa$ is fixed. We present a polynomial time randomized algorithm for finding edge-disjoint paths in an r-regular expander graph G. We show that if G has sufficiently strong expansion properties and r is sufficiently large, then all sets of $\kappa=\Omega(n/\log n)$ pairs of vertices can be joined. This is within a constant factor of best possible.
Singular Stochastic Control, Linear Diffusions, and Optimal Stopping: A Class of Solvable Problems
Authors: Luis H. R. Alvarez
Venue: SIAM Journal on Control and Optimization (2000)

We consider a class of singular stochastic control problems arising frequently in applications of stochastic control. We state a set of conditions under which the optimal policy and its value can be derived in terms of the minimal r-excessive functions of the controlled diffusion, and demonstrate that the optimal policy is of the standard local time type. We then state a set of weak smoothness conditions under which the value function is increasing and concave, and demonstrate that given these conditions increased stochastic fluctuations decrease the value and increase the optimal threshold, thus postponing the exercise of the irreversible policy. In line with previous studies of singular stochastic control, we also establish a connection between singular control and optimal stopping, and show that the marginal value of the singular control problem coincides with the value of the associated stopping problem whenever 0 is not a regular boundary for the controlled diffusion.
Propositional logics of programs: systems, models, and complexity
Authors: Rohit Parikh
Venue: Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1980)

We indicate below the various results in this paper and the sections where these results are fully described. &delta;1 is introductory).(&delta;2). The partial correctness assertion (PCA) A{&alpha;}B is expressed in PDL in the form A &rarr; [&alpha;]B. We shall consider the question of when a given finite set of PCAs implies another and give optimal complexity bounds. We also give other results of an algebraic nature.(&delta;3). DPDL is less well understood than PDL since the filtration technique of F-L that applies to the latter falls for the former. We point out a translation from PDL to DPDL which leads to a lower bound for the latter.(&delta;4). What do models of PDL look like? We show the existence of canonical and universal models and show how an infinite model can be related to its F-L factors.
Design techniques for low power high bandwidth upconversion in CMOS
Authors: Carl De Ranter, Michiel Steyaert
Venue: Proceedings of the 2002 international symposium on Low power electronics and design (2002)

An upconvertor topology for low power, high bandwidth applications is presented. Using specific circuit techniques and local circuit-level optimization, the power consumption of the total system comprising an on-chip LC-type VCO, a polyphase network quadrature generator, a linear mixer block and an RF-current buffer, has been minimized.A chip has been designed and manufactured in a 0.25&mgr;m CMOS technology. The VCO oscillates between 1.68 GHz and 2 GHz. Driven by an external LO, the transmitter operates from 900 MHz up to 2 GHz. At 2 GHz, the upconvertor transmits -12 dBm into 50 &omega; with a linearity of more than -35 dBc for base band signals up to 33 MHz.
New Perspectives on Microsoft Excel 2000; Comprehensive, 1st edition
Authors: June Jamnich Parsons, Dan Oja, Roy Ageloff, Jamrich Parsons
Venue:  (1999)

:Part of the New Perspectives series, this text offers a case-based, problem-solving approach and innovative technology for learning Microsoft Excel 2000.
Algorithms and Data Structures in VLSI Design, 1st edition
Authors: Christoph Meinel, Thorsten Theobald
Venue:  (1998)

:This book provides an introduction to the foundations of this interdisciplinary research area, emphasizing its applications in computer aided circuit design.
A method for normalizing students' scores when employing multiple graders
Authors: Norman Jacobson
Venue: ACM SIGCSE Bulletin (2001)

Teachers of large classes often employ multiple graders to score student work. Even when appropriate measures are taken to insure that scoring by different graders is consistent, inconsistencies nevertheless occur. To adjust for them, instructors sometimes normalize grades mathematically, typically by scaling each grader group's score to an average of points earned. Scaling to an average has undesirable traits, including the difficulty of convincing students that it is fair. We developed an easy-to-explain method that adjusts scores so that the average number of points lost by students in each grader's group is the same. We discuss how to compute the adjustment and its advantages and limitations.
Web-Teaching: A Guide to Designing Interactive Teaching for the World Wide Web, 2nd edition
Authors: David W. Brooks, Diane E. Nolan, Susan M. Gallagher
Venue:  (2000)

:Can there be any doubt that the future of education is linked to the World Wide Web? "Web Teaching" walks educators and trainers through the process of creating customized Web-based teaching aids, as well as the nuts and bolts of multimedia. Illustrations and appendices help jump-start access to the Web's many resources. 236 pp. Pub: 4/97.
A Spectral Bundle Method for Semidefinite Programming
Authors: C. Helmberg, F. Rendl
Venue: SIAM Journal on Optimization (1999)

A central drawback of primal-dual interior point methods for semidefinite programs is their lack of ability to exploit problem structure in cost and coefficient matrices. This restricts applicability to problems of small dimension. Typically, semidefinite relaxations arising in combinatorial applications have sparse and well-structured cost and coefficient matrices of huge order. We present a method that allows us to compute acceptable approximations to the optimal solution of large problems within reasonable time.Semidefinite programming problems with constant trace on the primal feasible set are equivalent to eigenvalue optimization problems. These are convex nonsmooth programming problems and can be solved by bundle methods. We propose replacing the traditional polyhedral cutting plane model constructed from subgradient information by a semidefinite model that is tailored to eigenvalue problems. Convergence follows from the traditional approach but a proof is included for completeness. We present numerical examples demonstrating the efficiency of the approach on combinatorial examples.
Applying S88: Batch Control from a User's Perspective
Authors: Jim Parshall, Larry Lamb
Venue:  (1999)

:The release of batch control standard ANSI/ISA-88.01-1995, Batch Control Part 1: Models and Terminology, has led to revolutionary advances in the way factories design, implement, and integrate flexible, modular processes into the enterprise. Now, for the first time, here's a book that cuts through the opaque language and arcane symbols of the standard and explains it in clear, user-friendly language. Applying S88 covers all aspects of the ANSI/ISA-88.01-1995 standard. Written from a user's perspective, Parshall and Lamb discuss their implementation of ISA-88, offering a wealth of examples and explanations to make it applicable across a wide range of batch industries. From designing better processes to combining recipes with equipment control to execution validation test plans, this book offers both an introduction to ISA-88 as well as expert insights into applying it. Parshall and Lamb's clear, lighthearted style makes this the ideal introduction to ISA-88 for control engineers, project engineers, technicians, operators, information technology professionals, engineering or IT supervisors, and mid- to upper-level managers.
Deadlock removal using partial rollback in database systems
Authors: Donald Fussell, Zvi M. Kedem, Abraham Silberschatz
Venue: Proceedings of the 1981 ACM SIGMOD international conference on Management of data (1981)

The problem of removing deadlocks from concurrent database systems using the two-phase locking protocol is considered. In particular, for systems which use no a priori information about transaction behavior in order to avoid deadlocks, it has generally been assumed necessary to totally remove and restart some transaction involved in a deadlock in order to relieve the situation. In this paper, a new approach to deadlock removal in such systems based on partial rollbacks is introduced. This approach does not in general require the total removal of a transaction to eliminate a deadlock. The task of optimizing deadlock removal using this method is discussed for systems allowing both exclusive and shared locking. A method is given for implementing this approach with no more storage overhead than that required for total removal and restart.
Managing Flexibility for Inter-Organizational Electronic Commerce
Venue: Electronic Commerce Research (2001)

Electronic commerce has the potential to significantly impact on supply chain management in today's highly dynamic business environment. Enterprises are eager to tap into new opportunities such as the proliferation of alternatives in the electronic marketplace, real-time access to supply information including both product price and leadtime at virtually no cost, and an efficient inter-organizational electronic collaboration infrastructure. In our work, we model different business entities as software agents interconnected via the Internet. Our main research focus is how to coordinate supply chain management agents dynamically and flexibly such that goods and services can be delivered at the right time in a cost-effective manner.
Bounds on The Performance of a Greedy Algorithm for Probabilities
Authors: J. C. Gittins, G. Harper
Venue: Mathematics of Operations Research (2001)

A bound on the performance of the greedy algorithm for finding the maximum of a submodular set function subject to a cardinality constraint is shown to apply to the problem of selecting a fixed number of events so that the probability that at least one of the selected events occurs is maximized. The bound is improved under an additional assumption which is plausible when the aim is to find a biologically active compound in pharmaceutical research.
NT and UNIX Intranet Secrets, 1st edition
Authors: Sharon Crawford, Charlie Russel
Venue:  (1997)

:Eliminate communication gridlock and streamline adminstrative procedures. Provide employees with instant access to core company information. In NT and UNIX Intranet Secrets , you'll find the expert advice you need for planning, building, and managing your intranet. From selecting hardware and software to creating content and connecting to the Internet, Sharon Crawford and Charlie Russel bring you little-known tips and practiced techniques for implementing a successful intranet on either NT or UNIX networks.
Sams Teach Yourself C in 21 Days, 5th edition
Authors: Peter Aitken, Bradley L. Jones
Venue:  (1999)

:Sams Teach Yourself C in 21 Days, Fifth Edition presents C programming techniques in a logical and easy-to-follow sequence that helps you understand the principles involved in developing C programs. Learn the basics of writing a program, then move on to arrays, pointers, disk input/output, functions, and more. This book covers the basics of C including variables, constants, conditional statements, loops, pointers, data structures, input/output, and functions. Sams Teach Yourself C in 21 Days, Fifth Edition, presents C in the most logical and easy-to-learn sequence, and is geared towards programmers learning the C language.
Excel 5 for Windows: The Visual Learning Guide, 1st edition
Authors: Grace Joely Beatty, David C. Gardner
Venue:  (1993)

:Prima's Visual Learning Guides are a unique new series of computer books created by learning experts, based on their years of experience as university researchers and training consultants to Fortune 500 companies. Hundreds of FULL-COLOR graphics combined with friendly straightforward text and innovative layouts that stimulate whole-brain learning make it easy for you to dive right into Excel 5 for Windows and make it work for you. Quickly Learn How to create great-looking worksheets; automatically connect and update worksheets with links; write formulas and sort data at the click of your mouse; use workbooks, tab dialogs, drag & drop, and Autofill; and use hands-on charting and Chart Autoformat to create dramatic charts, then export the charts to word-processing programs.
Quick Course in Microsoft Excel 2000, 1st edition
Authors: Christina Dudley, Joyce Cox, Polly Urban
Venue:  (1999)

:Ideal for use as a self-paced training guide or for instructor-led training, this book offers fast-paced tutorials and learning exercises for quickly grasping spreadsheet basics and building proficiency.
A Semi-Lagrangian Finite Volume Method for Newtonian Contraction Flows
Authors: T. N. Phillips, A. J. Williams
Venue: SIAM Journal on Scientific Computing (2000)

A new finite volume method for solving the incompressible Navier--Stokes equations is presented. The main features of this method are the location of the velocity components and pressure on different staggered grids and a semi-Lagrangian method for the treatment of convection. An interpolation procedure based on area-weighting is used for the convection part of the computation. The method is applied to flow through a constricted channel, and results are obtained for Reynolds numbers, based on half the flow rate, up to 1000. The behavior of the vortex in the salient corner is investigated qualitatively and quantitatively, and excellent agreement is found with the numerical results of Dennis and Smith [ Proc. Roy. Soc. London A, 372 (1980), pp. 393--414] and the asymptotic theory of Smith [J. Fluid Mech., 90 (1979), pp. 725--754].
Definitions for Hardware and Software Safety Engineers
Authors: Meine Van Meulen
Venue:  (2000)

:This book comprises definitions of the major terms used in Reliability Engineering and Software Assessment. Key features include: over 2000 definitions carefully selected from standards and literature published by leading institutions such as the IEEE and IEC; alternative definitions of the same term, enabling the reader to compare and contrast, thereby giving useful insights into different aspects of the same term; extensive cross-referencing making the book easy-to-use and practical." "This volume will provide a reference book for anyone working in the fields of reliability engineering or software assessment. It will be of particular interest to industrial researchers and practitioners; members of standards committees; reliability consultants; students on Software Quality courses; technical authors and sub-editors.
The Inventor Toolmaker: Extending Open Inventor, Release 2, 2nd edition
Authors: Josie Wernecke
Venue:  (1994)

:for graphics programmers. OpenGL is a powerful software interface for graphics hardware that allows graphics programmers to produce high- quality color images of 3D objects. The functions in the OpenGL library enable programmers to build geometric models, view models interactively in 3D space, control color and lighting, manipulate pixels, and perform such tasks as alpha blending, anti-aliasing, creating atmospheric effects, and texture mapping. Open Inventor is an object-oriented 3D toolkit built on OpenGL that provides a 3D scene database, a built-in event model for user interaction, and the ability to print objects and exchange data with other graphics formats. The OpenGL Technical Library provides tutorial and reference books for OpenGL and Open Inventor. The library enables programmers to gain a practical understanding of these important software standards and shows how to unlock their full potential.
How to Write for Magazines: Consumer, Trade, and Web, 1st edition
Authors: Charles Hampton Harrison
Venue:  (2001)

:/* 1743L-4, Harrison, Charles H., How to Write for Magazines: Consumer, Trade and Web */ This book serves as a practical guide to the basic tools of magazine article writing: knowing the marketplace, brainstorming, researching, querying editors, and writing to get published. Offers readers a step-by-step methodology to writing for magazines, including significant coverage of trade, professional, and Web magazines. Readers will learn to master the basics of magazine article writing through hands-on exercises and commentary from current and successful magazine writers and editors. Unique Trade and professional magazine coverage provides readers with information on this large and important segment of the industry that is often ignored in other books. Readers also receive important insights into the "dos" and "don'ts" of writing from editors who work with staff and freelance writers everyday. Anyone interested in a career in professional writing, with emphasis on Professional and Trade Magazines. 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