ppxscal/embedding_network huggingface dataset:
Protocol Composition in Horus
Authors: Robbert Van Renesse, Kenneth P. Birman
Venue:  (1995)

Horus is a communication architecture that treats a protocol as an abstract data type. Protocol layers can be stacked on top of each other in a variety of ways, at run-time. This paper starts out with describing the many classes of protocols that can be supported this way. Next, we describe the Horus object model that we designed for this technology, and the interface between the layers that makes it all work. We then present an example layer which implements a group membership protocol. Then, we look at a example stack of protocols, which provides fault-tolerant, totally ordered communication between a group of processes. We conclude with presenting some remaining challenges in our project.
Optimization under Ordinal Scales: When is a Greedy Solution Optimal?
Authors: A. Pekec
Venue:  (1995)

Mathematical formulation of an optimization problem often depends on data which can be measured in more than one acceptable way. If the conclusion of optimality depends on the choice of measure, then we should question whether it is meaningful to ask for an optimal solution. If meaningful optimal solution exists and the objective function depends on data measured on an ordinal scale of measurement, then the greedy algorithm will give such a solution for a wide range of objective functions. 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
Raising GA performance by simultaneous tuning of selective pressure and recombination disruptiveness
Authors: Cees H.M. Kemenade, Joost N. Kok, Agoston E. Eiben
Venue:  (1995)

In many Genetic Algorithms applications the objective is to find a (near-)optimal solution using a limited amount of computation. Given these requirements it is difficult to find a good balance between exploration and exploitation. Usually such a balance is found by tuning the various parameters (like the selective pressure, population size, the mutation- and crossover rate) of the Genetic Algorithm. As an alternative we propose simultaneous tuning of the selective pressure and the disruptiveness of the recombination operators. Our experiments show that the combination of a proper selective pressure and a highly disruptive recombination operator yields superior performance. The reduction mechanism used in a Steady-State GA has a strong influence on the optimal crossover disruptiveness. Using the worst fitness deletion strategy the building blocks present in the current best individuals are always preserved. This releases the crossover operator from the burden to maintain good building blocks and allows us to tune crossover disruptiveness to improve the search for better individuals.
The Woes of IDEs
Venue: Queue (2003)

An epigram: “We may not feel these limitations until they have been lifted from us, just as we often do not know we are sick until we suddenly feel better. Therefore, it is reasonable to expect that future languages will make us feel those limitations of [our present environments] that are not detectable today.” --Gerald Weinberg
Reply to the case against stack-oriented instruction sets
Authors: Peter U. Schulthess, Eduard P. Mumprecht
Venue: ACM SIGARCH Computer Architecture News (1977)

In contrast to general opinion the advantages of stack architectures appear most clearly when handling more complex situations than evaluation of simple expressions.
Maintenance Scheduling of Oil Storage Tanks Using Tabu-Based Genetic Algorithm
Authors: Sheng-Tun Li, Chuan-Kang Ting, Chungnan Lee, Shu-Ching Chen
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Due to the entry of Taiwan into WTO and the recently liberalized Petroleum ManagementLaw, the oil market in Taiwan is liberalized and thus is becoming more competitive. However,the space limitation and the residents' increasing awareness of environmental protection issues in the island make international vendors unavoidably have to rent tanks from domestic oil companies. In order to help the leaseholder maximize revenue by increasing the availability of tanks, an efficient maintenance scheduling is needed. This paper introduces a tabu-based genetic algorithm (TGA) and its implementation for solving a real-world maintenance scheduling problem of oil storage tanks. TGA incorporates a tabu list to prevent inbreeding and utilizes an aspiration criterion to supply moderate selection pressure so that the selection efficiency is improved, and the population diversity is maintained. The experimental results validate that TGA outperform GA in terms of solution quality and convergence efficiency.
Digital Photography Basics
Authors: Les Meehan
Venue:  (2003)

:Can't make sense of your digital camera's instruction manual? Baffled by which button to press? Look no further! Digital Photography Basics is the perfect jargon-free introduction to digital cameras and how to use them. Les Meehan takes you through each feature of the camera in turn and offers practical tips to allow you to get the most out of any photographic situation. Illustrated throughout with accessible, colourful images and written in clear, non-technical language, it is an invaluable reference guide to the quickest-growing area of contemporary photography. 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
Tape Reversal Bounded Turing Machine Computations
Authors: Juris Hartmanis
Venue:  (1968)

