ppxscal/embedding_network huggingface dataset:
Design Quality and Design Efficiency; Definitions, Metrics and Relevant Design Experiences
Authors: Einar J. Aas
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Design quality metrics will be defined in terms of the probability that a completed design satisfies its specifications. The definition rests on the concept of atomic design operations, and is by nature canonical. It is shown that this definition is truly analogous to test quality, leading to a unified model of test and design quality. Another important aspect of the design is its efficiency, related to design parameters. The metrics of design efficiency may be expressed as a cost function, and different design proposals may be evaluated against estimated design efficiency. Examples from several years of graduate level student design experiments will be given in order to demonstrate the usefulness of these metrics.
Access Control in Wide-Area Networks
Authors: Matti A. Hiltunen, Richard D. Schlichting
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Access control involves maintaining information about which users can access system resources and ensuring that access is restricted to authorized users. In wide-area networks such as the Internet, implementing access control is difficult, since resources may be replicated, the task of managing access rights may be distributed among multiple sites, and events such as host failures, host recoveries, and network partitions must be dealt with. This paper explores the problem of access control in such an environment, and in particular, the inherent tradeoff between security, availability, and performance. Techniques for dealing with access control in the presence of partitions are presented and used as the basis for an algorithm that allows application control over these tradeoffs.
On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimate
Authors: Gianna Del Corso, Giovanni Manzini
Venue:  (1999)

In this paper we consider the problem of estimating the largest eigenvalue and the corresponding eigenvector of a symmetric matrix. In particular, we consider iterative methods, such as the power method and Lanczos algorithm. These methods need a starting vector which is usually chosen randomly. We analyze the behavior of these methods when the initial vector is chosen with uniform distribution over the unit n-dimensional sphere. In particular, we give upper and lower bounds on the L_p norm of the randomized error, and we improve previously known bounds with a detailed analysis of the role of the multiplicity of the largest eigenvalue.
Selfish Memes and Selfless Agents - Altruism in the Swap Shop
Authors: D. Hales
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

A memetic approach is applied to a resource sharing scenario. Agents are represented as cells on a grid applying simple cultural learning rules which selectively replicate and repel memes from neighbours. The memes represent culturally learned traits but also influence resource sharing behaviours.In the experiments presented, multiple cultural groupings which become altruistic towards "in-group" members emerge via a form of group selection.It is demonstrated that such methods can produce more optimal societies than conventional evolutionary methods in given situations. The memetic approach is inherently distributed and dynamic, offering the possibility of application to areas such as collective robotics and software agent co-ordination. 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
Development and Application of a Distance Learning Support System Using Personal Computers via the Internet
Authors: Takashi Yoshino, Takaya Yuizono, Yoji Nagasawa, Shiro Ito, Kazutomo Yunokuchi, Jun Munemori
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

A distance learning support system using the Internet for communication, which can support 40 personal computers, has been developed. The system supports audio and video communication channels. During Q&A sessions, the teacher and one student can communicate with each other through audio and video equipment. The system is also equipped with two shared cursors (one for the teacher, the other for the students) and the Blackboard system and Note system for students. The system has been tested on three different kinds of classes (a lecture on human interface engineering, an exercise on applied mathematics II, and a lecture on high frequency engineering). The results of distance learning experiments suggested: (1) After applying the system to actual classes, we found that the system required the additional functions of a randomly controlled remote-control camera, card materials transfer, and an interlocking marker. (2) We found that student participants in distance learning felt as if they were in the same building
Do Program Transformations Help Reverse Engineering?
Authors: K. H. Bennett
Venue: Proceedings of the International Conference on Software Maintenance (1998)

Program transformations have been advocated as a method for accomplishing reverse engineering. The hypothesis is that the original source code can be progressively transformed into alternative forms, but with the same semantics. At the end of the process, an equivalent program is acquired, but one which is much easier to understand and more maintainable.We have been undertaking an extensive programme of research over twelve years into the design and development of transformations for the support of software maintenance. The paper very briefly explains the theory, practice and tool support for transformational systems, but does not present new theoretical results. The main results are on an analysis of the strengths and weaknesses of the approach, based on experience with case studies and industrial applications. The evaluation framework used (called DERE) is that presented in [5]. It is hoped that the results will be of benefit to industry, who might be considering using the technology; and to other researchers, interested in addressing the open problems.The overall conclusion is that transformations can help in the bottom-up analysis and manipulation of source code at approximately the 3GL level, and have proved successful in code migration, but need to be complemented by other top-down techniques to be useful at higher levels of abstraction or in more ambitious re-engineering projects.
McCarthy''s Amb Cannot Implement Fair Merge
Authors: Prakash Panangaden, Vasant Shanbhogue
Venue:  (1988)

