ppxscal/embedding_network huggingface dataset:
Comparison of routing strategies for AGV systems using simulation
Authors: Mark B. Duinkerken, Jaap A. Ottjes, Gabriel Lodewijks
Venue: Proceedings of the 38th conference on Winter simulation (2006)

In automated transport systems, the origin-destination combinations are normally connected through a fixed layout, not representing the shortest path. The flexibility of these systems is limited and often the infrastructure is not optimally used. With the introduction of more powerful onboard computers and advanced sensor technology, the positioning and navigating possibilities of AGVs increased. However the routes, although virtual, are still fixed. A new step ahead would be to determine each path dynamically. This would use the free ranging capacities of AGVs to its full potential. In this paper, the benefits of the dynamic free ranging approach are investigated; a simulation model on the strategic level is presented that compares several common fixed layouts with the shortest connection approach. Naturally, the avoidance of collisions plays a central role. It is concluded that dynamic free ranging has high potential in terms of transport capacity of the resulting system.
Some notes on typography in technical documentation
Authors: Jonathan Sachs
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1979)

My intention is to make some observations on how typography -- the physical arrangement of type in a document -- can aid or hinder the document's usefulness. 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
SAP R/3 for Everyone: Step-by-Step Instructions, Practical Advice, and Other Tips and Tricks for Working with SAP
Authors: Jim Mazzullo, Peter Wheatley
Venue:  (2005)

SAP R/3 for Everyone is the nontechnical user's guide to working with SAP R/3, the leading business enterprise software product in the world. Written and road-tested by experienced SAP R/3 users and trainers, this book saves typical SAP R/3 users time and trouble by providing them with the universal skills needed to work with any module of this complex software.SAP R/3 can be used effectively by anyone who can perform a handful of simple procedures that are employed in nearly every SAP R/3 transaction. The authors explain these procedures in plain English, using illustrations and real-world examples.After a brief explanation of the architecture and operation of SAP R/3, readers get step-by-step instruction in Logging on and off, managing passwords, and customizing the SAP application window and screens Navigating between screens with menu folders, transaction codes, and the menu bar Setting up customized favorites folders with quick links to the initial screens of transactions and other useful resources Understanding the four basic transaction types Working on initial screens, including tips and techniques for entering codes, searching for codes, customizing initial screens, and using multiple selection screens and selection options Customizing output reports with filters, sorts, sums, and display variants Exporting output reports to Microsoft Excel and Word and e-mailing output reports to other SAP usersPractical and jargon-free, SAP R/3 for Everyone provides readers with the skills and confidence they need to efficiently conduct any business activity with SAP R/3.
A simulation model for bioterrorism preparedness in an emergency room
Authors: Lisa Patvivatsiri
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The use of biological agents as weapons can cause disease and deaths in sufficient numbers that can greatly impact a city or region. Consequently, concerns about the preparedness and efficiency of healthcare systems for bioterrorism events have increased dramatically among hospital managements. This paper presents an innovative and sophisticated computer simulation model of the emergency room (ER) at the hospital featured in this study. The objective was to analyze patient flow throughout the treatment process, assess the utilization of ER resources, evaluate the impact of a hypothetical bioterrorist attack, and determine the appropriate resource and staff levels for such a bioterrorism scenario. The recommended staffing strategy at two bottlenecked areas of the hospital's treatment facility would allow a significant reduction in patients' total time in the ER and an improvement in the utilization of resources. A sensitivity analysis was also performed to investigate the effect of changes in input parameters.
Detail-preserving fluid control
Authors: N. Thürey, R. Keiser, M. Pauly, U. Rüde
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

We propose a new fluid control technique that uses scale-dependent force control to preserve small-scale fluid detail. Control particles define local force fields and can be generated automatically from either a physical simulation or a sequence of target shapes. We use a multi-scale decomposition of the velocity field and apply control forces only to the coarse-scale components of the flow. Small-scale detail is thus preserved in a natural way avoiding the artificial viscosity often introduced by force-based control methods. We demonstrate the effectiveness of our method for both Lagrangian and Eulerian fluid simulation environments.
Learning stochastic edit distance: Application in handwritten character recognition
Authors: Jose Oncina, Marc Sebban
Venue: Pattern Recognition (2006)

Many pattern recognition algorithms are based on the nearest-neighbour search and use the well-known edit distance, for which the primitive edit costs are usually fixed in advance. In this article, we aim at learning an unbiased stochastic edit distance in the form of a finite-state transducer from a corpus of (input, output) pairs of strings. Contrary to the other standard methods, which generally use the Expectation Maximisation algorithm, our algorithm learns a transducer independently on the marginal probability distribution of the input strings. Such an unbiased way to proceed requires to optimise the parameters of a conditional transducer instead of a joint one. We apply our new model in the context of handwritten digit recognition. We show, carrying out a large series of experiments, that it always outperforms the standard edit distance.
Cache-Friendly implementations of transitive closure
Authors: Michael Penner, Viktor K. Prasanna
Venue: Journal of Experimental Algorithmics (JEA) (2007)

