ppxscal/embedding_network huggingface dataset:
Thrifty Execution of Task Pipelines
Authors: Fred B. Schneider, Richard W. Conway, Dale Skeen
Venue:  (1984)

A sequence of tasks that must be performed on a sequential database can be scheduled in various ways. Schedules will differ with respect to the number of accesses made to peripheral storage devices and the amount of memory space consumed by buffers. Buffer requirements are discussed for task schedules that avoid accesses to peripherals storing the sequential database. The relationship between certain thrifty scheduling policies and loop jamming, a standard code optimization technique, is also identified. Application to UNIX pipelines and to file processing is discussed.
EXPLORATION OF THE DESIGN OF A COMPLEX E-MAIL SYSTEM
Authors: Francesco Gennai, Laura Abba, Marina Buzzi
Venue:  (2000)

The management of an Internet service involves a variety of aspects, ranging from the economic to the technical and organizational. Cost reduction, management simplification and improvement of service quality are the fundamental targets of every Internet service project. In geographically widespread organizations where numerous servers are used in order to implement distributed network services, both costs and human labor for maintenance and management are greatly multiplied. We believe that security and maintenance problems, and thus cost, could be reduced by transferring from a distributed to a centralized service. However, this choice would undermine the flexibility needed by local administrators in order to be able to administer their own services. This paper describes a hybrid service management model (partly centralized, partly distributed) and outlines the results we obtained by applying this model to the e-mail service of our organization.
Signal Trend Identification with Fuzzy Methods
Authors: Xin Wang, Lefteri H. Tsoukalas, Thomas Y. C. Wei, Jaques Reifman
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

A fuzzy-logic-based methodology for on-line signal trend identification is introduced. Although signal trend identification is complicated by the presence of noise, fuzzy logic can help capture important features of on-line signals and classify incoming power plant signals into increasing, decreasing and steady-state trend categories. In order to verify the methodology, a code named PROTREN is developed and tested using plant data. The results indicate that the code is capable of detecting transients accurately, identifying trends reliably, and not misinterpreting a steady-state signal as a transient one.
Meshing and visualization of oilfields
Authors: J. C. Lafon, G. Blanc
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

To optimize the exploitation of a new oilfield it is necessary to do computer simulations in order to determine the number and the geometrical positions of oil wells. Mathematical models are used to estimate the evolution of the production of an oilfield according to the 3D geometry of this oilfield, the number of wells used, the geometry of these wells and some economical parameters. An important step is to compute and visualize the oilfield meshing adapted to the mathematical method used in the simulation process. After a brief introduction to oilfields engineering, we describe two solutions to mesh the domain. The first one is to use only parallelepipeds as meshes with an algorithmic computation of neighbours, which allows one to efficiently mesh a huge domain when the oil wells are vertical. When oil wells have a complex geometry, we show how to use Voronoi diagrams and Delaunay triangulations to mesh the domain. This work illustrates the growing importance of visualization methods in the petroleum industry.
THE DESIGN AND IMPLEMENTATION OF A PRIVATE MESSAGE SERVICE FOR MOBILE COMPUTERS
Authors: David A. Cooper
Venue:  (1995)

Even as wireless networks create the potential for access to information from mobile platforms, they pose a problem for privacy. In order to retrieve messages, users must periodically poll the network. The information that the user must give to the network could potentially be used to track that user. However, the movements of the user can also be used to hide the user''s location if the protocols for sending and retrieving messages are carefully designed. In this thesis, we will present a protocol for a replicated memory service which allows users to read from memory without revealing which memory locations they are reading. Unlike previous protocols, this protocol is efficient in its use of computation and bandwidth. We will then show how this protocol can be used in conjunction with existing privacy preserving protocols to allow a user of a mobile computer to maintain privacy despite active attacks. Allowing users to retrieve messages anonymously introduces a new problem. In order to limit memory usage, it is necessary to remove old messages from the system. However, since users may become disconnected from the network for periods of time, it is important that the system hold onto messages until they have been retrieved by their intended recipients. The result is a conflict between the system''s need for information and users'' desire for privacy. We will present the design of a vacation service which we have developed which stores messages for users which are disconnected which does not require users to reveal any private information. Finally, we will describe the implementation of the private message service and discuss the performance estimates that we derived for the system based on experimental results. As we will show, the potential throughput of the private message service is reasonable.
The AMES approach to application understanding: a case study
Authors: C. Boldyreff, E. L. Burd, R. M. Hather, R. E. Mortimer, M. Munro, E. J. Younger
Venue: Proceedings of the International Conference on Software Maintenance (1995)

