ppxscal/embedding_network huggingface dataset:
The E-Business WorkPlace: Discovering the Power of Enterprise Portals
Authors: Matthias Vering, Pricewaterhousecoopers Llp
Venue:  (2001)

:Make The E-Business Workplace Work For You From the consultants at PricewaterhouseCoopers and SAP come the keys to understanding and taking advantage of the most exciting development in the world of business technologythe e-business workplace. Written in language that is accessible to all executives and managers, in any company and industrynot just to information technology professionalsthe authors explain how this user-oriented, people-friendly technology can transform your organization by empowering collaboration among its employees and value network partners. Here are answers to such critical questions as: *How can you use workplace technology to move from integration to true collaboration?*What are the advantages of a truly people-friendly technology?*Does workplace technology add value?*How are roles different from jobs, and how does the e-business workplace use roles to help people perform their jobs more effectively and efficiently?*What are the components of workplace technology software, and how do you choose a product best suited to your organization?*Can the e-business workplace help your organization manage change?*Where does workplace technology fit within the broader e-business context?*Can the e-business workplace help your organization achieve its vision?In answering these questions, the authors support their conclusions with numerous real-world examples that move the theory behind workplace technology into practice. The E-Business Workplace also provides insights and knowledge found nowhere else, based on the thousands of technology implementations in which they and their organizations have been integrally involved. Take this opportunity to learn about acritically important technology that may be the defining factor in determining success and failure in an increasingly complex Internet-enabled economy.
Algorithms in Java, Third Edition, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching, 3rd edition
Authors: Robert Sedgewick, Michael Schidlowsky
Venue:  (1998)

:For the first time, Robert Sedgewick's popular textbook on algorithms and data structures is available in a Java version. Tim Lindholm (co-author of The Java Virtual Machine Specification) and Sedgewick have developed new Java implementations that both express the presented methods in a concise and direct manner, and also provide students with the practical means to test them on real applications. This particular book, Parts 1-4, represents a substantial update.
Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure
Authors: Monique Laurent
Venue: SIAM Journal on Optimization (2002)

We study how the lift-and-project method introduced by Lovász and Schrijver [SIAM J. Optim., 1 (1991), pp. 166--190] applies to the cut polytope. We show that the cut polytope of a graph can be found in k iterations if there exist k edges whose contraction produces a graph with no K5-minor. Therefore, for a graph G with $n\ge 4$ nodes with stability number $\alpha(G)$, n-4 iterations suffice instead of the m (number of edges) iterations required in general and, under some assumption, $n-\alpha(G)-3$ iterations suffice. The exact number of needed iterations is determined for small $n\le 7$ by a detailed analysis of the new relaxations. If positive semidefiniteness is added to the construction, then one finds in one iteration a relaxation of the cut polytope which is tighter than its basic semidefinite relaxation and than another one introduced recently by Anjos and Wolkowicz [Discrete Appl. Math., to appear]. We also show how the Lovász--Schrijver relaxations for the stable set polytope of G can be strengthened using the corresponding relaxations for the cut polytope of the graph $G^\nabla$ obtained from G by adding a node adjacent to all nodes of G.
Perturbation theory for the generalized Bott--Duffin inverse and its applications
Authors: Guo-Liang Chen, Guo-Ming Liu, Yi-Feng Xue
Venue: Applied Mathematics and Computation (2002)

A perturbation theory for the Bott-Duffin inverse A(L)(+) of A with respect to a subspace L is developed. The perturbation bound for the solution of the constrained system Ax + y = b, x ∈ L, y ∈ L⊥ is established, where A ∈ Mn(C), a subspace L ⊂ Cn and b ∈ Cn. Meanwhile this paper shows the generalized Bott-Duffin condition number KgBD(A) = ∥ A ∥ . ∥ A(L)(+)∥ to be minimum in the inequality of error analysis.
Building Java Enterprise Systems with J2EE with CD Rom
Authors: Paul Perrone, S. R.R. Chaganti Chaganti
Venue:  (2000)

