ppxscal/embedding_network huggingface dataset:
Internetworking Multimedia, 1st edition
Authors: Jon Crowcroft
Venue:  (1999)

:Increasingly, businesses are turning to Internet-based multimedia communication as a tool to use internally and as the foundation for online services that can be sold to customers. Whether the goal is videoconferencing, distance learning, telemedicine, or real-time entertainment broadcasts, demand for expertise in the underlying technologies is growing rapidly. Internetworked Multimedia offers students, systems engineers, network administrators, and product developers a complete guide to today's approaches to Internetworked multimedia. Combining coverage of technological principles, middleware, and applications, this book prepares technical readers to contribute in a variety of roles, from strategic decision-making to implementation to ongoing administration. Features Written by a team of highly respected authors serving on committees formed to define standards for Internetworked multimedia; covers all the latest protocols for exchanging sound and moving images across the Internet in real time. Addresses topics of special interest to implementers and administrators, such as network service models, security, application support, and problem resolution. Examines issues affecting the user's experience, including session creation, announcement, and invitation, collaboration, and media-on-demand. Combines low-level technical information, a critical assessment of the state of the art, and a keen vision of the medium's potential-in a single up-to-date resource.
Simulation in financial engineering: importance sampling in derivative securities pricing
Authors: Yi Su, Michael C. Fu
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

We formulate the importance sampling problem as a parametric minimization problem under the original measure and use a combination of infinitesimal perturbation analysis (IPA) and stochastic approximation (SA) to minimize the variance of the price estimation. Compared to existing methods, the IPA estimator derived in this paper has significantly smaller estimation variance and doesn't depend on the form of payoff functions and differentiability of the sample path, and thus is more universally applicable and computationally efficient. Under suitable conditions, the objective function is a convex function, the IPA estimator presented is unbiased, and the corresponding stochastic approximation algorithm converges to the true optimal value.
Reducing coherence overhead of barrier synchronization in software DSMs
Authors: Jae Bum Lee, Chu Shik Jhon
Venue: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM) (1998)

Software Distributed Shared Memory (SDSM)systems usually have the large coherence granularity that is imposed by the underlying virtual memory page size. To alleviate the coherence overheads such as the net worktraffic to preserve the coherence, or page misses caused by false sharing, relaxed memory models are widely accepted for the SDSM systems. In the relaxed memory models, when a shared page is modified, in validation requests to other copies are deferred until a synchronization point and, in addition, the requests are transferred only to the processor acquiring the synchronization variable. On a barrier, however, the invalidation requests must be transferred to all the processors that participate in the barrier. As a result, it tends to induce heavy network traffic, and also may lead to useless page misses by false sharing.In this paper, we propose a method to alleviate the coherence overheads of barrier synchronization in shared-memory parallel programs. It performs static analysis to examine data dependency between processors across global barriers, and then inserts special primitives into the program in order to exploit the dependency information at run time. The static analysis finds out coderegions where a processor modifies data that will be used only by some of the other processors. At run time, the coherence messages for the data are transferred only to the processors with the help of the inserted primitives. In particular, if the modified data will not be used by any other processors, the primitives enforce that the coherence messages are delivered only to master processor when the parallel execution of the program is finished.We evaluated the performance of this method in a 16-node software DSM system supporting AURC protocol. Program-driven simulation was performed with five benchmark programs: Jacobi, Red-black SOR, Expl, LU, and Water-nsquared. For the applications, the experimental results show that our method can reduce the coherence messages by up to about 98%, and also can improve the execution time by up to about 26%.
Macromedia Director 7: Creating Powerful Multimedia, 1st edition
Authors: CORPORATE Against the Clock,  Inc. Staff
Venue:  (2000)

: Cross-platform compatibilityMacintosh and Windows versions covered in one book Accompanying CD includes all graphic files needed for practice exercises Learning objectives provided at the beginning of each chapter Icons in sidebars help identify key portions of the materials
Hierarchy-of-models approach for aggregated-force attrition
Authors: James G. Taylor, Ugur Ziya Yildirim, William S. Murphy,  Jr.
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