AMES (Application Management Environments Support), ESPRIT Project no. 8156, is concerned not simply with program comprehension but with application understanding. This paper considers the difficulties of gaining an understanding of the detailed functioning of an application in order to perform maintenance, and describes a method and tool support which have been developed to guide a maintainer through this learning process. Our method uses a theoretical background based on learning theory, with our tools aiming to improve upon the approach of many existing program comprehension toolsets by linking related aspects of the application's documentation to form a united graph. Results of the application of our toolset are described and their implications discussed. Finally, we describe some of the future directions that we will be taking based on the results that we have obtained.
On Computing Graph Closures
Authors: Samir Khuller
Venue:  (1988)

Given a graph $G$, the closure of $G$ is the graph obtained from $G$ by recursively joining pairs of non-adjacent vertices whose degree sum is at least $n$ until no such pair remains. We give an efficient algorithm to compute the closure using F-heaps. We also define the general closure of a graph and show that computing the general closure is $P$-complete with respect to log space transformations. 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
Air traffic controller agents
Authors: Todd J. Callantine
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Research sought to develop agents that can stand in for human air traffic controllers in large-scale simulation studies of advanced air traffic management concepts. The agents use a high-level activity model to structure the air traffic control task, and apply heuristics to plan and formulate clearances. Results indicate the agents handle traffic flow spacing problems well, but experience some difficulties managing complex 'merge' problems. Follow-on research on how such agents can make plausible errors to support safety analyses identified interesting aspects of agent performance in the face of errors. The research was supported by the NASA Aviation System Capacity Program and the FAA/NASA Aviation Safety Program.
Carrier-sense protocols for packet-switched smart antenna basestations
Authors: C. Sakr, T. D. Todd
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