The topic of cache performance has been well studied in recent years. Compiler optimizations exist and optimizations have been done for many problems. Much of this work has focused on dense linear algebra problems. At first glance, the Floyd--Warshall algorithm appears to fall into this category. In this paper, we begin by applying two standard cache-friendly optimizations to the Floyd--Warshall algorithm and show limited performance improvements. We then discuss the unidirectional space time representation (USTR). We show analytically that the USTR can be used to reduce the amount of processor-memory traffic by a factor of O(&sqrt;C), where C is the cache size, for a large class of algorithms. Since the USTR leads to a tiled implementation, we develop a tile size selection heuristic to intelligently narrow the search space for the tile size that minimizes total execution time. Using the USTR, we develop a cache-friendly implementation of the Floyd--Warshall algorithm. We show experimentally that this implementation minimizes the level-1 and level-2 cache misses and TLB misses and, therefore, exhibits the best overall performance. Using this implementation, we show a 2x improvement in performance over the best compiler optimized implementation on three different architectures. Finally, we show analytically that our implementation of the Floyd--Warshall algorithm is asymptotically optimal with respect to processor-memory traffic. We show experimental results for the Pentium III, Alpha, and MIPS R12000 machines using problem sizes between 1024 and 2048 vertices. We demonstrate improved cache performance using the Simplescalar simulator.
Lotus Domino 6 for Linux (Ibm Redbooks)
Authors: Tommi Tulisalo
Venue:  (2002)

Installing RedHat, SuSE, and Domino 6 for Linux Improving the performance of your Domino server Administering Domino and Linux This IBM Redbook describes how to run the IBM Lotus Domino 6 server on the Linux platform. While Lotus Domino 6 is platform-independent, some specific knowledge about the platform and configuration is required to ensure that the Domino 6 server is running most efficiently. The book provides detailed instructions for installing Linux and Domino 6 for Linux, and describes how to achieve maximum performance of your system. System administration and security techniques are explained and tools for managing and troubleshooting are discussed as well. Detailed scenarios illustrate some of the features of Domino 6 on Linux, in particular user registration, directory synchronization, creating a Domino application, and accessing external data using DB2 and MySQL. We describe how to configure Domino as a Web server, including the new security options specific to the HTTP protocol in Domino 6. Strategies and techniques for virus protection and data backups are presented, along with details about some of the third-party software packages available to help you with these management tasks. This redbook is written for administrators with strong Domino and Windows operating system skills, but who are not experts on Linux. Therefore, we show in detail how to install and configure a Linux operating system on your server, but don't spend too much time explaining basic Domino features. Instead, we focus on demonstrating that Linux is an excellent platform on which to run Domino 6.
Building Outline Extraction from Digital Elevation Models Using Marked Point Processes
Authors: Mathias Ortner, Xavier Descombes, Josiane Zerubia
Venue: International Journal of Computer Vision (2007)

This work presents an automatic algorithm for extracting vectorial land registers from altimetric data in dense urban areas. We focus on elementary shape extraction and propose a method that extracts rectangular buildings. The result is a vectorial land register that can be used, for instance, to perform precise roof shape estimation. Using a spatial point process framework, we model towns as configurations of and unknown number of rectangles. An energy is defined, which takes into account both low level information provided by the altimetry of the scene, and geometric knowledge about the disposition of buildings in towns. Estimation is done by minimizing the energy using simulated annealing. We use an MCMC sampler that is a combination of general Metropolis Hastings Green techniques and the Geyer and Møller algorithm for point process sampling. We define some original proposition kernels, such as birth or death in a neighborhood and define the energy with respect to an inhomogeneous Poisson point process. We present results on real data provided by the IGN (French National Geographic Institute). Results were obtained automatically. These results consist of configurations of rectangles describing a dense urban area.
Characterization of a Large Web Site Population with Implications for Content Delivery
Authors: Leeann Bent, Michael Rabinovich, Geoffrey M. Voelker, Zhen Xiao
Venue: World Wide Web (2006)

