ppxscal/embedding_network huggingface dataset:
Transform Your Business into E: Going beyond the Dot COM Disasters
Authors: Bennet P. Lientz, Kathryn P. Rea
Venue:  (2001)

:The dot com failures of 2000-2001 are attributable in part to poor adaptations of E-Business practices to successful businesses. In the aftermath of their demise, Transform Your Business into E presents an exploration and analysis of grafting E-Business strategies onto successful enterprises. Leading managers from initial reviews of their existing businesses to evaluations of their preliminary successes and plans for expansion, this book translates visions into specific actions. Transform Your Business into E investigates how to: * Transform your enterprise into E-Business without destroying and disrupting your business * Develop your down-to-earth E-Business vision, objectives, and strategies * Align business, E-Business, and IT for success * Employ collaborative methods and empowerment for E-Business success * Determine your E-Business readiness * Achieve political and cultural goals through E-Business * Define and implement Quick Hit process improvements that lead to E-Business * Overcome resistance to E-Business * Develop a usable E-Business implementation strategy * Direct and manage outsourcing * Measure business processes, business involvement, and vendor work * Avoid failure in E-Business implementation
Preconditioners for Ill-Conditioned Toeplitz Systems Constructed from Positive Kernels
Authors: Daniel Potts, Gabriele Steidl
Venue: SIAM Journal on Scientific Computing (2000)

In this paper, we are interested in the iterative solution of ill-conditioned Toeplitz systems generated by continuous nonnegative real-valued functions f with a finite number of zeros. We construct new w-circulant preconditioners without explicit knowledge of the generating function f by approximating f by its convolution f * KN with a suitable positive reproducing kernel KN. By the restriction to positive kernels we obtain positive definite preconditioners. Moreover, if f has only zeros of even order $\le 2s$, then we can prove that the property $ \int_{-\pi}^{\pi} t^{2k} K_N (t) \, \mbox{d} t \le C N^{-2k} $ $(k=0,\hspace*{1.5pt}\ldots,s)$ of the kernel is necessary and sufficient to ensure the convergence of the PCG method in a number of iteration steps independent of the dimension N of the system. Our theoretical results were confirmed by numerical tests.
MicroComputers and Electronic Instrumentation: Making the Right Connections
Authors: Howard V. Malmstadt, Stanley R. Crouch, Christie G. Enke
Venue:  (1994)

:The authors believe that the effectiveness of future generations of scientists depends in part on their ability to use intelligently, diagnose, and modify their microcomputer-based and electronic instrumentation. Using a "top-down" approach, the authors present electronic concepts, principles, and technology that are impacting our daily lives. They start at the top, by providing a broad perspective of electronic instrumentation, and work down to functional modules, devices, and detailed operations. This top-down approach enables all of the pieces to fit together so that a working knowledge is developed as one proceeds through the chapters. Written specifically for chemists, physicists, engineers, biologists, medical researchers, students, and other technical personnel who can benefit from "making the right connections" to modern instrumentation, this book will empower you to gain better control and make better use of your microcomputers and laboratory instruments.
Variational Inequality Problems with a Continuum of Solutions: Existence and Computation
Authors: P. Jean-Jacques Herings, Dolf Talman, Zaifu Yang
Venue: SIAM Journal on Control and Optimization (2000)

In this paper three sufficient conditions are provided under each of which an upper semicontinuous point-to-set mapping defined on an arbitrary polytope has a connected set of zero points that connect two distinct faces of the polytope. Furthermore, we obtain an existence theorem of a connected set of solutions to a nonlinear variational inequality problem over arbitrary polytopes. These results follow in a constructive way by designing a new simplicial algorithm. The algorithm operates on a triangulation of the polytope and generates a piecewise linear path of points connecting two distinct faces of the polytope. Each point on the path is an approximate zero point. As the mesh size of the triangulation goes to zero, the path converges to a connected set of zero points linking the two distinct faces. As a consequence, our results generalize Browder's fixed point theorem [Summa Brasiliensis Mathematicae, 4 (1960), pp. 183--191] and an earlier result by the authors [Math. Oper. Res., 21 (1996), pp. 675--696] (1996) on the n-dimensional unit cube. An application in economics and some numerical examples are also discussed.
Digital Camera and Imaging Guide
Authors: Les Freed, Sumi Das
Venue:  (2001)

:TechTV's Digital Camera and Imaging Guide is a complete resource to use before and after buying a digital camera. You'll get expert advice from Les Freed, a PC Magazine editor who writes reviews on the newest consumer digital cameras and compatible software and hardware. This guide covers choosing the right camera, hardware, software, and Web resources, and shows how to capture, edit, store, and share images easily and with no previous photography experience.
An algorithm and fortran program for multivariate LAD (l1 of l2) regression
Authors: E. H. Kaufman,  Jr., G. D. Taylor, P. W. Mielke,  Jr., K. J. Berry
Venue: Computing (2002)

