ppxscal/embedding_network huggingface dataset:
The Integration of ParaScope and Lambda
Authors: Donna Bergmark, David Presberg
Venue:  (1994)

We have been experimenting with combining three powerful language tools for large, scientific, parallel Fortran codes. One tool is ParaScope, a programming envirnment; another tool is the Lambda Toolkit, a collection of routines for performing loop transformations using invertible matrices; the third is FORGE 90, a collection of tools for parallelizing Fortran programs. Initial sucess with incorporating the Lambda Toolkit into ParaScope led us to undertake the work leading to a new program preparation strategy, in which one first uses a modified ParaScope to perform Data Access Normalization, then uses FORGE 90 to produce a parallel program for a distributed memory platform. We describe the details of this strategy and present some performance results for the IBM SP1. We conclude that the combination of ParaScope and the Lambda Toolkit (called "ped-Lambda") is a useful transformation tool. Keywords: tools, tool combinations, data locality, APR FORGE 90 DMP, HPF, data access normaliztion, ParaScope, Lambda Toolkit, SP1, Fortran, parallel
Bubble Functions Prompt Unusual Stabilized Finite Element Methods
Authors: Leopoldo P. Franca, Charbel Farhat
Venue:  (1994)

A second order linear scalar differential equation including a zero-th order term is approximated using first the standard Galerkin method enriched with bubble functions. Static condensation of the bubbles suggest an unusual stabilized finite element method for which we establish a convergence study and obtain successful numerical simulations. The method is generalized to allow for a convection operator in the equation. This work may be employed as a starting point for simulation of nonlinear equations governing turbulence phenomena, flows with chemical reactions, and other important problems.
Controllability/Observability Measures for Multiple-Valued Test Generation Based on D-Algorithm
Authors: Naotake Kamiura, Yutaka Hata, Nobuyuki Matsui
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

In this paper, we propose controllability and observability measures to guide the D-algorithm for multiple-valued logic circuits. The former is determined in one forward traversal of the circuit, and used in determining the line where the consistency operation should proceed. The latter is determined in one backward traversal, and used in executing the D-drive at the fan out point. Our measures are computed by simple recursive formulas, and the time required for computing them is relatively short. The experimental results show that our measures are helpful in reducing the number of times for backtracking.
Recognising a Scenario by Calculating a Temporal Proximity Index between Constraint Graphs.
Authors: Nicolas Ramaux, Dominique Fontaine
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

In this paper, the recognition of temporal scenarios is expressed by the mean of a proximity between a scenario which represents a possible system's behavior and a session which describes the observed behavior. This recognition is qualified with a proximity index which allows to classify on-line or out-line the scenarios candidates for an evolution's explanation. This approach, when used in a dynamic system's supervision or diagnostic task opens possibilities in using or learning scenarios or even in structurating the scenarios.
Equivalence between sorting and priority queues
Authors: M. Thorup
Venue:  (1995)

For a RAM with arbitrary word size, it is shown that if we can sort n integers, each contained in one word, in time n*s(n), then (and only then) there is a priority queue with capacity for n integers, supporting `find-min'' in constant time and `insert'' and `delete'' in `s(n)+0(1)$ amortized time. Here it is required that when we insert a key, it is not smaller than the current smallest key. The equivalence holds even if n is limited in terms of the word size w. One application is an O(n(log n)^{1/2+e} + m), e<0, algorithm for the single source shortest path problem on a graph with n nodes and m edges.
Pride Before the Fall: The Trials of Bill Gates and the End of the Microsoft Era
Authors: John Heilemann
Venue:  (2002)

:The humbling of Bill Gates and Microsoft is the last great business story of the 20th Century and the first great riddle of the 21st. How did the richest man in the world, the most powerful icon of the New Economy, wind up being pursued and attacked by his own government? And how did a company that had utterly dominated the technology landscape find itself weakened, vulnerable, and under threat of a court-ordered breakup? John Heilemann's Pride Before the Fall uncovers the secret history of the trial that shook an economy: United States v. Microsoft. Drawing on years of reporting - including extensive interviews with Gates and other top Microsoft executives, Justice Department trustbuster Joel Klein, superlitigator David Boies, Intel chief Andy Grove, and scores of lesser-known but pivotal players - Heilemann lays bare the chaotic forces that shattered Microsoft's aura of invincibility and the climate of fear that held an industry in thrall. Packed with rich detail, dramatic scenes, and explosive revelations, Pride Before the Fall tells the stories of the largely unknown men and women who turned their opposition to Microsoft's monopolistic practices into a crusade. It explains how the high-tech kingpins whose businesses Gates tried to destroy or strongarm (Netscape, Apple, Sun, even Intel) worked in secret to help the Feds bring Microsoft down. And it offers a vivid and at times shocking portrait of Gates himself - describing a man who in the early 1990s boasted to his friends, "I have as much power as the President," only to be cast into rage and depression a few years later, when he discovered just how wrong he'd been. With this, his first book, Heilemann confirms his reputation as one of our sharpest-eyed chroniclers of the information revolution; as a journalist whose skills as an investigative reporter are matched only by his gifts as a writer. More than a gripping business or legal or political yarn, Pride Before the Fall is a powerful tale of human ambition and human frailtya timely saga of arrogance, ruthlessness, and revenge. 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
Dynamic Three-Value Logic in Decentralized Time-Critical Domains
Authors: Marion G. Ceruti, Stuart H. Rubin
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

