ppxscal/embedding_network huggingface dataset:
Design and analysis of a credit-based controller for congestion control in B-ISDN/ATM networks
Authors: Jing-Fei Ren, J. W. Mark
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

A credit-based controller (CBC), which has a provision for cell tagging, is proposed for usage parameter control (UPC). Similar in concept to the leaky bucket, the CBC has a credit counter and a data buffer. Credits are accumulated at a rate initiated from the network (equivalent to the sustainable cell rate), and depleted at a rate pertaining to the network traffic load. A source has the prerogative whether or not to send its cells as tagged cells when the credit level is nonpositive. The queueing behavior of the CBC fed by a Marcov modulated source, is analyzed using a stochastic fluid flow model. It is shown that the performance of the CBC can be altered by tuning the weighting parameter within the CBC. Also, adjustments can be made to balance the ratio of tagged and untagged cells sent into the network.
Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices
Authors: L. Grasedyck, W. Hackbusch, B. N. Khoromskij
Venue: Computing (2003)

In previous papers, a class of hierarchical matrices (H-matrices) is introduced which are data-sparse and allow an approximate matrix arithmetic of almost optimal complexity. Here, we investigate a new approach to exploit the H-matrix structure for the solution of large scale Lyapunov and Riccati equations as they typically arise for optimal control problems where the constraint is a partial differential equation of elliptic type. This approach leads to an algorithm of linear-logarithmic complexity in the size of the matrices.
A Higher-Order Logic as the Basis for Logic Programming
Authors: Gopalan Nadathur
Venue:  (1990)

The objective of this thesis is to provide a formal basis for higher-order features in the paradigm of logic programming. Towards this end, a non-extensional form of higher-order logic that is based on Church''s simple theory of types is used to provide a generalisation to the definite clauses of first-order logic. Specifically, a class of formulas that are called higher-order definite sentences is described. These formulas extend definite clauses by replacing first-order terms by the terms of a typed $\lambda$ -calculus and by providing for quantification over predicate and function variables. It is shown that these formulas, together with the notion of a proof in the higher-order logic, provide an abstract description of computation that is akin to the one in the first-order case. While the construction of a proof in a higher-order logic is often complicated by the task of finding appropriate substitutions for predicate variables, it is shown that the necessary substitutions for predicate variables can be tightly constrained in the context of higher-order definite sentences. This observation enables the description of a complete theorem-proving procedure for these formulas. The procedure constructs proofs essentially by interweaving higher-order unification with backchaining on implication, and constitutes a generalisation, to the higher-order context, of the well-known SLD-resolution procedure for definite clauses. The results of these investigations are used to describe a logic programming language called $\lambda$ Prolog. This language contains all the features of a language such a Prolog, and, in addition, possesses certain higher-order features. The nature of these additional features is illustrated, and it is shown how the use of the terms of a (typed) $\lambda$ -calculus as data structures provides a source of richness to the logic programming paradigm.
Dartmouth-Smalltalk: An Exercise in Implementation
Authors: Joon S Lee
Venue:  (1986)

This report discusses a preliminary implementation of the Smalltalk-80 virtual machine for Vax/Unix. 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
Integrated Systems
Authors: P. A. D. DeMaine, K. D. Bradley
Venue:  (1991)

The following design principles are being used in an ongoing project to realize an integrated family of rule based systems that can be easily used separately or together in different combinations to solve problems common to many different disciplines. Some essential features of this family are: (1) Individual members can be used in the normal way as user-friendly rule based systems or they can be transparently invoked by other user-friendly rule based systems without interrogating users. (2) The knowledge (or rule) bases of key members do not mimic the perceived mode of human thought; therefore, they can predict events that cannot be predicted by the state-of-the-art alone. (3) The law of Conservation of Mass/Energy is used to detect and correct computational errors.
A proof system for finite trees
Authors: Patrick Blackburn, Wilfried Meyer-Viol, Maarten Rijke
Venue:  (1995)

In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system.We do so using standard axioms from modal provability logic and modal logics of programs, and prove completeness by extending techniques due to Van Benthem and Meyer-Viol [2] and Blackburn and Meyer-Viol [5]. We conclude with a proof of the EXPTIME-completeness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving.
An Empirical Study of Color-Spatial Retrieval Techniques for Large Image Databases
Authors: Chia Yeow Yee, Kian-Lee Tan, Tat Seng Chua, Beng Chin Ooi
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