A FORTRAN package is presented for multivariate Least sum of Absolute Deviations (LAD) regression with respect to the l1 of l2 norm, and this regression method is compared with l2 of l2 regression and l1 of l1 regression. Applications of the algorithm include multivariate permutation analyses of experimental design and prediction models which are based on Euclidean distance.
.NET Framework Essentials
Authors: Thuan L. Thai, Hoang Lam
Venue:  (2001)

:.NET Framework Essentials is an objective, concise, and technical overview of the new Microsoft .NET framework for developing web applications and services. Specifically written for intermediate to advanced VB, C/C++, Java, and Delphi developers, .NET Framework Essentials is also useful to system architects and leaders who are assessing tools for future projects. The authors devote special attention to the writing of .NET components plus web applications and services. This book takes on all of the most important .NET Framework topicsfrom the underlying Common Language Run-Time (CLR) to its specialized packages for ASP.NET, Web Forms, Windows Forms, XML and data access (ADO.NET). The authors survey each of the major .NET languages, including VB.NET, C#, and Managed C++, as well as MSIL, the intermediate language understood by the CLR. They've included working code samples in every .NET language. Compact and free of fluff or proprietary hype, .NET Framework Essentials is an outstanding value for experienced programmers and architects who need to get up to speed quickly on a far-reaching new technology.
The Longman Handbook for Writers and Readers, 2nd edition
Authors: Christopher M. Anson, Robert A. Schwegler
Venue:  (1999)

:The authors designed the book as a resource both for times when you are looking for the answer to a specific question and for times when you want extended help.
&Otilde;(congestion + dilation) hot-potato routing on leveled networks
Authors: Costas Busch
Venue: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures (2002)

We study packet routing problems, in which we route a set of N packets on preselected paths with congestion C and dilation D. For store-and-forward routing, in which nodes have buffers for packets in transit, there are routing algorithms with performance that matches the lower bound &OHgr;(C+D). Motivated from optical networks, we study the extreme case of hot-potato routing in which the nodes are bufferless. In hot-potato routing, packets may be unable to follow the preselected paths towards the destination nodes; thus it may take more time for packets to be routed. An interesting question is how much is the performance of routing algorithms affected from the absence of buffers.Here, we answer this question for the general class of leveled networks, in which the nodes are partitioned into L+1 distinct levels. We present a randomized hot-potato routing algorithm for leveled networks, which routes the packets in &Otilde;(C + L) time with high probability. For routing problems with dilation O(L), this bound is within polylogarithmic factors from the lower bound &OHgr;(C+L). Our algorithm demonstrates that the benefit from using buffers is no more than polylogarithmic; thus, hot-potato routing is an efficient way to route packets in leveled networks.Our algorithm is online, that is, routing decisions are taken at real time at each node, while packets are routed in the network. A novel characteristic of our algorithm is that during the course of routing, packets may deviate from their preselected paths. To our knowledge, this is the first hot-potato algorithm designed and analyzed, in terms of congestion and dilation, for arbitrary leveled networks.
Summarizing graphs by regular expressions
Authors: Mark Wegman
Venue: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1983)

This paper shows how to rapidly determine the path relationships between k different elements of a graph (of the type primarily resulting from programs) in time proportional to k log k. Given the path relations between elements u,v, and w, it is easy to answer questions like "is there a path from u to w?" and "is there a path from u to w which does not go through v?" (The elements can be either nodes or edges.)This algorithm can be used in a wide variety of contexts. For example, in order to prove that whenever control reaches a point p, the last assignment of a value to a variable, v, has always been of the form v := c, where c is a certain constant, it is only necessary to know the path relations between the point p and all assignments to that variable.Ordinarily one is interested in the possible points, where a variable was assigned its current value (definition points), and at the points at which that value is used. Previously, all flow analysis algorithms would compute the definition points of all variables at all nodes in the graph, despite the fact that any given node may use only one of those variables.This algorithm may also be a generally useful graph algorithm. It can compute transitive closure more rapidly than the standard algorithm using the current best matrix multiplication algorithm on the kinds of graphs resulting from programs. The algorithm proceeds by preprocessing the graph, creating tables that can be used later to rapidly determine flow relationships between any sections of the program. In addition, small changes to the graph need only result in small changes to the tables. The algorithm is therefore suitable for incremental analysis.
Java Modeling Color with Uml: Enterprise Components and Process with Cdrom, 1st edition
Authors: Peter Coad, Jeff de Luca, Eric Lefebvre
Venue:  (1999)