This paper describes conceptual work in dynamic three-value logic with a view toward applications in decentralized time-critical domains, such as a sensor field. The completeness and computability of 3VLs also are discussed, including an algorithm to illustrate the use of heuristics. The military services deploy systems of heterogeneous sensors to detect and classify platforms. The paper provides a brief overview of the heterogeneous, decentralized sensor field used for military target classification as hostile, neutral or friendly. In an example, three-value logic is used to characterize the movement of a ship through a sensor field in terms of relevance and conclusiveness of the aggregate of sensor information. The paper concludes with a discussion of directions for future research and development.
View-3 and Ada: Tools for Building Systems with Many Tasks
Authors: Ann Kratzer, Mark Sherman
Venue:  (1986)

This paper discusses some useful features for tools that are intended to be used for developing systems with multiple tasks. We include a description of one tool that has been built, View-3. We also describe some problems that might be encountered when trying to fit this kind of tool into an APSE system.
Adaptive Outsourcing in Cross-Organizational Workflows
Authors: Justus Klingemann, Jurgen Wasch, Karl Aberer
Venue:  (2001)

Competitive markets force companies to minimize their costs while at the same time offering solutions which are tailored to the needs of their customers. This requires organizations to outsource at least parts of the overall effort and to rely on services which have to be provided by external partners, leading ultimately to virtual enterprises. The workflow concept has been very successful in coordinating and streamlining business processes but is so far limited to a single organization. Any attempt to distribute workflows among different organizations has to face the problems posed by the complex relationship among autonomous organizations and their services. To address these problems we propose a serviceoriented model for cross-organizational workflows. Modeling the workflow execution as a cooperation of services allows different organizations to interact via well-defined interfaces. We further show how the execution can be optimized by selecting services depending on their contribution to quality criteria of the workflow.
Oracle in a Nutshell, 1 edition
Authors: Rick Greenwald, David C. Kreines
Venue:  (2002)

