ppxscal/embedding_network huggingface dataset:
CARAFE USERS MANUAL RELEASE APLHA 5
Authors: Alvin Jee, David Dahle, Cyrus Bazeghi, F. J Ferguson
Venue:  (1996)

This document describes the command line user interface and the X window user interface for Carafe, the second generation Inductive Fault Analysis (IFA) program, and the Hemlock version of Carafe used for extracting faults in the interconnect regions of standard cell designs. The syntax of all the commands and their parameters are described in this document along with a description of the formats of the various files used and created by Carafe. Also included are descriptions of what Carafe does, how it does it, and the formats of its input files.
Visual Object Shape Recognition Using Hierarchical Syntax Extraction
Authors: Sok G Lim
Venue:  (1996)

This thesis focuses on solving a restricted family of pattern recognition problems, called the Visual Object Shape Recognition problems, in which objects are recognised or classified based on their shape. The boundary or contour of the object is used for recognition. The aim is to develop a generic approach to solve Visual Object Shape Recognition problems. The objective is to investigate and develop a general approach, Hierarchical Syntax Extraction, based on an idea proposed by Alder and deSilva. The proposed approach is similar to the Structural or Syntactic approach in certain aspects and very much different in others. The idea is to automatically, or semi-automatically, extract the structural information in the object and then use it for classification. In order to accomplish the above goal, the approach is developed and tested by implementing a visual object shape recognition system. The desired capabilities of the system are: (1) to recognise objects to a satisfactory level; (2) to be able to generalise, to solve variant problems within the visual object shape recognition class of pattern recognition problems. The approach was first tested by implementing a moving head detection system. The application chosen is to distinguish moving heads from other moving objects such as hands, curtains and trees, in a domestic environment. This system was extended to a real time system and generalised to recognise cartoon characters. There are four parts in this thesis. Part I of the thesis states the objective which is to develop a general approach, Hierarchical Syntax Extraction, to solve the visual object shape recognition class of pattern recognition problems and presents the relevant background literature of pattern recognition. Part II of the thesis concentrates on the exploration of the Hierarchical Syntax Extraction approach, which is accomplished by a series of experiments. The third part of the thesis describes the Hierarchical Syntax Extraction approach arising from the exploratory experiments conducted in Part II; it also describes two more experiments. Finally, the conclusions of the work done are presented in Part IV. What has been achieved: A general approach, Hierarchical Syntax Extraction, has been developed, only partially, to solve the visual object shape recognition class of pattern recognition problems with the following assumption and constraints: there is only a single object in the image the object has been reduced to a thin-line binary image, in other words the boundary of the silhouette A real-time moving head detection system was implemented and was capable of distinguishing moving heads from a wide range of other moving objects in a domestic environment. With slight modifications, the system was generalised to recognise cartoon characters.
Search for computing posterior probabilities in Bayesian networks
Authors: David Poole
Venue:  (1992)

