ppxscal/embedding_network huggingface dataset:
Managerial Issues in Developing a Quality Metrics Program
Authors: John A. Lewis, Sallie M. Henry
Venue:  (1990)

Software quality metrics are used to determine error prone code due to excessive complexity. These results can be used to guide testing efforts and predict future maintenance needs. However, implementing a quality metrics program involves many subtle issues which complicate the development and use of a metrics methodology. Many of theses issues are managerial in nature. This paper examines some managerial elements of designing and implementing a quality metrics program. Previous studies which incorporate a metrics methodology into two different commercial environments are used to demonstrate the difficulties in implementation and approach.
A lateral torsion buckling analysis of elastic beam under axial force and bending moment
Authors: K. M. Hsiao, W. Y. Lin
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The buckling moment of doubly symmetric spatial beams under different types of end bending moment and compressive axial force is investigated using finite element method. A co-rotational total Lagrangian finite element formulation is employed here. An incremental-iterative method based on the Newton-Raphson method combined with constant arc length of incremental displacement vector is employed for the solution of nonlinear equilibrium equations. The zero value of the tangent stiffness matrix determinant of the structure is used as the criterion of the buckling state. Numerical examples are presented to investigate the effect of compressive force on the buckling moment of spatial beams under different types of bending moment.
Volume Models for Volumetric Data
Authors: Vishwa Ranjan, Alain Fournier
Venue:  (1993)

In order to display, transform, and compare volumetric data, it is often convenient or necessary to use different representations derived from the original discrete voxel values. In particular, several methods have been proposed to compute and display an iso-surface defined by some threshold value. In this paper we describe a method to represent the volume enclosed by an iso-surface as the union of simple volume primitives. The needed properties (displayed image, volume, surface, etc.) are derived from this representation. After a survey of properties that might be needed or useful for such representations, we show that some important ones are lacking in the representations used so far. Basic properties include efficiency of computation, storage, and display. Some other properties of interest include stability (the fact that the representation changes little for a small change in the data, such as noise or small distortions), the ability to determine the similarities between two data sets, and the computation of simplified models. We illustrate the concept with two distinct representations, one based on the union of tetrahedra derived from a Delaunay tetrahedralization of boundary points, and an other based on overlapping spheres. The former is simple and efficient in most respects, but is not stable, while the latter needs heuristics to be simplified, but can be made stable and useful for shape comparisons. This approach also helps to develop metrics indispensable to study and compare such representations.
ON ADAPTATION TO MULTIPLE CONTEXT BINARY SOURCES
Authors: Glen G. Langdon,  Jr.
Venue:  (1990)

An introduction and entry into the literature of practical deterministic algorithms that adaptively estimate the relative frequency distribution of binary sequences is provided. Deterministic adaptation appraoches typically maintain and adjust a count ratio that is based on past symbols seen in the past sequence. Adapters are finite state machines and some algorithms use a small number of states by restricting the count numberator value, at a cost of wandering about the optimum index in the case of stationary sources. Issues of adaptation inertia (or speed) are covered. A performance measure of Rissanen and Langdon, the ideal code length IL(M,F) of the data file F under a given context model M, is supplemented by another closed form code length estimator, the enumerative code length EL(M,F) of Cleary and Witten. The novel application of IL or EL to calculate the information content of the binary adapter output allows a new means of comparison of the context model and adaptive statistics model. The binary adapter treatment includes results from reports not generally known or available. Wandering binary adapters are defined, then described in the statistical significance testing metaphor, and designs are presented that employ a simple wandering heuristic. A simple example illustrates the mean-median anomaly that differentiates significance testing on a count ratio random variable versus a runlength random variable. Goladap, an adaptive Golomb code, uses the Golomb coding operation itself as a trigger for adaptation, and the runlength variable for adaptation.
Embedding All Binary Trees in the Hypercube
Authors: Alan S. Wagner
Venue:  (1990)

An ${\cal O} (N^{2})$ heuristic algorithm is presented that embeds all binary trees, with dilation 2 and small average dilation, into the optimal sized hypercube. The heuristic relies on a conjecture about all binary trees with a perfect matching. It provides a practical and robust technique for mapping binary trees into the hypercube and ensures that the communication load is evenly distributed across the network assuming any shortest path routing strategy. One contribution of this work is the identification of a rich collection of binary trees that can be easily mapped into the hypercube.
Implementing a Global Termination Condition and Collecting OutputMeasures in Parallel Simulation
Authors: Marc Abrams, Debra S. Richardson
Venue:  (1990)

