ppxscal/embedding_network huggingface dataset:
Inside Adobe PhotoShop 6 with CD-Rom
Authors: Gary David Bouton, Al Ward, Barbara Bouton, Jim Rich, Gary Kubicek, Mara Nathanson
Venue:  (2000)

:Gary's learning methodology is set up to give you hands-on experience with Photoshop's features, using either the imagery created in the book, or the your own. Gary grounds you in the most practical and useful aspects of Photoshop—the real-world uses of this powerful program—before delving into the more complex, arcane, or esoteric uses of the program. Each chapter includes a balance of textual discussion, hands-on exercises, and review material, all written in Gary's highly praised style: compelling to more advanced users while never patronizing to the less experienced. The CD-ROM includes all exercise files used in the book so that you can follow the author exactly, duplicating everything discussed and shown in the book. The CD will also include numerous texture maps and custom photo art for use at your discretion; as well as filters and utilities; along with a digital computer graphics glossary compiled by the author and laid out in Adobe Acrobat PDF format.
On the Accuracy of the Finite Volume Element Method Based on Piecewise Linear Polynomials
Authors: Richard E. Ewing, Tao Lin, Yanping Lin
Venue: SIAM Journal on Numerical Analysis (2001)

We present a general error estimation framework for a finite volume element (FVE) method based on linear polynomials for solving second-order elliptic boundary value problems. This framework treats the FVE method as a perturbation of the Galerkin finite element method and reveals that regularities in both the exact solution and the source term can affect the accuracy of FVE methods. In particular, the error estimates and counterexamples in this paper will confirm that the FVE method cannot have the standard O(h2) convergence rate in the L2 norm when the source term has the minimum regularity, only being in L2, even if the exact solution is in H2.
On the consistency problem in mobile distributed computing
Authors: Rachid Guerraoui, Corine Hari
Venue: Proceedings of the second ACM international workshop on Principles of mobile computing (2002)

This paper describes some preliminary steps towards defining a consistency criteria for mobile replicated systems using operational transformations. Our criterion lies between traditional strong criteria, preventing divergence, and traditional weak criteria, not enforcing any eventual form of convergence. We give a precise definition of our criterion and discuss its use to state the correctness and incorrectness of some existing practical algorithms.
After-Hours Trading Made Easy: Master the Risk and Reward of Extended-Hours Trading
Authors: Joe Duarte, Roland Burke
Venue:  (2000)

:Have you ever heard important stock news after the closing bell and wished you could buy or sell before the morning gap? Now you can. Using ECNs or an online broker that offers extended-hours access, you can trade stocks at night after the major markets have closed and in the morning before they open.Trading before or after the bell is a convenient option, but it can be risky without the right education. In After-Hours Trading Made Easy, market experts Joe Duarte and Roland Burke offer complete lessons in making extended-hours trading part of your investing or trading strategy, from getting started to reducing your risk. Inside, you'll discover how to: Understand the commissions and costs of after-hours trading Choose the right online broker for you Use different ECNs to maximize your advantage Find up-to-the-minute order-flow information on the Internet And much more!Numerous easy-to-use graphs, charts, and online resources make this book the ultimate guide to trading confidently and successfully after hours."Clear, precise, and to the point. This book provides traders and investors with a solid foundation for trading after hours." John Murphy, president, MurphyMorris.com"A must-read before you make that first pre- or post-market trade." Mark Seleznov, managing partner, Trend Trader LLC"If you're going to start trading after hours, START here!" J. Michael Pinson, founder and senior analyst, MarketMavens.com
Generating Bracelets in Constant Amortized Time
Authors: Joe Sawada
Venue: SIAM Journal on Computing (2002)

A bracelet is the lexicographically smallest element in an equivalence class of strings under string rotation and reversal. We present a fast, simple, recursive algorithm for generating (i.e., listing) k-ary bracelets. Using simple bounding techniques, we prove that the algorithm is optimal in the sense that the running time is proportional to the number of bracelets produced. This is an improvement by a factor of n (where n is the length of the bracelets being generated) over the fastest, previously known algorithm to generate bracelets.
Generating finite state machines from abstract state machines
Authors: Wolfgang Grieskamp, Yuri Gurevich, Wolfram Schulte, Margus Veanes
Venue: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis (2002)

We give an algorithm that derives a finite state machine (FSM) from a given abstract state machine (ASM) specification. This allows us to integrate ASM specs with the existing tools for test case generation from FSMs. ASM specs are executable but have typically too many, often infinitely many states. We group ASM states into finitely many hyperstates which are the nodes of the FSM. The links of the FSM are induced by the ASM state transitions.
Variance Reduction Methods for Simulation of Densities on Wiener Space
Authors: Arturo Kohatsu-Higa, Roger Pettersson
Venue: SIAM Journal on Numerical Analysis (2002)

