ppxscal/embedding_network huggingface dataset:
Performance of scheduling strategies for client-server systems
Authors: S. Majumdar, T. Phillips
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Scheduling on client-server systems has not received much attention from researchers. Based on simulation this research presents a number of insights into system behavior and scheduling. Two phenomena, CPU monopolization by large service requests and software bottlenecking are observed to have a strong influence on system performance. Software bottlenecking is a new phenomenon, observed on distributed client server systems with multiple levels of servers and occurs when a higher level server is blocked waiting for a response to a service request from a lower level server. Policies based on request characteristics such as service times and path lengths are found to effectively control these effects and improve system performance.
Equivalence of recursive specifications in process algebra
Authors: Alban Ponse, Yaroslav S. Usenko
Venue:  (2001)

We define an equivalence relation on recursive specifications in process algebra that is model-independent and does not involve an explicit notion of solution. Then we extend this equivalence to the specification language $\mu$CRL.
Understanding Fire and Smoke Flow Through Modeling and Visualization
Authors: Glenn P. Forney, Daniel Madrzykowski, Kevin B. McGrattan, Laurel Sheppard
Venue: IEEE Computer Graphics and Applications (2003)

Structural fires cost the US economy more than $100 billion annually in property damage,fire department maintenance,and insurance premiums. A price can't be put on the human toll: each year on average, 4,000 civilians die and 23,000 get injured in fires. Approximately 80 percent of fire deaths occur in homes. Trying to put out these fires costs 80 to 100 fire fighters their lives and 80,000 to 90,000 more are injured every year.Smoke and toxic gas inhalation cause the majority of fire fatalities. Flashover, occurs when flames erupt and rapidly fill a compartment. Despite fire codes and improved building designs, flashover and smoke spread are still major problems and require a more complete understanding of fire behavior. Fortunately, we can use fire modeling and visualization tools to overcome these problems, ultimately leading to the prevention of smoke and fire spread.
Trading Bitwidth For Array Size: A Unified Reconfigurable Arithmetic Processor Design
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper presents a novel unified run-time reconfiguable arithmetic processor design scheme. It provides novel computational trade-offs between array/matrix size and input data item bitwidth, and efficiently performs multiple types of arithmetic operations in pipeline within a single hardware-reusable processor. The proposed computations include inner product evaluation, matrix multiplication, and evaluation of polynomial. More specifically, we show that the minimum hardware platform can be easily reconfigured to compute: (1) the inner products of two input arrays with several combinations of array dimension and precision, including input arrays of 256 4-bit items, 64 8-bit items, 16 16-bit items, 4 32-bit items and 1 64-bit item; (2) the product of matrices Xnk and Ykm for any integers n, k, m and any item precision b ranging from 4 to 64 bits, including input arrays of X16x16 Y16x16 of 4-bit items, X8x8 and Y8x8 of 8-bit items, X4x4, Y4x4 of 16-bit items, X2x2, Y2x2 of 32-bit items and the product of two 64-bit numbers; (3) the polynomial evaluations at any given point x, with several combinations of the polynomial degree N and evaluation point number precision p, including polynomial degree and item precision options of N=64, p=8, N=16, p=16, and N=4, p=32.
Emergent behaviours considered harmful
Authors: Dana Moore, William Wright
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Autonomous Agent Systems have proven difficult to instrument, monitor, control and test. Unit testing strategies are of little help, as they tend to stress functional aspects of a system rather than modal aspects and test at too low a level (the unit rather than the system). Further, emergent behaviours, indeterminacy, and the loose coupling of system elements often obscure the system's attributes. Absent specific inclusion in the system design of features that provide such specific capabilities, developers have little recourse to understand the systems they build. In this paper we describe ACME, a parallel agent system for testing used in UltraLog, a DARPA effort aimed at creating an ultra-survivable multi-agent system. We describe the motivation and architecture for a comprehensive testing system, and suggest a path for other MAS projects to improve testing and validation of their systems. Finally, we discuss the need for ad hoc logic changes in a running MAS, an instant messaging strategy for conversing with the system (including facilities for AliceBot and Jabber). We describe the use of the Ruby scripting language in the system and summarize the benefits and lessons learned.
An Empirical Study of Tracing Techniques from a Failure Analysis Perspective
Authors: Satya Kanduri, Sebastian Elbaum
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Tracing is a dynamic analysis technique to continuouslycapture events of interest on a running program. The occurrenceof a statement, the invocation of a function, and thetrigger of a signal are examples of traced events. Softwareengineers employ traces to accomplish various tasks, rangingfrom performance monitoring to failure analysis. Despiteits capabilities, tracing can negatively impact the performanceand general behavior of an application. In orderminimize that impact, traces are normally buffered andtransferred to (slower) permanent storage at specific intervals.This scenario presents a delicate balance. Increasedbuffering can minimize the impact on the target program,but it increases the risk of losing valuable collected datathe event of a failure. Frequent disk transfers can ensuretraced data integrity, but it risks a high impact on thetarget program. We conducted an experiment involving sixtracing schemes and various buffer sizes to address thesetrade-offs. Our results highlight opportunities for tailoredtracing schemes that would benefit failure analysis.
Market-based Resource Control for Mobile Agents
Authors: Jonathan Bredin, David Kotz, Daniela Rus
Venue:  (1997)

