ppxscal/embedding_network huggingface dataset:
Perl and LWP, 1st edition
Venue:  (2002)

:Perl soared to popularity as a language for creating and managing web content, but with LWP (Library for WWW in Perl), Perl is equally adept at consuming information on the Web. LWP is a suite of modules for fetching and processing web pages.The Web is a vast data source that contains everything from stock prices to movie credits, and with LWP all that data is just a few lines of code away. Anything you do on the Web, whether it's buying or selling, reading or writing, uploading or downloading, news to e-commerce, can be controlled with Perl and LWP. You can automate Web-based purchase orders as easily as you can set up a program to download MP3 files from a web site. Perl & LWP covers: Understanding LWP and its design Fetching and analyzing URLs Extracting information from HTML using regular expressions and tokens Working with the structure of HTML documents using trees Setting and inspecting HTTP headers and response codes Managing cookies Accessing information that requires authentication Extracting links Cooperating with proxy caches Writing web spiders (also known as robots) in a safe fashion Perl & LWP includes many step-by-step examples that show how to apply the various techniques. Programs to extract information from the web sites of BBC News, Altavista, ABEBooks.com, and the Weather Underground, to name just a few, are explained in detail, so that you understand how and why they work. Perl programmers who want to automate and mine the web can pick up this book and be immediately productive. Written by a contributor to LWP, and with a foreword by one of LWP's creators, Perl & LWP is the authoritative guide to this powerful and popular toolkit.
An Overview of Backtrack Search Satisfiability Algorithms
Authors: Inês Lynce, João P. Marques-Silva
Venue: Annals of Mathematics and Artificial Intelligence (2003)

Propositional Satisfiability (SAT) is often used as the underlying model for a significant number of applications in Artificial Intelligence as well as in other fields of Computer Science and Engineering. Algorithmic solutions for SAT include, among others, local search, backtrack search and algebraic manipulation. In recent years, several different organizations of local search and backtrack search algorithms for SAT have been proposed, in many cases allowing larger problem instances to be solved in different application domains. While local search algorithms have been shown to be particularly useful for random instances of SAT, recent backtrack search algorithms have been used for solving large instances of SAT from real-world applications. In this paper we provide an overview of backtrack search SAT algorithms. We describe and illustrate a number of techniques that have been empirically shown to be highly effective in pruning the amount of search on significant and representative classes of problem instances. In particular, we review strategies for non-chronological backtracking, procedures for clause recording and for the identification of necessary variable assignments, and mechanisms for the structural simplification of instances of SAT.
Propositional Logic: Deduction and Algorithms
Authors: Hans K. Buning, T. Letterman
Venue:  (1999)

:This introduction to classical logic emphasises computational aspects. The authors treat issues of complexity and algorithmic analysis that have traditionally not been considered the realm of mathematical logic, but which are vital in areas such as automated reasoning, knowledge engineering, logic programming and AI.In order to make the book suited for teaching and for self-study, the book includes a systematic account of theoretical results, as well as an exposition of those appropriate algorithms which incorporate them.
Design choices for complex APL
Authors: Paul Penfield,  Jr.
Venue: ACM SIGAPL APL Quote Quad (1978)

This is the third and last paper in a series discussing the major design choices for APL to handle complex numbers. These papers are intended to stimulate a discussion in the APL community before the first implementation of complex numbers in APL renders such a discussion academic.
The Sisyphus database retrieval software performance antipattern
Authors: Robert F. Dugan,  Jr., Ephraim P. Glinert, Ali Shokoufandeh
Venue: Proceedings of the 3rd international workshop on Software and performance (2002)

In this paper we propose the Sisyphus database retrieval software performance antipattern. The antipattern occurs in application designs that process large, frequently accessed lists stored in a relational database, but display only a small subset to the user. Software Performance Engineering (SPE) techniques are used to analyze the antipattern. Four solutions are evaluated: rownum and index, upper/lower bound, sequence numbering, and caching. We discuss the real world challenges of correcting this antipattern early in the application life cycle.
PhotoDeluxe Home Edition 4 for Windows: Visual QuickStart Guide, 2nd edition
Authors: Ted Alspach, Jen Alspach
Venue:  (2000)

