ppxscal/embedding_network huggingface dataset:
A Procedure for Evaluation Human-Computer Interface Development
Authors: Deborah Hix
Venue:  (1989)

An evaluation procedure that uses a standardized technique to produce quantifiable criteria for evaluating and comparing human-computer interface development tools is described in this paper. An empirical validation study to determine the consistency of ratings produced by this procedure is also presented. These ratings could be used, for example, as important data for the task of choosing a tool for a particular human-computer interface development environment.
Consistency Maintenance in Autonomous Agent Representations
Authors: Glenn S. Wasson, Anand Natrajan, Jim P. Gunderson, Gabriel J. Ferrer, Worthy N. Martin, Paul F. Reynolds,  Jr.
Venue:  (1998)

Multi-representation models are an attractive design solution for layered autonomous agent architectures in terms of man aging complexity of internal representations and separation of design concerns. However, the representations maintained by the multiple layers can become inconsistent with one another due to the nature of the layers'' concerns and capabilities. Consistency maintenance in multi-representation models is an emerging concern in many domains, such as military simulations. We present an approach to consistency maintenance in multi-tier agent architectures. We draw on experience and techniques from the multi-representation modeling community. The benefit of this approach for autonomous agent designers is a conceptual framework through which to organize systems that must deal with temporal and mapping inconsistencies.
Measuring Software Quality in Ada Packages: An Objectives,Principles, Attributes Framework
Authors: Gary N. Bundy, James D. Arthur
Venue:  (1990)

This paper describes preliminary results stemming from a research effort focusing on assessing the quality of an Ada-based product. The presentation emphasizes
Visualizing Sets of Evolutionary Trees
Authors: Jeff Klingner
Venue:  (2001)

One of the problems with current methods for phylogenetic reconstruction is the large number of equally parsimonious trees that are often found during a tree search; understanding these large sets of trees is a challenge for biologists. I explored the utility of a data visualization technique in creating 2D and 3D images of tree sets in order to improve researchers'' understanding of the sets. I used multidimensional scaling based on Robinson-Foulds inter-tree distances to construct the visualizations. Direct visualization of taxa differences was also explored. I found that structure in the tree sets was reflected in the visualizations. Visual clustering in our pictures corresponds to islands of phylogenetic trees in the set and also reveals additional structure. Direct visualization of taxa differences provides a good alternative to displaying divergence with branch lengths and may be useful in a divide-and-conquer approach to phylogenetic reconstruction. I integrated all of the computational steps needed for building the visualizations into a module for the phylogeny software package Mesquite.
Development of a database oriented software for construction material selection in contaminated soils
Authors: A. J. Puppala, V. Mohan, E. C. Crosby, S. Valluru
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper presents chemical compatibility data between construction materials and chemical contaminants commonly encountered in infrastructure construction projects. With this information, a user-friendly software was developed to allow selection and evaluation of construction materials in contaminated sites. Details of the software development, including database and graphical modules development and a few case study examples are covered in this paper.
On the Relative Complexity of Approximate Counting Problems
Authors: Martin Dyer, Leslie A Goldberg, Catherine Greenhill, Mark Jerrum
Venue:  (2000)

Two natural classes of counting problems that are interreducible under approximation-preserving reductions are: (i) those that admit a particular kind of efficient approximation algorithm known as an "FPRAS," and (ii) those that are complete for #P with respect to approximation-preserving reducibility. We describe and investigate not only these two classes but also a third class, of intermediate complexity, that is not known to be identical to (i) or (ii). The third class can be characterised as the hardest problems in a logically defined subclass of #P.
Software Reuse Metrics and Models: A Survey
Authors: William Frakes, Carol Terry
Venue:  (1994)

This paper is no longer available. It has been replaced by TR-95-07.
Polar Backpropagation
Authors: Keith Godfrey, Yianni Attikiouzel
Venue:  (1990)

This paper defines the general polar classification problem and proposes a modified backpropagation architecture for solving it. The topology of interconnections is constrained so that selected ones correspond with physical entities in the problem. With this in-build heuristic knowledge, a polar backpropagation network offers a more informative solution than a standard backpropagation network.
TRANSFORMATION OF MIN-MAX OPTIMIZATION TO LEAST-SQUARE ESTIMATION AND APPLICATION TO INTERCONNECT DESIGN OPTIMIZATION
Authors: Jimmy S Wang, Wayne W Dai
Venue:  (1995)