In this paper, we establish that fair merge is a powerful non-deterministic primitive that cannot be implemented in terms of other well-known primitives. It is well known that fair merge embodies countable non-determinism. It is also been known that McCarthy''s amb embodies countable non-determinism. It had not been known, however, whether amb could implement a fair merge. We show that countable non-determinism together with angelic non-determinism cannot implement fair merge even in dynamic dataflow networks. This settles a question posed by Abramsky over four years ago. Earlier work had suggested this result by showing that for static dataflow networks, one cannot implement fair merge using angelic merge.
Performance and Availability Evaluation of NUMA Architectures
Authors: Robert Geist, James Westall
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

A new approximation technique is proposed for obtaining analytic estimates of the performance of computing systems exhibiting non-uniform memory access (NUMA) times, where components are subject to failure and repair. The technique uses a multi-chain mean-value analysis together with a service time scaling factor derived to correct for the non-exponential (deterministic) service times found in most service units of a NUMA architecture. The new technique is seen to provide excellent agreement with simulation results in predicting both mean network cycle time and contention at the deterministic system devices. Availability estimation is based on a machine-repair model with deterministic repair (replacement). In this case, exact analysis is available using techniques from Markov Regenerative Stochastic Petri Nets.
Solving Systems of Nonlinear Equations on a Message-Passing Multiprocessor
Authors: Thomas F. Coleman, Guangye Li
Venue:  (1987)

We develop parallel algorithms for the solution of dense systems of nonlinear equations on a message-passing multiprocessor computer. Specifically, we propose a distributed finite-difference Newton method, a multiple secant method, and a rank-1 secant method. Experimental results, obtained on an Intel hypercube, indicate that our methods exhibit good parallelism.
Service Level Management in ATM Networks
Authors: Daniel Puka, Manoel Camillo Penna, Vinicius Prodocimo
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Contractual relation between customers and telecommunications service providers are becoming increasingly complex, due largely to changes in the marketplace and growth in the number and complexity of services on offer. In order to guarantee a certain quality of offered service and in response to customer needs, some mechanisms of service level management must be applied. The service level management in telecommunication networks is made by a agreement, established during the service subscription, which is used by customers and service providers to control the service level. This paper introduces a service level management system for ATM networks, which can be applied to different telecommunication systems.
A Scalable Distributed QoS Multicast Routing Protocol
Authors: Chen Shigang, Shavitt Yuval
Venue:  (2000)

Many Internet multicast applications such as teleconferencing and remote diagnosis have Quality-of-Service (QoS) requirements. Such requirements can be additive (end-to-end delay), multiplicative (loss rate) or with a bottleneck nature (bandwidth). For these applications, QoS multicast routing protocols are important in enabling new receivers to join a multicast group. However, current routing protocols are either too restrictive in their search for a feasible path between a new receiver and the multicast tree, or burden the network with excessive overhead. In this paper we propose S-QMRP, a new Stateless Qos Multicast Routing Protocol that supports all three QoS requirement types. S-QMRP is scalable because it has very small communication overhead and requires no state outside the multicast tree; yet, it retains a high success probability. S-QMRP achieves the favorable tradeoff between routing performance and overhead by carefully selecting the network sub-graph in which it conducts the search for a path that can support the QoS requirement, and by auto-tuning the selection according to the current network conditions. S-QMRP does not require any global network state to be maintained and can operate on top of any unicast routing protocol. Our extensive simulation shows that S-QMRP performs better than the previously suggested protocols.
Development of Methods and Algorithms of the Organization of Data Transmission Units and Computer Networks of the Enterprises
Authors: Sergey V. Mirvoda
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The problems of creation of the automated designing system of the local computer network are considered. The opportunity of representation of cable system as mathematical model is considered. The structure of model of system of the automated designing of the computernetwork is developed on the basis of the graphs theory. 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
Using resource-based theory to interpret the successful adoption and use of information systems and technology in manufacturing small and medium-sized enterprises
Authors: Mário M. Caldeira, John M. Ward
Venue: European Journal of Information Systems (2003)

