ppxscal/embedding_network huggingface dataset:
Easy Microsoft PowerPoint 2000
Authors: Laura Stewart, Laura Monsen
Venue:  (1999)

:Easy Microsoft PowerPoint 2000 addresses key program changes such as the new user interface, better formatting options, and better integration with data from the other Office applications. Learn to run fully functional presentations over the web with Internet Explorer. Additionally, this edition adds coverage of soft skills not related to the software that will help improve your presentations. Coverage along these lines includes how to best present and emphasize your key points, how to choose the best fonts for your presentation media and how color choice is affected by presentation media and the audience you will present to.
The effect of organizational size and program status on information systems managers' perceptions of telecommuting
Authors: T. Selwyn Ellis, Robert L. Webster
Venue: ACM SIGCPR Computer Personnel (2002)

This study documents responses relating to advantages and disadvantages of telecommuting from a national survey mailed to information systems (IS) managers. These managers were selected because of both the explicit and implicit roles they play in technology decisions, including those related to telecommuting. Two variables thought to be associated with IS managers beliefs about telecommuting are isolated for measurement and testing. The two variables are firm size and whether the organization currently has a telecommuting program in place. Results indicate that neither firm size nor the existence of a telecommuting program affect beliefs of IS managers concerning the advantages and disadvantages of telecommuting. These results lend credence to the hypothesis that a consensus is forming regarding the benefits and drawbacks associated with this innovative and alternate work arrangement.
Reserving Resilient Capacity in a Network
Authors: G. Brightwell, G. Oriolo, F. B. Shepherd
Venue: SIAM Journal on Discrete Mathematics (2001)

We examine various problems concerning the reservation of capacity in a given network, where each arc has a per-unit cost, so as to be "resilient" against one or more arc failures. For a given pair (s,t) of nodes and demand T, we require that, on the failure of any k arcs of the network, there is sufficient reserved capacity in the remainder of the network to support an (s,t) flow of value T. This problem can be solved in polynomial time for any fixed k, but we show that it is NP-hard if we are required to reserve an integer capacity on each arc. We concentrate on the case where the reservation has to consist of a collection of arc-disjoint paths: here we give a very simple algorithm to find a minimum cost fractional solution, based on finding successive shortest paths in the network. Unlike traditional network flow problems, the integral version is NP-hard: we do, however, give a polynomial time $\frac{15}{14}$-approximation algorithm in the case k=1 and show that this bound is best possible unless P = NP.
UNIX Unleashed: System Administrator's Edition (with CD-ROM)
Authors: Robin Burk, David Horvath
Venue:  (1997)

:UNIX Unleashed, System Administrator s Edition and UNIX Unleashed, Internet Edition are an in-depth examination of the UNIX operating system. Written by experts, they include real-world examples, definitions, tips and tricks. Between them, these two editions cover the specifics of the most popular UNIX variants and the use of UNIX as a full-fledged Internet server platform.Complete and comprehensive; no other book has this much breadth, depth and real-world examplesCovers & compares SVR4, HP-UX, Solaris, AIX, and also BSD, IRIX, SunOS, Linux administrationHelps the reader decide which Shell works best for him/her: Bourne, Bourne Again, Kern or C?
A Rotated Multiplier Applied to the Controllability of Waves, Elasticity, and Tangential Stokes Control
Authors: Axel Osses
Venue: SIAM Journal on Control and Optimization (2001)

A new family of multipliers with rotated direction is introduced. This technique is applied to obtain new results concerning controllability of waves, elasticity, and Stokes equations. The boundary exact controllability for the wave equation and the dynamic elasticity system is reviewed generalizing the classical exit condition in the case of explicit observability constants. Approximate controllability for the Stokes system is also studied using a boundary control acting only on the tangential component of the velocity. A geometric sufficient condition of exit generalized type is deduced.
On proving inductive properties of abstract data types
Authors: David R. Musser
Venue: Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1980)