From the Book:PREFACE: Preface Archetypes, color, and components will forever change how you build Java models. We build Java models with teams of developers. In our day-to-day mentoring, we develop and try out new ideas and innovations that will help those developers excel at modeling. Some of those ideas fall by the wayside. Some provide modest help. Others, according to our clients, are home runs. In this book, we reveal some of our home runs. Chapter 1 explores the importance of color and introduces the color-coding that project teams have been applying with success around the globe. It also introduces the domain-neutral component, a template that youÕll see applied again and again in the chapters that follow. Chapters 2Ð5 deliver ready-to-use Java models. These chapters present 61 domain-specific components, each one an interesting teaching by example. Use the components as they are, extend them with plug-ins, extend them by adding your own content, or use them as an outside opinion (comparing and contrasting with your own ongoing work). Chapter 6 delivers a process that integrates Java modeling into the delivery of frequent, tangible, working results. We hope you enjoy this new material! Peter Coad (pc@oi.com) Eric Lefebvre (lefee@groupe-progestic.com) Jeff De Luca (jdl@nebulon.com)
Photoshop 6 Effects Magic
Authors: Rhoda Grossman
Venue:  (2001)

:Contributors provide instruction on how to create a variety of exciting new effects using the techniques available in Photoshop 6. Each project will be from 3 to 10 pages in length and be designed in a 2-column format with step-by-step instructions on the left and corresponding graphics (or code) on the right. In addition, sidebars will be used to provide additional tips and tricks. Any effect, technique, or tip can easily be customized to fit a reader's own design needs.
NFL Blitz 2000: Official Strategy Guide
Authors: Brady Games, Tim Cox
Venue:  (1999)

:NFL Blitz 2000, the sequel to the hugely successful NFL Blitz, is better than ever with its new stadiums, fantasy arenas, unbelievable camera angles, and an "on-fire" mode that will send your man burning down the field. The game is even more realistic with plays affected by weather conditions, including rain and snow. As with NFL Blitz, NFL Blitz 2000 will continue to take the compelling elements of NFL football and distill them into an intense, over the top game that anyone can enjoy.
Networking Essentials, (Unleashed), 1st edition
Authors: Mark A. Sportack, Anthony Northrup
Venue:  (1997)

