ppxscal/embedding_network huggingface dataset:
Adaptive rate control and QoS provisioning in direct broadcast satellite networks
Authors: Fatih Alagöz, David Walters, Amina AlRustamani, Branimir Vojcic, Raymond Pickholtz
Venue: Wireless Networks (2001)

Adaptive rate control, if properly employed, is an effective mechanism to sustain acceptable levels of Quality of Service (QoS) in wireless networks where channel and traffic conditions vary over time. In this paper we present an adaptive rate (source and channel) control mechanism, developed as part of an Adaptive Resource Allocation and Management (ARAM) algorithm, for use in Direct Broadcast Satellite (DBS) networks. The algorithm performs admission control and dynamically adjusts traffic source rate and Forward Error Correction (FEC) rate in a co-ordinated fashion to satisfy QoS requirements. To analyze its performance, we have simulated the adaptive algorithm with varying traffic flows and channel conditions. The traffic flow is based on a variable bit rate (VBR) source model that represents Motion Picture Expert Group (MPEG) traffic fluctuations while the DBS channel model is based on a two-state Additive White Gaussian Noise (AWGN) channel. For measures of performance, the simulator quantifies throughput, frame loss due to congestion during transmission as well as QoS variations due to channel (FEC) and source (MPEG compression and data transmission) rate changes. To show the advantage of the adaptive FEC mechanism, we also present the performance results when fixed FEC rates are employed. The results indicate significant throughput and/or quality gains are possible when the FEC/source pairs are adjusted properly in co-ordination with source rate changes.
Handbook of Image Storage and Retrieval Systems, 1st edition
Authors: Marc A. D'Alleyrand
Venue:  (1992)

:The first comprehensive reference work to cover the new and fast-growing field of image storage and retrieval, 'Handbook of Image Storage and Retrieval Systems' covers--with authority--the entire range of issues facing individuals, corporations, and institutions either already using or considering becoming involved with image storage and retrieval. 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
Civilizing the Internet: Global Concerns and Efforts toward Regulation
Authors: Joseph Migga Kizza
Venue:  (1998)

:This book examines current concerns about the Internet and the tools available to address these concerns. Digital crimes such as computer break-in, software piracy, espionage, and child pornography are discussed, as are civil rights issues such as privacy and censorship. Security software and blocking or filtering systems are among the many tools examined.
Knowledge Networking: Creating the Collaborative Company
Authors: David J. Skyrme
Venue:  (1998)

:Knowledge Networking offers a comprehensive overview of the strategic application of knowledge management within global corporations. With an emphasis on good leadership practice, it shows how companies have successfully leveraged the knowledge dispersed and fragmented throughout their companies to deliver organizational benefits and create new opportunities. In a dynamic environment, the book gives guidance on how to innovate quickly and to exploit human networks, wherever they are based.. "Who should read this book: Companies involved in globalization and distributed environments: Directors and Executives seeking to create a business case for revised priorities and approaches: Policy makers involved with enhancing economic competitiveness: Consultants seeking new client opportunities: MBA students on knowledge management courses.
Replication, reconfiguration, and the Argus mail repository
Authors: Mark S. Day
Venue: Proceedings of the 2nd workshop on Making distributed systems work (1986)

The Argus Distributed Mail Repository is being implemented to gain experience with a sizable distributed application, to experiment with techniques for building distributed applications that are highly available and scalable, and to evaluate the programming language Argus when used for such applications.This note briefly describes Argus, the goals for the distributed repository, the project's status, and experience to date with the system.
Growing multi-dimensional self-organizing maps for motion detection
Authors: Udo Seiffert
Venue: Self-Organizing neural networks: recent advances and applications (2001)

The standard Self-Organizing Map consists of a two-dimensional rectangular grid of neurons. For many applications this represents a very good target to reduce the dimensionality of the input data. However, occasionally a multi-dimensional layer, keeping more than two dimensions of teh input data, might be more advantageous. This sometimes also called hypercube topoloy can be considered as the universal case of the standard topoology. This chapter gives an introduction and demonstrates basic properties by means of applications from motion picture analysis.
Optimal robot localization in trees
Authors: Rudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen
Venue: Information and Computation (2002)