The equational axioms of an algebraic specification of a data type (such as finite sequences) often can be formed into a convergent set of rewrite rules; i.e. such that all sequences of rewrites are finite and uniquely terminating. If one adds a rewrite rule corresponding to a data type property whose proof requires induction (such as associativity of sequence concatenation), convergence may be destroyed, but often can be restored by using the Knuth-Bendix algorithm to generate additional rules. A convergent set of rules thus obtained can be used as a decision procedure for the equational theory for the axioms plus the property added. This fact, combined with a "full specification" property of axiomatizations, leads to a new method of proof of inductive properties--not requiring the explicit invocation of an inductive rule of inference.
On light graphs in the family of 4-connected planar graphs
Authors: Erhard Hexel
Venue: Discrete Mathematics (2002)

Let G be the family of all c-connected (c = 4 or 5) polyhedral supergraphs G of a given connected planar graph H where the minimum vertex degree of G is 5. Let R(H) denote the maximum face size of H. We have proved for all non-empty families G: In the case R(H) < c, every G ∈ G has a subgraph isomorphic to H whose vertices have a degree in G which is restricted by a number q = q(H,G). In the case R(H) ≥ c, such a restriction does not exist if H has a vertex of degree ≥ 5 or if H is 3-connected.
MSCE TestPrep: Core Exams, 1st edition
Authors: Jay Adamson, Joseph Phillips, Christoph Wille
Venue:  (1997)

:The MCSE TestPrep series provides a unique way to prepare for MCSE exams. The book is divided into seven units: two describe the MCSE program and preparing for it, one unit includes a sample exam for each of the four core exams, and each remaining four units covers one core exams. Each chapter within an exam unit covers a different exam objective. Each objective is further broken down into manageable sections. The information will be presented in a brief outline format and will include an abundance of tables, figures, screen shots, and lists. Following each section will be a series of review questions, exercises, and answer explanations. One complete practice exam for each core test and a glossary will be located at the end of the book.The only MCSE study guide of its kind organized like the successful Test Prep tools created by ARCOIncludes only the ESSENTIAL information needed and hundreds of questionsPerfect as an alternative to existing study materials or as a supplement to products available now!
Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus
Authors: Yijie Han, Yi Pan, Hong Shen
Venue: IEEE Transactions on Computers (2002)

The Linear Array with a Reconfigurable Pipelined Bus System (LARPBS) is a newly introduced parallel computational model, where processors are connected by a reconfigurable optical bus. In this paper, we show that the selection problem can be solved on the LARPBS model deterministically in \big. O((\log \log N)^2 / \log \log \log N )\bigr. time. To our best knowledge, this is the best deterministic selection algorithm on any model with a reconfigurable optical bus.
Analogue Neural VLSI: A Pulse Stream Approach, 1st edition
Authors: Alan F. Murray, Lionel Tarassenko
Venue:  (1994)

:Analogue VLSI is an important medium for the implementation of neural networks and the authors' aim in this book is to explore this technique in detail. This book compares a variety of approaches, giving readers an appreciation of analogue neural VLSI through examples of each approach rather than by means of an exhaustive survey.
Handbook of Computer Vision Algorithms in Image Algebra, 2nd edition
Authors: Gerhard X. Ritter, Joseph N. Wilson
Venue:  (2000)

:Handbook of Computer Vision Algorithms in Image Algebra provides engineers, scientists, and students with an introduction to image algebra and presents detailed descriptions of over 80 fundamental computer vision techniques. The book also introduces the portable iac++ library, which supports image algebra programming in the C++ language.
Processing queries with quantifiers a horticultural approach
Authors: Umeshwar Dayal
Venue: Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems (1983)

