ppxscal/embedding_network huggingface dataset:
The ACE Programmer's Guide: Practical Design Patterns for Network and Systems Programming
Authors: Stephen D. Huston, James C. E. Johnson, Umar Syyid
Venue:  (2003)

If you're designing software and systems that must be portable, flexible, extensible, predictable, reliable, and affordable, this book and the ACE toolkit will enable you to be more effective in all of these areas. Even after spending over a decade developing ACE and using it to build networked software applications, I find that I've learned a great deal from this book, and I'm confident that you will, too. --Douglas C. Schmidt, Inventor of ACE, from the ForewordThis book is a must-have for every ACE programmer. For the beginner, it explains step-by-step how to start using ACE. For the more experienced programmer, it explains in detail the features used daily, and is a perfect reference manual. It would have saved me a lot of time if this book had been available some years ago! --Johnny Willemsen, Senior Software Engineer, Remedy IT, The NetherlandsWith a large C++ code base, we rely on ACE to enable a cross-platform client-server framework for data quality and data integration. ACE has improved our design and smoothed over OS idiosyncrasies without sacrificing performance or flexibility. The combination of online reference materials and printed "big picture" guides is indispensable for us, and The ACE Programmer's Guide earns top-shelf status in my office. --John Lilley, Chief Scientist, DataLever CorporationIn SITA air-ground division, we are one of the major suppliers of communication services to the airline industry. We started using ACE about a year ago and are now moving most of our new communication-related development to it. I can say that using this toolkit can reduce the development and testing time by at least 50% in our type of application. --Jean Millo, Senior Architect, SITAThe ADAPTIVE Communication Environment (ACE) is an open-source software toolkit created to solve network programming challenges. Written in C++, with the help of 30 core developers and 1,700 contributors, this portable middleware has evolved to encapsulate and augment a wide range of native OS capabilities essential to support performance-driven software systems.The ACE Programmer's Guide is a practical, hands-on guide to ACE for C++ programmers building networked applications and next-generation middleware. The book first introduces ACE to beginners. It then explains how you can tap design patterns, frameworks, and ACE to produce effective, easily maintained software systems with less time and effort. The book features discussions of programming aids, interprocess communication (IPC) issues, process and thread management, shared memory, the ACE Service Configurator framework, timer management classes, the ACE Naming Service, and more.The accompanying CD-ROM contains the complete ACE toolkit, including installable kits for Windows, Solaris, and HP-UX; complete reference documentation for all of the ACE classes; and source code for every example in the book. 0201699710B10142003
Mac OS X Jaguar: The Complete Reference, 1 edition
Authors: Jesse Feiler
Venue:  (2002)

:This information-rich resource provides nearly a thousand pages of useful, up-to-date information on the new Apple operating system -- plus hundreds of relevant tips and helpful techniques for maximizing the speed and power of Jaguar. Get a thorough introduction to the OS X operating system and the Aqua interface. Learn about essential system protocols, storage technologies, Internet and Ethernet performance, data protection, and much more. Plus, discover new UNIX tools, security features, and networking capabilities. Whether you're well versed in Mac architecture and terminology, or completely new to the revolutionary Mac way, this potent resource will help you get the most from Mac OS X v10.2 Jaguar.
On x6 + x + a in Characteristic Three
Authors: Antonia W. Bluher
Venue: Designs, Codes and Cryptography (2003)

Let F be a field of characteristic 3 and 0 &ne; a &isin; F. We show that the 10 ways to factor x6 + x + a into two cubics over the algebraic closure F are in natural Galois bijection with the 10 roots of x10 + ax + 1. We use this to (1) prove the two polynomials have the same splitting field; (2) prove that a difference set constructed by Arasu and Player using the polynomial x6 + x + a is isomorphic to a difference set constructed by Dillon using the polynomial x10 + x + a; (3) obtain a natural realization for the accidental isomorphism between the alternating group A6 and the special linear group PSL2(9); and (4) characterize how x6 + x + a factors when F &equals; GF (3m) with m odd. For example, x6 + x + a is irreducible if and only if a can be written as &delta;&minus; 36 + &delta;4 with &delta; &isin; F&times; and Tr(&delta;5) &ne; 0.
Bilinear Quantum Monte Carlo: Expectations and Energy Differences
Authors: Shiwei Zhang, M. H. Kalos
Venue:  (1992)