The problem of localization, that is, of a robot finding its position on a map, is an important task for autonomous mobile robots. It has applications in numerous areas of robotics ranging from aerial photography to autonomous vehicle exploration. In this paper we present a new strategy LPS (Localize-by-Placement-Separation) for a robot to find its position on a map, where the map is represented as a geometric tree of bounded degree. Our strategy exploits to a high degree the self-similarities that may occur in the environment. We use the framework of competitive analysis to analyze the performance of our strategy. In particular, we show that the distance traveled by the robot is at most O (&radic;n) times longer than the shortest possible route to localize the robot, where n is the number of vertices of the tree. This is a significant improvement over the best known previous bound of O(n2/3). Moreover, since there is a lower bound of &Omega;(&radic;n), our strategy is optimal up to a constant factor. Using the same approach we can also show that the problem of searching for a target in a geometric tree, where the robot is given a map of the tree and the location of the target but does not know its own position, can be solved by a strategy with a competitive ratio of O(&radic;n), which is again optimal up to a constant factor. 2001 Elsevier Science
Automated material handling system traffic control by means of node balancing
Authors: Namdar Bahri, Robert J. Gaskins
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

This paper presents a logistic algorithm that improves traffic conditions in a network-like automated material handling system (AMHS). The algorithm uses a look-ahead procedure and series of nodal parameters in order to balance the flow of traffic to and from load/unload nodes. In doing so, it helps manage, distribute and allocate free AMHS vehicles more efficiently. A simulation model of the algorithm, material control system and the AMHS was developed and tested on various types of semiconductor manufacturing facility layouts. The results of the simulated algorithm demonstrate up to 30% improvement in the AMHS lot delivery time.
TabulaMagica: an integrated approach to manage complex tables
Authors: Horst Silberhorn
Venue: Proceedings of the 2001 ACM Symposium on Document engineering (2001)

Tables are a special part of documents and specific means have been developed to manage them. Step by step, the underlying models to edit and format tables have been improved or supplemented by new ones. These models led to a wide variety of table formats and produced "tabular legacies", making it difficult to edit, use, or modify tables in varying formats. It is even more time-consuming to convert them for various media or to unify or compare tabular information. Our approach to tackle these problems is to integrate different formats. To do so, we recognize the table structure, model the structure and the presentational form and combine both. This way, one can modify the structure, the topology, and the layout of tables simultaneously. Table manipulations may be very complex and hard to understand for the user. In addition, users are accustomed to WYSIWYG environments and want to be able to track their operations by optical control. Therefore, we have developed our WYSIWYG-GUI to work on tables, which we present here, discussing the advantages, limitations and further work to do.
"Plug and test": software agents in virtual environments
Authors: Adelinde M. Uhrmacher, Bernd G. Kullick
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

James- A Java Based agent modeling environment for simulation has been developed to support the compositional construction of test beds for multi-agent systems and their execution in distributed environments. The modeling formalism of James imposes only few constraints on the modeling of agents and facilitates a "plug and test" with pieces of agent code which has been demonstrated in earlier work. However, even entire agents can be run in James as they are run in their run-time environment. The integration of agents as a whole is based on model templates which serve as the agents' interface and representative during the simulation run. The effort which is put into defining model templates for selected agent systems obviates the need for the single agent programmer to get acquainted with the underlying modeling and simulation formalism. Instead the agent programmer can compose the experimental frame and test the programmed agents as they are. The approach is illustrated with agents of the mobile agent system Mole.
NetWare 4 Network Design and Implementation
Authors: Dorothy L. Cady
Venue:  (1996)

:Designing and Implementing NetWare 4 Networks explains how to develop and deploy a Novell NetWare 4.x network from "scratch" and includes the complete Novell outline of how to optimize and organize all phases of the network planning process. All aspects are covered in thorough and exhaustive detail by one of the top experts in the field. In addition, this book provides comprehensive coverage of the design and implementation portion of the CNE 4 exam - required for Novell CNE 4 certification. Material is organized into smaller, more manageable segments, allowing you to learn at your own pace - without being overwhelmed. Designing and Implementing NetWare 4 Networks - your guide to successfully building a Novell 4.x network and preparing for your CNE 4 exam!
Optimal structured feedback policies for ABR flow control using two-timescale SPSA
Authors: Shalabh Bhatnagar, Michael C. Fu, Steven I. Marcus, Pedram J. Fard
Venue: IEEE/ACM Transactions on Networking (TON) (2001)

Optimal structured feedback control policies for rate-based flow control of available bit rate service in asynchronous transfer mode networks are obtained in the presence of information and propagation delays, using a numerically efficient two-timescale simultaneous perturbation stochastic approximation algorithm. Models comprising both a single bottleneck node and a network with multiple bottleneck nodes are considered. A convergence analysis of the algorithm is presented. Numerical experiments demonstrate fast convergence even in the presence of significant delays. We also illustrate performance comparisons with the well-known Explicit Rate Indication for Congestion Avoidance (ERICA) algorithm and describe another algorithm (based on ERICA) that does not require estimating available bandwidth (as in ERICA).
Wide Area Workflow Management: Creating Partnerships for the 21st Century
Authors: Gerold Riempp
Venue:  (1999)

