ppxscal/embedding_network huggingface dataset:
Solving permutation problems with the ordering messy genetic algorithm
Authors: Dimitri Knjazew, David E. Goldberg
Venue: Advances in evolutionary computing: theory and applications (2003)

Although successful at first, messy genetic algorithms had minimum attention within the evolutionary computation community for the past few years. This chapter presents an ordering messy genetic algorithm (OmeGA) that is able to solve difficult permutation problems efficiently. Starting with a brief introduction to the fast messy genetic algorithm (fmGA), the chapter continues by proposing a robust representation model--the random keys--that proved to work successfully for representing permutations. The design of OmeGA is described and ordering deceptive problems are discussed in detail. Thereafter, experimental results that show the random key-based simple genetic algorithm (RKGA) being outperformed by its messy competitor in 32-length ordering deceptive problems are presented. The OmeGA is completely independent from the underlying chromosome's coding scheme and finds the global optimal solution in problems with both tightly and loosely coded building blocks. The chapter finally demonstrates the OmeGA's scale-up behavior.
Structured Matrices, Reproducing Kernels and Interpolation
Authors: H. Dym
Venue:  (2000)

The purpose of this paper is to discuss some natural connections between structured matrices and a class of interpolation problems. The link rests on interpreting the structured matrix as the Gram matrix of a reproducing kernel space of a special kind. If the matrix is positive, then the space is a finite dimensional Hilbert space. If the matrix is Hermitian and invertible, then the space is a finite dimensional Krein space. If the matrix is invertible but not Hermitian, then pairs of reproducing kernel spaces come into play. We shall not consider that case here; see [AD4] for additional information . There are also connections when P is Hermitian and singular, but we shall not consider that case in any detail here either; see [D6] for an elementary approach to this case and references to the literature. 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
A Stake In The Ground: A New Approach To Cache Analysis
Authors: Dee A. B. Weikle, Sally A. McKee, Wm Wulf
Venue:  (1997)

As the processor-memory performance gap continues to grow, so does the need for effective tools and metrics to guide the design of efficient memory hierarchies to bridge that gap. Aggregate statistics of cache performance can be useful for comparison, but they give us little insight into how to improve the design of a particular component. We propose a different approach to cache analysis -- viewing caches as filters -- and present two new metrics for analyzing cache behavior: instantaneous hit rate and instantaneous locality. We demonstrate how these measures can give us insight into the reference pattern of an executing program, and show an application of these measures in analyzing the effectiveness of the second level cache of a particular memory hierarchy.
Data Cache Performance When Vector-Like Accesses Bypass the Cache
Authors: Michael D. Nahas, William A. Wulf
Venue:  (1997)

A Stream Memory Controller, when added to a conventional memory hierarchy, routes vector-like accesses around the data cache. A memory system was simulated under these conditions and the data cache performance increased dramatically. The gain in performance was a result of the increased temporal locality of the access pattern. The access pattern also showed a decrease in spatial locality, making smaller cache lines nearly as effective as long ones.
Konzepte zur Entwicklung paralleler Algorithmen der digitalen Bildverarbeitung
Authors: Michael Nolle
Venue:  (1994)

The thesis addresses some important problems in the area of parallel processing and the development of parallel algorithms. Several aspects of parallel systems are discussed. Among those are single instruction multiple data (SIMD) versus multiple instruction multiple data (MIMD) machines, reconfigurable and fixed communication networks, message passing, the classification and efficient implementation of parallel algorithms. A key for the efficient application of parallel systems lies in the network used for the interprocessor communication. In many cases the time for data exchange operations dominates the loss of efficiency in parallel implementations. The thesis analyses a class of equivalent logarithmic networks, especially de Bruijn graphs, and shows that those fixed networks allow efficient implementations for various problems. Many image processing algorithms comprise a regular structure of computation that has to be applied on high amounts of data. The thesis shows efficient methods to classify similar structured computations. For every selected class an optimal embedding into the parallel system is given. Novel approaches are developed to express the inherent virtual parallism of the algorithms and to map the resulting implementation onto parallel systems that vary in size and structure. The theoretical approaches are applied to and validated by practical implementations off various algorithms and an extensive analysis of the runtime results and performance is proposed.
A NOVEL APPROACH FOR THE TRANSIENT SIMULATION OF THE COUPLED TRANSMISSION LINES CHARACTERIZED WITH THE FREQUENCY-DEPENDENT LOSSES USING SCATTERING-PARAMETER BASED MACROMODEL
Authors: Jimmy S Wang, Wayne W Dai
Venue:  (1995)