We propose a bilinear sampling algorithm in Green''s function Monte Carlo for expectation values of operators that do not commute with the Hamiltonian and for differences between eigenvalues of different Hamiltonians. The integreal representations of the Schroedinger equations are transformed into two equations whose solution has the form a(x)t(x,y)b(y), where a and b are the wavefunctions for the two related systems and t(x,y) is a kernal chosen to couple x and y. The Monte Carlo process, with random walkers on the enlarged configuration space x o y, solves these euqations by generating densities whose asymptotic form is the above bilinear distributions. With such a distribution, exact Monte Carlo estimators can be obtained for the expectation values of quantum operators and for energy differences. We present results of these methods applied to several test problems, including a model integral equation, and the hydrogen atom.
Konami Game Boy Advance Combo Official Strategy Guide
Authors: Meston
Venue:  (2002)

:BradyGames'Konami Game Boy Advance Combo Official Strategy Guide provides step-by-step walkthroughs for both games coveredCastlevania: Harmony of Dissonance and Contra Advance: The Alien Wars Ex. Complete weapon coverage and detailed strategies for both adventures. Boss tactics and devastating attack chains and spells. Game secrets revealed for both games! 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
User defined files
Authors: Kirk A. Bailey, Lee Boynton, Paul E. McKenney Gary J. Oliver, Dave Regan
Venue: ACM SIGOPS Operating Systems Review (1981)

In the past, there has been conflict between the application programmer's desire for specialized file types and the system programmer's desire to keep the operating system compact. A solution is proposed that allows a simple file or group of simple files to be encapsulated by a user program. The resulting entity (called a user-defined file) allows arbitrarily complex special-purpose file types to be emulated without continuous modifications to the operating system.
A wireless multiple access control protocol for voice-data integration
Authors: Liang-Seng Koh, M. T. Liu
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

In this paper, a new wireless medium access control protocol, called Mini-Packets Reservation Multiple Access (MPRMA), is proposed for the microcellular wireless environments to support voice and data traffic. Instead of using information packets to contend for reservation, the protocol uses smaller reservation packets for contention. Thus, regular slots can be further divided into smaller slots for sending reservation packets. Furthermore, in order to facilitate subsequent packet transmission, a continuation flag is used in each information packet for requesting further reservation. Comparing to the Packet Reservation Multiple Access (PRMA), it is shown by simulation that MPRMA can support more voice and data users, respectively, in a single traffic type environment. And more importantly, MPRMA is also a better alternative to PRMA for supporting voice-data integration. In order to counter adverse channel conditions, a strategy is also proposed. In addition, MPRMA requires no deadline scheduling at the base stations and minimizes overhead bandwidth on the downlink for sending acknowledgment messages.
Stuff I've seen: a system for personal information retrieval and re-use
Authors: Susan Dumais, Edward Cutrell, JJ Cadiz, Gavin Jancke, Raman Sarin, Daniel C. Robbins
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Most information retrieval technologies are designed to facilitate information discovery. However, much knowledge work involves finding and re-using previously seen information. We describe the design and evaluation of a system, called Stuff I've Seen (SIS), that facilitates information re-use. This is accomplished in two ways. First, the system provides a unified index of information that a person has seen, whether it was seen as email, web page, document, appointment, etc. Second, because the information has been seen before, rich contextual cues can be used in the search interface. The system has been used internally by more than 230 employees. We report on both qualitative and quantitative aspects of system use. Initial findings show that time and people are important retrieval cues. Users find information more easily using SIS, and use other search tools less frequently after installation.
Design and Implementation of a RSVP-Capable Router for Multiple QoS Support
Authors: Wei Shao, Yao Xue Zhang, XiaoChun Wang
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

For the accuracy of the Intserv/RSVP and the scalability of the Diffserv, the two servicemodels which IETF introduced to provide end-to-end quality of service, can complementeach other in many respects and can coexist for a long time. Most of the specifications for"gluing" the Intserv and Diffserv and RSVP together are not standardized as yet, thereforean important challenge for router venders is to design a RSVP-capable router that can support mixed services models at a flexible manner. In this paper, we present the design of an experimental RSVP-Capable router that can provide transport of integrated traffic ofdifferent services. We implement a traffic control block on the data plane and RSVP daemon and management agents on the control plane. At last we present the test results to demonstrate that our router can indeed provide flexible and reliable support for multiple QoS services.
Mobile Agent Rendezvous in a Ring
Authors: Evangelos Kranakis, Nicola Santoro, Cindy Sawchuk, Danny Krizanc
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In the rendezvous search problem, two mobile agentsmust move along the n nodes of a network so as to minimizethe time required to meet or rendezvous. When themobile agents are identical and the network is anonymous,however, the resulting symmetry can make the problem impossibleto solve. Symmetry is typically broken by havingthe mobile agents run either a randomized algorithm or differentdeterministic algorithms. We investigate the use ofidentical tokens to break symmetry so that the two mobileagents can run the same deterministic algorithm. After derivingthe explicit conditions under which identical tokenscanbeused to breaksymmetry onthen node ring, we derivethe lower and upper bounds for the time and memory complexityof the rendezvous search problem with various parametersets. While these results suggest a possible tradeoffbetween the mobile agents' memory and the time complexityof the rendezvous search problem, we prove that this trade-offis limited.
Summation Algorithms on Constrained Reconfigurable Meshes
Authors: Akihiro Matsuura, Akira Nagoya
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Constrained reconfigurable meshes are one type of parallel computing model taking the reconfigurability of hardware into account and also employing a practical assumption on the communication power. This assumption is such that a signal is propagated through a constant number of processing elements (PEs), say (k) PEs, at one unit of time. In this paper, we present algorithms for the fundamental problem of computing the sum of multiple integers. For the problem of summing (n) binary values, we show an optimal \math-time algorithm on a constrained reconfigurable mesh of size \math, where \math. For the problem of summing n d-bit integers, we present an \math-time algorithm on a constrained reconfigurable mesh of size \math, where m is the above value.
Optimal Base Station Placement and Fixed Channel Assignment Applied to Wireless Local Area Network Projects
Authors: R. Rodrigues, G. Mateus, A. Loureiro
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