Mobile agents are programs that can migrate from machine to machine in a heterogeneous, partially disconnected network. As mobile agents move across a network, they consume resources. We discuss a system for controlling the activities of mobile agents that uses electronic cash, a banking system, and a set of resource managers. We describe protocols for transactions between agents. We present fixed-pricing and dynamic-pricing policies for resources. We focus on and analyze the sealed-bid second-price auction as a mechanism for dynamic pricing.
Introduction to Computing Systems: From Bits Gates to C Beyond, 2 edition
Authors: Yale N. Patt, Sanjay J. Patel
Venue:  (2003)

Introduction to Computing Systems: From bits & gates to C & beyond, now in its second edition, is designed to give students a better understanding of computing early in their college careers in order to give them a stronger foundation for later courses. The book is in two parts: (a) the underlying structure of a computer, and (b) programming in a high level language and programming methodology. To understand the computer, the authors introduce the LC-3 and provide the LC-3 Simulator to give students hands-on access for testing what they learn. To develop their understanding of programming and programming methodology, they use the C programming language. The book takes a "motivated" bottom-up approach, where the students first get exposed to the big picture and then start at the bottom and build their knowledge bottom-up. Within each smaller unit, the same motivated bottom-up approach is followed. Every step of the way, students learn new things, building on what they already know. The authors feel that this approach encourages deeper understanding and downplays the need for memorizing. Students develop a greater breadth of understanding, since they see how the various parts of the computer fit together. Table of contents 1 Welcome Aboard 2 Bits, Data Types, and Operations 3 Digital Logic Structures 4 The Von Neumann Model 5 The LC-3 6 Programming 7 Assembly Language 8 I/O 9 TRAP Routines and Subroutines 10 And, Finally...The Stack 11 Introduction to Programming in C 12 Variables and Operators 13 Control Structures 14 Functions 15 Testing and Debugging 16 Pointers and Arrays 17 Recursion 18 I/O in C 19 Data Structures Appendix A The LC-3 ISA Appendix B From LC-3 to x86 Appendix C The Microarchitecture of the LC-3 Appendix D The C Programming Language Appendix E Useful Tables Appendix F Selected Solutions (available at website)
Effects of Propotion of Metanorm Players on Establishment of Norm
Authors: Tomoshia Yamashita, Hidenori Kawamura, Masahito Yamamoto, Azuma Ohuchi
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

In this paper we introduce mutual choice mechanism into the norms game instead ofdirect penal regulation and reformulate the norms game with mutual choice.In orderto examine how the proportion of metanorm players to all payers influences on the establishment of norm in the metanorms game with mutual choice, we perform emulation under several proportions of metanorm players.We exclude the game the oretic assumption of uniformity as the metanorm player and observe the frequencyof the establishment of the norm.As a result, we confirm the robustness of mutual choice against insufficiency of the metanorm players.
Frame wavelet sets in Rd
Authors: X. Dai, Y. Diao, Q. Gu, D. Han
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper, we discuss the characterization of frame wavelet sets. We extend some results obtained earlier in the one-dimensional case. More specifically, we completely characterize tight frame wavelet sets in higher dimensions and obtain some necessary conditions and sufficient conditions for a set E to be a frame wavelet set in Rd. Several examples are presented and compared with those in the one-dimensional case. Using our results, one can easily construct various frame wavelet sets.
A Scalable Hierarchical Architecture for Distributed Network Management
Authors: Ping Wang, Xinman Li, Hong Zhao
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

In this paper, we present a hierarchical, scalable and dynamic management scheme for managing large-scale distributed networks. The proposed hierarchical architecture achieves scalability by modifying the number of components according to the size of network. Thehierarchical approach can efficiently distribute the loads and improve the reliability of the system. In order to increase flexibility, the system employs a policy-based dynamic subscription approach that enables users to manipulate management tasks at run-time. The event-triggered management mechanism enables the managers to discover and solve the problem of network in time. Moreover, the system can trigger or disable managementrules automatically according to some network events. This significantly improves autonomy of the system.
A neural network approach to multicast routing in real-time communication networks
Authors: C. Pornavalai, G. Chakraborty, N. Shiratori
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