:Oracle is a complex and multi-faceted system, offering a myriad of options, languages, and tools. Frequent releases and multiple editions complicate the ability of Oracle users to keep up with the huge amount of information about the database and its capabilities. The goal of Oracle in a Nutshell is to bring order to the chaos of Oracle documentation by assembling vital information on architecture, syntax, and user interfaces. The content and format of this book, part of O'Reilly's bestselling In a ` Nutshell series, combine to boil down essential commands, language constructs, parameters, and file formats into a succinct and highly accessible desktop reference. Oracle in a Nutshell presents, in a concise and compact form, the information that database administrators, PL/SQL and Java developers, and system, network, and security administrators need at their fingertips. Whether you're using Oracle9i Release 2 or earlier versions of Oracle, this is the book you'll turn to again and again, as you manage your Oracle databases or write code that accesses Oracle data.
Demonstrating lambda calculus reduction
Authors: Peter Sestoft
Venue: The essence of computation: complexity, analysis, transformation (2002)

We describe lambda calculus reduction strategies, such as call-by-value, call-by-name, normal order, and applicative order, using big-step operational semantics. We show how to simply and efficiently trace such reductions, and use this in a web-based lambda calculus reducer available at 〈http://www.dina.kvl.dk/~sestoft/lamreduce/〉.
Affinity: A Concurrent Programming System for Multicomputers
Authors: Craig S. Steele
Venue:  (1992)

Affinity is an experiment to explore a simple, convenient, and expressive programming model that provides adequate power for complex programming tasks while setting few constraints on potential concurrency. Although the programmer is required to formulate a computational problem explicitly into medium-sized pieces of data and code, most of the additional functions necessary for concurrent execution are implicit. The execution of the light-weight, reactive processes, called actions, implicitly induces atomicity and consistency of data modifications. The programmer accesses shared data structures in a shared-memory fashion, but without the need for explicit locking to manage the problems of concurrent access and mutual exclusion. Program control flow is distributed and implicit. The name given to the programming model, Affinity, has a definition, "causal connection or relationship," that is fitting to the way programs are structured and scheduled. Affinity consistency and coherence properties provide a tractable discipline for the dangerous power of a concurrent, shared-memory programming style. Existing programming complexity-management techniques such as object-oriented languages can be used in this multicomputer environment. Affinity programs can compute consistent and correct results despite staleness of data, and asynchrony and nondeterminism in execution of code. Program correctness is invariant under replication, or cloning, of actions. This aspect of the model yields a simple and robust mechanism for fault- tolerance. The practicality of the Affinity programming model has been demonstrated by an implementation on a second-generation multicomputer, the Ametek S/2010. The implementation is distributed, scalable, and relatively insensitive to network latency. Affinity has demonstrated reasonable efficiency and performance for computations with tens of processing nodes, hundreds of actions, and thousands of shared data structures.
Treatment of Internal Sources in the Finite-Volume ELLAM
Authors: Richard W. Healy, Thomas F. Russell
Venue:  (2000)

The finite-volume Eulerian-Lagrangian localized adjoint method (FVELLAM) is a mass-conservative approach for solving the advection-dispersion equation. The method has been shown to be accurate and efficient for solving advection-dominated problems of solute transport in ground water in 1, 2, and 3 dimensions. Previous implementations of FVELLAM have had difficulty in representing internal sources because the standard interpolation of a lowest-order Raviart-Thomas velocity field is not accurate for source cells. Therefore tracking of particles within source cells is problematic. A new technique has been developed to account for internal sources in FVELLAM. It is assumed that the source is uniformly distributed across a grid cell and that instantaneous mixing takes place within the cell, such that concentration is uniform across the cell at any time. Sub-time steps are used to track mass outflow from the edges of the source cell. This avoids the need for tracking within the source cell. We describe the new method and compare results for a variety of test problems with a wide range of cell Peclet and Courant numbers.
An Introduction to Software Architecture
Authors: David Garlan, Mary Shaw
Venue:  (1994)

As the size of software systems increases, the algorithms and data structures of the computation no longer constitute the major design problems. When systems are constructed from many components, the organization of the overall system -- the software architecture -- presents a new set of design problems. This level of design has been addressed in a number of ways including informal diagrams and descriptive terms, module interconnection languages, templates and frameworks for systems that serve the needs of specific domains, and formal models of component integration mechanisms. In this paper we provide an introduction to the emerging field of software architecture. We begin by considering a number of common architectural styles upon which many systems are currently based and show how different styles can be combined in a single design. Then we present six case studies to illustrate how architectural representations can improve our understanding of complex software systems. Finally, we survey some of the outstanding problems in the field, and consider a few of the promising research directions.
Thehp-local discontinuous Galerkin method for low-frequency time-harmonic Maxwell equations
Authors: Ilaria Perugia, Dominik Schötzau
Venue: Mathematics of Computation (2003)

The local discontinuous Galerkin method for the numerical approximation of the time-harmonic Maxwell equations in a low-frequency regime is introduced and analyzed. Topologically nontrivial domains and heterogeneous media are considered, containing both conducting and insulating materials. The presented method involves discontinuous Galerkin discretizations of the curl-curl and grad-div operators, derived by introducing suitable auxiliary variables and so-called numerical fluxes. An hp-analysis is carried out and error estimates that are optimal in the meshsize h and slightly suboptimal in the approximation degree p are obtained.
The Complete Guide to Digital Photography
Authors: Michael Freeman
Venue:  (2002)

:It's the bestselling, most complete digital guide available--and now it's thoroughly updated to reflect the state of the art. Featuring the latest operating systems and software versions, plus a new section on traveling with your gear, this fully illustrated, total approach to digital will lead you into an exciting new world of image making. An essential round-up of available cameras, computers, scanners, software, and printers--including current online printing services such as photobox and fotango, and the Epson 2000 series of archive printers--offers a plethora of technical possibilities. Detailed text and more than 300 color photographs show exactly how to take and make great portraits, landscapes, action shots, and more. Take advantage of the heightened ability to enhance images; change backgrounds or colors; add reflections; and create artistic effects with collaging, filters, and lighting techniques. Includes easy-to-follow projects for making calendars, business cards, websites, and more.
On the Motion of Objects in Contact
Authors: John E. Hopcroft, Gordon Wilfong
Venue:  (1984)

There is an increasing use of computers in the design, manufacture and manipulation of physical objects. An important aspect of reasoning about such actions concerns the motion of objects in contact. The study of problems of this nature requires not only the ability to represent physical objects but the development of a framework or theory in which to reason about them. In this paper such a development is investigated and a fundamental theorem concerning the motion of objects in contact is proved. The simplest form of this theorem states that if two objects in contact can be moved to another configuration in which they are in contact, then there is a way to move them from the first configuration to the second configuration such that the objects remain in contact throughout the motion. This result is proved when translation and rotation of objects are allowed. The problem dealing with more generalized types of motion is also discussed. This study has obvious applications in compliant motion and in motion planning.
Evaluating CLASS semantic classification: Pisa Contribution
Authors: Paolo Allegrini, Nicoletta Calzolari, Stefano Federici, Simonetta Montemagni, Vito Pirrelli
Venue:  (1999)

This report describes the different evaluation procedures adopted for testing effectiveness and validity of the semantic classes acquired by CLASS through analogy-based semantic similarity measures...
Magnetic susceptibility: further insights into macroscopic and microscopic fields and the sphere of Lorentz
Authors: C. J. Durrant, M. P. Hertzberg, P. W. Kuchel
Venue: Concepts in Magnetic Resonance: an Educational Journal (2003)

To make certain quantitative interpretations of spectra from NMR experiments carried out on heterogeneous samples, such as cells and tissues, we must be able to estimate the magnetic and electric fields experienced by the resonant nuclei of atoms in the sample. Here, we analyze the relationships between these fields and the fields obtained by solving the Maxwell equations that describe the bulk properties of the materials present. This analysis separates the contribution to these fields of the molecule in which the atom in question is bonded, the "host" fields, from the contribution of all the other molecules in the system, the "external" fields. We discuss the circumstances under which the latter can be found by determining the macroscopic fields in the sample and then removing the averaged contribution of the host molecule. We demonstrate that the results produced by the, so-called, "sphere of Lorentz" construction are of general validity in both static and time-varying cases. This analytic construct, however, is not "mystical" and its justification rests not on any sphericity in the system but on the local uniformity and isotropy, i.e., spherical symmetry, of the medium when averaged over random microscopic configurations. This local averaging is precisely that which defines the equations that describe the macroscopic fields. Hence, the external microscopic fields, in a suitably averaged sense, can be estimated from the macroscopic fields. We then discuss the calculation of the external fields and that of the resonant nucleus in NMR experiments.
Arithmetic Complexity, Kleene Closure, and Formal Power Series
Authors: Eric Allender, Arvind,  V, Meena Mahajan
Venue:  (1997)

In this paper we show how two fundamental operations used in formal language theory provide useful tools for the investigation of arithmetic complexity classes. More precisely, we use Kleene closure of languages and inversion of formal power series to investigate subclasses of the complexity class GapL. GapL is the complexity class that characterizes the complexity of computing the determinant; it corresponds to counting the number of accepting and rejecting paths of nondeterministic logspace-bounded Turing machines.) We define a counting version of Kleene closure and show that it is intimately related to inversion within the complexity classes GapL and GapNC^1. In particular, we prove that Kleene closure and inversion are both hard operations in the following sense There is a set in AC^0 for which Kleene closure is NL-complete and inversion is GapL-complete. There is a finite set for which Kleene closure is NC^1-complete and inversion is GapNC^1-complete. Furthermore, we classify the complexity of the Kleene closure of finite languages. We formulate the problem in terms of finite monoids and relate its complexity to the internal structure of the monoid.
Cross-input Amortization Captures the Diffuse Adversary
Authors: Neal E. Young
Venue:  (1996)

Koutsoupias and Papadimitriou recently raised the question of how well deterministic on-line paging algorithms can do against a certain class of adversarially biased random inputs. Such an input is given in an on-line fashion; the adversary determines the next request probabilistically, subject to the constraint that no page may be requested with probability more than a fixed $\epsilon<0$. In this paper, we answer their question by estimating, within a factor of two, the optimal competitive ratio of any deterministic on-line strategy against this adversary. We further analyze randomized on-line strategies, obtaining upper and lower bounds within a factor of two. These estimates reveal the qualitative changes as $\epsilon$ ranges continuously from 1 (the standard model) towards 0 (a severely handicapped adversary). The key to our upper bounds is a novel charging scheme that is appropriate for adversarially biased random inputs. The scheme adjusts the costs of each input so that the expected cost of a random input is unchanged, but working with adjusted costs, we can obtain worst-case bounds on a per-input basis. This lets us use worst-case analysis techniques while still thinking of some of the costs as expected costs.