ppxscal/embedding_network huggingface dataset:
A medium access control protocol for real time video over high latency satellite channels
Authors: Dennis Connors, Bo Ryu, Gregory J. Pottie, Son Dao
Venue: Mobile Networks and Applications (2002)

We report the results of extensive simulation work on a new satellite medium access control (MAC) protocol for medium quality interactive video. This MAC protocol uses combined random access/demand assigned multiple access (RA/DAMA). The underlying multiple access physical layer is time division multiple access (TDMA). The RA/DAMA MAC seeks to adaptively minimize the delay of each network layer (nl) packet that arrives to the output queue by transmitting packets on either a collision free demand assigned channel or on a collision possible random access channel. Combined with this dual channel transmission method is a new technique for acquiring demand assigned bandwidth, called a packet flow rate metric (PFRM). This metric seeks to track the slow time behavior of video traffic, leading to a significant reduction in the amount of DAMA signaling. All simulations were conducted using SMACS, the Satellite Medium Access Control Simulator [4], a simulation tool built into ns-2.0 (network simulator version 2) [10]. This simulation tool allowed us to evaluate our MAC protocol using an actual 2 hour long video trace rather than a parametric video traffic generator. Our results show that if light packet loss is tolerable (less than 3%), then significantly lower delays and higher link utilization can be achieved.
Microsoft Commerce Solutions, 1st edition
Authors: Anc Staff Micro Modeling Associates, Micro Modeling Associates Inc Staff
Venue:  (1999)

:Webmasters, IT managers, and other Internet business developers get the technical information and practical strategies they need to evaluate, plan, and deploy electronic commerce solutions. This book presents a business-focused, multi-product approach to development, explaining how to combine Microsoft's Office, BackOffice, Internet and visual development technologies into an integrated Web-commerce system.
An intelligent approach to handling imperfect information in concept-based natural language queries
Authors: Vesper Owei
Venue: ACM Transactions on Information Systems (TOIS) (2002)

Missing information, imprecision, inconsistency, vagueness, uncertainty, and ignorance abound in information systems. Such imperfection is a fact of life in database systems. Although these problems are widely studied in relational database systems, this is not the case in conceptual query systems. And yet, concept-based query languages have been proposed and some are already commercial products. It is therefore imperative to study these problems in concept-based query languages, with a view to prescribing formal approaches to dealing with the problems. In this article, we have done just that for a concept-based natural language query system that we developed. A methodology for handling and resolving each type of imperfection is developed. The proposed approaches are automated as much as possible, with the user mainly serving an assistive function.
Commerce Server 2000, 1st edition
Authors: Brad Wist, Max Ramsay
Venue:  (2001)

:Microsoft's Commerce Server 2000 is a member of the .NETEnterprise Server family. Designed for both business-to-business and business-to-consumer sites, it offers a comprehensive yet flexible application framework for site development and implementation. From experienced Web developers, Commerce Server 2000 is a business-oriented resource for both programmers and administrators who want to quickly bring to market a world-class site that is personalized, scalable, available, easy to maintain, and provides a wealth of information for managerial decision-making. Divided into three major sections, Commerce Server 2000 begins with fundamentals such as: Installation and configuration The Commerce Server Manager (MMC snap-in) Sample 'Solution Sites' to use as a starting point An introduction to XML With emphasis on a planning-implementation-customization strategy, the authors move into planning and development: Planning the site Building the site The product catalog Customer relationship management with CS's Profiling System The Content Selection Framework Order management Transaction Pipelines (business processes) Customization and optimization Once the site is built, the work is only partially done. Management and administration are significant tasks-which are addressed in this next section, including: The Business Desk Creating and managing campaigns for advertisements, discounts, and direct mail Site deployment Business analytics Security Microsoft Wallet Commerce Server 2000 is jam-packed with examples, practical tips, and the kind of guidance needed when building a commerce site - while explaining not only the 'how' but also the 'why' in taking a given approach to accomplish a task.
QUORUM: prepaid internet at the University of Zululand
Authors: Soren Aalto
Venue: Linux Journal (2002)

When net access is expensive, you can't let web surfing break the budget. Here's a system to enforce fair quotas for all.
K-clustering in wireless ad hoc networks
Authors: Yaacov Fernandess, Dahlia Malkhi
Venue: Proceedings of the second ACM international workshop on Principles of mobile computing (2002)

Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Clustering is commonly used in order to limit the amount of routing information stored and maintained at individual hosts. A k-clustering is a framework in which the wireless network is divided into non-overlapping sub networks, also referred to as clusters, and where every two wireless hosts in a sub network are at most k hops from each other. The algorithmic complexity of k-clustering is known to be NP-Complete for simple undirected graphs. For the special family of graphs that represent ad hoc wireless networks, modeled as unit disk graphs, we introduce a two phase distributed polynomial time and message complexity approximation solution with O(k) worst case ratio over the optimal solution. The first phase constructs a spanning tree of the network and the second phase then partitions the spanning tree into subtrees with bounded diameters.
The ABC's of Quattro Pro for Windows
Authors: Alan Simpson, Douglas J. Wolf
Venue:  (1998)