Most research on query processing has focussed on quantifier-free conjunctive queries. Existing techniques for processing queries with quantifiers either compile the query into a nested loop program or use variants of Codd's reduction from the Relational Calculus to the Relational Algebra. In this paper we propose an alternative technique that uses an algebra of graft and prune operations on trees. This technique provides a significant savings in space and time. We show how to transform a quantified conjunctive query into a sequence of graft and prune operations.
Fundamentals of Embedded Software: Where C and Assembly Meet with Cdrom, 1st edition
Authors: Daniel Wesley Lewis
Venue:  (2002)

:Fundamentals of Embedded Software: Where C and Assembly Meet is a refreshing alternative to the traditional sophomore text on computer organization and assembly language programming. The text approaches assembly the way it is commonly used in practice>to implement small, fast, or special-purpose routines called from a main program written in a high-level language such as C. By using an embedded software context, the text introduces multi-threaded programming, preemptive and non-preemptive systems, shared resources, and scheduling, thus providing a solid foundation for subsequent courses on operating systems, real-time systems, networking, and microprocessor-based design. The text will help you: appreciate the often overlooked consequences and limitations of binary representation. implement fast real-number arithmetic using fixed-point reals instead of floating-point. reinforce your comprehension of scope, parameter passing, recursion, and memory allocation. employ features of C (such as bit-manipulation and variant access) commonly used in embedded software. write functions in Intel x86 protected mode assembly to be called from C. estimate maximum data rate and latency for various styles of I/O programming. manage multiple threads, shared resources, and critical sections. develop programming practices that avoid priority inversions, deadlocks, and shared memory problems. Fundamentals of Embedded Software: Where C and Assembly Meet comes with a CD-ROM containing all the software tools needed to build simple stand-alone embedded applications on an ordinaryPentium-class PC: a C compiler, assembler, linker, boot loader, library, and both preemptive and non-preemptive real-time kernels. Also included are major portions of the source code for a number of programming assignments found in an appendix of the text.
PhotoShop 6 Web Magic with Cdrom
Authors: Jeff Foster, David J. Emberton, Peter J. Bauer
Venue:  (2001)

:Photoshop is releasing a new, updated version of Photoshop, creating the opportunity to create new – and much more exciting web graphics. Our last book was written for version 5.0. Building on the success of Photoshop Web Magic and Photoshop 5 Web Magic, this book will open the horizon to creating more interesting web pages through the use of integrated graphic programming. Content for this book will be determined when the beta version of Photoshop X is released in May or June. We expect the live release to come in Fall 2000. Each exemplar project will be from 3 to 10 pages in length and designed in a 2-column format with step-by-step instructions on the left and corresponding graphics (or code) on the right. In addition, sidebars will be used to provide additional tips and tricks. Any effect, technique, or tip can easily be customized to fit a your own design needs. The CD-ROM includes … Project files.
Dynamic Cluster Resource Allocations for Jobs with Known and Unknown Memory Demands
Authors: Li Xiao, Sonqing Chen, Xiaodong Zhang
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

The cluster system we consider for load sharing is a compute farm which is a pool of networked server nodes providing high-performance computing for CPU-intensive, memory-intensive, and I/O active jobs in a batch mode. Existing resource management systems mainly target at balancing the usage of CPU loads among server nodes. With the rapid advancement of CPU chips, memory and disk access speed improvements significantly lag behind advancement of CPU speed, increasing the penalty for data movement, such as page faults and I/O operations, relative to normal CPU operations. Aiming at reducing the memory resource contention caused by page faults and I/O activities, we have developed and examined load sharing policies by considering effective usage of global memory in addition to CPU load balancing in clusters. We study two types of application workloads: 1) Memory demands are known in advance or are predictable and 2) memory demands are unknown and dynamically changed during execution. Besides using workload traces with known memory demands, we have also made kernel instrumentation to collect different types of workload execution traces to capture dynamic memory access patterns. Conducting different groups of trace-driven simulations, we show that our proposed policies can effectively improve overall job execution performance by well utilizing both CPU and memory resources with known and unknown memory demands.
Controlled vapor-pressure heat-treatment effect on deep levels in liquid-encapsulated Czochralski-grown GaP crystals
Authors: T. J. Yu, T. Tanno, K. Suto, J. Nishizawa
Venue: Journal of Electronic Materials (2002)

