ppxscal/embedding_network huggingface dataset:
Guerrilla PR Wired: Waging a Successful Publicity Campaign on-Line,Offline,and Everywhere in Between
Authors: Michael Levine
Venue:  (2001)

:Michael Levine's seminal 1993 book Guerrilla P.R. changed the face of public relations, became the mainstay P.R. primer from college classrooms to corporate boardrooms, and remains the world's most widely used introduction to public relations. Guerrilla P.R. Wired transfers Levine's low-cost, down-and-dirty P.R. tactics and techniques to today's Internet. This on-the-fly publicity battle guide provides detailed, step-by-step instructions for attracting major attention to yourself, your product, or your service, without tapping your promotional budget for thousands or even hundreds of dollars. It's effective P.R. that is fast, easy, and there for the taking -- once you know how. Featuring dozens of case studies and success stories of Web-based guerrilla campaigns, Guerrilla P.R. Wired establishes a new prototype for getting attention -- and building your brand or business -- in the digital age. Guerrilla P.R. Wired combines the promotional tactics of Michael Levine's revolutionary Guerrilla P.R. with the limitless capabilities of the Internet. The result is the first comprehensive blueprint for low- and no-cost P.R. in the wired world. Fast-moving, entertaining, and effective, it shows you how to create your own low-cost P.R. campaign and achieve better results.
Principal type specialisation
Authors: Pablo E. Martínez López, John Hughes
Venue: Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation (2002)

Type specialisation is an approach to program specialisation that works with both a program and its type to produce specialised versions of each. As it combines many powerful features,it appears to be a good framework for automatic program production, -- despite the fact that it was designed originally to express optimal specialisation for interpreters written in typed languages.The original specification of type specialisation used a system of rules expressing it as a generalised type system, rather than the usual view of specialisation as generalised evaluation. That system, while powerful, has some weaknesses not widely recognized -- the most important being the inability to express principal type specialisations (a principal specialisation is one that is "more general" than any other for a given specialisable term, and from which those can be obtained by a suitable notion of instantiation). This inability is a problem when extending type specialisation to deal with polymorphism or modules.This work presents a different formulation of the system specifying type specialisation capturing the notion of principal specialisation for a language with static constructions and polyvariance. It is a step forward in the study of type specialisation for polymorphic languages and lazy languages, and also permits modularity of specialisation, and better implementations.
An engineering environment for hardware/software co-simulation
Authors: David Becker, Raj K. Singh, Stephen G. Tell
Venue: Readings in hardware/software co-design (2001)

We describe an environment supporting concurrent hardware and software engineering for high performance systems. In place of a conventional bread-boarded prototype, we used distributed communicating processes to allow software and simulated hardware to interact. We extended the Candence Verilog-XL simulator to enable software debugging and testing using hardware simulation. The environment was proven during a successful system design.
Piecewise linear aggregation functions
Authors: Sergei Ovchinnikov
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2002)

The Choquet and Sugeno (fuzzy) integrals are examples of piecewise linear functions on a finite dimensional space Rn. In this paper we consider piecewise linear functions as aggregation functions and establish a Max-Min polynomial representation of these functions.
Sams Teach Yourself Access 2000 in 24 Hours, 1st edition
Authors: Timothy Buchanan, Craig Eddy
Venue:  (1999)

:Sams Teach Yourself Access 2000 in 24 Hours focuses on Access on the desktop, without the complication of adding client/server issues. You can easily pick this book up and start building and maintaining data within 24 hours. Learn to design and create databases using wizards or from scratch, as well as how to navigate Access 2000 with the new IE browser. You'll also learn to create forms, reports and queries, and integrate Access 2000 with other MS Office components to share data across the Office suite. Toward the end of the 24 Hours, basic security and maintenance techniques are addressed.
Dead or Alive 2
Authors: Christine Cain, Joe Cain
Venue:  (2000)