This paper presents some innovations for overcoming shortcomings in the current state-of-the-art for the hierarchy-of-models approach to modeling aggregated-force attrition in ground-combat models. The basic concept of such an approach for modeling large-scale system behavior is presented, together with the theoretical underpinnings for modeling attrition in large-scale ground combat. The output of an entity-level discrete-event combat simulation is fit to a Lanchester-type aggregated-replay model. Use of a reliable statistical-estimation technique for determining model parameters is emphasized. The main innovation is to show how use of more detailed output data (e.g. line-of-sight (LOS) data) from the high-resolution simulation allows one to develop maximum-likelihood estimates. The methodology is applied to a current high-resolution DoD combat model, and a Lanchester-type aggregated-force replay model is developed.
Electronic Banking and Treasury, 2nd edition
Authors: Brian Welch
Venue:  (1998)

:As the range and sophistication of electronic banking services has increased over the last decade, so has the scope for fraud and for error, hence the need for more advanced security options and devices. The second edition of this highly regarded book has been completely revised and updated to present a comprehensive overview of issues and methodologies in this constantly changing environment and includes recent developments in the areas of Electronic Data Interchange (EDI) and Internet security.
Automatic Control of Food Manufacturing Processes, 2nd edition
Authors: Ian McFarlane
Venue:  (1999)

:In the ten years since the first edition of this book appeared there have been significant developments in food process engineering, notably in biotechnology and membrane application. Advances have been made in the use of sensors for process control, and the growth of information technology and online computer applications continues apace. In addition, plant investment decisions are increasingly determined by quality assurance considerations and have to incorporate a greater emphasis on health and safety issues. The content of this edition has been rearranged to include descriptions of recent developments and to reflect the influence of new technology on the control and operations of automated plant. Original examples have been retained where relevant and these, together with many new illustrations, provide a comprehensive guide to good practice. 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
Foundations of Cryptography: Basic Tools
Authors: Oded Goldreich
Venue:  (2000)

:This book presents a rigorous and systematic treatment of the foundational issues of cryptography: defining cryptographic tasks and solving new cryptographic problems using existing tools. It focuses on the basic mathematical tools: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs. Rather than describing ad?hoc approaches, this book emphasizes the clarification of fundamental concepts and the demonstration of the feasibility of solving cryptographic problems.
MCSE Guide to Microsoft Windows 2000 Server, 1st edition
Authors: Michael J. Palmer
Venue:  (2000)

:This title was approved by Microsoft as official courseware to prepare individuals for Microsoft's MCSE Exam for Installing, Configuring, and Administering Microsoft Windows 2000 Server. Extensive hands-on projects, case projects, and review questions are featured in each chapter.
Scalable hierarchical coarse-grained timers
Authors: Rohit Dube
Venue: ACM SIGOPS Operating Systems Review (2000)

Several network servers and routing and signalling protocols need a large number of events to be scheduled off timers. Some of these applications can withstand a bounded level of inaccuracy in when the timer is scheduled. In this paper we describe a novel mechanism called "scalable hierarchical coarse grained timers" which can handle the scheduling of a large number of events while incurring a minimum of cpu and memory overhead. The techniques presented here were implemented on a commercial IP routing system and are used by the routing stack to damp flapping BGP routes. The paper reflects our experiences in carrying out this implementation and the subsequent performance analysis.
An optimal minimum spanning tree algorithm
Authors: Seth Pettie, Vijaya Ramachandran
Venue: Journal of the ACM (JACM) (2002)

We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to find a minimum spanning tree of a graph with n vertices and m edges that runs in time O(T*(m,n)) where T* is the minimum number of edge-weight comparisons needed to determine the solution. The algorithm is quite simple and can be implemented on a pointer machine.Although our time bound is optimal, the exact function describing it is not known at present. The current best bounds known for T* are T*(m,n) = &Omega;(m) and T*(m,n) = O(m ∙ &alpha;(m,n)), where &alpha; is a certain natural inverse of Ackermann's function.Even under the assumption that T* is superlinear, we show that if the input graph is selected from Gn,m, our algorithm runs in linear time with high probability, regardless of n, m, or the permutation of edge weights. The analysis uses a new martingale for Gn,m similar to the edge-exposure martingale for Gn,p.
Quicken 99 for Windows for Dummies, 1st edition
Authors: Stephen L. Nelson
Venue:  (1998)

:Expedite financial chores and have fun tracking your investments and planning for your future. With easy-to-follow advice from computer guru Stephen Nelson, you'll find yourself dialing up your bank, reconciling your accounts, and calculating mortgage payments in no time. 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
Using Microsoft Project for Windows
Authors: Tim Pyron
Venue:  (1993)