:Building Java Enterprise Systems with J2EE provides a comprehensive and practical guide for professional Java developers and architects who need to build distributed, scalable, secure, and web-enabled Enterprise, E-commerce, and Business-to-Business (B2B) systems. The practical angle of Building Java Enterprise Systems with J2EE provides the conceptual background and wealth of code examples needed to actually assemble systems in a useful manner with the J2EE technologies. Furthermore, this book demonstrates how the technologies complement and build on top of one another via evolution of a cohesive and real sample application. You can use this book to learn, develop, and design your custom applications immediately. Topics covered include: J2EE, EJB, servlets, JSP, XML, JMS, JDBC, Security, JNDI, Jini, CORBA, RMI, DCOM, JTA, JTS, and JavaMail.
Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers
Authors: Michael C. Ferris, Robert Fourer, David M. Gay
Venue: SIAM Journal on Optimization (1999)

Diverse problems in optimization, engineering, and economics have natural formulations in terms of complementarity conditions, which state (in their simplest form) that either a certain nonnegative variable must be zero or a corresponding inequality must hold with equality, or both. A variety of algorithms has been devised for solving problems expressed in terms of complementarity conditions. It is thus attractive to consider extending algebraic modeling languages, which are widely used for sending ordinary equations and inequality constraints to solvers, so that they can express complementarity problems directly. We describe an extension to the AMPL modeling language that can express the most common complementarity conditions in a concise and flexible way, through the introduction of a single new "complements" operator. We present details of an efficient implementation that incorporates an augmented presolve phase to simplify complementarity problems, and that converts complementarity conditions to a canonical form convenient for solvers.
Effective Executive's Guide to Excel 2002: The Seven Core Skills Required to Turn Excel into a Business Power Tool
Authors: David B. Maguiness, Stephen L. Nelson
Venue:  (2001)

:Written specifically for busy executives, managers, and other professionals, Effective Executive's Guide to Excel 2002 provides a fast-paced, filtered, executive summary of the seven core skills you need to know to use Microsoft Excel at work, on the road, or even at home
Using Visual J++, 2nd edition
Authors: Scott Mulloy
Venue:  (1998)

:Using Visual J++ X is a task-based reference that uses clear organization, step-by-step tasks, abundant code samples, and new cross-indexing techniques to teach Visual J++. This book covers all aspects of using Visual J++ to build a wide range of Java applets and applications, ActiveX objects, COM/DCOM objects, and more. The book also covers some of the more advanced features of the Java 1.2 language. Using Visual J++ X accomplishes these goals by anticipating the needs of the user, providing strong navigation and accessibility to the content. This book provides a powerful price/content value proposition versus other books in the marketplace.This thorough and easy-to-use, task-based reference helps inexperienced readers quickly learn Visual J++Hands-on practical approach and well-documented code examples ensure that readers understand and learn Java programming techniquesStrong content and organization, a leading author, new packaging, and 700 pages of material for $29.99 makes Using Visual J++ X an excellent value 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
Mac OS 9 for Dummies, 1st edition
Authors: Bob LeVitus
Venue:  (1999)

:Make your Mac purr with Apple's hot new operating system, Mac OS 9, with Mac OS 9 For Dummies, the fun and easy way to maximize your Mac's performance. Whether you're a longtime Mac user or you've just bought your first iMac, let renowned Mac expert Bob LeVitus show you how to polish your Apple. From desktop basics to advanced tweaks, you'll soon be zipping along on Apple's revolutionary new Internet-friendly operating system. Mac OS 9 For Dummies helps you Master Mac basics Customize your Mac for multiple users Share resources on a network Save time with simple tweaks Automate with AppleScript Harness the advanced Sherlock 2 search engine Mac OS 9 For Dummies is filled with tips, tricks, techniques, and steps, and shows you what Mac OS 9 is all about without boring you, confusing you, or making you uncomfortable. Stephen Bobker writes, "Mac OS 9 For Dummies jumps right to the top of the class in Mac system software books. Any book that surpasses it is going to have to be awfully good. And it wouldn't surprise me if Bob LeVitus is the author."
Python; Essential Reference
Authors: David Beazley, Guido Van Rossum
Venue:  (1999)