:The hottest buff and buxom characters return in the sequel to Dead or Alive. This new game from Sega has all the familiar characters and some new ones. The game features the same fighting techniques as before, but with a new tag team mode and higher resolution. With Dead or Alive 2: Prima's Official Strategy Guide, you can dominate. You'll get all the secret characters and moves exposed, combos and strategies for every fighter, extensive moves lists, detailed character versus tables, hidden configurations revealed, and more!
Mike Meyers' A+ Certification Lab Manual
Authors: Mike Meyers, Cary Dier
Venue:  (2001)

:Welcome to the lab manual that accompanies your All-In-One A+ Certification Exam Guide (Osborne/McGraw-Hill,2001). This lab manual provides lots of interesting hands-on activities that bring the knowledge you gained from the textbook to life. Whether you are taking an exam preparation course or learning by yourself, you'll love the challenging labs provided by this book.
Visions of Privacy: Policy Choices for the Digital Age, 1st edition
Authors: Colin J. Bennett, Rebecca Grant
Venue:  (1999)

:What kind of privacy future are we facing? In Visions of Privacy: Policy Choices for the Digital Age, some of the most prominent international theorists and practitioners in the field explore the impact of evolving technology on private citizens. The authors critically probe legal, social, political, and economic issues, as each answers the question: How can we develop privacy solutions equal to the surveillance challenges of the future?
Interactive Computing Series: Word 2002- Introductory, 1st edition
Authors: Kenneth C. Laudon, Kenneth Rosenblatt, David Langley
Venue:  (2001)

:The Interactive Computing Series is the Visual,Interactive way to develop and apply software skills. This Skills based approach coupled with its highly illustrated,2 page-spread design is ideal for the intro CIS course,the self-paced course or students in non-traditional education settings.
Swing, 1st edition
Authors: Matthew Robinson, Pavel Vorobiev
Venue:  (1999)

:Intended for experienced and advanced Java developers, more than half of this book consists of example applications that Java developers may encounter on a daily basis. The extensive examples build on top of one another to solve real-world problems. Five key areas of Swing are emphasized: text package, tree package, table package, MDI environments, and pluggable ""look-and-feel."" Also included are discussions of special topics such as Java 2D, the Printing API, Accessibility, and Java. This book will be useful for Java professionals who need solutions to technical problems, Java programmers who want to better understand the capabilities of Swing, and people who are looking to refine their knowledge about Swing as the most modern Java technology.
The PERL Resource Kit with Cdrom, 1st edition
Authors: Dick Hardt, David Futato, Brian Jepson, Olson
Venue:  (1998)

:Here is a comprehensive collection of Win32 Perl documentation and commercially enhanced software tools. The kit provides over 1,000 pages of tutorial and in-depth reference documentation for Perl modules and utilities in three volumes. The CD-ROM contains the complete Perl for Win32 5.005 distribution, plus hundreds of freeware Perl modules and utilities.
A continuous analogue of the girth problem
Authors: Alon Amit, Shlomo Hoory, Nathan Linial
Venue: Journal of Combinatorial Theory Series B (2002)

Let A be the adjacency matrix of a d-regular graph of order n and girth g and d = λ1 ≥ ... ≥ λn its eigenvalues. Then Σj=2n λji=nti-di, for i=0,1,...,g-1, where ti is the number of closed walks of length i on the d-regular infinite tree. Here we consider distributions on the real line, whose ith moment is also nti-di for all i=0, 1, ..., g-1. We investigate distributional analogues of several extremal graph problems involving the parameters n, d, g, and ≙=max |λ2|, |λn|. Surprisingly, perhaps, many similarities hold between the graphical and the distributional situations. Specifically, we show in the case of distributions that the least possible n, given d, g is exactly the (trivial graph-theoretic) Moore bound. We also ask how small ≙ can be, given d, g, and n, and improve the best known bound for graphs whose girth exceeds their diameter.
Waite Group's Windows 98 how to with Cdrom
Authors: Keith A. Powell
Venue:  (1998)

