ppxscal/embedding_network huggingface dataset:
Semi-join algorithms for multiprocessor systems
Authors: Patrick Valduriez
Venue: Proceedings of the 1982 ACM SIGMOD international conference on Management of data (1982)

Semi-join is a relational operator that decreases the cost of processing queries involving binary operations. This is accomplished by initially selecting the data relevant to answer the queries and thereby reducing the size of the operand relations. This paper presents and analyzes algorithms for computing semi-joins in a multiprocessor database machine. First, an architecture model of a multiprocessor system is described. The model incorporates 1-0, CPU and messages transmission cost parameters to enable the evaluation of these algorithms in terms of their execution costs. Then two equi-semi-join algorithms are presented and compared and one inequi-semi-join algorithm is proposed. The execution cost of these algorithms are generally lineary proportional to the size of the operand and result relations and inversely proportional to the number of processors. Then, the method by joining two relations and the method by joining their semi-joins are compared. Finally it is shown that the method using semi-joins is generally better.
cc: Mail 8.2
Authors: Scott L. Warner, Jane Calbria
Venue:  (1998)

:10 minutes is all you need to learn how to: log in to your cc:Mail post office, set up user profiles, read and reply to messages, organize and manage messages, send and receive file attachments, create rules for how messages are handled, use bulletin boards and forms to communicate with groups, and use cc:Mail on the Web.
Collocation and Relaxed Collocation for the Fer and the Magnus Expansions
Authors: A. Zanna
Venue: SIAM Journal on Numerical Analysis (1999)

We consider the Fer and the Magnus expansions for the numerical solution of the nonlinear matrix Lie-group ODE $y' = \gamma(t,y) y$, $y(0)= y_0,$ where y evolves in a matrix Lie group G and $\gamma(t,y)$ is in the Lie algebra %$\hbox{\Fr{g}}$. $\ghe$. Departing from a geometrical approach that distinguishes between those operations performed in the group and those performed in the tangent space, we construct Lie-group invariant methods based on collocation. We prove that, as long as the two expansions are correctly truncated, the collocation nodes $c_1, c_2, \ldots, c_{\nu}$ yield numerical methods whose order is the same as in the classical setting. We also relax the collocation conditions, thereby devising explicit methods of order 3. To conclude, we discuss the proposed methods in a numerical experiment that arises in Hamiltonian mechanics, comparing the results with projection techniques.
Business Object Design and Implementation II: Oopsla'96, Oopsla'97 and Oopsla'98 Workshop Proceedings, 1st edition
Authors: B. Preneel, J. Hartmanis, G. Goos, J. Van Leeuwen, V. Rijmen
Venue:  (1998)

:Business Object Design and Implementation II contains selected papers from Business Object Design and Implementation Workshops, which were held at the last three OOPSLA conferences. The book emphasises the evolution of business objects from many perspectives, including modelling, implementation, standards, and applications.
An Asymptotical $O(\sqrtnL)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
Authors: Pi-Fang Hung, Yinyu Ye
Venue: SIAM Journal on Optimization (1996)

Path-following linear programming (LP) algorithms generate a sequence of points within certain neighborhoods of a central path ${\cal C}$ which prevent iterates from prematurely getting too close to the boundary of the feasible region. Depending on the norm used, these neighborhoods include ${\cal N}_2(\beta)$, ${\cal N}_{\infty}(\beta)$, and ${\cal N}^-_{\infty}(\beta)$, where $\beta\in (0,1)$ and \[ {\cal C}\subset {\cal N}_2(\beta)\subset {\cal N}_{\infty}(\beta)\subset {\cal N}^-_{\infty}(\beta)\quad\mbox{for each}\quad \beta\in (0,1). \] A paradox is that among all existing (infeasible or feasible) path-following algorithms, the theoretical iteration complexity, $O(\sqrt{n}L)$, of small-neighborhood (${\cal N}_2$) algorithms is significantly better than the complexity, $O(nL)$, of wide-neighborhood (${\cal N}^-_{\infty}$) algorithms. In practice, wide-neighborhood algorithms outperform small-neighborhood ones by a big margin. Here, $n$ is the number of LP variables and $L$ is the LP data length. In this paper, we present an $O(n^{\frac{n+1}{2n}}L)$-iteration (infeasible) primal-dual high-order algorithm that uses wide neighborhoods. Note that this iteration bound is asymptotically $O(\sqrt{n}L)$, i.e., the best bound for small-neighborhood algorithms, as $n$ increases.
The 8088 and 8086 Microprocessors: Programming, Interfacing, Software, Hardware, and Applications: Including the 80286, 80386, 80486, and the Pentium, 3rd edition
Authors: Walter A. Triebel, Avtar Singh
Venue:  (1999)