:This book is written for those who are not familiar with computers, computer terminology or other spreadsheets. It is designed so that the user can start to use Quattro Pro immediately without having to wade through a 700 page manual of details and technical information. The book is written in scenario style, bringing in the different elements of the program as you would normally seek to use them. The first four chapters offer a step-by-step approach, in plain English, that introduces you to Quattro Pro capabilities quickly and easily. Later chapters discuss ways to edit entries, manipulate data, and handle blocks of data elegantly and easily, as well as how to graph and print data and use them in a database.
Scene assembly for large scale urban reconstructions
Authors: P. A. Flack, J. Willmott, S. P. Browne, D. B. Arnold, A. M. Day
Venue: Proceedings of the 2001 conference on Virtual reality, archeology, and cultural heritage (2001)

Reconstructing large areas of historic cities involves assembling a scene from a combination of knowledge of areas that no longer exist and known monuments that have survived and can still be (at least partially) observed and measured. In many cases little detail is known for such areas although it can be anticipated that buildings in some specific generic styles would be typical of the time and place. At UEA considerable effort has been put into creating a Scene Assembler package for the CHARISMATIC project which brings together individually designed objects from detailed modelling packages such as 3DStudioMax and combines these with other more generic building prototypes. These objects are then laid out using a number of extremely powerful and user friendly operations within a landscape and sky dome. This process makes it easy and quick to put together a complete city scene, which is accurate enough, historically, to give a feel for what the area would have been like. The models constructed using the tools are intended to be used as backdrops for reconstructing historic populated events. This paper describes the stages in defining such models and the various tools available to speed up the process.
A processor-coprocessor architecture for high end video applications
Authors: Elmar Maas, Dirk Herrmann, Rolf Ernst, Peter Rüffer, Sieghard Hasenzahl, Martin Seitz
Venue: Readings in hardware/software co-design (2001)

High end video applications are still implemented in hardware consisting of many components. Integration of these components on one IC is difficult as they are typically low volume products and often customization is also required, e.g. in the studio applications. This is easier on the board level than on an integrated system. Using hardware parameters for customization can partly overcome the flexibility problem with additional hardware costs. Low cost can be obtained by a change in the architecture paradigm to a processor system. This, however, requires careful design space exploration since the performance target is beyond current DSP processors while at the same time flexibility is required. The paper presents the application of high level synthesis [1] and novel Hardware-Software Co-Synthesis tools to design space exploration. It is shown that completely different algorithms can be mapped to the same target system at much a lower cost than the current approaches.
Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
Authors: Alexander Russell, Michael Saks, David Zuckerman
Venue: SIAM Journal on Computing (2002)

Collective coin-flipping is the problem of producing common random bits in a distributed computing environment with adversarial faults. We consider the perfect information model: all communication is by broadcast and corrupt players are computationally unbounded. Protocols in this model may involve many asynchronous rounds. We assume that honest players communicate only uniformly random bits. We demonstrate that any n-player coin-flipping protocol that is resilient against corrupt coalitions of linear size must use either at least [1/2 - o(1)]log* n communication rounds or at least [log(2k-1) n]1-o(1) communication bits in the kth round, where log(j) denotes the logarithm iterated j times. In particular, protocols using one bit per round require [1/2 - o(1)]log* n rounds. These bounds also apply to the leader election problem. The primary component of this result is a new bound on the influence of random sets of variables on Boolean functions. Finally, in the one-round case, using other methods we prove a new bound on the influence of sets of variables of size $\beta n$ for $\beta > 1/3$.
A temporal logic view of paradigm models
Authors: Juan Carlos Augusto, Rodolfo Sab'as G'omez
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

Software systems have evolved from monolithic programs to systems constructed from parallel, cooperative components, as can be currently found in object-oriented applications. Although powerful, these cooperative systems are also more difficult to verify.We show it is possible to automatically translate a PARADIGM specification to a Propositional Linear Temporal Logic based program. This has several interesting consequences: a) on one hand we allow a more declarative view of PARADIGM specifications, b) the resulting translation is an executable specification and c) as we show in this work it can also be useful on verifying correctness properties by automatic means. We think this will contribute to enhance the understanding, usability and further development of PARADIGM, and related methods like SOCCA, within both the Software Engineering and the Knowledge Engineering communities.
The Complete Idiot's Guide to Quicken 2000
Authors: Stephen O'Brien, Stephen O'Brein
Venue:  (1999)