This paper investigates how to implement arbitrary global termination conditions and collect statistics in a parallel simulation. The problem is first discussed using Chandy and Sherman''s space-time framework. Then termination conditions are categorized, and termination algorithms are given for several categories. The chief problem is that if one evaluates the termination condition asynchronously with respect to the simulation, when termination is detected the simulator has already modified old attribute values needed to compute output measures. The major conclusion is that minor modification of time warp permits use any termination condition. In contrast, conservative protocols permit limitied termination conditions unless they are modified to incorporate mechanisms present in optimistic protocols.
A Library of Reusable Model Components for Visual Simulation of the NCSTRL System
Authors: Balci Osman, Ulusarac Cengiz, Shah Poorav, Fox Edward A.
Venue:  (1998)

This paper presents a library of reusable model components for visual simulation of the Networked Computer Science Technical Report Library (NCSTRL) and illustrates how a visual simulation model can be developed for a new NCSTRL configuration by way of component reuse with no programming. Such a repository of reusable model components can be created for visual simulation of any digital library for the purpose of performance evaluation and tuning and conducting what-if analyses for different system design configurations.
The future of peer-to-peer computing
Authors: Alfred W. Loo
Venue: Communications of the ACM (2003)

An economical method for pumping up computing power by tapping into P2P systems using Web server technologies.
A Layered Approach To Modelling Parallel Systems For Performance Prediction
Authors: E. Papaefstathiou, Y. Papay, Graham R. Nudd, T. J. Atherton, C. Clarke, Darren J. Kerbyson, Andrew Stratton, R. Ziani, M. J. Zemerly
Venue:  (1993)

Conventional modelling techniques rely on workload parameters obtained from an existing system and the development of a system model. For software under development this is a hindering factor for performance evaluation and the performance prediction. Software Performance Engineering (SPE) offers a solution to this problem by using a software execution model, in addition to the system model. The use of SPE for parallel software has several disadvantages: complex nature of the SPE system model, non re-usable model components, and lack of analytical methods to evaluate the system model. A novel layered approach is presented here, using separate hardware, parallel paradigm, and application layers to overcome these disadvantages. The layered approach is illustrated, and results obtained, using an image processing benchmark.
Multiresolution Random Fields and their Application to Image Analysis
Authors: Roland Wilson, Chang Li
Venue:  (1999)

In this paper, a new class of Random Field, defined on a multiresolution array structure, is defined. These combine earlier, tree based models with the more conventional MRF models. The fundamental statistical properties of these models are investigated and it is proved that they can avoid some of the obvious limitations of their predecessors, in terms of modelling realistic image structures. Prediction and estimation from noisy data are then considered and a new procedure: Multiresolution Maximum a Posteriori estimation, is defined. These ideas are then applied to the problem of analysing images containing a number of regions. It is shown that the model forms an excellent basis for the segmentation of such images.
Adapting to Bandwidth Variations in Wide-Area Data Combination
Authors: M. Ranganathan, Anurag Acharya, Joel Saltz
Venue:  (1997)

Efficient data combination over wide-area networks is hard as wide-area networks have large variations in available network bandwidth. In this paper, we examine the utility of changing the location of combination operators as a technique to adapt to variations in wide-area network bandwidth. We try to answer the following questions. First, does relocation of operators provide a significant performance improvement? Second, is on-line relocation useful or does a one-time positioning at start-up time provide most if not all the benefits? If on-line relocation {\em is} useful, how frequently should it be done and is global knowledge of network performance required or can local knowledge and local relocation of operators sufficient? Fourth, does the effectiveness of operator relocation depend on the ordering of the combination operations. That is, are certain ways of ordering more amenable to adaptation than others? Finally, how do the results change as the number of data sources changes?
Fault-tolerance of Distributed Multithreaded Applications in Shared-Nothing Systems
Authors: J. James, A. Singh
Venue:  (1969)

The ubiquity of distributed systems has led to increasingly complex distributed applications. That complexity has been increased by multithreaded applications, shared-nothing environments like the Internet, and the use of nested transactions to access multiple sets of data atomically. Providing fault tolerance for such applications is complicated by the loss of the piecewise determinism assumption (due to multithreading), the necessity of replicating data (due to the shared-nothing environment), and the necessity of maintaining consistency for nested transactions. Providing fault tolerance for such applications in an ad hoc manner is difficult. We explore a systematic approach to providing fault tolerance. We show that the assumption of data-race-freedom has some of the benefits of piecewise determinism, but allows multithreading. We develop a logical ring structure for the logging and recovery processes, and show how the ring simplifies those tasks. We discuss roll-forward versus roll-backward recovery and suggest the use of roll-forward techniques. Finally, we investigate a message combining technique that can reduce the number of messages sent during the logging process.
Local Computations on Static and Dynamic Graphs
Authors: A. Mayer, M. Naor, L. Stockmeyer
Venue:  (1995)