:The Waite Group's Windows 98 How-To is the definitive problem solver that provides practical workarounds for power users and computer professionals. The techniques demonstrated allow users to troubleshoot problems and enhance Windows 98 performance with ease. Organized by individual questions, this exhaustive reference addresses practical, real-world operating system issues in clear, easy-to-follow language.
Fair and Efficient Packet Scheduling Using Elastic Round Robin
Authors: Salil S. Kanhere, Harish Sethu, Apha B. Parekh
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Parallel systems are increasingly being used in multiuser environments with the interconnection network shared by several users at the same time. Fairness is an intuitively desirable property in the allocation of bandwidth available on a link among traffic flows of different users that share the link. Strict fairness in traffic scheduling can improve the isolation between users, offer a more predictable performance and improve performance by eliminating some bottlenecks. This paper presents a simple, fair, efficient, and easily implementable scheduling discipline, called Elastic Round Robin (ERR), designed to satisfy the unique needs of wormhole switching, which is popular in interconnection networks of parallel systems. In spite of the constraints of wormhole switching imposed on the design, ERR is also suitable for use in Internet routers and has better fairness and performance characteristics than previously known scheduling algorithms of comparable efficiency, including Deficit Round Robin and Surplus Round Robin. In this paper, we prove that ERR is efficient, with a per-packet work complexity of O(1). We analytically derive the relative fairness bound of ERR, a popular metric used to measure fairness. We also derive the bound on the start-up latency experienced by a new flow that arrives at an ERR scheduler. Finally, this paper presents simulation results comparing the fairness and performance characteristics of ERR with other scheduling disciplines of comparable efficiency.
Unstructured data bases or very efficient text searching
Authors: Gaston H. Gonnet
Venue: Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems (1983)

We present several algorithms to search data bases that consist of text. The algorithms apply mostly to very large data bases that are difficult to structure.We describe algorithms which search the original data base without transformation and hence could be used as general text searching algorithms. We also describe algorithms requiring pre-processing, the best of them achieving a logarithmic behaviour. These efficient algorithms solve the "plagiarism" problem among n papers.The problem of misspellings, ambiguous spellings, simple errors, endings, positional information, etc is nicely treated using signature functions.
Oracle performance tuning
Authors: Edward Whalen, Mitchell Schroeter
Venue:  (2002)

This book is designed to enhance the skills of Oracle DBAs by giving them knowledge and examples of how to improve their system's performance. Readers will learn how to: understand how to use trace files, the alert log file, and event sets to assist with tuning; become familiar with the new features of Oracle9i.; understand and be able to use utilities and dynamic performance views to assist with tuning; understand how to tune applications using index structures and how to perform SQL statement tuning.; tune SQL statements efficiently; read alert logs and trace files; tune the shared pool; tune the buffer cache; use multiple buffer caches; tune a multi-threaded server; configure and tune the storage subsystem that Oracle is using, and use Oracle in a SAN environment.
Korat: automated testing based on Java predicates
Authors: Chandrasekhar Boyapati, Sarfraz Khurshid, Darko Marinov
Venue: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis (2002)

This paper presents Korat, a novel framework for automated testing of Java programs. Given a formal specification for a method, Korat uses the method precondition to automatically generate all (nonisomorphic) test cases up to a given small size. Korat then executes the method on each test case, and uses the method postcondition as a test oracle to check the correctness of each output.To generate test cases for a method, Korat constructs a Java predicate (i.e., a method that returns a boolean) from the method's pre-condition. The heart of Korat is a technique for automatic test case generation: given a predicate and a bound on the size of its inputs, Korat generates all (nonisomorphic) inputs for which the predicate returns true. Korat exhaustively explores the bounded input space of the predicate but does so efficiently by monitoring the predicate's executions and pruning large portions of the search space.This paper illustrates the use of Korat for testing several data structures, including some from the Java Collections Framework. The experimental results show that it is feasible to generate test cases from Java predicates, even when the search space for inputs is very large. This paper also compares Korat with a testing framework based on declarative specifications. Contrary to our initial expectation, the experiments show that Korat generates test cases much faster than the declarative framework.
Foundation Dreamweaver Ultradev 4
Authors: Rob Paddock, Spencer Steel
Venue:  (2001)

