ppxscal/embedding_network huggingface dataset:
Coordinating backup/recovery and data consistency between database and file systems
Authors: Suparna Bhattacharya, C. Mohan, Karen W. Brannon, Inderpal Narang, Hui-I Hsiao, Mahadevan Subramanian
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

Managing a combined store consisting of database data and file data in a robust and consistent manner is a challenge for database systems and content management systems. In such a hybrid system, images, videos, engineering drawings, etc. are stored as files on a file server while meta-data referencing/indexing such files is created and stored in a relational database to take advantage of efficient search. In this paper we describe solutions for two potentially problematic aspects of such a data management system: backup/recovery and data consistency. We present algorithms for performing backup and recovery of the DBMS data in a coordinated fashion with the files on the file servers. Our algorithms for coordinated backup and recovery have been implemented in the IBM DB2/DataLinks product [1]. We also propose an efficient solution to the problem of maintaining consistency between the content of a file and the associated meta-data stored in the DBMS from a reader's point of view without holding long duration locks on meta-data tables. In the model, an object is directly accessed and edited in-place through normal file system APIs using a reference obtained via an SQL Query on the database. To relate file modifications to meta-data updates, the user issues an update through the DBMS, and commits both file and meta-data updates together.
Communication skills of technical professionals: a report for schools of business administration
Authors: Jack D. Becker, Robert G. Insley, Megan L. Endres
Venue: ACM SIGCPR Computer Personnel (1997)

The business community has frequently complained about the poor quality of college graduates' communication skills, with information systems and computer science graduates often criticized most severely. The purpose of this research was to investigate and analyze the communication skills of information systems (IS) personnel in terms of current and desired skill levels as perceived by their managers. This paper presents a survey of IS managers which revealed findings concerning: (1) the perceived importance of communication skills to technical professionals, (2) the perceived communication skills levels of these employees as compared to those of employees in nontechnical fields, and (3) the expected levels of communication skills of college graduates in technical fields. For example, the findings reconfirm the need for more communication skills education and training for IS students. The findings and their implications for graduates and professionals in technical fields are discussed.
Cisco IP Routing Handbook, 1st edition
Authors: Paul Cernick, Mark Degner, Keith Kruepke
Venue:  (2000)

:On-the-Job Cisco IP Routing Solutions Packed with network-tested troubleshooting techniques, advanced configuration solutions, and inside tips on how to avoid common pitfalls, this all-fact, no-fluff reference shows you step-by-step how to tackle real-world IP routing challenges. There's no theory, no tutorials-just the nuts-and-bolts information you need to solve the problem at hand, compiled by three Cisco-certified professionals who've seen it all. Your Guide for Configuring and Troubleshooting Routing Information Protocol (RIP) Interior Gateway Routing Protocol and Enhanced Interior Gateway Routing Protocol (IGRP and EIGRP) Open Shortest Path First (OSPF) Integrated Intermediate System to Intermediate System (IS-IS) Border Gateway Protocol (BGP) Static and default routing Route redistribution Dial-on-Demand Routing (DDR)
Minimizing energy for wireless web access with bounded slowdown
Authors: Ronny Krashinsky, Hari Balakrishnan
Venue: Proceedings of the 8th annual international conference on Mobile computing and networking (2002)

On many battery-powered mobile computing devices, the wireless network is a significant contributor to the total energy consumption. In this paper, we investigate the interaction between energy-saving protocols and TCP performance for Web like transfers. We show that the popular IEEE 802.11 power-saving mode (PSM), a "static" protocol, can harm performance by increasing fast round trip times (RTTs) to 100 ms; and that under typical Web browsing workloads, current implementations will unnecessarily spend energy waking up during long idle periods.To overcome these problems, we present the Bounded-Slowdown (BSD) protocol, a PSM that dynamically adapts to network activity. BSD is an optimal solution to the problem of minimizing energy consumption while guaranteeing that a connection's RTT does not increase by more than a factor p over its base RTT, where p is a protocol parameter that exposes the trade-off between minimizing energy and reducing latency. works by staying awake for a short period of time after the link idle. We present several trace-driven simulation results that show that, compared to a static PSM, the Bounded Slowdown protocol reduces average Web page retrieval times by 5--64%, while simultaneously reducing energy consumption by 1--14% (and by 13X compared to no power management).
Requirements Engineering: Processes and Techniques
Authors: Ian Sommerville, Gerald Kotonya
Venue:  (1998)