This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a rich hierarchy of tape reversal limited complexity classes and their properties and ordering are investigated. The most striking difference between this and the previously studied complexity measures lies in the fact that the ``speed-up'''' theorem does not hold for slowly growing tape reversal complexity classes. These differences are discussed, and several relations between the different complexity measures and languages are established.
Solution to Control Problems for Parabolic Systems
Authors: V. V. Skopetskii, V. A. Stoyan, T. Yu. Blagoveshchenskaya
Venue: Cybernetics and Systems Analysis (2003)

The problems of control of parabolic systems in bounded space-time, bounded space, and bounded time domains are formulated, solved, and analyzed. State functions for such systems are controlled through external dynamic distributed perturbations and initial and boundary conditions. Conditions of accuracy and uniqueness of the solutions are analyzed.
Optimal All-to-All Personalized Exchange in Multistage Networks
Authors: Yuanyuan Yang, Jianchao Wang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important applications in parallel computing. Previous all-to-all personalized exchange algorithms were mainly developed for hypercube and mesh/torus networks. Although the algorithms for a hypercube may achieve optimal time complexity, the network suffers from unbounded node degrees and thus has poor scalability. On the other hand, a mesh/torus has a constant node degree and better scalability, but the all-to-all personalized exchange algorithms have higher time complexity. In this paper, we propose an alternative approach to efficient all-to-all personalized exchange by considering another important type of networks, multistage networks, for parallel computing systems. We present a new all-to-all personalized exchange algorithm for a class of unique-path multistage networks. We first develop a generic method for decomposing all-to-all personalized exchange patterns into some permutations, which are realizable in these networks, and then present a new all-to-all personalized exchange algorithm based on this method. The newly proposed algorithm has O(n) time complexity for an n \times n network, which is optimal for all-to-all personalized exchange.
Semantic Depth of Field
Authors: Robert Kosara, Silvia Miksch, Helwig Hauser
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

We present a new technique called Semantic Depth of Field (SDOF) as an alternative approach to focus-and-context displays of information. We utilize a well-known method from photography and cinematography (depth-of-field effect) for information visualization, which is to blur different parts of the depicted scene in dependence of their relevance. Independent of their spatial locations, objects of interest are depicted sharply in SDOF, whereas the context of the visualization is blurred. In this paper, we present a flexible model of SDOF which can be easily adopted to various types of applications. We discuss pros and cons of the new technique, give examples of application, and describe a fast prototype implementation of SDOF.
An a priori error analysis of the Local Discontinuous Galerkin method for elliptic problems
Authors: B. C P. Castillo
Venue:  (2000)

In this paper, we present the first a priori error analysis for the Local Discontinuous Galerkin method for a model elliptic problem. For arbitrary meshes with hanging nodes and elements of various shapes, we show that, for stabilization parameters of order one, the L$^2$-norm of the gradient and the L$^2$-norm of the potential are of order $k$ and $k+1/2$, respectively, when polynomials of total degree at least $k$ are used; if stabilization parameters of order $h^{-1}$ are taken, the order of convergence of the potential increases to $k+1$. The optimality of these theoretical results are tested in a series of numerical experiments on two dimensional domains. (SIAM J. Numer. Anal., 38 (2000), 1676-1706) 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
Oversampling the Haar wavelet transform
Authors: Zbigniew R. Struzik
Venue:  (2001)

The Haar wavelet representation and a number of related representations have been shown to be a simple and powerful technique for similarity matching of time series. In this report, we extend the standard formulation to the translation invariant oversampled system. This makes possible a particularly efficient incremental scheme for coefficient calculation. As an additional benefit, the oversampled scheme provides for easy incremental update of the decomposition on new input samples. The system is further extended over higher order scaling functions of smoother character and over wavelets with more vanishing moments.
Ant Colony Control for Autonomous Decentralized Shop Floor Routing
Authors: Vincent A. Cicirello, Stephen F. Smith
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

In this paper, we introduce a new approach to autonomous decentralized shop floor routing. Our system, which we call Ant Colony Control (AC 2), applies the analogy of a colony of ants foraging for food to the problem of dynamic shop floor routing. In this system, artificial ants use only indirect communication to make all shop routing decisions by altering and reacting to their dynamically changing common environment through the use of simulated pheromone trails. For simple factory layouts, we show that the emergent behavior of the colony is comparable to using the optimal routing strategy. Furthermore, as the complexity of the factory layout is increased, we show that the adaptive behavior of AC 2 evolves local decision making policies that lead to near-optimal solutions from the standpoint of global performance.
Width and dual width of subsets in polynomial association schemes
Authors: A. E. Brouwer, C. D. Godsil, J. H. Koolen, W. J. Martin
Venue: Journal of Combinatorial Theory Series A (2003)

The width of a subset C of the vertices of a distance-regular graph is the maximum distance which occurs between elements of C. Dually, the dual width of a subset in a cometric association scheme is the index of the "last" eigenspace in the Q-polynomial ordering to which the characteristic vector of C is not orthogonal. Elementary bounds are derived on these two new parameters. We show that any subset of minimal width is a completely regular code and that any subset of minimal dual width induces a cometric association scheme in the original. A variety of examples and applications are considered.
Efficient Tree-based Multicast in Wormhole-Routed 2D Meshes
Authors: Jenq-Shyan Yang, Chung-Ta King
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

This paper proposes a tree-based routing scheme for multicasting general messages of arbitrary length on 2D mesh networks. The scheme takes into account of the characteristics of the programming interface and constructs a quad-branch multicast (QBM) tree for transmitting the given multicast. To maintain the QBM tree, we will describe how routers can be designed and initialized, and how the multicast message is delivered down the QBM tree. The proposed QBM-tree-based method is shown to perform better than previous approaches and is less sensitive to variations in the system parameters.
An Efficient Control Mechanism of Mobile Agents
Authors: Hong Wang, Guangzhou Zeng, Shouxun Lin
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

The control of tasks in traditional distributed systems is a well researched field for whichmany solutions exist. These solutions exploit well defined parent-child relationships given indistributed systems. But they are not applicable in mobile agent systems, since no similar natural relationships between agents exist. Thus new mechanisms have to be developed. In this paper, we present an efficient control mechanism for mobile agents. It is based on the tracking method of AgentTracer and agent shadow and we combine this tracking method with energy concept. In the tracking mechanism, an artificial relationship between agents and the AgentTracer is defined. The AgenrTracer has many entries for all agents that are created in its area. Each entry records the current location of the dependent agent. Removing an entry at AgentTracer implies that the dependent agent is declared an orphan and eventually be terminated. In an extension of the basic mechanism we additionally allow the AgentTracer to be mobile.
ARM abstract rewriting machine
Authors: Jasper F.T Kamperman, H. R. Walters
Venue:  (1993)

Term rewriting is frequently used as implementation technique for algebraic specifications. In this paper we present the abstract term rewriting machine (ARM), which has an extremely compact instruction set and imposes no restrictions on the implemented TRSs. Apart from standard conditional term rewriting, associative lists are supported. ARM code is translated to (ANSI) C; the resulting execution speeds are good (on a sun4, an average of 80000 rewriting steps per second and a maximum of 416000 r/s were measured). Several benchmarks are shown, and related work is discussed in depth.
Suggestions for a Uniform Representation of Query and Record Content in Data Base and Document Retrieval
Authors: Gerard Salton
Venue:  (1979)

A standard approach is introduced for the representation of information content in data base and document retrieval environments. The use of composite concept vectors representing individual information items leads to a uniform system in different retrieval situations for the identification of answers in response to incoming information requests.
Efficient Average-Case Algorithms for the Modular Group
Authors: Dexter Kozen
Venue:  (1995)

The modular group occupies a central position in many branches of mathematical sciences. In this paper we give average polynomial-time algorithms for the unbounded and bounded membership problems for finitely generated subgroups of the modular group. The latter result affirms a conjecture of Gurevich [FOCS 1990]. 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
Fused Data-Centric Visualizations for Software Evolution Environments
Authors: Jens H. Jahnke, Hausi A. Müller, Andrew Walenstein, Nikolai Mansurov, Kenny Wong
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

During software evolution, several different facets of the system need to be related to one another at multiple levels of abstraction. Current software evolution tools have limited capabilities for effectively visualizing and evolving multiple system facets in an integrated manner. Many tools provide methods for tracking and relating different levels of abstraction within a single facet. However it is less well understood how to represent and understand relationships between and among different abstraction hierarchies, that is, for inter-hierarchy relations. Often these are represented and explored independently, making them difficult to relate to one another. As a result, engineers are likely to have difficulty understanding how the various facets of a system relate and interact. We describe preliminary results of a collaborative research project between industry and academia to enhance the inter-hierarchy visualization capabilities of an existing software evolution environment called "KLOC-workSuite". Specifically, we describe our efforts to add a "fused" visualization based on Story Board Diagrams. This visualization integrates ¿ or "fuses" ¿ facets of architecture, behavior, and data. We describe how these diagrams bridge currently isolated visualizations of system information, and argue how they can help drive architecture excavation tasks.
A note on coinduction and weak bisimilarity for while programs
Authors: J. J.M.M. Rutten
Venue:  (1998)

An illustration of coinduction in terms of a notion of weak bisimilarity is presented. First, an operational semantics O for while programs is defined in terms of a final automaton. It identifies any two programs that are weakly bisimilar, and induces in a canonical manner a compositional model D. Next O = D is proved by coinduction.
Stereo Viewing Interface for Workstations
Authors: Bruce Land, Catherine Devine
Venue:  (1990)

Three dimensional data sets are becoming widespread in scientific simulations and analysis of physical systems. Applications ranging from fluid simulations to medical imaging require understanding of three dimensional (3D) data. Researchers often produce images from the data to aid in understanding. In the resulting images, monocular depth cues such as object size, parallax motion, and shading help to interpret 3D data. However, viewing 3D data is enhanced by using stereo pairs so that binocular depth cues are available. There are several schemes for producing stereo pairs on the screen of a workstation (e.g. liquid crystal shutters, vibrating mirrors or cylinderical lens). We describe here a liquid crystal shutter system which is easy and inexpensive to construct. Using liquid-crystal shutter glasses designed for video games, it is possible to construct an inexpensive stereo viewing interface to any personal computer or workstation which has hardware double-buffering of the display screen and which can produce an RS-232 character. The resulting display exhibits strong stereo depth cues. Flicker is noticeable and depends on the refresh rate of the monitor as well as the speed with which the double-buffered display can be changed. On the IBM RISC System 6000, equipped with the GL display card (part number xxx), the flicker is moderate, the brightness good, and the stereo effect very stable. The description given here will assume an IBM RISC System 6000. There are two parts to the system: the software to display two images in the double buffer and the hardware which converts an RS-232 character to the waveform necessary to drive the liquid-crystal glasses. Clearly the software will have to be modified for other systems, although it should run virtually unmodified on Silicon Graphics machines, such as the Personal IRIS.
The Statistical Rate Monotonic Scheduling Workbench
Authors: Alia Atlas, Azer Bestavros
Venue:  (1998)

Abstract The SRMS Workbench is a software system developed to demonstrate the notion of Statistical QoS employed in SRMS [AtlasBestavros:1998]. The SRMS Workbench includes: (1) the SRMS schedulability analyzer (QoS negotiator), and (2) a SRMS simulator (Basic SRMS + all extensions). These two components are packaged into a Java Applet that can be executed remotely on any Java-capable Internet browser. For comparison, other scheduling algorithms, including RMS [LiuLayland:1973] and SSJAC [AtlasBestavros:1998] are included. Through a simple GUI, the SRMS Workbench allows users to specify a set of periodic tasks, each with (a) its own period, (b) the distributional characteristics of its periodic resource requirements (e.g. Poisson, Pareto, Normal, Exponential, Gamma, etc.), (c) its desired QoS as a lower bound on the percentage of deadlines to be met, and (d) a criticality/importance index indicating the value of the task (relative to other tasks in the task set). Once the task set is specified, the SRMS Workbench allows the user to check for schedulability under SRMS. If the task set is schedulable, the SRMS Workbench generates the appropriate allowance for each task and allows the user to create an animated simulation of the task system, which can be executed and profiled. If the task set is not schedulable, the SRMS Workbench informs the user of that fact and suggests (as part of the QoS negotiation) an alternative set of feasible QoS requirements that reflects the specified criticality/importance index of the tasks in the task set. The SRMS Workbench is available on the Web at http://www.cs.bu.edu/groups/realtime/SRMSworkbench
A Study of the Structure of NP
Authors: Vivian Sewelson
Venue:  (1993)

NO SUPPLIED
QoS-Assured Service Composition in Managed Service Overlay Networks
Authors: Xiaohui Gu, Klara Nahrstedt, Rong N. Chang, Christopher Ward
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Many value-added and content delivery services arebeing offered via service level agreements (SLAs). Theseservices can be interconnected to form a service overlaynetwork (SON) over the Internet. Service composition inSON has emerged as a cost-effective approach to quicklycreating new services. Previous research has addressed thereliability, adaptability, and compatibility issues for composedservices. However, little has been done to managegeneric quality-of-service (QoS) provisioning for composedservices, based on the SLA contracts of individual services.In this paper, we present QUEST, a QoS assUredcomposEable Service infrasTructure, to address the problem.QUEST framework provides: (1) initial service composition,which can compose a qualified service path undermultiple QoS constraints (e.g., response time, availability).If multiple qualified service paths exist, QUEST chooses thebest one according to the load balancing metric; and (2)dynamic service composition, which can dynamically recomposethe service path to quickly recover from serviceoutages and QoS violations. Different from the previouswork, QUEST can simultaneously achieve QoS assurancesand good load balancing in SON.