:{ Gain expert knowledge of the physical layer of the OSI model (Chapter 3) { Learn about different wireless technologies, including infrared and radio (Chapter 4) { Use the circuit and packet switched transmission facilities (Chapters 16-17) { Discover how to use modems and dial-up technologies in your WAN (Chapter 17) { Manage and fine-tune your network's performance (Chapter 20) { Secure the data on your network (Chapter 21) { Build fault-tolerant systems using redundant arrays of inexpensive disks-RAID (Chapter 22) { Learn about the different types of remote access for NT networks (Chapter 23) { Prevent and troubleshoot problems with your network (Chapters 25-26) { Discover how intranets, extranets, and VPNs differ, and when their deployment makes sense (Chapter 25)
Video retrieval using an MPEG-7 based inference network
Authors: Andrew Graves, Mounia Lalmas
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

This work proposes a model for video retrieval based upon the inference network model. The document network is constructed using video metadata encoded using MPEG-7 and captures information pertaining to the structural aspects (video breakdown into shots and scenes), conceptual aspects (video, scene and shot content) and contextual aspects (context information about the position of conceptual content within the document). The retrieval process a) exploits the distribution of evidence among the shots to perform ranking of different levels of granularity, b) addresses the idea that evidence may be inherited during evaluation, and c) exploits the contextual information to perform constrained queries.
What is chat doing in the workplace?
Authors: Mark Handel, James D. Herbsleb
Venue: Proceedings of the 2002 ACM conference on Computer supported cooperative work (2002)

We report an empirical study of a synchronous messaging application with group-oriented functionality designed to support teams in the workplace. In particular, the tool supports group chat windows that allow members of a group to communicate with text that persists for about a day. We describe the experience of 6 globally-distributed work groups who used the tool over a period of 17 months. An analysis of use shows that the group functionality was used primarily for bursts of synchronous conversations and occasional asynchronous exchanges. The content was primarily focused on work tasks, and negotiating availability, with a smattering of non-work topics and humor. Nearly all groups were remarkably similar in the content of their group chat, although the research group chatted far more frequently than the others. We conclude with suggestions for future research, and a discussion of the place of team-oriented synchronous messaging tools in the workplace.
MS Office 2000 for Windows for Dummies, 1st edition
Authors: Wallace Wang, Robert C. Parker
Venue:  (1998)

:Covers Word, Excel, PowerPoint, Access, Outlook, Publisher, FrontPage, PhotoDraw Packed with time-saving tips and plain-English explanations Get up to speed on Office 2000 and get more done in less time Office 2000 is a powerful set of software tools. But it's also kind of complicated. Which is why you need this friendly, funny, easy-to-understand guide. Wallace Wang and Roger C. Parker walk you through the basics of Word, Excel, PowerPoint, Outlook, Access, Publisher, FrontPage, and PhotoDraw  and show you how everything works together. Discover how to: Create dazzling documents and spectacular spreadsheets Organize your e-mail and your schedule Build powerful presentations and dependable databases Produce winning Web pages and illustrious illustrations Customize Office The Dummies Way Explanations in plain English "Get in, get out" information Icons and other navigational aids Tear-out cheat sheet Top ten lists A dash of humor and fun Get smart! Register to win cool prizes Browse exclusive articles and excerpts Get a free Dummies Daily e-mail newsletter Chat with authors and preview other books Talk to us, ask questions, get answers
Sap R/3 Administration for Dummies, 1st edition
Authors: Joey Hirao, Jim Meade
Venue:  (1999)

:To keep SAP R/3 running exactly to your company's specifications, you need SAP R/3 For Dummies. You'll get help on everything - working in a three-tiered landscape, handling user authorizations, defining and scheduling operation modes, monitoring performance with the Computing Center Management System, systematic guidelines for protecting security, and more!
Deep Branding on the Internet: Applying Heat and Pressure Online to Ensure a Lasting Brand, 4th edition
Authors: Marc Braunstein, Edward H. Levine
Venue:  (2000)

:The Internet presents businesses with the most potent collection of tactics and new business opportunities they've ever experienced. But the Web is certainly no magic bullet, and setting your business apart requires that you understand exactly how the Internet fits in with all the other elements of your company's growth strategy. Inside, two experts reveal their knowledge of how to deepen and profit from brands in the era of the Internet. Using examples of established companies both large and small, Marc Braunstein and Edward H. Levine trace the steps every successful business must take to develop a strategy that not only surmounts the challenges of e-commerce but, just as important, reinforces customer loyalty. In Deep Branding on the Internet, You'll also discover:How a deep brand can be the ultimate search engine for your businessWhy you should ignore online users and focus instead on customersHow smart, multi-channel brandholders should win on the Internet every timeWhy the Internet has a low barrier to entry but a high barrier to profitHow the Web can give you more control over channels and markets that are becoming increasingly fragmentedAnd much more!Insightful, easy to read, and packed with practical information, Deep Branding on the Internet is a must-have tool that everyone from a Fortune 500 manager to an aspiring small-business owner will want to read, share, and act upon.
On Lower Bounds for Selecting the Median
Authors: Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick
Venue: SIAM Journal on Discrete Mathematics (2001)

We present a reformulation of the 2n+o(n) lower bound of Bent and John [Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 213--216] for the number of comparisons needed for selecting the median of n elements. Our reformulation uses a weight function. Apart from giving a more intuitive proof for the lower bound, the new formulation opens up possibilities for improving it. We use the new formulation to show that any pair-forming median finding algorithm, i.e., a median finding algorithm that starts by comparing $\lfloor n/2\rfloor$ disjoint pairs of elements must perform, in the worst case, at least 2.01 n + o(n) comparisons. This provides strong evidence that selecting the median requires at least cn+o(n) comparisons for some c> 2.
Flash 5! Creative Web Animation
Authors: Derek Franklin, Brooks Patton
Venue:  (2000)

:Flash 5! Creative Web Animation is the latest update to one of Peachpit's best-selling Macromedia Flash titles. It first provides a foundation and basic knowledge of Flash and its many features and tools, then leads users through interactive tutorials and sample demos. Chapters cover such topics as drawing, sound, the library, animation, interactivity, testing, and publishing your work. Authors Derek Franklin and Brooks Patton offer additional information on how to make the development process flow easier and more efficiently. The companion CD-ROM provides QuickTime tutorials, source files and interactive lessons for the book, as well as other Macromedia product demos.
Object Oriented Programming in C++, 4th edition
Authors: Robert Lafore
Venue:  (2001)

:Object-Oriented Programming in C++ begins with the basic principles of the C++ programming language and systematically introduces increasingly advanced topics while illustrating the OOP methodology. While the structure of this book is similar to that of the previous edition, each chapter reflects the latest ANSI C++ standard and the examples have been thoroughly revised to reflect current practices and standards.
Adaptive Learning by Genetic Algorithms: Analytical Results and Applications to Economic Models, 1st edition
Authors: Herbert Dawid
Venue:  (1999)

:This book deals with the learning behavior of bounded rational agents in economic systems. In particular, the modeling of learning populations by genetic algorithms is studied in detail. After an extensive review and discussion of the existing literature in the first part, a mathematical analysis of the dynamic properties of genetic algorithm learning in the general framework of systems with a state dependent fitness function is provided. It is shown that coevolutionary economic models typically fall into this class and the usefulness of the analytical results derived is illustrated in several game theoretic and microeconomic models. The mathematical analysis is complemented by extensive simulation analyses. The last part of the book demonstrates how the obtained theory may be used to design the algorithm such that the learning of equilibria of the economic system is facilitated.