This paper describes a novel approach to find a tighter bound of the transformation of the Min-Max problems into the one of Least-Square Estimation. It is well known that the above transformation of one problem to the other can lead to the proof that their target functions linearly bound each other. However, this linear bound is not a tight one. In this paper, we prove that if we transform the Min-Max problem into two Least-Square Estimation problems, where one minimizes the Root-Mean-Square (RMS) of the original function and the other one minimizes the RMS of the difference between the original function and an arbitrary constant, one can obtain a tighter bound between their target functions. The tighter bound given by this novel approach depends on the outcome of the second Least-Square Estimation problem, so there is a great incentive to choose the arbitrary constant which gives the smallest RMS of the second Least-Square Estimation problem. For a problem with a large number of variables, this novel tighter bound can be two to three order tighter than the old one.
Effects of torsion on the flexural stiffness of the rectangular reinforced concrete sections
Authors: M. J. Fadaee, M. Banihashemi
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

In this paper, in order to investigate the effect of torsion on the flexural stiffness, a progressive algorithm is presented for finding the response of the section under combined loadings. In the proposed method, it is proven that for finding the response of the section under combined loadings, there are always two independent variables and the other variables can be related to these two variables. In the method of this work, the bending curvature of the section, φ, and the torsion angle, ψ, are assumed to be known and the goal is finding the actions that produce such section response.At the end of the paper, the method is applied for an example section and the results are summarized in a table. Using information of the table the M -φ curves for different values of torsion at the section are plotted. The curves can be used in order to investigate the effect of torsion on the bending stiffness of the section.
Sparse Communication Networks and Efficient Routing in the Plane''
Authors: Y. Hassin, D. Peleg
Venue:  (2000)

Traditional approaches to network design separate the issues of designing the network itself and designing its management and control subsystems. This paper proposes an approach termed routing-oriented network design, which is based on designing the network topology and its routing scheme together, attempting to optimize some of the relevant parameters of both simultaneously. This approach is explored by considering the design of communication networks supporting efficient routing in the special case of points located in the Euclidean plane. The desirable network parameters considered include low degree and small number of communication links. The desirable routing parameters considered include small routing tables, small number of hops and low routing stretch. Two rather different schemes are presented, one based on direct navigation in the plane and the other based on efficient hierarchical tree covers. On a collection of n sites with diameter D, these methods yield networks with maximum degree O(logD) (hence a total of O(nlogD) communication links), coupled with routing schemes with constant routing stretch, O(logn logD) memory bits per vertex and routes with at most logn or logD hops.
Pseudo-Spectral Coefficients as optimum features for Pattern Recognition.
Authors: Arkell
Venue:  (1993)

Abstract unavailable. 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
Evolutionary algorithms for the physical design of VLSI circuits
Authors: James Cohoon, John Karro, Jens Lienig
Venue: Advances in evolutionary computing: theory and applications (2003)

Electronic design automation (EDA) is concerned with the design and production of VLSI systems. One of the important steps in creating a VLSI circuit is physical design. The input to the physical design step is a logical representation of the system under design. The output of this step is the layout of a physical package that optimally or nearly optimally realizes the logical representation. Physical design problems are generally combinatorial in nature and have very large problem sizes, thus necessitating the use of heuristics such as evolutionary algorithms. We review evolutionary algorithms for physical design and observe and analyze the common traits of the superior contributions. We also discuss important requirements for evolutionary-based approaches for even greater acceptance within the VLSI community.
Agent-oriented Modelling for a Billiards Simulation
Authors: M. Farkas, W. M. Beynon, Y. P. Yung
Venue:  (1993)

This paper describes the application of an agent-oriented modelling technique outlined in [BBY92] to the simulation of a game of billiards. This case-study is chosen to demonstrate the versatility of our agent-oriented approach, and its potential for integrating discrete event modelling with process control. The scope for modelling a variety of modes of control is explained and illustrated.
The Broker/Services Model for the Design of Cooperative Process-Oriented Environments
Authors: Dimitrios Tombros, Andreas Geppert, Klaus R. Dittrich
Venue:  (1997)

Cooperative process-oriented environments (CPEs) are typically large- scale distributed heterogeneous systems whose behavior is defined by processes. A CPE has to provide mechanisms for the integration and the coordination of applications of considerably different technologies running on heterogeneous platforms, such as diverse database management systems. Recent work focuses on data integration or addresses systematic control integration only partially. In this paper, we propose the Broker/Services Model as a software architecture model for CPEs. In this model, actors in a CPE (software systems or humans) are specified and implemented as reactive components. This model is also capable of modeling the functionality of CPE-components as well as component- interaction in a process-independent as well as a process-specific manner. In particular, the model can be applied to integrate database and non-database applications as well as manual tasks into architecturally coherent cooperative information systems.
Recognizing VLSI Circuits from Mask Artwork
Authors: Amir Alon, William S. Havens
Venue:  (1985)