:This widely used text provides a systems-level understanding of the hardware and software architecture of the Intel 80x86 family of microprocessors. The book is divided into three parts: Part I explores the software architecture of the 8088 and 8086 microprocessors and teaches readers how to write, execute, and debug assembly language programs. Part II examines the hardware architecture of microprocessors in the 80x86 family: the 80286, 80386, 80486, and Pentium Processors. Part III provides detailed coverage of other microprocessors in the 80x86 family: the 80286, 80386, 80486, and Pentium Processors.
Premiere 5.1 for Macintosh and Windows: Visual QuickStart Guide, 1st edition
Authors: Anthony Bolante, Antony Bolante
Venue:  (1999)

:Adobe Premiere 5.1 permits users to produce high quality movies for video, film, multimedia, and the Web. Version 5.1 is loaded with new features and integrates smoothly with Adobe Photoshop, Adobe After Effects, and Adobe Illustrator. New features include 21 professional audio filters, the option of importing and editing QuickTime files directly within Premiere, and a host of other new performance features that provide greater control for professional video editing. Premiere 5.1 for Windows and Macintosh: Visual QuickStart Guide contains clear, concise directions to editing short and long format movies for video, multimedia, and the Web. It1s a great guide for the beginner new to Premiere, the professional upgrading to the latest version of the software, or for Web developers creating audio and video files for the Web. Step-by-step guide to desktop video editing Create professional special effects quickly, and edit more precisely, using the proven visual approach to learning new software
Web Wizard's Guide to Shockwave
Authors: James G. Lengel
Venue:  (2002)

:This book shows readers with limited previous Web programming experience how to quickly create interactive content for their Web sites using Shockwave. This book requires no previous programming experience. It provides realistic full-color screen shots and code examples. Shows how to prepare text, images, sound, and video files for inclusion in a Shockwave project. Provides a hands-on tutorial on building a Shockwave project. Takes readers through the process of planning and building a multimedia Web experience.This book is designed for readers with limited programming skills who want to learn to use Shockwave; as well as students taking a Web design course where Shockwave is used.
Pursuit Differential Games with State Constraints
Authors: Pierre Cardaliaguet, Marc Quincampoix, Patrick Saint-Pierre
Venue: SIAM Journal on Control and Optimization (2000)

We prove the existence of a value for pursuit games with state constraints. We also prove that this value is lower semicontinuous.
Trident: a scalable architecture for scalar, vector, and matrix operations
Authors: Mostafa I. Soliman, Stanislav G. Sedukhin
Venue: Proceedings of the seventh Asia-Pacific conference on Computer systems architecture (2002)