We develop a general error analysis framework for the Monte Carlo simulation of densities for functionals in Wiener space. We also study variance reduction methods with the help of Malliavin derivatives. For this, we give some general heuristic principles which are applied to diffusion processes. A comparison with kernel density estimates is made.
Constrained frequent pattern mining: a pattern-growth view
Authors: Jian Pei, Jiawei Han
Venue: ACM SIGKDD Explorations Newsletter (2002)

It has been well recognized that frequent pattern mining plays an essential role in many important data mining tasks. However, frequent pattern mining often generates a very large number of patterns and rules, which reduces not only the efficiency but also the effectiveness of mining. Recent work has highlighted the importance of the constraint-based mining paradigm in the context of mining frequent itemsets, associations, correlations, sequential patterns, and many other interesting patterns in large databases.Recently, we developed efficient pattern-growth methods for frequent pattern mining. Interestingly, pattern-growth methods are not only efficient but also effective in mining with various constraints. Many tough constraints which cannot be handled by previous methods can be pushed deep into the pattern-growth mining process. In this paper, we overview the principles of pattern-growth methods for constrained frequent pattern mining and sequential pattern mining. Moreover, we explore the power of pattern-growth methods towards mining with tough constraints and highlight some interesting open problems.
Clsc Exam Certification Guide with Cdrom
Authors: Kevin Downes, Tim Boyles
Venue:  (1999)