This paper presents a systematic study of the properties of a large number of Web sites hosted by a major ISP. To our knowledge, ours is the first comprehensive study of a large server farm that contains thousands of commercial Web sites. We also perform a simulation analysis to estimate potential performance benefits of content delivery networks (CDNs) for these Web sites, and validate our analysis for several sites by replaying our trace through a real cache. We make several interesting observations about the current usage of Web technologies and Web site performance characteristics. First, compared with previous client workload studies, the Web server farm workload contains a much higher degree of uncacheable responses and responses that require mandatory cache validations. A significant reason for this is that cookie use is prevalent among our population, especially among more popular sites. We found an indication of widespread indiscriminate usage of cookies, which unnecessarily impedes the use of many content delivery optimizations. We also found that most Web sites do not utilize the cache-control features of the HTTP 1.1 protocol, resulting in suboptimal performance. Moreover, the implicit expiration time in client caches for responses is strongly constrained by the maximum values allowed in the Squid proxy. Thus, supplying explicit expiration information would significantly improve Web sites' cacheability. Finally, our simulation results indicate that while most Web sites benefit from the use of a CDN, the amount of the benefit varies widely among the sites, which underscores the need for workload analysis tools.
Bitmap algorithms for counting active flows on high-speed links
Authors: Cristian Estan, George Varghese, Michael Fisk
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high-speed link. Such counting can be used to detect DoS attacks and port scans and to solve measurement problems. Counting is especially hard when processing must be done within a packet arrival time (8 ns at OC-768 speeds) and, hence, may perform only a small number of accesses to limited, fast memory. A naive solution that maintains a hash table requires several megabytes because the number of flows can be above a million. By contrast, our new probabilistic algorithms use little memory and are fast. The reduction in memory is particularly important for applications that run multiple concurrent counting instances. For example, we replaced the port-scan detection component of the popular intrusion detection system Snort with one of our new algorithms. This reduced memory usage on a ten minute trace from 50 to 5.6 MB while maintaining a 99.77% probability of alarming on a scan within 6 s of when the large-memory algorithm would. The best known prior algorithm (probabilistic counting) takes four times more memory on port scan detection and eight times more on a measurement application. This is possible because our algorithms can be customized to take advantage of special features such as a large number of instances that have very small counts or prior knowledge of the likely range of the count.
Double rewriting for equivalential reasoning in ACL2
Authors: Matt Kaufmann, J Strother Moore
Venue: Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications (2006)

Several users have had problems using equivalence-based rewriting in ACL2 because the ACL2 rewriter caches its results. We describe this problem in some detail, together with a partial solution first implemented in ACL2 Version 2.9.4. This partial solution consists of a new primitive, double--rewrite, together with a new warning to suggest possible use of this primitive.
MCSA/MCSE 70-290 Training Guide: Managing and Maintaining a Windows Server 2003 Environment (Exam 70-290)
Authors: Lee Scales, Ed Tittel
Venue:  (2003)

MCSA/MCSE Training Guide (70-290): Managing and Maintaining a Windows Server 2003 Environment is the perfect study guide to help you pass the 70-290 exam. The 70-290 exam is one of the four core exams in Microsoft's MCSE 2003 certification program as well as a core exam in the MCSA 2003 program. If you are preparing for this exam, you'll find our Training Guide to be the most effective self-study tool in the market! This book is your one-stop shop because of its teaching methodology, the accompanying PrepLogic testing software, and superior Web site support at www.examcram.com. The book follows the exam objectives and features numerous exercises to give you hands-on opportunities, exam tips that give you advice for test day, and warnings that alert you to possible mistakes. The Fast Facts section condenses the most important information for last-minute review, and the practice exam is representative of the actual exam.Each book in the Training Guide series is published under the direction of Series Editor Ed Tittel, the leading authority on IT certification. This book has been subjected to rigorous technical review by a team of industry experts, ensuring content is superior in both coverage and technical accuracy, and has earned the distinction of Cramsessionï¾¿ Approved Study Material.The CD features PrepLogicï¾¿ Practice Tests, Preview Edition. This product includes one complete PrepLogic Practice Test with approximately the same number of questions found on the actual vendor exam. Each question contains full, detailed explanations of the correct and incorrect answers. The engine offers two study modes, Practice Test and Flash Review, full exam customization, and a detailed score report.
Fundamentals of Electric Circuits, 3 edition
Authors: Charles Alexander, Matthew Sadiku
Venue:  (2006)