This paper describes two novel macromodels for incorporating the single and coupled transmission Lines characterized by the frequency-dependent losses into an S-parameter macromodel based simulator. This approach computes the moments of the S-parameter based upon the frequency-dependent parasitic functions: R(f), L(f), C(f), and G(f) which characterize the single or coupled transmission lines. These same moments are later used to construct the macromodels. Once the macromodels are built, the transient analysis can be performed by the Scattering-Parameter (S-parameter) based macromodel simulator.
Mobile Streams
Authors: M. Ranganathan, Laurent Andrey, Anurag Acharya, Virginie Schaal
Venue:  (1998)

A large class of distributed testing, control and collaborative applications are reactive or event driven in nature. Such applications can be structured as a set of handlers that react to events and that in turn can trigger other events. We have developed an application building toolkit that facilitates development of such applications. Our system is based on the concept of Mobile Streams. Applications developed in our system are dynamically extensible and re-configurable and our system provides the application designer a means to specify resource-control policy-modules that can control how the system can be extended and reconfigured. We describe our system model and compare our design to the design of other similar systems. We also describe three applications that have built using our implementation of Mobile Streams.
On Process Aliases in Distributed Kernel Design
Authors: K. Ravindran, Samuel T. Chanson
Venue:  (1985)

As distributed computing systems become popular because of their functional, economics and reliability characteristics, a new class of problems has emerged. These problems are characterized by the fact that the resources being used by a process as well as the system state is distributed. The management of the processes and resources in such an environment present a challenge that cannot be satisfactorily met by the traditional procedural-based methods which often assume the existence of shared memories. This paper presents a multiagent structure consisting of corporate processes and their associated aliases as an efficient and systematic solution to this class of problems. The model and the kernel primitives necessary to implement the model together with some design considerations are outlined. An example described in terms of the model is also given.
An experimental study on the behaviour of normal and lightweight reinforced concrete corbels and analysis with truss/strut-and-tie model
Authors: M. Y. Kaltakci, G. Yavuz
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

Today, some members of a structure are designed with exaggerated accuracy, but other parts are designed with rule of thumb, empirical methods and experiences. However, all parts of a structure have similar importance. Nowadays truss models are considered to be a rational approach to design of cracked reinforced concrete beam under flexural, shear and torsional effects. But a solution based on a standard truss model is only valid to some region of a structure. In this paper, normal and lightweight reinforced concrete corbels first were designed to TS500(Turkish Standards), and then, a strut-and-tie model was designed with SAP90 program. Strut-and-tie model is attended to analyse all parts of a structure and to consider load path in a structural element. To demonstrate the theoretical results, reinforced concrete corbels having various shear span-depth ratios were produced and tested. Obtained behaviour of tested corbels are concluded with tables and graphics.
On the Comparative Complexity of Resolution and the Connection Method
Authors: Wolfgang Bibel
Venue:  (1988)

Quadratic proofs of the pigeonhole formulas are presented using the connection method proof techniques. For this class of formulas exponential lower bounds are known for the length-of-resolution refutations. This indicates a significant difference in the power of these two proof techniques. While short proofs of these formulas are known using extended resolution, this particular proof technique, in contrast to both the connection method and resolution, seems not suitable for the actual proof search.
BAYESIAN APPROACH TO EARLY PROBABILITY ESTIMATION INBINARY ADAPTIVE CODING
Authors: Ahmad Zandi, Glen G. Langdon,  Jr.
Venue:  (1991)

In a one pass adaptive statistical codng it is required to have a probability distribution on the set of coding alphabet to be used for a symbol *before* it is observed. In particular at the very beginning we have to start with a probability distribution without having any data. This condition is so Bayesian in nature that it is not surprising that a number of people have used the Bayesian approach to the problem. In this report we combine various approaches to this initialization problem for adaptive binary encoding under a general framework. In fact we introduce a single family of priors and show it covers all the known methods of initializing the counts and statistics employed in binary coding. We hope that this general formula makes it easier to choose the most appropriate method for the initialization and what is called *fast attack* for particular problems at hand. We have also added an appendix that gives some historical and mathematical explanation for the most well known cases of the family of priors that we consider.
Exactly Solvable Telephone Switching Problems
Authors: Nicholas Pippenger
Venue:  (1989)

For a certain class of telephone switching problems, much of our understanding arises from an analogy with statistical mechanics that was proposed by Benes in 1963. This analogy has lead to the exact solution of a number of idealized problems, which we survey in this paper.
Resettable Zero-Knowledge
Authors: R. Canetti, O. Goldreich, S. Goldwasser, S. Micali
Venue:  (1999)