The design of Very Large Scale Integrated (VLSI) circuits remains an art despite recent advances in Computer Assisted Design (CAD) techniques. Unfortunately, the sophistication of the design procss has not kept pace with the VLSI hardware technology. Very expensive errors proliferate into fabrication despite powerful design rule checkers and circuit simulators. We have developed an alternative approach derived from research in knowledge representation and schema-based computer vision. The system implemented recognizes an abstract logic function description of the VLSI circuit from its mask layout artwork. Our technique reverses the desiFn process thereby recovering the logical function actually fabricated in the chip. No simulation is necessary and conceptually all logical design errors can be detected. The work is a direct application of schema labelling techniques which were developed for the Mapsee2 sketch map understanding system. This prototype system has been tested on a number of logical chip designs with correct results. Some results are presented.
The Formal Specification of a Blackboard Framework
Authors: I. D. Craig
Venue:  (1991)

The blackboard architecture is a complex, though powerful, model of problem-solving, and opinions vary as to its interpretation. The use of formal specifications for blackboard systems appears warranted by their complexity, their application in real-time and safety critical domains, and because of the informality of the construct itself. This paper describes the Z specification of a blackboard framework, the aims, and the methods by which it was executed. At present, the specification is only a top-level one (and occupies over 100 A4 pages, including proofs and explanatory text): this has allowed concentration on the interpretation of the architecture, and has allowed the formal proof of a number of properties which have, hitherto, had ''folklore'' status. The specification exercise revealed a number of areas in which further work was required. The blackboard specification is one of a number of Z specifications of AI architectures that we have undertaken: the problem areas first identified in the blackboard specification have reappeared in the others, and we suggest ways of solving the problems which are, perhaps, of general utility.
ADAPTATIVE DECISION TREE ALGORITHMS FOR LEARNING FROM EXAMPLES (Ph.D. Thesis)
Authors: Giulia M. Pagallo
Venue:  (1990)

This thesis investigates the problem of designing learning algorithms that adaptively enlarge the set of primitive attributes with features (*adaptive algorithms*). We focus on learning algorithms that use decision trees as a concept description language. We motivate the need for this type of algorithm by characterizing the complexity of the decision tree representation for disjunctive concepts. Due to a representational problem, disjunctive concepts do not always have a concise decision tree description when the tests at the nodes are limited to the initial attributes. However, we show that this representational problem is overcome by using adequate features. We present two types of adaptive decision tree algorithms: iterative algorithms, and separate and conquer algorithms. Algorithms of the first type use an iterative control structure. In each iteration very simple combinations of features from previous iterations are proposed. More adequate and complex features are created as the number of iterations increases. Algorithms of the second type use a greedy top-down approach to explain the training examples by a restricted kind of decision tree, called a decision list. The performance of the algorithms is evaluated empirically on several synthetic and natural domains that have been used as benchmarks for other learning algorithms. The results establish that the algorithms outperform a standard decision tree method when the target concept can be described either by a small Disjunctive Normal Form (DNF) formula or by a small Disjunctive Linear Form formula whose nonzero weights have a magnitude 1 ((0,1)DLF), and the examples are drawn from the uniform distribution over the instance space. Finally, we prove that one of the algorithms is a Probably Approximately Correct (PAC) algorithm for learning muDNF concepts when the examples are drawn from the uniform distribution.
Interconnect Optimization in Deep Sub-micron Design under the TransmissionLine Model
Authors: Youxin Gao
Venue:  (2001)

As the VLSI technology has been scaled down to 0.18nm in recent years and is expected to be scaled down to 0.05nm in the near future, interconnect delay becomes an important factor in achieving high performance. In deep sub-micron design, interconnect delay is shown to be 10 to a few hundred times bigger than the intrinsic gate delay for a global interconnect, and thus dominates the circuit delay. To reduce interconnect delay, wire-sizing and buffer insertion/sizing are two effective techniques. One of the approaches to wire-sizing is continuous wire-sizing. In continuous wire-sizing, the shape of a wire is described by a continuous function, and the objective is to find a shape function which minimizes delay or minimizes area subject to a delay bound. In the first part of this dissertation, we present some continuous wire-sizing results under the Elmore delay model. In the second part of this dissertation, we present some wire-sizing results under the transmission line model. In the third part of this dissertation, we present a graph based algorithm for optimal buffer insertion under accurate delay models.
Experiments in Data Placement
Authors: Clark L. Coleman, Jack W. Davidson
Venue:  (1998)