:Comprehensive coverage of a crucial stage in software engineering.Requirements engineering occurs at the start of software development and involves the analysis and negotiation of what capabilities and features a proposed system needs to possess. Divided into two parts, this textbook addresses every stage of requirements engineering--from elicitation, validation, and management to non-functional specification, classical techniques, viewpoint-oriented techniques, and interactive specifications.
Decidability of Termination of Grid String Rewriting Rules
Authors: Alfons Geser
Venue: SIAM Journal on Computing (2002)

Termination of string rewriting is known undecidable. Termination of string rewriting with only one rule is neither known decidable nor known undecidable. This paper presents a decision procedure for rules $u\rightarrow v$ such that some letter b from u occurs as often or less often in v. We call such rules "grid" rules. By far most rules are grid rules. Grid rules cover all rules which terminate by a total division order. Thus total division orders are shown to be irrelevant for the termination problem of one-rule string rewriting.
Structured COBOL Programming, 10th edition
Authors: Nancy Stern, Robert A. Stern, James P. Ley
Venue:  (2002)

:A popular text, noted for its extensive pedagogy and unparalleled ability to crystallize difficult, technical concepts accurately. In this edition COBOL-85 is given primary emphasis and the latest standard, COBOL 199x is highlighted throughout. Contains increased coverage of object-oriented COBOL, pseudocodes and programming on microcomputers. Features all new practice programs, a novel multimedia slide program and a new, more powerful compiler--MicroFocus Personal COBOL.
Microsoft Visual Interdev: Web Reference
Authors: Microsoft Corporation
Venue:  (1998)

:An indispensable set of resources collected in a single volume, the Microsoft Visual InterDev 6.0 Web Technologies Reference offers essential reference guides to scripting languages on both the client and server sides. Experience Level: Beginner/ Intermediate
Smoothed Bagging with Kernel Bandwidth Selectors
Authors: Shinjae Lee, Sungzoon Cho
Venue: Neural Processing Letters (2001)

Recently, a combined approach of bagging (bootstrap aggregating) and noise addition was proposed and shown to result in a significantly improved generalization performance. But, the level of noise introduced, a crucial factor, was determined by trial and error. The procedure is not only ad hoc but also time consuming since bagging involves training a committee of networks. Here we propose a principled procedure of computing the level of noise, which is also computationally less expensive. The idea comes from kernel density estimation (KDE), a non-parametric probability density estimation method where appropriate kernel functions such as Gaussian are imposed on data. The kernel bandwidth selector is a numerical method for finding the width of a kernel function (called bandwidth). The computed bandwidth can be used as the variance of added noise. The proposed approach makes the trial and error procedure unnecessary, and thus provides a much faster way of finding an appropriate level of noise. In addition, experimental results show that the proposed approach results in an improved performance over bagging, particularly for noisy data.
Using Unlabelled Data to Train a Multilayer Perceptron
Authors: Antanas Verikas, Adas Gelzinis, Kerstin Malmqvist
Venue: Neural Processing Letters (2001)

This Letter presents an approach to using both labelled and unlabelled data to train a multilayer perceptron. The unlabelled data are iteratively pre-processed by a perceptron being trained to obtain the soft class label estimates. It is demonstrated that substantial gains in classification performance may be achieved from the use of the approach when the labelled data do not adequately represent the entire class distributions. The experimental investigations performed have shown that the approach proposed may be successfully used to train neural networks for learning different classification problems.
CCNA Virtual Lab e-trainer, 1st edition
Authors: Todd Lammle, Bill Tedder
Venue:  (2000)

:If you're serious about passing the CCNA exam, you need hands-on experience with routers and switches. Until now, this has required access to expensive network equipment-not to mention the freedom to experiment with it. The CCNA Virtual Lab e-trainer from Sybex gives you everything you need. You can practice with this, "equipment" on your own, use it in conjunction with suggested labs that cover CCNA exam objectives, or even design custom labs. An affordable alternative to products and courses costing hundreds, even thousands, of dollars, the CCNA Virtual Lab e-trainer allows you to work at your own pace, on your own time, so you get the most out of your exam preparation efforts. System requirements: System: Windows 95/98/NT/2000 133 Mhz 32 MB RAM 2 MB Video RAM 7 MB Hard Disk space 8x CD-ROM Drive Any pointing device
Internet Nuggets
Authors: Mark Thorson
Venue: ACM SIGARCH Computer Architecture News (1996)

This column consists of selected traffic from the comp.arch newsgroup, a forum for discussion of computer architecture on Internet---an international computer network.
Advantage Series: Microsoft PowerPoint 2000 Brief Edition, 1st edition
Authors: Sarah E. Hutchinson-Clifford, Glen Coulthard
Venue:  (1999)