We introduce the notion of Resettable Zero-Knowledge (rZK), a new security measure for cryptographic protocols which strengthens the classical notion of zero-knowledge. In essence, an rZK protocol is one that remains zero knowledge even if an adversary can interact with the prover many times, each time resetting the prover to its initial state and forcing him to use the same random tape. Under general complexity assumptions, which hold for example if the Discrete Logarithm Problem is hard, we construct (non-constant round) Resettable Zero-Knowledge proof-systems for NP constant-round Resettable Witness-Indistinguishable proof-systems for NP constant-round Resettable Zero-Knowledge arguments for NP in the public key model where verifiers have fixed, public keys associated with them. In addition to shedding new light on what makes zero knowledge possible (by constructing ZK protocols that use randomness in a dramatically weaker way than before), rZK has great relevance to applications. Firstly, we show that rZK protocols are closed under parallel and concurrent execution and thus are guaranteed to be secure when implemented in fully asynchronous networks, even if an adversary schedules the arrival of every message sent. Secondly, rZK protocols enlarge the range of physical ways in which provers of a ZK protocols can be securely implemented, including devices which cannot reliably toss coins on line, nor keep state between invocations. (For instance, because ordinary smart cards with secure hardware are resettable, they could not be used to implement securely the provers of classical ZK protocols, but can now be used to implement securely the provers of rZK protocols.)
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem
Authors: Mary Cryan, Leslie A Goldberg, Cynthia A. Phillips
Venue:  (1997)

In the L-phylogeny problem, one wishes to construct an evolutionary tree for a set of species represented by characters, in which each state of each character induces no more than L connected components. We consider the fixed-topology version of this problem for fixed-topologies of arbitrary degree. This version of the problem is known to be NP-complete when L is at least 3, even for degree-3 trees in which no state labels more than L+1 leaves (and therefore there is a trivial L + 1 phylogeny). We give a 2-approximation algorithm for all L for arbitrary input topologies and we give an optimal approximation algorithm that constructs a 4-phylogeny when a 3-phylogeny exists. Dynamic programming techniques, which are typically used in fixed-topology problems, cannot be applied to L-phylogeny problems. Our 2-approximation algorithm is the first application of linear programming to approximation algorithms for phylogeny problems. We extend our results to a related problem in which characters are polymorphic.
Projective Alignment with Regions
Authors: R. Basri, D. Jacobs
Venue:  (2000)

We have recently proposed an approach to recognition that uses regions to determine the pose of objects while allowing for partial occlusion of the regions. Regions introduce an attractive alternative to existing global and local approaches, since, unlike global features, they can handle occlusion and segmentation errors, and unlike local features they are not as sensitive to sensor errors, and they are easier to match. The region-based approach also uses image information directly, without the construction of intermediate representations, such as algebraic descriptions, which may be difficult to reliably compute. In this paper we further analyze properties of the method for planar objects undergoing projective transformations. In particular, we prove that three visible regions are sufficient to determine the transformation uniquely, and that for a large class of objects two regions are insufficient for this purpose. However, we show that when several regions are available the pose of the object can generally be recovered even when some or all regions are significantly occluded. Our analysis is based on investigating the flow patterns of points under projective transformations in the presence of fixed points.
Effect of base level to internal forces of a structure in case of earthquake
Authors: J. Györgyi, S. Ádány
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

In this paper a method is discussed with the application of which the foundation depth can be taken into consideration in the seismic analysis. The main steps of the method are presented, the theoretical background is briefly summarised, then it is applied for practical examples. A parametric study is presented in which the effect of the foundation depth is examined on the seismic excitations as well as the internal forces and deflections of the structures of different types. The advantageous effect of soil damping is shown. It is also demonstrated, however, that in some extreme cases the consideration of foundation depth can lead to higher stresses.
LOGICAL DEFINABILITY OF NP OPTIMIZATION PROBLEM
Authors: Phokion G. Kolaitis, Madhukar N. Thakur
Venue:  (1993)

We investigate here NP optimization problems from a logical definability standpoint. We show that the class of optimization problems whose optimum is definable using first-order formulae coincides with the class of polynomially bounded NP optimization problems on finite structures. After this, we analyze the relative expressive power of various classes of optimization problems that arise in this framework. Some of our results show that logical definiability has different implications for NP maximization problems than it has for NP minimization problems, in terms of both expressive power and approximation properties.
A Sensory Input System for Autonomous Mobile Robots
Authors: J. P Bixler, David P. Miller
Venue:  (1987)