Within a few years it will be possible to integrate a billion transistors on a single chip. At this integration level, we propose using a high level ISA to express parallelism to hardware instead of using a huge transistor budget to dynamically extract it. Since the fundamental data structures for a wide variety of applications are scalar, vector, and matrix, our proposed Trident processor extends the classical vector ISA with matrix operations. The Trident processor consists of a set of parallel vector pipelines (PVPs) combined with a fast in order scalar core. The PVPs can access both vector and matrix register files to perform vector, matrix, and matrix-vector operations. One key point of our design is the exploitation of up to three levels of data parallelism. Another key point is the ring register files for storing vector and matrix data. The ring structure of the register files reduces the number and size of the address decoders, the number of ports, the area overhead caused by the address bus, and the number of registers attached to bit lines, as well as providing local communication between PVPs. The scalability of the Trident processor does not require more fetch, decode, or issue bandwidth, but requires replication of PVPs and increasing the register file size. Scientific, engineering, multimedia, and many other applications, which are based on a mixture of scalar, vector, and matrix operations, can be speeded up on the Trident processor.
Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching
Authors: Yoav Zibin, Joseph Yossi Gil
Venue: Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2002)

The dispatching problem can be solved very efficiently in the single-inheritance~(SI) setting. In this paper we show how to extend one such solution to the multiple-inheritance~(MI) setting. This generalization comes with an increase to the space requirement by a small factor of &kappa; This factor can be thought of as a metric of the complexity of the topology of the inheritance hierarchy.On a data set of~35 hierarchies totaling some~64 thousand types, our dispatching data structure, based on a novel type slicing technique, exhibits very significant improvements over previous dispatching techniques, not only in terms of the time for creating the underlying data structure, but also in terms of total space used.The cost is in the dispatching time, which is no longer constant, but doubly logarithmic in the number of types. Conversely, by using a simple binary search, dispatching time is logarithmic in the number of different implementations. In practice dispatching uses one indirect branch and, on average, only~2.5 binary branches.Our results also have applications to the space-efficient implementation of the more general problem of dispatching multi-methods.A by-product of our type slicing technique is an incremental algorithm for constant-time subtyping tests with favorable memory requirements. (The incremental version of the subtyping problem is to maintain the subtyping data structure in presence of additions of types to the inheritance hierarchy.)
Mike Meyers' Mcsa Managing a Windows 2000 Network Environment Passport (Exam 70-218) with Cdrom
Authors: Walter J. Glenn
Venue:  (2002)

:Mike Meyers, the industry expert on professional certification, brings you this concise, affordable, and portable study tool for the new MCSA certification exam. With an intensive focus on only what you need to know to pass exam 70-218 plus practice exam software on CD, this Certification Passport is your ticket to success on exam day.
Proceedings of the 2nd international symposium on Smart graphics
Venue: ACM International Conference Proceeding Series; Vol. 24 (2002)

Welcome to the International Symposium on Smart Graphics! It will bring together people from the fields of Computer Graphics, Graphics Design, Cognitive Psychology and Artificial Intelligence, all working on different aspects of computer generated graphics. After a very successful AAAI Spring Symposium on Smart Graphics in 2000 the organizing committee decided to turn the event into a self-contained symposium. Last year's event (Smart Graphics 2001) attracted our target of 30 attendees. This was despite an unfortunate clash with the ACM I3DG conference. This year we aim to increase the number of attendees without creating a "conference" atmosphere, the number of attendees will be capped at 50. Seeing the Smart Graphics initiative taking off so dynamically, we are expecting a great number of varied and interdisciplinary submissions, and we are looking forward to the 2002 symposium, which is generously hosted by the IBM T.J. Watson Research Center.Advances and breakthroughs in the area of Computer Graphics have made visual media a major ingredient of the modern user interface, and it is likely that graphics will play a dominant role in the way people communicate and interact with computers in the future. Especially the evolution of computing towards more and more pervasive and distributed devices pose new and challenging problems for the effective use of graphics. We believe that intelligent behavior and graphics will provide the technical core of next generation interfaces. But in order to make those interfaces successful, principles and findings from Cognitive Psychology and Graphics Design are equally important to reflect the user's needs and abilities.Until recently there has been very little overlap between the Cognitive Psychology, Computer Graphics, AI and Graphics Design communities. The Smart Graphics Symposium intends to close these gaps. Recent advances in Computer Graphics have allowed AI researchers to integrate graphics in their systems (without being burdened by low-level issues such as image rendering) and graphics acceleration hardware has become affordable and is now available for a broad range of platforms. On the other hand, many AI techniques have matured to the point of being usable by non specialists. Furthermore, these very techniques are likely to be the vehicle by which both principles from Graphics Design and the results of research in cognitive aspects of visual representations, will be integrated in next generation graphical interfaces.
Structure-Preserving Methods for Computing Eigenpairs of Large Sparse Skew-Hamiltonian/Hamiltonian Pencils
Authors: Volker Mehrmann, David Watkins
Venue: SIAM Journal on Scientific Computing (2000)