:Although the use of computers and the Internet is now widespread in business, inter and intra-organizational workflow is still predominantly paper based. This volume looks at how business processes can be streamlined and integrated via Wide Area Workflow Management [WAWM], and how - as a result - business relationships can be made more effective and efficient. Covering both technical and managerial issues in the field of Wide Area Workflow Management, this volume provides a much-needed overview for researchers, practitioners, consultants and managers.
The price of anarchy is independent of the network topology
Authors: Tim Roughgarden
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a directed network in which each edge possesses a latency function describing the common latency incurred by all traffic on the edge as a function of the edge congestion. Given a rate of traffic between each pair of nodes in the network, we aspire toward an assignment of traffic to paths in which the sum of all travel times (the total latency) is minimized; however, in many settings network users are free to route their traffic in a selfish manner, without regard to the total latency. We therefore assume that each network user routes its traffic on the minimum-latency path available to it, given the network congestion caused by the other users. In general such a "selfishly motivated" assignment of traffic to paths (a Nash equilibrium) will not minimize the total latency; hence, selfish behavior carries the cost of decreased network performance. We quantify this degradation in network performance via the price of anarchy, defined as the worst possible ratio between the total latency of a Nash equilibrium and of a minimum-latency routing of the traffic.In this paper, we show that the underlying network topology plays no role in the determination of the price of anarchy. Specifically, we show that under weak hypotheses on the class of allowable edge latency functions, the worst-case ratio between the total latency of a Nash equilibrium and of a minimum-latency routing for any multicommodity flow network is achieved by a single-commodity instance on a set of parallel links. In the special case where the class of allowable latency functions includes all of the constant functions, we prove that a network with only two parallel links suffices to achieve the worst-possible ratio. Informally, these results imply that the inefficiency inherent in a flow at Nash equilibrium stems from the inability of selfish users to discern which of two competing routes is superior and not from the topological complexity arising from the diverse intersections of many paths belonging to different commoditie.Our proof techniques also give powerful methods for computing the price of anarchy with respect to an arbitrary class of latency functions. We apply these methods to function classes that have been well studied in the literature (such as degree-bounded polynomials and functions of the form $\ell(x) = (u&mdash;x)&mdash;1} that are used to model edges with capacity u), thereby achieving the first tight analyses of the price of anarchy for significant classes of latency functions outside the class of linear functions.
Intranets Unleashed
Authors: David L. Garrett
Venue:  (1996)

:Intranets, internal Web sites that can be accessed within a company's firewalls, are quickly becoming the status quo in business. This book shows IS managers and personnel how to effectively set up and run large or small Intranets. Everything from design to security is discussed.Readers learn how to develop Intranets for corporate useCD-ROM contains source code and valuable utilities
Directory of Internet Sources for Health Professionals, 1st edition
Authors: Attrices Dean Griffin
Venue:  (1999)

:This compendium is a directory of Web sites and other online resources categorized according to major medical and health disciplines. Each entry cites the URL, sponsor, and purpose followed by an annotation of timesaving and relevant site and referral information.This resource is organized into two sections. The first section is an introduction and overview of the reference contents, including descriptions of online data sources, search and retrieval tips. The second section lists the URLs and supplemental resources for a wide variety of medical and allied health online resources. An index by topic and a cross-reference index allow readers to quickly and easily locate Web sites of interest.FEATURES AND BENEFITSAnnotated entries provide supplementary links to more than 1,500 related sites, plus tips and keywords.Provides comprehensive listings required by medical researchers, health professionals, educators and studentsQuarterly updates of new sites available online 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
ODGen: a prototype reverse engineering tool for Ada
Authors: Kelly Morrison
Venue: Proceedings of the 30th annual Southeast regional conference (1992)

The problem of keeping documentation current with an evolving software system has always been a major concern in software engineering, especially as deriving an understanding of a program's logic may represent as much as 90% of the cost of maintenance. Reverse engineering, the processing of source code to extract higher levels of abstraction, promises to be a viable solution to this problem as tools may be developed to automatically extract design information from a software system. This paper describes the design and development of one such tool: the Object Diagram Generator (ODGen) developed at Auburn University for automatically generating graphical documentation for Ada programs.
Using Microsoft FrontPage 98, 1st edition
Authors: Steve Banick
Venue:  (1997)