:What is the Subject Area? Dreamweaver Ultradev 4 combines the hugely popular Dreamweaver interface with point-and-click middle-tier programming capability with ASP, JSP and ColdFusion. Dreamweaver Ultradev effectively upgrades the skillset of millions of Dreamweaver web-developers, by now enabling them to build dynamic content into their sites without having to become full-time programmers. The Swiss army knife of software tools, Dreamweaver UltraDev 4 lets graphic designers create great-looking, data-driven web sites with visual ease, while at the same time for programmers it provides a powerful productivity tool for generating reams of code fast. Details (Consumer) Dreamweaver UltraDev 4 extends the product's ability to build great web sites by incorporating the ability to store and retrieve data in all the popular database formats, seamlessly integrating the user interface with the back-end. Whether you're a first-time site creator or an experienced coder, Dreamweaver UltraDev will satisfy your desire for a tool-rich, extensible, intuitive authoring tool. The book has a strong tutorial thrust, focusing on building the core skills that the reader needs to master Dreamweaver UltraDev and use it effectively to create the site you want. The skills and techniques are built in self-contained chapters that combine in an ongoing case study to build a rich knowledge base in the reader's mind. What is Great About this Book? (Trade) Provides a planned, designer-oriented tutorial into the essential concepts of database-driven web design - this is a 2nd level Foundation title In the course of teaching Ultradev's database manipulation and control techniques, it also covers essential Dreamweaver skills Individual chapters are tutorial based, stand alone exercises, that take the reader step by step to an understanding of site design, creation and deployment. Provides a single-tool-for-job approach to the wider field scoped out in Dynamic Content Studio. This is a natural next step book Who is this book for? Designers who need to learn the ins and outs of data-driven site design. Developers who need to learn how to make the most of this sophisticated productivity tool and take full advantage of the renowned Dreamweaver interface Dreamweaver users who want to extend their skills into e-commerce and other data-driven web applications
Interactive Multimedia: Practice and Promise
Authors: Colin Latchem, John Williamson, Lexie Henderson-Lancett
Venue:  (1993)

:International contributors, including Alexander Romiszowski and Thomas Reeves, set present practice and future trends in interactive multimedia technology into a coherent framework. Issues covered include: overcoming obstacles in the classroom and library, facilitating human-computer interaction, and calculating life-cyle costs.
Sams Teach Yourself Visual Basic 6 in 10 Minutes, 1st edition
Authors: Lowell Mauer, Robert Wasserman, Jeff Perkins
Venue:  (1999)

:Sams Teach Yourself Visual Basic 6 in 10 Minutes is a tutorial-based book, organized into a series of easy-to-follow, 10-minute lessons. These well targeted lessons teach you in 10 minutes what some books take several hours or days to teach. It is for those users who don't have the time to read lengthy chapters, or are not inclined to read "manuals." This book will provide the basics of the programming language, including: - Managing Projects and Files - Declaring and Using Variables, Constants and Data Types - Controlling Program Flow - Procedures and Functions - Debugging - Using ActiveX Controls - DHTML - Creating and Using Menus - Graphics and Images
The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms
Authors: Thomas L. Magnanti, Georgia Perakis
Venue: SIAM Journal on Optimization (1997)