:Do you go scrambling through your sock drawer for receipts every April? Have you dug holes in your yard to find buried treasure around Christmastime and birthdays? Did you open your own Mom and Pop's diner and realize calculators are harder to use than egg beaters? Or, have you realized that your retirement plan might not become fruitful until you're in your 80s? Get your act together and pick up The Complete Idiot's Guide to Quicken 2000-the tool you need to organize your finances and taxes.
Microsoft Office V.10 for MACs for Dummies, 1st edition
Authors: Tom Negrino
Venue:  (2002)

:Covers Word, Entourage, Excel, and PowerPointDiscover Office tools for workplace collaboration and document sharingYour fun and easy guide to all four programs in Office v. X Office v. X gives you loads of Mac OS X-powered tools. But how do you get a handle on those zillions of menus and options? Don't worry! In this friendly guide, Tom Negrino walks you through the basics of word processing, e-mail, personal information management, spreadsheets, and presentations  and makes it easy to jump right in and get stuff done.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 funGet smart! @ www.dummies.comFind listings of all our booksCreate your own personalized book with Hungry Minds a la CarteSign up for daily eTips at www.dummiesdaily.comAuthor Biography: Tom Negrino is a contributing editor at Macworld magazine and the author of many computer books, including Microsoft Office 2001 For Macs For Dummies.
Multimatroids I. Coverings by Independent Sets
Authors: André Bouchet
Venue: SIAM Journal on Discrete Mathematics (1997)

Multimatroids are combinatorial structures that generalize matroids and arise in the study of Eulerian graphs. We prove, by means of an efficient algorithm, a covering theorem for multimatroids. This theorem extends Edmonds' covering theorem for matroids. It also generalizes a theorem of Jackson on the Euler tours of a 4-regular graph.
Practical Intranet Security: Overview of the State of the Art and Available Technologies
Authors: Paul Ashley, Mark Vandenwauver
Venue:  (1999)

:Practical Intranet Security focuses on the various ways in which an intranet can be violated and gives a thorough review of the technologies that can be used by an organization to secure its intranet. This book is different from other network security books in that its aim is to identify how to secure an organization's intranet. Previously books have concentrated on the Internet, with issues relating to securing intranets often neglected. However the potential risk to business and the case by which intranets can be violated is often far greater than via the Internet. The aim is that network administrators and managers can get the information that they require to make informed choices on strategy and solutions for securing their own intranets.
Graph Drawing: Algorithms for the Visualization of Graphs, 1st edition
Authors: Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis
Venue:  (1998)

:This book is designed to describe fundamental algorithmic techniques for constructing drawings of graphs. Suitable as a book or reference manual, its chapters offer an accurate, accessible reflection of the rapidly expanding field of graph drawing.
Singular Polynomials of Generalized Kasteleyn Matrices
Authors: Nicolau C. Saldanha
Venue: Journal of Algebraic Combinatorics: An International Journal (2002)

Kasteleyn counted the number of domino tilings of a rectangle by considering a mutation of the adjacency matrix&colon; a Kasteleyn matrix K. In this paper we present a generalization of Kasteleyn matrices and a combinatorial interpretation for the coefficients of the characteristic polynomial of KK&ast; (which we call the singular polynomial), where K is a generalized Kasteleyn matrix for a planar bipartite graph. We also present a q-version of these ideas and a few results concerning tilings of special regions such as rectangles.
The Art of Final Fantasy IX
Authors: Dan Birlew
Venue:  (2000)

:BradyGames The Art of FINAL FANTASY IX features an inside look at the stunning art from FINAL FANTASY IX. The book includes rarely-seen concept art and detailed pencil sketches, an immense collection of character art, airship and vehicle designs, monsters and unique weapon images, and full-page scenes from the most beautiful cinemas in video game history. Entertaining and informative commentary is provided as well as anecdotal captions relevant to story and events of FINAL FANTASY IX.
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
Authors: Christian Scheideler, Berthold Vöcking
Venue: SIAM Journal on Computing (2000)