:Using Microsoft FrontPage 98 is a comprehensive tutorial/ reference for FrontPage 98 that covers installation, setup, and creating sophisticated Web sites using HTML, Dynamic HTML, and Java applets As part of the redesigned Using series, Using Microsoft FrontPage 98 contains extensive cross references, a bigger index, and stronger tools to help the end user learn faster Includes information about the FrontPage 98 SDK which enables Web designers to create custom WebBots, Web page templates, and more This is book is completely new, written from scratch, and shares no content or structure with the current User-Friendly Using FrontPage 97Using FrontPage 98 is a concise tutorial reference that quickly teaches new users the major capabilities of FrontPage 98Enables users to completely develop, create, and publish a full web siteUsing FrontPage 98 gets the user up to speed quickly by presenting well organized information that is direct and to the point, without any "fluff"
Star Wars: Episode 1 Racer: Prima's Official Strategy Guide
Authors: Alex Neuse
Venue:  (2000)

:Secrets to unlocking hidden Podracers and bonus coursesDetailed racecourse mapsfrom the sands of Tatooine to the frozen lakes of Ando PrimeTips to help you win every raceMultiplayer tactics and strategiesAlso covers PC 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
Microsoft Access 2000 Developer's Guide with Cdrom, 1st edition
Authors: Edward Jones
Venue:  (1999)

:This developer's indispensable guide shows readers everything they need to know to develop high-powered, full-featured applications with Access 2000. The CD-ROM contains the source code and databases for all the examples in the book, plus samples for client management and an assortment of third-party utilities.
Teach Yourself PhotoShop 4 in 24 Hours, 1st edition
Authors: Carla Rose
Venue:  (1997)

:Combining professional insight with easy-to-follow, step-by-step tutorials, this guide covers all Photoshop essentials. You'll explore fundamental Photoshop functions, including cropping, re-sizing, and scaling. You'll cover basics like adjusting colors and using paintbrushes, and advanced topics including layers, masks, paths, and filters. Discover Photoshop plug-ins and add-ons - where to get them, how to install them, and what they can do. Using a task-based approach, you'll learn the essentials of Photoshop at your own pace.
Finding the shortest boundary guard of a simple polygon
Authors: Bor-Kuan Lu, Fang-Rong Hsu, Chuan Yi Tang
Venue: Theoretical Computer Science (2001)

There are many different kinds of guards in a simple polygon that have been proposed and discussed. In this paper, we consider a new type of guard, boundary guard, which is a guard capable of moving along a boundary of a polygon and every interior point of the polygon can be seen by the mobile guard. We propose an algorithm to 1nd the shortest boundary guard of a simple polygon P in O(n log n) time, where n is the number of vertices of P.
Information-Theoretic Aspects of Neural Networks, 1st edition
Authors: Perambur S. Neelakanta
Venue:  (1998)

:Information-Theoretic Aspects of Neural Networks cohesively explores this burgeoning discipline. Information-Theoretic Aspects of Neural Networks acts as an exceptional resource for engineers, scientists, and computer scientists working in the field of artificial neural networks as well as biologists applying the concepts of communication theory and protocols to the functioning of the brain.
Upgrading and Repairing PCs Linux Edition w/ CD-ROM
Authors: Scott Mueller
Venue:  (1999)

:Upgrading and Repairing PCs, Linux Edition addresses Linux-specific hardware issues that do not arise with Windows or DOS. Based on Upgrading and Repairing PCs, 11th Edition, this book covers Linux information such as system requirements, installation and setup, drive partitioning, kernel parameters, memory, and compatibility between Linux and components and components with each other. While Windows has a slick installation that automatically determines most of the hardware in a PC, Linux users still must struggle to identify, configure, and install the hardware in their PCs. This book is an essential reference to understand how your PC hardware works, how it interacts with Linux, and how to troubleshoot, repair, and upgrade the components in a Linux system. The Linux General Store hosts an Internet site for information, discussion and questions related to the book CD-ROM contains a version of Linux, a Special Edition of Partition Magic, various Linux applications, and more
Policy algebras for access control: the propositional case
Authors: Duminda Wijesekera, Sushil Jajodia
Venue: Proceedings of the 8th ACM conference on Computer and Communications Security (2001)

Although different organizations operate under different requirements for protection of their data, increasingly there is a need for organizations to connect their computing resources together to achieve common goals. The fundamental problem addressed in this paper is to capture the algebra used in composing access control policies of collaborating organizations. In doing so, we seek a framework that can be viewed at many levels of abstraction (such as abstract vs. explicit or propositional vs. predicate), independent of implementation mechanisms and environments, and is expressive enough to model existing practices of policy compositions.Propositional version consists of a syntax where policies are viewed as abstract symbols, and semantics consists of authorization state transformers, where an authorization state is a collection of (subject, object, access set) triples and a set of propositions satisfied by them. Syntactic rules are provided to simplify policy expressions without knowing their semantics, thereby supporting algebraic manipulations of uninterpreted policies. Because our algebra is at an abstract level, it can model any policy independent of the language that is used to implement it. We show how to reason about completeness, consistency, unambiguity and of abstractly specified policies and their semantic equivalence.