The purpose of this paper is a study of computation that can be done locally in a distributed network. By locally we mean within time (or distance) independent of the size of the network. In particular we are interested in algorithms that are robust, i.e., perform well even if the underlying graph is not stable and links continuously fail and come-up. We introduce and study the happy coloring & orientation problem and show that it yoekds a robust local solution to the (d,m)-dining philosophers problem of Naor and Stockmeyer. This problem is similar to the usual dining philosophers problem, except that each philosopher has access to d forks but needs only m of them to eat. We give a robust local solution if m # ed/2u (necessity of this inequality for any local solution was known previously). Two other problems we investigate are: (1) the amount of initial symmetry-breaking needed to solve certain problems locally (for example, our algorithms need considerably less symmetry-breaking than having a unique ID on each node), and (2) the single-step color reduction problem: given a coloring with c colors of the nodes of a graph, what is the smallest number of colors c? such that every node can recolor itself with one of c? colors as a function of its immediate neighborhood only.
Tridiagonalization Costs of the Bandwidth contraction and Rutistauser-Schwarz Algorithms
Authors: Ian Cavers
Venue:  (1993)

In this paper we perform detailed complexity analyses of the Bandwidth Contraction and Rutishauser-Schwarz tridiagonalization algorithms using a general framework for the analysis of algorithms employing sequences of either standard or fast Givens transformations. Each algorithm''s analysis predicts the number of flops required to reduce a generic densely banded symmetric matrix to tridiagonal form. The high accuracy of the analyses is demonstrated using novel symbolic sparse tridiagonalization tools, Xmatrix and Trisymb.
Scheduling of bus driver's service by a genetic algorithm
Authors: Ikuo Yoshihara
Venue: Advances in evolutionary computing: theory and applications (2003)

This chapter presents an application of genetic algorithms to schedule bus drivers' services so as to satisfy all the drivers' working conditions, to decrease the number of drivers as much as possible and to reduce the spread of working hours among all the drivers. The drivers' service schedules have been compiled manually so far, but were very troublesome. Therefore, automatic generation of the schedules was a welcome development.We developed a method to derive drivers' service schedules using heuristics and genetic algorithms (GAs). Here, the weak points of the heuristics are compensated by GAs and the method can yield quasi-optimal solutions of good quality within reasonable time for practical use. The method is employed in the unified bus-management system that has been available for more than five years and been used by many bus companies.
Reconstruction of Biomedical Objects by Tiling
Authors: Anthony Haig, Yianni Attikiouzel
Venue:  (1990)

The 3D reconstruction of biomedical objects from 2D images has gained widespread attention. Several methods for reconstructing surfaces by triangulation are examined. these tecniques have been specifically applied to the three dimensional reconstruction of biomedical objects from serial slices. The advantages and disadvantages of each method are considered, and a new method is described which is superior to existing practices.
An Implementation of D. H. Warren''s PROLOG Machine on a Vax 11/780
Authors: R. W. Cotlin, John W. Roach
Venue:  (1986)

This report describes, in considerable detail, the implementation of a Prolog compiler on a VAX. This implementation is modeled after Warren''s Abstract Machine (WAM) for Prolog. The report clarifies and gives examples of the most important concepts in Warren''s dissertation. In this regard, this report serves as a tutorial for others who wish to implement a Prolog compiler.
Evaluating Astronomical Institutional Productivity Using the Astrophysics Data System Database
Authors: Eric Schulman, James C. French, Allison L. Powell
Venue:  (2000)

We used the Astrophysics Data System (ADS) to measure the productivity of the 38 institutions studied by Abt during the period 1985 to 1994. The ADS database contains 84,822 astronomical papers published in Astronomy and Astrophysics, The Astronomical Journal, The Astrophysical Journal, Monthly Notices of the Royal Astronomical Society, and The Publications of the Astronomical Society of the Pacific during this period. For each of these papers we compared the affiliation of each author to a canonical list of ADS affiliations that we had created using automated and manual clustering strategies. We assumed--as did Abt--that each of the n authors on a paper should result in his or her institution getting credit for 1/n papers. We compared our results to those of Abt and determined that his results were not strongly affected by having neglected the European journals or by having used papers from only one six-month period in the decade 1985-1994.
Synthesis-Oriented Situational Analysis as an Alternative toAnalytic Evaluation for Iterative User Interface Design
Authors: H. R Hartson, Kevin A. Mayo
Venue:  (1993)

This report is no longer available - TR-93-20 replaces it.
Reengineering Cocoon with AspectJ
Authors: Leeann Bent
Venue:  (2001)