We study large, sparse generalized eigenvalue problems for matrix pencils, where one of the matrices is Hamiltonian and the other is skew-Hamiltonian. Problems of this form arise in the numerical simulation of elastic deformation of anisotropic materials, in structural mechanics, and in the linear quadratic control problem for partial differential equations. We develop a structure-preserving skew-Hamiltonian, isotropic, implicitly restarted shift-and-invert Arnoldi algorithm (SHIRA). Several numerical examples demonstrate the superiority of SHIRA over a competing unstructured method.
The Professional Paranoid: How to Fight Back If Stalked, Surveilled, Investigated, or Targeted by Any Agency, Organization, or Individual
Authors: H. Michael Sweeney
Venue:  (1998)

:The horror stories revealed during last year's testimony from hundreds of citizens targeted by vigilante Internal Revenue Service agents reveal a frightening reality of modern America -- everyone is vulnerable to zealous organizations and individuals. For many people, fear of harassment comes not from government agencies but from harder-to-trace entities such as religious cults, criminals, private detectives, and sociopathic stalkers. As a complement to Gavin de Becher's recent bestseller The Gift of Fear, security specialist H. Michael Sweeney provides both psychological and technical advice on dealing with a variety of harassers, casting his net more widely than other competing titles by including the "good guys" -- cops, federal agencies, and corporate bullies -- as well as the bad guys usually associated with systematic harassment. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Tests of a simulation method for Boltzmann-like models with chemical reactions
Authors: Dorin Marinescu, Aude Espesset, Cecil P. Grünfeld
Venue: Journal of Computational Physics (2002)

This paper reports on the numerical implementation of a convergent scheme solving a general class of nonlinear Boltzmann-like equations for reacting fluids. The scheme is tested on a model of space-homogeneous multicomponent gas with binary chemical reactions. Although the model cannot be solved exactly, it provides analytical expressions for certain low-order moments of the one-particle distribution functions. Computing these moments by applying the numerical scheme, one obtains a good agreement with the values obtained analytically. An error analysis is performed and error control considerations complete the theoretical support of the scheme developed in previous works.
PC Interfacing Pocket Reference
Authors: Myke Predko, Michael Predko
Venue:  (2002)

:The ultimate data finder for PC hardware and software engineers. The PC interface methods you need -- and only the PC interface methods you need -- in a format you can use. That's what the PC Interfacing Pocket Reference delivers. Compact and complete, and featuring formulas, tables, and diagrams in place of lengthy text descriptions, this essential reference companion to Predko's PC Ph.D.: Inside PC Interfacing is full of job-simplifying answers that you can flip to in 60 seconds or less. Includes coverage of: 80/20 data/text ratioASCII tables, memory addresses, instruction sets, BIOSs, MS-DOS, DPMI, and Windows APIsApplication-building sample codeWindows hardware interfacing development tools with codeSample device drivers (VxDs, WDMs, and DLLs)ISA, PCI, and USB bus informationPnP, interrupt, and DMA interfacingDevice block diagrams with connector pinoutsPC/9x baseline to ensure currency of informationQuick references for PC Assembly, Basic, C, and C++ languages.
Peachtree for College Accounting: A Practical Approach, 7th edition
Authors: Errol F. Osteraa, Errol Esterraa
Venue:  (1998)