This paper provides a general purpose search-based technique for computing posterior probabilities in arbitrary discrete Bayesian Networks. This is an ``anytime'''' algorithm, that at any stage can estimate prior and posterior probabilities with a known error bound. It is shown how well it works for systems that have normality conditions that dominate the probabilities, as is the case in many diagnostic situations where we are diagnosing systems that work most of the time, and for commonsense reasoning tasks where normality assumptions (allegedly) dominate. We give a characterisation of those cases where it works well, and discuss how well it can be expected to work on average. Finally we give a discussion on a range of implementations, and discuss why some promising approaches do not work as well as may be expected.
Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application
Authors: Vesselin K. Vassilev, Terence C. Fogarty, Julian F. Miller
Venue: Advances in evolutionary computing: theory and applications (2003)

The theory of fitness landscapes has been developed to provide a suitable mathematical framework for studying the evolvability of a variety of complex systems. In evolutionary computation the notion of evolvability refers to the efficiency of evolutionary search. It has been shown that the structure of a fitness landscape affects the ability of evolutionary algorithms to search. Three characteristics specify the structure of landscapes. These are the landscape smoothness, ruggedness and neutrality. The interplay of these characteristics plays a vital role in evolutionary search. This has motivated the appearance of a variety of techniques for studying the structure of fitness landscapes. An important feature of these techniques is that they characterize the landscapes by their smoothness and ruggedness, ignoring the existence of neutrality. Perhaps, the reason for this is that the role of neutrality in evolutionary search is still poorly understood.In this chapter some recent results on the spectral properties of the algebraic structures of fitness landscapes are summarized to provide a basis for studying the landscape structure. This approach is further employed to introduce an information analysis that characterizes the structure of fitness landscapes in terms of their smoothness, ruggedness and neutrality. The findings are finally applied in a study of the fitness landscapes generated by evolving digital circuits using an idealized model of a field-programmable gate array. The landscapes of this engineering problem are quite different from many recently studied landscapes that tend to be defined over simplified combinatorial and optimization problems. The difference originates from the genotype representation that is a configuration defined over two completely different alphabets. This makes the study of the corresponding landscapes much more involved. It is shown that the circuit evolution landscapes are products of subspaces with different characteristics. They are landscapes with vast neutrality and sharply differentiated plateau.
Introduction
Authors: Keith Devlin
Venue: Communications of the ACM (2003)

The main benefit of learning and doing mathematics is that it develops the ability to reason about formally defined abstract structures like those in computer science and its applications.
Ginger - A Simple Functional Language
Authors: M. S. Joy
Venue:  (1992)

Ginger is a lazy functional language with simple syntax and semantics, heavily sugared lambda-calculus spiced with primitive data types and operators. Ginger is designed to run on a parallel machine, and operators to control parallelism are included. Primitives for a novel "divide-and-conquer" style list processing model are also included. This document is the reference manual for the language.
Parallel Program Analysis on Workstation Clusters: Memory Utilisation and Load Balancing
Authors: Roberto Togneri
Venue:  (1995)

There are many considerations that need to be made when a workstation cluster is used for parallel programming development. In this paper we show that as well as computational speedup there are both obvious benefits as well less obvious system inefficiencies when the memory utilisation is examined. The series-parallel algorithms are a well-known class of algorithms. The pool-of-tasks algorithms are equally important and we propose a way to easily estimate the speedup for such algorithms. The method is shown to work for the simulated pool-of-tasks algorithm presented. Our results also indicate that pool-of-tasks provide improved speedup over series-parallel algorithms when considering equivalent computational and communication requirements. The effect of load balancing is also examined for both algorithm types and our results show experimentally that the series-parallel algorithm is highly affected by unbalanced loading but the pool-of-tasks is inherently more robust.
Untangling compound documents on the web
Authors: Nadav Eiron, Kevin S. McCurley
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

Most text analysis is designed to deal with the concept of a "document", namely a cohesive presentation of thought on a unifying subject. By contrast, individual nodes on the World Wide Web tend to have a much smaller granularity than text documents. We claim that the notions of "document" and "web node" are not synonymous, and that authors often tend to deploy documents as collections of URLs, which we call "compound documents". In this paper we present new techniques for identifying and working with such compound documents, and the results of some large-scale studies on such web documents. The primary motivation for this work stems from the fact that information retrieval techniques are better suited to working on documents than individual hypertext nodes.
A Workload Emulator Architecture for Distributed Systems
Authors: Marc Abrams, John Arnesen, Alan Batongbacal, Chokanath Chandraseka, Jain J. Wang
Venue:  (1991)

This report presents the initial design of a general purpose workload emulator that emulates workstations, terminals, and communication equipment attached to host computers and servers in a distributed computing environment. The workload emulator can be programmed to model the time dependent behavior of a workload for performance evaluation of distributed systems.
SINGLE-LAYER FANOUT ROUTING AND ROUTABILITY ANALYSIS FOR BALL GRID ARRAYS
Authors: Man Yu, Wayne W Dai
Venue:  (1995)

Fanout routing for Ball Grid Array(BGA) packages becomes non-trivial when the I/O pin count increases. With large number of I/Os, the number of I/Os we can put on a package is not always limited by the available area but sometimes by the ability to fan them out on the next level of interconnect---the PCB or MCM substrate. This paper is the first to consider this problem and offers an efficient algorithm (EVENFANOUT) to solve it. EVENFANOUT generates the optimal uniform distribution of wires. Another important contribution is that we analyzed the relationship between pin pitch and the routability of fanout so that the package designer can choose an optimal pitch for maximum routability. Knowing this relationship, we know whether a fanout routing is routable or not before it is routed. This is implemented in the Package Early Analysis and Routing Tool (PEART) for rapid development of Ball Grid Array Packages.
A Procedural Approach to Evaluating Software Development Methodologies: The Foundation
Authors: James D. Arthur, Richard E. Nance, Sallie M. Henry
Venue:  (1986)

A procedure for evaluating software development methodologies is developed. Beginning with the issue of what constitutes a methodology, development of the evaluation procedure relies on the establishment of linkages among objectives, principles, and attributes intrinsic to software development methodologies. The evaluation of software development methodologies reflects an assessment structured by the needs, process, and product sequence for system development. Linkages are defined from recognized software engineering sources, providing a foundation for both objective and subjective "analysis" of a given methodology. Application of the evaluation procedure to two software development methodologies currently used by the United States Navy reveals the inherent power of the procedural approach.
AUGEND-BASED ARITHMETIC CODES AND THE GOLOMB CODE
Authors: Glen G. Langdon,  Jr.
Venue:  (1990)

Results of Gallager and VanVoorhis are employed to show that all augend-based binary arithmetic coders in the fixed augend case generate code strings of identical length to some Golomb code and vice-versa. A-based coders are studied for the random augend case (random interval model) that assume a randomization of successive augend values. When augend Q and the smaller binary probability q_{bpd} of the stationary binary input sequence are *matched*, then the best coding efficiency is achieved. The matching values of Q/q_{opt} differ for fixed and random augend cases, but converge as q becomes small. The coding efficiencies are also compared. The Golomb code matching point for best efficiency is the basis for Golomb number m.
A Student Application of the Object-Oriented Paradigm
Authors: Timothy B. Rea, Michael L. Buckles
Venue: Journal of Computing Sciences in Colleges (1991)

This paper presents a case study that demonstrates how object-oriented design techniques can be used to solve a processor simulation problem. This case study stems from an actual processor simulation assignment that was given to students in a junior-level System Software class at Texas Tech University, a class both authors took as first semester transfer students. We found that exposure to the objectoriented programming paradigm during our first two years of college provided us with a powerful tool that can be used to design and implement solutions to complex problems in a very natural manner.
An Evaluation Procedure for Human-Computer Interface Development Tools
Authors: Deborah Hix, Kay C. Tan
Venue:  (1988)

Human-computer interface development tools--often called user interface management systems or UIMS--are interactive systems that support production and execution of the human-computer interface. Despite their proliferation, no method exists for their systematic evaluation or comparison. We have developed an evaluation procedure that uses a standardized technique to produce quantifiable criteria for evaluating and comparing human-computer interface development tools. The procedure produces ratings along two dimensions: functionality and usability. Specification/implementation techniques used by the tool are also quantitatively rated. An empirical study indicates that the procedure produces reliable results. The procedure is already being used in one commercial environment.
PERFORMANCE GUARANTEES ON ATM NETWORKS
Authors: Cheng Tang, Shree Murthy, D. D.E. Long
Venue:  (1994)

Recent developments in ATM technology has made multiplexing of a wide range of traffic with diverse performance requirements important. The statistical multiplexing of several traffic types such as voice, video and data can lead to network congestion thus violating the quality of service (QOS) guarantees. In order to meet the performance requirements of the applications an efficient transport protocol and congestion control mechanism becomes necessary. We propose a transport mechanism for guaranteeing application required QOS requirements over an ATM network. Leaky-bucket congestion control scheme is used as the traffic policing mechanism. Source characterization of voice and video are modeled as Markov Modulated Poisson Processes (MMPP) and the proposed transport mechanism is evaluated by simulation on a single and multihop network with multimedia traffic. The performance of the scheme is examined as a function of source characteristics and the effect of statistical multiplexing is also investigated. The results indicate that the leaky-bucket scheme and statistical multiplexing are more effective for bursty traffic. This calls for a dynamic control mechanism to achieve optimal system utilization with guaranteed QOS.
Taskmaster: An Interactive, Graphical Environment for Task Specification, Execution and Monitoring
Authors: James D. Arthur, K. S. Raghu
Venue:  (1989)

Taskmaster is an interactive environment that employs a unique blend of graphic technologies and iconic images to support user task specification. In this environment, problem solving is based on the selection, specification, and composition of tools that correspond to natural sets of ordered operations. The Taskmaster environment is novel in that it:
Supporting the optimisation of distributed data mining by predicting application run times
Authors: Shonali Krishnaswamy, Seng Wai Loke, Arkady Zaslavsky
Venue: Enterprise information systems IV (2003)

There is an emerging interest in optimisation strategies for distributed data mining in order to improve response time. Optimisation techniques operate by first identifying factors that affect the performance in distributed data mining, computing/assigning a "cost" to those factors for alternate scenarios or strategies and then choosing a strategy that involves the least cost. In this paper we propose the use of application run time estimation as solution to estimating the cost of performing a data mining task in different distributed locations. A priori knowledge of the response time provides a sound basis for optimisation strategies, particularly if there are accurate techniques to obtain such knowledge. In this paper we present a novel rough sets based technique for predicting the run times of applications. We also present experimental validation of the prediction accuracy of this technique for estimating the run times of data mining tasks.
The Syntax of Images
Authors: Mike Alder, Sok G Lim, Christopher J.S. deSilva
Venue:  (1995)

This paper describes recent work on Syntactic Pattern Recognition, and its applications to what is sometimes called `Image Understanding''. The origin of syntactic methods applied to images goes back to pioneering work of King Sun Fu \cite{Fu}; Fu''s programme ran into a number of difficulties which may be broadly associated with the issues of premature quantisation, the choice of a grammar class, and the inference of a grammar within that class. In essence, Fu tried to map images of a restricted class into a string language and then infer the grammar. We adopt a different approach. We generalise the notion of a grammar to the case where the symbols may take on values in any suitable space, thus preserving the topological features of our objects at all times. We introduce a hierarchy of spaces representing different levels of description of an object (e.g. an image), and an automatic inference process which generates progressively higher level descriptions, essentially from the bottom up. The discretisation to symbols arises naturally from the inference process when there is very strong clustering in the top level space. Well-known ideas from natural language grammatical inference are shown to carry across to images. Other classes of grammars and languages such as array grammars and languages, and Markov Random Fields, are particular instances of this formalism. Applications to a variety of images are outlined. This paper extends material presented in the Pattern Recognition in Practice-IV workshop in Vlieland, June 1994, and also material presented at the International Symposium on Information Theory in Trondheim, July 1994.
Do adaptation rules improve web cost estimation?
Authors: Emilia Mendes, Nile Mosley, Steve Counsell
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

Analogy-based estimation has, over the last 15 years, and particularly over the last 7 years, emerged as a promising approach with comparable accuracy to, or better than, algorithmic methods in some studies. In addition, it is potentially easier to understand and apply; these two important factors can contribute to the successful adoption of estimation methods within Web development companies. We believe therefore, analogy-based estimation should be examined further.This paper compares several methods of analogy-based effort estimation. In particular, it investigates the use of adaptation rules as a contributing factor to better estimation accuracy. Two datasets are used in the analysis; results show that the best predictions are obtained for the dataset that first, presents a continuous "cost" function, translated as a strong linear relationship between size and effort, and second, is more "unspoiled" in terms of outliers and collinearity. Only one of the two types of adaptation rules employed generated good predictions.
Designing evolutionary algorithms for dynamic optimization problems
Authors: Jürgen Branke, Hartmut Schmeck
Venue: Advances in evolutionary computing: theory and applications (2003)

Most research in evolutionary computation focuses on optimization of static, non-changing problems. Many real-world optimization problems, however, are dynamic, and optimization methods are needed that are capable of continuously adapting the solution to a changing environment. If the optimization problem is dynamic, the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. In this chapter, we suggest a classification of dynamic optimization problems, and survey and classify a number of the most widespread techniques that have been published in the literature so far to make evolutionary algorithms suitable for changing optimization problems. After this introduction to the basics, we will discuss in more detail two specific approaches, pointing out their deficiencies and potential. The first approach is based on memorization, the other one uses a novel multi-population structure.
INTERCHANGEABLE PIN ROUTING WITH APPLICATION TO PACKAGE LAYOUT
Authors: Man Yu, Joel Darnauer, Wayne W Dai
Venue:  (1996)

Many practical routing problems such as BGA, PGA, pin redistribution and test fixture routing involve routing with interchangeable pins. These routing problems, especially package layout, is becoming more difficult to do manually due to increasing speed and I/O. Currently, no commercial or university router is available for this task. In this paper, we unify these different problems as instances of Interchangeable Pin Routing (IPR) problem. We show that this problem is NP-complete. We formulate the problem as flows in a routing network on a triangulation instead of grids and developed a min-cost max-flow heuristic considering only the most important cuts in the design. The heuristic is extended to multiple layers and handles prerouted nets. It can accommodate all-angle, octilinear or rectilinear metric. Experiments showed that the heuristic is very effective on most practical examples. It successfully routed an industry design with 4000 interchangeable pins without manual intervention.
Consolidation of soft clays with large strains
Authors: C. J. Leo, K. H. Xie
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper develops some fully explicit analytical solutions of one-dimensional large strain consolidation. These solutions are useful in their own right while also providing an efficient method to validate numerical solutions of large strain consolidation analyses. A few numerical examples are given comparing the results of large and conventional small strain theory. Parametric studies have been undertaken showing that unlike in conventional small strain theory, the average degree of consolidation defined by stress (i.e. Up) and that defined by strain (i.e. Us) in large strain theory are not identical. The studies show that the settlement predicted by large strain theory is smaller than that given by small strain theory, and both the development of settlement and the dissipation of excess pore water pressure in large strain consolidation are faster than in small strain consolidation. It is also found that the discrepancy between the consolidation theories of large strain and small strain decreases with decreasing compressibility of soil and magnitude of applied load.