AspectJ is a new Aspect Oriented extension to Java. This study attempts to quantify how appropriate AspectJ is for a large body of open source code (the Cocoon project) by reengineering it. In the process we discovered a number of things. The first is a set of patterns or templates for creating new or converting to AspectJ code. These are outlined and evaluated in the paper. The second is that AspectJ fundamentally changes and simplifies the "Knows About" relationship in a body of code. This simplification has the benefit of fixing the "Reverse Inheritance" problem found in real code. With AspectJ, "Knows About" relationships are localized, and often reduced. This localization removes the need for classes to "Know About" and import secondary behavior. It was also found that AspectJ is a good tool for the expression of Layered programming [5]. This is shown in the implementation of the Layered Aspect type. Finally, it appears that the Cocoon code base was designed with "Aspects" in the abstract, even though they were implemented using Java functionality. This is made especially apparent by the prevalence of reverse inheritance in the code.
OPTIMAL DESIGN OF SELF-DAMPED LOSSY TRANSMISSION LINES IN A TREE NETWORK FOR MULTICHIP MODULE
Authors: Jimmy S. Wang, Wayne W. Dai
Venue:  (1992)

This paper addresses some of the problems encountered in propagating high-speed signals through lossy transmission lines on the substrates of silicon-on-silicon thin-film multichip modules (MCM). Instead of terminated by resistors, the lossy lines on the thin-film multichip modules can be structured to critically damp out the signal resonances, they are thus called *optimal, self-damped lossy transmission lines*. It is easiest to manufacture interconnection lines with fixed metal and dielectric thicknesses, and vary only the line width. This results in specific dependency of line width on length for self-damped lines. In this paper, we present the a simple and robust method of designing self-damped lossy transmission lines in a tree network for multichip module. We vary the width of each branch of the network to meet certain electrical damping criteria. This results in stable operation as long as the lossy transmission line is shorter than the quarter wave length of the highest frequency component of interests. The lengths of lines on the silicon-on-silicon thin-film MCM substrate usually does not exceed this limit. If certain designs require larger substrate or higher speed, the materials and structural properties of the substrate (for example the dielectric thickness) is changed according to the method.
Dynamically Reconfigurable Networks: Concept Evaluation Through Simulation
Authors: Anjali Venkateshwaran, Richard E. Nance, Osman Balci
Venue:  (1988)

The dynamically reconfigurable hierarchical network offers decided advantages in reliability and survivability. The concept is evaluated strictly in terms of message transmission delays for demand scenarios that vary widely. A SIMULA 67 model provides the experimental basis for obtaining preliminary results that show the reductions in transmission delays to be significant and to increase with the size of the network.
A SCAN-LINE ALGORITHM FOR VOLUME RENDERING OF MULTIPLE CURVILINEAR GRIDS
Authors: Jane Wilhelms, Paul Tarantino, Allen VanGelder
Venue:  (1995)

This report presents a volume rendering technique that is based on a scan-line algorithm with depth sorting. The algorithm can handle any connected grid, including multiple non-convex intersecting curvilinear grids, and is designed to be run in parallel on a MIMD architecture. Variable resolution is achieved by changing the height and width of the output screen. Scan conversion and compositing are done in software, which eliminates the need for special graphics hardware, as well as any artifacts associated with graphics hardware. A description of the data structures and pseudo-code is given along with a solution for rendering accurate depths in perspective viewing. The algorithm is compared, with respect to time and accuracy, against cell projection.
Block-Jacobi Method with Relaxation Parameters for Approximating the Minimal Norm Solution of Inconsistent Least-Squares Problems
Authors: C. Popa
Venue:  (1997)

In this paper we extend a version of the block-Jacobi projections method proposed in [5] (see also [16]) such that our new algorithm always generates sequences convergent to the minimal norm least- squares solution even for inconsistent problems. We also describe some numerical tests which confirm the theoretical results presented. 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
LZWBSWRT - A TECHNIQUE FOR HIGH PERFORMANCE UNIVERSAL DELTA DATA COMPRESSION (M.S. thesis)
Authors: Budi Sutardja
Venue:  (1991)

Delta data compression is a technique used to take advantage of the external redundancy of one data object with respect to another related data object. This technique has been used in the storage management subsystem of many revision control systems. The UNIX *diff* algorithm, which works only on line-based text data, is a common delta extraction algorithm. A universal lossless high-performance delta data compressor known as LZWBSWRT is presented. This simple algorithm can perform delta extraction on both text and binary data. Since LZWBSWRT simultaneously performs delta extraction and data compression, the results are often several orders of magnitude better in both execution speed and storage utilization than the combination of UNIX''s *diff* and *compress*. This paper develops the finite automata theory of the dictionary- based coder that contributes to the derivation of the LZWBSWRT. Using a concept of extended deterministic finite automata trees (EDFAT), a family of high-performance compression algorithms known as LZWBS is introduced. From this family, we derived LZWBSWRT. Besides applications in revision control systems and version control systems (for which LZWBSWRT was designed), several other viable applications are discussed. These include global database compression, image recognition, computer animation and digital video compression. 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