:The Advantage Series presents the Why,What and How of computer application skills to today's students. Each lab in this series is built upon an efficient learning model,which provides students and faculty with complete coverage and enhances critical thinking skills.
Verification of FM9801: An Out-of-Order Microprocessor Model with Speculative Execution, Exceptions, and Program-Modifying Capability
Authors: Jun Sawada, Warren A. Hunt,  Jr.
Venue: Formal Methods in System Design (2002)

We have verified the FM9801, a microprocessor design whose features include speculative execution, out-of-order issue and completion of instructions using Tomasulo's algorithm, and precise exceptions and interrupts. As a correctness criterion, we used a commutative diagram that compares the result of the pipelined execution from a flushed state to another flushed state with that of the sequential execution. Like many pipelined microprocessors, the FM9801 may not operate correctly if the executed program modifies itself. We discuss the condition under which the processor is guaranteed to operate correctly. In order to show that the correctness criterion is satisfied, we introduce an intermediate abstraction that records the history of executed instructions. Using this abstraction, we define a number of invariant properties that must hold during the operation of the FM9801. We verify these invariant properties, and then derive the proof of the commutative diagram from them. The proof has been mechanically checked by the ACL2 theorem prover.
Using circular programs to deforest in accumulating parameters
Authors: Janis Voigtländer
Venue: Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation (2002)

Functional languages allow a modular programming style by function composition, which however can lead to inefficient runtime behavior due to production and consumption of intermediate results.We present a new mechanizable transformation technique for removing intermediate data structures in the composition of two functions from a class of recursive functions with accumulating parameters, for which classical deforestation techniques fail.In order to avoid multiple traversals of the input data structure, the composition algorithm produces circular programs that make essential use of lazy evaluation and local recursion.The resulting programs are simplified using a post-processing phase presented in the paper.
Mcdba SQL Server 7 Administration Study Guide (Book/CD-ROM Set)
Authors: Syngress Media Inc., Snygress Media Inc Staff
Venue:  (1999)

:Pass the MCDBA SQL Server 7 core exams u guaranteed! Don't trust your MCDBA future to anything less than these Microsoft-approved study guides sponsored by Global Knowledge,the world's largest independent information technology education provider! Complete with a CD-ROM packed with over 175 challenging Test Yourself questions you can tackle in Practice Mode (with in-depth answers) or Timed Mode (just you against the clock),each includes realistic Certification Exercises modeled after classroom labs,Exam Watch warnings on the toughest topics,How to Take the Exam pointers from training pros,and more. Best of all,they're GUARANTEED to help you pass. . . or return your purchased copy for a full refund! *MCDBA SQL Server 7 Administration Study Guide (Exam 70-28) Covers all test objectives u server installation and upgrade. . . SQL server integration. . . enterprise-wide database administration. . . managing data,database storage,and user accounts and permissions. . . server alert processing and task processing. . . replication. . . connectivity and network support. . . tuning and monitoring. . . troubleshooting and more. Don't let the real test be your first test! Prepare to pass the MCDBA/MCSE SQL Server 7 Administration exam - while gaining practical knowledge of Microsoft's relational database technology for on-the-job success. Built on the proven training methodology of Global Knowledge,this complete study guide and CD-ROM package offers actual classroom techniques used by more than 200,000 IT professionals each year.
Access rights analysis for Java
Authors: Larry Koved, Marco Pistoia, Aaron Kershenbaum
Venue: Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2002)

Java 2 has a security architecture that protects systems from unauthorized access by mobile or statically configured code. The problem is in manually determining the set of security access rights required to execute a library or application. The commonly used strategy is to execute the code, note authorization failures, allocate additional access rights, and test again. This process iterates until the code successfully runs for the test cases in hand. Test cases usually do not cover all paths through the code, so failures can occur in deployed systems. Conversely, a broad set of access rights is allocated to the code to prevent authorization failures from occurring. However, this often leads to a violation of the "Principle of Least Privilege"This paper presents a technique for computing the access rights requirements by using a context sensitive, flow sensitive, interprocedural data flow analysis. By using this analysis, we compute at each program point the set of access rights required by the code. We model features such as multi-threading, implicitly defined security policies, the semantics of the Permission.implies method and generation of a security policy description. We implemented the algorithms and present the results of our analysis on a set of programs. While the analysis techniques described in this paper are in the context of Java code, the basic techniques are applicable to access rights analysis issues in non-Java-based systems.
Where's It Going?
Authors: Ian Pearson, Chris Winter
Venue:  (2000)