:PhotoDeluxe Home Edition 4 for Windows, the latest version of Adobe's best selling photo-editing application, builds on the friendly user interface of previous versions, making it even simpler to import images from digital cameras, scanners, CD-ROM, floppy disks, and the Internet. PhotoDeluxe offers numerous ways to touch up and repair common photo problems such as moire patterns, redeye, image graininess, and scratches, and add all kinds of special effects-from subtle and sophisticated to wild and wacky. You can also create multimedia presentations of photos, which include sound and animation. And now it's even easier to share PhotoDeluxe photos and photo projects with others by email or on the Web. PhotoDeluxe Home Edition 4 for Windows: Visual QuickStart Guide gets the novice up and running quickly with the software. The step-by-step tasks introduce you to PhotoDeluxe basics, from the interface and image editing fundamentals to getting images into the program. Then it's on to Guided Activities as readers learn to work with PhotoDeluxe templates to create all kinds of projects. More advanced topics explore exporting images, selection techniques, combining images, and special effects and filters. Finally there are two bonus chapters for PhotoDeluxe Business Edition users that focus on differences in the Business Edition interface and on how to use PhotoDeluxe to create professional looking sales and marketing tools for your small or home office. The clear, visual format of the book and detailed coverage of the application provide users of all skill levels with the information they need to enter the world of digital imaging or step up to the newest version of the software.
Temporal Reasoning in Workflow Systems
Authors: Claudio Bettini, X. Sean Wang, Sushil Jajodia
Venue: Distributed and Parallel Databases (2002)

In a workflow system, autonomous agents perform various activities cooperatively to complete a common task. Successful completion of the task often depends on correct synchronization and scheduling of agents' activities. It would greatly enhance the capabilities of current workflow systems if quantitative temporal constraints on the duration of activities and their synchronization requirements can be specified and reasoned about. This paper investigates such requirements and related reasoning algorithms. In particular, the paper studies the consistency, prediction and enactment services in a workflow system, and provides corresponding algorithms. The consistency service is to ensure that the specification of the temporal constraints is possible to satisfy&semi; the prediction service is to foretell the time frame for the involved activities&semi; and the enactment service is to schedule the activities so that, as long as each agent starts and finishes its task within the specified time period, the overall constraints will always be satisfied. For the enactment service, the paper identifies two practically interesting families of enactment schedules for autonomous agents, namely &ldquo;free schedules&rdquo; and &ldquo;restricted due-time schedules&rdquo;. In a free schedule, an agent may use any amount of time to finish the task as long as it is between the minimum and maximum time declared by the agent when the workflow is designed. A restricted due-time schedule is a more restrictive one in which the maximum amount of time that an agent may use is limited to a smaller number than the declared maximum. The paper presents efficient algorithms to find free and restricted due-time schedules. The paper also provides algorithms for the above services when multiple time granularities are involved in the temporal constraint specification.
Image Databases and Multimedia Search
Authors: Arnold Smeulders, Ramesh Jain
Venue:  (1998)

:Where Lycos and AltaVista are already accepted tools for textual information, image databases and multi-media search engines are the natural answers in the quest for pictorial information. This book provides a state-of-the-art description of that field. It contains the proceedings of a valuable workshop in Amsterdam, where people gathered to discuss the progress in the field. The topics cover computational methods of searching for pictures, the powerful pictorial clues in the recognition of objects, storage and indexing of objects in a database, and, ways to access the requested pictorial information.
Management Information Systems, 8th edition
Authors: Raymond McLeod, George P. Schell
Venue:  (2000)