Photocapacitance (PHCAP) measurements have been carried out on GaP crystals grown by the liquid-encapsulated Czochralski (LEC) method with heat treatment under various phosphorus-vapor pressures at different temperatures. Electron traps of Ec-1.1 eV, Ec-1.6 eV, Ec-1.9 eV, and a hole trap of Ev+2.26 eV are mainly detected. The phosphorus-vapor pressure dependence of the Ec-1.9 eV trap density and their diffusion behavior indicate that they are interstitial phosphorus atoms. The densities of both Ec-1.1 eV and Ec-1.6 eV traps are strongly dependent on the shallow impurity concentrations. Moreover, the density of Ec-1.1 eV traps increases with increasing phosphorus-vapor pressure. From these results, we suggest that Ec-1.1 eV traps are the complexes of shallow donors and antisite phosphorus atoms. Deep-level densities in GaP crystals after annealing at 860°C or 960°C for 60 min are decreased almost one order of magnitude lower than those in untreated substrate crystals, which should have occurred via out-diffusion of interstitial phosphorus atoms. However, such an effect is not prominent for 800°C treatment for 60 min.
Internet Routing Architectures, Second Edition, 2nd edition
Authors: Sam Halabi, Danny McPherson
Venue:  (2000)

:This invaluable reference provides realistic, practical design solutions from Cisco Systems-the Internetworking authority.Teaches how to construct and support robust ISP connections to the InternetIllustrates Inter- and Intra-domain routing issues, topologies, and scenarios for practical applicationThe only Internetworking book emphasizing domain routing issues and protocols endorsed by Cisco!
Precise pair-sharing analysis of logic programs
Authors: Vitaly Lagoon, Peter J. Stuckey
Venue: Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming (2002)

The paper presents a novel approach to pair-sharing analysis of logic programs. The pair-sharing domain ASub of Søndergaard is known to be more efficient than the set-sharing domain Sharing of Jacobs and Langen and gains accuracy because of linearity tracking. However, it is less accurate because of weaker groundness information, and the fact that it loses track of where new groundness eliminates sharing. In this paper we present a new domain which inherits the advantages of both ASub and Sharing and is uniformly more accurate in terms of pair-sharing than each of the two domains.The proposed domain expresses pair-sharing in terms of existence of <i>traversable paths</i> in <i>relation graphs</i> derived from program constraints. Each edge of a relation graph has an attached <i>groundness formula</i> which defines under what groundness conditions it still causes sharing. This allows the domain to maintain information about when groundness can eliminate sharing. Relation graphs are augmented by separate groundness information (usually Def or Pos). The groundness analysis and groundness formulae can be represented using efficient ROBDD methods.
Oracle Development Unleashed, 3rd edition
Authors: Dan Hotka
Venue:  (1999)

:Written by experienced Oracle developers, Oracle Unleashed teaches you how to build complex and sophisticated applications from start to finish using the newest features of Oracle8i, including SQLJ, JavaBeans, CORBA, and the Java Virtual Machine. Learn how to use the latest versions of Oracle Designer, Oracle Developer, and Oracle Discoverer, as well as develop programs that use Oracle's new enterprise management tools. You will also explore the fundamentals of Oracle database design, development, and administration and progress quickly to using Oracle's tools and products to make these tasks easier and faster. This edition focuses specifically on the tools Oracle developers use or need to understand.
Information systems development through social structures
Authors: Manuel Kolp, Paolo Giorgini, John Mylopoulos
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