:This essential tutorial/reference for the leading project management software makes learning this complex package simple!Shows readers how to manage a project using planning wizards, reports, the toolbar, and other powerful Project Manager toolsTeaches lessons through a productive task-oriented approachShowcases polished examples
Excel for Windows 95 Quick and Easy, 3rd edition
Authors: Gerald E. Jones
Venue:  (1995)

:Short, informal chapters make this handbook a breeze to read. Learn how to use formulas, create charts, or design your own expense report. Each self-contained lesson covers a fundamental task you can master in minutes. Straightforward instructions explain everything from worksheet layout to geographical mapping. Full-color screen shots are matched with simple instructions. When your screen looks like the one in the book, you've got it right.
The status of helpdesk support
Authors: Chittibabu Govindarajulu
Venue: Communications of the ACM (2002)

What do end users want? A survey of helpdesk services found they're more likely to turn to informal and online sources of support, including friends and vendors.
Delegation of cryptographic servers for capture-resilient devices
Authors: Philip MacKenzie, Michael K. Reiter
Venue: Proceedings of the 8th ACM conference on Computer and Communications Security (2001)

A device that performs private key operations (signatures or decryptions), and whose private key operations are protected by a password, can be immunized against offline dictionary attacks in case of capture by forcing the device to confirm a password guess with a designated remote server in order to perform a private key operation. Recent proposals for achieving this allow untrusted servers and require no server initialization per device. In this paper we extend these proposals to enable dynamic delegation from one server to another; i.e., the device can subsequently use the second server to secure its private key operations. One application is to allow a user who is traveling to a foreign country to temporarily delegate to a server local to that country the ability to confirm password guesses and aid the user's device in performing private key operations, or in the limit, to temporarily delegate this ability to a token in the user's possession. Another application is proactive security for the device's private key, i.e., proactive updates to the device and servers to eliminate any threat of offline password guessing attacks due to previously compromised servers.
Coordinating functional processes with Haskell#
Authors: F. H. Carvalho,  Jr., R. M. F. Lima, R. D. Lins
Venue: Proceedings of the 2002 ACM symposium on Applied computing (2002)

This paper presents Haskell#, a parallel functional language based on coordination. Haskell# supports lazy stream communication and facilities, at coordination level, to the specification of data parallel programs. Haskell# supports a clean and complete, semantic and syntactic, separation between coordination and computation levels of programming, with several benefits to parallel program engineering. The implementation of some well-known applications in Haskell# is presented, demonstrating its expressiveness, allowing for elegant, simple, and concise specification of any static pattern of parallel, concurrent or distributed computation.
FM-QoS: real-time communication using self-synchronizing schedules
Authors: Kay Connelly, Andrew A. Chien
Venue: Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM) (1997)

FM-QoS employs a novel communication architecture based on network feedback to provide predictable communication performance (e.g. deterministic latencies and guaranteed bandwidths) for high speed cluster interconnects. Network feedback is combined with self-synchronizing communication schedules to achieve synchrony in the network interfaces (NIs). Based on this synchrony, the network can be scheduled to provide predictable performance without special network QoS hardware. We describe the key element of the FM-QoS approach, feedback-based synchronization (FBS), which exploits network feedback to synchronize senders. We use Petri nets to characterize the set of self-synchronizing communication schedules for which FBS is effective and to describe the resulting synchronization overhead as a function of the clock drift across the network nodes. Analytic modeling suggests that for clocks of quality 300 ppm (such as found in the Myrinet NI), a synchronization overhead less than 1% of the total communication traffic is achievable --- significantly better than previous software-based schemes and comparable to hardware-intensive approaches such as virtual circuits (e.g. ATM).We have built a prototype of FBS for Myricom s Myrinet network (a 1.28 Gbps cluster network) which demonstrates the viability of the approach by sharing network resources with predictable performance. The prototype, which implements the local node schedule in software, achieves predictable latencies of 23 &micro;s for a single-switch, 8-node network and 2 KB packets. In comparison, the best-effort scheme achieves 104 &micro;s for the same network without FBS. While this ratio of over four to one already demonstrates the viability of the approach, it includes nearly 10 &micro;s of overhead due to the software implementation. For hardware implementations of local node scheduling, and for networks with cascaded switches, these ratios should be much larger factors.
The ISDN Subscriber Loop
Authors: Nick C. Burd
Venue:  (1997)

