ppxscal/embedding_network huggingface dataset:
Multi-Machine Scheduling - A Multi-Agent Learning Approach
Authors: Wilfried Brauer, Gerhard Weiβ
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

Multi-machine scheduling, that is, the assigment of jobs to machines such that certain performance demands like cost and time effectiveness are fulfilled, is a ubiquitous and complex activity in everyday life. This paper presents an approach to multi-machine scheduling that follows the multi-agent learning paradigm known from the field of Distributed Artificial Intelligence. According to this approach the machines collectively and as a whole learn and iteratively refine appropriate schedules. The major characteristic of this approach is that learning is distributed over several machines, and that the individual machines carry out their learning activities in a parallel and asynchronous way.
Parsing of Graph-Representable Pictures
Authors: Alan C. Shaw
Venue:  (1969)

This paper describes a syntax-directed picture analysis system based on a formal picture description scheme. The system accepts a description of a set of pictures in terms of a grammar generating strings in a picture description language; the grammar is explicitly used to direct the analysis or parse, and to control the calls on pattern classification routines for primitive picture components. Pictures are represented by directed graphs with labelled edges, where the edges denote elementary picture components and the graph connectivity mirrors the picture component connectivity; blank and don''t care ``patterns'''' allow the description of simple relations between visible patterns. The bulk of the paper is concerned with the picture parsing algorithm which is an n-dimensional analog of a classical top-down string parser, and an application of an implemented system to the analysis of spark chamber film. The potential benefits of this approach, as demonstrated by the application, include ease of implementation and modification of picture processing systems, and simplification of the pattern recognition problem by automatically taking advantage of contextual information. Key Phrases: picture processing, picture parsing, picture description, picture analysis, pattern recognition, top-down analyzer, graph representable pictures, syntax directed analysis, picture language, picture grammar, graphics language.
Secure Reliable Multicast Protocols in a WAN
Authors: Dahlia Malkhi, Michael Merritt, Ohad Rodeh
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

A secure reliable multicast protocol enables a process to send a message to a group of recipients such that all honest destinations receive the same message, despite the malicious efforts of fewer than a third of them, including the sender. This has been shown to be a useful tool in building secure distributed services, albeit with a cost that typically grows linearly with the size of the system. For very large networks, for which such a cost may be too prohibitive, we present two approaches for bringing the cost down: First, we show a protocol whose cost is on the order of the number of tolerated failures. Secondly, we show how relaxing the consistency requirement to a selected probability level of guarantee can bring down the associated cost to a constant.
Constraints-based access control
Authors: Wee Yeh Tan
Venue: Proceedings of the fifteenth annual working conference on Database and application security (2001)

The most important aspect of security in a database after establishing the authenticity of the user is its access control mechanism. The ability of this access control mechanism to express the security policy can make or break the system.This paper introduces constraints-based access control (CBAC) - an access control mechanism that general associations between users and permissions are specified by the rules (or constraints) governing the access rights of each user. This association is not restricted to static events but can include dynamic factors as well.One of the many advantages of CBAC is that even a static CBAC is a generalisation of most of the access control mechanism in use today. We demonstrate how CBAC can efficiently simulate role-based access control (RBAC) and access control list (ACL). In fact, CBAC allows the introduction of any abstract concepts as one would do roles in RBAC. On top of that, CBAC also allows the users to specify interactions between these concepts.Any flexibile access control method usually raises concerns over its time efficiency. We advocate the use of partial solutions to the access control constraints to improve the efficiency of CBAC.
Manual for the SPNP Package Version 1.0
Authors: Gianfranco Ciardo
Venue:  (1988)

This manual describes the current version of SPNP (Stochastic Petri Net Package), under development at Duke University. The package runs under the UNIX system on a wide array of platforms (VAX, Sun 3 and 4, Convex, Gould) and under VMS system (VAX). The description will apply mainly to UNIX-based systems; the appendix contains some minor differences for the VMS user. A basic knowledge of the SPN concepts is assumed. The reader would consult [1] if unfamiliar with some PN concept. The SPN model we adopt is best described in [2], but it may be useful to consult [3] (limited to exponential distributions) and [4] (for general distributions) as well. For a reference on the C language, see [5]. In the next section, we review the SPN terminology. Then we present the structure of the package and we explain how to describe a SPN to the package. The format of the files generated by the package is then presented, followed by the list of the available options. In the conclusion we list future work planned on the package. A set of examples is provided at the end of this manual.
A Measurement-Based Reliability/Performability Model for a Multiprocessor System
Authors: C M Hsueh, K R Iyer, S K Trivedi
Venue:  (1987)

A semi-Markov model is used in this paper to evaluate the resource-usage/error/recovery process in a large mainframe system. The model is based on low-level error and resource usage data collected on an IBM 3081 system during its normal operation. Both normal and erroneous behavior of the system are modeled. The results provide an understanding of the different types of errors and recovery processes. A sensitivity analysis is performed to investigate the significance of using a semi-Markov process (as opposed to a Markov process) to model the measured system. In addition, a measurement-based performability model based on real error-data collected is proposed. A reward function, based on the service rate and the error rate in each state, is defined in order to estimate the performability of the system and to depict the cost of different error types and recovery procedures.
Assessing the Sensitivity to Usage Profile Changes in Test Planning
Authors: Anders Wesslén, Per Runeson, Björn Regnell
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Software reliability is an important characteristic for most systems, but due to its dynamic properties, it is hard to assess until very late in the development. Nevertheless, the testing must be planned to meet the reliability requirements. In test planning, the notion of usage coverage may be used as an indicator of reliability as they are correlated with each other. When the testing is planned, the test cases to be run and the usage profile are derived. The usage profile is estimated using the available information of the expected usage. There are therefore some uncertainties in the estimated usage profile. This paper presents and evaluates a method for analysing the impact of uncertainties in the usage profile on the usage coverage. The method is applied during test planning to evaluate how sensitive the usage coverage is to usage profile uncertainties. Different usage profiles are simulated using the expected usage profile and an uncertainty expressed as a percentage value or a range within which the changed usage profile may vary. Test cases are derived from the expected usage profile and the resulting usage coverage is estimated for each simulated usage profile. Thus, the impact in the usage coverage can be analyzed. The presented analysis method is illustrated with an example system. One of the conclusions from this first study of the method is that the sparseness of the usage profile, which is defined by limitations in the usage pattern, reduces the impact of the usage profile uncertainties. Further, the number of test cases is an important factor in the sensitivity to uncertainties in the usage profile.
An expert system for foundation design of buildings: case demonstration of a GCPM-integrated prototype system
Authors: J. F. van den Adel, S. H. Al-Jibouri, U. F. A. Karim, M. Mawdesley
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

This paper reports on an integrated prototype expert system which has been developed to support geotechnical engineers during the initial foundation design phase. Design based on Dutch practice and geotechnical codes as well as constructional and project management aspects are programmed. The paper discusses an integrated approach for foundation design of buildings using a case-demonstration to show the proposed system and its basis. The modelling techniques used offer sound basis for including these aspects to routine geotechnical design. The example has indicated that the system is capable of integrating geotechnical design aspects with construction related aspects in order to produce better foundation design solutions.
Performance and Granularity Control in the SPaDES Parallel Simulation System
Authors: Yong-Meng Teo, Seng-Chuan Tay
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Parallel simulation has the potential to accelerate the execution of simulation applications. However, developing a parallel discrete-event simulation from scratch requires an in-depth knowledge of the mapping process from the physical model to the simulation model, and a substantial effort in optimisingperformance. This paper presents an overview of the SPaDES (Structured Parallel Discrete-Event Simulation) parallel simulation framework. We focus on the performance analysis of SPaDES/C++ , an implementation of SPaDES on a distributed-memory Fujitsu AP3000 parallel computer. SPaDES/C++ hides the underlying complex parallel simulation synchronization and parallel programming details from the simulationist. Our empirical results show that the SPaDES framework can deliver good speedup if the process granularity is properly optimised.
Analysis of IR-Drop Scaling with Implications for Deep Submicron P/G Network Designs
Authors: Amir H. Ajami, Kaustav Banerjee, Amit Mehrotra, Massoud Pedram
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

This paper presents a detailed analysis of the power-supplyvoltage (IR) drop scaling in DSM technologies. For the first time, the effectsof temperature, electromigration and interconnect technology scaling(including resistivity increase of Cu interconnects due to electron surfacescattering and finite barrier thickness) are taken into consideration duringthis analysis. It is shown that the IR-drop effect in the power/ground (P/G)network increases rapidly with technology scaling, and using well-knowncounter measures such as wire-sizing and decoupling capacitor insertionwith resource allocation schemes that are typically used in the presentdesigns may not be sufficient to limit the voltage fluctuations over the powergrid for future technologies. It is also shown that such voltage drops onpower lines of switching devices in a clock network can introducesignificant amount of skew which in turn degrades the signal integrity.
On the duality of operating system structures
Authors: Hugh C. Lauer, Roger M. Needham
Venue: ACM SIGOPS Operating Systems Review (1979)

Many operating system designs can be placed into one of two very rough categories, depending upon how they implement and use the notions of process and synchronization. One category, the "Message-oriented System," is characterized by a relatively small, static number of processes with an explicit message system for communicating among them. The other category, the "Procedure-oriented System," is characterized by a large, rapidly changing number of small processes and a process synchronization mechanism based on shared data.In this paper, it is demonstrated that these two categories are duals of each other and that a system which is constructed according to one model has a direct counterpart in the other. The principal conclusion is that neither model is inherently preferable, and the main consideration for choosing between them is the nature of the machine architecture upon which the system is being built, not the application which the system will ultimately support.
Human Immune System inspired Architecture for Self-Healing Digital Systems
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

This paper proposes an architecture for implementing self-healing digital systems. The adopted self-healing mechanism is inspired by the human immune system. The immune system functions without any central control. The control is distributed among all the cells in the immune system. A digital system based on the proposed architecture is composed of a number of functional cells that are interconnected to perform a desired function. As in the immune system the error detection in the cell-based digital system is done by adopting a distributed self-healing capability, with no centralized fault recognition and recovery. Recognition of the self and non-self states is a major feature of the human immune system. A self-healing digital system designed by using the concepts of the immune system has to employ similar strategy to distinguish between fault free and faulty states in the system. In the proposed architecture all cells are programmable, and can perform logical and arithmetic operations. A functional cell has two outputs that are complement to each other under non-faulty conditions, and in the presence of a fault the outputs are not complementary. Once a faulty cell is identified a spare cell replaces it; the spare cells are distributed through out the system.
A Low-Noise, High-Gain Single-Ended Input Double-Balanced Mixer
Authors: Jin-Young Choi, Sang-Gug Lee
Venue: Analog Integrated Circuits and Signal Processing (2003)

A noble single-ended input, double-balanced mixer topology is proposed. The mixer adopts a transconductance stage that amplifies the input and then converts it into differential currents leading to overall performance advantage compared to prior CG(common-gate)-CS(common-source)-based transconductance-stage mixer topologies without requiring additional power dissipation or extra transistor. The key specifications are compared with those of reported similar topologies, based on simulations.
Chrestenson Spectrum Computation Using Cayley Color Graphs
Authors: Mitchell A. Thornton, D. Michael Miller, Whitney J. Townsend
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

A method based on eigenvalue computations is formulatedfor computing the Chrestenson spectrum of adiscrete p-valued function.This technique is developed byconsidering an extension to the same approach of computation ofthe Walsh spectrum for a two-valued functionand is then generalized to the p-valued case. Algebraic groupsare formulated that correspondto Cayley color graphs based on the function of interestwhose adjacency matrices have spectraequivalent to the Walsh or Chrestenson spectrum of the functionunder consideration. Because the transformation matrix is not usedin any of these computations, the method provides an alternativeapproach for spectral computations.
Patterns of Communication in Consensus Protocols
Authors: Cynthia Dwork, Dale Skeen
Venue:  (1984)

This paper presents a taxonomy of consensus problems, based on their safeness and liveness properties, and then explores the relationships among the different problems in the taxonomy. Each problem is characterized by the communication patterns of protocols solving it. This then becomes the basis for a new notion of reducibility between problems. Formally, problem $P_{1}$ reduces to problem $P_{2}$ whenever each set of communication patterns of a protocol for $P_{2}$ is the set of comunication patterns of a protocol for $P_{1}$. This means intuitively that any protocol for $P_{2}$ can solve $P_{1}$ by relabeling local states and padding messages. Consequently, the message complexity (measured in number of messages) of $P_{1}$ is not greater than the message complexity of $P_{2}$. Our method of characterizing and comparing problems is the principal contribution of this paper.
CMM in uncertain environments
Authors: Zhou Zhiying
Venue: Communications of the ACM (2003)

Injecting ancient Chinese philosophy into modern science and technology provides a unique perspective on uncertainty and rapid change.
FileMaker Pro 6 for Windows and Macintosh: Visual QuickStart Guide
Authors: Nolan Hester
Venue:  (2002)

:If you recently upgraded to FileMaker Pro 6 to take advantage of its new digital image management features or its full XML support, you'll also want to upgrade to FileMaker Pro 6 for Windows and Macintosh: Visual QuickStart Guide. Revised to include all of the new features in FileMaker Pro 6, this update to the popular Visual QuickStart Guide is still the fastest and easiest way to learn FileMaker Pro. Loaded with screenshots and clear, concise explanations of database publishing techniques, FileMaker Pro 6 for Windows and Macintosh: Visual QuickStart Guide takes you from working with records and files to creating and designing databases, printing and networking with FileMaker, and Web publishing with FileMaker in no time. Step-by-step tasks show you how to use new digital image management features to organize and work with massive amounts of digital photos with minimal effort. You'll also learn to take advantage of FileMaker's new XML support to easily share and integrate data with other applications-even those not running FileMaker.
An Evaluation of Single-Ended and Differential Impedance in PCBs
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Electrical performance of pulses propagating in Printed Circuit Boards (PCBs) is determined by the characteristic impedance, differential impedance, and terminating impedance of both single-ended and differential pairs. In this paper, numerical values are evaluated for the characteristic impedance, differential impedance, and common mode impedance of microstrip and strip transmission lines embedded in a PCB stack up. These numerical values are also plotted for different values of frequency, ratios of signal width to signal height above a ground plane, and signal separation to signal height. 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
A Parallel Algorithm for Large Sparse Cholesky Factorization on a Multiprocessor
Authors: Earl Zmijewski, John R. Gilbert
Venue:  (1986)

We develop an algorithm for computing the symbolic and numeric Cholesky factorization of a large sparse symmetric positive definite matrix. The algorithm is intended for a message-passing multiprocessor system, such as the hypercube, and is based on the concept of elimination forests. In addition, we provide an algorithm for computing these forests along with a discussion of the algorithm''s complexity and a proof of its correctness. We also examine the related issue of load balancing.
Technological frames recursive construction approach: a systemic theory for information technology incorporation in organizations
Authors: Jeimy J. Cano
Venue: Critical reflections on information systems: a systemic approach (2003)

Information Technology, during the last few years, has turned into a determining factor of modern organization development. In this line, a lot of studies have been conducted aimed at explaining the possible relations to company's productivity and competitiveness, which to some extent, leads to causal conclusions, casting structural individual relationships into a background in the organizational tasks. In this direction, social researchers have incorporated valuable elements to understand the individuals 'position in the construction of technological artifacts and the comprehension thereof in the organization scope. Such research led to the statement of the concept of so-called technological frames, which explicitly incorporate an individual's social and cognitive distinctions around the technological context in a community. Subsequent studies, however, fail to delve into the way such frames are constructed or influenced in a significant extent by the companies's tasks or technology incorporations. For such reasons, this paper, based on the assumption that Information Technology is the result of individuals' social interaction, is intended to explore the benefits of individuals' structural relations understanding in Information Technology incorporation to integrate the findings of causal research and systemic elements (the study of relations), focusing on information technology understanding in the organizational tasks.
Managing Soft QoS Requirements in Distributed Systems
Authors: Gary Molenkamp, Michael Katchabaw, Hanan Lutfiyya, Michael Bauer
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

We address the problem of soft Quality of Service (QoS) requirements for multimedia applications (e.g., distance education, telemedicine, electronic commerce). These applications need to be able to co-exist with more traditional applications for transaction and data processing and have soft real-time requirements. Unlike most other work in QoS management, we provide a framework that does not require users or application developers to have detailed knowledge of the resources needed and resource scheduling and allocation techniques in use. These underlying details are effectively hidden. In this paper, we describe our strategy, an architecture of services to support the strategy and a prototype.
Sap R/3 Impementacion Tecnica Mediante ASAP: Establecer e Integrar Un Sistema Productivo En El Entorno
Authors: Hartwig Brand
Venue:  (2002)

:EI presente libro le introduce en la implementacion tecnica de SAP R/3 (Release 4.0) con el metodo eficaz ASAP. ASAP es la abreviatura de AcceleratedSAP (=SAP acelerado), y la asociacion con As Soon As Possible (= tan pronto como posible) es intencionada. Usted aprendera como aprovechar ASAP, y como puede establecer un sistema R/3 productivo e integrarlo en un sistema de entorno, en un periodo de introduccion lo mas breve posible. A la vez se tiene en cuenta como Usted puede realizar, durante la implementacion, las bases para asegurarse de la mas alta efectividad del sistema con los costes mas bajos posibles. Si esta empezando con la introduccion de SAP R/3 o si quiere ampliar su sistema R/3 actual, en cualquier caso, le seran utiles las experiencias de innumerables proyectos de exito que le presenta este libro de forma concentrada. 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