The purpose of this paper is to consider how resource-based theory can be used to explain success with the adoption and use of information systems and information technology (IS/IT) in manufacturing small and medium-sized enterprises (SMEs). A number of authors have explored the applicability of resource-based theory to the IS/IT domain, mainly at a conceptual level. Overall they infer that the key differentiators for long-term successful IS/IT deployment reside within the internal context of an organisation, based on organisational competences. This paper is based on in-depth case study research in 12 Portuguese manufacturing SMEs, which identified two factors that, from the empirical evidence, appeared to be the determinants of the different levels of success in IS/IT adoption and use. These factors were also primarily associated with the internal context of the organisations. Therefore, the findings were analysed from the perspective of resource-based theory, to understand why and how the attributes of these factors caused the differential levels of IS/IT success in the firms studied.
Proceedings of the North American Process Algebra Workshop 1993 Ithaca, NY
Authors: Bard Bloom
Venue:  (1993)

This contains the papers presented at the second North American Process Algebra Workshop, August 15, 1993, at Cornell University. Contents: * A Semantic Theory for ML Higher Order Concurrency Primitives (Dominique Bolignano and Mourad Debabi) * An Operational Semantics of Value Passing (Rance Cleaveland) * An Information Flow Security Property for CCS (Riccardo Focardi and Roberto Gorrieri) * Concurrent Kripke Structures (Vineet Gupta) * Specification of Instruction-Level Parallelism (Ed Harcourt and Jon Mauney and Todd Cook) * Specification of Transition Systems with Negation (Remi Lissajoux) * A Comparison of Simulation and Algebraic Techniques for Verifying Concurrent Systems (Nancy Lynch and Roberto Segala) * A note on Model Checking Context Free Processes (S. Purushothaman Iyer) * State Refinement in Process Algebra (Andrew Uselton and Scott Smolka) * Parametric Preorders for Process Description Languages (Daniel Yankelevich)
Software Engineering Models for Quality: Comparing the SEI Capability Maturity Model (CMM) to ISO 9001
Authors: R. Bamford, W. Deibler
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

The growing world-wide acceptance of IS0 9001 presents DOD software and system suppliers, familiar with Version 1.1 of the Software Engineering Institute (SEI) Capability Maturity Model (CMM), with requirements to comply with IS0 9001. At the same time, commercial software and system suppliers, already familiar with IS0 9001 and IS0 9000-3 are considering the value of the CMM as a tool for process definition and improvement. Software Engineering Process Group (SEPG) teams and Quality System implementers must reconcile at least two models (IS0 9001 and the CMM) - both of which describe business practices and which are often portrayed as either in conflict or as mutually exclusive alternatives. This tutorial allows the student to identify and leverage the strengths of these two models to improve software engineering practices in their company.
The Multi-Agent System for Dynamic Network Routing
Authors: Ryokichi Onishi, Saneyasu Yamaguchi, Hiroaki Morino, Hitoshi Aida, Tadao Saito
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

The single-hop communication method of the current wireless network cannot meet new demands in the domain such as ITS 1 and Home LAN. Even though the ad-hoc network architecture is expected to solve this problem, but the nature of a dynamic topology makes this routing hard to be realized. This paper introduces a new ad-hoc routing algorithm, which is inspired by [12]. In their system [12], some control agents explore the network and update routing tables on their own knowledge. Using these routing tables, other agents deliver messages. They considered the feasibility of the agent-based routing system, but did not refer to an efficient algorithm. In this paper, we consider that algorithm without increasing network load. We propose multiplying each entry in the routing table to store much more information from agents and evaluating them to make better use of information, which succeeded in raising the network connectivity by about 40% by simulation.
Sams Teach Yourself C in 21 Days, 6 edition
Authors: Jones, Peter Aitken
Venue:  (2002)

:In just 21 days, you'll have all the skills you need to get started with C. With this complete tutorial, you'll master the basics and them move on to the more advanced features and concepts.Understand the fundamentals of C.Master all the new and advanced features that C offers.Learn how to effectively use the latest tools and features of C, by following practical, real-world examples.Get expert tips from a leading authority on implementing C in the corporate environment.Sams Teach Yourself C in 21 Days is designed for the way you learn. Go chapter by chapter through the step-by-step lessons, or just choose those lessons that interest you the most.
On slot allocation for time-constrained messages in DQDB networks
Authors: Ching-Chih Han, Chao-Ju Hou, K. G. Shin
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