In order to accomplish navigation in an similar world a robot must be able to build and update its own world map continuously and in real time. This paper proposes a sensory input system based on the fusion of simple low-resolution vision with directed high-resolution sonar. The basic idea is to use a simple vision system to locate the position in which an obstacle lies, and then use an ultrasonic rangefinder to determine the depth of the object and to gain clues about its shape. By fusing two simple systems we attempt to exploit the strengths of each while maintaining an acceptable computational cost. An idealized example is given and we discuss the possibilities and some of the problems.
Values-based design of learning portals as new academic spaces
Authors: Katy Campbell, Robert Aucoin
Venue: Designing portals: opportunities and challenges (2003)

Many guidelines for portal design tend to focus on the technical aspects of a portal or a network. However, as we continue to define portals as gateways for learning, we need to consider issues related to the social and cultural context in which portals are used. In this chapter we examine learning portals from both the instructors' and the learners' perspectives by synthesizing existing research and proposing a framework for quality guidelines.The Collaborative of Online Higher Education Research (COHERE), consisting of eight large research-intensive universities in Canada involved in Internet-based learning, was created to enhance learning and teaching through technology and to move toward a stronger culture of professional collaboration and scholarship in our educational practices (Carey, 2000). Based on our experience with COHERE, we have developed tools for the formative and summative evaluations of learning portals generally. These tools include usability studies, questionnaires and focus groups.
A Measure of Semantic Relatedness for Resolving Ambiguities in Natural Language Database Requests
Authors: Julia A. Johnson, Richard S. Rosenberg
Venue:  (1990)

A measure of semantic relatedness based on distance between objects in the database schema has previously been used as a basis for solving a variety of natural language understanding problems including word sense disambiguation, resolution of semantic ambiguities, and attachment of post noun modifiers. The use of min/max values which are usually recorded as part of the process of designing the database schema is proposed as a basis for solving the given problems as they arise in natural language database requests. The min/max values provide a new source of knowledge for resolving ambiguities and a semantics for understanding what knowledge has previously been used by distance measures in database schemas.
DOMINO: A Multifaceted Conceptual Framework for Visual Simulation Modeling
Authors: Emory J Derrick, Osman Balci
Venue:  (1992)

The purpose of this paper is to present a new conceptual framework for visual simulation modeling, the multifaceD coOnceptual fraMework for vIsual simulatioN mOdeling (DOMINO). The DOMINO provides both design and implementation guidance to furnish a broad range of support during the model development life cycle; enables the modeler to work under the object-oriented paradigm; guides the modeler in graphically structuring a visual simulation model at multiple levels of abstraction; enables the extraction of sufficient information from the modeler so that the model execution can be visualized; embodies a WYSIWYR (What You See Is What You Represent) philosophy and enables the modeler to represent a system as it is naturally perceived; among many other features.
j2s: A SUIF Java Compiler
Authors: Holger Kienle, Urs Holzle
Venue:  (1997)

We give a short overview of the Java bytecodeto-SUIF compiler that is c urrently being developed at UCSB. The goal of the compiler is to support the com plete Java language speci,cation, based on SUIF 2.0 and OSUIF. We expect to have a version of the compiler that is ready for release to the public at about the end of ''97.
Visual Homing: Surfing on the Epipoles
Authors: R. Basri, E. Rivlin, I. Shimshoni
Venue:  (1999)

We introduce a novel method for visual homing. Using this method a robot can be sent to desired positions and orientations in 3-D space specified by single images taken from these positions. Our method is based on recovering the epipolar geometry relating the current image taken by the robot and the target image. Using the epipolar geometry, most of the parameters which specify the differences in position and orientation of the camera between the two images are recovered. However, since not all of the parameters can be recovered from two images, we have developed specific methods to bypass these missing parameters and resolve the ambiguities that exist. We present two homing algorithms for two standard projection models, weak and full perspective. Our method determines the path of the robot on-line, the starting position of the robot is relatively not constrained, and a 3-D model of the environment is not required. The method is almost entirely memoryless, in the sense that at every step the path to the target position is determined independently of the previous path taken by the robot. Because of this property the robot may be able, while moving toward the target, to perform auxiliary tasks or to avoid obstacles, without this impairing its ability to eventually reach the target position. We have performed simulations and real experiments which demonstrate the robustness of the method and that the algorithms always converge to the target pose.