ppxscal/embedding_network huggingface dataset:
Implementation of a Clan-Based Graph and Its Use on Program Dependency Graphs From FORTRAN Source Programs
Authors: Alan D. Reed
Venue:  (1993)

This paper documents the Master''s project of the author. It reviews the background literature of the parallelizing Scalable Software Transformations (PSST) project which is being funded by the National Science Foundation. It defines the problem, introduces the Parallelizing Assistant Tool (PAT), and describes the intermediate form, the static single assignment program dependence graph (SSA-PDG). It also describes the algorithms and implementation of several components of the parallelizing tools that are part of the project. Specifically, the paper documents the C++ software that creates PDGs from programs specified in Fortran source code and parses the PDG into a heirarchy of clans. It concludes with a complete example containing program output. 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
Visualisation of photovoltaic clad buildings
Authors: M. Horne, R. Hill, C. Underwood
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

Architectural composition in the electronic design studio: conceptual design using CAD visualisation and virtual reality modelling - Dobson, A. Comput. Aided Archit. Design Unit, Luton Univ., UKThe paper describes a study carried out to investigate the capabilities of computer aided design software for the visualisation of building elevations and detail, with focus on the representation of photovoltaic cells in facade architecture. The development of photovoltaic (PV) technology, converting energy from sunlight into electricity, has resulted in the emergence of PV as a building material. This has generated much debate on the aesthetic implications of PV integrated buildings. PV introduces a particularly complex set of requirements not present in traditional cladding materials. As well as the physical characteristics of the material, there is a need to consider factors such as orientation to the sun, and shadows cast by neighbouring buildings. Architects, engineers, developers, clients and the general public all need to be able to visualise proposed designs, either of new or refurbished buildings. This study investigates both the process and end results of computer visualisation in the context of photovoltaic clad buildings.
Comparing disk and memory's resistance to operating system crashes
Authors: Wee Teck Ng, C. M. Aycock, G. Rajamani, P. M. Chen
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Memory is commonly viewed as an unreliable place to store permanent data (files) because it is perceived to be vulnerable to system crashes. Yet despite all the negative implications of memory's unreliability, no data exists that quantifies how vulnerable memory actually is to system crashes. This paper quantitatively compares the vulnerability of disk and memory to operating system crashes. We use software fault injection to induce a wide variety of operating system crashes in DEC Alpha workstations running Digital Unix, ranging from bit errors in the kernel stack to deleting branch instructions to C-level allocation management errors. We find that files on disk are rarely corrupted (1.1% corruption rate), which agrees with our intuition. We also find that, surprisingly files in memory are nearly as safe as files on disk. Only 10 of the 650 crashes we observed (1.5%) corrupt any files in memory. Our data contradicts the common assumption that operating system crashes often corrupt files in memory and suggests that memory can be used to store permanent data rather than needing to write it back to disk.
Multi-Dimensional Input Devices and Interaction Techniques for a Modeler-Animator
Authors: Melissa Y. Gold
Venue:  (1990)

As powerful computers become less expensive, applications such as interactive three-dimensional modeling and animation systems, currently used by relatively few people, will become available to a much wider audience. It is therefore important to find ways to make these systems easier and more intuitive to use. One of the problems with current systems is that they typically provide users with one- or two-degree-of-freedom input devices with which to perform three-dimensional interaction tasks. This paper explores currently available multi-dimensional input devices as an alternative. It also describes experiments with using a six-degree-of-freedom input device for the tasks of point location, translation, rotation, camera placement, and path drawing in a modeling and animation system. However, even with multi-dimensional input devices, certain tasks, such as precisely placing one object in relation to another, are difficult to accomplish using only basic transformations such as translation and rotation. Accordingly, this paper also investigates a snapping technique, independent of input device, which allows users to position one object at a specific point on the surface of another. 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
Mobile Agents in Network-Centric Warfare
Authors: Marion G. Cerut
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

This paper describes agent technology and the various ways in which it can be applied to command, control, communications and intelligence in general, and to network-centric warfare in particular. The paper provides a brief overview of agents, their properties, and their advantages. It covers the concept of the current military trend, network-centric warfare. Problems associated with agents are described, including the conflict between security and autonomy in a distributed environment. The paper concludes with a discussion of research trends in mobile agents, particularly with regard to applications in the Department of Defense.
Fast Polar Decomposition of an Arbitrary Matrix
Authors: Nicholas J. Higham, Robert S. Schreiber
Venue:  (1988)