Information systems for organizations such as e-business and knowledge management systems must continually evolve to adapt to their operational environment. Unfortunately, current development methodologies do not support system evolution well, making software an obstacle to organizational changes. The paper describes a framework that develops and evolves seamlessly a system-to-be within its organizational environment. We adopt a set of social structures --- organizational styles and social patterns --- based on concepts of organization theory and agent approaches, as a foundation to model early and late requirements as well as architectural and detailed design. We illustrate the use of the social structures through a case study, and we specify one of the styles in Formal Tropos language. This research has been conducted within the context of the Tropos project.
Effective internet education: a progress report
Authors: Barry L. Kurtz, Dee Parks, Eric Nicholson
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

Our Internet-based project is developing two courses to demonstrate the viability of a virtual classroom environment where the on-line student can interact both with the instructor and "virtual classmates." Other course components include a hyperlinked textbook and laboratory experiences that stress learning-by-doing. We use Java on both the server side and the client side to support the classroom interaction and the laboratory activities. This paper illustrates some of the particular software technologies used. We discuss problems encountered, solutions found, and the ongoing development of materials.
Applications of smarandache function, and prime and coprime functions
Authors: Sebastián Martín Ruiz
Venue:  (2002)

A book for people who love numbers: Smarandache Function applied to perfect numbers, congruences. Also, the Smarandache Prime and Coprime functions in connection with the expressions of the prime numbers.
ACM SIGACT news distributed computing column 5
Authors: Sergio Rajsbaum
Venue: ACM SIGACT News (2001)

The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification internet, and the web.This issue consists of four parts:&bull; a survey of SIROCCO'01 by Pierre Fraigniaud,&bull; a survey of POMC'01 by Rui Fan,&bull; a survey of PODC'01 by myself,&bull; the paper "Paxos Made Simple" by Leslie Lamport.This year was the 20-th anniversary of PODC, and included a special celebration honoring the work of Leslie Lamport, on the occasion of his 60th birthday, and was collocated with the Workshop on Principles of Mobile Computing (POMC). I briefly describe the PODC conference, and reproduce the toast by Fred Schneider in the honor of Leslie. The Business Meeting report is by Gil Neiger. Finally, there is Leslie's paper on his own algorithm which was discussed in a few of the PODC lectures. I am very grateful to the many people contributing to this issue.
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
Authors: Avrim Blum, Howard Karloff, Yuval Rabani, Michael Saks
Venue: SIAM Journal on Computing (2000)

A lower bound of $\Omega(\sqrt{\log k / \log \log k})$ is proved for the competitive ratio of randomized algorithms for the k-server problem against an oblivious adversary. The bound holds for arbitrary metric spaces (having at least k+1 points) and provides a new lower bound for the metrical task system problem as well. This improves the previous best lower bound of $\Omega(\log \log k)$ for arbitrary metric spaces [H. J. Karloff, Y. Rabani, and Y. Ravid, SIAM J. Comput., 23 (1994), pp. 293--312] and more closely approaches the conjectured lower bound of $\Omega(\log k)$. For the server problem on k+1 equally spaced points on a line, which corresponds to a natural motion-planning problem, a lower bound of $\Omega(\frac{\log k}{\log \log k})$ is obtained.The results are deduced from a general decomposition theorem for a simpler version of both the k-server and the metrical task system problems, called the "pursuit-evasion game." It is shown that if a metric space $\cal M$ can be decomposed into two spaces $\cal M_L$ and $\cal M_R$ such that the distance between them is sufficiently large compared to their diameter, then the competitive ratio for this game on $\cal M$ can be expressed nearly exactly in terms of the ratios on each of the two subspaces. This yields a divide-and-conquer approach to bounding the competitive ratio of a space.
Realtime Physics: Active Learning Laboratories: Module 2: Heat and Thermodynamics, 1st edition
Authors: David R. Sokoloff, Priscilla W. Laws, Ronald K. Thornton
Venue:  (1998)

:This computer-based lab manual contains experiments in mechanics, thermodynamics, E&M, and optics using hardware and software designed to enhance readers' understanding of calculus-based physics concepts. It uses an active learning cycle, including concept overviews, hypothesis-testing, prediction-making, and investigations.