:Building on the successful philosophy of the first edition - that learning how MIS concepts are applied in business makes concepts more interesting and easier to understand - Effy Oz has revised and updated this text to provide even more current, real business examples, expanded coverage of electronic commerce and business data communications. Five new Part Cases, covering a range of different types of businesses and enhanced with Case Videos, give a context to the various problems that businesses encounter every day - and how information systems can provide solutions.
Collaborative virtual entertainment: (if you can't beat 'em, join 'em?)
Authors: Michael Capps
Venue: Proceedings of the 4th international conference on Collaborative virtual environments (2002)

For years, the research community has tried to convince sponsors of the viability of CVE applications. In that same time, the computer gaming community has rolled out hundreds of "killer apps" each year - graphical, networked, social environments.Paying a handful of students to test one's research systems certainly has its charm. Regardless, researchers at the Naval Postgraduate School set out to learn if the computer games community might be leveraged in CVE research. The first such attempt, the Army Game Project, has thus far elicited millions of dollars of funding, hundreds of thousands of test subjects, dozens of television interviews, and zero refereed publications.This talk will present my experiences as a researcher masquerading as a game developer - and as a game developer pretending to be researcher. The evening will conclude with reckless predictions for the future of Collaborative Virtual Environments.
Preconditioning Strategies for Fully Implicit Radiation Diffusion with Material-Energy Transfer
Authors: Peter N. Brown, Carol S. Woodward
Venue: SIAM Journal on Scientific Computing (2001)

In this paper, we present a comparison of four preconditioning strategies for Jacobian systems arising in the fully implicit solution of radiation diffusion coupled with material energy transfer. The four preconditioning methods are block Jacobi, Schur complement, and operator splitting approaches that split the preconditioner solve into two steps. One splitting method includes the coupling of the radiation and material fields that appears in the matrix diagonal in the first solve, and the other method puts this coupling into the second solve. All preconditioning approaches use multigrid methods to invert blocks of the matrix formed from the diffusion operator. The Schur complement approach is clearly seen to be the most effective for a large range of weightings between the diffusion and energy coupling terms. In addition, tabulated opacity studies were conducted where, again, the Schur preconditioner performed well. Last, a parallel scaling study was done showing algorithmic scalability of the Schur preconditioner.
Disclosive computer ethics
Authors: Philip Brey
Venue: ACM SIGCAS Computers and Society (2000)

This essay provides a critique of mainstream computer ethics and argues for the importance of a complementary approach called disclosive computer ethics, which is concerned with the moral deciphering of embedded values and norms in computer systems, applications and practices. Also, four key values are proposed as starting points for disclosive studies in computer ethics: justice, autonomy, democracy and privacy. Finally, it is argued that research in disclosive computer ethics should be multi-level and interdisciplinary, distinguishing between a disclosure level, a theoretical level, and an an application level.
Professional Issues in Software Engineering, 3rd edition
Authors: Frank Bott, J. Eaton, D. Rowland, A. Coleman
Venue:  (2000)

:This book covers and area that is increasingly perceived as an essential element of software engineers' professional knowledge--the legal, professional and commercial context in which they work. The authors draw on their expertise and professional experience of academics in software engineering, law, industrial relations, and health and safety, explaining the central principles and issues in each field and showing how they apply to software engineering.
Wavelength routing in optical networks of diameter two
Authors: Christopher Jagger, Andrew Thomason
Venue: Journal of Computational and Applied Mathematics (2002)

We consider optical networks with routing by wavelength division multiplexing. We show that wavelength switching is unnecessary in routings where communication paths use at most two edges. We then exhibit routings in some explicit pseudo-random graphs, showing that they achieve optimal performance subject to constraints on the number of edges and the maximal degree. We also observe the relative inefficiency of planar networks.
Efficient tracing of failed nodes in sensor networks
Authors: Jessica Staddon, Dirk Balfanz, Glenn Durfee
Venue: Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications (2002)

In sensor networks, nodes commonly rely on each other to route messages to a base station. Although this practice conserves power it can obscure the cause of a measurement outage in a portion of the network. For example, when a base station ceases to receive measurements from a region of nodes it can't immediately determine whether this is because of the destruction of all the nodes in that region (due to an enemy attack, for example) or merely the result of the failure of a few nodes bearing much of the routing load. Previous solutions to this problem typically consist of re-running the route-discovery protocol, a process that can be quite expensive in terms of the number of messages that must be exchanged. We demonstrate that the topology of the network can be efficiently conveyed to the base station allowing for the quick tracing of the identities of the failed nodes with moderate communication overhead. Our algorithms work in conjunction with the existing functions of the network, requiring the nodes to send no additional messages.
The World Wide Web and Contemporary Cultural Theory: Magic, Metaphor, Power, 1st edition
Authors: Andrew Herman, Thomas Swiss
Venue:  (2000)

:The World Wide Web is the most well-known, celebrated, and promoted contemporary manifestation of "cyberspace." To date, however, most of the public discourse on the Web falls into the category of explanatory journalism -- the Web has remained largely unmapped in termsof contemporary cultural research. This book, however, begins that mapping by bringing together more than a dozen well-known scholars across the humanities and social sciences to explore the Web as a cultural technology characterized by a nexus of economic, political, social, and aesthetic forces. Engaging the thematic issues of the Web as a space where magic, metaphor, and power converge, the chapters cover such subjects as The Web and Corporate Media Systems, Conspiracy Theories and the Web; The Economy of Cyberpromotion, The Bias of the Web, The Web and Issues of Gender,and so on. Contributors: Jody Berland, Jodi Dean, Sean Cubitt, Greg Elmer, Andrew Herman, Steven Jones, Nancy Kaplan, Robert McChesney, Vincent Mosco, Stuart Moulthrop, Theresa Senft, Rob Shields, John Sloop, Thomas Swiss, and David Tetzlaff. book is rich in theoretical insight and empirical detail, unfolding from a stage-setting theoretical paper by Robert McChesney that situates the Web in corporate, global capitalism. This chapter alone makes the book worth buying. (Ben Agger, Enculturation)
A middleware component supporting flexible user interaction for networked home appliances
Authors: Tatsuo Nakajima
Venue: ACM SIGARCH Computer Architecture News (2001)

In this paper, we describe a middleware component supporting flexible user interaction for networked home appliances, which is a simple mechanism to fill the gap between traditional user interface systems and advanced user interaction devices. Our system enables us to control appliances in a uniform way at any places, and the system allows us to select suitable input and output devices according to our preferences and situations. Our system has based on the stateless thin-client system, and translates input and output interaction events according to user interaction devices. We also show the effectiveness of our approach in our home computing systems.
Inside the New Pro/Engineer Solutions
Authors: Gary Graham, Paula Berg, Jim Proctor
Venue:  (1998)

:Parametric Technology Corporation (PTC) - developer of Pro/ENGINEER - is one of the CAD/CAM/CAE industry's leading supplier of software tools used to automate the mechanical development of a product from conceptual design through production. Worldwide, more than 16,000 companies employ PTC's integrated software technologies to reduce time to market, improve engineering processes, and optimize product quality.
Robust Solutions to Uncertain Semidefinite Programs
Authors: Laurent El Ghaoui, Francois Oustry, Hervé Lebret
Venue: SIAM Journal on Optimization (1998)

In this paper we consider semidefinite programs (SDPs) whose data depend on some unknown but bounded perturbation parameters. We seek "robust" solutions to such programs, that is, solutions which minimize the (worst-case) objective while satisfying the constraints for every possible value of parameters within the given bounds. Assuming the data matrices are rational functions of the perturbation parameters, we show how to formulate sufficient conditions for a robust solution to exist as SDPs. When the perturbation is "full," our conditions are necessary and sufficient. In this case, we provide sufficient conditions which guarantee that the robust solution is unique and continuous (Hölder-stable) with respect to the unperturbed problem's data. The approach can thus be used to regularize ill-conditioned SDPs. We illustrate our results with examples taken from linear programming, maximum norm minimization, polynomial interpolation, and integer programming.
On the Boundary Control of Systems of Conservation Laws
Authors: Alberto Bressan, Giuseppe Maria Coclite
Venue: SIAM Journal on Control and Optimization (2002)

This paper is concerned with the boundary controllability of entropy weak solutions to hyperbolic systems of conservation laws. We prove a general result on the asymptotic stabilization of a system near a constant state. On the other hand, we give an example showing that exact controllability in finite time cannot be achieved, in general.
Bill Gates 99: Paper Doll Book
Authors: Chris Alpine, Peter Georgeson
Venue:  (1998)

:Find out the naked truth about computer genius/billionaire Bill Gates in this hilarious do-it-yourself paper-doll construction book that manages to surround him with all the physical trappings of modern society.
Microsoft Office 2000: Post-Advanced Concepts and Techniques, 1st edition
Authors: Gary B. Shelly, Thomas J. Cashman, Misty E. Vermaat
Venue:  (1999)

:This new text from the Shelly Cashman Series goes well beyond the fundamentals by covering more advanced Microsoft Office 2000 functionality for skilled users
Managing the Windows 2000 Registry
Authors: Paul Robichaux
Venue:  (2000)

:The Windows 2000 Registry is the repository for all hardware, software, and application configuration settings, and Managing the Windows 2000 Registry is the system administrator's guide to maintaining, monitoring, and updating the Registry database. The book, which is an update of Managing the Windows NT Registry, addresses four main areas: What is the Registry? Where does it live on disk? How do system services access and use it? What do you do if it's damaged or corrupted? Every 2000 administrator faces questions like this, often in a desperate attempt to fix something that's broken. What tools are available? Detailed descriptions of Regedit, RegEdt32, the System Policy Editor, Group Policy Editor and selected Resource Kit utilities explain how to edit and secure the Registry both on local and on remote computers. How can I access the Registry from a program? Regularly monitoring the Registry's contents is one way to preclude unpleasant surprises. Using examples in C++, Visual Basic, and Perl, Managing the Windows 2000 Registry demonstrates how to create Registry-aware tools and scripts. What's in the Registry? Not all Registry keys are adequately documented by Microsoft or by the other vendors who store configuration data in the Registry. Managing the Windows 2000 Registry offers a guided tour of some of these undocumented keys. This book is a "must have" for every 2000 system manager or administrator.
Internet User's Handbook 2001
Authors: Mark P. Ater, Betty Ater
Venue:  (2001)

:"The handbook answers the most commonly asked questions about choosing a computer and other hardware for using the internet, the software to accompany it, and the service providers that give access to the internet. Searching, downloading, emailing, listening to music and MP3, obtaining free stuff, shopping, using credit cards online, gambling, participating in auction sites, making travel arrangements, playing games, earning rewards and points, banking and paying bills, researching hobby interests, and obtaining information from local, state, and federal governments - all are fully covered."--BOOK JACKET.
Directory Enabled Networks
Authors: John C. Strassner
Venue:  (1999)

:Directory Enabled Networks is a completely new paradigm for leveraging the network. Current network management applications are built using applications and protocols designed to manage individual devices. DEN is a way to manage the entire network. While networks are currently able to provide Class of Service and Quality of Service, these services currently require manual provisioning by experienced personnel, and therefore have high associated cost of ownership. If these services can be centrally controlled and provisioned by simpler means, they can support existing applications and new network-aware applications that require dynamic, yet guaranteed levels of service while reducing the Total Cost of Ownership. The DMTF (desktop management task force) has a DEN working group responsible for developing and finalizing the DEN specification. The DEN specification will also have ramifications within the LDUP (LDAP replication) and policy-based networking working groups at the IETF.