In this paper, we present an experimental evaluation of three color-spatial retrieval techniques --- the signature-based technique, the partition-based algorithm and the cluster-based method. The experimental study is performed on an image database consisting of 12,000 images. With the proliferation of image retrieval mechanisms and the lack of extensive performance study, the experimental results can serve as guidelines in selecting a suitable technique and designing a new technique.
Distributed broadcast in radio networks of unknown topology
Authors: Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Venue: Theoretical Computer Science (2003)

A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the topology. A basic task in radio network is that of broadcasting a message (created by a fixed source node) to all nodes of the network. Typical operations in real-life radio networks is the multi-broadcast that consists in performing a set of r independent broadcasts. The study of broadcast operations on unknown radio network is started by the seminal paper of Bar-Yehuda et al. [J. Comput. System Sci. 45 (1992) 104] and has been the subject of several recent works.In this paper, we study the completion and the termination time of distributed protocols for both the (single) broadcast and the multi-broadcast operations on unknown networks as functions of the number of nodes n, the maximum eccentricity D, the maximum in-degree Δ, and the congestion c of the networks. We establish new connections between these operations and some combinatorial concepts, such as selective families, strongly selective families (also known as superimposed codes), and pairwise r-different families. Such connections, combined with a set of new lower and upper bounds on the size of the above families, allow us to derive new lower bounds and new distributed protocols for the broadcast and multi-broadcast operations. In particular, our upper bounds are almost tight and strongly improve over the previous bounds for a large class of networks.
Formal Implementation of High-Level Languages for Data-Parallel Programming
Authors: Deb Banerjee
Venue:  (1992)

The success of parallel architectures has been limited by the lack of high-level parallel programming languages and useful programming models. The data-parallel model of programming has been demonstrated to be useful and natural on a wide variet of parallel architectures. This dissertation presents a set of formal techniques for compiling high- level languages based on data-parallelism.
Virtual context - relating media objects to their real world subjects
Authors: L. W. Rutledge, A. R. Ballegooij, A. Eliens
Venue:  (2000)

Virtual Reality (VR) is sometimes used to give the user an immersive, three-dimensional sense of a real-world setting. VR is also sometimes used for information visualization, taking advantage of the perceptual characteristics of VR to convey information. This paper presents the Dam Square Virtual Context, a Web-based VR that is a combination of both these uses. This VR presents mock-ups of both Dam Square in the city of Amsterdam and the city''s largest museum, the Rijksmuseum. This VR conveys abstract information that includes the relationships between objects in the museum, such as paintings of Amsterdam cityscapes, and the corresponding objects in Dam Square itself, such as the buildings and neighborhoods shown in these paintings. It is thus a multimedia combining VR wireframes and bitmaps with still images and interface scripts. The principle behind this is that the user learns how to walk through the museum to view objects that together convey a unified view about Amsterdam, which the user can then later walk through.
An Object-Oriented Real-Time Simulation of Music Performance Using Interactive Control
Authors: Lounette M. Dyer
Venue:  (1991)

This thesis addresses the problem of interactive control of real-time music performance by sound synthesizers. The approach to the problem is based on an analysis of a real world orchestra performance. The problem is decomposed into components that are one-to-one with the real world entities: a conductor, performers, instruments, a score, and parts. A detailed object-oriented design of each of the components is presented and the objects and their real world counterparts are compared. An abstract digital music representation is defined to represent the musical composition that is to be performed by the system. A realtime control mechanism is described that allows a human user to control various aspects of the performance in musically expressive ways. The model is implemented in a system called ZED, which has been shown to simulate some of the dynamic behavior of the live orchestra. Issues concerning the trade-off between runtime efficiency and runtime flexibility are addressed in detail, as well as how these issues affect real-time scheduling, Optimization techniques are presented that help insure timeliness. The object-oriented features of inheritance and encapsulation are shown to provide the system with extensibility and flexibility. Several other approaches to the problem are briefly outlined and ZED is compared with these approaches. 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
Object-oriented Structuring of Real-Time Automonous Decentralized Systems
Authors: K. H. (Kane) Kim
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