Compilers currently place data objects at memory addresses that are determined by the order of the declarations of the data objects. Experiments confirm that cache misses can be reduced by rearranging the order of data objects, reducing conflict misses, and by aligning array objects on cache line boundaries, reducing compulsory misses slightly.
Defining the Semantics of Reactive Components in Event-DrivenWorkflow Execution with Event Histories
Authors: Andreas Geppert, Dimitrios Tombros, Klaus R. Dittrich
Venue:  (1997)

The definition of exact semantics of workflows and involved processing entities is an open yet urgent problem for most systems. This paper considers the semantics and correctness of event-driven workflow execution by reactive components. The basis for the formalization in our approach is provided by an event his tory which records all the events generated during the execution of workflows by these components. Based on the formal notion of history, it is possible to determine the semantics of workflow systems as the set of event histories they can generate. It also allows to formalize the semantics of reactive components-and consequently, the semantics of workflows-as well as to check whether their observable behavior is correct. In addition to the precise understanding of event-driven workflow execution, the formalized notion of event history also serves as the specification of the workflow execution engine. Ultimately, the semantics of reactive components provides the basis for specifying transformation rules used to map these components to the execution level.
Upper Bounds on the Height Difference of the Gaussian Random Field and the Range of Random Graph Homomorphisms into Z
Authors: I. Benjamini, G. Schechtman
Venue:  (1999)

It is shown that the maximal height difference of the Gaussian random field on a connected graph with n vertices is dominated by max 1 # j > k # 2n&#x00A0; | k ? i = j&#x00A0; Xi. Where the Xi's, 1 # i # 2n, are independent standard normal random variables. A somewhat weaker analogue of this, is established for the range of random graph homomorphisms into Z.
Wave problems in infinite domains
Authors: M. Premrov, I. Špacapan
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

A finite element method for solving two dimensional wave problems in infinite domains is presented in this paper. The method is based on an iterative variation of fictive boundary conditions on an artificial finite boundary. The finite computational domain is in each iteration subjected to actual boundary conditions and to different (Dirichlet or Neumann) fictive boundary conditions on the artificial boundary. The halfspace Dirichlet to Neumann operator is used only to determinate new fictive boundary conditions and is not included into a finite element formulation. Thus any finite elements can be used and the method is especially applicable for computing higher harmonics.
List Processing in Parallel
Authors: T. H. Axford, M. S. Joy
Venue:  (1991)

A new model of list processing is proposed which is well suited to parallel implementation. Its main primitive functions are: "concatenate", which concatenates two lists; "split", which partitions a list into two parts; and "length", which gives the number of elements in a list. In the commonly used CREW P-RAM model of parallel computation, common high-level operations on lists such as "map" and "reduce" take O(log n) time in the new model as against O(n) time in the conventional head-tail-cons model of list processing. Parallel simulation of a number of simple programs in the functional language FLIC, using the new model of lists, gives parallel execution times consistent with this analysis. The programs tried use the high-level functions "map, filter" and "reduce", together with an implementation of Hoare''s "quicksort".
Principles of Simulation Model Validation, Verification, and Testing
Authors: Osman Balci
Venue:  (1994)

Sufficient experience has been gained over the last decade in simulation model validation, verification, and testing (VV&T) to establish basic principles and its characteristics. This paper presents 15 principles of simulation model VV&T. These principles help the researchers, practitioners, and manaagers better understand what model VV&T is all about. They serve to provide the underpinnings for the VV&T techniques that can be used throughout the life cycle of a simulation study. Understanding and applying these principles is crucially important for the success of a simulation study.
Optimal Carry Save Networks
Authors: M. S. Paterson, N. Pippenger, U. Zwick
Venue:  (1990)

A general theory is developed for constructing the asymptotically shallowest networks and the asymptotically smallest networks (with respect to formula size) for the carry save addition of n numbers using any given basic carry save adder as a building block. Using the optimal carry save additional networks the shallowest known multiplication circuits and the shortest formulae for the majority function (and many other symmetric Boolean functions) are obtained. In this paper simple basic carry save adders are described using which multiplication circuits of depth 3.71 log n (the result of which is given as the sum of two numbers) and majority formulae of size O (n3.13) are constructed. Using more complicated basic carry save adders, not described here, these results could be further improved. Our best bounds are currently 3.57 log n for depth and O (n3.13) for formula size.
A Neural Network Approach to the Consistent Labeling Problem
Authors: J. Feng, W. Tao, H. Burkhardt
Venue:  (1993)

This paper presents a method to solve the consistent labeling problem, especially the high-order constraint case, by the Hopfield network. A agitating method is also proposed to tackle the problem of local minima. Some experiments concerning line drawing labeling are demonstrated.