We introduce an approach, called the orthogonality theorem, for establishing the convergence of several algorithms for solving variational inequalities. This theorem, as well as several basic convergence theorems from the literature, impose the condition of strong-f-monotonicity on the problem function. We analyze and introduce some new results concerning this condition and provide a general overview of its properties. For example, we show the relationship between strong-f-monotonicity and convexity.
MCSE IIS 4 Exam Cram, 1st edition
Authors: James Michael Stewart, Ramesh Chandak, Kurt Hudson
Venue:  (1998)

:Provides all of the necessary overviews, concepts, and terminology, plus multimedia resource sections at the end of each chapter help the reader make use of the best study aids available. Covers the following key topics: installing and upgrading I Pass the IIS 4 exam and you have met one of the 7 core requirments for the MCSE + I designation AND satified one of the elective requirments for the MCSE designation. The perfect complement to all study guides and training materials for Exam #70-087: Implementing and Supporting Microsoft Internet Information Server 4. Includes sections on proven test-taking strategies, warnings on trick questions, time-saving study tips, multiple-part question strategies, and shortcuts. Includes practice exam questions arranged in a similar format to the questions found on the actual exam. Provides a special tear-out Cram Sheet with tips, acronyms, and memory joggers for quick review just prior to taking the exam. Guarantees long shelf life because tests for future versions are not made available until roughly 90-120 days after the release of the software.
Solution Sensitivity from General Principles
Authors: Adam B. Levy
Venue: SIAM Journal on Control and Optimization (2001)

We present a generic approach for the sensitivity analysis of solutions to parameterized finite-dimensional optimization problems. We study differentiability and continuity properties of quasi-solutions (stationary points or stationary point-multiplier pairs), as well as their existence and uniqueness, and the issue of when quasi-solutions are actually optimal solutions. Our approach is founded on a few general rules that can all be viewed as generalizations of the classical inverse mapping theorem, and sensitivity analyses of particular optimization models can be made by computing certain generalized derivatives in order to translate the general rules into the terminology of the particular model. The useful application of this approach hinges on an inverse mapping theorem that allows us to compute derivatives of solution mappings without computing solutions, which is crucial since numerical solutions to sensitive problems are fundamentally unreliable. We illustrate how this process works for parameterized nonlinear programs, but the generality of the rules on which our approach is based means that a similar sensitivity analysis is possible for practically any finite-dimensional optimization problem. Our approach is distinguished not only by its broad applicability but by its separate treatment of different issues that are frequently treated in tandem. In particular, meaningful generalized derivatives can be computed and continuity properties can be established even in cases of multiple or no quasi-solutions (or optimal solutions) for some parameters. This approach has not only produced unprecedented and computable conditions for traditional properties in well-studied situations, but has also characterized interesting new properties that might otherwise have remained unexplored.
AppleScript Finder Guide: English Dialect
Authors: Jeanne Woodward, Rex Wolf
Venue:  (1994)

:You'll find definitive coverage of the newest and most important technologies, such as QuickDraw 3D and Apple Guide. You'll also find the classic cornerstones of Macintosh development, like Macintosh Human Interface Guidelines, MacsBug Reference and Debugging Guide, and Planning and Managing AppleTalk Networks. Care has been taken to provide the information using the most appropriate medium. From the multimedia presentations of Electronic Guide to Macintosh Human Interface Design to the electronic reference included with Advanced Color Imaging on the Mac OS, the material is presented in the way that allows you to access it most effectively.
MacMath 9.2: A Dynamical Systems Software Package for the MacIntosh, 1st edition
Authors: J. H. Hubbard, B. J. West
Venue:  (1993)

:Dynamical systems in the field of mathematics which describes how systems evolve in time. One of the major new insights in mathematics, largely due to the advent of computers and computer graphics, is how extraordinarily complicated the motions of a system can be, even when the underlying rules are extremely simple. Observation of these motions has led scientists to call some of them "chaotic" and "fractal." MacMath is a collection of programs designed to help the user analyze both differential equations and iterations. These are some of the newer tools used in the study of dynamical systems, which can be used to display simple or very complex phenomena.