The project of a wireless local area network (WLAN) has two major issues: determining the best placement of the base stations (BS) and assigning the frequency channels for the stations. The correct BS placement minimizes the number of stations necessary to cover the desired attendance area, reducing installation costs. The channel assignment determines the frequency band to be used by each BS, minimizing interference signal between them and improving the network throughput.This work relates a real experience where we applied the concepts of two outdoor environment classic problems, the optimal base placement problem for indoor environments and the fixed channel assignment problem, to build a wireless local area network in an indoor environment. We describe the hardware we used, the integer linear programming models developed and the results obtained.
Analyzing and Validating Global Fairness of TCP Rate Allocation
Authors: Li Pan, Zhenzan Zhou, Shangjie Gu, Hongwen Zhu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Network flow control is formulated as a global optimization problem of user profit in this paper. A general global optimization flow control model is used to study the global rate allocation characteristic of TCP congestion control mechanism. It is proved that with active queue management TCP rates tend to be allocated to maximize the aggregate of a user utility function Us (called Us fairness) when the network reaches equilibrium. Compared with other fairness criteria, Us fairness is a more general conclusion because it considers the arbitrary topology and heterogeneous RTT case. A typical multi-bottleneck topology is used to validate Us fairness. Simulation results show the global rate allocation of TCP tends to accord with Us fairness in most scenarios.
Validation of Average Error Rate Over Classifiers
Authors: Eric Bax
Venue:  (1997)

We examine methods to estimate the average and variance of test error rates over a set of classifiers. We begin with the process of drawing a classifier at random for each example. Given validation data, the average test error rate can be estimated as if validating a single classifier. Given the test example inputs, the variance can be computed exactly. Next, we consider the process of drawing a classifier at random and using it on all examples. Once again, the expected test error rate can be validated as if validating a single classifier. However, the variance must be estimated by validating all classifers, which yields loose or uncertain bounds.
Bandwidth allocation for interconnecting LAN/MANs and ATM networks
Authors: E. Chan, J. M. Ng, C. S. Lee, M. W. Chan, C. H. Lee
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The use of ATM networks in interconnecting LANs and MANs results in a bandwidth allocation problem due to the connectionless nature of most LAN/MAN traffic. A well known scheme is to use bandwidth advertising in which available bandwidth is broadcast to allow for users contention. This paper presents an enhancement over the basic scheme that will improve the burst loss rate significantly at high network loads.
Fortran 90/95 for Scientists and Engineers, 2 edition
Authors: Stephen J. Chapman
Venue:  (2003)

:Chapman's Fortran for Scientists and Engineers is intended for both first year engineering students and practicing engineers. It simultaneously teaches the Fortran 90/95 programming language, structured programming techniques, and good programming practice. Among its strengths are its concise, clear explanations of Fortran syntax and programming procedures, the inclusion of a wealth of examples and exercises to help students grasp difficult concepts, and its explanations about how to understand code written for older versions of Fortran.
A Market Protocol for Decentralized Task Allocation
Authors: William E. Walsh, Michael P. Wellman
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

We present a decentralized market protocol for allocating tasks among agents that contend for scarce resources. Agents trade tasks and resources at prices determined by an auction protocol. We specify a simple set of bidding policies that, along with the auction mechanism, exhibits desirable convergence properties. The system always reaches quiescence. If the system reaches quiescence below the consumer's reserve price for the high level task, it will be in a solution state. If the system finds a solution it will reach quiescence in a solution state. Experimental evidence supports our conjecture that the system will converge to a solution when one exists and the consumer bids sufficiently high. We describe the system's application to and implementation in an agent-based digital library.
Consequence and Complexity in Infinite-Valued Logic: A Survey
Authors: Vincenzo Marra, Daniele Mundici
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