:In the future, communication, computing and consumer electronics will converge to create a seamless IT environment. In this book, two leading futurologists examine the changes that lie ahead. They explore the significance of these developments and their radical impact not only on business and economic systems but also on the very structure of society.. "Will we accept that our species could make a great evolutionary leap forward by becoming part human, part machine - or will we attempt to fight the inevitable?.
Task Scheduling in Networks
Authors: Cynthia Phillips, Clifford Stein, Joel Wein
Venue: SIAM Journal on Discrete Mathematics (1997)

Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic problem in computer science and operations research. Most of the research on this problem incorporates the potentially unrealistic assumption that communication between the different machines is instantaneous. In this paper we remove this assumption and study the problem of network scheduling, where each job originates at some node of a network, and in order to be processed at another node must take the time to travel through the network to that node.Our main contribution is to give approximation algorithms and hardness proofs for fully general forms of the fundamental problems in network scheduling. We consider two basic scheduling objectives: minimizing the makespan and minimizing the average completion time. For the makespan, we prove small constant factor hardness-to-approximate and approximation results. For the average completion time, we give a log-squared approximation algorithm for the most general form of the problem. The techniques used in this approximation are fairly general and have several other applications. For example, we give the first nontrivial approximation algorithm to minimize the average weighted completion time of a set of jobs on related or unrelated machines, with or without a network.
Some prolog macros for rule-based programming: why? how?
Authors: Tim Menzies, Lindsay Mason
Venue: Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming (2002)

The history, benefits, and drawbacks to pure rule-based programming is discussed. A simple extension to pure rule-based programming is described. The extensions are very quick to code and can be easily customized to support a range of knowledge engineering applications.
Own your own color print shop for fun and (a small) profit
Authors: Christopher Jones
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

The School of Architecture and Allied Arts at the University of Oregon runs its own color print shop for students, faculty, and staff. This paper and poster provide details of its operation.We offer printing on a color laser printer and four large-format inkjet printers, between 24 and 42 inches wide.All printers are served through an AppleShare IP server, which will be upgraded to run OS X Server beginning in Fall 2002.All print jobs are placed on hold at the print server when they arrive. Customers can walk up to the Output Room window and see an on-screen PDF preview of their print jobs before the jobs are manually released to the printer by the Output Room operator.Print jobs are charged per page for the laser printer and per linear foot for the large-format printers. Since there was no computerized print charging system in place when the Output Room was created, customers buy paper punchcards in a variety of denominations from the bookstore. Holes are punched out on the cards to deduct value from them. No cash is handled at the Output Room.The Output Room earns a small profit each year, despite charging about half the price that commercial copy shops charge for similar quality printing. Our color printing operations also subsidize free black and white laser printing in our computer labs, allowing us to avoid having to set up an expensive print tracking and charging system.
Executing SQL over encrypted data in the database-service-provider model
Authors: Hakan Hacigümüş, Bala Iyer, Chen Li, Sharad Mehrotra
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

Rapid advances in networking and Internet technologies have fueled the emergence of the "software as a service" model for enterprise computing. Successful examples of commercially viable software services include rent-a-spreadsheet, electronic mail services, general storage services, disaster protection services. "Database as a Service" model provides users power to create, store, modify, and retrieve data from anywhere in the world, as long as they have access to the Internet. It introduces several challenges, an important issue being data privacy. It is in this context that we specifically address the issue of data privacy.There are two main privacy issues. First, the owner of the data needs to be assured that the data stored on the service-provider site is protected against data thefts from outsiders. Second, data needs to be protected even from the service providers, if the providers themselves cannot be trusted. In this paper, we focus on the second challenge. Specifically, we explore techniques to execute SQL queries over encrypted data. Our strategy is to process as much of the query as possible at the service providers' site, without having to decrypt the data. Decryption and the remainder of the query processing are performed at the client site. The paper explores an algebraic framework to split the query to minimize the computation at the client site. Results of experiments validating our approach are also presented.
The Facts on File Dictionary of Computer Science, 4th edition
Authors: John Daintith
Venue:  (2000)

:Anyone with a computer and an Internet connection will find this a welcome addition to the series. The basic concepts of computer science are covered in clear, easy-to-understand language. More than 1,600 entries detail the fundamentals of computer science, such as hardware, software, and applications. Among the topics covered are: artificial intelligence, home computer use, information technology, the Internet, security issues and much more. Valerie is a physicist who has edited a number of dictionaries. John is an editor and contributor to many reference works. He resides in Aylesbury, England.