ppxscal/embedding_network huggingface dataset:
Oracle8i: A Beginner's Guide, 1st edition
Authors: Michael Abbey, Ian Abramson
Venue:  (1999)

:Learn to use all the features of Oracle8i using this best-selling introduction to Oracle8i. The best-selling introduction to Oracle8i officially authorized by Oracle Corporation. Learn to use all the features of Oracle8ithe most complete and comprehensive platform for building and deploying Internet and enterprise applications. Oracle8i A Beginner's Guide explains the core concepts and new tools included in this fully Web-enabled release of the most powerful database management system available. Inside,you'll learn to set up,query,manage,and tune your Oracle8i database. Written by Oracle experts and fully authorized by Oracle Corporation,this official guide shows you how to: Understand Oracle8i architecture,including the hierarchy of objectsfrom tables and views to roles and grants Install Oracle8i using the new Universal Installer Create tables,query,generate reports,and develop applications with SQL and PL/SQL Tune your database for optimal performance with the Oracle Enterprise Manager (OEM) 2. 0 Handle data warehousing and backup and recovery Build,deploy,and manage Web database applications and content-driven Web sites with WebDB Use the industry standard structured query language (SQL) Develop and deploy enterprise Java applications with JDeveloper Packed with expert information on the Oracle8i Server and all its components,Oracle8i A Beginner's Guide is the only book you'll need to get up and running on the database for Internet computing.
Mac OS X 10.2
Authors: Maria Langer
Venue:  (2002)