Real-time communication networks are designed mainly to support multimedia applications, especially the interactive ones, which require a guarantee of Quality of Service (QoS). Moreover, multicasting is needed as there are usually more than two peers who communicate together using multimedia applications. As for the routing, the network has to find an optimum (least cost) multicast route, that has enough resources to provide or guarantee the required QoS. This problem is called QoS constrained multicast routing and was proved to be an NP-complete problem. In contrast to the existing heuristic approaches, in this paper we propose a modified version of a Hopfield neural network model to solve QoS (delay) constrained multicast routing. By the massive parallel computation of neural networks, it can find a near optimal multicast route very fast, when implemented in hardware. Simulation results show that the proposed model has performance near to the optimal solution and comparable to existing heuristics
Dynamic Behavior of Differential Pricing and Quality of Service Options for the Internet
Authors: Fishburn Peter, Odlyzko Andrew
Venue:  (1999)

The simple model on which the Internet has operated, with all packets treated equally, and charges only for access links to the network, has contributed to its explosive growth. However, there is wide dissatisfaction with the delays and losses in current transmission. Further, new services such as packet telephony require assurance of considerably better service. These factors have stimulated the development of methods for providing Quality of Service (QoS), and this will make the Internet more complicated. Differential quality will also force differential pricing, and this will further increase the complexity of the system. The solution of simply putting in more capacity is widely regarded as impractical. However, it appears that we are about to enter a period of rapidly declining transmission costs. The implications of such an environment are explored by considering models with two types of demands for data transport, differing in sensitivity to congestion. Three network configurations are considered: (1) with separate networks for the two types of traffic, (2) with a single network that provides uniformly high QoS, and (3) with a single physical network that provides differential QoS. The best solution depends on the assumptions made about demand and technological progress. However, we show that the provision of uniformly high QoS to all traffic may well be best in the long run. Even when it is not the least expensive, the additional costs it imposes are usually not large. In a dynamic environment of rapid growth in traffic and decreasing prices, these costs may well be worth paying to attain the simplicity of a single network that treats all packets equally and has a simple charging mechanism.
Special Edition Using StarOffice 6.0
Authors: Michael Koch
Venue:  (2002)

:Que crafted this book to grow with you, providing the reference material you need to master this productivity suite.
Formal Model of MOS Clocking Disciples
Authors: Kevin Karplus
Venue:  (1984)

This paper presents a formalization of clocking disciplines used to prevent race conditions in VLSI circuits. A signal-labeling scheme for the two-phase clocking discipline informally described in Mead and Conway [MC] is presented. Rules are given for checking the correct labeling of a circuit consisting of combinatorial logic and memory elements. The signal-labeling conventions are based in part on those of Noice, Mathews, and Newkirk [NMN]. A formal basis is presented for constructing signal-labeling schemes for multi-phase clocks (both overlapping and non-overlapping) from a definition of the master timing signals. The two-phase scheme is shown to be a special case of this general method. The method is also illustrated for four-phase overlapping clocks.
ÜberSim: a multi-robot simulator for robot soccer
Authors: Brett Browning, Erick Tryzelaar
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

A robot simulation engine can be a powerful tool for decreasing development time for robot control systems provided it captures the features of robot-environment interactions relevant to robot control. In this paper, we describe a new multi-robot simulation engine, called ÜberSim, specifically targeted for simulating games of robot soccer. For robot soccer, dynamics, friction, and collisions are integral to robot control thus our simulator must capture these aspects of the environment. Our approach builds on top of a physics simulation engine in order to capture these effects. We describe the current implementation of ÜberSim, which is a work in progress, and present some empirical comparisons of its performance compared to some real robots.
Combining Software and Hardware Monitoring for Improved Power and Performance Tuning
Authors: Eric Chi, A. Michael Salem, R. Iris Bahar, Richard Weiss
Venue: Proceedings of the Seventh Workshop on Interaction between Compilers and Computer Architectures (2003)

By anticipating when resources will be idle, it is possibleto reconfigure the hardware to reduce power consumptionwithout significantly reducing performance. This requirespredicting what the resource requirements will be for anapplication. In the past, researchers have taken one of twoapproaches: design hardware monitors that can measurerecent performance, or profile the application to determinethe most likely behavior for each block of code. This paperexplores a third option which is to combine hardwaremonitoring with software profiling to achieve lower powerutilization than either method alone. We demonstrate thepotential for this approach in two ways. First, we comparehardware monitoring and software profiling of IPC for codeblocks and show that they capture different information. Bycombining them, we can control issue width and ALU usagemore effectively to save more power. Second, we showthat anticipating stalls due to critical load misses in the L2cache can enable fetch halting. Again, hardware monitoringand software profiling must be used together to effectivelypredict misses and criticality of loads.
Saturation: An efficient iteration strategy for symbolic state-space generation
Authors: Ciardo Gianfranco, Luettgen Gerald, Siminiceanu Radu
Venue:  (2001)

