ppxscal/embedding_network huggingface dataset:
A Survey of Web Caching Schemes for the Internet
Authors: Jia Wang
Venue:  (1999)

The World Wide Web can be considered as a large distributed information system that provides access to shared data objects. As one of the most popular applications currently running on the Internet, the size of World Wide Web is of an exponential growth, which results in network congestion and server overloading. Web caching has been recognized as one of the effective schemes to alleviate the server bottleneck and reduce the network traffic, thereby minimize the user access latencies. In this paper, we first discribe the elements of a Web caching system and its desirable properties. Then, we survey the state-of-art techniques which have been used in Web caching systems. Finally, we discuss the research frontier in Web caching.
Compensating for Bias in the SDM Fast Activation Mechanism
Authors: Roland Karlsson
Venue:  (1996)

The Kanerva Sparse Distributed Memory (SDM) is a mechanism for implementing a memory with a huge address space. The physical memory consists of substantially fewer locations than the virtual address space. The plain Kanerva SDM memory assumes address and data to be random bit vectors with equal probability for 0 and 1. To compensate for any bias in address or data, several more or less elaborate methods can be used. In this paper we describe one simple method for achieving this compensation within the framework of the ``Fast activation Mechanism'''' for SDM.
The Effect of Average Parallelism and CPU-I/O Overlap on Application Speedup
Authors: Luca Diaconescu, Shikharesh Majumdar
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Parallelization of I/O using multiple disk drives is warranted for achieving high performance on systems running CPU and I/O intensive applications. This paper is concerned with the characterization of applications with parallel I/O and the derivation of analytic bounds on speedup. New Characteristics for capturing parallelism in I/O are introduced. These characteristics are used in conjunction with other characteristics available in the literature for the derivation of the bounds. Both parallelism in CPU and I/O operations in applications as well as the degree of overlap between CPU and I/O are observed to have a strong impact on speedup.
Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem
Authors: Ming Kao, H J Reif, R S Tate
Venue:  (1992)

Searching for a goal is a central and extensively studied problem in computer science. In classical searching problems, the cost of a search function is simply the number of queries made to an oracle that knows the position of the goal. In many robotics problems, as well as in problems from other areas, we want to charge a cost proportional to the distance between queries (e.g., the time required to travel between two query points). With this cost function in mind, the abstract problem known as the $w$-lane cow-path problem was designed. There are known optimal deterministic algorithms for the cow-path problem, and we give the first randomized algorithms in this paper. We show that our algorithm is optimal for two paths ($w=2$), and give evidence that it is indeed optimal for larger values of $w$. The randomized algorithms give expected performance that is almost twice as good as is possible with a deterministic algorithm.
An experiment using registers for fast message-based interprocess communication
Authors: David R. Cheriton
Venue: ACM SIGOPS Operating Systems Review (1984)

Message interprocess communication has appeal for structuring operating systems but has the reputation of being slow. Register architectures have advantages for fast sequential execution but are considered to increase context-switching costs. This note describes an experiment in which registers are used for transmitting messages in the V kernel, resulting in a factor of 3 improvement in elapsed time for local message transactions and a factor of 6 reduction in kernel time for the associated kernel operations.
A Fast and Scalable IP Lookup Scheme for High-Speed Networks
Authors: Wen-Shyen E. Chen, Chung-Ting Justine Tsai
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

The past few years have witnessed the advent of the World Wide Web and the emergence of multimedia applications over the Internet. With the amount of the traffic doubling every three months and the introduction of the LAN equipment of ever increasing speeds from 100Mbps to Gbps, high-speed routers that process millions or 10's of millions of packets per second are needed to meet the future demands. One of the key design issues for the next generation IP routers is the IP lookup mechanism. For each incoming IP packet, the IP routing requires to perform a longest prefix matching on the address lookup in order to determine the packet's next hop. Currently, the process is done in software and has become a major bottleneck of the router performance.In this paper, we propose a high-speed IP lookup scheme for the Best Matching Prefix (BMP) by using {\em forwarding tables} consisting of Prefix Information Tables (PITs) and Lookup Tables (LTs) that provide guidelines for efficient search. The scheme scales very well as the sizes of the address and the routing table increase. For IP lookup in IPv4, the scheme needs 1 memory access in the best case, and 2 memory accesses plus one hash in the worst case to locate the BMP, if one exists. It requires only 540 KBytes to 630 KBytes of memory space when about 42,000 routing tables entries in the backbone are logged for simulation. When 50ns DRAM is used for the forwarding tables, the scheme offers lookup speed of 10 millions packets per second (10 MPPS). The lookup speed can be improved linearly with the speedup of the type of memory used. Further, it does not need complex compression mechanisms to reduce the memory requirement. Its operation is simple, lending itself for easy hardware implementation and therefore is a good candidate to be used in the next generation IP routers.
Fibonacci Decision Diagrams and Spectral Fibonacci Decision Diagrams
Authors: Radomir S. Stankovic, Milena Stankovic, Jaakko Astola, Karen Egiazarian
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

In this paper, we define the Fibonacci decision diagrams (FibDDs) permitting representation of functions defined in a number of points different from N=2{n} by decision diagrams consisting of nodes with two outgoing edges.We show the relationships between the FibDDs and the contracted Fibonacci codes. Then, we defined the Spectral Fibonacci DDs (FibSTDDs) in terms of the generalized Fibonacci transforms. This broad family of transforms provides a corresponding family of FibSTDDs. These DDs allow compact representations of functions with simple Fibonacci spectra. Such representations may be useful in various tasks of signal processing, including image processing, and systems design, where the generalized Fibonacci transforms have been efficiently using.
The Internet and Other Networks: Utilization Rates and Their Implications
Authors: Odlyzko Andrew
Venue:  (1999)

Costs of communications networks are determined by the maximal capacities of those networks. On the other hand, the traffic those networks carry depends on how heavily those networks are used. Hence utilization rates and utilization patterns determine the costs of providing services, and therefore are crucial in understanding the economics of communications networks. A comparison of utilization rates and costs of various networks helps disprove many popular myths about the Internet. Although packet networks are often extolled for the efficiency of their transport, it often costs more to send data over internal corporate networks than using modems on the switched voice network. Packet networks are growing explosively not because they utilize underlying transport capacity more efficiently, but because they provide much greater flexibility in offering new services. Study of utilization patterns shows there are large opportunities for increasing the efficiency of data transport and making the Internet less expensive and more useful. On the other hand, many popular techniques, such as some Quality of Service measures and ATM, are likely to be of limited usefulness.
An Interactive Version of the PL/C Compiler
Authors: Richard W. Conway, Charles G. Moore,  III, Steven L. Worona
Venue:  (1977)

The paper discusses a conceptual model of a terminal as an "internal procedure" in an interactive system for a block-structured language. A specific implementation is described, following this model, for the Cornell PL/I compiler.
A Description of a Universal Assembler
Authors: Forrest F. Bishop
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

An "Active Cell Aggregate", or "Shape Shifter", is an aggregation of similar, space-filling polyhedral machines, preferably built by molecular nanotechnology methods. "Active" means each machine, or "Active Cell", has the capacity to exchange power and signals with other similar machines, and to interact with the external environment. A robot constructed in this manner can have a very large and detailed envelope of motion. By incorporating simple manipulators onto the various faces of the polyhedron, a universal assembler, or "Overtool", may be possible, for molecular, mesoscopic, and macroscopic assembly.
Integration of a Legacy Application into a TINA Retailer Environment
Authors: Chr. Egelhaaf, P. Schoo, A. Zisowsky
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Providers of telecommunications services will have a need in the future to integrate a variety of applications into their service portfolios. This paper describes experiences gained in integrating an existing application with telecommunications service management to present it as a telecommunications service. It further reports on the offering of such a service within a multi-retailer environment, in which end users can make use of services offered by any of a set of retailers in a consistent way. This makes use of the Retailer Reference Point, developed by TINA-C. First experiences are reported, which have been made in the Eurescom project P715 with integrating services from five different providers. This lead to a the definition of a new reference point within the consumer domain which is used to connect service independent and service specific components and allows downloading of services at runtime.
Fuzzy translation of cross-lingual spelling variants
Authors: Ari Pirkola, Jarmo Toivonen, Heikki Keskustalo, Kari Visala, Kalervo Järvelin
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

We will present a novel two-step fuzzy translation technique for cross-lingual spelling variants. In the first stage, transformation rules are applied to source words to render them more similar to their target language equivalents. The rules are generated automatically using translation dictionaries as source data. In the second stage, the intermediate forms obtained in the first stage are translated into a target language using fuzzy matching. The effectiveness of the technique was evaluated empirically using five source languages and English as a target language. The target word list contained 189 000 English words with the correct equivalents for the source words among them. The source words were translated using the two-step fuzzy translation technique, and the results were compared with those of plain fuzzy matching based translation. The combined technique performed better, sometimes considerably better, than fuzzy matching alone.
An application of the reference model for open distributed processing to electronic brokerage
Authors: Mikhail Blinov, Ahmed Patel
Venue: Computer Standards Interfaces (2003)

This paper presents the design of an Architecture for Electronic Brokerage Systems (AEBS). This architecture is based on the Reference Model for Open Distributed Processing (RM-ODP) model. It specifies a brokerage system from five RM-ODP viewpoints. AEBS include a generic model of electronic brokerage. It defines protocols and interfaces between actors. It enables communication between actors via an advanced object-oriented interface (defined in terms of the Common Object Request Broker Architecture (CORBA) technology) as well as using traditional trading protocols. These interfaces allow a broker to operate in both the rapidly developing object-oriented CORBA environment and the electronic markets based on customary protocols. CORBA was also used for the design of the internal object model and internal interfaces of a brokerage system. This paper focuses primarily on the specification of the AEBS architecture from the enterprise and computational viewpoints of the RM-ODP model.
Administracion de Sitios y Paginas Web Con Macromedia Dreamweaver 4 with Cdrom
Authors: Cesar A. Perez
Venue:  (2002)

:Macromedia Dreamweaver 4 es un programa de diseno de paginas Web de alta calidad, que permite la administracion de sitios Web de modo sencillo e intuitivo. Este software, junto con el programa de complemento grafico Macromedia Fireworks 4 y el programa de creacion, administracion y aplicaciones Web con bases de datos Macromedia Dreamweaver UltraDev 4, constituyen un potente conjunto de herramientas para crear paginas Web profesionales y administrar sitios Web con acceso a bases de datos. Por otra parte, Macromedia Dreamweaver 4 es un editor de codigo HTML profesional para el diseno y la administracion de sitios y paginas Web. Permite, tanto controlar manualmente el codigo HTML, como trabajar en un entorno de edicion visual, facilitando herramientas utiles para mejorar el diseno Web. En este libro se reune el trabajo con Macromedia Dreamweaver 4, comenzando desde el nivel inicial y profundizando secuencialmente en el contenido del programa hasta alcanzar un nivel avanzado en el diseno y administracion de sitios Web. El texto se adapta tanto al entorno Microsoft Windows (sistemas operativos 9.x, Me, 2000 y NT) como al entorno Macintosh (sistemas Mac OS 8.6 o 9.x), siendo su manejo valido para los usuarios de ambas plataformas. Incluye CD-ROM con una version de demostracion (trial) de los programas Macromedia Dreamweaver, Flash y Fireworks en idioma ingles.
Nearly optimal strategies for special cases of on-line capital investment
Authors: Peter Damaschke
Venue: Theoretical Computer Science (2003)

Suppose that some job must be done for a period of unspecified duration. The market offers a selection of devices that can do this job, each characterized by purchase and running costs. Which of them should we buy at what times, in order to minimize the total costs? As usual in competitive analysis, the cost of an on-line solution is compared to the optimum costs paid by a clearvoyant buyer. This problem which generalizes the basic rent-to-buy problem has been introduced by Azar et al. In the so-called convex case where lower running costs always imply higher prices, a strategy with competitive ratio 4+2√2 ≈ 6.83 has been proposed. Here we consider two natural subcases of the convex case in a continuous-time model where new devices can be bought at any time. For the static case where all devices are available at the beginning, we give a simple 4-competitive deterministic algorithm, and we show that 3.618 is a lower bound. (This is also the first non-trivial lower bound for the convex case, both for discrete and continuous time.) Furthermore, we give a 2.88-competitive randomized algorithm. In the case that all devices have equal prices but are not all available at the beginning, we show that a very simple algorithm is 2-competitive, and we derive a 1.618 lower bound.
A method computing multiple roots of inexact polynomials
Authors: Zhonggang Zeng
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

We present a combination of two novel algorithms that accurately calculate multiple roots of general polynomials. For a given multiplicity structure and initial root estimates, Algorithm I transforms the singular root-finding into a nonsingular least squares problem on a pejorative manifold, and calculates multiple roots simultaneously. To fulfill the input requirement of Algorithm I, we design a numerical GCD-finder, including a partial singular value decomposition and an iterative refinement, as the main engine for Algorithm II that calculates the multiplicity structure and the initial root approximation. The combined method calculates multiple roots with high forward accuracy without using multiprecision arithmetic, even if the coefficients are inexact. This is perhaps the first blackbox-type root-finder with such capabilities. To measure the true sensitivity of the multiple roots, a pejorative condition number is proposed and error bounds are given. Extensive computational experiments are presented. The error analysis and numerical results confirm that a polynomial being ill-conditioned in conventional sense can be well conditioned pejoratively. In those cases, the multiple roots can be computed with remarkable accuracy.
Privacy conflicts in CRM services for online shops: a case study
Authors: Claus Boyens, Oliver Günther, Maximilian Teltzrow
Venue: Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14 (2002)

Sophisticated Data Mining tools are able to provide valuable information for online retailers. But especially when an external data mining service provider is contracted, important questions arise concerning the privacy preservation of the shop customers. This paper discusses the specific case of an online retailer who aims at usefully analysing customers' data for product and capacity planning while still preserving its users'privacy. We expose several privacy-sensitive areas and propose protection measures in order to face these problems.
Combinatorial optimization in geometry
Authors: Igor Rivin
Venue: Advances in Applied Mathematics (2003)

In this paper we extend and unify the results of [Rivin, Ann. of Math. 143 (1996)] and [Rivin, Ann. of Math. 139 (1994)]. As a consequence, the results of [Rivin, Ann. of Math. 143 (1996)] are generalized from the framework of ideal polyhedra in H3 to that of singular Euclidean structures on surfaces, possibly with an infinite number of singularities (by contrast, the results of [Rivin, Ann. of Math. 143 (1996)] can be viewed as applying to the case of non-singular structures on the disk, with a finite number of distinguished points). This leads to a fairly complete understanding of the moduli space of such Euclidean structures and thus, by the results of [Penner, Comm. Math. Phys. 113 (1987) 299-339; Epstein, Penner, J. Differential Geom. 27 (1988) 67-80; Näätänen, Penner, Bull. London Math. Soc. 6 (1991) 568-574] the author [Rivin, Ann. of Math. 139 (1994); Rivin, in: Lecture Notes in Pure and Appl. Math., Vol. 156, 1994], and others, further insights into the geometry and topology of the Riemann moduli space.The basic objects studied are the canonical Delaunay triangulations associated to the aforementioned Euclidean structures.The basic tools, in addition to the results of [Rivin, Ann. of Math. 139 (1994)] and combinatorial geometry are methods of combinatorial optimization--linear programming and network flow analysis; hence the results mentioned above are not only effective but also efficient. Some applications of these methods to three-dimensional topology are also given (to prove a result of Casson's).
Testing the Feasibility of Synchronous Bandwidth Allocation for Time-Critical Communication in FDDI Networks
Authors: Sijing Zhang, Tee-Hiang Cheng, K. R. Subramanian, Liren Zhang, Chee Heng Tan
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

One of the key issues related to deadline guarantees of synchronous messages in FDDI networks is the feasibility test of synchronous bandwidth allocation (SBA). Much work has been done on how to allocate synchronous bandwidth appropriately in order to guarantee synchronous messages transmission before their deadlines, and as a result quite a few SBA schemes have been proposed. In contrast, limited research has been done on how to effectively test the feasibility of a given allocation of synchronous bandwidths (i.e., whether or not a given allocation can guarantee the synchronous message set being considered), and the existing approach cannot always give an effective testing and may even produce wrong testing results. In this paper we present an algorithm of polynomial time worst-case complexity which ensures the correctness and effectiveness of the testing for any given synchronous message set with message deadlines equal to periods.
Scheduling a single server in a two-machine flow shop
Authors: T. C. E. Cheng, M. Y. Kovalyov
Venue: Computing (2003)

We study the problem of scheduling a single server that processes n jobs in a two-machine flow shop environment. A machine dependent setup time is needed whenever the server switches from one machine to the other. The problem with a given job sequence is shown to be reducible to a single machine batching problem. This result enables several cases of the server scheduling problem to be solved in O(n log n) by known algorithms, namely, finding a schedule feasible with respect to a given set of deadlines, minimizing the maximum lateness and, if the job processing times are agreeable, minimizing the total completion time. Minimizing the total weighted completion time is shown to be NP-hard in the strong sense. Two pseudopolynomial dynamic programming algorithms are presented for minimizing the weighted number of late jobs. Minimizing the number of late jobs is proved to be NP-hard even if setup times are equal and there are two ditstinct due dates. This problem is solved in O(n3) time when all job processing times on the first machine are equal, and it is solved in O(n4) time when all processing times on the second machine are equal.
Two New Constraint Propagation Algorithms Requiring Small Space Complexity
Authors: A. Chmeiss, P. Jegou
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Recently, efficient algorithms have been proposed to achieve arc- and path-consistency in constraint net-works. The best path-consistency algorithm proposed is PC-(516) which is a natural generalization of AC-6 to path-consistency independently proposed in [lo] for PC-5 and [3] for PC-6. Unfortunately, we have remarked that PC-{5/6}, though it is widely better than PC-4[6], was not very efficient in practice, specially for those classes of problems that require an important space to be run. So, we propose a new path-consistency algorithm called PC-8, the space complexity of which is O(n' d) but its time complexity is 0(n3d4) i.e. worse than that of PC-{ 516}. However, the simplicity of PC-8 as well as the data structures used for its implementation offer a higher performance than PC-(516). The principle of PC-8 is also used to propose a new algorithm to achieve arc-consistency called AC-8.
Models and Algorithms for Optical and Optoelectronic Parallel Computers
Authors: Sartaj Sahni
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

This paper briefly reviews some of the more popular parallel-computer models--pipelined optical bus and OTIS interconnect models--that employ optical interconnect. The interconnect topology and some simple algorithms for each model are also described.