In general, every logic L comes equipped with a syntax, consisting of a finite set A of symbols, calledthe alphabet, and an inductive definition of whichstrings over A are to be called formula of L;a semantics, telling the meaning of each formula,whence in particular, telling when two formula areequivalent;an algorithmic procedure whereby, given a finite setF of formula, one can in principle obtain all conse-quencesof F.In certain fortunate cases-e.g., in classical logic-formulaup to equivalence form an interesting class of algebraicstructures. The infinite-valued calculus of £ukasiewicz issuch a fortunate case. Our aim in this paper is to reviewsemantic-algorithmic issues for this logic, with particularreference to recent research.
Extended Exponential Broadcasting: A New Broadcasting Scheme for Video-on-Demand Systems
Authors: Renxiang Yan, Huiqun Zhao, Gao Yuan
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Partitioned broadcasting scheme is an efficient scheme for popular videos in video-on-demand system. In a partitioned broadcasting scheme, a video is divided into several segments and each segment is sent over one channel in cycles. In this paper, we propose another partitioned broadcasting scheme for broadcasting popular videos, called Extended Exponential Broadcasting (EEB) scheme. We then analyze the resource requirements for EEB scheme, i.e., the number of server broadcast channels, the client storage space, and the client I/O bandwidth. Also, we found out a relationship between the client's arrival time and its resource requirement. The results show that EEB scheme is compatible with conventional transmission at the user end, and it's easier to implement.
ConCall: An information service for researchers based on EdInfo
Authors: Annika Waern, Mark Tierney, Rudstrom,  ?sa, Jarmo Laaksolahti
Venue:  (1998)

In this paper, we present new types of web information services, where users and information brokers collaborate in creating a user-adaptive information service. Such services impose a novel task on information brokers: they become responsible for maintaining the inference strategies used in user modeling. In return, information brokers obtain more accurate information about user needs, since the adaptivity ensures that user profiles are kept up to date and consistent with what users actually prefer, not only what they say that they prefer. We illustrate the approach by an example application, in which conference calls are collected and distributed to interested readers.
Summability of orthogonal expansions of several variables
Authors: Zhongkai Li, Yuan Xu
Venue: Journal of Approximation Theory (2003)

Summability of spherical h-harmonic expansions with respect to the weight function Πj=1d |xj|2kj (kj ≥ 0) on the unit sphere Sd-1 is studied. The main result characterizes the critical index of summability of the Cesàro (C, δ) means of the h-harmonic expansion; it is proved that the (C, δ;) means of any continuous function converge uniformly in the norm of C(Sd-1) if and only if δ > (d - 2)/2 + Σj=1d kj -- min1 ≤ j ≤ d kj. Moreover, it is shown that for each point not on the great circles defined by the intersection of the coordinate planes and Sd-1, the (C, δ) means of the h-harmonic expansion of a continuous function f converges pointwisely to f if δ > (d - 2)/2. Similar results are established for the orthogonal expansions with respect to the weight functions Πj=1d |xj|2kj (1 - |X|2)µ-1/2 on the unit ball Bd and Πj=1d xjkj-1/2 (1 - |X|1)µ-1/2 on the simplex Td. As a related result, the Cesàro summability of the generalized Gegenbauer expansions associated to the weight function |t|2micro;(1 - t2)λ-1/2 on [-1, 1] is studied, which is of interest in itself.
The D-Code Compiler Front-end GP2D
Authors: K. J Gough
Venue:  (1992)

This document describes the Modula-2 front end gp2d, which produces ASCII files of the intermediate code DCode. Machine dependencies are specified in a configuration file. The document is also the reference for DCode itself. Changes from the previous revision of gp2d are specified in an appendix.
DirectShow(tm) RTP Support for Adaptivity in Networked Multimedia Applications
Authors: Linda S. Cline, John Du, Bernie Keany, K. Lakshman, Christian Maciocco, David M. Putzolu
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

Execution of a collaboration application or a distributed game involves many individual multimedia applications that concurrently generate and consume audio and video streams. As the resource requirements of individual streams change and as streams/applications are started or terminated, the amount of available resources may change dynamically. Networked MultiMedia applications must be willing to adapt to these changes by taking advantage of the fact that they can deliver varying levels of service that are acceptable to users. This paper addresses the problem of adding network and host adaptive capability to DirectShow RTP.DirectShow(tm) is Microsoft's architecture for capture and presentation of multimedia data. DirectShow RTP is a framework that extends the DirectShow architecture, adding support for streaming multimedia data using the RTP protocol. We have extended this framework by adding support for streaming applications which dynamically compensate for varying resource availability on the local host and on the computer networks being used to deliver multimedia data to and from these applications. The lessons learned are useful both to applications and to designers of frameworks used to build such applications.