The paper addresses the issue of guaranteeing the timely delivery of isochronous messages with hard deadlines in a distributed queue dual bus (DQDB) network. The authors propose a slot allocation scheme which can allocate bandwidth for a set of isochronous message streams and provide deterministic deadline guarantees. The allocation scheme is guaranteed to find a feasible slot allocation (in the sense that all messages can be transmitted in a timely manner) as long as the total message density is less than or equal to a certain threshold, where the total message density is defined as the summation (over all message streams) of the ratio of maximum message size to message deadline. The implementation of this scheme is simple and does not require any change of the current DQDB standard.
Dependability Prediction: Comparison of Tools and Techniques
Authors: Marco Mulazzani, S K Trivedi
Venue:  (1986)

Dependability measures (such as reliability, mean time to failure, availability) are important criteria for the design of computer-based applications, as well as for their validation. In this paper important techniques for dependability modeling are discussed, including methods of model construction and model solution. Some of the recent software packages for dependability analysis are compared: ADVISER, ARIES, CARE III, GRAMP, HARP, METFAC, SAVE, SHARPE, and SURF. The assumptions and properties of the software packages are analyzed with respect to a variety of different criteria including user interface, supported structures and principles, reconfiguration, repair, and solution method.
The Smart Classroom: Merging Technologies for Seamless Tele-education
Authors: Yuanchun Shi, Weikai Xie, Guangyou Xu, Runting Shi, Enyi Chen, Yanhua Mao, Fang Liu
Venue: IEEE Pervasive Computing (2003)

The Smart Classroom lets teachers simultaneously instruct remote and local students. It provides a pen-based user interface on a projected display and a computer-vision-based module for selecting remote students using a laser pointer. A speech-capable computer-animated virtual assistant lets the teacher control the presentation of lecture materials and informs the teacher of classroom events. In addition, a context-aware Smart Cameraman module automatically switches between several cameras so the live video for remote students always follows the class focus. The system's underlying software infrastructure, the Smart Platform, has a multi-agent based architecture with a loosely coupled publish-subscribe coordination model and a well-defined wire protocol. The Smart Platform's development interface is fairly simple, so developers can easily understand and use the system.
The Computational Requirements of Clipping against the Individual Subdivisions of the Graphical Image Space in a Parallel Environment
Authors: Ruth Christie
Venue:  (1994)

When distributing the object data for rendering in a MIMD network all erroneous data must be clipped against each of the subdivisions of the image space which have been allocated to the individual processors. This process of clipping entails an added computational cost to that of the actual rendering algorithm. This paper looks at the effect of clipping on rendering in a parallel environment and determines a way of minimising the computational cost of that clipping when using a Transputer network.
cJVM: A Single System Image of a JVM on a Cluster
Authors: Yariv Aridor, Michael Factor, Avi Teperman
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

cJVM is a Java Virtual Machine (JVM) that provides a single system image of a traditional JVM while executing on a cluster. cJVM virtualizes the cluster, supporting any pure Java application without requiring any code modifications. By distributing the application's work among the cluster's nodes, cJVM aims to obtain improved scalability for Java Server Applications. cJVM uses a novel object model which distinguishes between an application's view of an object and its implementation (e.g., different objects of the same class may have different implementations). This allows us to exploit knowledge on the usage of individual objects to improve performance.cJVM is work-in-progress. Our prototype runs on a cluster of IBM IntelliStations running Win/NT and are connected via a Myrinet switch. It provides a single system image to applications, distributing the application's threads and objects over the cluster. We have used cJVM to run without change a {\em real} Java application containing over 10Kloc and have achieved linear speedup for another application with a large number of independent threads. This paper discusses cJVM's architecture and implementation, showing how to provide a single system image of a traditional JVM on a cluster.
A Message-Driven Programming System for Fine-Grain Multicomputers
Authors: Daniel Maskit
Venue:  (1994)

No abstract available.
Object-Based Representation and Classification of Spatial Structures and Relations
Authors: Florence Le Ber, Amedeo Napoli
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

This paper is concerned with the representation and the classification of spatial relations and structures in an object-based knowledge representation system. In this system, spatial structures are defined as sets of spatial entities connected with topological relations. Relations are represented by objects with their own properties. We propose to define two types of properties: the first ones are concerned with relations as concepts while the second are concerned with relations as links between concepts. In order to represent the second type of properties, we have defined facets that are inspired from the constructors of description logics.We describe these facets and how they are used for classifying spatial structures and relations on land-use maps. The links between the present work and related work in description logics are also discussed.