The application of the autonomous decentralized system (ADS) structuring to real-time (RT) computing applications, especially in large-scale complex applications, is expected to show steady increase in coming years. This is because the ADS structuring leads to a high degree of maintainability.A promising cost-effective approach to realizing RT ADS's is to use the emerging technology for RT distributed component/object structuring. One such technology being explored by the author and his research collaborators is the the Time-Triggered Message-Triggered Object (TMO) structuring scheme [Kim94, Kim97b]. The TM0 scheme is intended to facilitate RT distributed software engineering in a form which software engineers in the vast business software field can adapt to with small efforts. It is a syntactically simple and natural but semantically powerful extension of the conventional object structuring approaches. The scheme facilitates uniform structuring of (1) both RT and non-RT distributed application systems, (2) both control computer systems and their application environment simulators, and (3) requirement specifications and system designs arising at various phases of system engineering. 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
On-line Permutation Routing on WDM All-Optical Networks
Authors: Qian-Ping Gu
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

For a sequence (SI, tl), ..., (Si, ti), ...of routing requests with (Si, ti) arriving at time step i on the wavelength-division multiplexing (WDM) all-optical network, the on-line routing problem is to set-up a path Si ¿ ti and assign a wavelength to the path in step i such that the paths set-up so far with the same wavelength are edge-disjoint. Two measures are important for on-line routing algorithms: the number of wavelengths used and the response time. The sequence (SI,tl),...,(Si, ti),... is called a permutation if each node in the network appears in the sequence at most once as a source and at most once as a destination. Let Hn be the n-dimensional WDM all-optical hypercube. In this paper, we develop two on-line routing algorithms on Hn. Our first algorithm is a deterministic one which realizes any permutation by at most \left\lceil {3(n-1)/2}\right\rceil +1 wavelengths with response time O(2n). The second algorithm is a randomized one which realizes any permutation by at most (3/2+\delta)(n-1) wavelengths, where \delta can be any value satisfying \delta \geqslant 2/(n-1). The average response time of the algorithm is 0(n(1+\delta)/\delta. Both algorithms use at most O(n) wavelengths for the permutation on Hn. This improves the previous bound of O(n2). Both algorithms reach the competitive ratio O(n) on the number of wavelengths.
Photoshop Elements Express, 1 edition
Authors: Andrew Beckley Marilene Oliver
Venue:  (2002)

:Photoshop Elements Express is designed as a clear, concise and graphical introduction to Photoshop Elements and assumes no prior knowledge of the software, but expects the reader to be familiar with their computer, be it Windows or Mac, and any Digital Camera or Scanners they may have. Friends of ED provide e-mail support for all our books, so you'll always have a friend in the trade.Author Biography: Both authors use Photoshop day in day out in their professional lives. Marilene Oliver is a fine artist based in London, England where she works at the Royal College of Art. Andrew Beckley is a designer with Shelfstacker.org, also based in London. In addition, the Inspiration section includes work by New Master of Photoshop, Gavin Cromhout and professional Jim Hannah.
US network reliability issues and major outage performance
Authors: H. T. Daugherty, W. J. Klein
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

In the past decade the United States telecommunications industry has been under much scrutiny as a result of a number of major network outages. These outages, which affected millions of customers, ranged from power and fire related problems to a software error affecting the common channel signaling network. The industry reacted promptly and positively. This paper discusses the actions of the FCC's Network Reliability Council (NRC), including the technical papers produced by this group and its newly re-chartered objectives, as well as the Alliance for Telecommunications Industry Solutions (ATIS) Network Reliability Steering Committee (NRSC) to address this challenge. The NRSC's findings are discussed in detail, including the results of its quarterly and annual reports, which identify trends, areas of concern, and recommended steps to prevent or mitigate outages in the future.
Design of a Database and Cache Management Strategy for a Global Information Infrastructure
Authors: Paul Francis, Shin-ya Sato
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

NTT Software Labs is producing a distributed, self-configuring information navigation infrastructure designed to scale to global proportions. For reasons of large scale, unreliability (of the Internet, its connected computers, and the implementations), and the complete autonomy of the participants, a number of difficult database and cache consistency problems arise that are not solved by techniques commonly used either for the Internet (i.e. DNS), or for existing distributed database systems. This paper describes a set of strategies designed to solve these problems. In particular, it focuses on the use of third-party detection and notification of database and cache inconsistency.
Beginning ASP.NET Ecommerce, 1 edition
Authors: Karli Watson
Venue:  (2002)

:Beginning ASP.NET E-Commerce shows you how to build a full e-commerce web site. Guiding you through every step of the design and build process, this book will have you building high quality, extendable e-commerce web sites quickly and easily. To get the site up and running quickly, we build in phases. The first puts your site live on the web, using an online service to handle the shopping cart, checkout, and payment. The second adds an ASP.NET shopping basket and checkout. Finally we'll add our own order processing system - complete with credit card processing, data storage, and order tracking.
Optimized System Synthesis of Complex RT Level Building Blocks from Multirate Dataflow Graphs
Authors: Jens Horstmannshoff, Heinrich Meyr
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

In order to cope with the ever increasing complexity of todays application specific integrated circuits, a building block based design methodology is established. The system is composed of high level building blocks of which some are reused from previous designs while others might have been created by behavioral synthesis. In data flow oriented designs, these blocks usually have complex non-matching interface properties, making it necessary to generate additional interfacing and controlling hardware to integrate them into an operable system.In this paper, an RTL-HDL code generation from a synchronous data flow representations is introduced, that efficiently automates the generation of the required additional hardware. While existing code generation approaches provide strong limitations concerning the building block interfacing properties, our method enables the integration of components that access their ports periodically with arbitrary patterns. In order to reduce interface register cost, a minimum-area retiming approach is taken to determine optimum building block activation times, which is known to have polynomial time complexity. The code generation methodology is compared to an existing approach using a simple case study.
(/spl sigma/,/spl rho/)-characterization based connection control for guaranteed services in high speed networks
Authors: Song Chong, San-Qi Li
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Presents a method to establish real-time connections with guaranteed quality-of-services, based on per-session (/spl sigma/,/spl rho/)-characterization. Under two distinctive service disciplines, rate proportional processor sharing and fixed rate processor sharing, the authors derive tighter probabilistic bounds on per-session end-to-end overage cell loss rate, which is caused by either buffer overflow in the route or excessive delay at the destination. One remarkable feature of the bounding solutions is that they are solely determined by the probabilistic (/spl sigma/,/spl rho/) characterization of each session itself, independent of the network environment and other connections. To improve network resource utilization, the method is extended to allow statistical sharing of buffer resources at each node. The admission control scheme presented in the paper has a great flexibility in connection management since both bandwidth and buffer resources can be adaptively allocated among incoming and existing sessions according to present network resource availability. The (/spl sigma/,/spl rho/)-characterization strongly depends on traffic characteristics. The study of real multimedia traffic streams reveals the interrelationship among (/spl sigma/,/spl rho/)-characterization, traffic statistics and QOS constraint and also provides many engineering aspects of (/spl sigma/,/spl rho/)-characterization for connection management.
An information-theoretic approach to traffic matrix estimation
Authors: Yin Zhang, Matthew Roughan, Carsten Lund, David Donoho
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

Traffic matrices are required inputs for many IP network management tasks: for instance, capacity planning, traffic engineering and network reliability analysis. However, it is difficult to measure these matrices directly, and so there has been recent interest in inferring traffic matrices from link measurements and other more easily measured data. Typically, this inference problem is ill-posed, as it involves significantly more unknowns than data. Experience in many scientific and engineering fields has shown that it is essential to approach such ill-posed problems via "regularization". This paper presents a new approach to traffic matrix estimation using a regularization based on "entropy penalization". Our solution chooses the traffic matrix consistent with the measured data that is information-theoretically closest to a model in which source/destination pairs are stochastically independent. We use fast algorithms based on modern convex optimization theory to solve for our traffic matrices. We evaluate the algorithm with real backbone traffic and routing data, and demonstrate that it is fast, accurate, robust, and flexible.
World Wide Web Image Search Engines
Authors: Stan Sclaroff
Venue:  (1995)

Abstract (white paper presented at the NSF Workshop on Visual Information Management, MIT, June 1995) We propose the development of a world wide web image search engine that crawls the web collecting information about the images it finds, computes the appropriate image decompositions and indices, and stores this extracted information for searches based on image content. Indexing and searching images need not require solving the image understanding problem. Instead, the general approach should be to provide an arsenal of image decompositions and discriminants that can be precomputed for images. At search time, users can select a weighted subset of these decompositions to be used for computing image similarity measurements. While this approach avoids the search-time-dependent problem of labeling what is important in images, it still holds several important problems that require further research in the area of query by image content. We briefly explore some of these problems as they pertain to shape.