:This book provides a comprehensive treatment of the operation, standards and technology of the ISDN subscriber loop. The main focus is on basic rate ISDN and its widespread penetration and use in the public telephone network. A practical approach is adopted in the treatment of how the hardware functions are implemented and software requirements for accessing the network and its services. 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
Information access in implicit culture framework
Authors: Enrico Blanzieri, Paolo Giorgini, Sabrina Recla, Paolo Massa
Venue: Proceedings of the tenth international conference on Information and knowledge management (2001)

The goal of a System for Implicit Culture Support (SICS) is to establish an implicit culture phenomenon, namely when the elements of a set behave according to the culture of a generally different group of agents. Earlier work claimed that Implicit Culture support can be seen as a generalization of Collaborative Filtering. In this paper, we recall the concept of Implicit Culture, show how it is useful for automatically exploit tacit knowledge and we present an implementation of a System for Implicit Culture Support.
Local Area High Speed Networks
Authors: Sidnie Feit
Venue:  (2000)

:There is a great deal of change happening in the technology being used for local networks. As Web intranets have driven bandwidth needs through the ceiling, inexpensive Ethernet NICs and switches have come into the market. As a result, many network professionals are interested in evaluating these new technologies for implementation consideration. If you are looking for advice from experts who can help you realistically compare and decide how to use the options before you. Often, books on this subject are too varied in subject matter, attempting to cover to many subjects in the book. This book addresses the topic of Ethernet Networking from a planning perspective to a bit analysis of the Ethernet packets. It explains in detail information in the new network administrator would find it necessary to know.
An Efficiency-Based Management Information System
Authors: Walter W. McMahon
Venue:  (1994)

:To formulate policies for the continuing improvement of a country's education system, and monitor its effectiveness, a modern Management Information System, including a set of published Education Indicators that focuses attention on critical issues, is an essential element. This book presents the rationale, design and data sources for specific data series to be collected and maintained. 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
Getting Started with ArcInfo 8
Authors: Bob Booth
Venue:  (2000)

:Version 8 of the popular ArcInfo GIS software has been completely reengineered-including the user interface, the developer tools, and the introduction of object-oriented data models. This book guides experienced users who are making the switch to version 8 and ArcInfo beginners through the new features of this software, and gets them doing real work. The sample data that comes with ArcInfo 8 is used in the explanations and exercises that illustrate how to use the new desktop interface, organize project data, prepare data for analysis, and present the results of analysis. Bob Booth is a technical writer for ESRI Press. He lives in Redlands, California.
Prefessional SQL Server 2000 Programming
Authors: Robert Vieira
Venue:  (2000)

:This book is a revised follow on from Professional SQL Server 7.0 Programming, to address the new features of this recent release. With a general understanding of programming principles, (eg familiarity with VB, C++, VB Script) Professional SQL Server 2000 Programming provides a comprehensive overview of the new areas of SQL Server, for programmers. There is an in-depth discussion of T-SQL, the query language of Microsoft SQL Server. From basic database design concepts a tutorial explains more advanced topics and specific areas including Stored Procedures and Advanced Queries. Advanced topics - performance tuning, security and a solid description of OLAP, which is built in with SQL Server, are then introduced. The new XML features are explored to provide an understanding of this important area. With over 1,500 pages this book covers the main topics to provide an in-depth understanding of concepts and procedures, so you can get the most out of SQL Server 2000.Author Biography: The author of two Professional SQL Server Programming books, Rob Vieira has been developing since 1980 and has been involved in databases since 1985. Currently a Principal Consultant with STEP Technology's Technology and Innovation group, Rob focuses on system architecture - primarily for data related technologies.
Java for Dummies with CD-Rom, 2nd edition
Authors: Aaron E. Walsh
Venue:  (1997)

:With Java For Dummies, 3rd Edition, it's never been easier to get hooked on Java. With expert advice from Java master Aaron Walsh, you'll quickly and easily figure out how to set up Java applications on your desktop and weave pre-made Java applets, sound/video clips, and special effects into Web magic.
Finite Element Analysis: Theory and Application with Ansys
Authors: Saeed Moaveni
Venue:  (1999)

:In recent years, the use of finite element analysis as a design tool has grown rapidly. Easy to use comprehensive packages such as ANSYS, a general-purpose finite element computer program, have become common tools in the hands of engineers. This book is written to assist engineering students and practicing engineers new to the field of finite element modeling, to gain a clear understanding of the fundamentals of finite element modeling. The text offers insight into the theoretical aspects of finite element analysis and great care has been exercised to avoid overwhelming students with theory. Yet, enough theoretical background is offered to allow individuals to use ANSYS intelligently and effectively. ANSYS is an integral part of this text.