The polar decomposition of an $m x n$ matrix $A$ of full rank, where $m \geq n$, can be computed using a quadratically convergent algorithm of Higham [SIAM J. Sci. Stat. Comput., 7 (1986), pp.1160-1174]. The algorithm is based on a Newton iteration involving a matrix inverse. We show how with the use of a preliminary complete orthogonal decomposition the algorithm can be extended to arbitrary $A$. We also describe how to use the algorithm to compute the positive semi-definite square root of a Hermitian positive semi-definite matrix. We formulate a hybrid algorithm which adaptively switches from the matrix inversion based iteration to a matrix multiplication based iteration due to Kovarik, and to Bjorck and Bowie. The decision when to switch is made using a condition estimator. This ``matrix multiplication rich'''' algorithm is shown to be more efficient on machines for which matrix multiplication can be executed 1.5 times faster than matrix inversion.
Automated Quality Analysis of Component Software for Embedded Systems
Authors: Jens H. Jahnke, Jörg Niere, Jörg Wadsack
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

The Java programming language has gained increasing importance for the development of embedded systems. To be cost efficient, such systems have to cope with significant hardware restrictions, which result in certain software programming restrictions. Recently, companies have started to apply Java component technology also in the area of embedded systems. Components are pieces of software with a defined interface, which can be reused, in different applications. Typically, components are not developed under programming restrictions for specific embedded systems, because those restrictions depend highly on the underlying hardware. Executing such software on a micro controller with very limited resources often results in unforeseen problems, e.g., in a memory overflow. Failure to detect such problems in an early stage might lead to significant costs, e.g., for replacing software on thousands of produced controllers. In this paper, we present a semi-automatic approach to inspect Java source code in order to check for predefined hardware dependent restrictions. As an application domain, we have chosen Java Smart Cards, which are very popular today, introduce their specific restrictions, and present how to inspect Java code to ensure that all restrictions are considered.
Monte Carlo Methods for 2-D Compaction
Authors: R. C. Mosteller
Venue:  (1986)

A new method of compaction for VLSI circuits is presented. Compaction is done simultaneously in two dimensions and uses a Monte Carlo simulation method often referred to as simulated annealing for optimization. A new curvilinear representation for VLSI circuits, specifically chosen to make the compaction efficient, is developed. Experiments with numerous cells are presented that demonstrate this method to be as good as, or better than the hand compaction previously applied to these cells. Hand compaction was the best previously known method of compaction. An experimental evaluation is presented of how the run time complexity grows as the number, N, of objects in the circuit increases. The results of this evaluation indicates that the run time growth is order O(N log(A))f(d) where f(d) is a function of the density, d, and A is the initial cell area. The function f(d) appears to have negligible or no dependence on N. A hierarchical composition approach is developed which takes advantage of the capability of the curvilinear representation and the 2- dimensional compaction technique.
Scan-First Search and Sparse Certificates: Improved Parallel Algorithms for K-Vertex Connectivity
Authors: Joseph Cheriyan, Ming Kao, Ramakrishna Thurimella
Venue:  (1991)

\indent Given a graph $G = (V,E)$ with $n$ vertices and $m$ edges, a {\em certificate} of $k$-vertex connectivity is an edge subset $E'' \subset E$ such that the subgraph $(V,E'')$ is $k$-vertex connected if and only if $G$ is $k$-vertex connected. A certificate is called {\em sparse} if it contains $O(kn)$ edges. Our main result is an algorithm that computes a sparse certificate with at most $kn$ edges for an {\em undirected} graph. The key technique used in our certificate algorithm is a novel graph search strategy called the {\em scan-first search}. Both this search strategy and our certificate algorithm have extremely efficient implementations in the sequential, distributed, and parallel models of computation. In particular, our certificate algorithm runs in $O(k \, \mbox {log} \, n)$ time using $C(n,m)$ processors on a CRCW PRAM, where $C(n,m)$ is the number of processors used to compute a spanning tree in each connected component in $O(\mbox{log} \, n)$ time. Our parallel certificate algorithm can be employed to test the $k$-vertex connectivity of an undirected graph in $O(k^{2} \, \mbox{log} \, n)$ time using $k \cdot n \cdot C(n,kn)$ processors on a CRCW PRAM. This parallel complexity is substantially better than several previously best results for undirected $k$-vertex connectivity. Using different techniques, we also obtain an online algorithm for computing an undirected graph certificate with at most $2kn$ edges, and a sequential algorithm for computing a directed graph certificate with at most $2k^{2}n$ edges.
Dynamic native optimization of interpreters
Authors: Gregory T. Sullivan, Derek L. Bruening, Iris Baron, Timothy Garnett, Saman Amarasinghe
Venue: Proceedings of the 2003 workshop on Interpreters, virtual machines and emulators (2003)

For domain specific languages, "scripting languages", dynamic languages, and for virtual machine-based languages, the most straightforward implementation strategy is to write an interpreter. A simple interpreter consists of a loop that fetches the next bytecode, dispatches to the routine handling that bytecode, then loops. There are many ways to improve upon this simple mechanism, but as long as the execution of the program is driven by a representation of the program other than as a stream of native instructions, there will be some "interpretive overhead".There is a long history of approaches to removing interpretive overhead from programming language implementations. In practice, what often happens is that, once an interpreted language becomes popular, pressure builds to improve performance until eventually a project is undertaken to implement a native Just In Time (JIT) compiler for the language. Implementing a JIT is usually a large effort, affects a significant part of the existing language implementation, and adds a significant amount of code and complexity to the overall code base.In this paper, we present an innovative approach that dynamically removes much of the interpreted overhead from language implementations, with minimal instrumentation of the original interpreter. While it does not give the performance improvements of hand-crafted native compilers, our system provides an appealing point on the language implementation spectrum.
Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI
Authors: Thomas H. Cormen
Venue:  (1997)

This paper presents an architecture-independent method for performing BMMC permutations on multiprocessors with distributed memory. All interprocessor communication uses the MPI function MPI_Sendrecv_replace(). The number of elements and number of processors must be powers of 2, with at least one element per processor, and there is no inherent upper bound on the ratio of elements per processor. Our method transmits only data without transmitting any source or target indices, which conserves network bandwidth. When data is transmitted, the source and target processors implicitly agree on each other''s identity and the indices of the elements being transmitted. A C-callable implementation of our method is available from Netlib. The implementation allows preprocessing (which incurs a modest cost) to be factored out for multiple runs of the same permutation, even if on different data. Data may be laid out in any one of several ways: processor-major, processor-minor, or anything in between.
The CMU Master in Software Engineering Core Curriculum
Authors: David Garlan, Alan Brown, Daniel Jackson, Jim Tomayko, Jeannette Wing
Venue:  (1993)

There is an increasing demand for application-specific software. For example, the software to control a machine on a factory floor is different from the software to manipulate large databases. The software engineer building software to control a motor that powers a piece of machinery needs some understanding of the motor''s servo system; whereas a software engineer who designs the software to manage large databases for the NASA Space Station needs specific knowledge about database models as well as the types of data handled on a long-term space vehicle. Specialization tracks within the Master of Software Engineering (MSE) Program at Carnegie Mellon University would enable students to gain application knowledge while developing fundamental software engineering skills. This report proposes a model for establishing specialization tracks within a graduate software engineering program.
Structure result for steady-state solutions of a one-dimensional Frémond model of SMA
Authors: K. Shirakawa, U. Stefanelli
Venue:  (2002)

This note deals with the complete characterization of solutions to an elliptic system of variational inequalities. The latter model arises in the study of the long-time behavior of shape memory materials and is suitable of describing a variety of experimentally observed phenomena
Overview of speech packetization
Authors: M. H. Sherif, A. Crossman
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

There have been significant advances in the design and development of "toll-quality" packetization systems. The paper presents various issues that affect the packetization of speech such as robustness to noise, reconstitution of the flow of speech and congestion control. The target audience consists of designers and implementers of speech packetization systems as well as service providers concerned with the quality of service and efficiency of transmission.
A Stopping Criterion for the Conjugate Gradient Algorithm in a Finite Element Method Framework
Authors: Mario Arioli
Venue:  (2000)

The Conjugate Gradient method has always been successfully used in solving the symmetric and positive definite systems obtained by the finite element approximation of elliptic partial differential equations. Taking into account recent results [7,11]. which make it possible to approximate the energy norm of the error during the conjugate gradient iterative process, we adapt the stopping criterion introduced in [3]. Moreover, we show that the use of efficient preconditioners does not influence the stopping criterion. Finally, we present the results of several numerical tests that experimentally validate the effectiveness of our stopping criterion. TEL:: +390382 548238 EMAIL:: arioli@dragon.ian.pv.cnr.it
OCP: Oracle9i Performance Tuning SG, 1 edition
Authors: Joseph C. Johnson
Venue:  (2002)

:Here's the book you need to prepare for Exam 1Z0-033: Oracle9i Database: Performance Tuning. This Study Guide provides: In-depth coverage of official exam objectives Practical information on optimizing Oracle9i databases Hundreds of challenging review questions, in the book and on the CD Authoritative coverage of all exam objectives, including: Using Diagnostic and Tuning Tools Monitoring and Managing the Buffer Cache Optimizing Sort Operations Detecting and Resolving Lock C Diagnosing Shared Server Performance Issues Using Oracle Blocks Efficiently Tuning SQL Statements Configuring Resource Manager Featured on the CD The enclosed CD is packed with vital preparation tools and materials, beginning with the Sybex EdgeTest testing engine for the Oracle9i Performance Tuning exam. Loaded with hundreds of practice questions, it lets you test yourself chapter by chapter or according to objective areas. You'll also find electronic flashcards for your PC and Palm handhelds and two bonus exams that will help you prepare for the test. Also included is an electronic version of the entire book. About the Author Joseph C. Johnson, OCP, has over 8 years of experience in the management of mission-critical Oracle databases. Joseph has administered production and development databases for a variety of clients in the education, manufacturing, e-commerce, healthcare, and financial services industries, and is currently working as a Senior Database Administrator with Greenbrier & Russel, Inc.
Automatic transliteration for Japanese-to-English text retrieval
Authors: Yan Qu, Gregory Grefenstette, David A. Evans
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

For cross language information retrieval (CLIR) based on bilingual translation dictionaries, good performance depends upon lexical coverage in the dictionary. This is especially true for languages possessing few inter-language cognates, such as between Japanese and English. In this paper, we describe a method for automatically creating and validating candidate Japanese transliterated terms of English words. A phonetic English dictionary and a set of probabilistic mapping rules are used for automatically generating transliteration candidates. A monolingual Japanese corpus is then used for automatically validating the transliterated terms. We evaluate the usage of the extracted English-Japanese transliteration pairs with Japanese to English retrieval experiments over the CLEF bilingual test collections. The use of our automatically derived extension to a bilingual translation dictionary improves average precision, both before and after pseudo-relevance feedback, with gains ranging from 2.5% to 64.8%.
An Adaptive Choice of Messaging Protocol in Multi Agent Systems
Authors: Chris Preist, Siani Pearson
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

There are a variety of choices which need to be made when setting up a multi-agent community. In particular, which agents communicate with which, what protocols they use, and what information flows from one to another. Such design choices will affect the efficiency of the community with respect to several parameters - accuracy, speed of solution, and message load. In this paper, we consider one class of problem which multi-agent systems engage in - service provision. Using a simple, abstract, form of this problem, we use a mathematical analysis to show that three different messaging protocols result in varying message loads, depending on certain parameters such as number of agents and frequency of request. If the parameters are fixed, we can conclude which of these three protocols is most efficient. However, these parameters will usually vary over time, and hence the best of the three protocols will vary. We show that the community can adopt the best protocol if each individual agent makes a local decision based on which protocol will minimise its own message load. Hence, local decisions lead to globally good behaviour. We demonstrate this both mathematically and experimentally.
Core CSS: Cascading Style Sheets, 2 edition
Authors: Keith Schengili-Roberts
Venue:  (2003)

The Complete and Comprehensive Web Developer's Guide to Style SheetsCore CSS, 2nd Edition is a comprehensive guide that shows both beginning and expert Web developers all they need to know to achieve great results with the latest style sheet properties. In this example-rich book, Schengili-Roberts provides in-depth coverage of the CSS1 and CSS2 standards, provides a "head's up" look at what to expect in the forthcoming CSS3 specification, and covers those CSS properties specific to Microsoft's Internet Explorer. It is the most complete and up-to-date CSS reference available.CSS is fundamental to current Web design, allowing you to separate content from formatting, and to do Web page layout in ways simply not possible using regular HTML. Most books on CSS simply look at how you can accomplish certain formatting tricks, but this book delves deeper, looking at how each CSS property works, what CSS is capable of, and what to expect in the near future.This book provides the most accessible and up-to-date listing available on CSS compatibility across browsers and operating systems so Webmasters can finally know which CSS properties are "safe" to use.Detailed appendices provide full CSS property listings, compatibility charts, and more.Core CSS, 2nd Edition delivers: Practical techniques for integrating CSS into your Web site development Expert insight into choosing the best style sheet code Hundreds of professional-quality code examples An overview of new CSS3 properties