From the Book:As Python's creator, I'm really happy that this book has appeared. It marks a point in time when Python is becoming a mainstream language, with a rapidly growing community of users. If you consider yourself an (established or aspiring) member of this community, you need neither evangelizing nor proselytizing, and you already know Python well enough to have chosen it as an essential element of your personal toolbox. This book aims to be your guide on the rest of your journey through the Python world. It documents every detail of the language's syntax and semantics, provides reference documentation and examples for most standard library modules, and even contains a quick reference for writing extension modules. All this information is thoroughly indexed and cross-referenced, and where necessary contains pointers to additional online documentation for obscure details. You might think that all this information is already available for free on the Python Web site (www.python.org). Sure, it's all there-in fact, I'm certain that the author, my good friend David Beazley, consulted the Web site many times. He would have been a fool not to! However, with all due respect for the authors of Python's online documentation (myself included!), this book has a huge advantage over the Web site: You can easily take it with you on a trip into the desert. Seriously, David has reorganized and rewritten all the information for maximum clarity, pulled things together from different sources, removed redundancies, clarified ambiguities, added better examples, and so on. He also had a benefit that few readers of the Web site have: direct access to my brain! This summer, David spent a few weeksvisiting CNRI, the research lab in Reston that Python calls home. During this time we had many interesting and fruitful discussions about Python, this book, the meaning of life, southwestern cooking, the joys and pains of teaching computer science to noncomputer scientists, and the Spanish Inquisition. (Remember? Nobody expects the Spanish Inquisition!) I hope that you will enjoy using this book, and that it will serve you well. I also hope that you will continue to enjoy using Python, and that it will serve you well. Python is a great programming language, and I would like to use this opportunity to thank the entire Python community for making Python what it is today. Without the thousands of believers, users, contributors, entrepreneurs, and developers who make up the Python community, my own energy directed toward Python would have dried up long ago. I see this as the essence of open source projects: The energy and creativity of many people with diverse goals together can work miracles! -Guido van Rossum Baltimore, MD 9/13/1999
Multicovering Bounds from Relative Covering Radii
Authors: Iiro Honkala, Andrew Klapper
Venue: SIAM Journal on Discrete Mathematics (2002)

The multicovering radii of a code are recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-tuples of vectors. In this paper we prove a new identity relating the multicovering radii of a code to a relativized notion of ordinary covering radius. This identity is used to prove new bounds on the multicovering radii of particular codes.
A Performance Analysis of Transposition-Table-Driven Work Scheduling in Distributed Search
Authors: John W. Romein, Henri E. Bal, Jonathan Schaeffer, Aske Plaat
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

This paper discusses a new work-scheduling algorithm for parallel search of single-agent state spaces, called Transposition-Table-Driven Work Scheduling, that places the transposition table at the heart of the parallel work scheduling. The scheme results in less synchronization overhead, less processor idle time, and less redundant search effort. Measurements on a 128-processor parallel machine show that the scheme achieves close-to-linear speedups; for large problems the speedups are even superlinear due to better memory usage. On the same machine, the algorithm is 1.6 to 12.9 times faster than traditional work-stealing-based schemes.
2K: A System-Wide Checklist for Your Business
Authors: Conor Sexton
Venue:  (1998)