This paper presents a novel algorithm for generating state spaces of asynchronous systems using Multi-valued Decision Diagrams. In contrast to related work, the next-state function of a system is not encoded as a single Boolean function, but as cross-products of integer functions. This permits the application of various iteration strategies to build a system''s state space. In particular, this paper introduces a new elegant strategy, called saturation, and implements it in the tool SMART. On top of usually performing several orders of magnitude faster than existing BDD-based state-space generators, the algorithm''s required peak memory is often close to the final memory needed for storing the overall state spaces.
Experience Report: Contributions of SFMEA to Requirements Analysis
Authors: Robyn R. Lutz, Robert M. Woodhouse
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

This experience report describes the lessons learned from the use of Software Failure Modes and Effects Analysis (SFMEA) for requirements analysis of critical spacecraft software. The SFMEA process was found to be successful in identifying some ambiguous, inconsistent, and missing requirements. More importantly, the SFMEA process, followed by a backward analysis somewhat similar to Fault Tree Analysis (FTA), identified four significant, unresolved requirements issues. These issues involved complex system interfaces and unanticipated dependencies. Our results challenge some current views on the limitations of SFMEA and suggest that recent efforts by researchers to integrate SFMEA with a broader FTA approach have merit.
Using A Double Weighted Clustering Technique for Fragment Allocation in Wide Area Networks
Authors: George Semeczko
Venue:  (1997)

Many papers have been written about resource allocation problems in distributed systems. In solving these optimization problems there has always been a trade-off between the optimality of the solution, the expense in deriving a solution and the complexity of the problem being solved. For problems in Wide Area Networks, the complexity of the problem is immediately more complicated than those for Local Area Networks as the variable communication costs become another factor in the optimization function. In this paper, we show that in practice Wide Area Networks have more structure than usually assumed. Given this, a structured model is presented that can be used to approximate Wide Area Networks and allow "better" solutions to optimization problems due to its properties. A measure is also presented that can be used to determine how close the allocation is to an optimal solution.
Report on the Type Theory (V3) of the Programming Logic PL/CV3
Authors: Robert L. Constable, Daniel R. Zlatin
Venue:  (1980)

NO SUPPLIED
Gibbsgen: Code Generation for Gibbs
Authors: Donna Bergmark
Venue:  (1986)

The Gibbs project at Cornell is devoted to providing a convenient programming environment for physical scientists. It allows the user to specify a program as a series of modules, called chapters. One design objective of the Gibbs project is reusability of program code and ideas. To achieve this objective, it is necessary to have a Gibbs database, a library of chapters that may be used to put together a configuration for solving a problem. This configuration is called a Gibbs program. The ultimate goal is to generate executable code from a Gibbs program. This paper describes the use of a non-procedural language in which each Gibbs chapter is expressed as a collection of relatively independent rules and axioms that together can be used to generate a particular Fortran program.
Computer Graphics with OpenGL, 3 edition
Authors: Donald D. Hearn, M. Pauline Baker
Venue:  (2003)

:Reflecting the rapid expansion of the use of computer graphics and of C++ as a programming language of choice for implementation, this book converts all programming code into the C++ language. This new edition is a complete revision, bringing the text up to date with current advances in computer graphics technology and applications. Assuming readers have no prior familiarity with computer graphics, the authorsboth authorities in their fieldpresent basic principles for design, use, and understanding of computer graphics systems using their well-known, and accessible writing style. It includes an exploration of GL, PHIGS, PHIGS+, GKS and other graphics libraries and covers topics such as distributed ray tracing, radiosity, physically based modeling, particle systems, and visualization techniques. For professionals in any area of computer graphics: CAD, Animation, Software Design, etc.
InterTool: Ett grafiskt granssnitt mot verifikationsverktyg
Authors: Roger Palmersjo
Venue:  (1993)

A prototype uniform graphical interface to verification tools is presented. Tools and data objects are displayed as icons in a working area. Tools can be connected with pipes to provide automatic data flow. The implementation runs in Unix and X-windows. The report describing the implementation is in Swedish, but appendixes concerning use and configuration are in English. 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
Essential Computers: Shortcuts in Word, 1 edition
Authors: Sue Etherington, Dorling Kindersley Publishing
Venue:  (2002)

:Essential skills for the information age. Written in clear, concise language with step-by-step solutions, and handy illustrations, the Essential Computer Series is ideal for learning specific skills and overcoming issues that thousands of computer users face every day. Packed with helpful essential, easy-to-follow tips, these five revised, updated, and accessible paperbacks are ideal for the home, school, or office. Author Biography: Sue Etherington has worked in the computer industry for over 20 years and currently runs her own computer training business.