Researchers have recently considered the use of smart antennas in various packet-switched data networks. Previously, a single-beam system was described which employs a smart antenna basestation, operating in carrier-sense (CSMA) mode. Performance improvements are obtained by having the antenna dynamically point pattern nulls in the direction of interfering stations, thus reducing the frequency of channel collisions. In this paper, we consider the reverse-link performance of stations accessing a smart antenna basestation using multibeam SDMA. A basic CSMA/SDMA protocol is first proposed for this type of system. Following this, we also present a CSMA/SDMA protocol which incorporates basestation/portable signalling which mitigates the effects of hidden stations. The performance of these systems is characterized and compared using analytical throughput and capacity models. It is shown that when hidden stations are present, the capacity performance of the more sophisticated protocol may be much higher than that of the basic version.
Modeling Fault-Prone Modules of Subsystems
Authors: Taghi M. Khoshgoftaar, Vishal Thaker, Edward B. Allen
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Software developers are very interested in targeting software enhancement activities before release, so that rework of faulty modules can be avoided. Credible predictions of which modules are likely to have faults discovered by customers can be the basis for selecting modules for enhancement. Many case studies in the literature build models to predict which modules will be fault-prone without regard to subsystems defined by the system's functional architecture. Our hypothesis is this: models that are specially built for subsystems will be more accurate than a system-wide model applied to each subsystem's modules. In other words, the subsystem that a module belongs to can be valuable information in software quality modeling.This paper presents an empirical case study, which compared software quality models of an entire system to models of a major functional subsystem. The study modeled a very large telecommunications system with classification trees built by the Classification And Regression Trees algorithm (CART). For predicting subsystem quality, we found that a model built with training data on the subsystem alone was more accurate than a similar model built with training data on the entire system. We concluded that characteristics of the subsystem's modules were not similar to those of the system as a whole, and thus, information on subsystems can be valuable.
A Coordination Model to Specify Systems Including Mobile Agents
Authors: P. Ciancarini, F. Franze`, C. Mascolo
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

A coordination model provides a formal framework in which the interaction of active entities that we call agents can be expressed. A coordination model deals with the creation and destruction of agents, their communication activities, their distribution and mobility in space, as well as the synchronization and distribution of their actions over time. We show how a coordination model called PoliS offers a flexible basis for the description and the analysis of architectures of systems including mobile agents. We have developed a model checking technique for the automatic analysis of PoliS specifications.
Tuning of database audits to improve scheduled maintenance in communication systems
Authors: Stefano Porcarelli, Felicita Di Giandomenico, Amine Chohra, Andrea Bondavalli
Venue:  (2001)

To ensure the consistency of database subsystems involved in communication systems (e.g., telephone systems), appropriate scheduled maintenance policies are necessary. Audit operations, consisting in periodic checks and recovery actions, are typically employed in databases to cope with run time faults which may affect the dependability and quality of service of the overall system. This paper aims at investigating on appropriate tuning of audit operations, so as to find optimal balances between contrasting requirements, namely satisfactory database availability and low overhead due to audits. For this purpose, a methodology to analyse the behaviour of the database under scheduled maintenance is here suggested. Analytical models, essentially based on Deterministic and Stochastic Petri Nets (DSPN), are defined and analysed, in terms of dependability indicators. A sensitivity analysis wrt to the most affecting internal and external parameters is also performed on a case study. TEL:: +39 050 3152904 EMAIL:: digiandomenico@iei.pi.cnr.it
A Conservative Technique to Improve Deterministic Evaluation of Logic Programs
Authors: A. Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan, R. Sekar
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

The performance of logic programs can be significantly improved by reducing nondeterminism in their evaluation using techniques for early pruning of computation paths that would eventually fail. Using static information gleaned from the program, we can identify (simple) conditions that must hold for certain computation paths to succeed, and test them before searching along those paths. However, naive introduction of such tests can actually lead to performance degradation since tests may be repeated along a branch, and also because the tests themselves may create additional choice points. We therefore develop a program transformation algorithm that enables us to introduce only those tests that facilitate early pruning of failure branches, while providing formal guarantees against any performance degradation. Our transformation is based on a novel polyvariant program specialization technique that can reason about the relative execution times of the original and transformed programs. We present results of a prototype implementation that shows the effectiveness of our approach.
Algebraic Multigrid on Unstructured Meshes
Authors: Petr Vanek, Jan Mandel, Marian Brezina
Venue:  (1994)

An algebraic multigrid algorithm is developed based on prolongations by smoothed aggregation. Coarse levels are generated automatically. Heuristic principles to guide the choice of the coarseninning are introduced. Almost optimal convergence bounds are proved for uniformly elliptic problems, shape regular triangulations on the finest level, and a general class of coarse problem hierarchy. Coarsening is by the factor of about three, which guarantees low complexity and bounded energy of the coarse shape functions. Numerical experiments confirm the theory and demonstrate that the method performs well also on a general class of problems with highly variable coefficients and strong anisotropies.
Multigrid Methods for Nearly Singular Linear Equations and Eigenvalue Problems
Authors: Zhiqiang Cai, Jan Mandel, Steve McCormick
Venue:  (1993)

The purpose of this paper is to develop a convergence theory for multigrid methods applied to nearly singular linear elliptic partial differential equations, of the type produced from a positive definite system by a shift with the identity. The theory is first applied to a method for computing eigenvalues and eigenvectors that consists of multigrid iterations with zero right-hand side and updating the shift from the Rayleigh quotient before every cycle. It is then applied to the Rayleigh quotient multigrid method (RQMG), which is a more direct multigrid procedure for solving eigenproblems. Local convergence of the multigrid V-cycle and global convergence for a full multigrid version of both methods is obtained.
Dreamweaver MX: Asp.Net Web Development
Authors: Tim Parker
Venue:  (2002)

:ASP.NET is the latest version of Microsoft's Active Server Pages (ASP), the incredibly popular server-side scripting language. ASP.NET is based on the .NET framework, and combines unrivalled developer productivity with performance and reliability.This book is all about developing ASP.NET web sites with Macromedia Dreamweaver MX, the premier visual web site design tool. It will show you how to rapidly develop ASP.NET web applications with the minimum of fuss. What this book covers: The .NET Framework Dreamweaver MX and ASP.NET Using server behaviours Interacting with the database This book is for web professionals looking to develop database-driven ASP.NET web applications using Macromedia Dreamweaver MX. Some knowledge of HTML and web design is assumed, but you don't need to know any ASP.NET or SQL
Creating an Efficient Market on the World-Wide Web
Authors: Ramin Zabih
Venue:  (1996)

The World-Wide Web has dramatically reduced the price of publishing information. This has made it possible to make pricing information widely available, thus creating an efficient market. Web-based efficient markets may result in major changes in the way in which goods and services are bought and sold.
Strategy of Perception and Temporal Representation of Beliefs
Authors: Patrick J. Fabiani
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

An autonomous system uses sensors in order to update an uncertain representation of its environment, which must remain well-grounded with regards to the risks and the constraints of its mission. The choice of a framework for the representation of beliefs which is adapted to deal with both time and uncertainty is a crucial point. A perception strategy should be founded on an evaluation of the relevance of the beliefs of the system in order to collect the most useful information at the most opportune time. This paper addresses the problem of taking time and ignorance into account in the representation of the uncertain beliefs of the system about the world. It is proposed a well-adapted approach to the design of a perception strategy for an autonomous surveillance system in a changing environment together with initial results of simulations.
A tampering protocol for reducing the coherence transactions in regular computation
Authors: M. Takesue
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

This paper proposes a tampering protocol for reducing the coherence transactions in the computations with regular communication patterns. This protocol is a subsidiary of the conventional cache-coherence protocol and is activated on a memory-block basis. If activated for a block, the exclusive copy of that block is frozen in the cache and is accessed (i.e., tampered) with no coherence transactions; otherwise, the coherency is maintained by the conventional protocol. Thus by activating the tampering protocol for the shared data of processes, the latency of communication between the processes reduces. As a by-product, the stream data are effectively implemented with the tampering protocol. The effects of the tampering protocol on the regular computations are evaluated by an RTL simulator of our multiprocessor. The result shows that the tampering protocol greatly improves the performance with a conventional protocol. Then the stream is effective for the process synchronization.
Online Resources for Senior Citizens
Authors: Charles C. Sharpe
Venue:  (2003)

:About the AuthorCharles C. Sharpe is also the author of Patent, Trademark, and Copyright Searching on the Internet (2000, $32). He lives in Lansford, Pennsylvania. 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
Modelling and design of VAML
Authors: Congrong Liu, Jesse S. Jin
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

Non-linear interactive access to video is very important in video information management. The term non-linear refers to that there are more than one video streams delivering to users. To access video in a non-linear interactive way, it will involve issues such as: hyper-link to the external text source, synchronization between audio and video, hyper-link to external video, parameter passing, buffers for multiple streams of video, segmentation of video objects, representation of video sequences and the organization of source data. It is significant to study these issues clearly and develop a video annotation mark-up language (VAML). This paper introduces the main idea of VAML.
A Perturbation-based Testing Strategy
Authors: Branson Murrill, Larry Morell, Erika Olimpiew
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

Perturbation analysis involves changing the data state at a location in an executing program and determining the effect of that change on the program's remaining computation.This technique has been used to estimate propagation rates during fault sensitivity analysis, and also to compare test sets and testing strategies.This paper describes an error flow model that allows emphasis to be placed on propagation analysis, which is implemented using data state perturbation.A perturbation-adequate testing strategy is defined that is similar in concept to mutation testing, and some results are presented that support the coupling effect and the consistency of perturbation-adequate testing.Some observations are made that relate mutation to perturbation.
Fuzzy logic and mathematical morphology
Authors: Ting Deng
Venue:  (2000)

In this report we investigate the general theory of grey-scale morphology within the framework of complete lattices and fuzzy logic. This includes grey-scale granulometries, hit-or-miss operators for grey-scale images, rank operators, and connected operators. We also show that the Matheron''s representation theory does not hold for general grey-scale images and we present some results related to the representation theory. Besides these, in this report, we put forward a new approach to fuzzy morphology through the extension of infimum, supremum, and conjunction.
Sequential Functions on Indexed Domains and Full Abstraction for a Sub-language of PCF
Authors: Stephen Brookes, Shai Geva
Venue:  (1993)

We present a general semantic framework of sequential functions on domains equipped with a parameterized notion of incremental sequential computation. Under the simplifying assumption that computation over function spaces proceeds by successive application to constants, we construct a sequential semantic model for a non-trivial sub-language of PCF with a corresponding syntactic restriction --- that variables of function type may only be applied to closed terms. We show that the model is fully abstract for the sub-language, with respect to the usual notion of program behavior.
A Simple Program whose Derivation and proof is also
Authors: Jinyun Xue, Ruth Davis
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

This note presents a simple derivation and proof for Knuth's program that translates a binary fraction to a decimal fraction. The main technique used in this note is the partition-and-recur approach, that is, partitioning the problem, deriving an algorithm represented by recurrences, and finally transforming the algorithm to a program in a straightforward manner. Practice with this example has given us more confidence that partition-and-recur is a practicable approach for derivation and proof of general algorithms and programs.