:With more than 150 new features and applications, Mac OS X 10.2 is more than a minor upgrade. For those of you experienced Mac users who already know your way around the desktop, Mac OS X 10.2 Advanced: Visual QuickPro Guide is the fastest way to ramp up on the software's myriad new features. Veteran Macintosh columnist and author Maria Langer goes beyond the basics to show you how to get the most out of Mac OS X 10.2. In addition to covering Mac OS X 10.2's new features, such as the enhanced Finder, spam-busting email software, global address book, and Rendezvous (Apple's newest networking technology), Langer takes on security, fine-tuning functionality, customizing Mac OS X 10.2, and more. Plus, the Visual QuickPro Guide format uses tons of pictures, concise language, and step-by-step tasks, making it easy to get up-to-speed on all of Mac OS X 10.2's advanced features in no time.
'Yours for Improvement'-The Adding Machines of Chicago, 1884-1930
Authors: Peggy Aldrich Kidwell
Venue: IEEE Annals of the History of Computing (2001)

Between 1884 and 1930, the city of Chicago emerged as a center of manufacture for a new kind of machine, designed especially to assist in ordinary addition. Chicago inventions and products would shape the adding machine industry into the second half of the 20th century.
Access 97 Programming for Windows for Dummies (with CD-ROM)
Authors: Rob Krumm
Venue:  (1997)

:The secret to powerful, productive database applications lies in using the power of programming. It's right there, built into Access; and with Access 97 Programming For Windows For Dummies, you can transform your tables, forms, and reports into sleek, custom-designed applications that will give your business or organization information at its fingertips. Rob Krumm has created a guide to programming that will give you the start you need to create the customer database applications you have always wanted. Inside, find helpful advice on how to Get your Access databases to start doing the work themselves by writing programs in VBA Publish your database information as easy-to-browse Web pages Impress all of your analyst friends with your knowledge of standard query language (SQL) -- the key to database power Turn your Access forms and reports into powerful tools for processing and analyzing data Understand the basics of client/server databases Apply loads of practical examples that you can put to work for you today Build your own dialog boxes and customized wizards
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
Authors: Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
Venue: SIAM Journal on Computing (2000)

An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refutations is proved. This implies an exponential separation between the tree-like versions and the dag-like versions of resolution and cutting planes. In both cases only superpolynomial separations were known [A. Urquhart, Bull. Symbolic Logic, 1 (1995), pp. 425--467; J. Johannsen, Inform. Process. Lett., 67 (1998), pp. 37--41; P. Clote and A. Setzer, in Proof Complexity and Feasible Arithmetics, Amer. Math. Soc., Providence, RI, 1998, pp. 93--117]. In order to prove these separations, the lower bounds on the depth of monotone circuits of Raz and McKenzie in [ Combinatorica, 19 (1999), pp. 403--435] are extended to monotone real circuits.An exponential separation is also proved between tree-like resolution and several refinements of resolution: negative resolution and regular resolution. Actually, this last separation also provides a separation between tree-like resolution and ordered resolution, and thus the corresponding superpolynomial separation of [A. Urquhart, Bull. Symbolic Logic, 1 (1995), pp. 425--467] is extended. Finally, an exponential separation between ordered resolution and unrestricted resolution (also negative resolution) is proved. Only a superpolynomial separation between ordered and unrestricted resolution was previously known [A. Goerdt, Ann. Math. Artificial Intelligence, 6 (1992), pp. 169--184].
ADSL and DSL Technologies
Authors: Walter J. Goralski
Venue:  (2000)

:What loads Web pages up to 50 times faster and cheaper than ISDN (Integrated Services Digital Network) channels, the fastest data transmission technology currently available to home users? ADSL (Asymmetric Digital Subscriber Line) technology. It's here today, and it uses the existing copper lines that already connect 600 million subscribers to the PSTN. Recently released standards promise to spur rapid growth in the development of a new high-speed ADSL-based applications - vastly faster Internet access and new broadband services like entertainment video, telecommuting, video conferencing, enhanced telephony, and more. Now telecommunication engineers, vendors, and business managers in the cable and telephone industries can quickly get a handle on ADSL technology - without having to wade through mountains of extremely technical ADSL architecture reference materials. This comprehensive ADSL guidebook sorts it all out and translates it into terms that everyone involved with this new technology (carrier personnel, educators, consultants, and consumers) can understand. If you need to not only understand ADSL technology, but also how to apply and install it, this highly readable and practical book is for you. It includes numerous real-world applications and examples that will help you quickly and cost-effectively tap the awesome power of ADSL.
Partial words and a theorem of Fine and Wilf revisited
Authors: F. Blanchet-Sadri, Robert A. Hegstrom
Venue: Theoretical Computer Science (2002)

A word of length n over a finite alphabet A is a map from {0,...,n_1} into A. A partial word of length n over A is a partial map from {0,...,n_1} into A. In the latter case, elements of {0,...,n1} without image are called holes (a word is just a partial word without holes). In this paper, we extend a fundamental periodicity result on words due to Fine and Wilf to partial words with two or three holes. This study was initiated by Berstel and Boasson for partial words with one hole. Partial words are motivated by molecular biolog
Special Edition Using CorelDRAW 9
Authors: Steve Bain, D. Scott Campbell
Venue:  (1999)

:Special Edition Using CorelDRAW 9 is a comprehensive guide to CorelDRAW 9, covering the basics of each function and focusing on the advanced features and power of the software. Each chapter contains step-by-step illustrations of techniques and tutorials. As a complete CorelDRAW 9 reference, you see drawing tips and illustration techniques used by a master CorelDRAW user. By following the full-color workshops, this book serves as a practical guide and teacher for years to come. Loaded with tips, tricks, and shortcuts, this book teaches illustration techniques while demystifying complex CorelDRAW features. Also covers print and Web issues. Learn all of CorelDRAW's new features, including support for the Mac OS, compatibility with other graphics applications and formats, third-party plug-in integration, and internet capabilities Deconstruct illustrations to learn advanced techniques and tricks
Extended Hamilton--Jacobi Characterization of Value Functions in Optimal Control
Authors: Grant N. Galbraith
Venue: SIAM Journal on Control and Optimization (2000)

This paper examines generalized solutions to the Hamilton--Jacobi equation. The Hamiltonian H(t,x,p) is assumed convex in p but is not constrained to have linear growth in this variable. This corresponds to a certain class of generalized Bolza problems, related to optimal control. Lower semicontinuous solutions are considered and it is shown that there is a unique solution, the so-called value function of the underlying Bolza problem. In proving the main result we use recent improved necessary optimality conditions. Viability is also used in a new way, in connection to differential inclusions with unbounded images.
Error Estimates for a Numerical Scheme for Ferromagnetic Problems
Authors: P. B. Monk, O. Vacus
Venue: SIAM Journal on Numerical Analysis (1999)

We propose a finite element method for approximating the nonlinear equations describing the electromagnetic field in a ferromagnetic material. Using energy arguments, we prove an optimal convergence rate for the method assuming a sufficiently smooth electromagnetic field. We also verify that the finite element solution satisfies various conservation conditions appropriate to the continuous problem. Finally, we provide some numerical examples.
Design experience of a chip multiprocessor merlot and expectation to functional verification
Authors: Satoshi Matsushita
Venue: Proceedings of the 15th international symposium on System Synthesis (2002)

We have fabricated a Chip Multiprocessor prototype code-named Merlot to proof our novel speculative multithreading architecture. On Merlot, multiple threads provide wider issue window beyond ordinal instruction level parallel (ILP) processors like superscalar or VLIW. With the architecture, we estimate 3.0 times speedup against single processing elements (PE) on speech recognition code and IDCT code with four PEs. Merlot integrates on-chip devices, PCI interface, and SDRAM interfaces. We have encountered design issues of chip multiprocessor and SoC design. We have successfully run parallelized mpeg3 decoder on the first silicon with several software workarounds, thanks to functional verification environment including system modeling on RTL. However, bugs found in later stage of design have required larger manpower or delay of project. In this paper, we also discuss the methodology to improve functional verification coverage, and expect the solution in formal approaches.
Sams' Teach Yourself Internet Explorer 4 in 10 Minutes, 1st edition
Authors: Paul Cassel, Joe Lowery
Venue:  (1998)

:10 minutes is all you need to learn how to: learn about the latest features in Internet Explorer 4; find and download files using FTP; use Outlook Express to send and receive email; subscribe to newsgroups; integrate the Web and the PC; hold conferences with colleagues using NetMeeting; and publish your own Web pages.
Working Classes: Data Structures and Algorithms Using C++, 1st edition
Authors: Rick Decker, Stuart Hirshfield
Venue:  (1995)

:Decker and Hirshfield's Working Classes applies the C++ programming language to the study of data structures and abstract data types. The authors organize their discussion of abstract data types according to their structural restrictions beginning with highly structured lists, stacks, and queues, and progressing through trees and directed graphs to unstructured sets. Chapter 10 examines the problem of regenerating text from a large sample, using a real computer/compiler system to demonstrate how time and space constraints arise from the choice of data structure. The book teaches by example (with more than 350 exercises provided), and most chapters conclude with an optional Explorations section that covers topics of special interest.
A design space evaluation of grid processor architectures
Authors: Ramadass Nagarajan, Karthikeyan Sankaralingam, Doug Burger, Stephen W. Keckler
Venue: Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture (2001)

In this paper, we survey the design space of a new class of architectures called Grid Processor Architectures (GPAs). These architectures are designed to scale with technology, allowing faster clock rates than conventional architectures while providing superior instruction-level parallelism on traditional workloads and high performance across a range of application classes. A GPA consists of an array of ALUs, each with limited control, connected by a thin operand network. Programs are executed by mapping blocks of statically scheduled instructions to the ALU array and executing them dynamically in dataflow order. This organization enables the critical paths of instruction blocks to be executed on chains of ALUs without transmitting temporary values back to the register file, avoiding most of the large, unscalable structures that limit the scalability of conventional architectures. Finally, we present simulation results of a preliminary design, the GPA-1. With a half-cycle routing delay, we obtain performance roughly equal to an ideal 8-way, 512-entry window superscalar core. With no inter-ALU delay, perfect memory, and perfect branch prediction, the IPC of the GPA-1 is more than twice that of the ideal superscalar core, achieving an average of 11 IPC across nine SPEC CPU2000 and Mediabench benchmarks.
Applied Data Communications, 3rd edition
Authors: James E. Goldman, Phil Rawles
Venue:  (2000)

:In this practical guide, James Goldman shows you how to do data communications, rather than just read about it. With a unique "business-first, problem-solving" approach, he uses actual company cases to spotlight real networking issues and provide a forum for applying network analysis skills.
Interactive virtual gallery
Authors: Tomas Ullrich, Jiří Žára
Venue: Proceedings of the 18th spring conference on Computer graphics (2002)

Interactive virtual gallery is a project designed to help gallery visitors and to facilitate the work of gallery designers preparing art exhibitions and other displays.It gives gallery visitors the possibility to see exhibitions in virtual reality.It enables gallery designers to model a 3D gallery, to design an exhibition (to lay out exhibits) and to obtain some information needed for a real gallery construction.
An efficient two-staged approach for generating block layouts
Authors: Yi-Kuang Chen, Shih-Wei Lin, Shuo-Yan Chou
Venue: Computers and Operations Research (2002)

Multidimensional scaling (MDS) is a useful mathematical tool that enables the analysis of data in areas where organized concepts and underlying dimensions are not well developed. In this paper, MDS algorithms are used as a dimension reduction tool which arranges facilities in a two-dimensional space while preserving the adjacency relationship between facilities. The output of MDS is a scatter diagram and is in turn used as the input or location references for developing into the final block layout. The bay structures of layout are considered where the given floor space is first partitioned horizontally or vertically into bays, which are subsequently partitioned into the blocks. Rotating the scatter diagram about the origin results in different layouts in the bay structure. A simulated annealing approach is adopted to rotate the scatter diagram so that the total cost of traveling between facilities and shape violation in the final layout is minimized.
Enabling Ebusiness - Integrating Technologies Architectures and Applications, 1st edition
Authors: W. S. Whyte, Bill Whyte
Venue:  (2001)

:This book describes the technical architecture and components that can be integrated in order to provide a comprehensive and robust infrastructure on which to build successful e-Business. It is essential reading for technical and functional team leaders and strategists, who analyse the options, limitations and possibilities for new technology and place them alongside the business requirements. Whyte intends to broaden the knowledge of specialists in computing, telecommunications, internet and electronic business. He also introduces the underlying business and technical principals of e business and how they interrelate to the undergraduates and postgraduate level at technical business units. · Covers relevant and ever increasingly important issues such as security and business data processing. · Bridges the gap between the fundamentals and the broader business models of e-business · Detailed coverage of the functional architectures and technology · Includes the technologies and techniques of on-line customer service, support and maintenance The combination of both strategic and technical information in this text make it a valuable reference resource for telecommunication managers, e-business project leaders and final year and postgraduate students in computer science, electrical engineering and telecommunication courses and technical business units.
Efficient Nonparametric Density Estimation on the Sphere with Applications in Fluid Mechanics
Authors: Ömer Eugeciouglu, Ashok Srinivasan
Venue: SIAM Journal on Scientific Computing (2000)

The application of nonparametric probability density function estimation for the purpose of data analysis is well established. More recently, such methods have been applied to fluid flow calculations since the density of the fluid plays a crucial role in determining the flow. Furthermore, when the calculations involve directional or axial data, the domain of interest falls on the surface of the sphere. Accurate and fast estimation of probability density functions is crucial for these calculations since the density estimation is performed at each iteration during the computation. In particular the values fn (X1 ), fn (X2), ... , fn (Xn) of the density estimate at the sampled points Xi are needed to evolve the system. Usual nonparametric estimators make use of kernel functions to construct fn. We propose a special sequence of weight functions for nonparametric density estimation that is especially suitable for such applications. The resulting method has a computational advantage over kernel methods in certain situations and also parallelizes easily. Conditions for convergence turn out to be similar to those required for kernel-based methods. We also discuss experiments on different distributions and compare the computational efficiency of our method with kernel based estimators.
Functional and inclusion dependencies a graph theoretic approach
Authors: Stavros S. Cosmadakis, Paris C. Kanellakis
Venue: Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems (1984)

We present a new graph theoretic approach to the implication problem for functional (FD) and inclusion (IND) dependencies. Using this methodology we prove decidability for the case of typed IND's and acyclic FD's. We provide new lower bounds for the implication of typed, acyclic IND's and FD's --- NP-hardness and PSPACE-hardness for bounded domains. Finally, we show that there is no k-ary complete axiomatization for implication of FD's, even when we have pairwise consistency, i.e., all possible typed IND's hold.
Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
Authors: Marc Denecker, Victor Marek, Miroslaw Truszczyński
Venue: Logic-based artificial intelligence (2000)

In this paper we develop an algebraic framework for studying semantics of nonmonotonic logics. Our approach is formulated in the language of lattices, bilattices, operati
CCSA Exam Cram: Exam CP2000
Authors: Tony Piltzecker, Les Stovall
Venue:  (2001)

:This Exam Cram study guide covers one of the most rapidly growing certification programs in the industry-the CheckPoint Certified Security Administrator (CCSA) program, which requires candidates to pass the CCSA CP2000 exam. The book efficiently reviews key exam topics such as Firewall-1 system requirements and installation, various Firewall-1 configurations, GUI interface configuration and use, Network Address Translation rules, User Authentication, Encryption Schemes, Rule base efficiency, and the necessity of Network Address Translation. Includes proven features of the exclusive Exam Cram method of study with tips, tricks, and alerts, plus a special tear-out cram sheet and practice exam to provide all the necessary information and skills before taking the test.
Logic Synthesis and Verification Algorithms, 1st edition
Authors: Gary D. Hachtel, Fabio Somenzi
Venue:  (2000)

:Logic Synthesis and Verification Algorithms blends mathematical foundations and algorithmic developments with circuit design issues. Each new technique is presented in the context of its application to design. Through the study of optimal two-level and multilevel combinational circuit design, the reader is introduced to basic concepts, such as Boolean algebra, local search, and algebraic factorization. Similarly, through the study of optimal sequential circuit design, the reader is introduced to graph algorithms, finite state systems, and language theory. Throughout the book, recurrent themes such as branch and bound, dynamic programming, and symbolic implicit enumeration are used to establish optimal design principles. Circuit designers and CAD tool developers alike will find Logic Synthesis and Verification Algorithms useful as an introductory and reference text. The rich collection of examples and solved problems make this book ideal for self study. Because of its careful balance of theory and application, Logic Synthesis and Verification Algorithms will serve well as a textbook for upper division and first year graduate students in electrical and computer engineering.
A graphics operating system
Authors: Lawrence Koenigsberg, Jon A. Meads, John Shaw, Ned Thanhouser, Steven Vollum
Venue: ACM SIGGRAPH Computer Graphics (1975)

Stand alone graphic systems and time-shared graphics provide different benefits to a user. The same is true of refresh graphics and storage displays. An operating system is described which supports these combined modes through the integration of graphics into the operating system. Realization of the role of the system, generality, and flexibility were the major factors in the development of the system. The result is a computer graphic system providing high-level interactive graphics at a relatively low cost.