Alexander and Sadiku's third edition of Fundamentals of Electric Circuits continues in the spirit of its successful previous editions, with the objective of presenting circuit analysis in a manner that is clearer, more interesting, and easier to understand than other, more traditional texts. Students are introduced to the sound, six-step problem solving methodology in chapter one, and are consistently made to apply and practice these steps in practice problems and homework problems throughout the text and online using the KCIDE software. A balance of theory, worked examples and extended examples, practice problems, and real-world applications, combined with over 300 new homework problems for the third edition and robust media offerings, renders the third edition the most comprehensive and student-friendly approach to linear circuit analysis. Table of contentsPart 1 DC Circuits1 Basic Concepts2 Basic Laws3 Methods of Analysis4 Circuit Theorems5 Operational Amplifiers6 Capacitors and Inductors7 First-Order Circuits8 Second-Order CircuitsPart 2 AC Circuits9 Sinusoids and Phasors10 Sinusoidal Steady-State Analysis11 AC Power Analysis12 Three-Phase Circuits13 Magnetically Coupled Circuits14 Frequency ResponsePart 3 Advanced Circuit Analysis15 Introduction to the Laplace Transform16 Applications of the Laplace Transform17 The Fourier Series18 Fourier Transform19 Two-Port NetworksAppendix A Simultaneous Equations and Matrix InversionAppendix B Complex NumbersAppendix C Mathematical FormulasAppendix D PSpice for WindowsAppendix E MATLABAppendix F KCIDEAppendix G Answers to Odd-Numbered Problems
Bayesian ideas and discrete event simulation: why, what and how
Authors: Stephen E. Chick
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Bayesian methods are useful in the simulation context for several reasons. They provide a convenient and useful way to represent uncertainty about alternatives (like manufacturing system designs, service operations, or other simulation applications) in a way that quantifies uncertainty about the performance of systems, or about inputs parameters of those systems. They also can be used to improve the efficiency of discrete optimization with simulation and response surface methods. Bayesian methods work well with other decision theoretic tools, and can therefore provide a link from traditional operations-level experiments to higher-level managerial decision-making needs, in addition to improving the efficiency of computer experiment
HP-UX 11i Version 2 System Administration: HP Integrity and HP 9000 Servers (HP Professional Series)
Authors: Marty Poniatowski
Venue:  (2005)

This is the definitive guide to installing and administering HP-UX 11i Version 2 in any environment, on both HP 9000 and HP Integrity server families.Drawing on 18 years of on-site HP-UX consulting experience, Marty Poniatowski offers unparalleled practical insight into running HP-UX 11i efficiently and reliably, illuminating features even experienced HP-UX sysadmins find confusing. Poniatowski organizes this book around your day-to-day needs and your system's lifecycle. He begins with in-depth coverage of installation and bootup, then walks through everything from LVM and kernel configuration through networking. He especially focuses on the capabilities and tools that make HP-UX unique-and how you can use them to save time and money. Coverage includes Partitioning from start to finish-including vPars and nPartitions installation, creation, and modification Booting HP Integrity systems with EFI, and HP 9000 systems with PDC, ISL, or hpux Mastering the Management Processor (MP): console, virtual front panel, and command menu Using HP-UX's new kernel-building commands: kcconfig, kcusage, kctune, kcmodule, and more Working with HP-UX's new web-based tools: pd (devices), parmgr (partitions), and kcweb (kernel) Mapping LBA to slot numbers: clear explanations of a non-intuitive technique Using Ignite-UX to boot and recover systems across the network Managing disks, devices, backup, users/groups, and much more © Copyright Pearson Education. All rights reserved.
Autonomic Computing
Authors: Richard Murch
Venue:  (2004)

Systems that install, heal, protect themselves and adapt to your needs -automatically Using autonomic computing to reduce costs, improve services, and enhance agility Autonomic components, architectures, standards, and development tools Planning for and implementing autonomic technology Current autonomic solutions from IBM and other leading companiesReducing IT costs, improving service, and enabling the "on-demand" businessIT operations costs are accelerating, and today's increasingly complex architectures and distributed computing infrastructures only make matters worse. The solution: autonomic computing. Autonomic systems are self-configuring, self-healing, self-optimizing, and self-protecting. They operate intelligently and dynamically, acting on your policies and service requirements. This book presents everything IT leaders and managers need to know to prepare for autonomic computing-and to begin leveraging its benefits. Coverage includes: How autonomic computing can reduce costs, improve service levels, enhance agility, simplify management, and help deliver the "on demand" business The key elements and attributes of autonomic computing systems Current autonomic technologies from IBM and many other leading suppliers Autonomic computing architectures, open standards, development tools, and enablers Implementation considerations, including a new assessment methodology The future of autonomic computing: business opportunities and research challenges
Simulation-based response surface computation in the presence of monotonicity
Authors: Eunji Lim, Peter W. Glynn
Venue: Proceedings of the 38th conference on Winter simulation (2006)

In many stochastic models, it is known that the response surface corresponding to a particular performance measure is monotone in the underlying parameter. For example, the steady-state mean waiting time for customers in a single server queue is known to be monotone in the service rate. In other contexts, the simulator may believe, on the basis of intuition, that the response surface is monotone. This paper describes an appropriate methodology for incorporating such monotonicity constraints into one's response surface estimator.