:This project was developed in response to employers' demand for employees who know how to use Peachtree, a commercial accounting software package used by many well-known companies, before they are hired. The package was designed to accompany any college accounting book and shows readers how to implement the manual accounting procedures they learn in their main book in a computerized environment using Peachtree Accounting for Windows Release 4.0 software. A brief explanation clearly and concisely explains to students/readers each function of the software. Geared for readers mainly in the field of Accounting Information Systems or Computerized Accounting.
Data Analysis with SPSS, 2nd edition
Authors: Stephen A. Sweet, Karen Grace-Martin
Venue:  (2002)

:According to Labor Secretary, Robert Reich, the most successful workers in the 21st century will be those who are able to understand various forms of information and produce meaning from it. Reich calls these people symbolic analysts, and they often use statistics. Yet, many individuals find statistics alienating, boring, intimidating, or as simply another hurdle to get over. Contrary to popular belief, though, quantitative research can be fun. This book is designed to help readers develop an appreciation, and hopefully an excitement, for quantitative inquiry. This book first orients readers to the approach researchers use to frame research questions and to the logic of establishing causal relations. Thereafter, the SPSS program is introduced. Readers are guided through examining data sets, univariate analysis, bivariate analysis, graphic analysis, and multivariate analysis. Two large data sets are included with the book. Anyone using SPSS, the statistics program for social science research.
Running Microsoft PowerPoint 2000, 1st edition
Authors: Stephen W. Sagman, Stephen Wallace
Venue:  (1999)

:Loaded with tips from the software experts on how to get the most from Microsoft PowerPoint 2000 presentation graphics program, this book shows users each step needed to accomplish their objectives.
Cellular Radio Performance Engineering, 1st edition
Authors: Asha K. Mehrotra
Venue:  (1994)

:This authoritative book focuses on the vital aspects of cellular radio system modeling and performance analysis. Providing a solid mathematical background in cellular system modeling and characterization, it presents an extensive discussion on the process of impressing information on the radio signal in the transmitter  and also how to subsequently recover that information from the network.
CDMA Techniques for Third Generation Mobile Systems
Authors: Francis Swarts, Michiel P. Lotter, Pieter van Rooyen
Venue:  (1998)

:CDMA Techniques for Third Generation Mobile Systems presents advanced techniques for analyzing and developing third generation mobile telecommunication systems. Coverage includes analysis of CDMA based systems, multi-user receivers, Turbo coding for mobile radio applications, spatial and temporal processing techniques as well as software radio techniques. Special emphasis has been given to recent advances in coding techniques, smart antenna systems, spatial filtering, and software implementation issues. CDMA Techniques for Third Generation Mobile Systems is an invaluable reference work for engineers and researchers involved in the development of specific CDMA systems.
Genetic Programming III: Darwinian Invention & Problem Solving, 1st edition
Authors: John R. Koza, David Andre, Forrest H. Bennett, Martin A. Keane
Venue:  (1999)

:Genetic programming (GP) is a method for getting a computer to solve a problem by telling it what needs to be done instead of how to do it. Koza, Bennett, Andre, and Keane present genetically evolved solutions to dozens of problems of design, control, classification, system identification, and computational molecular biology. Among the solutions are 14 results competitive with human-produced results, including 10 rediscoveries of previously patented inventions.
Learning Sets in State Dependent Signalling Game Forms: A Characterization
Authors: Jérôme Renault
Venue: Mathematics of Operations Research (2001)

We consider repeated game forms with incomplete information and state dependent signalling structure. We study the information a player can learn about the state of nature through a communication procedure, in a way robust to unilateral deviations. More precisely, we say that playeri can distinguish state ? from state ?' if there exists a strategy profile such that if ? is the true state and at most one player deviates from the profile, then playeri will know after a finite number of stages that ?' is not the true state. The learning set of playeri at ? is the set of states that playeri cannot distinguish from ?. It corresponds to the information playeri can learn, in a way immune against unilateral deviations, if the state is ? and players communicate through the game form for a finite number of stages. This notion was introduced in a joint paper with T. Tomala (Renault and Tomala 2000). We provide here a general characterization of the learning sets.