We investigate how static store-and-forward routing algorithms can be transformed into efficient dynamic algorithms, that is, how algorithms that have been designed for the case that all packets are injected at the same time can be adapted to more realistic scenarios in which packets are continuously injected into the network. Besides describing specific transformations for well-known static routing algorithms, we present a black box transformation scheme applicable to every static, oblivious routing algorithm. We analyze the performance of our protocols under a stochastic and an adversarial model of packet injections.One result of our specific transformations is the first dynamic routing algorithm for leveled networks that is stable for arbitrary admissible injection rates and that works with packet buffers of size depending solely on the injection rate and the node degree, but not on the size of the network. Furthermore, we prove strong delay bounds for the packets. Our results imply, for example, that a throughput of 99% can be achieved on an n-input butterfly network with buffers of constant size while each packet is delivered in time O(log n), with high probability.Our black box transformation ensures that if the static algorithm is pure (i.e., no extra packets apart from the original packets are routed), its dynamic variant is stable up to a maximum possible injection rate. Furthermore, in the stochastic model, the routing time of a packet depends on local parameters such as the length of its routing path, rather than on the maximum possible path length, even if the static algorithm chosen for the transformation does not provide this locality feature and is not pure. In the adversarial model, the delay bound of the packets is closely related to the time bound given for the static algorithm.
Computer Organization, 5 edition
Authors: V. Carl Hamacher, Zvonko G. Vranesic, Safwat G. Zaky
Venue:  (2001)

*A comprehensive overview of hardware and software issues make this a "must-have" for electrical and computer engineers *Contains new material on RISC processors, performance analysis, multiprocessors and memory systems *New two-color design and illustrations illuminate the textTable of contents1 Basic Structure of Computers2 Machine Instructions and Programs3 ARM, Motorola, and Intel Instruction Sets4 Input/Output Organization5 The Memory System6 Arithmetic7 Basic Processing Unit8 Pipelining 9 Embedded Systems10 Computer Peripherals11 Processor Families12 Large Computer SystemsAppendix A Logic CircuitsAppendix B ARM Instruction SetAppendix C Motorola 68000Instruction SetAppendix D Intel IA-32 Instruction Set Appendix E Character Codes and Number Conversion
SQL Server 7: A Beginner's Guide, 1st edition
Authors: Dusan Petkovic
Venue:  (1999)

:Create, query, and manage high-performance SQL Server 7 databases with the hot new release of this scalable database management system. SQL Server 7: A Beginner's Guide explains enterprise database fundamentals and shows you how to take advantage of the new features of SQL Server 7, such as improved space management, new data transformation services, and data warehousing. From installation to query optimization to security to data warehousing, this hands-on guide provides everything you need to know to get up and running smoothly on SQL Server 7.
Juniper Networking: A Junos Guide
Authors: Thomas M. Thomas, Doris E. Pavlichek, Lawrence H. Dwyer, Rajah Chowbay, Wayne W. Downing, James Sonderegger
Venue:  (2002)

Juniper Networks® Reference Guide is the ideal implementation guide to the Juniper Networks® family of Internet routers and the network operating system JUNOS™. With concise explanations of internetworking theory and detailed examples, this book teaches readers how to configure, deploy, and maintain their Juniper Networks routing solutions. Experienced JUNOS engineers will benefit from the tested configuration examples, which they can apply to their own networks. Those new to the JUNOS Internet software will find everything they need to pass the Juniper Networks JNCIS™ certification exam.Essential topics covered include: An introduction to the core technologies of Juniper Networks, including their role in Carrier Class routing System configuration, from the installation of a Juniper Networks router to the functional inclusion of network management and security Interface and routing protocol configurations, including internal routing protocols such as OSPF and IS-IS, as well as extensive discussions of external routing protocols like BGP Explorations of advanced router operation and configuration, covering routing policies, MPLS, VPNs, and multicastJuniper Networks® Reference Guide also contains information about the entire range of products and technologies behind key Internet building block technologies, giving readers an inside look not found in other books. Whether you are studying to become a JNCIE, need to maintain a multivendor routing solution, or are simply curious about Cisco System's competitor, this book is your key to the world of Juniper Networks. 0201775921B09262002
Microsoft Visual J++ 6.0 Developer's Workshop with Cdrom, 1st edition
Authors: Shannon Dunn, D. Shannon
Venue:  (1998)

:Microsoft Visual J++ 6.0 Developer's Workshop delivers the tools and mentoring you need to build more-powerful Windows solutions - faster. Dive into version 6.0 enhancements, using Windows Foundation Classes (WFC) to bring Win32 functionality to Java. As you move from basic to advanced topics, you'll find smart solutions to typical "how-to" questions - learning how to build everything from an ActiveX control to a COM-server - driven application.
Soft Computing and Intelligent Systems: Theory and Applications, 1st edition
Authors: Naresh K. Sinha, Madan M. Gupta
Venue:  (1999)

:Invited researchers from around the world discuss the principles of and their experience with soft computing, an emerging discipline rooted in a group of technologies that aim to exploit the tolerance for imprecision and uncertainty in achieving solutions to complex problems. Within the broad categories of foundations, theory, implications and applications, and future prospects, the 25 studies consider such topics as parallel and distributed architectures and biologically inspired computing, neural networks for identifying nonlinear systems, the knowledge- based adaptation of a neurofuzzy model in the predictive control of a heat exchanger, and toward intelligent machines. The field is so new that the bibliography claims comprehension.