:This book is an overview for the technical manager of the 'issues' to be considered as part of implementing any Year 2000 (Y2K) repair project. This book is deliberately short. In seven chapters, Conor Sexton covers the essence of the Y2K problem and measures that should be adopted to fix it. In giving emphasis to the distributed client/server computing model, as well as the traditional mainframe home of the Y2K problem, the concerns of small businesses as well as major enterprises are addressed. In addressing Year 2000, this book consciously leans towards the kind of distributed client/server computing environment, heavily reliant on PCs, found in most large and small businesses today. 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
Latent Semantic Analysis for User Modeling
Authors: Virginie Zampa, Benoît Lemaire
Venue: Journal of Intelligent Information Systems (2002)

Latent semantic analysis (LSA) is a tool for extracting semantic information from texts as well as a model of language learning based on the exposure to texts. We rely on LSA to represent the student model in a tutoring system. Domain examples and student productions are represented in a high-dimensional semantic space, automatically built from a statistical analysis of the co-occurrences of their lexemes. We also designed tutoring strategies to automatically detect lexeme misunderstandings and to select among the various examples of a domain the one which is best to expose the student to. Two systems are presented: the first one successively presents texts to be read by the student, selecting the next one according to the comprehension of the prior ones by the student. The second plays a board game (kalah) with the student in such a way that the next configuration of the board is supposed to be the most appropriate with respect to the semantic structure of the domain and the previous student's moves.
Shortorder Macromedia Fireworks 2.0
Authors: Ronnie Sampson, Nancy Martin
Venue:  (1999)

:Learn the "how-to" behind great-looking, fast downloading Web graphics through practical examples that teach the fundamentals of creating Web graphics in a visual, hands-on way. You are guided through levels of graphic creation in a visual approach that uses screenshots, concise, focused examples, and practical exercises that include importing and exporting graphics, editability, animation, tweening, and text and production issues. The book explains the processes that take advantage of Fireworks' strengths, while providing insightful information for dealing with its weaknesses. Includes Fireworks solutions in a step-by-step format that you can apply to your own work.
From Finite Covariance Windows to Modeling Filters: A Convex Optimization Approach
Authors: Christopher I. Byrnes, Sergei V. Gusev, Anders Lindquist
Venue: SIAM Review (2001)