:CLSC Exam Certification Guide is a comprehensive preparation tool for the CLSC exam (#640-404) and Foundation Routing and Switching exam (#640-409). Coverage of all CLSC exam objectives ensures readers will arrive at a complete understanding of the exam topics. This title reviews the main features of the Catalyst family of switches and the placement, configuration, and troubleshooting of switched LAN networks. Chapters in this book follow a logical organization of the CLSC exam objectives, and readers can streamline their preparation through the assessment and review features in each chapter. In-depth scenarios provide a battery of challenging questions, and the accompanying CD allows readers to build random practice exams or to study with flash cards. CLSC Exam Certification Guide pulls together the breadth of exam material, enabling readers to achieve mastery of exam objectives.
Effective Knowledge Management: A Best Practice Blueprint
Authors: Sultan Kermally
Venue:  (2002)

:Knowledge Management (KM) remains high on the critical business agenda. Using the proven CBI Fast Track blueprint format, this book explains sin simple and concise terms how you and your company can understand the critical issues of KM, create the right culture and conditions for effective knowledge transfer, incorporate technologies into your long-term KM strategy and accurately measure the benefits KM brings. Sultan Kermally is a highly-experienced practitioner who offers a clear, hands-on approach to a difficult-to-master topic. 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
Surviving Security: How to Integrate People, Process and Technology
Authors: Mandy Andress, Amanda Andress
Venue:  (2001)

:Surviving Security is your guide to formulating a security strategy that fits your company's business and budget needs. Network and information security is no longer optional in today's connected business environment, but finding the right combination of technology and processes for your needs can be an overwhelming and frustrating process. This book is an essential tool for network managers and administrators who need to implement a security infrastructure, understand how different security technologies work together, develop or revise security processes, make purchasing decisions, or hire a security consultant or outsourcing firm.
Optimal annealing schedules for a modified Tsallis statistics
Authors: Astrid Franz, Karl Heinz Hoffmann
Venue: Journal of Computational Physics (2002)

In this paper, for a number of example systems, optimal schedules for simulated annealing with a modified Tsallis statistics for various parameters q are analyzed. It turns out that in general depending on the objective function (minimizing the mean energy or maximizing the ground state probability), different schedules have to be chosen. Furthermore, the optimal objective function value, reached with the optimal schedule, shows a monotonic dependency on q, where better values are reached for smaller q. Thus, in stochastic optimization the limit case q &#x2192; -&#x221E; corresponding to threshold accepting should be chosen in order to get the best possible optimization results with as little effort as possible.
Fourth Order Chebyshev Methods with Recurrence Relation
Authors: Assyr Abdulle
Venue: SIAM Journal on Scientific Computing (2001)

In this paper, a new family of fourth order Chebyshev methods (also called stabilized methods) is constructed. These methods possess nearly optimal stability regions along the negative real axis and a three-term recurrence relation. The stability properties and the high order make them suitable for large stiff problems, often space discretization of parabolic PDEs. A new code ROCK4 is proposed, illustrated at several examples, and compared to existing programs.
On the greatest common right divisor of Ore polynomials with polynomial coefficients which depend on a parameter
Authors: Peter E. Glotov
Venue: ACM SIGSAM Bulletin (1998)

The problem of search for the dependence of GCD of algebraic parametrized objects on a parameter appears in some algorithms of computer algebra. In the case of usual polynomials such problem appears in solving systems of algebraic equations by the elimination method and in some others described in [1]. In the case of rings of polynomials which describe the rings of differential and difference operators such problem appears in solving differential equations in the terms of sparse power series [2]. So it makes interesting to consider this problem from the point of view of Ore polynomial rings which generalize the examples above. For the search for the GCRD of two Ore polynomials it was developed the fast modular algoritm [4]. If we need to determine the depedence of the GCRD on a parameter the next algorithm can be applied: find all the values of a parameter for which the resultant is zero and find the set of GCRDs of polynomials with substituting the parameter by such values. Here we present more efficient non-modular algorithm based on subresultant theory of Ore polynomials [4] which allows to determine the dependence of GCRD on a parameter. 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
Univariate adaptive thinning
Authors: Nira Dyn, Michael S. Floater, Armin Iske
Venue: Mathematical Methods for Curves and Surfaces: Oslo 2000 (2001)

In this paper we approximate large sets of univariate data by piecewise linear functions which interpolate subsets of the data, using adaptive thinning strategies. Rather than minimize the global error at each removal (AT0), we propose a much cheaper thinning strategy (AT1) which only minimizes errors locally. Interestingly, the two strategies are equivalent in all our numerical tests and we prove this to be true for convex data. We also compare with non-adaptive thinning strategies.
Algorithms for Capacitated Vehicle Routing
Authors: Moses Charikar, Samir Khuller, Balaji Raghavachari
Venue: SIAM Journal on Computing (2002)

Given n identical objects (pegs), placed at arbitrary initial locations, we consider the problem of transporting them efficiently to n target locations (slots) with a vehicle that can carry at most k pegs at a time. This problem is referred to as k-delivery TSP, and it is a generalization of the traveling salesman problem. We give a 5-approximation algorithm for the problem of minimizing the total distance traveled by the vehicle.There are two kinds of transportations possible---one that could drop pegs at intermediate locations and pick them up later in the route for delivery (preemptive) and one that transports pegs to their targets directly (nonpreemptive). In the former case, by exploiting the freedom to drop, one may be able to find a shorter delivery route. We construct a nonpreemptive tour that is within a factor 5 of the optimal preemptive tour. In addition we show that the ratio of the distances traveled by an optimal nonpreemptive tour versus a preemptive tour is bounded by 4.
Programming for the Java Virtual Machine with Cdrom, 1st edition
Authors: Joshua Engel, Engel. Joshua
Venue:  (1999)

:The author employs a tutorial approach that provides a detailed look into the central workings of the technology and teaches the reader how to write real programs for the Java virtual machine. He describes methods to becoming a better programmer through an advanced understanding of the Java virtual machine and Java technology. Programming for the Java Virtual Machine offers comprehensive coverage of all the major elements of the Java virtual machine - classes and objects, control instructions, debugging, class loaders, compiling the Java programming language, performance issues, security, and threads and synchronization.
Sams Teach Yourself Sap R/3 in 10 Minutes, 1st edition
Authors: Simon Sharpe, Bryan Gambrel
Venue:  (1999)

:Sams Teach Yourself SAP R/3 in 10 Minutes covers general tasks including basic navigation skills, working with master data and running reports. With Timesaving Tips, Plain English definitions, Panic Button advice and easy-to-follow tutorials that can be completed in 10 minutes or less, you can get productive immediately. Covers the general SAP functions that every end-user of SAP-based applications must know. The book focuses on the user interface, access issues, and basic navigation skills using mini-tutorials. You'll learn all the essential tasks for running SAP-based applications smoothly and easily. 10 minutes is all you need to learn how to log on to SAP R/3, access the SAP R/3 modules, use basic navigation skills, work with master data, generate reports, read and interpret common error messages, and access extensive online help features.
Applied Robotics
Authors: Edwin Wise
Venue:  (1999)

:A hands-on introduction to the field of robotics, this book will guide the hobbyist through the issues and challenges of building a working robot. Each chapter builds upon the previous one, extending a core robot project throughout the book. Examples of chapters include: Mechanical Platforms, Power Supplies, Adding Sense, Microcontrollers, Insect Robots, Pneumatics, More Behavior and Intelligence, Programming Projects, Robot Behaviors, and much more.
Database Systems: A Practical Approach to Design, Implementation and Management 2nd Ed., 2nd edition
Authors: Thomas Connolly, Carolyn E. Begg
Venue:  (1998)

:Database Systems, Second Edition provides a strong foundation in good design practice. Using an accessible, step-by-step approach, students will master a database methodology. Then, the authors apply this methodology to worked examples so students learn to design and build applications using a leading commercial database system. Also, a central, realistic case study is integrated throughout the text to provide an understanding of the issues involved. This new edition will build on the clear, accessible presentation of the successful first edition. New to the Second Edition Includes additional and simplified examples. Features new material on distributed databases including interactions with web-based data. Contains new material on object-oriented databases that covers the latest ODBM standards. Illustrates concepts with screen shots from Accesso. Offers new coverage of query processing and optimization, data mining, data warehouses, multimedia databases, and the Internet.
Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
Authors: A. R. Conn, N. Gould, A. Sartenaer, Ph. L. Toint
Venue: SIAM Journal on Optimization (1996)

We consider the global and local convergence properties of a class of augmented Lagrangian methods for solving nonlinear programming problems. In these methods, linear and more general constraints are handled in different ways. The general constraints are combined with the objective function in an augmented Lagrangian. The iteration consists of solving a sequence of subproblems; in each subproblem the augmented Lagrangian is approximately minimized in the region defined by the linear constraints. A subproblem is terminated as soon as a stopping condition is satisfied. The stopping rules that we consider here encompass practical tests used in several existing packages for linearly constrained optimization. Our algorithm also allows different penalty parameters to be associated with disjoint subsets of the general constraints. In this paper, we analyze the convergence of the sequence of iterates generated by such an algorithm and prove global and fast linear convergence as well as show that potentially troublesome penalty parameters remain bounded away from zero.
Linear-Quadratic Control: An Introduction
Authors: Peter Dorato, Vito Cerone, Chaouki Abdallah
Venue:  (1994)

:The purpose of this book is to provide an introduction to linear quadratic theory beyond the typical chapter on the subject found in texts on optimal or multivariable control. Of course, as an introductory text, the material here is not as detailed as that found in advanced books devoted exclusively to the subject.
Microsoft Office 97 at a Glance: Updated Edition, 2nd edition
Authors: Perspection Inc, Microsoft Corporation
Venue:  (1998)

:Here's the visual way to get to work quickly using the powerful applications in Office 97--now updated to include Microsoft OutlookTM 98. Microsoft Office 97 At a Glance, Updated Edition, lets you focus on a particular task and shows you, with clear, numbered steps, the easiest way to get it done. Experience Level: Beginner/ Intermediate
Digital Principles and Applications, 5th edition
Authors: Donald P. Leach, Albert P. Malvino
Venue:  (1994)

:The fifth edition of Digital Principles and Applications is completely reorganized . It is written for the individual who wishes to learn the principles of digital circuits and then apply them to useful, meaningful designs. The material in this book is appropriate for an introductory course in digital logic in either a computer or an electronics program. It is also appropriate for 'self-study' and as a 'reference' for individuals working in the field.
Improved Schemes for Visual Cryptography
Authors: Carlo Blundo, Annalisa De Bonis, Alfredo De Santis
Venue: Designs, Codes and Cryptography (2001)

A (k,n)-threshold visual cryptography scheme ((k,n)-threshold VCS, for short) is a method to encode a secret image SI into n shadow images called shares such that any k or more shares enable the &ldquo;visual&rdquo; recovery of the secret image, but by inspecting less than k shares one cannot gain any information on the secret image. The &ldquo;visual&rdquo; recovery consists of xeroxing the shares onto transparencies, and then stacking them. Any k shares will reveal the secret image without any cryptographic computation.In this paper we analyze visual cryptography schemes in which the reconstruction of black pixels is perfect, that is, all the subpixels associated to a black pixel are black. For any value of k and n, where 2\leq k\leq n, we give a construction for (k,n)-threshold VCS which improves on the best previously known constructions with respect to the pixel expansion (i.e., the number of subpixels each pixel of the original image is encoded into). We also provide a construction for coloured (2,n)-threshold VCS and for coloured (n,n)-threshold VCS. Both constructions improve on the best previously known constructions with respect to the pixel expansion.
Range-Image segmentation and model reconstruction based on a fit-and-merge strategy
Authors: M. Djebali, M. Melkemi, N. Sapidis
Venue: Proceedings of the seventh ACM symposium on Solid modeling and applications (2002)

A segmentation and model-reconstruction algorithm is proposed based on polynomial approximation and on a novel version of "region growing". First, an initial partition is calculated on the basis of differential-geometric properties of the range image. Then, the first merging procedure is applied ("merge with constraints") aiming at correctly identifying principal surfaces of the model. It examines all possible mergers of regions and selects those satisfying strict compatibility constraints. The second merging procedure relaxes these constraints to produce the final segmentation. Theoretical work is presented proving the consistency of these merging procedures. Finally, application of the algorithm on industrial data is presented demonstrating the efficiency of the proposed methodology.