The trigonometric moment problem is a classical moment problem with numerous applications in mathematics, physics, and engineering. The rational covariance extension problem is a constrained version of this problem, with the constraints arising from the physical realizability of the corresponding solutions. Although the maximum entropy method gives one well-known solution, in several applications a wider class of solutions is desired. In a seminal paper, Georgiou derived an existence result for a broad class of models. In this paper, we review the history of this problem, going back to Carath{&eacute;odory, as well as applications to stochastic systems and signal processing. In particular, we present a convex optimization problem for solving the rational covariance extension problem with degree constraint. Given a partial covariance sequence and the desired zeros of the shaping filter, the poles are uniquely determined from the unique minimum of the corresponding optimization problem. In this way we obtain an algorithm for solving the covariance extension problem, as well as a constructive proof of Georgiou's existence result and his conjecture, a generalized version of which we have recently resolved using geometric methods. We also survey recent related results on constrained Nevanlinna--Pick interpolation in the context of a variational formulation of the general moment problem.
On a Numerical Liapunov--Schmidt Spectral Method and Its Application to Biological Pattern Formation
Authors: K. Böhmer, C. Geiger, J. D. Rodriguez
Venue: SIAM Journal on Numerical Analysis (2002)

Spectral expansions are used to provide a basis which preserves continuous symmetries. We show that spectral methods satisfy the conditions for convergence of numerical Liapunov--Schmidt methods. An explicit algorithm for the calculation of stationary bifurcation scenarios near primary instabilities in general continuous symmetric equations is given. The above convergence is extended to $ \Gamma$-equivalent discrete and original bifurcation scenarios. The method is applied to a biologically motivated reaction-diffusion system with spherical symmetry forming patterns. A specific singularity of a generic steady state bifurcation is investigated in detail.
Learning the Bash Shell, 2nd edition
Authors: Cameron Newham, Bill Rosenblatt
Venue:  (1998)

:Learning the bash Shell, Second Edition, is the definitive guide to bash, the Free Software Foundation's "Bourne Again Shell." It's a freely available replacement for the popular UNIX Bourne shell, and is also the shell of choice for Linux users around the world. You'll find this guide valuable whether you're interested in bash as a user interface or for its powerful programming capabilities. It will teach you how to use bash's advanced command-line features, like command history, command-line editing, and command completion. This book also introduces shell programming, a skill no UNIX or Linux user should be without. The book demonstrates what you can do with bash's programming features. You'll learn about flow control, signal handling, and command-line processing and I/O. There is also a chapter on debugging your bash programs. Finally, Learning the bash Shell, Second Edition, shows you how to acquire, install, configure, and customize bash, and gives advice to system administrators managing bash for their user community.
Perfect code is W[1]-complete
Authors: Marco Cesati
Venue: Information Processing Letters (2002)

We show that the parameterized problem PERFECT CODE belongs to W[1]. This result closes an old open question, because it was often conjectured that PERFECT CODE could be a natural problem having complexity degree intermediate between W[1] and W[2]. This result also shows W[1]-membership of the parameterized problem WEIGHTED EXACT CNF SATISFIABILITY.
Zero Sum Absorbing Games with Incomplete Information on One Side: Asymptotic Analysis
Authors: Dinah Rosenberg
Venue: SIAM Journal on Control and Optimization (2000)

We prove the existence of the limit of the values of finitely repeated (resp., discounted) absorbing games with incomplete information on one side, as the number of repetitions goes to infinity (resp., the discount factor goes to zero). The main tool is the study of the Shapley operator, for which the value of the $\lambda$-discounted game is a fixed point, and of its derivative with respect to $\lambda$.
Ecological Data: Design, Management and Processing, 1st edition
Authors: William K. Michener, James W. Brunt
Venue:  (2000)

:Ecologists are increasingly tackling difficult issues like global change, loss of biodiversity and sustainability of ecosystem services. These and related questions are enormously challenging requiring unprecedented multidisciplinary collaboration and rapid synthesis of large amounts of diverse data into information and ultimately knowledge." "This book addresses these issues providing a much needed resource for those involved in designing and implementing ecological research, as well as students who are entering the environmental sciences. The book stops short of a detailed treatment of data analysis, but does provide pointers to the relevant literature in graphics, statistics and knowledge discovery. The central thesis of the book is that high quality data management systems are critical for addressing future environmental challenges, requiring a new approach to how we conduct ecological research, one that views data as a resource and promotes stewardship, recycling and sharing of data." "Ecological Data will be particularly useful to those ecologists and information specialists that actively design, manage and analyze environmental databases, but will also benefit a wider audience of scientists and students in the ecological and environmental sciences.
On the Regularity of Approximate Solutions to Conservation Laws with Piecewise Smooth Solutions
Authors: Tao Tang, Zhen-huan Teng
Venue: SIAM Journal on Numerical Analysis (2000)

In this paper we address the questions of the convergence rate for approximate solutions to conservation laws with piecewise smooth solutions in a weighted W1,1 space. Convergence rate for the derivative of the approximate solutions is established under the assumption that a weak pointwise-error estimate is given. In other words, we are able to convert weak pointwise-error estimates to optimal error bounds in a weighted W1,1 space.For convex conservation laws, the assumption of a weak pointwise-error estimate is verified by Tadmor [ SIAM J. Numer. Anal., 28 (1991), pp. 891--906]. Therefore, one immediate application of our W1,1- convergence theory is that for convex conservation laws we indeed have W1,1-error bounds for the approximate solutions to conservation laws. Furthermore, the $\cO(\en)$-pointwise-error estimates of Tadmor and Tang [ SIAM J. Numer. Anal., 36 (1999), pp. 1739--1758] are recovered by the use of the W1,1-convergence result.